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 or . For a bounded linear between normed spaces, The closure in the last identity is in .
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.
From The transpose of a bounded operator, with its stated hypotheses: Let or . Let be bounded and linear between normed spaces. Its transpose, or Banach adjoint, is 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 over . No complex conjugation is inserted; a Hilbert adjoint uses a separate inner-product identification.
From Annihilator notation and the preannihilator, with its stated hypotheses: Let or . For a normed and arbitrary subsets , , define Here is def-dual-space-of-a-normed-space. The first notation agrees with def-continuous-annihilator-of-a-subspace on , since linearity makes vanishing on equivalent to vanishing on its span. The preannihilator lies in , not in . Empty sets impose no conditions: and .
From The annihilator detects the closure of a subspace, with its stated hypotheses: For every linear subspace ,
From Every nonzero vector has a norming functional, with its stated hypotheses: Let be a normed space over or , and let be nonzero. Then there exists such that
Proof
A functional vanishes on exactly when for every , exactly when .
A vector belongs to exactly when for every . This holds if ; if , a norming functional has , so it fails.
Apply the primal annihilator-closure identity to the linear subspace and substitute step 1.1. If , the three identities read , , and ; the last equality follows from the same norming separation.
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
- Bühler–Salamon, Functional Analysis, Theorem 4.8(i), pp.174; Corollary 2.55, p.84 (standard reference, not scraped)