Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

A compact remainder estimate forces closed range

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, Y and Z be Banach spaces over the same scalar field, let T:X→Y and K:X→Z be bounded linear operators with K compact (A bounded linear operator between normed spaces, Compact linear operator), and suppose there is a real C>0 with

∥x∥≤C∥Tx∥+∥Kx∥for every x∈X.

Then ker⁡T is finite dimensional and ran⁡T is closed in Y.

Facts & Assumptions

[A3]

Under DC, ran⁡T is closed exactly when there is a real C′>0 with dist⁡(x,ker⁡T)≤C′∥Tx∥ for every x (Closed range is equivalent to a quotient estimate, The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M))); the distance scales, dist⁡(λx,ker⁡T)=∣λ∣dist⁡(x,ker⁡T), because ker⁡T is a subspace, and dist⁡(u,M)≤∥u∥ for nonempty M∋0.

[A4]

If (uj) is Cauchy and some subsequence converges to u, then uj→u (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R); a closed set contains the limits of its convergent sequences (Banach space, A sequence in a metric space has at most one limit).

Proof

technique · direct

Given: DC, Banach spaces X,Y,Z over one scalar field, bounded T:X→Y, compact K:X→Z, a real C>0 with ∥x∥≤C∥Tx∥+∥Kx∥ for all x, and N:=ker⁡T.

1.1algebra

For x∈N the estimate reads ∥x∥≤∥Kx∥, so ∥Kx−Kx′∥=∥K(x−x′)∥≥∥x−x′∥ for all x,x′∈N.

1.2A1A4

The set N is a closed subspace, hence a Banach space.

1.3A3algebra

For every real η>0 there is x with dist⁡(x,N)=1, ∥x∥≤2 and ∥Tx∥<η whenever the estimate of [A3] fails for every constant: failure for the constant C′=1/η gives x0 with dist⁡(x0,N)>∥Tx0∥/η≥0 and dist⁡(x0,N)>0, and choosing m∈N with ∥x0−m∥<2dist⁡(x0,N) and setting x:=(x0−m)/dist⁡(x0,N) gives the three properties by scaling.

2.1step 1.1step 1.2A2

The closed unit ball BN:=N∩{x:∥x∥≤1} is compact: if (xj) is a sequence in BN, then it is bounded so by [A2] some subsequence has Kxjk→z; by [step 1.1] the subsequence is Cauchy, ∥xjk−xjl∥≤∥Kxjk−Kxjl∥, hence converges to some x∈N by [step 1.2], and ∥x∥≤1; thus every sequence in BN has a subsequence converging in BN, so BN is sequentially compact, hence compact by [A2].

2.2step 1.3A2

If the estimate of [A3] fails for every constant, then [step 1.3] makes the set of witnesses with dist⁡(w,N)=1, ∥w∥≤2 and ∥Tw∥<1/(j+1) nonempty for each j; Countable Choice in [A2] therefore supplies a sequence (wj) with those three properties.

3.1step 2.1A2

ker⁡T is finite dimensional: its closed unit ball is compact by [step 2.1], so N admits an ordered basis of finite length by [A2].

3.2step 2.2A2

Under the hypothesis of [step 2.2] the bounded sequence (wj) has, by [A2], a subsequence with Kwjk→z for some z∈Z.

4.1step 2.2step 3.2A4algebra

Under the hypothesis of [step 2.2], the subsequence is Cauchy: ∥wjk−wjl∥≤C∥T(wjk−wjl)∥+∥K(wjk−wjl)∥≤C(1/(jk+1)+1/(jl+1))+∥Kwjk−Kwjl∥, and both terms tend to 0; hence wjk→w for some w∈X.

5.1step 2.2step 4.1A1A4

Under the hypothesis of [step 2.2], the limit w lies in N: Tw=lim⁡kTwjk=0 by the continuity of T and ∥Twjk∥<1/(jk+1).

6.1step 2.2step 4.1step 5.1A3

Under the hypothesis of [step 2.2], the numbers dist⁡(wjk,N)=1 converge to dist⁡(w,N) because the distance to a fixed set is 1-Lipschitz, so dist⁡(w,N)=1, contradicting w∈N of [step 5.1], which forces dist⁡(w,N)=0.

7.1step 3.1step 6.1A3∎

Hence the estimate of [A3] holds for some constant, and then ran⁡T is closed by [A3]; together with [step 3.1] this proves the lemma.

Depends on

Dependency tree · 2 levels

Sources