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:XX be a compact operator (Compact linear operator) and put A:=IK. Then ranA is a closed subspace of X, and there is a real C>0 with

dist(x,kerA)CAxfor every xX,

the distance being the quotient seminorm of The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M)).

Facts & Assumptions

[A1]

ranA is closed if and only if there is a real C>0 with dist(x,kerA)CAx 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+MX/M is the quotient seminorm (The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{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: xkx iff d(xk,x)0 in R); the distance to a fixed set is 1-Lipschitz, dist(u,N)dist(v,N)uv (The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M))).

Proof

technique · direct

Given: DC, a Banach space X over R or C, a compact operator K:XX, and A=IK, N:=kerA.

1.1

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

A2A3
1.2

If the estimate of [A1] fails for every C, then for each fixed nN the set Wn:={w:dist(w,N)=1, w2, Aw<1/(n+1)} is nonempty: taking C=n+1 gives x with dist(x,N)>(n+1)Ax0, so the distance is positive; choose mN with xm<2dist(x,N) by the definition of the infimum, and set w:=(xm)/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.

step 1.1A1A3algebra
2.1

Assume the estimate fails. By Countable Choice in [A2], select wnWn for every n as in [step 1.2], and put M:={xX:x2}. The sequence (wn) lies in the bounded set M, and K is compact, so by [A2] there is a strictly increasing j with Kwnjz for some zX.

step 1.2A2
3.1

Along that subsequence, wnj=Awnj+Kwnjz, because Awnj<1/(nj+1)0 by [step 1.2] and Kwnjz by [step 2.1].

step 1.2step 2.1algebra
4.1

The limit z lies in N: by [step 3.1] and the continuity of A, Az=limjAwnj=0.

step 3.1A2A3
5.1

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 zN forces dist(z,N)=0.

step 1.2step 3.1step 4.1A3
6.1

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

step 5.1A1

Depends on

Used by

Dependency tree · two levels

71 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