\documentclass[12pt]{article}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\usepackage{fullpage,amsmath,amssymb,amsthm,graphicx,color}
\newtheorem{theorem}{Theorem}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{lemma}[theorem]{Lemma}
\usepackage{bm}
\usepackage{pifont}% http://ctan.org/pkg/pifont
\newcommand{\cmark}{\ding{51}}%
\newcommand{\xmark}{\ding{55}}%

\def\NN{\mathbb{N}}
\def\ZZ{\mathbb{Z}}
\def\RR{\mathbb{R}}
\def\QQ{\mathbb{Q}}
\def\CC{\mathbb{C}}
\def\KK{\mathbb{K}}


\def\cA{\mathcal{A}}
\def\cB{\mathcal{B}}
\def\cC{\mathcal{C}}
\def\cF{\mathcal{F}}
\def\cH{\mathcal{H}}
\def\cL{\mathcal{L}}
\def\cN{\mathcal{N}}
\def\cO{\mathcal{O}}
\def\cP{\mathcal{P}}
\def\cR{\mathcal{R}}
\def\cS{\mathcal{S}}

\def\ee{\varepsilon}
\def\ii{\mathfrak{i}}

\newcommand{\mb}[1]{\ensuremath{\mathbf{ #1 }}}
\newcommand{\norm}[1]{\ensuremath{\left\| #1\right\| }}
\newcommand{\enorm}[1]{\ensuremath{|\!|\!| #1|\!|\!| }}

\DeclareMathOperator*{\esssup}{ess\,sup}
\DeclareMathOperator*{\supp}{supp}
\DeclareMathOperator*{\Ker}{Ker}
\DeclareMathOperator*{\Range}{Im}
\DeclareMathOperator*{\spn}{span}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\begin{document}
\noindent
\rule{\textwidth}{0.05cm}
\begin{center}
{{\Large\bf Section 3.1:} \bf A, 2}
\end{center}
\rule[0.2cm]{\textwidth}{0.05cm}

\begin{enumerate}

\item[A.] Let $(X,d)$ be a metric space and $A\subset X$ be a
  non-empty subset.  Recall that $d(x,A)\doteq\inf\{d(x,y):\, y\in
  A\}$.  Theorem 11.1.3 asserts that
  \begin{align*}
    |d(x,A)-d(y,A)|\leq d(x,y)\mbox{ for all } x,y\in A~.
  \end{align*}
  Prove this result.
  
\item[2.] Suppose that $(X,\|\cdot\|)$ is a uniformly convex Banach
  space, and let $Z\subset X$ be a non-empty, closed, convex subset.
  Let $P:X\to Z$ be the projection operator defined in Theorem 3.1.7.
  Show that $P$ is continuous. 
  \textbf{Hint:} Let $(x_n)_{n\in\NN}$ be a sequence converging to
  $x\in X$.  Argue that $\limsup \|x-P(x_n)\|\leq \|x-P(x)\|$ and
  $\liminf \|x-P(x_n)\|\geq \|x-P(x)\|$, and deduce from this that
  $\lim \|x-P(x_n)\|=\|x-P(x)\|$.  You may then ``recycle'' (or cite)
  arguments from the proof of Theorem 3.1.7 to ultimately argue that
  $\lim\|P(x_n)-P(x)\|=0$.
  
\end{enumerate}


\end{document}


