Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 quotient is its annihilator

Statement

Let K=R or C. Let X be normed and M≤X closed. With quotient norm ∥x+M∥=inf⁡m∈M∥x+m∥ and q(x)=x+M, the map Q:(X/M)∗⟶M⊥,Qh=h∘q is a linear isometric bijection.

Facts & Assumptions

Given: 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.

[F1]

From The dual space X^* of a normed space and its dual norm, with its stated hypotheses: Let X be a normed space over the scalar field K, where K=R in the literal definition and K=C by the convention of rem-real-and-complex-normed-space-convention. The dual space of X is X∗:=B(X,K), the space of bounded linear functionals on X (def-space-of-bounded-linear-operators). Each f∈X∗ is in particular a linear functional in the algebraic sense, so X∗ is a subspace of the algebraic dual from def-algebraic-dual-and-linear-functional. The dual norm on X∗ is the operator norm: ∥f∥X∗:=∥f∥=sup⁡{∣f(x)∣:∥x∥≤1}.

[F2]

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.

[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∥.

Proof

1.1F1F2

For h∈(X/M)∗, ∣h(qx)∣≤∥h∥∥qx∥≤∥h∥∥x∥, and h(qm)=0 for m∈M. Thus Qh∈M⊥ and Q is linear.

1.2F2F3

If f∈M⊥, define h(x+M)=f(x). Equality of cosets means x−x′∈M, so this value is independent of the representative. The quotient universal property gives a bounded linear h with h∘q=f and ∥h∥=∥f∥.

2.1step 1.1step 1.2∎

Surjectivity of q makes its pullback injective. Step 1.2 applied to f=Qh returns the original h by uniqueness, giving ∥Qh∥=∥h∥. If M=X, both spaces are zero; if M={0}, the same formulas apply.

Depends on

Used by

Dependency tree · two levels

13 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