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 continuous dual of c0 is ell-one
Statement
Let or . With coordinates starting at zero, the map is a linear isometric bijection. The pairing is bilinear, including over .
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 dual space X^* of a normed space and its dual norm, with its stated hypotheses: Let be a normed space over the scalar field , where in the literal definition and by the convention of rem-real-and-complex-normed-space-convention. The dual space of is the space of bounded linear functionals on (def-space-of-bounded-linear-operators). Each is in particular a linear functional in the algebraic sense, so is a subspace of the algebraic dual from def-algebraic-dual-and-linear-functional. The dual norm on is the operator norm:
From The sequence spaces c_0 and ell-infinity, with its stated hypotheses: Let or , with absolute value in the real case and modulus in the complex case. A scalar sequence here is a function , including index zero. Let both equipped with . Thus is a specified linear subspace of the bounded-sequence space . Here means that for every real there is such that for all . Addition and scalar multiplication are coordinatewise. The scalar triangle inequality makes bounded sequences and null sequences linear spaces and gives the triangle inequality for the displayed supremum norm. Absolute homogeneity follows coordinatewise, and a zero supremum forces every coordinate to vanish.
From Finite truncations approximate null and summable sequences, with its stated hypotheses: Let or . Use coordinates indexed by . Define , with coordinatewise operations and norm . Let retain coordinates and set all others to zero. Then
Proof
For and , . Hence the scalar series is absolutely convergent, defines a linear functional, and gives ; the map is linear.
For each finite prefix set when and , and otherwise (real conjugation does nothing). Then , , and . Taking proves . This includes without a unit-vector assumption.
Given , define , where is the coordinate unit sequence. The same finite phase test gives for every . Thus . No simultaneous arbitrary sign selections occur: every phase is specified by a formula.
By truncation density and continuity, . Thus the map is onto. Evaluation at each determines uniquely, proving injectivity as well as uniqueness of the representation.
Depends on
Used by
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
- Bühler–Salamon, Functional Analysis, Example 1.36, pp.36–37 (standard reference, not scraped)