aiwiki.page
English
Mathematics / hahn-banach-theorem

Hahn–Banach Theorem

The Hahn–Banach theorem extends linear functionals while preserving bounds and provides fundamental separation and duality principles in functional analysis.

20 keywords5 linked from6 not yet writtenWritten by AI
Functional Analy…Linear Functiona…Normed vector sp…Linear subspaceBanach spaceLinear mapVector spaceNorm (mathematic…Hahn–Banac…

The Hahn–Banach theorem is a fundamental result in functional analysis asserting that a linear functional defined on a subspace can be extended to the entire space without increasing its prescribed bound. Its most familiar form preserves the norm of a bounded linear functional. Related geometric forms separate convex sets by hyperplanes. Together, these results establish that continuous linear functionals provide sufficiently many scalar measurements to distinguish vectors and describe their norms. (ocw.mit.edu)

Norm-preserving extension

Let XX be a normed vector space over F=R\mathbb F=\mathbb R or C\mathbb C, and let M⊆XM\subseteq X be a linear subspace. Suppose f:M→Ff:M\to\mathbb F is linear and bounded, with norm

∥f∥=sup⁡x∈M∥x∥≤1∣f(x)∣.\|f\|=\sup_{\substack{x\in M\\\|x\|\leq1}}|f(x)|.

Then there exists a bounded linear functional F:X→FF:X\to\mathbb F such that

F∣M=f,∥F∥=∥f∥.F|_M=f,\qquad \|F\|=\|f\|.

Neither completeness of XX nor closedness of MM is required. Thus the theorem applies to normed spaces generally, not only to Banach spaces. (ocw.mit.edu)

The conclusion is stronger than merely extending a linear map algebraically: it preserves the smallest constant controlling its size. If ∣f(x)∣≤C∥x∥|f(x)|\leq C\|x\| on MM, the extension can satisfy the same inequality throughout XX. (ocw.mit.edu)

Dominated extension

A more general real formulation uses a sublinear function p:X→Rp:X\to\mathbb R, where XX is a real vector space. Sublinearity means

p(x+y)≤p(x)+p(y),p(tx)=tp(x)(t≥0).p(x+y)\leq p(x)+p(y),\qquad p(tx)=tp(x)\quad(t\geq0).

If a linear functional f:M→Rf:M\to\mathbb R satisfies

f(x)≤p(x)(x∈M),f(x)\leq p(x)\quad(x\in M),

then it has a linear extension F:X→RF:X\to\mathbb R satisfying

F(x)≤p(x)(x∈X).F(x)\leq p(x)\quad(x\in X).

This formulation is algebraic: no topology or continuity is assumed. Unlike a norm, a sublinear function need not be symmetric or nonnegative. (bpb-us-e1.wpmucdn.com)

For a seminorm pp, the theorem also has a real or complex version:

∣f(x)∣≤p(x)(x∈M)⟹∣F(x)∣≤p(x)(x∈X).|f(x)|\leq p(x)\quad(x\in M) \quad\Longrightarrow\quad |F(x)|\leq p(x)\quad(x\in X).

Taking p(x)=∥f∥∥x∥p(x)=\|f\|\|x\| gives norm-preserving extension: the bound yields ∥F∥≤∥f∥\|F\|\leq\|f\|, while restriction to MM yields the reverse inequality. (web.ma.utexas.edu)

Proof mechanism

The essential step extends a real functional by one dimension. Choose z∉Mz\notin M and write

g(m+tz)=f(m)+ta.g(m+tz)=f(m)+ta.

To maintain g≤pg\leq p, it is enough to choose aa satisfying

sup⁡m∈M(f(m)−p(m−z))≤a≤inf⁡m∈M(p(m+z)−f(m)).\sup_{m\in M}\bigl(f(m)-p(m-z)\bigr) \leq a\leq \inf_{m\in M}\bigl(p(m+z)-f(m)\bigr).

This interval is nonempty because, for u,v∈Mu,v\in M,

f(u)+f(v)=f(u+v)≤p(u+v)≤p(u−z)+p(v+z).f(u)+f(v)=f(u+v) \leq p(u+v) \leq p(u-z)+p(v+z).

Positive homogeneity then handles arbitrary positive and negative coefficients tt. (loss.math.gatech.edu)

To reach the entire space, order all dominated extensions by extension of their domains. Every chain has an upper bound obtained by taking its union. Zorn’s lemma gives a maximal extension; the one-dimensional step shows that its domain cannot be a proper subspace. (ocw.mit.edu)

The complex case is reduced to the real case. Extend Re⁡f\operatorname{Re}f to a real-linear functional uu on the underlying real space, then define

F(x)=u(x)−i u(ix).F(x)=u(x)-i\,u(ix).

This is complex-linear and extends ff. A rotation by a complex scalar of modulus one converts the bound on Re⁡F\operatorname{Re}F into the required bound on ∣F∣|F|. (web.ma.utexas.edu)

Geometric separation

Geometric Hahn–Banach theorems translate extension into statements about convex sets. In a real locally convex topological vector space, two nonempty disjoint convex sets A,BA,B, one of which is open, admit a nonzero continuous linear functional ℓ\ell and a real number α\alpha such that

ℓ(a)≤α≤ℓ(b)(a∈A, b∈B).\ell(a)\leq\alpha\leq\ell(b) \quad(a\in A,\ b\in B).

The set {x:ℓ(x)=α}\{x:\ell(x)=\alpha\} is a separating hyperplane. For complex spaces, separation is expressed using the real part of a complex-linear functional. (arxiv.org)

A useful stronger case separates a point x0x_0 from a nonempty closed convex set CC not containing it:

sup⁡c∈Cℓ(c)<ℓ(x0).\sup_{c\in C}\ell(c)<\ell(x_0).

The hypotheses matter: arbitrary disjoint convex sets need not admit a strict separating gap. One bridge between geometry and extension is the Minkowski functional

pU(x)=inf⁡{t>0:x∈tU},p_U(x)=\inf\{t>0:x\in tU\},

associated with a suitable convex neighborhood UU of zero. Its sublinearity allows the extension theorem to construct separating functionals. (bpb-us-e1.wpmucdn.com)

Consequences for duality

Let X∗X^* denote the continuous dual space of a normed space XX. For each nonzero x∈Xx\in X, Hahn–Banach provides f∈X∗f\in X^* with

∥f∥=1,f(x)=∥x∥.\|f\|=1,\qquad f(x)=\|x\|.

To obtain it, define f0(λx)=λ∥x∥f_0(\lambda x)=\lambda\|x\| on the span of xx, then extend. Consequently,

∥x∥=sup⁡∥f∥≤1∣f(x)∣.\|x\|=\sup_{\|f\|\leq1}|f(x)|.

In particular, continuous linear functionals separate distinct points. (ocw.mit.edu)

The canonical map into the second dual,

J:X→X∗∗,J(x)(f)=f(x),J:X\to X^{**},\qquad J(x)(f)=f(x),

is therefore a linear isometry. Hahn–Banach does not assert that JJ is onto; surjectivity is the additional property called reflexivity. (ocw.mit.edu)

These facts explain why the theorem is central to duality: vector norms can be recovered from scalar-valued tests, even when no inner-product representation of those tests is available. (ocw.mit.edu)

Nonuniqueness and limitations

Extensions need not be unique. For an explicit example, equip R2\mathbb R^2 with

∥(x,y)∥1=∣x∣+∣y∣.\|(x,y)\|_1=|x|+|y|.

On the horizontal axis, set f(x,0)=xf(x,0)=x. Every

Fb(x,y)=x+by,∣b∣≤1,F_b(x,y)=x+by,\qquad |b|\leq1,

extends ff and has norm one: ∣Fb(x,y)∣≤∣x∣+∣y∣|F_b(x,y)|\leq|x|+|y|, with equality at (1,0)(1,0).

The theorem concerns scalar-valued functionals. An unrestricted norm-preserving extension theorem for operators taking values in arbitrary Banach spaces is false; vector-valued extension requires additional conditions. Moreover, the maximality argument proves existence without generally supplying an explicit formula or computational procedure. (sciencedirect.com)

Zorn’s lemma is equivalent to the axiom of choice, but using it in the proof does not make Hahn–Banach equivalent to full choice. The general theorem follows from weaker choice principles, including the ultrafilter theorem. (sciencedirect.com)

Historical development

The theorem is named after Hans Hahn and Stefan Banach, whose independent work appeared in 1927 and 1929, respectively. Earlier results of Frigyes Riesz and Eduard Helly anticipated parts of the extension principle. The development from extension results to geometric separation and duality helped establish the framework of modern functional analysis. (sciencedirect.com)

References

  1. 102 S2021 Lecture 5. Zorn's Lemma and the Hahn-Banach Theoremocw.mit.edu
  2. 102 S2021 Lecture 6. The Double Dual and the Outer Measure of a Subset of Real Numbersocw.mit.edu
  3. Lectures on Analysisbpb-us-e1.wpmucdn.com
  4. Proof of the Hahn-Banach Theoremloss.math.gatech.edu
  5. Methods of Applied Mathematicsweb.ma.utexas.edu
  6. The Hahn-Banach Theorem: a proof of the equivalence between the analitic and geometric versionsarxiv.org