Past exam of the mathematics course of the University of Cambridge / 2018 / ib / Paper 2 / 12F (Analysis II)

A map $f:A\to \mathbb{R}$ is Lipschitz continuous with Lipschitz constant $L$ whenfor all $y,z\in A$.

Fix $y_0\in A$. The Lipschitz inequality and the triangle inequality implywhile choosing $y=y_0$ gives a finite upper bound. Hence the infimum defining $F(x)$ is a real number.

If $x\in A$, then $f(x)\le f(y)+Ld(x,y)$ for every $y\in A$, while $y=x$ gives the reverse inequality after taking the infimum. Thus $F(x)=f(x)$. For arbitrary $x,z\in X$,Taking infima gives $F(x)\le F(z)+Ld(x,z)$; interchanging $x,z$ givesThis is the McShane extension theorem: $F$ extends $f$ without increasing its Lipschitz constant.

Two norms $N_1,N_2$ are equivalent norms when constants $c,C>0$ satisfyfor every $v$.

For $x,y\in {\mathbb{R}}^n$, the reverse triangle inequality givesby the Cauchy-Schwarz inequality. Hence $g$ is Lipschitz continuous, and therefore continuous.

On the compact Euclidean unit sphere, $g$ is positive and continuous, so the extreme value theorem gives $0<m\le g\le M<\infty$. Homogeneity then yieldsThus every norm on a finite-dimensional vector space is equivalent to the Euclidean norm; comparing two such bounds proves any two norms on $V$ are Lipschitz equivalent.

Let $P_n$ be the finite-dimensional vector space of real polynomials of degree at most $n$. For fixed $a>0$,is a norm: if it vanishes, the polynomial vanishes on an interval and hence is the zero polynomial. Alsois a norm on $P_n$. By finite-dimensional equivalence of norms, there is $C>0$, depending only on $n$ and $a$, such that $M(p)\le CN(p)$. ThereforeThe extreme value theorem supplies $y\in [0,a]$ at which the last supremum is attained, and hence