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.
Invertibility and the inverse of the transpose
Statement
Let or . Assume DC. A bounded linear between Banach spaces is bijective if and only if is bijective. In that case Furthermore, is a surjective linear isometry if and only if is a surjective linear isometry.
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 Surjectivity is equivalent to a lower bound for the transpose, with its stated hypotheses: Let or . Assume DC. For a bounded linear between Banach spaces,
From Bounded below is equivalent to surjectivity of the transpose, with its stated hypotheses: Let or . Assume DC. If is bounded linear between Banach spaces, then
From Transposition reverses composition, with its stated hypotheses: Let or . For bounded linear , between normed spaces, For bounded and , .
From The transpose is bounded with the same norm, with its stated hypotheses: Let or . For a bounded linear between normed spaces, is bounded linear and .
From Bounded inverse theorem, with its stated hypotheses: Assume DC. A bounded bijective linear map between Banach spaces has a bounded linear inverse .
From If (Y) is Banach then (\mathcal B(X,Y)) is Banach, with its stated hypotheses: Let and be normed spaces over the same scalar field. If is Banach, then is Banach for the operator norm.
Proof
If is bijective, its inverse is bounded, so is bounded below. The two dual criteria give surjectivity and bounded-belowness of , hence its bijectivity.
If is bijective, the dual spaces are Banach by the completeness of bounded-operator spaces with scalar target, so bounded inverse applies. Hence is bounded below, so is onto; surjectivity of also makes bounded below, hence injective.
For bijective , put , which is bounded. Transpose and to get and . Thus .
A bounded bijection is an isometry exactly when and : the two bounds give , and the converse follows by taking suprema. Transpose norm equality and step 2.1 transfer these two bounds between and . Using inequalities covers the unique bijection between zero spaces, whose operator norms are zero.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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, Corollary 4.18, p.182 (standard reference, not scraped)