Analysis Ii

2019

• Paper 1, Section II, E

  Analysis II | Part IB, 2019

  Let $A \subset \mathbb{R}^{n}$ be an open subset. State what it means for a function $f: A \rightarrow \mathbb{R}^{m}$ to be differentiable at a point $p \in A$, and define its derivative $D f(p)$.

  State and prove the chain rule for the derivative of $g \circ f$, where $g: \mathbb{R}^{m} \rightarrow \mathbb{R}^{r}$ is a differentiable function.

  Let $M=M_{n}(\mathbb{R})$ be the vector space of $n \times n$ real-valued matrices, and $V \subset M$ the open subset consisting of all invertible ones. Let $f: V \rightarrow V$ be given by $f(A)=A^{-1}$.

  (a) Show that $f$ is differentiable at the identity matrix, and calculate its derivative.

  (b) For $C \in V$, let $l_{C}, r_{C}: M \rightarrow M$ be given by $l_{C}(A)=C A$ and $r_{C}(A)=A C$. Show that $r_{C} \circ f \circ l_{C}=f$ on $V$. Hence or otherwise, show that $f$ is differentiable at any point of $V$, and calculate $D f(C)(h)$ for $h \in M$.

  comment

• Paper 2, Section I, E

  Analysis II | Part IB, 2019

  Consider the map $f: \mathbb{R}^{2} \rightarrow \mathbb{R}^{2}$ given by

  $$f(x, y)=\left(x^{1 / 3}+y^{2}, y^{5}\right)$$

  where $x^{1 / 3}$ denotes the unique real cube root of $x \in \mathbb{R}$.

  (a) At what points is $f$ continuously differentiable? Calculate its derivative there.

  (b) Show that $f$ has a local differentiable inverse near any $(x, y)$ with $x y \neq 0$.

  You should justify your answers, stating accurately any results that you require.

  comment

• Paper 2, Section II, 12E

  Analysis II | Part IB, 2019

  (a) (i) Define what it means for two norms on a vector space to be Lipschitz equivalent.

  (ii) Show that any two norms on a finite-dimensional vector space are Lipschitz equivalent.

  (iii) Show that if two norms $\|\cdot\|,\|\cdot\|^{\prime}$ on a vector space $V$ are Lipschitz equivalent then the following holds: for any sequence $\left(v_{n}\right)$ in $V,\left(v_{n}\right)$ is Cauchy with respect to $\|\cdot\|$ if and only if it is Cauchy with respect to $\|\cdot\|^{\prime}$.

  (b) Let $V$ be the vector space of real sequences $x=\left(x_{i}\right)$ such that $\sum\left|x_{i}\right|<\infty$. Let

  $$\|x\|_{\infty}=\sup \left\{\left|x_{i}\right|: i \in \mathbb{N}\right\},$$

  and for $1 \leqslant p<\infty$, let

  $$\|x\|_{p}=\left(\sum\left|x_{i}\right|^{p}\right)^{1 / p}$$

  You may assume that $\|\cdot\|_{\infty}$ and $\|\cdot\|_{p}$ are well-defined norms on $V$.

  (i) Show that $\|\cdot\|_{p}$ is not Lipschitz equivalent to $\|\cdot\|_{\infty}$ for any $1 \leqslant p<\infty$.

  (ii) Are there any $p, q$ with $1 \leqslant p<q<\infty$ such that $\|\cdot\|_{p}$ and $\|\cdot\|_{q}$ are Lipschitz equivalent? Justify your answer.

  comment

• Paper 3, Section I, $2 E$

  Analysis II | Part IB, 2019

  (a) Let $A \subset \mathbb{R}$. What does it mean for a function $f: A \rightarrow \mathbb{R}$ to be uniformly continuous?

  (b) Which of the following functions are uniformly continuous? Briefly justify your answers.

  (i) $f(x)=x^{2}$ on $\mathbb{R}$.

  (ii) $f(x)=\sqrt{x}$ on $[0, \infty)$.

  (iii) $f(x)=\cos (1 / x)$ on $[1, \infty)$.

  comment

• Paper 3, Section II, E

  Analysis II | Part IB, 2019

  (a) Carefully state the Picard-Lindelöf theorem on solutions to ordinary differential equations.

  (b) Let $X=C\left([1, b], \mathbb{R}^{n}\right)$ be the set of continuous functions from a closed interval $[1, b]$ to $\mathbb{R}^{n}$, and let $\|\cdot\|$ be a norm on $\mathbb{R}^{n}$.

  (i) Let $f \in X$. Show that for any $c \in[0, \infty)$ the norm

  $$\|f\|_{c}=\sup _{t \in[1, b]}\left\|f(t) t^{-c}\right\|$$

  is Lipschitz equivalent to the usual sup norm on $X$.

  (ii) Assume that $F:[1, b] \times \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}$ is continuous and Lipschitz in the second variable, i.e. there exists $M>0$ such that

  $$\|F(t, x)-F(t, y)\| \leqslant M\|x-y\|$$

  for all $t \in[1, b]$ and all $x, y \in \mathbb{R}^{n}$. Define $\varphi: X \rightarrow X$ by

  $$\varphi(f)(t)=\int_{1}^{t} F(l, f(l)) d l$$

  for $t \in[1, b]$.

  Show that there is a choice of $c$ such that $\varphi$ is a contraction on $\left(X,\|\cdot\|_{c}\right)$. Deduce that for any $y_{0} \in \mathbb{R}^{n}$, the differential equation

  $$D f(t)=F(t, f(t))$$

  has a unique solution on $[1, b]$ with $f(1)=y_{0}$.

  comment

• Paper 4, Section I, E

  Analysis II | Part IB, 2019

  Let $A \subset \mathbb{R}$. What does it mean to say that a sequence of real-valued functions on $A$ is uniformly convergent?

  (i) If a sequence $\left(f_{n}\right)$ of real-valued functions on $A$ converges uniformly to $f$, and each $f_{n}$ is continuous, must $f$ also be continuous?

  (ii) Let $f_{n}(x)=e^{-n x}$. Does the sequence $\left(f_{n}\right)$ converge uniformly on $[0,1]$ ?

  (iii) If a sequence $\left(f_{n}\right)$ of real-valued functions on $[-1,1]$ converges uniformly to $f$, and each $f_{n}$ is differentiable, must $f$ also be differentiable?

  Give a proof or counterexample in each case.

  comment

• Paper 4, Section II, E

  Analysis II | Part IB, 2019

  (a) (i) Show that a compact metric space must be complete.

  (ii) If a metric space is complete and bounded, must it be compact? Give a proof or counterexample.

  (b) A metric space $(X, d)$ is said to be totally bounded if for all $\epsilon>0$, there exists $N \in \mathbb{N}$ and $\left\{x_{1}, \ldots, x_{N}\right\} \subset X$ such that $X=\bigcup_{i=1}^{N} B_{\epsilon}\left(x_{i}\right) .$

  (i) Show that a compact metric space is totally bounded.

  (ii) Show that a complete, totally bounded metric space is compact.

  [Hint: If $\left(x_{n}\right)$ is Cauchy, then there is a subsequence $\left(x_{n_{j}}\right)$ such that

  $$\left.\sum_{j} d\left(x_{n_{j+1}}, x_{n_{j}}\right)<\infty .\right]$$

  (iii) Consider the space $C[0,1]$ of continuous functions $f:[0,1] \rightarrow \mathbb{R}$, with the metric

  $$d(f, g)=\min \left\{\int_{0}^{1}|f(t)-g(t)| d t, 1\right\} .$$

  Is this space compact? Justify your answer.

  comment

2018

• Paper 1, Section II, F

  Analysis II | Part IB, 2018

  Let $U \subset \mathbb{R}^{n}$ be a non-empty open set and let $f: U \rightarrow \mathbb{R}^{n}$.

  (a) What does it mean to say that $f$ is differentiable? What does it mean to say that $f$ is a $C^{1}$ function?

  If $f$ is differentiable, show that $f$ is continuous.

  State the inverse function theorem.

  (b) Suppose that $U$ is convex, $f$ is $C^{1}$ and that its derivative $D f(a)$ at a satisfies $\|D f(a)-I\|<1$ for all $a \in U$, where $I: \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}$ is the identity map and $\|\cdot\|$ denotes the operator norm. Show that $f$ is injective.

  Explain why $f(U)$ is an open subset of $\mathbb{R}^{n}$.

  Must it be true that $f(U)=\mathbb{R}^{n}$ ? What if $U=\mathbb{R}^{n}$ ? Give proofs or counter-examples as appropriate.

  (c) Find the largest set $U \subset \mathbb{R}^{2}$ such that the map $f: \mathbb{R}^{2} \rightarrow \mathbb{R}^{2}$ given by $f(x, y)=\left(x^{2}-y^{2}, 2 x y\right)$ satisfies $\|D f(a)-I\|<1$ for every $a \in U$.

  comment

• Paper 2, Section I, F

  Analysis II | Part IB, 2018

  Show that $\|f\|_{1}=\int_{0}^{1}|f(x)| d x$ defines a norm on the space $C([0,1])$ of continuous functions $f:[0,1] \rightarrow \mathbb{R}$.

  Let $\mathcal{S}$ be the set of continuous functions $g:[0,1] \rightarrow \mathbb{R}$ with $g(0)=g(1)=0$. Show that for each continuous function $f:[0,1] \rightarrow \mathbb{R}$, there is a sequence $g_{n} \in \mathcal{S}$ with $\sup _{x \in[0,1]}\left|g_{n}(x)\right| \leqslant \sup _{x \in[0,1]}|f(x)|$ such that $\left\|f-g_{n}\right\|_{1} \rightarrow 0$ as $n \rightarrow \infty$

  Show that if $f:[0,1] \rightarrow \mathbb{R}$ is continuous and $\int_{0}^{1} f(x) g(x) d x=0$ for every $g \in \mathcal{S}$ then $f=0$.

  comment

• Paper 2, Section II, F

  Analysis II | Part IB, 2018

  (a) Let $(X, d)$ be a metric space, $A$ a non-empty subset of $X$ and $f: A \rightarrow \mathbb{R}$. Define what it means for $f$ to be Lipschitz. If $f$ is Lipschitz with Lipschitz constant $L$ and if

  $$F(x)=\inf _{y \in A}(f(y)+L d(x, y))$$

  for each $x \in X$, show that $F(x)=f(x)$ for each $x \in A$ and that $F: X \rightarrow \mathbb{R}$ is Lipschitz with Lipschitz constant $L$. (Be sure to justify that $F(x) \in \mathbb{R}$, i.e. that the infimum is finite for every $x \in X$.)

  (b) What does it mean to say that two norms on a vector space are Lipschitz equivalent?

  Let $V$ be an $n$-dimensional real vector space equipped with a norm $\|$. Let $\left\{e_{1}, e_{2}, \ldots, e_{n}\right\}$ be a basis for $V$. Show that the map $g: \mathbb{R}^{n} \rightarrow \mathbb{R}$ defined by $g\left(x_{1}, x_{2}, \ldots, x_{n}\right)=\left\|x_{1} e_{1}+x_{2} e_{2}+\ldots+x_{n} e_{n}\right\|$ is continuous. Deduce that any two norms on $V$ are Lipschitz equivalent.

  (c) Prove that for each positive integer $n$ and each $a \in(0,1]$, there is a constant $C>0$ with the following property: for every polynomial $p$ of degree $\leqslant n$, there is a point $y \in[0, a]$ such that

  $$\sup _{x \in[0,1]}\left|p^{\prime}(x)\right| \leqslant C|p(y)|$$

  where $p^{\prime}$ is the derivative of $p$.

  comment

• Paper 3, Section I, $2 F$

  Analysis II | Part IB, 2018

  For a continuous function $f=\left(f_{1}, f_{2}, \ldots, f_{m}\right):[0,1] \rightarrow \mathbb{R}^{m}$, define

  $$\int_{0}^{1} f(t) d t=\left(\int_{0}^{1} f_{1}(t) d t, \int_{0}^{1} f_{2}(t) d t, \ldots, \int_{0}^{1} f_{m}(t) d t\right)$$

  Show that

  $$\left\|\int_{0}^{1} f(t) d t\right\|_{2} \leqslant \int_{0}^{1}\|f(t)\|_{2} d t$$

  for every continuous function $f:[0,1] \rightarrow \mathbb{R}^{m}$, where $\|\cdot\|_{2}$ denotes the Euclidean norm on $\mathbb{R}^{m}$.

  Find all continuous functions $f:[0,1] \rightarrow \mathbb{R}^{m}$ with the property that

  $$\left\|\int_{0}^{1} f(t) d t\right\|=\int_{0}^{1}\|f(t)\| d t$$

  regardless of the norm $\|\cdot\|$ on $\mathbb{R}^{m}$.

  [Hint: start by analysing the case when $\|\cdot\|$ is the Euclidean norm $\|\cdot\|_{2}$.]

  comment

• Paper 3, Section II, F

  Analysis II | Part IB, 2018

  (a) Let $A \subset \mathbb{R}^{m}$ and let $f, f_{n}: A \rightarrow \mathbb{R}$ be functions for $n=1,2,3, \ldots$ What does it mean to say that the sequence $\left(f_{n}\right)$ converges uniformly to $f$ on $A$ ? What does it mean to say that $f$ is uniformly continuous?

  (b) Let $f: \mathbb{R} \rightarrow \mathbb{R}$ be a uniformly continuous function. Determine whether each of the following statements is true or false. Give reasons for your answers.

  (i) If $f_{n}(x)=f(x+1 / n)$ for each $n=1,2,3, \ldots$ and each $x \in \mathbb{R}$, then $f_{n} \rightarrow f$ uniformly on $\mathbb{R}$.

  (ii) If $g_{n}(x)=(f(x+1 / n))^{2}$ for each $n=1,2,3, \ldots$ and each $x \in \mathbb{R}$, then $g_{n} \rightarrow(f)^{2}$ uniformly on $\mathbb{R}$.

  (c) Let $A$ be a closed, bounded subset of $\mathbb{R}^{m}$. For each $n=1,2,3, \ldots$, let $g_{n}: A \rightarrow \mathbb{R}$ be a continuous function such that $\left(g_{n}(x)\right)$ is a decreasing sequence for each $x \in A$. If $\delta \in \mathbb{R}$ is such that for each $n$ there is $x_{n} \in A$ with $g_{n}\left(x_{n}\right) \geqslant \delta$, show that there is $x_{0} \in A$ such that $\lim _{n \rightarrow \infty} g_{n}\left(x_{0}\right) \geqslant \delta$.

  Deduce the following: If $f_{n}: A \rightarrow \mathbb{R}$ is a continuous function for each $n=1,2,3, \ldots$ such that $\left(f_{n}(x)\right)$ is a decreasing sequence for each $x \in A$, and if the pointwise limit of $\left(f_{n}\right)$ is a continuous function $f: A \rightarrow \mathbb{R}$, then $f_{n} \rightarrow f$ uniformly on $A$.

  comment

• Paper 4, Section I, F

  Analysis II | Part IB, 2018

  State the Bolzano-Weierstrass theorem in $\mathbb{R}$. Use it to deduce the BolzanoWeierstrass theorem in $\mathbb{R}^{n}$.

  Let $D$ be a closed, bounded subset of $\mathbb{R}^{n}$, and let $f: D \rightarrow \mathbb{R}$ be a function. Let $\mathcal{S}$ be the set of points in $D$ where $f$ is discontinuous. For $\rho>0$ and $z \in \mathbb{R}^{n}$, let $B_{\rho}(z)$ denote the ball $\left\{x \in \mathbb{R}^{n}:\|x-z\|<\rho\right\}$. Prove that for every $\epsilon>0$, there exists $\delta>0$ such that $|f(x)-f(y)|<\epsilon$ whenever $x \in D, y \in D \backslash \cup_{z \in \mathcal{S}} B_{\epsilon}(z)$ and $\|x-y\|<\delta$.

  (If you use the fact that a continuous function on a compact metric space is uniformly continuous, you must prove it.)

  comment

• Paper 4, Section II, F

  Analysis II | Part IB, 2018

  (a) Define what it means for a metric space $(X, d)$ to be complete. Give a metric $d$ on the interval $I=(0,1]$ such that $(I, d)$ is complete and such that a subset of $I$ is open with respect to $d$ if and only if it is open with respect to the Euclidean metric on $I$. Be sure to prove that $d$ has the required properties.

  (b) Let $(X, d)$ be a complete metric space.

  (i) If $Y \subset X$, show that $Y$ taken with the subspace metric is complete if and only if $Y$ is closed in $X$.

  (ii) Let $f: X \rightarrow X$ and suppose that there is a number $\lambda \in(0,1)$ such that $d(f(x), f(y)) \leqslant \lambda d(x, y)$ for every $x, y \in X$. Show that there is a unique point $x_{0} \in X$ such that $f\left(x_{0}\right)=x_{0}$.

  Deduce that if $\left(a_{n}\right)$ is a sequence of points in $X$ converging to a point $a \neq x_{0}$, then there are integers $\ell$ and $m \geqslant \ell$ such that $f\left(a_{m}\right) \neq a_{n}$ for every $n \geqslant \ell$.

  comment

2017

• Paper 1, Section II, G

  Analysis II | Part IB, 2017

  What does it mean to say that a real-valued function on a metric space is uniformly continuous? Show that a continuous function on a closed interval in $\mathbb{R}$ is uniformly continuous.

  What does it mean to say that a real-valued function on a metric space is Lipschitz? Show that if a function is Lipschitz then it is uniformly continuous.

  Which of the following statements concerning continuous functions $f: \mathbb{R} \rightarrow \mathbb{R}$ are true and which are false? Justify your answers.

  (i) If $f$ is bounded then $f$ is uniformly continuous.

  (ii) If $f$ is differentiable and $f^{\prime}$ is bounded, then $f$ is uniformly continuous.

  (iii) There exists a sequence of uniformly continuous functions converging pointwise to $f$.

  comment

• Paper 2, Section I, G

  Analysis II | Part IB, 2017

  Let $X \subset \mathbb{R}$. What does it mean to say that a sequence of real-valued functions on $X$ is uniformly convergent?

  Let $f, f_{n}(n \geqslant 1): \mathbb{R} \rightarrow \mathbb{R}$ be functions.

  (a) Show that if each $f_{n}$ is continuous, and $\left(f_{n}\right)$ converges uniformly on $\mathbb{R}$ to $f$, then $f$ is also continuous.

  (b) Suppose that, for every $M>0,\left(f_{n}\right)$ converges uniformly on $[-M, M]$. Need $\left(f_{n}\right)$ converge uniformly on $\mathbb{R}$ ? Justify your answer.

  comment

• Paper 2, Section II, G

  Analysis II | Part IB, 2017

  Let $V$ be a real vector space. What is a norm on $V$ ? Show that if $\|-\|$ is a norm on $V$, then the maps $T_{v}: x \mapsto x+v\left(\right.$ for $v \in V$ ) and $m_{a}: x \mapsto a x$ (for $a \in \mathbb{R}$ ) are continuous with respect to the norm.

  Let $B \subset V$ be a subset containing 0 . Show that there exists at most one norm on $V$ for which $B$ is the open unit ball.

  Suppose that $B$ satisfies the following two properties:

  • if $v \in V$ is a nonzero vector, then the line $\mathbb{R} v \subset V$ meets $B$ in a set of the form $\{t v:-\lambda<t<\lambda\}$ for some $\lambda>0$;

  • if $x, y \in B$ and $s, t>0$ then $(s+t)^{-1}(s x+t y) \in B$.

  Show that there exists a norm $\|-\|_{B}$ for which $B$ is the open unit ball.

  Identify $\|-\|_{B}$ in the following two cases:

  (i) $V=\mathbb{R}^{n}, B=\left\{\left(x_{1}, \ldots, x_{n}\right) \in \mathbb{R}^{n}:-1<x_{i}<1\right.$ for all $\left.i\right\}$.

  (ii) $V=\mathbb{R}^{2}, B$ the interior of the square with vertices $(\pm 1,0),(0, \pm 1)$.

  Let $C \subset \mathbb{R}^{2}$ be the set

  $$C=\left\{\left(x_{1}, x_{2}\right) \in \mathbb{R}^{2}:\left|x_{1}\right|<1,\left|x_{2}\right|<1, \text { and }\left(\left|x_{1}\right|-1\right)^{2}+\left(\left|x_{2}\right|-1\right)^{2}>1\right\}$$

  Is there a norm on $\mathbb{R}^{2}$ for which $C$ is the open unit ball? Justify your answer.

  comment

• Paper 3, Section I, G

  Analysis II | Part IB, 2017

  What does it mean to say that a metric space is complete? Which of the following metric spaces are complete? Briefly justify your answers.

  (i) $[0,1]$ with the Euclidean metric.

  (ii) $\mathbb{Q}$ with the Euclidean metric.

  (iii) The subset

  $$\{(0,0)\} \cup\{(x, \sin (1 / x)) \mid x>0\} \subset \mathbb{R}^{2}$$

  with the metric induced from the Euclidean metric on $\mathbb{R}^{2}$.

  Write down a metric on $\mathbb{R}$ with respect to which $\mathbb{R}$ is not complete, justifying your answer.

  [You may assume throughout that $\mathbb{R}$ is complete with respect to the Euclidean metric.

  comment

• Paper 3, Section II, G

  Analysis II | Part IB, 2017

  What is a contraction map on a metric space $X$ ? State and prove the contraction mapping theorem.

  Let $(X, d)$ be a complete non-empty metric space. Show that if $f: X \rightarrow X$ is a map for which some iterate $f^{k}(k \geqslant 1)$ is a contraction map, then $f$ has a unique fixed point. Show that $f$ itself need not be a contraction map.

  Let $f:[0, \infty) \rightarrow[0, \infty)$ be the function

  $$f(x)=\frac{1}{3}\left(x+\sin x+\frac{1}{x+1}\right)$$

  Show that $f$ has a unique fixed point.

  comment

• Paper 4, Section I, G

  Analysis II | Part IB, 2017

  State the chain rule for the composition of two differentiable functions $f: \mathbb{R}^{m} \rightarrow \mathbb{R}^{n}$ and $g: \mathbb{R}^{n} \rightarrow \mathbb{R}^{p}$.

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be differentiable. For $c \in \mathbb{R}$, let $g(x)=f(x, c-x)$. Compute the derivative of $g$. Show that if $\partial f / \partial x=\partial f / \partial y$ throughout $\mathbb{R}^{2}$, then $f(x, y)=h(x+y)$ for some function $h: \mathbb{R} \rightarrow \mathbb{R}$.

  comment

• Paper 4, Section II, G

  Analysis II | Part IB, 2017

  Let $U \subset \mathbb{R}^{m}$ be a nonempty open set. What does it mean to say that a function $f: U \rightarrow \mathbb{R}^{n}$ is differentiable?

  Let $f: U \rightarrow \mathbb{R}$ be a function, where $U \subset \mathbb{R}^{2}$ is open. Show that if the first partial derivatives of $f$ exist and are continuous on $U$, then $f$ is differentiable on $U$.

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be the function

  $$f(x, y)= \begin{cases}0 & (x, y)=(0,0) \\ \frac{x^{3}+2 y^{4}}{x^{2}+y^{2}} & (x, y) \neq(0,0)\end{cases}$$

  Determine, with proof, where $f$ is differentiable.

  comment

2016

• Paper 1, Section II, G

  Analysis II | Part IB, 2016

  Let $(X, d)$ be a metric space.

  (a) What does it mean to say that $\left(x_{n}\right)_{n}$ is a Cauchy sequence in $X$ ? Show that if $\left(x_{n}\right)_{n}$ is a Cauchy sequence, then it converges if it contains a convergent subsequence.

  (b) Let $\left(x_{n}\right)_{n}$ be a Cauchy sequence in $X$.

  (i) Show that for every $m \geqslant 1$, the sequence $\left(d\left(x_{m}, x_{n}\right)\right)_{n}$ converges to some $d_{m} \in \mathbb{R}$.

  (ii) Show that $d_{m} \rightarrow 0$ as $m \rightarrow \infty$.

  (iii) Let $\left(y_{n}\right)_{n}$ be a subsequence of $\left(x_{n}\right)_{n}$. If $\ell, m$ are such that $y_{\ell}=x_{m}$, show that $d\left(y_{\ell}, y_{n}\right) \rightarrow d_{m}$ as $n \rightarrow \infty$.

  (iv) Show also that for every $m$ and $n$,

  $$d_{m}-d_{n} \leqslant d\left(x_{m}, x_{n}\right) \leqslant d_{m}+d_{n}$$

  (v) Deduce that $\left(x_{n}\right)_{n}$ has a subsequence $\left(y_{n}\right)_{n}$ such that for every $m$ and $n$,

  $$d\left(y_{m+1}, y_{m}\right) \leqslant \frac{1}{3} d\left(y_{m}, y_{m-1}\right)$$

  and

  $$d\left(y_{m+1}, y_{n+1}\right) \leqslant \frac{1}{2} d\left(y_{m}, y_{n}\right)$$

  (c) Suppose that every closed subset $Y$ of $X$ has the property that every contraction mapping $Y \rightarrow Y$ has a fixed point. Prove that $X$ is complete.

  comment

• Paper 2, Section I, G

  Analysis II | Part IB, 2016

  (a) What does it mean to say that the function $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$ is differentiable at the point $x=\left(x_{1}, x_{2}, \ldots, x_{n}\right) \in \mathbb{R}^{n}$ ? Show from your definition that if $f$ is differentiable at $x$, then $f$ is continuous at $x$.

  (b) Suppose that there are functions $g_{j}: \mathbb{R} \rightarrow \mathbb{R}^{m}(1 \leqslant j \leqslant n)$ such that for every $x=\left(x_{1}, \ldots, x_{n}\right) \in \mathbb{R}^{n}$,

  $$f(x)=\sum_{j=1}^{n} g_{j}\left(x_{j}\right) .$$

  Show that $f$ is differentiable at $x$ if and only if each $g_{j}$ is differentiable at $x_{j}$.

  (c) Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be given by

  $$f(x, y)=|x|^{3 / 2}+|y|^{1 / 2}$$

  Determine at which points $(x, y) \in \mathbb{R}^{2}$ the function $f$ is differentiable.

  comment

• Paper 2, Section II, G

  Analysis II | Part IB, 2016

  (a) What is a norm on a real vector space?

  (b) Let $L\left(\mathbb{R}^{m}, \mathbb{R}^{n}\right)$ be the space of linear maps from $\mathbb{R}^{m}$ to $\mathbb{R}^{n}$. Show that

  $$\|A\|=\sup _{0 \neq x \in \mathbb{R}^{m}} \frac{\|A x\|}{\|x\|}, \quad A \in L\left(\mathbb{R}^{m}, \mathbb{R}^{n}\right),$$

  defines a norm on $L\left(\mathbb{R}^{m}, \mathbb{R}^{n}\right)$, and that if $B \in L\left(\mathbb{R}^{\ell}, \mathbb{R}^{m}\right)$ then $\|A B\| \leqslant\|A\|\|B\|$.

  (c) Let $M_{n}$ be the space of $n \times n$ real matrices, identified with $L\left(\mathbb{R}^{n}, \mathbb{R}^{n}\right)$ in the usual way. Let $U \subset M_{n}$ be the subset

  $$U=\left\{X \in M_{n} \mid I-X \text { is invertible }\right\}$$

  Show that $U$ is an open subset of $M_{n}$ which contains the set $V=\left\{X \in M_{n} \mid\|X\|<1\right\}$.

  (d) Let $f: U \rightarrow M_{n}$ be the map $f(X)=(I-X)^{-1}$. Show carefully that the series $\sum_{k=0}^{\infty} X^{k}$ converges on $V$ to $f(X)$. Hence or otherwise, show that $f$ is twice differentiable at 0 , and compute its first and second derivatives there.

  comment

• Paper 3, Section I, G

  Analysis II | Part IB, 2016

  (a) Let $X$ be a subset of $\mathbb{R}$. What does it mean to say that a sequence of functions $f_{n}: X \rightarrow \mathbb{R}(n \in \mathbb{N})$ is uniformly convergent?

  (b) Which of the following sequences of functions are uniformly convergent? Justify your answers.

  (i) $f_{n}:(0,1) \rightarrow \mathbb{R}, \quad f_{n}(x)=\frac{1-x^{n}}{1-x}$

  (ii) $f_{n}:(0,1) \rightarrow \mathbb{R}, \quad f_{n}(x)=\sum_{k=1}^{n} \frac{1}{k^{2}} x^{k}$.

  (iii) $f_{n}: \mathbb{R} \rightarrow \mathbb{R}$, $\quad f_{n}(x)=x / n$.

  (iv) $f_{n}:[0, \infty) \rightarrow \mathbb{R}, \quad f_{n}(x)=x e^{-n x}$.

  comment

• Paper 3, Section II, G

  Analysis II | Part IB, 2016

  Let $X$ be a metric space.

  (a) What does it mean to say that a function $f: X \rightarrow \mathbb{R}$ is uniformly continuous? What does it mean to say that $f$ is Lipschitz? Show that if $f$ is Lipschitz then it is uniformly continuous. Show also that if $\left(x_{n}\right)_{n}$ is a Cauchy sequence in $X$, and $f$ is uniformly continuous, then the sequence $\left(f\left(x_{n}\right)\right)_{n}$ is convergent.

  (b) Let $f: X \rightarrow \mathbb{R}$ be continuous, and $X$ be sequentially compact. Show that $f$ is uniformly continuous. Is $f$ necessarily Lipschitz? Justify your answer.

  (c) Let $Y$ be a dense subset of $X$, and let $g: Y \rightarrow \mathbb{R}$ be a continuous function. Show that there exists at most one continuous function $f: X \rightarrow \mathbb{R}$ such that for all $y \in Y$, $f(y)=g(y)$. Prove that if $g$ is uniformly continuous, then such a function $f$ exists, and is uniformly continuous.

  [A subset $Y \subset X$ is dense if for any nonempty open subset $U \subset X$, the intersection $U \cap Y$ is nonempty.]

  comment

• Paper 4, Section I, G

  Analysis II | Part IB, 2016

  (a) What does it mean to say that a mapping $f: X \rightarrow X$ from a metric space to itself is a contraction?

  (b) State carefully the contraction mapping theorem.

  (c) Let $\left(a_{1}, a_{2}, a_{3}\right) \in \mathbb{R}^{3}$. By considering the metric space $\left(\mathbb{R}^{3}, d\right)$ with

  $$d(x, y)=\sum_{i=1}^{3}\left|x_{i}-y_{i}\right|$$

  or otherwise, show that there exists a unique solution $\left(x_{1}, x_{2}, x_{3}\right) \in \mathbb{R}^{3}$ of the system of equations

  $$\begin{aligned} &x_{1}=a_{1}+\frac{1}{6}\left(\sin x_{2}+\sin x_{3}\right), \\ &x_{2}=a_{2}+\frac{1}{6}\left(\sin x_{1}+\sin x_{3}\right), \\ &x_{3}=a_{3}+\frac{1}{6}\left(\sin x_{1}+\sin x_{2}\right) . \end{aligned}$$

  comment

• Paper 4, Section II, G

  Analysis II | Part IB, 2016

  (a) Let $V$ be a real vector space. What does it mean to say that two norms on $V$ are Lipschitz equivalent? Prove that every norm on $\mathbb{R}^{n}$ is Lipschitz equivalent to the Euclidean norm. Hence or otherwise, show that any linear map from $\mathbb{R}^{n}$ to $\mathbb{R}^{m}$ is continuous.

  (b) Let $f: U \rightarrow V$ be a linear map between normed real vector spaces. We say that $f$ is bounded if there exists a constant $C$ such that for all $u \in U,\|f(u)\| \leqslant C\|u\|$. Show that $f$ is bounded if and only if $f$ is continuous.

  (c) Let $\ell^{2}$ denote the space of sequences $\left(x_{n}\right)_{n \geqslant 1}$ of real numbers such that $\sum_{n \geqslant 1} x_{n}^{2}$ is convergent, with the norm $\left\|\left(x_{n}\right)_{n}\right\|=\left(\sum_{n \geqslant 1} x_{n}^{2}\right)^{1 / 2}$. Let $e_{m} \in \ell^{2}$ be the sequence $e_{m}=\left(x_{n}\right)_{n}$ with $x_{m}=1$ and $x_{n}=0$ if $n \neq m$. Let $w$ be the sequence $\left(2^{-n}\right)_{n}$. Show that the subset $\{w\} \cup\left\{e_{m} \mid m \geqslant 1\right\}$ is linearly independent. Let $V \subset \ell^{2}$ be the subspace it spans, and consider the linear map $f: V \rightarrow \mathbb{R}$ defined by

  $$f(w)=1, \quad f\left(e_{m}\right)=0 \quad \text { for all } m \geqslant 1 .$$

  Is $f$ continuous? Justify your answer.

  comment

2015

• Paper 1, Section II, G

  Analysis II | Part IB, 2015

  Define what it means for a sequence of functions $f_{n}:[0,1] \rightarrow \mathbb{R}$ to converge uniformly on $[0,1]$ to a function $f$.

  Let $f_{n}(x)=n^{p} x e^{-n^{q} x}$, where $p, q$ are positive constants. Determine all the values of $(p, q)$ for which $f_{n}(x)$ converges pointwise on $[0,1]$. Determine all the values of $(p, q)$ for which $f_{n}(x)$ converges uniformly on $[0,1]$.

  Let now $f_{n}(x)=e^{-n x^{2}}$. Determine whether or not $f_{n}$ converges uniformly on $[0,1]$.

  Let $f:[0,1] \rightarrow \mathbb{R}$ be a continuous function. Show that the sequence $x^{n} f(x)$ is uniformly convergent on $[0,1]$ if and only if $f(1)=0$.

  [If you use any theorems about uniform convergence, you should prove these.]

  comment

• Paper 2, Section I, G

  Analysis II | Part IB, 2015

  Show that the map $f: \mathbb{R}^{3} \rightarrow \mathbb{R}^{3}$ given by

  $$f(x, y, z)=\left(x-y-z, x^{2}+y^{2}+z^{2}, x y z\right)$$

  is differentiable everywhere and find its derivative.

  Stating accurately any theorem that you require, show that $f$ has a differentiable local inverse at a point $(x, y, z)$ if and only if

  $$(x+y)(x+z)(y-z) \neq 0 .$$

  $$\begin{aligned} & p(f)=\sup |f|, \quad q(f)=\sup \left(|f|+\left|f^{\prime}\right|\right), \\ & r(f)=\sup \left|f^{\prime}\right|, \quad s(f)=\left|\int_{-1}^{1} f(x) d x\right| \end{aligned}$$

  comment

• Paper 2, Section II, G

  Analysis II | Part IB, 2015

  Let $E, F$ be normed spaces with norms $\|\cdot\|_{E},\|\cdot\|_{F}$. Show that for a map $f: E \rightarrow F$ and $a \in E$, the following two statements are equivalent:

  (i) For every given $\varepsilon>0$ there exists $\delta>0$ such that $\|f(x)-f(a)\|_{F}<\varepsilon$ whenever $\|x-a\|_{E}<\delta$

  (ii) $f\left(x_{n}\right) \rightarrow f(a)$ for each sequence $x_{n} \rightarrow a$.

  We say that $f$ is continuous at $a$ if (i), or equivalently (ii), holds.

  Let now $\left(E,\|\cdot\|_{E}\right)$ be a normed space. Let $A \subset E$ be a non-empty closed subset and define $d(x, A)=\inf \left\{\|x-a\|_{E}: a \in A\right\}$. Show that

  $$|d(x, A)-d(y, A)| \leqslant\|x-y\|_{E} \text { for all } x, y \in E .$$

  In the case when $E=\mathbb{R}^{n}$ with the standard Euclidean norm, show that there exists $a \in A$ such that $d(x, A)=\|x-a\|$.

  Let $A, B$ be two disjoint closed sets in $\mathbb{R}^{n}$. Must there exist disjoint open sets $U, V$ such that $A \subset U$ and $B \subset V$ ? Must there exist $a \in A$ and $b \in B$ such that $d(a, b) \leqslant d(x, y)$ for all $x \in A$ and $y \in B$ ? For each answer, give a proof or counterexample as appropriate.

  comment

• Paper 3, Section I, G

  Analysis II | Part IB, 2015

  Define what is meant by a uniformly continuous function $f$ on a subset $E$ of a metric space. Show that every continuous function on a closed, bounded interval is uniformly continuous. [You may assume the Bolzano-Weierstrass theorem.]

  Suppose that a function $g:[0, \infty) \rightarrow \mathbb{R}$ is continuous and tends to a finite limit at $\infty$. Is $g$ necessarily uniformly continuous on $[0, \infty) ?$ Give a proof or a counterexample as appropriate.

  comment

• Paper 3, Section II, G

  Analysis II | Part IB, 2015

  Define what it means for a function $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$ to be differentiable at $x \in \mathbb{R}^{n}$ with derivative $D f(x)$.

  State and prove the chain rule for the derivative of $g \circ f$, where $g: \mathbb{R}^{m} \rightarrow \mathbb{R}^{p}$ is a differentiable function.

  Now let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be a differentiable function and let $g(x)=f(x, c-x)$ where $c$ is a constant. Show that $g$ is differentiable and find its derivative in terms of the partial derivatives of $f$. Show that if $D_{1} f(x, y)=D_{2} f(x, y)$ holds everywhere in $\mathbb{R}^{2}$, then $f(x, y)=h(x+y)$ for some differentiable function $h .$

  comment

• Paper 4, Section I, G

  Analysis II | Part IB, 2015

  Define what is meant for two norms on a vector space to be Lipschitz equivalent.

  Let $C_{c}^{1}([-1,1])$ denote the vector space of continuous functions $f:[-1,1] \rightarrow \mathbb{R}$ with continuous first derivatives and such that $f(x)=0$ for $x$ in some neighbourhood of the end-points $-1$ and 1 . Which of the following four functions $C_{c}^{1}([-1,1]) \rightarrow \mathbb{R}$ define norms on $C_{c}^{1}([-1,1])$ (give a brief explanation)?

  Among those that define norms, which pairs are Lipschitz equivalent? Justify your answer.

  comment

• Paper 4, Section II, G

  Analysis II | Part IB, 2015

  Consider the space $\ell^{\infty}$ of bounded real sequences $x=\left(x_{i}\right)_{i=1}^{\infty}$ with the norm $\|x\|_{\infty}=\sup _{i}\left|x_{i}\right|$. Show that for every bounded sequence $x^{(n)}$ in $\ell^{\infty}$ there is a subsequence $x^{\left(n_{j}\right)}$ which converges in every coordinate, i.e. the sequence $\left(x_{i}^{\left(n_{j}\right)}\right)_{j=1}^{\infty}$ of real numbers converges for each $i$. Does every bounded sequence in $\ell^{\infty}$ have a convergent subsequence? Justify your answer.

  Let $\ell^{1} \subset \ell^{\infty}$ be the subspace of real sequences $x=\left(x_{i}\right)_{i=1}^{\infty}$ such that $\sum_{i=1}^{\infty}\left|x_{i}\right|$ converges. Is $\ell^{1}$ complete in the norm $\|\cdot\|_{\infty}$ (restricted from $\ell^{\infty}$ to $\left.\ell^{1}\right)$ ? Justify your answer.

  Suppose that $\left(x_{i}\right)$ is a real sequence such that, for every $\left(y_{i}\right) \in \ell^{\infty}$, the series $\sum_{i=1}^{\infty} x_{i} y_{i}$ converges. Show that $\left(x_{i}\right) \in \ell^{1} .$

  Suppose now that $\left(x_{i}\right)$ is a real sequence such that, for every $\left(y_{i}\right) \in \ell^{1}$, the series $\sum_{i=1}^{\infty} x_{i} y_{i}$ converges. Show that $\left(x_{i}\right) \in \ell^{\infty} .$

  comment

2014

• Paper 1, Section II, F

  Analysis II | Part IB, 2014

  Define what it means for two norms on a real vector space $V$ to be Lipschitz equivalent. Show that if two norms on $V$ are Lipschitz equivalent and $F \subset V$, then $F$ is closed in one norm if and only if $F$ is closed in the other norm.

  Show that if $V$ is finite-dimensional, then any two norms on $V$ are Lipschitz equivalent.

  Show that $\|f\|_{1}=\int_{0}^{1}|f(x)| d x$ is a norm on the space $C[0,1]$ of continuous realvalued functions on $[0,1]$. Is the set $S=\{f \in C[0,1]: f(1 / 2)=0\}$ closed in the norm $\|\cdot\| 1$ ?

  Determine whether or not the norm $\|\cdot\|_{1}$ is Lipschitz equivalent to the uniform $\operatorname{norm}\|\cdot\|_{\infty}$ on $C[0,1]$.

  [You may assume the Bolzano-Weierstrass theorem for sequences in $\mathbb{R}^{n}$.]

  comment

• Paper 2, Section I, F

  Analysis II | Part IB, 2014

  Define what is meant by a uniformly continuous function on a set $E \subset \mathbb{R}$.

  If $f$ and $g$ are uniformly continuous functions on $\mathbb{R}$, is the (pointwise) product $f g$ necessarily uniformly continuous on $\mathbb{R}$ ?

  Is a uniformly continuous function on $(0,1)$ necessarily bounded?

  Is $\cos (1 / x)$ uniformly continuous on $(0,1) ?$

  Justify your answers.

  comment

• Paper 2, Section II, $12 \mathrm{~F}$

  Analysis II | Part IB, 2014

  Let $X, Y$ be subsets of $\mathbb{R}^{n}$ and define $X+Y=\{x+y: x \in X, y \in Y\}$. For each of the following statements give a proof or a counterexample (with justification) as appropriate.

  (i) If each of $X, Y$ is bounded and closed, then $X+Y$ is bounded and closed.

  (ii) If $X$ is bounded and closed and $Y$ is closed, then $X+Y$ is closed.

  (iii) If $X, Y$ are both closed, then $X+Y$ is closed.

  (iv) If $X$ is open and $Y$ is closed, then $X+Y$ is open.

  [The Bolzano-Weierstrass theorem in $\mathbb{R}^{n}$ may be assumed without proof.]

  comment

• Paper 3, Section I, F

  Analysis II | Part IB, 2014

  Let $U \subset \mathbb{R}^{n}$ be an open set and let $f: U \rightarrow \mathbb{R}$ be a differentiable function on $U$ such that $\left\|\left.D f\right|_{x}\right\| \leqslant M$ for some constant $M$ and all $x \in U$, where $\left\|\left.D f\right|_{x}\right\|$ denotes the operator norm of the linear map $\left.D f\right|_{x}$. Let $[a, b]=\{t a+(1-t) b: 0 \leqslant t \leqslant 1\}\left(a, b, \in \mathbb{R}^{n}\right)$ be a straight-line segment contained in $U$. Prove that $|f(b)-f(a)| \leqslant M\|b-a\|$, where $\|\cdot\|$ denotes the Euclidean norm on $\mathbb{R}^{n}$.

  Prove that if $U$ is an open ball and $\left.D f\right|_{x}=0$ for each $x \in U$, then $f$ is constant on $U$.

  comment

• Paper 3, Section II, F

  Analysis II | Part IB, 2014

  Let $f_{n}, n=1,2, \ldots$, be continuous functions on an open interval $(a, b)$. Prove that if the sequence $\left(f_{n}\right)$ converges to $f$ uniformly on $(a, b)$ then the function $f$ is continuous on $(a, b)$.

  If instead $\left(f_{n}\right)$ is only known to converge pointwise to $f$ and $f$ is continuous, must $\left(f_{n}\right)$ be uniformly convergent? Justify your answer.

  Suppose that a function $f$ has a continuous derivative on $(a, b)$ and let

  $$g_{n}(x)=n\left(f\left(x+\frac{1}{n}\right)-f(x)\right)$$

  Stating clearly any standard results that you require, show that the functions $g_{n}$ converge uniformly to $f^{\prime}$ on each interval $[\alpha, \beta] \subset(a, b)$.

  comment

• Paper 4, Section I, F

  Analysis II | Part IB, 2014

  Define a contraction mapping and state the contraction mapping theorem.

  Let $C[0,1]$ be the space of continuous real-valued functions on $[0,1]$ endowed with the uniform norm. Show that the map $A: C[0,1] \rightarrow C[0,1]$ defined by

  $$A f(x)=\int_{0}^{x} f(t) d t$$

  is not a contraction mapping, but that $A \circ A$ is.

  comment

• Paper 4, Section II, F

  Analysis II | Part IB, 2014

  Let $U \subset \mathbb{R}^{2}$ be an open set. Define what it means for a function $f: U \rightarrow \mathbb{R}$ to be differentiable at a point $\left(x_{0}, y_{0}\right) \in U$.

  Prove that if the partial derivatives $D_{1} f$ and $D_{2} f$ exist on $U$ and are continuous at $\left(x_{0}, y_{0}\right)$, then $f$ is differentiable at $\left(x_{0}, y_{0}\right)$.

  If $f$ is differentiable on $U$ must $D_{1} f, D_{2} f$ be continuous at $\left(x_{0}, y_{0}\right) ?$ Give a proof or counterexample as appropriate.

  The function $h: \mathbb{R}^{2} \rightarrow \mathbb{R}$ is defined by

  $$h(x, y)=x y \sin (1 / x) \quad \text { for } x \neq 0, \quad h(0, y)=0$$

  Determine all the points $(x, y)$ at which $h$ is differentiable.

  comment

2013

• Paper 1, Section II, F

  Analysis II | Part IB, 2013

  Define what it means for a sequence of functions $k_{n}: A \rightarrow \mathbb{R}, n=1,2, \ldots$, to converge uniformly on an interval $A \subset \mathbb{R}$.

  By considering the functions $k_{n}(x)=\frac{\sin (n x)}{\sqrt{n}}$, or otherwise, show that uniform convergence of a sequence of differentiable functions does not imply uniform convergence of their derivatives.

  Now suppose $k_{n}(x)$ is continuously differentiable on $A$ for each $n$, that $k_{n}\left(x_{0}\right)$ converges as $n \rightarrow \infty$ for some $x_{0} \in A$, and moreover that the derivatives $k_{n}^{\prime}(x)$ converge uniformly on $A$. Prove that $k_{n}(x)$ converges to a continuously differentiable function $k(x)$ on $A$, and that

  $$k^{\prime}(x)=\lim _{n \rightarrow \infty} k_{n}^{\prime}(x)$$

  Hence, or otherwise, prove that the function

  $$\sum_{n=1}^{\infty} \frac{x^{n} \sin (n x)}{n^{3}+1}$$

  is continuously differentiable on $(-1,1)$.

  comment

• Paper 2, Section I, F

  Analysis II | Part IB, 2013

  Let $\mathcal{C}[a, b]$ denote the vector space of continuous real-valued functions on the interval $[a, b]$, and let $\mathcal{C}^{\prime}[a, b]$ denote the subspace of continuously differentiable functions.

  Show that $\|f\|_{1}=\max |f|+\max \left|f^{\prime}\right|$ defines a norm on $\mathcal{C}^{\prime}[a, b]$. Show furthermore that the map $\Phi: f \mapsto f^{\prime}((a+b) / 2)$ takes the closed unit ball $\left\{\|f\|_{1} \leqslant 1\right\} \subset \mathcal{C}^{\prime}[a, b]$ to a bounded subset of $\mathbb{R}$.

  If instead we had used the norm $\|f\|_{0}=\max |f|$ restricted from $\mathcal{C}[a, b]$ to $\mathcal{C}^{\prime}[a, b]$, would $\Phi$ take the closed unit ball $\left\{\|f\|_{0} \leqslant 1\right\} \subset \mathcal{C}^{\prime}[a, b]$ to a bounded subset of $\mathbb{R}$ ? Justify your answer.

  comment

• Paper 2, Section II, F

  Analysis II | Part IB, 2013

  Let $f: U \rightarrow \mathbb{R}$ be continuous on an open set $U \subset \mathbb{R}^{2}$. Suppose that on $U$ the partial derivatives $D_{1} f, D_{2} f, D_{1} D_{2} f$ and $D_{2} D_{1} f$ exist and are continuous. Prove that $D_{1} D_{2} f=D_{2} D_{1} f$ on $U$.

  If $f$ is infinitely differentiable, and $m \in \mathbb{N}$, what is the maximum number of distinct $m$-th order partial derivatives that $f$ may have on $U$ ?

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be defined by

  $$f(x, y)= \begin{cases}\frac{x^{2} y^{2}}{x^{4}+y^{4}} & (x, y) \neq(0,0) \\ 0 & (x, y)=(0,0)\end{cases}$$

  Let $g: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be defined by

  $$g(x, y)= \begin{cases}\frac{x y\left(x^{4}-y^{4}\right)}{x^{4}+y^{4}} & (x, y) \neq(0,0) \\ 0 & (x, y)=(0,0)\end{cases}$$

  For each of $f$ and $g$, determine whether they are (i) differentiable, (ii) infinitely differentiable at the origin. Briefly justify your answers.

  comment

• Paper 3, Section I, $2 F$

  Analysis II | Part IB, 2013

  For each of the following sequences of functions on $[0,1]$, indexed by $n=1,2, \ldots$, determine whether or not the sequence has a pointwise limit, and if so, determine whether or not the convergence to the pointwise limit is uniform.

  1. $f_{n}(x)=1 /\left(1+n^{2} x^{2}\right)$

  2. $g_{n}(x)=n x(1-x)^{n}$

  3. $h_{n}(x)=\sqrt{n} x(1-x)^{n}$

  comment

• Paper 3, Section II, F

  Analysis II | Part IB, 2013

  For each of the following statements, provide a proof or justify a counterexample.

  1. The norms $\|x\|_{1}=\sum_{i=1}^{n}\left|x_{i}\right|$ and $\|x\|_{\infty}=\max _{1 \leqslant i \leqslant n}\left|x_{i}\right|$ on $\mathbb{R}^{n}$ are Lipschitz equivalent.

  2. The norms $\|x\|_{1}=\sum_{i=1}^{\infty}\left|x_{i}\right|$ and $\|x\|_{\infty}=\max _{i}\left|x_{i}\right|$ on the vector space of sequences $\left(x_{i}\right)_{i \geqslant 1}$ with $\sum\left|x_{i}\right|<\infty$ are Lipschitz equivalent.

  3. Given a linear function $\phi: V \rightarrow W$ between normed real vector spaces, there is some $N$ for which $\|\phi(x)\| \leqslant N$ for every $x \in V$ with $\|x\| \leqslant 1$.

  4. Given a linear function $\phi: V \rightarrow W$ between normed real vector spaces for which there is some $N$ for which $\|\phi(x)\| \leqslant N$ for every $x \in V$ with $\|x\| \leqslant 1$, then $\phi$ is continuous.

  5. The uniform norm $\|f\|=\sup _{x \in \mathbb{R}}|f(x)|$ is complete on the vector space of continuous real-valued functions $f$ on $\mathbb{R}$ for which $f(x)=0$ for $|x|$ sufficiently large.

  6. The uniform norm $\|f\|=\sup _{x \in \mathbb{R}}|f(x)|$ is complete on the vector space of continuous real-valued functions $f$ on $\mathbb{R}$ which are bounded.

  comment

• Paper 4, Section I, $3 F$

  Analysis II | Part IB, 2013

  State and prove the chain rule for differentiable mappings $F: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$ and $G: \mathbb{R}^{m} \rightarrow \mathbb{R}^{k}$.

  Suppose now $F: \mathbb{R}^{2} \rightarrow \mathbb{R}^{2}$ has image lying on the unit circle in $\mathbb{R}^{2}$. Prove that the determinant $\operatorname{det}\left(\left.D F\right|_{x}\right)$ vanishes for every $x \in \mathbb{R}^{2}$.

  comment

• Paper 4, Section II, F

  Analysis II | Part IB, 2013

  State the contraction mapping theorem.

  A metric space $(X, d)$ is bounded if $\{d(x, y) \mid x, y \in X\}$ is a bounded subset of $\mathbb{R}$. Suppose $(X, d)$ is complete and bounded. Let $\operatorname{Maps}(X, X)$ denote the set of continuous $\operatorname{maps}$ from $X$ to itself. For $f, g \in \operatorname{Maps}(X, X)$, let

  $$\delta(f, g)=\sup _{x \in X} d(f(x), g(x))$$

  Prove that $(\operatorname{Maps}(X, X), \delta)$ is a complete metric space. Is the subspace $\mathcal{C} \subset \operatorname{Maps}(X, X)$ of contraction mappings a complete subspace?

  Let $\tau: \mathcal{C} \rightarrow X$ be the map which associates to any contraction its fixed point. Prove that $\tau$ is continuous.

  comment

2012

• Paper 1, Section II, E

  Analysis II | Part IB, 2012

  State the inverse function theorem for a function $F: \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}$. Suppose $F$ is a differentiable bijection with $F^{-1}$ also differentiable. Show that the derivative of $F$ at any point in $\mathbb{R}^{n}$ is a linear isomorphism.

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be a function such that the partial derivatives $\frac{\partial f}{\partial x}, \frac{\partial f}{\partial y}$ exist and are continuous. Assume there is a point $(a, b) \in \mathbb{R}^{2}$ for which $f(a, b)=0$ and $\frac{\partial f}{\partial x}(a, b) \neq 0$. Prove that there exist open sets $U \subset \mathbb{R}^{2}$ and $W \subset \mathbb{R}$ containing $(a, b)$ and $b$, respectively, such that for every $y \in W$ there exists a unique $x$ such that $(x, y) \in U$ and $f(x, y)=0$. Moreover, if we define $g: W \rightarrow \mathbb{R}$ by $g(y)=x$, prove that $g$ is differentiable with continuous derivative. Find the derivative of $g$ at $b$ in terms of $\frac{\partial f}{\partial x}(a, b)$ and $\frac{\partial f}{\partial y}(a, b)$.

  comment

• Paper 2, Section I, E

  Analysis II | Part IB, 2012

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be a function. What does it mean to say that $f$ is differentiable at a point $(x, y) \in \mathbb{R}^{2} ?$ Prove directly from this definition, that if $f$ is differentiable at $(x, y)$, then $f$ is continuous at $(x, y)$.

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be the function:

  $$f(x, y)= \begin{cases}x^{2}+y^{2} & \text { if } x \text { and } y \text { are rational } \\ 0 & \text { otherwise. }\end{cases}$$

  For which points $(x, y) \in \mathbb{R}^{2}$ is $f$ differentiable? Justify your answer.

  comment

• Paper 2, Section II, E

  Analysis II | Part IB, 2012

  Let $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$ be a mapping. Fix $a \in \mathbb{R}^{n}$ and prove that the following two statements are equivalent:

  (i) Given $\varepsilon>0$ there is $\delta>0$ such that $\|f(x)-f(a)\|<\varepsilon$ whenever $\|x-a\|<\delta$ (we use the standard norm in Euclidean space).

  (ii) $f\left(x_{n}\right) \rightarrow f(a)$ for any sequence $x_{n} \rightarrow a$.

  We say that $f$ is continuous if (i) (or equivalently (ii)) holds for every $a \in \mathbb{R}^{n}$.

  Let $E$ and $F$ be subsets of $\mathbb{R}^{n}$ and $\mathbb{R}^{m}$ respectively. For $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$ as above, determine which of the following statements are always true and which may be false, giving a proof or a counterexample as appropriate.

  (a) If $f^{-1}(F)$ is closed whenever $F$ is closed, then $f$ is continuous.

  (b) If $f$ is continuous, then $f^{-1}(F)$ is closed whenever $F$ is closed.

  (c) If $f$ is continuous, then $f(E)$ is open whenever $E$ is open.

  (d) If $f$ is continuous, then $f(E)$ is bounded whenever $E$ is bounded.

  (e) If $f$ is continuous and $f^{-1}(F)$ is bounded whenever $F$ is bounded, then $f(E)$ is closed whenever $E$ is closed.

  comment

• Paper 3, Section I, $2 \mathbf{E}$

  Analysis II | Part IB, 2012

  Let $C[0,1]$ be the set of continuous real-valued functions on $[0,1]$ with the uniform norm. Suppose $T: C[0,1] \rightarrow C[0,1]$ is defined by

  $$T(f)(x)=\int_{0}^{x} f\left(t^{3}\right) d t$$

  for all $x \in[0,1]$ and $f \in C[0,1]$. Is $T$ a contraction mapping? Does $T$ have a unique fixed point? Justify your answers.

  comment

• Paper 3, Section II, E

  Analysis II | Part IB, 2012

  Let $f_{n}$ be a sequence of continuous functions on the interval $[0,1]$ such that $f_{n}(x) \rightarrow f(x)$ for each $x$. For the three statements:

  (a) $f_{n} \rightarrow f$ uniformly on $[0,1]$;

  (b) $f$ is a continuous function;

  (c) $\int_{0}^{1} f_{n}(x) d x \rightarrow \int_{0}^{1} f(x) d x$ as $n \rightarrow \infty ;$

  say which of the six possible implications $(a) \Rightarrow(b),(a) \Rightarrow(c),(b) \Rightarrow(a),(b) \Rightarrow(c)$, $(c) \Rightarrow(a),(c) \Rightarrow(b)$ are true and which false, giving in each case a proof or counterexample.

  comment

• Paper 4, Section I, E

  Analysis II | Part IB, 2012

  Let $f: \mathbb{R}^{n} \times \mathbb{R}^{m} \rightarrow \mathbb{R}$ be a bilinear function. Show that $f$ is differentiable at any point in $\mathbb{R}^{n} \times \mathbb{R}^{m}$ and find its derivative.

  comment

• Paper 4, Section II, E

  Analysis II | Part IB, 2012

  State and prove the Bolzano-Weierstrass theorem in $\mathbb{R}^{n}$. [You may assume the Bolzano-Weierstrass theorem in $\mathbb{R}$.]

  Let $X \subset \mathbb{R}^{n}$ be a subset and let $f: X \rightarrow X$ be a mapping such that $d(f(x), f(y))=d(x, y)$ for all $x, y \in X$, where $d$ is the Euclidean distance in $\mathbb{R}^{n}$. Prove that if $X$ is closed and bounded, then $f$ is a bijection. Is this result still true if we drop the boundedness assumption on $X$ ? Justify your answer.

  comment

2011

• Paper 1, Section II, E

  Analysis II | Part IB, 2011

  What is meant by saying that a sequence of functions $f_{n}$ converges uniformly to a function $f$ ?

  Let $f_{n}$ be a sequence of differentiable functions on $[a, b]$ with $f_{n}^{\prime}$ continuous and such that $f_{n}\left(x_{0}\right)$ converges for some point $x_{0} \in[a, b]$. Assume in addition that $f_{n}^{\prime}$ converges uniformly on $[a, b]$. Prove that $f_{n}$ converges uniformly to a differentiable function $f$ on $[a, b]$ and $f^{\prime}(x)=\lim _{n \rightarrow \infty} f_{n}^{\prime}(x)$ for all $x \in[a, b]$. [You may assume that the uniform limit of continuous functions is continuous.]

  Show that the series

  $$\zeta(s)=\sum_{n=1}^{\infty} \frac{1}{n^{s}}$$

  converges for $s>1$ and is uniformly convergent on $[1+\varepsilon, \infty)$ for any $\varepsilon>0$. Show that $\zeta(s)$ is differentiable on $(1, \infty)$ and

  $$\zeta^{\prime}(s)=-\sum_{n=2}^{\infty} \frac{\log n}{n^{s}}$$

  [You may use the Weierstrass $M$-test provided it is clearly stated.]

  comment

• Paper 2, Section I, E

  Analysis II | Part IB, 2011

  Define differentiability of a function $f: \mathbb{R}^{n} \rightarrow \mathbb{R}$. Let $a>0$ be a constant. For which points $(x, y) \in \mathbb{R}^{2}$ is

  $$f(x, y)=|x|^{a}+|x-y|$$

  differentiable? Justify your answer.

  comment

• Paper 2, Section II, E

  Analysis II | Part IB, 2011

  What is meant by saying that two norms on a real vector space are Lipschitz equivalent?

  Show that any two norms on $\mathbb{R}^{n}$ are Lipschitz equivalent. [You may assume that a continuous function on a closed bounded set in $\mathbb{R}^{n}$ has closed bounded image.]

  Show that $\|f\|_{1}=\int_{-1}^{1}|f(x)| d x$ defines a norm on the space $C[-1,1]$ of continuous real-valued functions on $[-1,1]$. Is it Lipschitz equivalent to the uniform norm? Justify your answer. Prove that the normed space $\left(C[-1,1],\|\cdot\|_{1}\right)$ is not complete.

  comment

• Paper 3, Section I, $2 \mathrm{E}$

  Analysis II | Part IB, 2011

  Suppose $f$ is a uniformly continuous mapping from a metric space $X$ to a metric space $Y$. Prove that $f\left(x_{n}\right)$ is a Cauchy sequence in $Y$ for every Cauchy sequence $x_{n}$ in $X$.

  Let $f$ be a continuous mapping between metric spaces and suppose that $f$ has the property that $f\left(x_{n}\right)$ is a Cauchy sequence whenever $x_{n}$ is a Cauchy sequence. Is it true that $f$ must be uniformly continuous? Justify your answer.

  comment

• Paper 3, Section II, E

  Analysis II | Part IB, 2011

  Consider a map $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$.

  Assume $f$ is differentiable at $x$ and let $D_{x} f$ denote the derivative of $f$ at $x$. Show that

  $$D_{x} f(v)=\lim _{t \rightarrow 0} \frac{f(x+t v)-f(x)}{t}$$

  for any $v \in \mathbb{R}^{n}$.

  Assume now that $f$ is such that for some fixed $x$ and for every $v \in \mathbb{R}^{n}$ the limit

  $$\lim _{t \rightarrow 0} \frac{f(x+t v)-f(x)}{t}$$

  exists. Is it true that $f$ is differentiable at $x ?$ Justify your answer.

  Let $M_{k}$ denote the set of all $k \times k$ real matrices which is identified with $\mathbb{R}^{k^{2}}$. Consider the function $f: M_{k} \rightarrow M_{k}$ given by $f(A)=A^{3}$. Explain why $f$ is differentiable. Show that the derivative of $f$ at the matrix $A$ is given by

  $$D_{A} f(H)=H A^{2}+A H A+A^{2} H$$

  for any matrix $H \in M_{k}$. State carefully the inverse function theorem and use it to prove that there exist open sets $U$ and $V$ containing the identity matrix such that given $B \in V$ there exists a unique $A \in U$ such that $A^{3}=B$.

  comment

• Paper 4, Section I, E

  Analysis II | Part IB, 2011

  Let $B[0,1]$ denote the set of bounded real-valued functions on $[0,1]$. A distance $d$ on $B[0,1]$ is defined by

  $$d(f, g)=\sup _{x \in[0,1]}|f(x)-g(x)| .$$

  Given that $(B[0,1], d)$ is a metric space, show that it is complete. Show that the subset $C[0,1] \subset B[0,1]$ of continuous functions is a closed set.

  comment

• Paper 4, Section II, E

  Analysis II | Part IB, 2011

  Define a contraction mapping and state the contraction mapping theorem.

  Let $(X, d)$ be a non-empty complete metric space and let $\phi: X \rightarrow X$ be a map. Set $\phi^{1}=\phi$ and $\phi^{n+1}=\phi \circ \phi^{n}$. Assume that for some integer $r \geqslant 1, \phi^{r}$ is a contraction mapping. Show that $\phi$ has a unique fixed point $y$ and that any $x \in X$ has the property that $\phi^{n}(x) \rightarrow y$ as $n \rightarrow \infty$.

  Let $C[0,1]$ be the set of continuous real-valued functions on $[0,1]$ with the uniform norm. Suppose $T: C[0,1] \rightarrow C[0,1]$ is defined by

  $$T(f)(x)=\int_{0}^{x} f(t) d t$$

  for all $x \in[0,1]$ and $f \in C[0,1]$. Show that $T$ is not a contraction mapping but that $T^{2}$ is.

  comment

2010

• Paper 1, Section II, G

  Analysis II | Part IB, 2010

  State and prove the contraction mapping theorem. Demonstrate its use by showing that the differential equation $f^{\prime}(x)=f\left(x^{2}\right)$, with boundary condition $f(0)=1$, has a unique solution on $[0,1)$, with one-sided derivative $f^{\prime}(0)=1$ at zero.

  comment

• Paper 2, Section I, G

  Analysis II | Part IB, 2010

  Let $c>1$ be a real number, and let $F_{c}$ be the space of sequences $\mathbf{a}=\left(a_{1}, a_{2}, \ldots\right)$ of real numbers $a_{i}$ with $\sum_{r=1}^{\infty} c^{-r}\left|a_{r}\right|$ convergent. Show that $\|\mathbf{a}\|_{c}=\sum_{r=1}^{\infty} c^{-r}\left|a_{r}\right|$ defines a norm on $F_{c}$.

  Let $F$ denote the space of sequences a with $\left|a_{i}\right|$ bounded; show that $F \subset F_{c}$. If $c^{\prime}>c$, show that the norms on $F$ given by restricting to $F$ the norms $\|\cdot\|_{c}$ on $F_{c}$ and $\|\cdot\|_{c^{\prime}}$ on $F_{c^{\prime}}$ are not Lipschitz equivalent.

  By considering sequences of the form $\mathbf{a}^{(n)}=\left(a, a^{2}, \ldots, a^{n}, 0,0, \ldots\right)$ in $F$, for $a$ an appropriate real number, or otherwise, show that $F$ (equipped with the norm $\|.\|_{c}$ ) is not complete.

  comment

• Paper 2, Section II, G

  Analysis II | Part IB, 2010

  Suppose the functions $f_{n}(n=1,2, \ldots)$ are defined on the open interval $(0,1)$ and that $f_{n}$ tends uniformly on $(0,1)$ to a function $f$. If the $f_{n}$ are continuous, show that $f$ is continuous. If the $f_{n}$ are differentiable, show by example that $f$ need not be differentiable.

  Assume now that each $f_{n}$ is differentiable and the derivatives $f_{n}^{\prime}$ converge uniformly on $(0,1)$. For any given $c \in(0,1)$, we define functions $g_{c, n}$ by

  $$g_{c, n}(x)= \begin{cases}\frac{f_{n}(x)-f_{n}(c)}{x-c} & \text { for } x \neq c, \\ f_{n}^{\prime}(c) & \text { for } x=c .\end{cases}$$

  Show that each $g_{c, n}$ is continuous. Using the general principle of uniform convergence (the Cauchy criterion) and the Mean Value Theorem, or otherwise, prove that the functions $g_{c, n}$ converge uniformly to a continuous function $g_{c}$ on $(0,1)$, where

  $$g_{c}(x)=\frac{f(x)-f(c)}{x-c} \quad \text { for } x \neq c$$

  Deduce that $f$ is differentiable on $(0,1)$.

  comment

• Paper 3, Section I, G

  Analysis II | Part IB, 2010

  Consider the map $f: \mathbf{R}^{3} \rightarrow \mathbf{R}^{3}$ given by

  $$f(x, y, z)=(x+y+z, x y+y z+z x, x y z)$$

  Show that $f$ is differentiable everywhere and find its derivative.

  Stating carefully any theorem that you quote, show that $f$ is locally invertible near a point $(x, y, z)$ unless $(x-y)(y-z)(z-x)=0$.

  comment

• Paper 3, Section II, G

  Analysis II | Part IB, 2010

  Let $f: U \rightarrow \mathbf{R}^{n}$ be a map on an open subset $U \subset \mathbf{R}^{m}$. Explain what it means for $f$ to be differentiable on $U$. If $g: V \rightarrow \mathbf{R}^{m}$ is a differentiable map on an open subset $V \subset \mathbf{R}^{p}$ with $g(V) \subset U$, state and prove the Chain Rule for the derivative of the composite $f g$.

  Suppose now $F: \mathbf{R}^{n} \rightarrow \mathbf{R}$ is a differentiable function for which the partial derivatives $D_{1} F(\mathbf{x})=D_{2} F(\mathbf{x})=\ldots=D_{n} F(\mathbf{x})$ for all $\mathbf{x} \in \mathbf{R}^{n}$. By considering the function $G: \mathbf{R}^{n} \rightarrow \mathbf{R}$ given by

  $$G\left(y_{1}, \ldots, y_{n}\right)=F\left(y_{1}, \ldots, y_{n-1}, y_{n}-\sum_{i=1}^{n-1} y_{i}\right)$$

  or otherwise, show that there exists a differentiable function $h: \mathbf{R} \rightarrow \mathbf{R}$ with $F\left(x_{1}, \ldots, x_{n}\right)=$ $h\left(x_{1}+\cdots+x_{n}\right)$ at all points of $\mathbf{R}^{n} .$

  comment

• Paper 4, Section I, G

  Analysis II | Part IB, 2010

  Let $S$ denote the set of continuous real-valued functions on the interval $[0,1]$. For $f, g \in S$, set

  $$d_{1}(f, g)=\sup \{|f(x)-g(x)|: x \in[0,1]\} \quad \text { and } \quad d_{2}(f, g)=\int_{0}^{1}|f(x)-g(x)| d x$$

  Show that both $d_{1}$ and $d_{2}$ define metrics on $S$. Does the identity map on $S$ define a continuous map of metric spaces $\left(S, d_{1}\right) \rightarrow\left(S, d_{2}\right) ?$ Does the identity map define a continuous map of metric spaces $\left(S, d_{2}\right) \rightarrow\left(S, d_{1}\right)$ ?

  comment

• Paper 4, Section II, G

  Analysis II | Part IB, 2010

  What does it mean to say that a function $f$ on an interval in $\mathbf{R}$ is uniformly continuous? Assuming the Bolzano-Weierstrass theorem, show that any continuous function on a finite closed interval is uniformly continuous.

  Suppose that $f$ is a continuous function on the real line, and that $f(x)$ tends to finite limits as $x \rightarrow \pm \infty$; show that $f$ is uniformly continuous.

  If $f$ is a uniformly continuous function on $\mathbf{R}$, show that $f(x) / x$ is bounded as $x \rightarrow \pm \infty$. If $g$ is a continuous function on $\mathbf{R}$ for which $g(x) / x \rightarrow 0$ as $x \rightarrow \pm \infty$, determine whether $g$ is necessarily uniformly continuous, giving proof or counterexample as appropriate.

  comment

2009

• Paper 1, Section II, E

  Analysis II | Part IB, 2009

  Define a function $f: \mathbb{R} \rightarrow \mathbb{R}$ by

  $$f(x)=\sum_{n=1}^{\infty} 2^{-n}\left\|2^{n} x\right\|$$

  where $\|t\|$ is the distance from $t$ to the nearest integer. Prove that $f$ is continuous. [Results about uniform convergence may not be used unless they are clearly stated and proved.]

  Suppose now that $g: \mathbb{R} \rightarrow \mathbb{R}$ is a function which is differentiable at some point $x$, and let $\left(u_{n}\right)_{n=1}^{\infty},\left(v_{n}\right)_{n=1}^{\infty}$ be two sequences of real numbers with $u_{n} \leqslant x \leqslant v_{n}$ for all $n$, $u_{n} \neq v_{n}$ and $u_{n}, v_{n} \rightarrow x$ as $n \rightarrow \infty$. Prove that

  $$\lim _{n \rightarrow \infty} \frac{g\left(v_{n}\right)-g\left(u_{n}\right)}{v_{n}-u_{n}}$$

  exists.

  By considering appropriate sequences of rationals with denominator $2^{-n}$, or otherwise, show that $f$ is nowhere differentiable.

  comment

• Paper 2, Section I, E

  Analysis II | Part IB, 2009

  State and prove the contraction mapping theorem. Let $f(x)=e^{-x}$. By considering $f(f(x))$ and using the contraction mapping theorem, show that there is a unique real number $x$ such that $x=e^{-x}$.

  comment

• Paper 2, Section II, E

  Analysis II | Part IB, 2009

  Let $U \subseteq \mathbb{R}^{n}$ be a set. What does it mean to say that $U$ is open? Show that if $U$ is open and if $f: U \rightarrow\{0,1\}$ is a continuous function then $f$ is also differentiable, and that its derivative is zero.

  Suppose that $g: U \rightarrow \mathbb{R}$ is differentiable and that $\left\|\left.(D g)\right|_{x}\right\| \leqslant M$ for all $x$, where $\left.(D g)\right|_{x}$ denotes the derivative of $g$ at $x$ and $\|\cdot\|$ is the operator norm. Suppose that $\mathbf{a}, \mathbf{b} \in \mathbb{R}^{n}$ and that the line segment $[\mathbf{a}, \mathbf{b}]=\{\lambda \mathbf{a}+(1-\lambda) \mathbf{b}: \lambda \in[0,1]\}$ lies wholly in $U$. Prove that $|g(\mathbf{a})-g(\mathbf{b})| \leqslant M\|\mathbf{a}-\mathbf{b}\|$.

  Let $\ell_{1}, \ldots, \ell_{k}$ be (infinite) lines in $\mathbb{R}^{3}$, and write $V=\mathbb{R}^{3} \backslash\left(\ell_{1} \cup \cdots \cup \ell_{k}\right)$. If $\mathbf{a}, \mathbf{b} \in V$, show that there is some $\mathbf{c} \in V$ such that the line segments $[\mathbf{a}, \mathbf{c}]$ and $[\mathbf{c}, \mathbf{b}]$ both lie inside V. [You may assume without proof that $\mathbb{R}^{3}$ may not be written as the union of finitely many planes.]

  Show that if $V \rightarrow\{0,1\}$ is a continuous function then $f$ is constant on $V$.

  comment

• Paper 3, Section I, E

  Analysis II | Part IB, 2009

  What is meant by a norm on $\mathbb{R}^{n}$ ? For $\mathbf{x} \in \mathbb{R}^{n}$ write

  $$\begin{gathered} \|\mathbf{x}\|_{1}=\left|x_{1}\right|+\left|x_{2}\right|+\cdots+\left|x_{n}\right| \\ \|\mathbf{x}\|_{2}=\sqrt{\left|x_{1}\right|^{2}+\left|x_{2}\right|^{2}+\cdots+\left|x_{n}\right|^{2}} \end{gathered}$$

  Prove that $\|\cdot\|_{1}$ and $\|\cdot\|_{2}$ are norms. [You may assume the Cauchy-Schwarz inequality.]

  Find the smallest constant $C_{n}$ such that $\|x\|_{1} \leqslant C_{n}\|x\|_{2}$ for all $x \in \mathbb{R}^{n}$, and also the smallest constant $C_{n}^{\prime}$ such that $\|x\|_{2} \leqslant C_{n}^{\prime}\|x\|_{1}$ for all $x \in \mathbb{R}^{n}$.

  comment

• Paper 3, Section II, E

  Analysis II | Part IB, 2009

  What does it mean for a function $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{m}$ of several variables to be differentiable at a point $x$ ? State and prove the chain rule for functions of several variables. For each of the following two functions from $\mathbb{R}^{2}$ to $\mathbb{R}$, give with proof the set of points at which it is differentiable:

  $$\begin{aligned} &g_{1}(x, y)= \begin{cases}\left(x^{2}-y^{2}\right) \sin \frac{1}{x^{2}-y^{2}} & \text { if } x \neq \pm y \\ 0 & \text { otherwise; }\end{cases} \\ &g_{2}(x, y)= \begin{cases}\left(x^{2}+y^{2}\right) \sin \frac{1}{x^{2}+y^{2}} & \text { if at least one of } x, y \text { is not } 0 \\ 0 & \text { if } x=y=0\end{cases} \end{aligned}$$

  comment

• Paper 4, Section I, E

  Analysis II | Part IB, 2009

  Let $\left(s_{n}\right)_{n=1}^{\infty}$ be a sequence of continuous functions from $\mathbb{R}$ to $\mathbb{R}$ and let $s: \mathbb{R} \rightarrow \mathbb{R}$ be another continuous function. What does it mean to say that $s_{n} \rightarrow s$ uniformly? Give examples (without proof) of a sequence $\left(s_{n}\right)$ of nonzero functions which converges to 0 uniformly, and of a sequence which converges to 0 pointwise but not uniformly. Show that if $s_{n} \rightarrow s$ uniformly then

  $$\int_{-1}^{1} s_{n}(x) d x \rightarrow \int_{-1}^{1} s(x) d x$$

  Give an example of a continuous function $s: \mathbb{R} \rightarrow \mathbb{R}$ with $s(x) \geqslant 0$ for all $x, s(x) \rightarrow 0$ as $|x| \rightarrow \infty$ but for which $\int_{-\infty}^{\infty} s(x) d x$ does not converge. For each positive integer $n$ define $s_{n}(x)$ to be equal to $s(x)$ if $|x| \leqslant n$, and to be $s(n) \min \left(1,|| x|-n|^{-2}\right)$ for $|x|>n$. Show that the functions $s_{n}$ are continuous, tend uniformly to $s$, and furthermore that $\int_{-\infty}^{\infty} s_{n}(x) d x$ exists and is finite for all $n$.

  comment

• Paper 4, Section II, E

  Analysis II | Part IB, 2009

  Let $(X, d)$ be a metric space with at least two points. If $f: X \rightarrow \mathbb{R}$ is a function, write

  $$\operatorname{Lip}(f)=\sup _{x \neq y} \frac{|f(x)-f(y)|}{d(x, y)}+\sup _{z}|f(z)|$$

  provided that this supremum is finite. $\operatorname{Let} \operatorname{Lip}(X)=\{f: \operatorname{Lip}(f)$ is defined $\}$. Show that $\operatorname{Lip}(X)$ is a vector space over $\mathbb{R}$, and that Lip is a norm on it.

  Now let $X=\mathbb{R}$. Suppose that $\left(f_{i}\right)_{i=1}^{\infty}$ is a sequence of functions with $\operatorname{Lip}\left(f_{i}\right) \leqslant 1$ and with the property that the sequence $f_{i}(q)$ converges as $i \rightarrow \infty$ for every rational number $q$. Show that the $f_{i}$ converge pointwise to a function $f$ satisfying $\operatorname{Lip}(f) \leqslant 1$.

  Suppose now that $\left(f_{i}\right)_{i=1}^{\infty}$ are any functions with $\operatorname{Lip}\left(f_{i}\right) \leqslant 1$. Show that there is a subsequence $f_{i_{1}}, f_{i_{2}}, \ldots$ which converges pointwise to a function $f$ with $\operatorname{Lip}(f) \leqslant 1$.

  comment

2008

• $3 . \mathrm{I} . 3 \mathrm{~F} \quad$

  Analysis II | Part IB, 2008

  Explain what it means for a function $f(x, y)$ of two variables to be differentiable at a point $\left(x_{0}, y_{0}\right)$. If $f$ is differentiable at $\left(x_{0}, y_{0}\right)$, show that for any $\alpha$ the function $g_{\alpha}$ defined by

  $$g_{\alpha}(t)=f\left(x_{0}+t \cos \alpha, y_{0}+t \sin \alpha\right)$$

  is differentiable at $t=0$, and find its derivative in terms of the partial derivatives of $f$ at $\left(x_{0}, y_{0}\right)$.

  Consider the function $f$ defined by

  

  Is $f$ differentiable at $(0,0)$ ? Justify your answer.

  comment

• 1.II.11F

  Analysis II | Part IB, 2008

  State and prove the Contraction Mapping Theorem.

  Let $(X, d)$ be a nonempty complete metric space and $f: X \rightarrow X$ a mapping such that, for some $k>0$, the $k$ th iterate $f^{k}$ of $f$ (that is, $f$ composed with itself $k$ times) is a contraction mapping. Show that $f$ has a unique fixed point.

  Now let $X$ be the space of all continuous real-valued functions on $[0,1]$, equipped with the uniform norm $\|h\|_{\infty}=\sup \{|h(t)|: t \in[0,1]\}$, and let $\phi: \mathbb{R} \times[0,1] \rightarrow \mathbb{R}$ be a continuous function satisfying the Lipschitz condition

  $$|\phi(x, t)-\phi(y, t)| \leqslant M|x-y|$$

  for all $t \in[0,1]$ and all $x, y \in \mathbb{R}$, where $M$ is a constant. Let $F: X \rightarrow X$ be defined by

  $$F(h)(t)=g(t)+\int_{0}^{t} \phi(h(s), s) d s$$

  where $g$ is a fixed continuous function on $[0,1]$. Show by induction on $n$ that

  $$\left|F^{n}(h)(t)-F^{n}(k)(t)\right| \leqslant \frac{M^{n} t^{n}}{n !}\|h-k\|_{\infty}$$

  for all $h, k \in X$ and all $t \in[0,1]$. Deduce that the integral equation

  $$f(t)=g(t)+\int_{0}^{t} \phi(f(s), s) d s$$

  has a unique continuous solution $f$ on $[0,1]$.

  comment

• 2.I.3F

  Analysis II | Part IB, 2008

  Explain what is meant by the statement that a sequence $\left(f_{n}\right)$ of functions defined on an interval $[a, b]$ converges uniformly to a function $f$. If $\left(f_{n}\right)$ converges uniformly to $f$, and each $f_{n}$ is continuous on $[a, b]$, prove that $f$ is continuous on $[a, b]$.

  Now suppose additionally that $\left(x_{n}\right)$ is a sequence of points of $[a, b]$ converging to a limit $x$. Prove that $f_{n}\left(x_{n}\right) \rightarrow f(x)$.

  comment

• 2.II.13F

  Analysis II | Part IB, 2008

  Let $\left(u_{n}(x): n=0,1,2, \ldots\right)$ be a sequence of real-valued functions defined on a subset $E$ of $\mathbb{R}$. Suppose that for all $n$ and all $x \in E$ we have $\left|u_{n}(x)\right| \leqslant M_{n}$, where $\sum_{n=0}^{\infty} M_{n}$ converges. Prove that $\sum_{n=0}^{\infty} u_{n}(x)$ converges uniformly on $E$.

  Now let $E=\mathbb{R} \backslash \mathbb{Z}$, and consider the series $\sum_{n=0}^{\infty} u_{n}(x)$, where $u_{0}(x)=1 / x^{2}$ and

  $$u_{n}(x)=1 /(x-n)^{2}+1 /(x+n)^{2}$$

  for $n>0$. Show that the series converges uniformly on $E_{R}=\{x \in E:|x|<R\}$ for any real number $R$. Deduce that $f(x)=\sum_{n=0}^{\infty} u_{n}(x)$ is a continuous function on $E$. Does the series converge uniformly on $E$ ? Justify your answer.

  comment

• 3.II.13F

  Analysis II | Part IB, 2008

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be a function, and $\left(x_{0}, y_{0}\right)$ a point of $\mathbb{R}^{2}$. Prove that if the partial derivatives of $f$ exist in some open disc around $\left(x_{0}, y_{0}\right)$ and are continuous at $\left(x_{0}, y_{0}\right)$, then $f$ is differentiable at $\left(x_{0}, y_{0}\right)$.

  Now let $X$ denote the vector space of all $(n \times n)$ real matrices, and let $f: X \rightarrow \mathbb{R}$ be the function assigning to each matrix its determinant. Show that $f$ is differentiable at the identity matrix $I$, and that $\left.D f\right|_{I}$ is the linear map $H \mapsto \operatorname{tr} H$. Deduce that $f$ is differentiable at any invertible matrix $A$, and that $\left.D f\right|_{A}$ is the linear map $H \mapsto \operatorname{det} A \operatorname{tr}\left(A^{-1} H\right) .$

  Show also that if $K$ is a matrix with $\|K\|<1$, then $(I+K)$ is invertible. Deduce that $f$ is twice differentiable at $I$, and find $\left.D^{2} f\right|_{I}$ as a bilinear map $X \times X \rightarrow \mathbb{R}$.

  [You may assume that the norm $\|-\|$ on $X$ is complete, and that it satisfies the inequality $\|A B\| \leqslant\|A\| \cdot\|B\|$ for any two matrices $A$ and $B .]$

  comment

• 4.I.3F

  Analysis II | Part IB, 2008

  Let $X$ be the vector space of all continuous real-valued functions on the unit interval $[0,1]$. Show that the functions

  $$\|f\|_{1}=\int_{0}^{1}|f(t)| d t \quad \text { and } \quad\|f\|_{\infty}=\sup \{|f(t)|: 0 \leqslant t \leqslant 1\}$$

  both define norms on $X$.

  Consider the sequence $\left(f_{n}\right)$ defined by $f_{n}(t)=n t^{n}(1-t)$. Does $\left(f_{n}\right)$ converge in the norm $\|-\|_{1}$ ? Does it converge in the norm $\|-\|_{\infty}$ ? Justify your answers.

  comment

• 4.II.13F

  Analysis II | Part IB, 2008

  Explain what it means for two norms on a real vector space to be Lipschitz equivalent. Show that if two norms are Lipschitz equivalent, then one is complete if and only if the other is.

  Let $\|-\|$ be an arbitrary norm on the finite-dimensional space $\mathbb{R}^{n}$, and let $\|-\|_{2}$ denote the standard (Euclidean) norm. Show that for every $\mathbf{x} \in \mathbb{R}^{n}$ with $\|\mathbf{x}\|_{2}=1$, we have

  $$\|\mathbf{x}\| \leqslant\left\|\mathbf{e}_{1}\right\|+\left\|\mathbf{e}_{2}\right\|+\cdots+\left\|\mathbf{e}_{n}\right\|$$

  where $\left(\mathbf{e}_{1}, \mathbf{e}_{2}, \ldots, \mathbf{e}_{n}\right)$ is the standard basis for $\mathbb{R}^{n}$, and deduce that the function $\|-\|$ is continuous with respect to $\|-\|_{2}$. Hence show that there exists a constant $m>0$ such that $\|\mathbf{x}\| \geqslant m$ for all $\mathbf{x}$ with $\|\mathbf{x}\|_{2}=1$, and deduce that $\|-\|$ and $\|-\|_{2}$ are Lipschitz equivalent.

  [You may assume the Bolzano-Weierstrass Theorem.]

  comment

2007

• $2 . \mathrm{I} . 3 \mathrm{H}$

  Analysis II | Part IB, 2007

  For integers $a$ and $b$, define $d(a, b)$ to be 0 if $a=b$, or $\frac{1}{2^{n}}$ if $a \neq b$ and $n$ is the largest non-negative integer such that $a-b$ is a multiple of $2^{n}$. Show that $d$ is a metric on the integers $\mathbb{Z}$.

  Does the sequence $x_{n}=2^{n}-1$ converge in this metric?

  comment

• $3 . \mathrm{II} . 13 \mathrm{H}$

  Analysis II | Part IB, 2007

  Let $V$ be the real vector space of continuous functions $f:[0,1] \rightarrow \mathbb{R}$. Show that defining

  $$\|f\|=\int_{0}^{1}|f(x)| d x$$

  makes $V$ a normed vector space.

  Define $f_{n}(x)=\sin n x$ for positive integers $n$. Is the sequence $\left(f_{n}\right)$ convergent to some element of $V$ ? Is $\left(f_{n}\right)$ a Cauchy sequence in $V$ ? Justify your answers.

  comment

• $3 . \mathrm{I} . 3 \mathrm{H}$

  Analysis II | Part IB, 2007

  Define uniform continuity for a real-valued function on an interval in the real line. Is a uniformly continuous function on the real line necessarily bounded?

  Which of the following functions are uniformly continuous on the real line?

  (i) $f(x)=x \sin x$,

  (ii) $f(x)=e^{-x^{4}}$.

  Justify your answers.

  comment

• 1.II.11H

  Analysis II | Part IB, 2007

  Define what it means for a function $f: \mathbb{R}^{a} \rightarrow \mathbb{R}^{b}$ to be differentiable at a point $p \in \mathbb{R}^{a}$ with derivative a linear map $\left.D f\right|_{p} .$

  State the Chain Rule for differentiable maps $f: \mathbb{R}^{a} \rightarrow \mathbb{R}^{b}$ and $g: \mathbb{R}^{b} \rightarrow \mathbb{R}^{c}$. Prove the Chain Rule.

  Let $\|x\|$ denote the standard Euclidean norm of $x \in \mathbb{R}^{a}$. Find the partial derivatives $\frac{\partial f}{\partial x_{i}}$ of the function $f(x)=\|x\|$ where they exist.

  comment

• 2.II.13H

  Analysis II | Part IB, 2007

  Show that the limit of a uniformly convergent sequence of real valued continuous functions on $[0,1]$ is continuous on $[0,1]$.

  Let $f_{n}$ be a sequence of continuous functions on $[0,1]$ which converge point-wise to a continuous function. Suppose also that the integrals $\int_{0}^{1} f_{n}(x) d x$ converge to $\int_{0}^{1} f(x) d x$. Must the functions $f_{n}$ converge uniformly to $f ?$ Prove or give a counterexample.

  Let $f_{n}$ be a sequence of continuous functions on $[0,1]$ which converge point-wise to a function $f$. Suppose that $f$ is integrable and that the integrals $\int_{0}^{1} f_{n}(x) d x$ converge to $\int_{0}^{1} f(x) d x$. Is the limit $f$ necessarily continuous? Prove or give a counterexample.

  comment

• 4.I.3H

  Analysis II | Part IB, 2007

  Define uniform convergence for a sequence $f_{1}, f_{2}, \ldots$ of real-valued functions on the interval $(0,1)$.

  For each of the following sequences of functions on $(0,1)$, find the pointwise limit function. Which of these sequences converge uniformly on $(0,1)$ ?

  (i) $f_{n}(x)=\log \left(x+\frac{1}{n}\right)$,

  (ii) $f_{n}(x)=\cos \left(\frac{x}{n}\right)$.

  Justify your answers.

  comment

• 4.II.13H

  Analysis II | Part IB, 2007

  State and prove the Contraction Mapping Theorem.

  Find numbers $a$ and $b$, with $a<0<b$, such that the mapping $T: C[a, b] \rightarrow C[a, b]$ defined by

  $$T(f)(x)=1+\int_{0}^{x} 3 t f(t) d t$$

  is a contraction, in the sup norm on $C[a, b]$. Deduce that the differential equation

  $$\frac{d y}{d x}=3 x y, \quad \text { with } y=1 \text { when } x=0,$$

  has a unique solution in some interval containing 0 .

  comment

2006

• $3 . \mathrm{I} . 3 \mathrm{~F} \quad$

  Analysis II | Part IB, 2006

  Define what it means for a function $f: \mathbf{R}^{2} \rightarrow \mathbf{R}$ to be differentiable at a point $(a, b)$. If the partial derivatives $\partial f / \partial x$ and $\partial f / \partial y$ are defined and continuous on a neighbourhood of $(a, b)$, show that $f$ is differentiable at $(a, b)$.

  comment

• 1.II.11F

  Analysis II | Part IB, 2006

  Let $a_{n}$ and $b_{n}$ be sequences of real numbers for $n \geqslant 1$ such that $\left|a_{n}\right| \leqslant c / n^{1+\epsilon}$ and $\left|b_{n}\right| \leqslant c / n^{1+\epsilon}$ for all $n \geqslant 1$, for some constants $c>0$ and $\epsilon>0$. Show that the series

  $$f(x)=\sum_{n \geqslant 1} a_{n} \cos n x+\sum_{n \geqslant 1} b_{n} \sin n x$$

  converges uniformly to a continuous function on the real line. Show that $f$ is periodic in the sense that $f(x+2 \pi)=f(x)$.

  Now suppose that $\left|a_{n}\right| \leqslant c / n^{2+\epsilon}$ and $\left|b_{n}\right| \leqslant c / n^{2+\epsilon}$ for all $n \geqslant 1$, for some constants $c>0$ and $\epsilon>0$. Show that $f$ is differentiable on the real line, with derivative

  $$f^{\prime}(x)=-\sum_{n \geqslant 1} n a_{n} \sin n x+\sum_{n \geqslant 1} n b_{n} \cos n x .$$

  [You may assume the convergence of standard series.]

  comment

• 2.I.3F

  Analysis II | Part IB, 2006

  Define uniform convergence for a sequence $f_{1}, f_{2}, \ldots$ of real-valued functions on an interval in $\mathbf{R}$. If $\left(f_{n}\right)$ is a sequence of continuous functions converging uniformly to a (necessarily continuous) function $f$ on a closed interval $[a, b]$, show that

  $$\int_{a}^{b} f_{n}(x) d x \rightarrow \int_{a}^{b} f(x) d x$$

  as $n \rightarrow \infty$.

  Which of the following sequences of functions $f_{1}, f_{2}, \ldots$ converges uniformly on the open interval $(0,1)$ ? Justify your answers.

  (i) $f_{n}(x)=1 /(n x)$;

  (ii) $f_{n}(x)=e^{-x / n}$.

  comment

• 2.II.13F

  Analysis II | Part IB, 2006

  For a smooth mapping $F: \mathbf{R}^{2} \rightarrow \mathbf{R}^{2}$, the Jacobian $J(F)$ at a point $(x, y)$ is defined as the determinant of the derivative $D F$, viewed as a linear map $\mathbf{R}^{2} \rightarrow \mathbf{R}^{2}$. Suppose that $F$ maps into a curve in the plane, in the sense that $F$ is a composition of two smooth mappings $\mathbf{R}^{2} \rightarrow \mathbf{R} \rightarrow \mathbf{R}^{2}$. Show that the Jacobian of $F$ is identically zero.

  Conversely, let $F: \mathbf{R}^{2} \rightarrow \mathbf{R}^{2}$ be a smooth mapping whose Jacobian is identically zero. Write $F(x, y)=(f(x, y), g(x, y))$. Suppose that $\partial f /\left.\partial y\right|_{(0,0)} \neq 0$. Show that $\partial f / \partial y \neq 0$ on some open neighbourhood $U$ of $(0,0)$ and that on $U$

  $$(\partial g / \partial x, \partial g / \partial y)=e(x, y)(\partial f / \partial x, \partial f / \partial y)$$

  for some smooth function $e$ defined on $U$. Now suppose that $c: \mathbf{R} \rightarrow U$ is a smooth curve of the form $t \mapsto(t, \alpha(t))$ such that $F \circ c$ is constant. Write down a differential equation satisfied by $\alpha$. Apply an existence theorem for differential equations to show that there is a neighbourhood $V$ of $(0,0)$ such that every point in $V$ lies on a curve $t \mapsto(t, \alpha(t))$ on which $F$ is constant.

  [A function is said to be smooth when it is infinitely differentiable. Detailed justification of the smoothness of the functions in question is not expected.]

  comment

• 3.II.13F

  Analysis II | Part IB, 2006

  State precisely the inverse function theorem for a smooth map $F$ from an open subset of $\mathbf{R}^{2}$ to $\mathbf{R}^{2}$

  Define $F: \mathbf{R}^{2} \rightarrow \mathbf{R}^{2}$ by

  $$F(x, y)=\left(x^{3}-x-y^{2}, y\right)$$

  Determine the open subset of $\mathbf{R}^{2}$ on which $F$ is locally invertible.

  Let $C$ be the curve $\left\{(x, y) \in \mathbf{R}^{2}: x^{3}-x-y^{2}=0\right\}$. Show that $C$ is the union of the two subsets $C_{1}=\{(x, y) \in C: x \in[-1,0]\}$ and $C_{2}=\{(x, y) \in C: x \geqslant 1\}$. Show that for each $y \in \mathbf{R}$ there is a unique $x=p(y)$ such that $(x, y) \in C_{2}$. Show that $F$ is locally invertible at all points of $C_{2}$, and deduce that $p(y)$ is a smooth function of $y$.

  [A function is said to be smooth when it is infinitely differentiable.]

  comment

• 4.I.3F

  Analysis II | Part IB, 2006

  Let $V$ be the vector space of all sequences $\left(x_{1}, x_{2}, \ldots\right)$ of real numbers such that $x_{i}$ converges to zero. Show that the function

  $$\left|\left(x_{1}, x_{2}, \ldots\right)\right|=\max _{i \geqslant 1}\left|x_{i}\right|$$

  defines a norm on $V$.

  Is the sequence

  $$(1,0,0,0, \ldots),(0,1,0,0, \ldots), \ldots$$

  convergent in $V ?$ Justify your answer.

  comment

• 4.II.13F

  Analysis II | Part IB, 2006

  State precisely the contraction mapping theorem.

  An ancient way to approximate the square root of a positive number $a$ is to start with a guess $x>0$ and then hope that the average of $x$ and $a / x$ gives a better guess. We can then repeat the procedure using the new guess. Justify this procedure as follows. First, show that all the guesses after the first one are greater than or equal to $\sqrt{a}$. Then apply the properties of contraction mappings to the interval $[\sqrt{a}, \infty)$ to show that the procedure always converges to $\sqrt{a}$.

  Once the above procedure is close enough to $\sqrt{a}$, estimate how many more steps of the procedure are needed to get one more decimal digit of accuracy in computing $\sqrt{a}$.

  comment

2005

• 1.II.11B

  Analysis II | Part IB, 2005

  Let $\left(f_{n}\right)_{n \geqslant 1}$ be a sequence of continuous real-valued functions defined on a set $E \subset \mathbf{R}$. Suppose that the functions $f_{n}$ converge uniformly to a function $f$. Prove that $f$ is continuous on $E$.

  Show that the series $\sum_{n=1}^{\infty} 1 / n^{1+x}$ defines a continuous function on the half-open interval $(0,1]$.

  [Hint: You may assume the convergence of standard series.]

  comment

• 2.I.3B

  Analysis II | Part IB, 2005

  Define uniform continuity for a real-valued function defined on an interval in $\mathbf{R}$.

  Is a uniformly continuous function on the interval $(0,1)$ necessarily bounded?

  Is $1 / x$ uniformly continuous on $(0,1)$ ?

  Is $\sin (1 / x)$ uniformly continuous on $(0,1)$ ?

  Justify your answers.

  comment

• 2.II.13B

  Analysis II | Part IB, 2005

  Use the standard metric on $\mathbf{R}^{n}$ in this question.

  (i) Let $A$ be a nonempty closed subset of $\mathbf{R}^{n}$ and $y$ a point in $\mathbf{R}^{n}$. Show that there is a point $x \in A$ which minimizes the distance to $y$, in the sense that $d(x, y) \leqslant d(a, y)$ for all $a \in A$.

  (ii) Suppose that the set $A$ in part (i) is convex, meaning that $A$ contains the line segment between any two of its points. Show that point $x \in A$ described in part (i) is unique.

  comment

• 3.I.3B

  Analysis II | Part IB, 2005

  Let $f: \mathbf{R}^{2} \rightarrow \mathbf{R}$ be a function. What does it mean to say that $f$ is differentiable at a point $(a, b)$ in $\mathbf{R}^{2}$ ? Show that if $f$ is differentiable at $(a, b)$, then $f$ is continuous at $(a, b)$.

  For each of the following functions, determine whether or not it is differentiable at $(0,0)$. Justify your answers.

  (i)

  $$f(x, y)= \begin{cases}x^{2} y^{2}\left(x^{2}+y^{2}\right)^{-1} & \text { if }(x, y) \neq(0,0) \\ 0 & \text { if }(x, y)=(0,0)\end{cases}$$

  (ii)

  $$f(x, y)= \begin{cases}x^{2}\left(x^{2}+y^{2}\right)^{-1} & \text { if }(x, y) \neq(0,0) \\ 0 & \text { if }(x, y)=(0,0)\end{cases}$$

  comment

• 3.II.13B

  Analysis II | Part IB, 2005

  Let $f$ be a real-valued differentiable function on an open subset $U$ of $\mathbf{R}^{n}$. Assume that $0 \notin U$ and that for all $x \in U$ and $\lambda>0, \lambda x$ is also in $U$. Suppose that $f$ is homogeneous of degree $c \in \mathbf{R}$, in the sense that $f(\lambda x)=\lambda^{c} f(x)$ for all $x \in U$ and $\lambda>0$. By means of the Chain Rule or otherwise, show that

  $$\left.D f\right|_{x}(x)=c f(x)$$

  for all $x \in U$. (Here $\left.D f\right|_{x}$ denotes the derivative of $f$ at $x$, viewed as a linear map $\mathbf{R}^{n} \rightarrow \mathbf{R}$.)

  Conversely, show that any differentiable function $f$ on $U$ with $\left.D f\right|_{x}(x)=c f(x)$ for all $x \in U$ must be homogeneous of degree $c$.

  comment

• 4.I 3 B

  Analysis II | Part IB, 2005

  Let $V$ be the vector space of continuous real-valued functions on $[0,1]$. Show that the function

  $$\|f\|=\int_{0}^{1}|f(x)| d x$$

  defines a norm on $V$.

  For $n=1,2, \ldots$, let $f_{n}(x)=e^{-n x}$. Is $f_{n}$ a convergent sequence in the space $V$ with this norm? Justify your answer.

  comment

• 4.II.13B

  Analysis II | Part IB, 2005

  Let $F:[-a, a] \times\left[x_{0}-r, x_{0}+r\right] \rightarrow \mathbf{R}$ be a continuous function. Let $C$ be the maximum value of $|F(t, x)|$. Suppose there is a constant $K$ such that

  $$|F(t, x)-F(t, y)| \leqslant K|x-y|$$

  for all $t \in[-a, a]$ and $x, y \in\left[x_{0}-r, x_{0}+r\right]$. Let $b<\min (a, r / C, 1 / K)$. Show that there is a unique $C^{1}$ function $x:[-b, b] \rightarrow\left[x_{0}-r, x_{0}+r\right]$ such that

  $$x(0)=x_{0}$$

  and

  $$\frac{d x}{d t}=F(t, x(t)) .$$

  [Hint: First show that the differential equation with its initial condition is equivalent to the integral equation

  $$\left.x(t)=x_{0}+\int_{0}^{t} F(s, x(s)) d s .\right]$$

  comment

2004

• $3 . \mathrm{II} . 16 \mathrm{~F} \quad$

  Analysis II | Part IB, 2004

  State and prove the contraction mapping theorem.

  Let $a$ be a positive real number, and take $X=\left[\sqrt{\frac{a}{2}}, \infty\right)$. Prove that the function

  $$f(x)=\frac{1}{2}\left(x+\frac{a}{x}\right)$$

  is a contraction from $X$ to $X$. Find the unique fixed point of $f$.

  comment

• 1.I.4G

  Analysis II | Part IB, 2004

  Define what it means for a sequence of functions $F_{n}:(0,1) \rightarrow \mathbb{R}$, where $n=1,2, \ldots$, to converge uniformly to a function $F$.

  For each of the following sequences of functions on $(0,1)$, find the pointwise limit function. Which of these sequences converge uniformly? Justify your answers.

  (i) $F_{n}(x)=\frac{1}{n} e^{x}$

  (ii) $F_{n}(x)=e^{-n x^{2}}$

  (iii) $F_{n}(x)=\sum_{i=0}^{n} x^{i}$

  comment

• 1.II.15G

  Analysis II | Part IB, 2004

  State the axioms for a norm on a vector space. Show that the usual Euclidean norm on $\mathbb{R}^{n}$,

  $$\|x\|=\left(x_{1}^{2}+x_{2}^{2}+\ldots+x_{n}^{2}\right)^{1 / 2}$$

  satisfies these axioms.

  Let $U$ be any bounded convex open subset of $\mathbb{R}^{n}$ that contains 0 and such that if $x \in U$ then $-x \in U$. Show that there is a norm on $\mathbb{R}^{n}$, satisfying the axioms, for which $U$ is the set of points in $\mathbb{R}^{n}$ of norm less than 1 .

  comment

• 2.I.3G

  Analysis II | Part IB, 2004

  Consider a sequence of continuous functions $F_{n}:[-1,1] \rightarrow \mathbb{R}$. Suppose that the functions $F_{n}$ converge uniformly to some continuous function $F$. Show that the integrals $\int_{-1}^{1} F_{n}(x) d x$ converge to $\int_{-1}^{1} F(x) d x$.

  Give an example to show that, even if the functions $F_{n}(x)$ and $F(x)$ are differentiable, the derivatives $F_{n}^{\prime}(0)$ need not converge to $F^{\prime}(0)$.

  comment

• 2.II.14G

  Analysis II | Part IB, 2004

  Let $X$ be a non-empty complete metric space. Give an example to show that the intersection of a descending sequence of non-empty closed subsets of $X, A_{1} \supset A_{2} \supset \cdots$, can be empty. Show that if we also assume that

  $$\lim _{n \rightarrow \infty} \operatorname{diam}\left(A_{n}\right)=0$$

  then the intersection is not empty. Here the diameter $\operatorname{diam}(A)$ is defined as the supremum of the distances between any two points of a set $A$.

  We say that a subset $A$ of $X$ is dense if it has nonempty intersection with every nonempty open subset of $X$. Let $U_{1}, U_{2}, \ldots$ be any sequence of dense open subsets of $X$. Show that the intersection $\bigcap_{n=1}^{\infty} U_{n}$ is not empty.

  [Hint: Look for a descending sequence of subsets $A_{1} \supset A_{2} \supset \cdots$, with $A_{i} \subset U_{i}$, such that the previous part of this problem applies.]

  comment

• 3.I.4F

  Analysis II | Part IB, 2004

  Let $X$ and $X^{\prime}$ be metric spaces with metrics $d$ and $d^{\prime}$. If $u=\left(x, x^{\prime}\right)$ and $v=\left(y, y^{\prime}\right)$ are any two points of $X \times X^{\prime}$, prove that the formula

  $$D(u, v)=\max \left\{d(x, y), d^{\prime}\left(x^{\prime}, y^{\prime}\right)\right\}$$

  defines a metric on $X \times X^{\prime}$. If $X=X^{\prime}$, prove that the diagonal $\Delta$ of $X \times X$ is closed in $X \times X$.

  comment

• 4.I.3F

  Analysis II | Part IB, 2004

  Let $U, V$ be open sets in $\mathbb{R}^{n}, \mathbb{R}^{m}$, respectively, and let $f: U \rightarrow V$ be a map. What does it mean for $f$ to be differentiable at a point $u$ of $U$ ?

  Let $g: \mathbb{R}^{2} \rightarrow \mathbb{R}$ be the map given by

  $$g(x, y)=|x|+|y|$$

  Prove that $g$ is differentiable at all points $(a, b)$ with $a b \neq 0$.

  comment

• 4.II.13F

  Analysis II | Part IB, 2004

  State the inverse function theorem for maps $f: U \rightarrow \mathbb{R}^{2}$, where $U$ is a non-empty open subset of $\mathbb{R}^{2}$.

  Let $f: \mathbb{R}^{2} \rightarrow \mathbb{R}^{2}$ be the function defined by

  $$f(x, y)=\left(x, x^{3}+y^{3}-3 x y\right) .$$

  Find a non-empty open subset $U$ of $\mathbb{R}^{2}$ such that $f$ is locally invertible on $U$, and compute the derivative of the local inverse.

  Let $C$ be the set of all points $(x, y)$ in $\mathbb{R}^{2}$ satisfying

  $$x^{3}+y^{3}-3 x y=0$$

  Prove that $f$ is locally invertible at all points of $C$ except $(0,0)$ and $\left(2^{2 / 3}, 2^{1 / 3}\right)$. Deduce that, for each point $(a, b)$ in $C$ except $(0,0)$ and $\left(2^{2 / 3}, 2^{1 / 3}\right)$, there exist open intervals $I, J$ containing $a, b$, respectively, such that for each $x$ in $I$, there is a unique point $y$ in $J$ with $(x, y)$ in $C$.

  comment

2003

• $3 . \mathrm{II} . 11 \mathrm{~F} \quad$

  Analysis II | Part IB, 2003

  State and prove the Contraction Mapping Theorem.

  Let $(X, d)$ be a bounded metric space, and let $F$ denote the set of all continuous maps $X \rightarrow X$. Let $\rho: F \times F \rightarrow \mathbb{R}$ be the function

  $$\rho(f, g)=\sup \{d(f(x), g(x)): x \in X\}$$

  Show that $\rho$ is a metric on $F$, and that $(F, \rho)$ is complete if $(X, d)$ is complete. [You may assume that a uniform limit of continuous functions is continuous.]

  Now suppose that $(X, d)$ is complete. Let $C \subseteq F$ be the set of contraction mappings, and let $\theta: C \rightarrow X$ be the function which sends a contraction mapping to its unique fixed point. Show that $\theta$ is continuous. [Hint: fix $f \in C$ and consider $d(\theta(g), f(\theta(g)))$, where $g \in C$ is close to $f$.]

  comment

• 1.I.1F

  Analysis II | Part IB, 2003

  Let $E$ be a subset of $\mathbb{R}^{n}$. Prove that the following conditions on $E$ are equivalent:

  (i) $E$ is closed and bounded.

  (ii) $E$ has the Bolzano-Weierstrass property (i.e., every sequence in $E$ has a subsequence convergent to a point of $E$ ).

  (iii) Every continuous real-valued function on $E$ is bounded.

  [The Bolzano-Weierstrass property for bounded closed intervals in $\mathbb{R}^{1}$ may be assumed.]

  comment

• 1.II.10F

  Analysis II | Part IB, 2003

  Explain briefly what is meant by a metric space, and by a Cauchy sequence in a metric space.

  A function $d: X \times X \rightarrow \mathbb{R}$ is called a pseudometric on $X$ if it satisfies all the conditions for a metric except the requirement that $d(x, y)=0$ implies $x=y$. If $d$ is a pseudometric on $X$, show that the binary relation $R$ on $X$ defined by $x R y \Leftrightarrow d(x, y)=0$ is an equivalence relation, and that the function $d$ induces a metric on the set $X / R$ of equivalence classes.

  Now let $(X, d)$ be a metric space. If $\left(x_{n}\right)$ and $\left(y_{n}\right)$ are Cauchy sequences in $X$, show that the sequence whose $n$th term is $d\left(x_{n}, y_{n}\right)$ is a Cauchy sequence of real numbers. Deduce that the function $\bar{d}$ defined by

  $$\bar{d}\left(\left(x_{n}\right),\left(y_{n}\right)\right)=\lim _{n \rightarrow \infty} d\left(x_{n}, y_{n}\right)$$

  is a pseudometric on the set $C$ of all Cauchy sequences in $X$. Show also that there is an isometric embedding (that is, a distance-preserving mapping) $X \rightarrow C / R$, where $R$ is the equivalence relation on $C$ induced by the pseudometric $\bar{d}$ as in the previous paragraph. Under what conditions on $X$ is $X \rightarrow C / R$ bijective? Justify your answer.

  comment

• 2.I.1F

  Analysis II | Part IB, 2003

  Explain what it means for a function $f: \mathbb{R}^{2} \rightarrow \mathbb{R}^{1}$ to be differentiable at a point $(a, b)$. Show that if the partial derivatives $\partial f / \partial x$ and $\partial f / \partial y$ exist in a neighbourhood of $(a, b)$ and are continuous at $(a, b)$ then $f$ is differentiable at $(a, b)$.

  Let

  $$f(x, y)=\frac{x y}{x^{2}+y^{2}} \quad((x, y) \neq(0,0))$$

  and $f(0,0)=0$. Do the partial derivatives of $f$ exist at $(0,0) ?$ Is $f$ differentiable at $(0,0) ?$ Justify your answers.

  comment

• 2.II.10F

  Analysis II | Part IB, 2003

  Let $V$ be the space of $n \times n$ real matrices. Show that the function

  $$N(A)=\sup \left\{\|A \mathbf{x}\|: \mathbf{x} \in \mathbb{R}^{n},\|\mathbf{x}\|=1\right\}$$

  (where $\|-\|$ denotes the usual Euclidean norm on $\mathbb{R}^{n}$ ) defines a norm on $V$. Show also that this norm satisfies $N(A B) \leqslant N(A) N(B)$ for all $A$ and $B$, and that if $N(A)<\epsilon$ then all entries of $A$ have absolute value less than $\epsilon$. Deduce that any function $f: V \rightarrow \mathbb{R}$ such that $f(A)$ is a polynomial in the entries of $A$ is continuously differentiable.

  Now let $d: V \rightarrow \mathbb{R}$ be the mapping sending a matrix to its determinant. By considering $d(I+H)$ as a polynomial in the entries of $H$, show that the derivative $d^{\prime}(I)$ is the function $H \mapsto \operatorname{tr} H$. Deduce that, for any $A, d^{\prime}(A)$ is the mapping $H \mapsto \operatorname{tr}((\operatorname{adj} A) H)$, where $\operatorname{adj} A$ is the adjugate of $A$, i.e. the matrix of its cofactors.

  [Hint: consider first the case when $A$ is invertible. You may assume the results that the set $U$ of invertible matrices is open in $V$ and that its closure is the whole of $V$, and the identity $(\operatorname{adj} A) A=\operatorname{det} A . I$.]

  comment

• 3.I.1F

  Analysis II | Part IB, 2003

  Let $V$ be the vector space of continuous real-valued functions on $[-1,1]$. Show that the function

  $$\|f\|=\int_{-1}^{1}|f(x)| d x$$

  defines a norm on $V$.

  Let $f_{n}(x)=x^{n}$. Show that $\left(f_{n}\right)$ is a Cauchy sequence in $V$. Is $\left(f_{n}\right)$ convergent? Justify your answer.

  comment

• 4.I.1F

  Analysis II | Part IB, 2003

  Explain what it means for a sequence of functions $\left(f_{n}\right)$ to converge uniformly to a function $f$ on an interval. If $\left(f_{n}\right)$ is a sequence of continuous functions converging uniformly to $f$ on a finite interval $[a, b]$, show that

  $$\int_{a}^{b} f_{n}(x) d x \longrightarrow \int_{a}^{b} f(x) d x \quad \text { as } n \rightarrow \infty$$

  Let $f_{n}(x)=x \exp (-x / n) / n^{2}, x \geqslant 0$. Does $f_{n} \rightarrow 0$ uniformly on $[0, \infty) ?$ Does $\int_{0}^{\infty} f_{n}(x) d x \rightarrow 0$ ? Justify your answers.

  comment

• 4.II.10F

  Analysis II | Part IB, 2003

  Let $\left(f_{n}\right)_{n \geqslant 1}$ be a sequence of continuous complex-valued functions defined on a set $E \subseteq \mathbb{C}$, and converging uniformly on $E$ to a function $f$. Prove that $f$ is continuous on $E$.

  State the Weierstrass $M$-test for uniform convergence of a series $\sum_{n=1}^{\infty} u_{n}(z)$ of complex-valued functions on a set $E$.

  Now let $f(z)=\sum_{n=1}^{\infty} u_{n}(z)$, where

  $$u_{n}(z)=n^{-2} \sec (\pi z / 2 n) .$$

  Prove carefully that $f$ is continuous on $\mathbb{C} \backslash \mathbb{Z}$.

  [You may assume the inequality $|\cos z| \geqslant|\cos (\operatorname{Re} z)| \cdot]$

  comment

2002

• $3 . \mathrm{II} . 11 \mathrm{E} \quad$

  Analysis II | Part IB, 2002

  Show that if $a, b$ and $c$ are non-negative numbers, and $a \leqslant b+c$, then

  $$\frac{a}{1+a} \leqslant \frac{b}{1+b}+\frac{c}{1+c}$$

  Deduce that if $(X, d)$ is a metric space, then $d(x, y) /[1+d(x, y)]$ is a metric on $X$.

  Let $D=\{z \in \mathbb{C}:|z|<1\}$ and $K_{n}=\{z \in D:|z| \leqslant(n-1) / n\}$. Let $\mathcal{F}$ be the class of continuous complex-valued functions on $D$ and, for $f$ and $g$ in $\mathcal{F}$, define

  $$\sigma(f, g)=\sum_{n=2}^{\infty} \frac{1}{2^{n}} \frac{\|f-g\|_{n}}{1+\|f-g\|_{n}}$$

  where $\|f-g\|_{n}=\sup \left\{|f(z)-g(z)|: z \in K_{n}\right\}$. Show that the series for $\sigma(f, g)$ converges, and that $\sigma$ is a metric on $\mathcal{F}$.

  For $|z|<1$, let $s_{k}(z)=1+z+z^{2}+\cdots+z^{k}$ and $s(z)=1+z+z^{2}+\cdots$. Show that for $n \geqslant 2,\left\|s_{k}-s\right\|_{n}=n\left(1-\frac{1}{n}\right)^{k+1}$. By considering the sums for $2 \leqslant n \leqslant N$ and $n>N$ separately, show that for each $N$,

  $$\sigma\left(s_{k}, s\right) \leqslant \sum_{n=2}^{N}\left\|s_{k}-s\right\|_{n}+2^{-N},$$

  and deduce that $\sigma\left(s_{k}, s\right) \rightarrow 0$ as $k \rightarrow \infty$.

  comment

• 1.I.1E

  Analysis II | Part IB, 2002

  Suppose that for each $n=1,2, \ldots$, the function $f_{n}: \mathbb{R} \rightarrow \mathbb{R}$ is uniformly continuous on $\mathbb{R}$.

  (a) If $f_{n} \rightarrow f$ pointwise on $\mathbb{R}$ is $f$ necessarily continuous on $\mathbb{R}$ ?

  (b) If $f_{n} \rightarrow f$ uniformly on $\mathbb{R}$ is $f$ necessarily continuous on $\mathbb{R}$ ?

  In each case, give a proof or a counter-example (with justification).

  comment

• 1.II.10E

  Analysis II | Part IB, 2002

  Suppose that $(X, d)$ is a metric space that has the Bolzano-Weierstrass property (that is, any sequence has a convergent subsequence). Let $\left(Y, d^{\prime}\right)$ be any metric space, and suppose that $f$ is a continuous map of $X$ onto $Y$. Show that $\left(Y, d^{\prime}\right)$ also has the Bolzano-Weierstrass property.

  Show also that if $f$ is a bijection of $X$ onto $Y$, then $f^{-1}: Y \rightarrow X$ is continuous.

  By considering the map $x \mapsto e^{i x}$ defined on the real interval $[-\pi / 2, \pi / 2]$, or otherwise, show that there exists a continuous choice of arg $z$ for the complex number $z$ lying in the right half-plane $\{x+i y: x>0\}$.

  comment

• 2.I.1E

  Analysis II | Part IB, 2002

  Define what is meant by (i) a complete metric space, and (ii) a totally bounded metric space.

  Give an example of a metric space that is complete but not totally bounded. Give an example of a metric space that is totally bounded but not complete.

  Give an example of a continuous function that maps a complete metric space onto a metric space that is not complete. Give an example of a continuous function that maps a totally bounded metric space onto a metric space that is not totally bounded.

  [You need not justify your examples.]

  comment

• 2.II.10E

  Analysis II | Part IB, 2002

  (a) Let $f$ be a map of a complete metric space $(X, d)$ into itself, and suppose that there exists some $k$ in $(0,1)$, and some positive integer $N$, such that $d\left(f^{N}(x), f^{N}(y)\right) \leqslant$ $k d(x, y)$ for all distinct $x$ and $y$ in $X$, where $f^{m}$ is the $m$ th iterate of $f$. Show that $f$ has a unique fixed point in $X$.

  (b) Let $f$ be a map of a compact metric space $(X, d)$ into itself such that $d(f(x), f(y))<d(x, y)$ for all distinct $x$ and $y$ in $X$. By considering the function $d(f(x), x)$, or otherwise, show that $f$ has a unique fixed point in $X$.

  (c) Suppose that $f: \mathbb{R}^{n} \rightarrow \mathbb{R}^{n}$ satisfies $|f(x)-f(y)|<|x-y|$ for every distinct $x$ and $y$ in $\mathbb{R}^{n}$. Suppose that for some $x$, the orbit $O(x)=\left\{x, f(x), f^{2}(x), \ldots\right\}$ is bounded. Show that $f$ maps the closure of $O(x)$ into itself, and deduce that $f$ has a unique fixed point in $\mathbb{R}^{n}$.

  [The Contraction Mapping Theorem may be used without proof providing that it is correctly stated.]

  comment

• 3.I.1E

  Analysis II | Part IB, 2002

  Let $f: \mathbb{R} \rightarrow \mathbb{R}^{2}$ be defined by $f=(u, v)$, where $u$ and $v$ are defined by $u(0)=v(0)=0$ and, for $t \neq 0, u(t)=t^{2} \sin (1 / t)$ and $v(t)=t^{2} \cos (1 / t)$. Show that $f$ is differentiable on $\mathbb{R}$.

  Show that for any real non-zero $a,\left\|f^{\prime}(a)-f^{\prime}(0)\right\|>1$, where we regard $f^{\prime}(a)$ as the vector $\left(u^{\prime}(a), v^{\prime}(a)\right)$ in $\mathbb{R}^{2}$.

  comment

• 4.I.1E

  Analysis II | Part IB, 2002

  (a) Let $(X, d)$ be a metric space containing the point $x_{0}$, and let

  $$U=\left\{x \in X: d\left(x, x_{0}\right)<1\right\}, \quad K=\left\{x \in X: d\left(x, x_{0}\right) \leqslant 1\right\}$$

  Is $U$ necessarily the largest open subset of $K$ ? Is $K$ necessarily the smallest closed set that contains $U$ ? Justify your answers.

  (b) Let $X$ be a normed space with norm $\|\cdot\|$, and let

  $$U=\{x \in X:\|x\|<1\}, \quad K=\{x \in X:\|x\| \leqslant 1\}$$

  Is $U$ necessarily the largest open subset of $K$ ? Is $K$ necessarily the smallest closed set that contains $U$ ? Justify your answers.

  comment

• 4.II.10E

  Analysis II | Part IB, 2002

  (a) Let $V$ be a finite-dimensional real vector space, and let $\left\|_{1}\right\|_{1}$ and $\|\cdot\|_{2}$ be two norms on $V$. Show that a function $f: V \rightarrow \mathbb{R}$ is differentiable at a point $a$ in $V$ with respect to $\|\cdot\|_{1}$ if and only if it is differentiable at $a$ with respect to $\|\cdot\|_{2}$, and that if this is so then the derivative $f^{\prime}(a)$ of $f$ is independent of the norm used. [You may assume that all norms on a finite-dimensional vector space are equivalent.]

  (b) Let $V_{1}, V_{2}$ and $V_{3}$ be finite-dimensional normed real vector spaces with $V_{j}$ having norm $\|\cdot\|_{j}, j=1,2,3$, and let $f: V_{1} \times V_{2} \rightarrow V_{3}$ be a continuous bilinear mapping. Show that $f$ is differentiable at any point $(a, b)$ in $V_{1} \times V_{2}$, and that $f^{\prime}(a, b)(h, k)=$ $f(h, b)+f(a, k) . \quad$ [You may assume that $\left(\|u\|_{1}^{2}+\|v\|_{2}^{2}\right)^{1 / 2}$ is a norm on $V_{1} \times V_{2}$, and that $\left\{(x, y) \in V_{1} \times V_{2}:\|x\|_{1}=1,\|y\|_{2}=1\right\}$ is compact.]

  comment

2001

• 1.I.1A

  Analysis II | Part IB, 2001

  Define uniform continuity for functions defined on a (bounded or unbounded) interval in $\mathbb{R}$.

  Is it true that a real function defined and uniformly continuous on $[0,1]$ is necessarily bounded?

  Is it true that a real function defined and with a bounded derivative on $[1, \infty)$ is necessarily uniformly continuous there?

  Which of the following functions are uniformly continuous on $[1, \infty)$ :

  (i) $x^{2}$;

  (ii) $\sin \left(x^{2}\right)$;

  (iii) $\frac{\sin x}{x}$ ?

  Justify your answers.

  comment

• 1.II.10A

  Analysis II | Part IB, 2001

  Show that each of the functions below is a metric on the set of functions $x(t) \in$ $C[a, b]$ :

  $$\begin{gathered} d_{1}(x, y)=\sup _{t \in[a, b]}|x(t)-y(t)| \\ d_{2}(x, y)=\left\{\int_{a}^{b}|x(t)-y(t)|^{2} d t\right\}^{1 / 2} \end{gathered}$$

  Is the space complete in the $d_{1}$ metric? Justify your answer.

  Show that the set of functions

  $$x_{n}(t)= \begin{cases}0, & -1 \leqslant t<0 \\ n t, & 0 \leqslant t<1 / n \\ 1, & 1 / n \leqslant t \leqslant 1\end{cases}$$

  is a Cauchy sequence with respect to the $d_{2}$ metric on $C[-1,1]$, yet does not tend to a limit in the $d_{2}$ metric in this space. Hence, deduce that this space is not complete in the $d_{2}$ metric.

  comment

• 2.I.1A

  Analysis II | Part IB, 2001

  State and prove the contraction mapping theorem.

  Let $A=\{x, y, z\}$, let $d$ be the discrete metric on $A$, and let $d^{\prime}$ be the metric given by: $d^{\prime}$ is symmetric and

  $$\begin{gathered} d^{\prime}(x, y)=2, d^{\prime}(x, z)=2, d^{\prime}(y, z)=1 \\ d^{\prime}(x, x)=d^{\prime}(y, y)=d^{\prime}(z, z)=0 \end{gathered}$$

  Verify that $d^{\prime}$ is a metric, and that it is Lipschitz equivalent to $d$.

  Define an appropriate function $f: A \rightarrow A$ such that $f$ is a contraction in the $d^{\prime}$ metric, but not in the $d$ metric.

  comment

• 2.II.10A

  Analysis II | Part IB, 2001

  Define total boundedness for metric spaces.

  Prove that a metric space has the Bolzano-Weierstrass property if and only if it is complete and totally bounded.

  comment

• 3.I.1A

  Analysis II | Part IB, 2001

  Define what is meant by a norm on a real vector space.

  (a) Prove that two norms on a vector space (not necessarily finite-dimensional) give rise to equivalent metrics if and only if they are Lipschitz equivalent.

  (b) Prove that if the vector space $V$ has an inner product, then for all $x, y \in V$,

  $$\|x+y\|^{2}+\|x-y\|^{2}=2\|x\|^{2}+2\|y\|^{2},$$

  in the induced norm.

  Hence show that the norm on $\mathbb{R}^{2}$ defined by $\|x\|=\max \left(\left|x_{1}\right|,\left|x_{2}\right|\right)$, where $x=\left(x_{1}, x_{2}\right) \in$ $\mathbb{R}^{2}$, cannot be induced by an inner product.

  comment

• 3.II.11A

  Analysis II | Part IB, 2001

  Prove that if all the partial derivatives of $f: \mathbb{R}^{p} \rightarrow \mathbb{R}$ (with $p \geqslant 2$ ) exist in an open set containing $(0,0, \ldots, 0)$ and are continuous at this point, then $f$ is differentiable at $(0,0, \ldots, 0)$.

  Let

  $$g(x)= \begin{cases}x^{2} \sin (1 / x), & x \neq 0 \\ 0, & x=0\end{cases}$$

  and

  $$f(x, y)=g(x)+g(y) .$$

  At which points of the plane is the partial derivative $f_{x}$ continuous?

  At which points is the function $f(x, y)$ differentiable? Justify your answers.

  comment

• 4.I.1A

  Analysis II | Part IB, 2001

  Let $f$ be a mapping of a metric space $(X, d)$ into itself such that $d(f(x), f(y))<$ $d(x, y)$ for all distinct $x, y$ in $\mathrm{X}$.

  Show that $f(x)$ and $d(x, f(x))$ are continuous functions of $x$.

  Now suppose that $(X, d)$ is compact and let

  $$h=\inf _{x \in X} d(x, f(x))$$

  Show that we cannot have $h>0$.

  [You may assume that a continuous function on a compact metric space is bounded and attains its bounds.]

  Deduce that $f$ possesses a fixed point, and that it is unique.

  comment

• 4.II.10A

  Analysis II | Part IB, 2001

  Let $\left\{f_{n}\right\}$ be a pointwise convergent sequence of real-valued functions on a closed interval $[a, b]$. Prove that, if for every $x \in[a, b]$, the sequence $\left\{f_{n}(x)\right\}$ is monotonic in $n$, and if all the functions $f_{n}, n=1,2, \ldots$, and $f=\lim f_{n}$ are continuous, then $f_{n} \rightarrow f$ uniformly on $[a, b]$.

  By considering a suitable sequence of functions $\left\{f_{n}\right\}$ on $[0,1)$, show that if the interval is not closed but all other conditions hold, the conclusion of the theorem may fail.

  comment