Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (gpt-6-sol)
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.

The dual of a closed subspace is a dual quotient

Statement

Assume the Axiom of Choice. Let K=R or C. Let X be normed and M≤X closed. Restriction R:X∗→M∗ induces a linear isometric bijection R~:X∗/M⊥⟶M∗,f+M⊥⟼f∣M. Also ∥R∥≤1; its norm is 1 when M≠{0} and 0 when M={0}.

Facts & Assumptions

Given: The Axiom of Choice, The spaces, maps, scalar field, and hypotheses in the statement above. All duals consist of linear functionals over the ambient field; evaluation has no conjugation.

[A1]

AC is used through norm-preserving extension [F4] in steps 2.1 and 3.1.

[F1]

From Annihilator notation and the preannihilator, with its stated hypotheses: Let K=R or C. For a normed X and arbitrary subsets M⊆X, N⊆X∗, define M⊥={f∈X∗:f(m)=0 for all m∈M},⊥N={x∈X:f(x)=0 for all f∈N}. Here X∗ is def-dual-space-of-a-normed-space. The first notation agrees with def-continuous-annihilator-of-a-subspace on span⁡M, since linearity makes vanishing on M equivalent to vanishing on its span. The preannihilator lies in X, not in X∗∗. Empty sets impose no conditions: ∅⊥=X∗ and ⊥∅=X.

[F2]

From Annihilators and preannihilators are norm closed, with its stated hypotheses: Let K=R or C. For any normed X and arbitrary M⊆X, N⊆X∗, both M⊥⊆X∗ and ⊥N⊆X are norm-closed linear subspaces. Moreover N‾∥⋅∥⊆(⊥N)⊥.

[F3]

From A bounded operator that vanishes on a subspace factors uniquely through the normed quotient, with its stated hypotheses: Let X and Y be normed spaces over the same scalar field, let M≤X be a closed linear subspace, let q:X→X/M be the quotient map, and let T:X→Y be a bounded linear operator with M⊆ker⁡T. Then there is a unique bounded linear operator T‾:X/M→Y such that T‾∘q=T, and moreover ∥T‾∥=∥T∥.

[F4]

From A bounded linear functional on an arbitrary subspace extends with the same norm, without assuming the subspace is closed, with its stated hypotheses: Let X be a normed space over R or C, let M⊆X be a linear subspace, and let f0:M→R or f0:M→C be a bounded linear functional over the ambient scalar field. Then there exists a bounded linear extension F of f0 to all of X such that ∥F∥=∥f0∥. No closedness hypothesis on M is needed.

Proof

1.1F1F2F3

The inequality ∥f∣M∥≤∥f∥ makes restriction bounded. Its kernel is M⊥, which is closed. Thus equal cosets have equal restrictions, and the quotient universal property gives a bounded linear induced map; the kernel calculation makes it injective.

2.1F4step 1.1

For h∈M∗, norm-preserving extension gives f∈X∗ with f∣M=h and ∥f∥=∥h∥, proving surjectivity. Every other representative f+a, a∈M⊥, restricts to h, so ∥f+a∥≥∥h∥. Taking the infimum and using this extension proves ∥f+M⊥∥=∥h∥.

3.1F4step 1.1step 2.1∎

If M≠{0}, fix m∈M∖{0}. The functional λm↦λ∥m∥ on its line has norm one. Extend first to M and then to X by norm-preserving extension; its restriction and extension both have norm one, so ∥R∥≥1. If M={0}, R=0. For M=X the induced map is the identity, including the zero ambient space.

Depends on

Used by

Dependency tree · two levels

17 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