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.
Evaluation defines a bounded scalar-linear map into the bidual
Statement
Let be a normed space over . Set . Evaluation defines a bounded -linear map with for every . This assertion uses ZF alone; it does not assert injectivity without HB.
Facts & Assumptions
The dual is the space of bounded scalar-linear functionals with norm (The dual space X^* of a normed space and its dual norm).
The operator norm is a norm on the vector space of bounded linear operators (The operator norm is a norm on the space of bounded linear operators).
Proof
Given: A normed -space ; HB is not assumed.
By the operator-norm lemma, the space of bounded scalar-linear maps is itself a normed vector space. Therefore its dual is defined; this is the meaning of .
Fix . For and , evaluation gives , so the map is scalar-linear. If , ; if , . Thus is bounded and belongs to .
Define . For and , evaluating at every gives . Equality at all arguments is equality of functions, hence is scalar-linear.
Taking the supremum of over yields . This also proves boundedness of with constant one. At , is the zero functional and has norm zero. No step required HB or completeness.
Source notes
Brezis §1.3 first paragraph, pp.8–9 through the isometry formula; Teschl paragraph preceding Theorem 4.20 and its upper-bound proof, pp.115–116.
Depends on
Used by
Dependency tree · two levels
6 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
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, §§1.1–1.2 and §1.3 evaluation paragraph (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, Theorems 4.13–4.20 and §5.1 (2018 university-hosted copy) (standard reference, not scraped)