Alphabeta Math
LemmaStatement: 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.

Elementary kernel and range annihilator identities

Statement

Let K=R or C. For a bounded linear T:XY between normed spaces, (ranT)=kerT,(ranT)=kerT,ranT=(kerT). The closure in the last identity is in Y.

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 transpose of a bounded operator, with its stated hypotheses: Let K=R or C. Let T:XY be bounded and linear between normed spaces. Its transpose, or Banach adjoint, is T:YX,(Tg)(x)=g(Tx). The duals are def-dual-space-of-a-normed-space. Composition is bounded by lem-composition-operator-norm-inequality, so this has the displayed codomain. It is linear in g over K. No complex conjugation is inserted; a Hilbert adjoint uses a separate inner-product identification.

[F2]

From Annihilator notation and the preannihilator, with its stated hypotheses: Let K=R or C. For a normed X and arbitrary subsets MX, NX, define M={fX:f(m)=0 for all mM},N={xX:f(x)=0 for all fN}. Here X is def-dual-space-of-a-normed-space. The first notation agrees with def-continuous-annihilator-of-a-subspace on spanM, 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 The annihilator detects the closure of a subspace, with its stated hypotheses: For every linear subspace MX, M=fMkerf.

[F4]

From Every nonzero vector has a norming functional, with its stated hypotheses: Let X be a normed space over R or C, and let xX be nonzero. Then there exists fX such that f=1andf(x)=x.

Proof

1.1

A functional gY vanishes on ranT exactly when g(Tx)=0 for every x, exactly when Tg=0.

F1F2
1.2

A vector x belongs to (ranT) exactly when g(Tx)=0 for every gY. This holds if Tx=0; if Tx0, a norming functional has g(Tx)=Tx>0, so it fails.

F1F2F4
2.1

Apply the primal annihilator-closure identity to the linear subspace ranTY and substitute step 1.1. If T=0, the three identities read Y=Y, X=X, and {0}=Y; the last equality follows from the same norming separation.

F3F4step 1.1step 1.2

Depends on

Used by

Dependency tree · two levels

10 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