Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 106 / 3 / a

The Hahn-Banach separation theorem for two convex sets states that disjoint nonempty convex sets $A,B$ in a real locally convex space, with $A$ open, admit a nonzero continuous linear functional $\ell$ and $\alpha \in \mathbb{R}$ such thatThere need not be a positive uniform gap between the two sets.

For a proof, set $C=A-B$. It is open and convex, and $0\notin C$. Choose $c_0\in C$, let $V=C-c_0$, and let $p$ be the Minkowski functional of $V$. Because $V$ is open, convex and contains zero, $p$ is a finite sublinear functional, and $V=\{x:p(x)<1\}$. Put $z=-c_0$. Since $z\notin V$, $p(z)\ge 1$. On $\mathbb{R}z$ define ${\ell }_0(tz)=tp(z)$. For $t\ge 0$ this equals $p(tz)$; for $t<0$ it is nonpositive and hence at most $p(tz)$. The Hahn-Banach theorem extends it to a linear $\ell$ with $\ell \le p$. Both $p(x)$ and $p(-x)$ are bounded near zero, so this domination makes $\ell$ continuous; it is nonzero because $\ell (z)=p(z)\ge 1$. For $c\in C$,Thus $\ell (a)<\ell (b)$ for every $a\in A,b\in B$. Define $\alpha ={\sup }_{a\in A}\ell (a)$, which is finite because any fixed $b\in B$ bounds it above. Openness of $A$ and nonzeroness of $\ell$ ensure $\ell (a)<\alpha$ for every $a\in A$, and $\alpha \le \ell (b)$ for every $b\in B$. This proves the stated separation.

For the sequence criterion, suppose $f\in S_{X^{\ast }}$ and $f(x_i)\ge \varrho$. If each $t_i\ge 0$, thenConversely, the assumed inequality implies that every convex combination of the $x_i$ has norm at least $\varrho$. Hence $D=\{x:\Vert x\Vert <\varrho \}$ is disjoint from $C=\mathrm{conv}\{x_i:i\ge 1\}$. Apply the separation theorem with the open set $D$ to obtain $\ell \ne 0$ andThen $f=\ell /\Vert \ell \Vert$ has norm one and satisfies $f(x_i)\ge \varrho$ for every $i$. ThereforeThe PDF confirms the “if and only if” that is garbled in the TeX transcription.