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 transpose of an injective map need not have norm-dense range
Statement refuted
An injective bounded operator need not have norm-dense transpose range. Over , take the inclusion . Its transpose is the inclusion , and The operator is injective and has dense range.
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 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 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 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 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
From c_0 is a closed subspace of ell-infinity, with its stated hypotheses: is a closed linear subspace of in the sup norm.
From Annihilator notation and the preannihilator, with its stated hypotheses: Let or . For a normed and arbitrary subsets , , define Here is def-dual-space-of-a-normed-space. The first notation agrees with def-continuous-annihilator-of-a-subspace on , since linearity makes vanishing on equivalent to vanishing on its span. The preannihilator lies in , not in . Empty sets impose no conditions: and .
Counterexample
Absolute summability implies convergence to zero: infinitely many coordinates of magnitude at least would make partial absolute sums unbounded. Also , so inclusion is bounded and injective. Finite-support sequences lie in its range and are dense in by truncation.
Identify with and with real . For and , , so the transpose corresponds to the same coefficient sequence , now viewed in .
The transpose image is contained in , which is closed in , so its norm closure is contained in . Conversely it contains all finite-support sequences, whose sup-norm closure contains by truncation. Hence that closure is exactly .
The constant-one sequence has distance exactly one from : for , , so , and attains one. It is therefore outside the closure. Since , its annihilator is all of , proving strict inclusion.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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 4.10, p.174 (standard reference, not scraped)