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.
A codimension-one subspace can admit many norm-preserving Hahn-Banach extensions
Example
Let , let , and define by . Then , and for every the formula
defines a norm-preserving extension of to all of . So a codimension-one subspace can have infinitely many Hahn-Banach extensions of the same norm.
Facts & Assumptions
Given: The normed space , the diagonal subspace , and the functional .
In a one-step Hahn-Banach extension, the admissible values form a nonempty interval (The admissible values in a one-step Hahn-Banach extension form a nonempty interval).
A bounded real linear functional extends with the same norm (A bounded real linear functional on a subspace of a real normed space extends with the same norm).
Verification
For one has so . Also every decomposes as so .
If is a linear extension of and , then step 1.1 forces Conversely, the displayed formula defines a linear functional extending .
Let on . If , then Choosing and (interpreting ) gives and , so . Applying this to the formula from step 2.1 yields This equals exactly when .
Therefore every gives a norm-preserving extension of . This computes explicitly the admissible interval predicted abstractly by [L1], and in particular is consistent with the existence statement of [L2].
Depends on
Used by
- Hahn-Banach norm-preserving extensions need not be unique Counterexample
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
- Daniel Daners, Introduction to Functional Analysis, Theorem 26.1(a) (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, Corollary 4.15 (standard reference, not scraped)