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.
The canonical map is natural
Statement
Let or . If is bounded linear between normed spaces, then
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 canonical evaluation map into the bidual, with its stated hypotheses: Let or . For a normed , define With the dual norm from def-dual-space-of-a-normed-space, evaluation is linear in and , so is a bounded functional on . The map is canonical and uses no chosen basis or 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 The transpose is bounded with the same norm, with its stated hypotheses: Let or . For a bounded linear between normed spaces, is bounded linear and .
Proof
The transpose is bounded, so its transpose is defined. For and , .
The last expression is . Equality at every proves equality in and then equality of operators for every . With or every expression vanishes; the same calculation covers zero spaces.
Depends on
Used by
Nothing in the library uses this result yet.
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
- Bühler–Salamon, Functional Analysis, Lemma 4.3(ii), p.173 (standard reference, not scraped)