Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-09 (gpt-6-astra)
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 K=R or C. Assume DC and the Hahn–Banach extension principle HB. A bounded linear T:X→Y between Banach spaces is bijective if and only if T∗ is bijective. In that case (T∗)−1=(T−1)∗. Furthermore, T is a surjective linear isometry if and only if T∗ 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.

[F2]

Under HB, bounded functionals on arbitrary scalar-linear subspaces extend preserving norm, and the dual unit ball recovers each vector norm. (The real dominated-extension principle as an additional hypothesis over ZF, Relative norm-preserving Hahn–Banach extension over the real and complex fields, Relative dual norming, point separation, and recovery of the norm)

[F3]

Transposition reverses compositions and preserves identities. (Transposition reverses composition)

[F4]

Bounded-operator spaces with Banach target are Banach; in particular dual spaces are Banach. (If (Y) is Banach then (\mathcal B(X,Y)) is Banach)

Proof

technique · direct
1.1F2given

For every bounded A:E→F, composition gives ∥A∗∥≤∥A∥. Conversely, for Ax≠0, [F2] supplies a unit functional g with g(Ax)=∥Ax∥, so ∥Ax∥=∣(A∗g)(x)∣≤∥A∗∥∥x∥. The same inequality is immediate if Ax=0. Taking suprema gives ∥A∥=∥A∗∥, including zero spaces. This is the first use of HB.

1.2F1F3

If T is bijective, [F1] gives its bounded inverse U. Transposing TU=IY and UT=IX gives U∗T∗=IY∗ and T∗U∗=IX∗. Thus T∗ is bijective and (T∗)−1=U∗.

1.3F1F2F4given

Suppose T∗ is bijective. Its inverse S:X∗→Y∗ is bounded by [F1] and [F4]. Set C=max⁡(1,∥S∥). For every unit-ball f∈X∗, g=Sf satisfies ∥g∥≤C and f(x)=g(Tx); hence [F2] gives ∥x∥≤C∥Tx∥. This proves injectivity. It also proves closedness of M=T(X): if Txj converges, (xj) is Cauchy by this estimate, so completeness and continuity give a preimage of its limit. Sequential closedness implies closedness in this metric setting, using DC to select approximants at distances less than 1/j when needed.

2.1F2step 1.3algebra

If some y∉M existed, closedness would give δ=dist⁡(y,M)>0. On the scalar-linear subspace M+Ky, the formula ℓ(m+ay)=a is well-defined and linear. For a≠0, ∥m+ay∥≥∣a∣δ, so ∣ℓ(z)∣≤δ−1∥z∥, also when a=0. By the second use of HB, [F2] extends ℓ to g∈Y∗ with g∣M=0 and g(y)=1. Then T∗g=0 contradicts injectivity of T∗. Thus T is onto and bijective.

3.1step 1.1step 1.2step 2.1algebra∎

For any bounded bijection A, being an isometry is equivalent to ∥A∥≤1 and ∥A−1∥≤1: the two inequalities give ∥Ax∥≤∥x∥≤∥Ax∥. Steps 1.1 and 1.2 transfer these two bounds between T and T∗. Together with the equivalence of bijectivity this proves the surjective-isometry equivalence, including the unique bijection of zero spaces.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

32 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