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.
Coordinate functionals on sequence spaces
Example
Let or . For every , the coordinate functional has norm one on both and . Under their sequence-dual identifications it is represented by .
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 continuous dual of c0 is ell-one, with its stated hypotheses: Let or . With coordinates starting at zero, the map is a linear isometric bijection. The pairing is bilinear, including over .
From The complex continuous dual of ell-one is ell-infinity, with its stated hypotheses: For complex sequence spaces, with indices starting at zero, is a complex-linear isometric bijection. There is no conjugation in this pairing.
From Counting measure specializes the representation theorem to and , with its stated hypotheses: Let and let be conjugate to . Every bounded linear functional is of the form for a unique sequence . Moreover,
Verification
The pairing for assigns to the functional . The complex dual formula does the same for , and the real counting-measure theorem at gives the real counterpart.
On , ; on , . Thus each norm is at most one. In both spaces and , proving equality. This works at index zero as well as every later index; the zero input gives zero.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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, Examples 1.35–1.36, pp.36–37 (standard reference, not scraped)