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.

Range of identity minus compact is closed

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 be a Banach space over R or C, let K:X→X be a compact operator (Compact linear operator) and put A:=I−K. Then ran⁡A is a closed subspace of X, and there is a real C>0 with

dist⁡(x,ker⁡A)≤C∥Ax∥for every x∈X,

the distance being the quotient seminorm of The quotient seminorm ∥x+M∥X/M=inf⁡m∈M∥x+m∥=dist⁡(x,M).

Facts & Assumptions

[A1]

ran⁡A is closed if and only if there is a real C>0 with dist⁡(x,ker⁡A)≤C∥Ax∥ for every x, under DC for the bounded linear map A between Banach spaces (Closed range is equivalent to a quotient estimate); here dist⁡(x,M)=∥x+M∥X/M is the quotient seminorm (The quotient seminorm ∥x+M∥X/M=inf⁡m∈M∥x+m∥=dist⁡(x,M)).

[A3]

In a metric space, limits of sequences are unique (A sequence in a metric space has at most one limit, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R); the distance to a fixed set is 1-Lipschitz, ∣dist⁡(u,N)−dist⁡(v,N)∣≤∥u−v∥ (The quotient seminorm ∥x+M∥X/M=inf⁡m∈M∥x+m∥=dist⁡(x,M)).

Proof

technique · direct

Given: DC, a Banach space X over R or C, a compact operator K:X→X, and A=I−K, N:=ker⁡A.

1.1A2A3

N is a closed linear subspace: A is bounded hence continuous by [A2], so xj∈N with xj→x gives Axj=0→Ax, whence Ax=0 by [A3].

2.1step 1.1A1A3algebra

If the estimate of [A1] fails for every C, then for each fixed n∈N the set Wn:={w:dist⁡(w,N)=1, ∥w∥≤2, ∥Aw∥<1/(n+1)} is nonempty: taking C=n+1 gives x with dist⁡(x,N)>(n+1)∥Ax∥≥0, so the distance is positive; choose m∈N with ∥x−m∥<2dist⁡(x,N) by the definition of the infimum, and set w:=(x−m)/dist⁡(x,N). Scaling the distance gives dist⁡(w,N)=1, the norm bound ∥w∥<2 holds, and ∥Aw∥=∥Ax∥/dist⁡(x,N)<1/(n+1) because Am=0.

3.1step 2.1A2

Assume the estimate fails. By Countable Choice in [A2], select wn∈Wn for every n as in [step 2.1], and put M:={x∈X:∥x∥≤2}. The sequence (wn) lies in the bounded set M, and K is compact, so by [A2] there is a strictly increasing j with Kwnj→z for some z∈X.

4.1step 2.1step 3.1algebra

Along that subsequence, wnj=Awnj+Kwnj→z, because ∥Awnj∥<1/(nj+1)→0 by [step 2.1] and Kwnj→z by [step 3.1].

5.1step 4.1A2A3

The limit z lies in N: by [step 4.1] and the continuity of A, Az=lim⁡jAwnj=0.

6.1step 2.1step 4.1step 5.1A3

But this contradicts dist⁡(wnj,N)=1: by [A3] the numbers dist⁡(wnj,N) converge to dist⁡(z,N), so dist⁡(z,N)=1, whereas z∈N forces dist⁡(z,N)=0.

7.1step 6.1A1∎

Hence the estimate of [A1] holds for some real C>0, and then [A1] gives that ran⁡A is closed.

Depends on

Used by

Dependency tree · two levels

75 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