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.
Injective transpose does not imply surjectivity
Statement refuted
An injective transpose does not force surjectivity of the original bounded operator. On real , define Under the real counting-measure dual identification, . Both maps are injective with dense nonclosed range, and neither is onto.
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 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 is the space of counting measure, with its stated hypotheses: On with counting measure, every function is measurable. Writing , one has by the counting-measure integral dictionary, so is exactly the usual sequence class . Also because a subset of has counting measure zero only when it is empty. Hence the quotient by almost-everywhere equality does nothing: for counting measure on , equality almost everywhere means equality everywhere.
Counterexample
The real counting-measure model has . Thus and is linear and injective. Every finite-support has the finite-support preimage ; truncating a square-summable sequence approximates it because the squared tail sums tend to zero. Therefore the range is dense.
For , the pairing is . Absolute convergence follows, for example, from . Hence , and uniqueness in the real duality theorem at gives .
The sequence lies in : the zeroth squared term is one and for , , whose sums telescope. A preimage would satisfy for all , which is not square summable. Thus is not onto and its dense range is proper, hence nonclosed. By step 2.1 the same is true of . The formula is defined at index zero, and zero is in both ranges.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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.9, p.174; Brezis Remark 20, p.48 (standard reference, not scraped)