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, an injective bounded operator between Banach spaces has a bounded left inverse exactly when its range is closed and 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 an injective bounded linear operator. Then T has a bounded left inverse if and only if ran⁡(T) is closed and complemented in Y.

Facts & Assumptions

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

[L1]

A bounded left inverse means ST=IX (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).

Proof

technique · direct
1.1L1given

Assume S is a bounded left inverse of T, so ST=IX by [L1]. If Txn→y in Y, then xn=S(Txn)→S(y) because S is bounded. Since T is bounded as well, Txn→T(Sy). Hence y=T(Sy), so ran⁡(T) is closed.

1.2L0L3

Conversely, assume ran⁡(T) is closed and complemented in Y. Since T is injective and has closed range, [L0] and [L3] make it bounded below. Thus the inverse R:ran⁡(T)→X defined by R(Tx)=x is bounded.

2.1step 1.1L1givenL2algebra

With P:=TS, one has P2=T(ST)S=TS=P. If ∥Tx∥≤CT∥x∥ and ∥Sy∥≤CS∥y∥, then ∥Py∥=∥TSy∥≤CTCS∥y∥, so P is bounded. For every y∈Y, Py=TSy lies in ran⁡(T). If y=Tx is already in the range, then Py=TSTx=Tx=y. So ran⁡(P)=ran⁡(T), and [L2] shows that the range is complemented.

2.2step 1.2L2algebra

Let P:Y→Y be a bounded projection onto ran⁡(T), given by [L2]. Then S:=R∘P:Y→X is bounded and STx=R(P(Tx))=R(Tx)=x for every x∈X. Hence S is a bounded left inverse of T.

3.1step 2.1step 2.2∎

Steps 2.1 and 2.2 prove the equivalence.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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