Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A bounded real linear functional on a subspace of a real normed space extends with the same norm

Statement

Assume the Axiom of Choice. Let X be a real normed space, let M⊆X be a linear subspace, and let f0:M→R be a bounded linear functional. Then there exists a bounded linear functional F:X→R such that F∣M=f0 and ∥F∥=∥f0∥.

Facts & Assumptions

Given: The Axiom of Choice, A real normed space X, a linear subspace M⊆X, and a bounded real linear functional f0:M→R.

[A1]

AC is used through dominated Hahn–Banach extension [L1] in step 2.1.

[L1]

A dominated real linear functional extends to the whole real vector space (Hahn-Banach dominated extension theorem for real vector spaces).

[L2]

A bounded linear operator has some constant C≥0 with ∥Tx∥≤C∥x∥ for every x (A bounded linear operator between normed spaces).

[L3]

The operator norm is the least such bound: ∥T∥=inf⁡{C≥0:∥Tx∥≤C∥x∥ for all x} (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[L4]

A normed subspace carries the restricted norm from the ambient space (Normed subspace).

Proof

technique · direct
1.1L3L4givenconstructalgebra

Define p:X→R by p(x):=∥f0∥ ∥x∥. The triangle inequality and real homogeneity of the norm make p sublinear. For m∈M, [L3] and [L4] give f0(m)≤∣f0(m)∣≤∥f0∥ ∥m∥=p(m), so f0≤p on M.

2.1L1step 1.1

By [L1], there exists a linear functional F:X→R extending f0 and satisfying F(x)≤p(x) for every x∈X.

3.1step 2.1L2L3algebra

Apply step 2.1 to x and to −x. Since p(−x)=p(x), one gets − ∥f0∥ ∥x∥≤F(x)≤∥f0∥ ∥x∥, hence ∣F(x)∣≤∥f0∥ ∥x∥(x∈X). So F is bounded in the sense of [L2], and [L3] gives ∥F∥≤∥f0∥.

3.2step 2.1L3L4

Since F∣M=f0, for every m∈M with ∥m∥≤1 one has ∣f0(m)∣=∣F(m)∣≤∥F∥. Taking the supremum over the unit ball of the normed subspace M and using [L3] and [L4] yields ∥f0∥≤∥F∥.

4.1step 3.1step 3.2∎

Steps 3.1 and 3.2 give ∥F∥=∥f0∥, so F is the required norm-preserving extension.

Depends on

Used by

Dependency tree · two levels

15 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources