Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

Under Dependent Choice, a surjective bounded operator between Banach spaces has a bounded right inverse exactly when its kernel is complemented

Statement

Assume the Axiom of Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Let X and Y be Banach spaces over the same scalar field, and let T:X→Y be a surjective bounded linear operator. Then T has a bounded right inverse if and only if ker⁡T is complemented in X.

Facts & Assumptions

Given: Banach spaces X and Y, a surjective bounded linear operator T:X→Y, and a bounded linear operator S:Y→X.

[L1]

A bounded right inverse means TS=IY (Bounded left inverses and bounded right inverses).

[L2]

Complemented subspaces are exactly the ranges of bounded projections (A closed subspace is complemented exactly when it is the range of a bounded projection).

[L3]

For bounded operators between Banach spaces, injective with closed range is equivalent to bounded below (Under Dependent Choice, a bounded operator between Banach spaces is bounded below exactly when it is injective with closed range).

[L4]

A closed subspace of a Banach space is Banach (A closed subspace of a Banach space is Banach).

Proof

technique · direct
1.1L1givenalgebra

Assume S is a bounded right inverse of T, so TS=IY by [L1]. Define P:=IX−ST. Then P2=IX−2ST+STST=IX−ST=P, because TST=T. Also, if ∥Sy∥≤CS∥y∥ and ∥Tx∥≤CT∥x∥, then ∥STx∥≤CSCT∥x∥ and therefore ∥Px∥≤(1+CSCT)∥x∥ for every x∈X; so P is a bounded projection. Finally, TP=T−TST=0, so ran⁡(P)⊆ker⁡T.

1.2L4given

Conversely, assume ker⁡T is complemented. Then there is a closed subspace L≤X with X=ker⁡T⊕L. The restriction T∣L:L→Y is injective, because L∩ker⁡T={0}, and it is surjective because every x∈X decomposes as k+ℓ with Tx=Tℓ. Since L is closed in the Banach space X, [L4] makes L Banach.

2.1step 1.1L2

If x∈ker⁡T, then Px=x−STx=x. Hence ker⁡T⊆ran⁡(P), and step 1.1 gives ran⁡(P)=ker⁡T. Therefore [L2] makes ker⁡T complemented.

2.2step 1.2L0L3

The map T∣L is a bounded bijection from the Banach space L onto the Banach space Y, so [L0] and [L3] make it bounded below. Hence its inverse R:Y→L is bounded, because ∥R(y)∥≤c−1∥y∥ when ∥Tℓ∥≥c∥ℓ∥. The inclusion L↪X now gives a bounded linear map S:Y→X with TS=IY. Thus S is a bounded right inverse.

3.1step 2.1step 2.2∎

Steps 2.1 and 2.2 prove the equivalence.

Depends on

Used by

Dependency tree · two levels

28 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