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.
Quotients of reflexive spaces are reflexive
Statement
Assume HB and the Axiom of Countable Choice . If is a real or complex reflexive Banach space and is a closed linear subspace, then the quotient Banach space is reflexive.
Facts & Assumptions
Given: HB, , a real or complex reflexive Banach space , and a closed scalar-linear subspace .
Reflexivity means that the canonical map is surjective, so every is evaluation at a vector of (Reflexivity is surjectivity of the canonical map).
For the quotient map , pullback is a scalar-linear isometric bijection , (The dual of a quotient is its annihilator).
Under HB, every bounded scalar-linear functional on an arbitrary linear subspace of a real or complex normed space extends to the whole space without increasing its norm (Relative norm-preserving Hahn–Banach extension over the real and complex fields).
Assuming , the quotient of a Banach space by a closed linear subspace is Banach for the quotient norm (A quotient of a Banach space by a closed subspace is Banach).
HB is the real dominated-extension principle over ZF, while chooses from each supplied sequence of nonempty sets (The real dominated-extension principle as an additional hypothesis over ZF, The Axiom of Countable Choice ()).
Proof
Proof technique: extend a quotient-bidual functional and represent the extension in the reflexive ambient space.
Put and write for the quotient map. By [F4], under the assumed the normed quotient is Banach. This includes , when , and , when the quotient norm is the original norm.
Let be arbitrary. The isometric bijection from [F2] has a scalar-linear isometric inverse. Define by . It is a bounded scalar-linear functional with ; if , both sides are zero.
Apply [F3] under HB to the subspace . There is with and . Only this one supplied functional is extended; no family of extensions is chosen.
Reflexivity of supplies an with . Put .
For every , [F2] gives , and therefore . Hence . The calculation is scalar-linear over both fields and uses the bilinear evaluation convention, with no conjugation.
Since was arbitrary, is surjective; together with the Banach conclusion in step 1.1, [F1] shows that is reflexive. When , step 1.2 starts from the unique zero bidual functional and the same computation gives the zero representer; when , is the usual identification and the computation reduces to ambient reflexivity. HB is spent only in step 2.1, and only in step 1.1.
Source notes
Bühler–Salamon, Theorem 2.71(ii), printed pp. 91–92, gives the complete annihilator-extension computation. The proof above keeps its exact algebra but states the repository's weak-choice costs: the selected quotient- completeness theorem requires , while the extension from to requires HB. It does not claim that the quotient map sends the ambient closed unit ball onto the quotient closed unit ball.
Depends on
- Reflexivity is surjectivity of the canonical map
- The dual of a quotient is its annihilator
- Relative norm-preserving Hahn–Banach extension over the real and complex fields
- A quotient of a Banach space by a closed subspace is Banach
- The real dominated-extension principle as an additional hypothesis over ZF
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
25 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 (standard reference, not scraped)