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 bidual map of c0 misses the constant sequence
Statement refuted
Let or . A canonical bidual embedding need not be onto. Under the sequence-dual identifications, is the inclusion , and the constant sequence is outside its image.
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,
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.
Counterexample
The first dual is identified isometrically with through , where . Its dual is , by the complex endpoint theorem or the real counting-measure theorem at . Precomposition with a surjective isometry preserves functional norms and is bijective by precomposition with its inverse, so these identifications also identify the bidual.
By canonical evaluation, , whose coefficient sequence in is exactly . The constant-one sequence is bounded, but a preimage would have for every , as tested with . Such a sequence does not tend to zero. Thus the named canonical map is not onto. Its zero input maps to zero, so the obstruction is the specified nonzero element.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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 and §2.4.1, pp.36–37,88 (standard reference, not scraped)