Alphabeta Math
Pipeline-generated
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.

Compact Operators and Riesz Schauder Theory

1 · Prerequisites

2 · Summary

The page begins from the published definition of a bounded linear operator and the metric notion of compactness, and defines a compact operator by the compact closure of the image of every bounded set, with the closed unit ball sufficient. The sequential characterisation under Dependent Choice, the compactness of bounded finite-rank operators, the two-sided ideal property, closure under linear combinations and norm closure for Banach targets follow in that order; the latter yields the notion of an approximable operator, for which only the approximation-property direction into a fixed Banach target is recorded, and deliberately not the converse. Schauder's compact-adjoint theorem is proved in both directions, and a compact operator is shown to send weakly convergent sequences to norm convergent ones.

The second half develops Riesz--Schauder theory for IK with K compact on a Banach space: finite-dimensional kernel, closed range with its distance estimate, the stabilisation of the kernel and range chains and the resulting direct-sum decomposition with an invertible restriction of IK, and then the Fredholm alternative with its adjoint solvability condition and the equality of the finite defect dimensions. Neumann series and small perturbations of bounded inverses, the spectrum and resolvent vocabulary, and the Riesz--Schauder spectral theorem for compact operators follow: every nonzero spectral value is an eigenvalue of finite algebraic multiplicity, only finitely many spectral values lie outside any positive radius, and the spectrum of an infinite-dimensional operator contains zero; the countability corollary records that the only possible accumulation point is zero.

The page closes with the Fredholm index: the definition through a finite dimension kernel, closed range and finite-dimensional cokernel, the splitting into finite-dimensional defects with a parametrix, the compact-remainder estimate forcing closed range, Atkinson's parametrix characterisation, additivity of the index through an exact six-term sequence, local constancy through a finite-dimensional Schur complement, invariance under compact perturbations along the connected path tT+tK, and the index-zero corollary for λIK with λ0.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Compact linear operator

Definition

Let X and Y be normed spaces over the same scalar field K, read in the real case from A norm on a real vector space, the induced metric, and the dictionary with the metric axioms and in the complex case from Real and complex scalar conventions for normed spaces. A linear map T:XY (Linear map between vector spaces over the same field) is a compact operator when the image of every bounded subset of X (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) has compact closure in Y (Open cover, subcover, compact metric space, and compact subset of a metric space); explicitly, for every bounded AX the closure T(A) in Y is a compact subset of Y. The set of compact operators XY is written K(X,Y).

The closed unit ball suffices. Put BX:={xX:x1} (Open ball, closed ball and sphere in a metric space). Then T is compact if and only if T(BX) is a compact subset of Y.

Indeed, if T is compact then BX is bounded, because BXB(0,2) while B(0,2) is bounded and a subset of a bounded set is bounded, so T(BX) has compact closure. Conversely assume T(BX) compact and let AX be bounded. If A= then T(A)=, whose closure is empty and hence compact. Otherwise AB(x0,r) for some x0X and real r>0, so every xA satisfies xx0+r=:R; if R>0 then ARBX and if R=0 then A{0}, so in either case T(A)RT(BX). Scalar multiplication by R is continuous (Vector addition and scalar multiplication are continuous in a normed space), so RT(BX) is a compact subset of Y (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism), hence closed (A compact subset of a metric space is closed and bounded); therefore T(A)RT(BX) is a closed subset of a compact set, hence compact, and T is compact.

A compact operator is bounded. If T is compact then the compact set T(BX) is bounded (A compact subset of a metric space is closed and bounded), so there is a real C0 with TxC for every xBX and hence TxCx for every xX; thus T is a bounded linear operator (A bounded linear operator between normed spaces). This is a consequence of compactness, not a hypothesis of the definition.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Dependent choice implies countable choice

Statement

In ZF, the Axiom of Dependent Choice implies the Axiom of Countable Choice: every at most countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω), Choice function, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Facts & Assumptions

[A1]
[A2]

ACω: for every family (En)nN of nonempty sets there is a function f with domain N and f(n)En for all n (The Axiom of Countable Choice (ACω)). A choice function on the set E:={En:nN} instead has domain E and selects an element of each of its members (Choice function).

Proof

technique · direct

Given: DC and a family (En)nN of nonempty sets.

1.1

Let H be the set of all functions s with domsN and s(j)Ej for every j<doms: this is a set by [A3] applied inside nNEn, and the empty function lies in H, so H.

A3
2.1

Define RH×H by sRt if and only if domt=doms+1 and t(j)=s(j) for every j<doms. Then R is entire on H: given sH, the set Edoms is nonempty, and for any xEdoms the function t:=s{(doms,x)} lies in H with sRt.

step 1.1A1
3.1

By [A1] applied to H, R and the empty function there is a sequence (sn)nN in H with s0= and snRsn+1 for every n.

step 1.1step 2.1A1
4.1

For every n one has domsn=n, by induction on n from [A3]: doms0=dom=0, and domsn+1=domsn+1=n+1.

step 3.1A3
4.2

The union f:=nNsn is a function: if (j,y) and (j,y) lie in f, they lie in sm and sm for some m,m, and with mm the relation gives smsm, so y=y.

step 3.1A3
5.1

Its domain is N: domf=ndomsn=nn=N by [step 4.1] and [A3].

step 4.1A3
5.2

For every nN one has f(n)=sn+1(n)En: the point n lies in domsn+1 by [step 4.1] and sn+1H with domsn+1=n+1>n.

step 4.1
6.1

Put E:={En:nN}. For each EE, the set {n:En=E} is a nonempty subset of N, so let n(E) be its least element and define c(E):=f(n(E)). Then c has domain E and c(E)En(E)=E, so c is a choice function on the set of members even when the indexed family has repetitions.

step 5.2A2A3
7.1

Hence f is a function with domain N and f(n)En for every n, which is exactly the indexed conclusion of [A2], while c is the corresponding choice function on the set of member sets. Since the family was arbitrary, DC implies ACω.

step 4.2step 5.1step 5.2step 6.1A2
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Sequential characterization of compact operators

Statement

Facts & Assumptions

[A1]

T is compact exactly when T(BX) is a compact subset of Y, where BX={xX:x1} (Compact linear operator).

[A2]

Assume ACω and DC. For a metric space (M,d), compactness, countable compactness, limit point compactness, sequential compactness and "complete and totally bounded" are equivalent; only "sequentially compact implies totally bounded" spends DC and only "complete and totally bounded implies compact" spends ACω, so every other implication is a theorem of ZF (For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice).

[A3]

In ZF, DC implies ACω (Dependent choice implies countable choice); and DC is the statement that for every nonempty set X, every relation R on X entire on X and every aX there is x:NX with x0=a and xnRxn+1 for all n (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A4]

A subset A of a metric space is bounded when A= or AB(x0,r) for some point x0 and real r>0 (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space).

[A5]

In a normed space, xR implies xRBX; convergence is metric convergence for d(y,y)=yy; a set FY is closed exactly when F=F; for nonempty A the closure is A={y:d(y,A)=0}; and the closure of A is contained in every closed set containing A (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R, The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset).

Proof

technique · direct

Given: DC, normed spaces X,Y over one scalar field, a bounded linear T:XY, and the notation BX={x:x1}.

1.1

Suppose T compact and let (xk) be a bounded sequence in X. By [A4] the range {xk} is empty or contained in some ball B(x0,r); because xkxkx0+x0 for every k, there is a real R0 with xkR for all k (if the range is empty take R=0), and then TxkRT(BX) for every k, because xkRBX and T is linear.

A4A5algebra
1.2

Conversely assume every bounded sequence in X has a subsequence whose T-images converge, and put C:=T(BX). Let (yk) be a sequence in C. For each k the set Sk:={xBX:ykTx<1/(k+1)} is nonempty, because ykT(BX), the set T(BX) is nonempty, and [A5] then gives a point of T(BX) within 1/(k+1) of yk; selecting xkSk for every k is a countable selection from nonempty sets, which [A3] licenses.

A3A5
2.1

By [A1] the set T(BX) is compact, and multiplication by the scalar R is continuous, so RT(BX) is a compact subset of Y (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism); by [A2] its metric subspace is sequentially compact, so the sequence (Txk) of [step 1.1] has a subsequence converging in Y.

step 1.1A1A2
2.2

The sequence (xk) of [step 1.2] is bounded, since its range lies in BX; by hypothesis some subsequence (xkj) has Txkjy for some yY, and since every Txkj lies in T(BX)C while C is closed, [A5] gives yC.

step 1.2A4A5
3.1

Therefore compactness of T implies the stated sequential property for every bounded sequence.

step 2.1
3.2

Along that subsequence ykjyykjTxkj+Txkjy<1/(kj+1)+Txkjy, and both terms tend to 0, so ykjy with yC.

step 1.2step 2.2algebra
4.1

Thus every sequence in C has a subsequence converging in C, that is, C is sequentially compact; by [A2] C is compact, and then T is compact by [A1].

step 3.2A1A2
LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Bounded finite rank operators are compact

Statement

Let X and Y be normed spaces over the same scalar field and let T:XY be a bounded linear operator (A bounded linear operator between normed spaces) whose range T(X) admits an ordered basis of finite length (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). Then T is compact (Compact linear operator).

Facts & Assumptions

[A1]

T is compact exactly when T(BX) is compact, where BX={xX:x1} (Compact linear operator); the operator norm satisfies TxTx for every x (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, A bounded linear operator between normed spaces).

[A2]

A subspace W of a normed space V admitting an ordered basis of finite length is a closed subset of V (A finite-dimensional normed subspace is closed, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis), and its closed unit ball {wW:w1} is compact (The closed unit ball is compact if and only if the normed space is finite-dimensional).

[A4]

A compact subset of a metric space is closed and bounded (A compact subset of a metric space is closed and bounded); a closed subset of a compact topological space is a compact subset (A closed subspace of a compact space is compact, and a finite union of compact subspaces is compact).

Proof

technique · direct

Given: Normed spaces X,Y over one scalar field and a bounded linear T:XY whose range R:=T(X) admits an ordered basis of finite length.

1.1

Every point of T(BX) lies in R, and TxT for every xBX by [A1]; writing s:=T, this says T(BX)sBR, where BR={vR:v1}.

A1algebra
1.2

By [A2] the set BR is compact and R is closed in Y.

A2
2.1

The set sBR is the image of the compact set BR under the continuous map vsv, so it is a compact subset of Y by [A3]; it is therefore closed in Y by [A4].

step 1.2A3A4
3.1

Since T(BX)sBR by [step 1.1], the closure T(BX) is contained in the closed set sBR; being a closed subset of the compact space sBR, it is compact by [A4].

step 1.1step 2.1A4
4.1

By [A1] compactness of T(BX) is exactly compactness of T, so T is compact.

step 3.1A1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Compositions with a compact operator are compact

Statement

Let W, X, Y and Z be normed spaces over the same scalar field. If T:XY is compact (Compact linear operator) and A:WX and B:YZ are bounded linear operators (A bounded linear operator between normed spaces), then the composites TA:WY and BT:XZ are compact.

Facts & Assumptions

[A1]

A bounded linear operator is continuous and satisfies SwSw for all w (For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent, The operator norm as the least bound and as the unit-sphere or unit-ball supremum); T is compact exactly when T(E) is compact for every bounded EX, in particular for E=BX={x:x1} (Compact linear operator).

[A2]

A subset E of a metric space is bounded when E= or EB(x0,r) for some point x0 and real r>0; a subset of a bounded set is bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

Proof

technique · direct

Given: Normed spaces W,X,Y,Z over one scalar field, a compact T:XY, and bounded linear A:WX, B:YZ.

1.1

If EW is bounded and nonempty, say EB(w0,r), then AwA(w0+r) for every wE by [A1], so A(E)B(0,A(w0+r)+1) is bounded; and A()= is bounded, so A carries bounded sets to bounded sets.

A1A2algebra
1.2

If E=, take R=1, so ERBX holds immediately. If E is a bounded subset of X with E and EB(x0,R0), then xx0+R0=:R for every xE by [A2] and the triangle inequality, so ERBX; the same holds in any normed space.

A2algebra
1.3

The set B(T(BX)) is compact: T(BX) is compact by [A1], and B is continuous by [A1], so the image under B is compact by [A3].

A1A3
2.1

For every bounded EW the image A(E) is bounded by [step 1.1], so T(A(E)) is compact by [A1]; hence TA is compact.

step 1.1A1
2.2

For every bounded EX, [step 1.2] gives ERBX for some real R0, so T(E)RT(BX) and hence B(T(E))RB(T(BX)), which is compact by [step 1.3] and [A3] and therefore closed; thus B(T(E))RB(T(BX)) is a closed subset of a compact set, hence compact, and BT is compact.

step 1.2step 1.3A1A3
3.1

Both composites TA and BT are therefore compact.

step 2.1step 2.2
LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Linear combinations of compact operators are compact

Statement

Let X and Y be normed spaces over the same scalar field. Then the compact operators XY (Compact linear operator) form a linear subspace of B(X,Y) (A bounded linear operator between normed spaces): the zero operator is compact, and if S,T:XY are compact and λ is a scalar, then S+T and λS are compact.

Consequently, if K:XX is a compact endomorphism, if m1 is a natural number and a1,,am are scalars, then the polynomial k=1makKk=a1K+a2K2++amKm is compact.

Facts & Assumptions

[A1]

S is compact exactly when S(E) is compact for every bounded E; in particular S(BX) is compact for the closed unit ball (Compact linear operator), and a bounded linear operator such as K satisfies KwKw (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A2]

The zero operator has range {0}, and the space {0} admits the empty ordered basis of finite length, so the zero operator is compact (Bounded finite rank operators are compact, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[A3]

If T is compact and C is bounded linear, then TC and CT are compact (Compositions with a compact operator are compact).

Proof

technique · direct

Given: Normed spaces X,Y over one scalar field, compact operators S,T:XY, a scalar λ, and a compact endomorphism K:XX.

1.1

The zero operator is compact by [A2].

A2
1.2

For bounded EX the sets S(E) and T(E) are compact by [A1], so their product is compact in Y×Y by [A4] and its image under the continuous addition map is compact by [A4]; since (S+T)(E)S(E)+T(E), its closure is a closed subset of that compact image, hence compact, and S+T is compact.

A1A4algebra
1.3

For bounded EX the set λS(E) is the image of the compact set S(E) under the continuous map yλy, hence compact by [A4]; since (λS)(E)λS(E), its closure is compact by [A4], so λS is compact.

A1A4
1.4

For every natural j1 the power Kj is compact: K1=K is compact, and if Kj is compact then Kj+1=KKj is compact by [A3].

A3
2.1

By [step 1.1], [step 1.2] and [step 1.3] the compact operators XY contain the zero operator and are closed under addition and scalar multiplication, so they form a linear subspace of B(X,Y).

step 1.1step 1.2step 1.3
3.1

Let K be compact and a1,,am scalars with m1. Each Kk with 1km is compact by [step 1.4]; by induction on m using [step 2.1], a finite sum of scalar multiples of compact operators is compact, so k=1makKk is compact.

step 1.4step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Norm limit of compact operators is compact

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let X be a normed space, let Y be a Banach space (Banach space), and let Tn:XY, nN, be compact operators (Compact linear operator) with TnT0 for a bounded linear operator T:XY (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum, Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R). Then T is compact.

Facts & Assumptions

[A1]

S:XY is compact exactly when S(BX) is compact, where BX={xX:x1} (Compact linear operator); and SxSx for every x (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, A bounded linear operator between normed spaces).

[A2]

A compact metric space (M,d) has a finite subcover of every open cover; in particular, if every point of M has a ball of the family {MB(y,ε):yM} containing it, then finitely many of these balls cover M (Open cover, subcover, compact metric space, and compact subset of a metric space, Open ball, closed ball and sphere in a metric space). Selecting one index from each of finitely many nonempty index sets is possible without choice (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[A3]

For nonempty A in a metric space, A={y:d(y,A)=0} (claim 1 of The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset); so for yA and real δ>0 there is aA with d(y,a)<δ (Open ball, closed ball and sphere in a metric space).

[A4]

A subset A of a metric space is totally bounded when for every real ε>0 there are finitely many points f0,,fmA with AimB(fi,ε) (Finite ε-net and totally bounded metric space, Open ball, closed ball and sphere in a metric space).

[A5]

A closed subset of a complete metric space is complete (claim 2 of Closed subspaces of complete metric spaces are complete; the converse under countable choice), and a Banach space is a complete normed space (Banach space); a complete and totally bounded metric space is compact under ACω (A complete, totally bounded metric space is compact, proved from countable choice used exactly once).

Proof

technique · direct

Given: ACω, a normed space X, a Banach space Y, compact operators Tn:XY with TnT0, and Cn:=Tn(BX).

1.1

For every real ε>0 there is n with TTn<ε: this is exactly the convergence TnT0 in the norm metric of B(X,Y).

A1
1.2

For every cCn and every real δ>0 there is xBX with cTnx<δ, because cTn(BX), the set Tn(BX) is nonempty, and [A3] applies to A=Tn(BX)Y.

A3
1.3

Each Cn is compact by [A1].

A1
1.4

Whenever A is a totally bounded nonempty subset of a metric space, its closure is totally bounded: given ε>0, [A4] gives finitely many points f0,,fmA with AimB(fi,ε/2); for yA there is aA with d(y,a)<ε/2 by [A3], and aB(fi,ε/2) for some i, so d(y,fi)<ε; hence the same finite set, whose points lie in A, is an ε-net for A.

A3A4algebra
1.5

The set T(BX) is closed in the complete space Y, hence a complete metric space by [A5].

A5
2.1

Fix a real ε>0 and choose n with TTn<ε/4 by [step 1.1]. The family of balls CnB(Tnx,ε/4), xBX, covers Cn by [step 1.2]; since Cn is compact by [step 1.3], finitely many indices x0,,xmBX satisfy CnimB(Tnxi,ε/4), and one may pick these finitely many indices by [A2]. For every xBX the point Tnx lies in Cn, so some i has TnxTnxi<ε/4; writing TxTxi=(TnxTnxi)+(TTn)(xxi) and using x,xi1 gives TxTxiTnxTnxi+TTnxxi<ε/4+ε/2<ε; thus {Tx0,,Txm} is a finite ε-net for T(BX) with centres in T(BX), and T(BX) is totally bounded.

step 1.1step 1.2step 1.3A1A2algebra
3.1

By [step 1.4] the closure T(BX) is totally bounded as well, its finite nets having centres in that closure.

step 1.4step 2.1
4.1

The space T(BX) is complete by [step 1.5] and totally bounded by [step 3.1]; by [A5] it is compact, and therefore T is compact by [A1].

step 1.5step 3.1A1A5
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-09-22Open item page →

Approximable operator

Definition

Let X and Y be normed spaces over the same scalar field and let B(X,Y) be the space of bounded linear operators with the operator norm (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). Write

F(X,Y):={RB(X,Y):R(X) admits an ordered basis of finite length}

for the set of bounded finite-rank operators (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). An operator TB(X,Y) is approximable when T lies in the closure of F(X,Y) in the operator-norm metric (Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R, The closure of a nonempty A is {x:d(x,A)=0}, equals A together with its limit points, and is the smallest closed superset).

The closure is an epsilon statement. The zero operator lies in F(X,Y), since its range {0} admits the empty ordered basis, so F(X,Y) is nonempty and the metric-space description of the closure applies: T is approximable if and only if for every real ε>0 there is a bounded finite-rank operator R with TR<ε. No choice principle is used for this equivalence.

Approximable operators are compact, under countable choice. Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), let Y be a Banach space (Banach space) and let T be approximable. Choosing for every nN a bounded finite-rank Rn with TRn<1/(n+1) is a countable selection from nonempty sets, so such operators exist; each Rn is compact (Bounded finite rank operators are compact) and RnT0, so T is compact by the norm-limit theorem (Norm limit of compact operators is compact, Compact linear operator).

No converse is asserted here. The statement that every compact operator into Y is approximable is the approximation-property question for the target Y; it is not a consequence of the definition and is not claimed. The companion page records the implication that holds when Y has the approximation property, and the distinction between compact and approximable operators for a general Banach target is left open.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Schauder compact adjoint theorem

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field and let T:XY be a bounded linear operator (A bounded linear operator between normed spaces), with transpose T:YX (The transpose of a bounded operator, The dual space X^* of a normed space and its dual norm). Then T is compact (Compact linear operator) if and only if T is compact.

Facts & Assumptions

[A1]

S is compact exactly when S(BX) is compact (Compact linear operator); the transpose is the bounded linear map (Sh)(x)=h(Sx) with S=S (The transpose of a bounded operator, The transpose is bounded with the same norm, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A4]

A compact metric space has a finite subcover of every open cover; the balls centred at points of a nonempty compact set cover it, and choosing one index per member of a finite subcover is choice-free (Open cover, subcover, compact metric space, and compact subset of a metric space, Open ball, closed ball and sphere in a metric space, Every natural-number-indexed list of nonempty sets has a choice function on its family of values). An at most countable union of finite sets is at most countable under ACω (Countable unions of at most countable sets, assuming ACω).

[A6]

The canonical maps JX:XX are linear isometries (The canonical bidual map is an isometry) with SJX=JYS for bounded S (The canonical map is natural); an isometric image of a Banach space is a closed subspace (Closed subspaces of complete metric spaces are complete; the converse under countable choice).

[A7]

If S is compact and C is bounded linear, then CS and SC are compact (Compositions with a compact operator are compact).

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, a bounded linear S:XY, the transpose S:YX, the closed unit balls BX,BY, and Θ:=S(BX).

1.1

Every bounded sequence in K has a convergent subsequence.

A5
1.2

If S is compact then Θ is compact by [A1], so for every real δ>0 there are finitely many points x0,,xmBX with ΘimB(Sxi,δ): the balls ΘB(Sx,δ), xBX, cover Θ by [A5], compactness gives a finite subcover, and one index per member of that finite subcover may be chosen by [A4].

A1A4A5
1.3

The dual X is Banach by [A2], so the set C:=S(BY)X is a complete metric space by [A2].

A2
1.4

If K is a compact operator and M is a closed subspace of its target containing K(X), then the corestriction K0:XM is compact: for bounded EX the closure of K0(E) in M equals K(E)M, a closed subset of the compact set K(E).

A1
1.5

The space JY(Y) is a closed subspace of Y and the inverse of JY:YJY(Y) is a bounded isometry, by [A6].

A6
2.1

Under the hypothesis of [step 1.2], the union D of the finite (1/(k+1))-nets of Θ obtained from [step 1.2] for kN is at most countable and dense in Θ, the nets being chosen together by ACω and their union counted by [A4]; hence there is a surjection ND listing D as (dj).

step 1.2A3A4
2.2

If (gn) is a sequence in BY and D=(dj) is a countable subset of Y, then there are a strictly increasing index map n:NN and scalars to which gnj(dk) converges for all j,k: for each fixed dk the scalar sequence gn(dk) is bounded by dk and has a convergent subsequence by [step 1.1], and the standard diagonal selection of nested subsequences is licensed by DC.

step 1.1A3
3.1

Assume S compact and let (gn) be a sequence in BY. With D as in [step 2.1], [step 2.2] gives a subsequence (gnj) with gnj(d) convergent for every dD. Given a real ε>0, choose k with 1/(k+1)<ε/4 and let FkBX be the finite net of [step 1.2] for δ=1/(k+1); convergence on the finite set Fk gives J with (gnjgnl)(Sxi)<ε/2 for all j,lJ and all im, and for xBX one has SxSxi<ε/4 for some i, so (SgnjSgnl)(x)(gnjgnl)(Sxi)+gnjgnlSxSxi<ε/2+2ε/4=ε; hence (Sgnj) is Cauchy in X.

step 2.1step 2.2A1A4
4.1

Under the hypothesis of [step 3.1] the Cauchy sequence (Sgnj) converges in the complete space X by [step 1.3], and its limit lies in C because every SgnjS(BY)C and C is closed; so every sequence in S(BY) has a subsequence converging in C.

step 1.3step 3.1
5.1

Under the hypothesis of [step 3.1], every sequence (yn) in C has a subsequence converging in C: choosing gnBY with ynSgn<1/(n+1) for every n is a countable selection licensed by [A3], and applying [step 4.1] to (gn) yields a subsequence with SgnjyC, whence ynjy.

step 4.1A3A5
6.1

Under the hypothesis of [step 3.1] the space C is sequentially compact by [step 5.1], hence compact by [A3], and then S is compact by [A1].

step 5.1A1A3
7.1

Suppose now that T:YX is compact. Both X and Y are Banach by [A2], so [step 6.1] applied to the bounded linear operator T between Banach spaces gives that (T)=T is compact; with [step 1.5] and [A6], TJX=JYT, so TJX is compact by [A7], and T=JY1(TJX) is the composite of the corestriction of TJX to the closed subspace JY(Y) — compact by [step 1.4] — with the bounded operator JY1, hence compact by [A7].

step 1.4step 1.5step 6.1A2A6A7
8.1

Conversely, if T is compact then T is compact by [step 6.1]; and if T is compact then T is compact by [step 7.1]; this is the asserted equivalence.

step 6.1step 7.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Compact operator sends weakly convergent sequences to norm convergent sequences

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field, let T:XY be a compact operator (Compact linear operator) and let (xn) be a sequence in X (Sequences of reals: bounded, eventually, frequently, tails, subsequences) with xnx weakly (Weak convergence of nets and sequences). Then TxnTx0 (Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R).

Facts & Assumptions

[A1]

Under the Axiom of Dependent Choice, a family of bounded linear operators on a Banach space that is pointwise bounded is norm bounded (Uniform boundedness principle, Banach space); the continuous dual X is Banach even when X is incomplete (The continuous dual, its completeness, and evaluation), and the canonical map JX:XX is a linear isometry (The canonical bidual map is an isometry).

[A2]

xnx means f(xn)f(x) for every fX; the transpose satisfies (Tg)(x)=g(Tx) and TgX for gY (Weak convergence of nets and sequences, The transpose of a bounded operator, A bounded linear operator between normed spaces).

[A3]

Assume DC: if a sequence fails to converge to a point then there are a real ε>0 and a strictly increasing index map j with TxnjTxε for all j (Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R, A strictly increasing index map satisfies nkk, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A4]

Under DC, a compact operator sends bounded sequences to sequences with convergent subsequences (Sequential characterization of compact operators, Compact linear operator).

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, a compact operator T:XY, a sequence (xn) in X with xnx.

1.1

The sequence (xn) is norm bounded: the operators JXxn:XK are pointwise bounded because f(xn)f(x) makes (f(xn))n a bounded scalar sequence for each fX, so [A1] and the isometry property give supnxn=supnJXxn<.

A1A2A5
1.2

The sequence (Txn) converges to Tx weakly: for gY one has g(Txn)=(Tg)(xn)(Tg)(x)=g(Tx) by [A2].

A2
1.3

If TxnTx↛0, then by [A3] there are ε>0 and a strictly increasing j with TxnjTxε for every j.

A3
2.1

Assume TxnTx↛0 and take ε and (xnj) as in [step 1.3]. The subsequence (xnj) is bounded by [step 1.1], so [A4] gives a further subsequence (xnjk) with Txnjky for some yY.

step 1.1step 1.3A4
3.1

For every gY the scalar sequence g(Txnjk) converges to g(y) because g is bounded hence continuous, and to g(Tx) by [step 1.2]; hence g(y)=g(Tx) for every g, and [A5] gives y=Tx.

step 1.2step 2.1A2A5
4.1

But TxnjkTxε for every k by [step 1.3], contradicting TxnjkTx=y from [step 3.1].

step 1.3step 3.1
5.1

Hence the assumption TxnTx↛0 is false, that is, TxnTx0.

step 4.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Kernel of identity minus compact is finite dimensional

Statement

Let X be a normed space over R or C and let K:XX be a compact operator (Compact linear operator). Then the kernel

ker(IK)={xX:Kx=x}

is a finite-dimensional subspace of X: it admits an ordered basis of finite length (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

Facts & Assumptions

[A1]

K is a bounded linear operator, and a bounded linear operator is continuous (A bounded linear operator between normed spaces, For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent); K is compact, that is, K(BX) is compact (Compact linear operator).

[A3]

If the closed unit ball of a normed space is compact, then that space admits an ordered basis of finite length (The closed unit ball is compact if and only if the normed space is finite-dimensional); a closed subset of a compact metric space is a compact metric subspace (A closed subset of a compact metric space is compact). Relative openness is the trace of ambient openness, and compactness is the compactness of the restricted metric (A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).

Proof

technique · direct

Given: A normed space X over R or C, a compact operator K:XX, and N:=ker(IK)={xX:Kx=x}.

1.1

The set N is a linear subspace of X, since IK is linear. It is closed without using a sequential-closure criterion: take a bound C0 for K. If xN, put a=xKx>0. For yx<a/(2(1+C)), the triangle inequality gives yKya(IK)(yx)a(1+C)yx>a/2>0. Thus a ball around every xN lies outside N, proving its complement open.

A1A2
2.1

Every x in the closed unit ball NBX of N satisfies x=Kx and x1, hence xK(BX); therefore NBXK(BX)K(BX), and NBX is a closed subset of X by [step 1.1] and [A2].

step 1.1A2
3.1

The set K(BX) is compact by [A1], so by [step 2.1] and [A3] the set NBX is compact with its metric restricted from X: it is relatively closed in the compact metric subspace K(BX). Restricting that same metric via N gives exactly the same distance on NBX, so it is also the compact closed unit ball of the normed space N, so N admits an ordered basis of finite length by [A3].

step 2.1A1A3
4.1

Hence ker(IK) is finite dimensional, as claimed.

step 3.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

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
LemmaStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Riesz Schauder ascent and descent stabilize

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 there is m0N such that for every nm0

kerAn=kerAm0,ranAn=ranAm0,

and for every such m the following hold:

  1. X=kerAmranAm as a direct sum of linear subspaces;
  2. kerAm is finite dimensional (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis) and ranAm is closed in X;
  3. A maps ranAm bijectively onto itself, and the restricted map ranAmranAm, yAy, is a bounded linear isomorphism with bounded inverse (Bounded inverse theorem).

Facts & Assumptions

[A1]

For every n1 there is a compact Kn with An=IKn: A=IK, and if An=IKn with Kn compact then An+1=(IKn)A=IKnK+KnK, where Kn+KKnK is compact by the ideal and linear-subspace properties (Compositions with a compact operator are compact, Linear combinations of compact operators are compact, Compact linear operator, A bounded linear operator between normed spaces).

[A2]

For compact C the kernel ker(IC) is finite dimensional (Kernel of identity minus compact is finite dimensional) and ran(IC) is closed, with dist(x,ker(IC))C0(IC)x for some real C0>0 (Range of identity minus compact is closed, The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M))).

[A3]

Riesz lemma: for a proper closed subspace M of a normed space and 0<α<1 there is x with x=1 and dist(x,M)>α (Riesz lemma, The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M)), A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

[A4]

Under DC, Countable Choice is available, and a compact operator sends bounded sequences to sequences with convergent subsequences (Dependent choice implies countable choice, Sequential characterization of compact operators, Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R); a subsequence of a bounded sequence is bounded.

[A5]

A closed linear subspace of a Banach space is a Banach space (A closed subspace of a Banach space is Banach), and a bounded bijection between Banach spaces has a bounded inverse (Bounded inverse theorem, Banach space).

Proof

technique · direct

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

1.1

For every n1 the operator An equals IKn with Kn compact.

A1
2.1

For every n1 the kernel kerAn is finite dimensional with kerAnkerAn+1, and the range ranAn is closed with ranAn+1ranAn.

step 1.1A2
3.1

For every n with kerAnkerAn+1, the finite-dimensional subspace kerAn is closed in the normed space kerAn+1, so Riesz's lemma gives xkerAn+1 with x=1 and dist(x,kerAn)>1/2 (A finite-dimensional normed subspace is closed).

step 2.1A3
3.2

For every n with ranAnranAn+1 there is xranAn with x=1 and dist(x,ranAn+1)>1/2, the distance being computed in X.

step 2.1A3
4.1

The chain kerAn stabilizes: if kerAnkerAn+1 for every n, Countable Choice in [A4] applied to [step 3.1] gives unit vectors xnkerAn+1 with dist(xn,kerAn)>1/2; for m<n one has xmkerAn, AxmkerAn and AxnkerAn, so KxnKxm=xn(xm+AxnAxm) is at distance >1/2 from 0, and the bounded sequence (Kxn) has no convergent subsequence, contradicting [A4].

step 3.1A4
4.2

The chain ranAn stabilizes: if ranAnranAn+1 for every n, Countable Choice in [A4] applied to [step 3.2] gives unit vectors xnranAn with dist(xn,ranAn+1)>1/2; for m>n one has xmranAn+1, AxnranAn+1 and AxmranAn+1, so KxnKxm=xn(xm+AxnAxm) has norm >1/2, and the bounded sequence (Kxn) has no convergent subsequence, contradicting [A4].

step 3.2A4
5.1

Choose m so that both chains are constant from m onward by [step 4.1] and [step 4.2], and put N:=kerAm, Y:=ranAm. Then X=N+Y: for xX the element Amx lies in Y=ranA2m, so Amx=A2my for some yX, and xAmyN.

step 4.1step 4.2
6.1

Under the choice of [step 5.1] one has NY={0}: if xNY, say x=Amy with Amx=0, then A2my=0, so ykerA2m=kerAm by [step 4.1] and x=Amy=0.

step 5.1
6.2

Under the choice of [step 5.1], A(Y)=Y: A(Y)=A(AmX)=Am+1X=Y by the stabilization of [step 4.2].

step 5.1
7.1

Under the choice of [step 5.1], X=NY, and N is finite dimensional and Y is closed by [step 2.1].

step 5.1step 6.1step 2.1
8.1

Under the choice of [step 5.1], the restriction AY is injective: if Ay=0 with y=AmzY, then Am+1z=0, so zkerAm+1=kerAm by [step 4.1] and y=Amz=0.

step 7.1
9.1

Under the choice of [step 5.1], AY:YY is a bounded bijection by [step 6.2] and [step 8.1], and Y is a Banach space by [step 7.1] and [A5], so the inverse (AY)1 is bounded by [A5].

step 7.1step 6.2step 8.1A5
10.1

Taking m0:=m from [step 5.1] gives the stabilization, and [step 7.1], [step 6.2] and [step 9.1] give the decomposition, the finite-dimensional kernel, the closed range and the bounded isomorphism on that range; every larger m works as well because the chains are constant from m0 onward.

step 5.1step 7.1step 6.2step 9.1
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Fredholm alternative for identity minus compact

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a Banach space over a fixed field F{R,C}, let K:XX be a compact operator (Compact linear operator) and put A:=IK. Then:

  1. A is injective if and only if it is surjective, and in that case A is boundedly invertible;
  2. for every yX the equation Ax=y has a solution if and only if φ(y)=0 for every φkerA, the transpose A=IK acting on X (The transpose of a bounded operator);
  3. kerA and the cokernel X/ranA (The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M)) are finite dimensional with equal dimensions over F (Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis).

Facts & Assumptions

[A1]

The compact K is bounded; if C is a bound for K, then Ax(1+C)x, so A is bounded and linear (Compact linear operator, A bounded linear operator between normed spaces). Under DC there is m0 from which the kernel and range chains stabilize; since every larger exponent has the same properties, take mmax{m0,1}. Then kerAm=kerAn and ranAm=ranAn for all nm, and with N:=kerAm, Y:=ranAm one has X=NY, N finite dimensional, Y closed, A(Y)=Y and AY a bounded isomorphism (Riesz Schauder ascent and descent stabilize, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain); AC supplies DC (AC supplies the countable and dependent choices used in Banach integration).

[A2]

A=IK: the transpose of the identity is the identity and the transpose is additive (Transposition reverses composition, The transpose of a bounded operator); under DC the range of IK is closed (Range of identity minus compact is closed). For a bounded linear T with closed range one has (ranT)=kerT and ranT=(kerT) (Elementary kernel and range annihilator identities).

[A3]

A bounded bijection between Banach spaces has a bounded inverse (Bounded inverse theorem, Banach space). For a linear map T:VW over F with V finite dimensional, dimFV=dimFkerT+dimFranT (Rank-nullity: dimFV=nullityT+rankT, Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis); for a linear subspace UV the quotient V/U is a vector space and a surjective linear map induces a linear isomorphism V/kerTranT (First isomorphism theorem for vector spaces: V/kerT is isomorphic to imT, The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M), Linear subspace of a vector space).

Proof

technique · direct

Given: AC, a Banach space X over the fixed field F{R,C}, a compact K:XX, A=IK; and m, N=kerAm, Y=ranAm as in [A1].

1.1

N is finite dimensional, Y is closed, AY is a bounded isomorphism of Y onto Y, and X=NY. Moreover A(N)N, because Am(An)=A(Amn)=0 for nN. All subspaces, quotients and dimensions below are over F.

A1
2.1

kerAN and kerA=ker(AN): if Ax=0 then Amx=0, so xN; conversely xN with Ax=0 means xkerA.

step 1.1
2.2

ranA=A(N)+Y: because A is linear, X=N+Y and A(Y)=Y.

step 1.1
2.3

A(N)N whenever N{0}: Am vanishes on N, and if A(N)=N then AN is a surjective linear endomorphism of the finite-dimensional space N, hence also injective, so AmN=ANm would be injective while AmN=0 and N{0}, a contradiction.

step 1.1A3
3.1

A=IK, and ranA is closed by [A2], so (ranA)=kerA and ranA=(kerA) with the closure equal to ranA itself.

step 2.2A2
3.2

The inclusion NX induces a linear isomorphism N/A(N)X/ranA: the map φ(n)=n+ranA has kernel NranA=N(A(N)+Y)=A(N)+(NY)=A(N), and it is surjective because every coset x+ranA with x=n+y equals n+ranA.

step 1.1step 2.2A3
3.3

The following are equivalent: A injective, kerA={0}, N={0}, A surjective. Indeed kerA={0} is A injective; N={0} gives kerA={0} by [step 2.1], and conversely N{0} makes AN non-injective by [step 2.3], so kerA{0}; finally N={0} gives X=Y=ranA so A is surjective, while if N{0} and A is surjective then N=NranA=A(N)+(NY)=A(N), contradicting [step 2.3].

step 1.1step 2.1step 2.2step 2.3A3
4.1

If A is injective, hence bijective by [step 3.3], then A1 is bounded by [A3].

step 3.3A3
4.2

For yX the equation Ax=y is solvable if and only if yranA if and only if φ(y)=0 for every φkerA, by [step 3.1].

step 3.1A2
4.3

Rank–nullity for AN:NN gives dimFN=dimFkerA+dimFA(N). The surjective quotient map NN/A(N) has kernel A(N), so rank–nullity also gives dimFN=dimFA(N)+dimF(N/A(N)). Both its image and the first map's kernel are finite dimensional by rank–nullity. Cancelling the common natural summand and using the isomorphism in step 3.2 yields dimFkerA=dimF(X/ranA), with both spaces finite dimensional.

step 2.1step 3.2A3algebra
5.1

Collecting: [step 3.3] and [step 4.1] give claim 1, [step 4.2] gives claim 2, and [step 4.3] gives finite dimensionality and equality of the dimensions of kernel and cokernel, claim 3.

step 3.3step 4.1step 4.2step 4.3
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Neumann series and small perturbations of bounded inverses

Statement

Let X and Y be Banach spaces over the same scalar field (Banach space).

  1. If RB(X) satisfies R<1 (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum), then IR is invertible with inverse the operator-norm limit of the partial sums n<NRn, the norm limit being taken in B(X) (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators), and n=0Rn11R.
  2. If AB(X,Y) is invertible with A1B(Y,X) and EB(X,Y) satisfies A1E<1, then A+E is invertible with (A+E)1=(I+A1E)1A1B(Y,X).

Facts & Assumptions

[A1]

RnRn for every n, by induction from STST (Composition satisfies |ST|\le|S|,|T|, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A2]

For r<1 the scalar series rk converges with sum 1/(1r) (For r<1, k0rk=1/(1r), and for r1 the series diverges); in particular R<1 makes nRn converge to the real number 1/(1R).

[A3]

If Y is Banach then B(X,Y) is Banach for the operator norm (If (Y) is Banach then (\mathcal B(X,Y)) is Banach, The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators, Banach space); a series in a Banach space that converges absolutely converges (Series criterion for Banach spaces).

[A4]

Addition and scalar multiplication are continuous on a normed space (Vector addition and scalar multiplication are continuous in a normed space), and the reverse triangle inequality makes every norm continuous with respect to norm convergence (The reverse triangle inequality in a normed space, Convergence of a sequence in a metric space: xkx iff d(xk,x)0 in R).

Proof

technique · direct

Given: Banach spaces X,Y over one scalar field, RB(X) with R<1, and the partial sums SN:=n<NRn.

1.1

For every n one has RnRn, and nRn converges to 1/(1R).

A1A2
2.1

The space B(X) is Banach, so the absolutely convergent series nRn converges in operator norm to some SB(X). For every N, the finite triangle inequality and [step 1.1] give SNn<NRnn=0Rn=11R. Since SNS and the norm is continuous, taking the limit yields S1/(1R).

step 1.1A2A3A4
2.2

For every N one has (IR)SN=SN(IR)=IRN, and RNRN0, so RN0.

step 1.1A1algebra
3.1

From [step 2.1] and [step 2.2], (IR)S=limN(IR)SN=limN(IRN)=I and likewise S(IR)=I: the first limit holds because (IR)(SSN)(1+R)SSN0.

step 2.1step 2.2A1A4
4.1

Hence IR is invertible with inverse S=n0Rn and (IR)11/(1R), which is claim 1.

step 2.1step 3.1
4.2

For the perturbation, A+E=A(I+A1E) and A1E=A1E<1, so by [step 3.1] applied to R:=A1EB(X) the operator I+A1E is invertible with bounded inverse, and therefore (A+E)1=(I+A1E)1A1B(Y,X), which is claim 2.

step 3.1algebra
5.1

Claims 1 and 2 are exactly the two parts of the statement.

step 4.1step 4.2
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Spectrum and resolvent of a bounded operator

Definition

Let X be a complex Banach space (Banach space, The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane) and let TB(X) be a bounded linear operator (A bounded linear operator between normed spaces, The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators). For a scalar λC write λIT for the bounded linear operator xλxTx (Linear map between vector spaces over the same field).

  • The resolvent set of T is ρ(T):={λC:λIT is bijective and its inverse is a bounded operator XX}. For λρ(T) the inverse R(λ,T):=(λIT)1, an element of B(X), is the resolvent operator of T at λ.
  • The spectrum of T is its complement σ(T):=Cρ(T).
  • A scalar λ is an eigenvalue of T when ker(λIT){0}; the nonzero vectors of that kernel are the eigenvectors of T for λ, and Eλ(T):=ker(λIT) is the eigenspace. The set of eigenvalues is the point spectrum of T; plainly the point spectrum is contained in σ(T), since an operator with nonzero kernel is not injective.
  • For λC the generalized eigenspace of T at λ is Gλ(T):=n1ker((TλI)n), an increasing union of linear subspaces (Linear subspace of a vector space); the union is a linear subspace because the union is increasing. If λ is an eigenvalue and Gλ(T) is finite dimensional, dimCGλ(T) (Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis) is the algebraic multiplicity of the eigenvalue λ.

Every element of Gλ(T){0} produces an eigenvector, and conversely. If (TλI)nx=0 with x0, let k1 be least with (TλI)kx=0; then y:=(TλI)k1x is nonzero and satisfies (TλI)y=0. So Gλ(T){0} exactly when λ is an eigenvalue. In particular λρ(T) implies Gλ(T)={0}. If λ is an eigenvalue and Gλ(T) is finite dimensional, then the algebraic multiplicity is defined and is at least dimCEλ(T), because Eλ(T)Gλ(T).

Conventions. Only complex scalars are treated here; the real case is handled by complexification on a later page, so no spectrum is attached here to a bounded operator on a real Banach space. The definition is purely one of vocabulary; it asserts no nonemptiness of σ(T), no openness of ρ(T) and no continuity of λR(λ,T), all of which are proved separately. Since 0IT=T, the number 0 lies in σ(T) exactly when T is not invertible with bounded inverse.

TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Riesz schauder spectrum of a compact operator

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a complex Banach space, let K:XX be a compact operator (Compact linear operator) and let σ(K) be its spectrum (Spectrum and resolvent of a bounded operator). Then:

  1. every λσ(K) with λ0 is an eigenvalue of K whose generalized eigenspace Gλ(K) is finite dimensional, so its algebraic multiplicity is finite;
  2. for every real ε>0 the set {λσ(K):λε} is finite;
  3. if X is infinite dimensional (does not admit an ordered basis of finite length), then 0σ(K).

Facts & Assumptions

[A1]

For λ0 put Aλ:=IK/λ. Since K/λ is compact, the Fredholm alternative applies to it: Aλ is injective if and only if it is surjective, and then boundedly invertible; moreover λIK=λAλ and, for yX, the equation (λIK)x=y is solvable exactly when φ(y)=0 for every φ in the kernel of the transpose (Linear combinations of compact operators are compact, Fredholm alternative for identity minus compact, Spectrum and resolvent of a bounded operator, A bounded linear operator between normed spaces).

[A2]

For the compact operator K/λ the stabilization lemma gives an m with kerAλn=kerAλm and ranAλn=ranAλm for all nm, X=kerAλmranAλm, finite-dimensional kerAλm and a bounded isomorphism Aλ of ranAλm onto itself (Riesz Schauder ascent and descent stabilize, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain); AC supplies DC (AC supplies the countable and dependent choices used in Banach integration).

[A3]

If BB(X) is invertible with bounded inverse and (μλ)B1<1 then B+(μλ)I is invertible with bounded inverse; if C<1 then IC is invertible with bounded inverse (Neumann series and small perturbations of bounded inverses); and for a nilpotent endomorphism N of a vector space with Nm=0 the operator I+tN is invertible with inverse j<m(tN)j for every scalar t (finite telescoping sum).

[A5]

If T is compact and C is bounded linear then TC and CT are compact (Compositions with a compact operator are compact); a normed space whose closed unit ball is compact admits an ordered basis of finite length (The closed unit ball is compact if and only if the normed space is finite-dimensional); a closed subspace of a Banach space is Banach (Closed subspaces of complete metric spaces are complete; the converse under countable choice, Banach space).

Proof

technique · direct

Given: AC, a complex Banach space X, a compact K:XX, and for λ0 the operator Aλ=IK/λ.

1.1

For λ0, λσ(K) if and only if ker(λIK)={0}: the operator λIK is bijective exactly when it is injective, by the injective-iff-surjective part of [A1] applied to Aλ.

A1
1.2

For λ0 the generalized eigenspace satisfies Gλ(K)=n1ker(Aλn)=ker(Aλm) for an m given by [A2], hence Gλ(K) is finite dimensional whenever it is nonzero, and it is nonzero exactly when λ is an eigenvalue.

A1A2
1.3

The resolvent set ρ(K) is open: if λρ(K) and B:=λIK with inverse B1, then for every scalar μ with μλB1<1 the operator μIK=B+(μλ)I is invertible with bounded inverse by [A3], so such μ lie in ρ(K).

A3
1.4

σ(K){λ:λK}: if λ>K then K/λ<1 and λIK=λ(IK/λ) is invertible with bounded inverse by [A3], so λρ(K).

A3
1.5

If X is infinite dimensional then 0σ(K): if 0ρ(K) then K=0IK has a bounded inverse S, and I=(K)S=K(S) is compact by [A5]; then the closed unit ball of X, the image of itself under I, is compact, so X admits an ordered basis of finite length by [A5], a contradiction.

A5
2.1

If λσ(K) and λ0, then with N:=Gλ(K)=ker(Aλm) and Y:=ranAλm from [A2] one has X=NY, Aλm vanishes on N, and λIK restricted to Y is invertible with bounded inverse; for every scalar μλ the operator μIK is invertible on N, because on N it equals (μλ)(I+(λ/(μλ))Aλ) and AλN is nilpotent.

step 1.2A2A3
2.2

Claim 1: if λσ(K) and λ0, then λ is an eigenvalue with finite-dimensional generalized eigenspace: by [step 1.1] the kernel ker(λIK) is nonzero, and by [step 1.2] the generalized eigenspace is finite dimensional.

step 1.1step 1.2
2.3

For real ε>0 the set Sε:={λσ(K):λε} is compact in C: it is bounded by [step 1.4] and closed because ρ(K) is open by [step 1.3], so under C=R2 it is a closed and bounded subset of R2, hence compact by [A4].

step 1.3step 1.4A4
3.1

If λσ(K) and λ0, there is a real δ>0 with μρ(K) for every μ with 0<μλ<δ: choose δ>0 with δ((λIK)Y)1<1 for the Y of [step 2.1]; then for such μ the restriction of μIK to Y is invertible by [A3] and its restriction to N is invertible by [step 2.1], and invertibility on both summands of X=NY gives invertibility on X.

step 2.1A2A3
4.1

Claim 2: Sε is finite. Every point of Sε lies in σ(K) and is nonzero, so by [step 3.1] each λSε has a ball B(λ,δλ) meeting σ(K) only in λ; the sets SεB(λ,δλ), λSε, form an open cover of the compact set Sε by [step 2.3], and each member contains only the single point λ, so a finite subcover exhibits Sε as a finite set.

step 3.1step 2.3A4
5.1

Claim 3 is [step 1.5], and claims 1, 2, 3 are respectively [step 2.2], [step 4.1] and [step 1.5]; the statement is proved.

step 1.5step 2.2step 4.1
CorollaryStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Spectrum of a compact operator is countable with only zero as possible accumulation

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a complex Banach space, let K:XX be a compact operator (Compact linear operator) and let σ(K) be its spectrum (Spectrum and resolvent of a bounded operator). Then:

  1. σ(K) is at most countable (Finite, countably infinite, countable, uncountable);
  2. for every λC with λ0 there is a real r>0 with B(λ,r)σ(K){λ} (Open ball, closed ball and sphere in a metric space).

In particular the only point of C that can be an accumulation point of σ(K) (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) is 0.

Facts & Assumptions

[A1]

Under AC, for every real ε>0 the set Sε:={λσ(K):λε} is finite (Riesz schauder spectrum of a compact operator).

[A2]

For every real ε>0 there is a natural n1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε).

[A4]

In C the balls are those of the metric d(z,w)=zw (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane, Open ball, closed ball and sphere in a metric space); a point λ is an accumulation point of a set A when every punctured ball B(λ,r){λ} meets A (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

Proof

technique · direct

Given: AC, a complex Banach space X, a compact K:XX, and the sets S1/n={λσ(K):λ1/n}, n1.

1.1

Every subspace of σ(K) of the form S1/n is finite by [A1]; and every μσ(K) with μ0 lies in some S1/n, because μ>0 and [A2] gives n with 1/n<μ.

A1A2
1.2

The set U:={0}n1S1/n is at most countable: it is a countable union of finite sets, and [A3] applies.

A1A3
2.1

σ(K)U by [step 1.1].

step 1.1
2.2

Claim 2: let λ0 and choose n with 1/nλ/2 by [A2]. Every zB(λ,λ/2) satisfies zλzλ>λ/21/n, so the set F:=σ(K)B(λ,λ/2) is contained in S1/n and is finite by [step 1.1]. Put E:=F{λ}. If E is nonempty, the finite set of positive numbers {zλ:zE} has a minimum ρ>0; if E is empty, put ρ:=λ/2. For r:=min(ρ,λ/2)>0, any zB(λ,r)σ(K) lies in F, while zλ would put z in E and give the contradiction zλρr>zλ. Hence B(λ,r)σ(K){λ}.

step 1.1A2A4
3.1

Claim 1: σ(K) is at most countable, being a subset of the at most countable set U, by [A3]; moreover U is at most countable by [step 1.2] and σ(K)U by [step 2.1].

step 1.2step 2.1A3
4.1

Finally, if λ0 and every punctured ball around λ met σ(K), then by [step 2.2] the punctured ball B(λ,r){λ} meets σ(K) yet contains none of its points, a contradiction; so the only possible accumulation point is 0, and claims 1 and 2 are [step 3.1] and [step 2.2].

step 3.1step 2.2A4
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-09-22Open item page →

Fredholm operator cokernel and index

Definition

Let X and Y be Banach spaces over the same scalar field F (Banach space) and let T:XY be a bounded linear operator (A bounded linear operator between normed spaces). Then T is a Fredholm operator when all three of the following hold:

  1. kerT is finite dimensional, that is, admits an ordered basis of finite length (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis);
  2. ranT is a closed subspace of Y (Linear subspace of a vector space);
  3. the cokernel cokerT:=Y/ranT is finite dimensional (The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M), Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis).

Here the cokernel is the algebraic quotient vector space; it also carries the quotient seminorm of The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M)), which is a norm when the range is closed (The quotient seminorm is a norm exactly when the subspace is closed), but the dimension in clause 3 is the vector-space dimension of the quotient and does not depend on that norm.

For a Fredholm operator T the index of T is the integer

indT:=dimFkerTdimFcokerT

Here subtraction is in Z, not in N: write a=dimFkerT and b=dimFcokerT and identify a natural n with [(n,0)]. Precisely,

indT=[(a,b)]=[(a,0)]+([(b,0)])Z

by The integers as equivalence classes of pairs of naturals and Arithmetic on the integers. Both dimensions are natural numbers, so this class is defined even when a<b; the index may be positive, negative or zero.

Two remarks on the definition. The closedness of the range is listed explicitly as a hypothesis of the definition rather than extracted from the other clauses. And no property of the index is asserted here; additivity, local constancy and invariance under compact perturbations are separate theorems.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Fredholm splitting and parametrix

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field and let T:XY be a Fredholm operator (Fredholm operator cokernel and index, A bounded linear operator between normed spaces). Then there are a closed linear subspace X1X and a finite-dimensional closed linear subspace Y0Y with

X=kerTX1,Y=ranTY0,

the coordinate projections of both decompositions being bounded (A complemented closed subspace of a normed space), with dimY0=dimcokerT (Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis), and such that with U:=(TX1)1:ranTX1, which is bounded, the operator

S: YX,S(y):=U(y1)for y=y1+y0, y1ranT, y0Y0,

is bounded and satisfies: STIX has finite-dimensional range of dimension at most dimkerT, and TSIY has finite-dimensional range of dimension at most dimY0.

Facts & Assumptions

[A1]

A finite-dimensional linear subspace of a normed space is complemented, and a closed finite-codimensional linear subspace is complemented; a complemented subspace has a closed complement with bounded coordinate projections (Finite-dimensional subspaces are complemented, Closed finite-codimensional subspaces are complemented, A complemented closed subspace of a normed space, Linear subspace of a vector space).

[A2]

A closed linear subspace of a Banach space is a Banach space (A closed subspace of a Banach space is Banach, Banach space), and by the bounded inverse theorem, under DC, a bounded bijection between Banach spaces has a bounded inverse (Bounded inverse theorem); AC supplies DC (AC supplies the countable and dependent choices used in Banach integration, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[A3]

If q:ZZ/W is the quotient map and a linear bijection Z0Z/W is given, then choosing preimages of a finite basis is a finite selection (Every natural-number-indexed list of nonempty sets has a choice function on its family of values, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M), Linear map between vector spaces over the same field): a linearly independent spanning list pulls back to a linearly independent spanning list, because a linear bijection preserves the vanishing of finite linear combinations in both directions.

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, a Fredholm operator T:XY with N:=kerT finite dimensional and ranT closed with finite-dimensional cokernel.

1.1

There is a closed subspace X1X with X=NX1 and bounded projections.

A1
1.2

There is a closed subspace Y0Y with Y=ranTY0 and bounded projections; the quotient map q:YcokerT=Y/ranT restricts to a linear bijection qY0:Y0cokerT, which is injective because Y0ranT={0} and surjective because y=y1+y0 gives q(y)=q(y0).

A1
2.1

The restriction T1:=TX1:X1ranT is a bounded linear bijection: it is injective because X1kerT={0}, and surjective because T(X)=T(N+X1)=T(X1).

step 1.1
2.2

The subspace Y0 is finite dimensional with dimY0=dimcokerT: pulling back an ordered basis of the finite-dimensional quotient cokerT along the bijection qY0 of [step 1.2] gives an ordered basis of Y0, by the finite selection and independence argument of [A3].

step 1.2A3
3.1

The spaces X1 and ranT are Banach, so U:=T11 is bounded by [A2].

step 2.1A2
4.1

The operator S:YX that equals U on ranT and 0 on Y0 is UP for the bounded projection P:YranT of [step 1.2], hence bounded as a composite of bounded operators.

step 1.2step 3.1
4.2

For x=n+x1 with nN, x1X1 one has STx=S(Tx1)=U(T1x1)=x1, so ST is the bounded projection PX1 onto X1 along N and STIX=PN has range N, of dimension dimkerT.

step 1.1step 3.1
4.3

For y=y1+y0 one has TSy=T(Uy1)=y1, so TS is the bounded projection P onto ranT along Y0 and TSIY has range Y0, of dimension dimY0.

step 1.2step 3.1step 2.2
5.1

The decompositions, the boundedness of U and S and the two finite-rank defects are exactly the assertions, with dimY0=dimcokerT from [step 2.2].

step 4.1step 4.2step 2.2step 4.3
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

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:XY and K:XZ 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

xCTx+Kxfor every xX.

Then kerT is finite dimensional and ranT is closed in Y.

Facts & Assumptions

[A3]

Under DC, ranT is closed exactly when there is a real C>0 with dist(x,kerT)CTx 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,kerT)=λdist(x,kerT), because kerT is a subspace, and dist(u,M)u for nonempty M0.

[A4]

If (uj) is Cauchy and some subsequence converges to u, then uju (Convergence of a sequence in a metric space: xkx 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:XY, compact K:XZ, a real C>0 with xCTx+Kx for all x, and N:=kerT.

1.1

For xN the estimate reads xKx, so KxKx=K(xx)xx for all x,xN.

algebra
1.2

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

A1A4
1.3

For every real η>0 there is x with dist(x,N)=1, x2 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 mN with x0m<2dist(x0,N) and setting x:=(x0m)/dist(x0,N) gives the three properties by scaling.

A3algebra
2.1

The closed unit ball BN:=N{x:x1} is compact: if (xj) is a sequence in BN, then it is bounded so by [A2] some subsequence has Kxjkz; by [step 1.1] the subsequence is Cauchy, xjkxjlKxjkKxjl, hence converges to some xN by [step 1.2], and x1; thus every sequence in BN has a subsequence converging in BN, so BN is sequentially compact, hence compact by [A2].

step 1.1step 1.2A2
2.2

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

step 1.3A2
3.1

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

step 2.1A2
3.2

Under the hypothesis of [step 2.2] the bounded sequence (wj) has, by [A2], a subsequence with Kwjkz for some zZ.

step 2.2A2
4.1

Under the hypothesis of [step 2.2], the subsequence is Cauchy: wjkwjlCT(wjkwjl)+K(wjkwjl)C(1/(jk+1)+1/(jl+1))+KwjkKwjl, and both terms tend to 0; hence wjkw for some wX.

step 2.2step 3.2A4algebra
5.1

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

step 2.2step 4.1A1A4
6.1

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 wN of [step 5.1], which forces dist(w,N)=0.

step 2.2step 4.1step 5.1A3
7.1

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

step 3.1step 6.1A3
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Atkinson

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field and let T:XY be a bounded linear operator (A bounded linear operator between normed spaces). Then T is Fredholm (Fredholm operator cokernel and index) if and only if there is a bounded linear S:YX such that both STIX and TSIY are compact (Compact linear operator).

Facts & Assumptions

[A1]

If T is Fredholm, the splitting lemma provides a bounded S:YX for which STIX has finite-dimensional range of dimension at most dimkerT and TSIY has finite-dimensional range of dimension at most dimcokerT (Fredholm splitting and parametrix); a bounded finite-rank operator is compact (Bounded finite rank operators are compact, Fredholm operator cokernel and index).

[A2]

Under DC, if xCTx+Kx for a compact K and some real C>0, then kerT is finite dimensional and ranT is closed (A compact remainder estimate forces closed range, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, Banach space); AC supplies DC (AC supplies the countable and dependent choices used in Banach integration).

[A3]

Transposition is additive with (BA)=AB and I=I (Transposition reverses composition, The transpose of a bounded operator); a compact operator between Banach spaces has compact transpose (Schauder compact adjoint theorem); the kernel of IC with C compact is finite dimensional (Kernel of identity minus compact is finite dimensional).

[A4]

For a bounded T, (ranT)=kerT and ranT=(kerT) (Elementary kernel and range annihilator identities); for closed MY the map (Y/M)M, hhq, is a linear isometric bijection (The dual of a quotient is its annihilator, The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M)).

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, and a bounded linear T:XY.

1.1

If T is Fredholm, then the operator S of [A1] satisfies: STIX and TSIY have finite-dimensional ranges, hence are compact.

A1
1.2

Conversely assume there is a bounded S:YX with F:=STIX and G:=TSIY compact. By boundedness choose a real b0 such that Syby for every yY, and put C:=max(b,1)>0.

assume-hyp
2.1

For every xX one has x=STxFx, hence xSTx+FxbTx+FxCTx+Fx.

step 1.2algebra
2.2

By [A3] the transpose of G=TSIY is G=STIY, so ST=IY+G=IY(G); for gY with Tg=0 one has STg=S(Tg)=0 by linearity of S, hence (IY(G))g=STg=0 and kerTker(IY(G)).

step 1.2A3
3.1

Under the hypothesis of [step 1.2], kerT is finite dimensional and ranT is closed, by [A2] applied to the estimate of [step 2.1] with the compact operator F.

step 2.1A2
3.2

Under the hypothesis of [step 1.2] the operator G:=TSIY is compact, so its transpose G is compact by [A3]; the negative G is compact as well, because the image of a bounded set under G is the negative of its image under G and negating a set preserves the compactness of its closure. So [A3] applies to the compact operator G and makes ker(IY(G)) finite dimensional; by [step 2.2] the subspace kerT is finite dimensional.

step 1.2step 2.2A3
4.1

Under the hypothesis of [step 1.2], the dual of the cokernel is finite dimensional: since ranT is closed by [step 3.1], [A4] gives (cokerT)=(Y/ranT)(ranT)=kerT, which is finite dimensional by [step 3.2].

step 3.1step 3.2A4
5.1

Under the hypothesis of [step 1.2], the cokernel is finite dimensional: if Z is a normed space whose dual has ordered basis h1,,hn, then Ψ(z):=(h1(z),,hn(z)) is linear and injective, because a nonzero z has by [A5] a norm-one functional h, and h=icihi forces Ψ(z)0; the inverse bijection carries an ordered basis of the finite-dimensional image Ψ(Z) to an ordered basis of Z by [A5].

step 4.1A5
6.1

Under the hypothesis of [step 1.2] the operator T is Fredholm, since its kernel is finite dimensional by [step 3.1], its range is closed by [step 3.1] and its cokernel is finite dimensional by [step 5.1]; with [step 1.1] this is the asserted equivalence.

step 1.1step 3.1step 5.1
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Fredholm index is additive

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X, Y and Z be Banach spaces over the same scalar field, and let T:XY and U:YZ be Fredholm operators (Fredholm operator cokernel and index, A bounded linear operator between normed spaces). Then UT:XZ is Fredholm and

ind(UT)=indU+indT.

Facts & Assumptions

[A1]

By Atkinson's theorem a bounded A is Fredholm exactly when there is a bounded B with ABI and BAI compact (Atkinson); the compact operators are closed under sums, scalar multiples and composition with bounded operators (Linear combinations of compact operators are compact, Compositions with a compact operator are compact, Fredholm operator cokernel and index).

[A2]

Rank-nullity: for a linear map f:VW with V finite dimensional, dimV=dimkerf+dimranf (Rank-nullity: dimFV=nullityT+rankT, Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis); and dimkerf=dimimg for an exact predecessor g at that spot, so that a finite exact sequence 0V1V2V3V4V5V60 of finite-dimensional spaces satisfies i=16(1)i+1dimVi=0 (Linear map between vector spaces over the same field, Linear subspace of a vector space).

Proof

technique · direct

Given: AC, Banach spaces X,Y,Z over one scalar field, Fredholm operators T:XY and U:YZ, and parametrices S for T and R for U as in [A1].

1.1

UT is Fredholm: SR is a parametrix for UT, since (SR)(UT)IX=S(RUIY)T+(STIX) and (UT)(SR)IZ=U(TSIY)R+(URIZ) are compact by [A1], so Atkinson gives Fredholmness of UT.

A1
1.2

The maps α:V1V2, α(x)=x; β:V2V3, β(x)=Tx; γ:V3V4, γ(y)=y+ranT; δ:V4V5, δ(y+ranT)=Uy+ran(UT); and ε:V5V6, ε(z+ran(UT))=z+ranU are well-defined linear maps: δ is well-defined because yranT gives Uyran(UT), and the other four are restrictions, inclusions or quotient maps of linear maps.

A3
2.1

All six spaces V1:=kerT, V2:=ker(UT), V3:=kerU, V4:=cokerT, V5:=coker(UT), V6:=cokerU are finite dimensional.

step 1.1A1
2.2

The sequence is exact at V1, V2 and V3: α is injective; kerβ={xV2:Tx=0}=V1=imα; and kerγ={yV3:yranT}={Tx:xV2}=imβ.

step 1.2
2.3

The sequence is exact at V4, V5 and V6: kerδ={y+ranT:Uyran(UT)}={y+ranT:yTxkerU for some x}=imγ; imδ={Uy+ran(UT):yY}={z+ran(UT):zranU}=kerε; and ε is surjective as the quotient map Z/ran(UT)Z/ranU.

step 1.2
3.1

Rank-nullity telescopes the dimensions: with f0:0V1, fi:ViVi+1 for 1i5 and f6:V60 the maps of [step 1.2], exactness gives kerfi=imfi1, so dimVi=dimimfi1+dimimfi, and summing with signs (+,,+,,+,) cancels to dimV1dimV2+dimV3dimV4+dimV5dimV6=0, because imf0=0 and imf6=0.

step 2.1step 2.2step 2.3A2
4.1

The index identity follows: ind(UT)=dimV2dimV5=(dimV1dimV4)+(dimV3dimV6)=indT+indU, by the telescoping identity of [step 3.1] and the definition of the index.

step 3.1A2A3
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Fredholm index is locally constant

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field. Then the Fredholm operators XY (Fredholm operator cokernel and index) form an open subset of the space B(X,Y) of bounded linear operators with the operator norm (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum): for every Fredholm T there is a real δ>0 such that every bounded A:XY with AT<δ is Fredholm, and then indA=indT.

Facts & Assumptions

[A1]

A Fredholm T admits bounded projections splitting X=kerTX1 and Y=ranTY0, with N:=kerT and Y0 finite dimensional, dimY0=dimcokerT, and with T1:=TX1:X1ranT a bounded isomorphism whose inverse T11 is bounded (Fredholm splitting and parametrix).

[A2]

Neumann: if T11C<1 then T1+C is invertible with bounded inverse (Neumann series and small perturbations of bounded inverses, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A3]

Fredholm operators are closed under composition between Banach spaces and the index is additive, ind(UT)=indU+indT (Fredholm index is additive, Fredholm operator cokernel and index); an invertible bounded operator is Fredholm with index 0, its kernel and cokernel being {0}.

[A4]

A linear map defined on a finite-dimensional normed space is bounded (A linear map from a finite-dimensional normed space is bounded); rank-nullity (Rank-nullity: dimFV=nullityT+rankT, Finite-dimensional vector space, and its dimension dimFV; infinite-dimensional means having no finite basis); and for a block-diagonal operator diag(A11,S) on ranTY0 the kernel is kerA11kerS and the cokernel is isomorphic to cokerA11cokerS (The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M), Linear subspace of a vector space).

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, a Fredholm T:XY, and the splitting X=NX1, Y=ranTY0 of [A1].

1.1

The projections PN, PX1, PranT, PY0 of the two splittings are bounded; write κ:=max(1,PranT,PY0).

A1
1.2

If X1={0}, then ranT={0}, so X=N and Y=Y0 are finite dimensional, T=0, and for every bounded A:XY rank-nullity gives indA=dimkerAdimcokerA=dimXdimY=indT; so the claim holds with any δ>0 in this case.

A1A4
2.1

Assume X1{0}, so ranT{0} and T11>0, and put δ:=1/(2κT11)>0. For every bounded A with AT<δ, writing A11=PranTAX1 and T11=T1 one has A11T1κAT, so T11(A11T1)<1/2<1 and A11=T1(I+T11(A11T1)) is invertible with bounded inverse by [A2].

step 1.1A1A2algebra
3.1

Under the hypothesis of [step 2.1], reorder the domain splitting as X=X1N and keep the codomain splitting Y=ranTY0. Let U:YY and V:XX be the bounded operators whose block matrices in these stated orders are U=(IranT0A21A111IY0) and V=(IX1A111A120IN), where A12=PranTAN, A21=PY0AX1 and A22=PY0AN; then UAV=diag(A11,S) with S:=A22A21A111A12, and U,V are invertible with bounded inverses given by the same matrices with the off-diagonal signs reversed.

step 1.1step 2.1A1algebra
4.1

Under the hypothesis of [step 2.1], UAV=diag(A11,S) is Fredholm with index ind(UAV)=indA11+indS=indS, because A11 is an isomorphism of X1 onto ranT and S maps the finite-dimensional space N boundedly into the finite-dimensional space Y0; by [A4] its index is indS=dimkerSdimcokerS=dimkerS+dimimSdimY0=dimNdimY0.

step 3.1A4
5.1

Under the hypothesis of [step 2.1], A is Fredholm with indA=dimNdimY0=indT: since U,V and their inverses are invertible hence Fredholm of index 0, [A3] gives first that A=U1(UAV)V1 is Fredholm, and then indA=ind(U1)+ind(UAV)+ind(V1)=ind(UAV).

step 3.1step 4.1A3
6.1

In the case of [step 1.2] and in the case of [step 5.1] every bounded A with AT below the corresponding δ (any positive number in the first case, the δ of [step 2.1] in the second) is Fredholm of index indT, so the Fredholm operators are open in B(X,Y) and the index is locally constant at T.

step 1.2step 5.1
TheoremStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Fredholm index is stable under compact perturbations

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X and Y be Banach spaces over the same scalar field, let T:XY be a Fredholm operator and let K:XY be compact (Fredholm operator cokernel and index, Compact linear operator, A bounded linear operator between normed spaces). Then T+K is Fredholm and ind(T+K)=indT.

Facts & Assumptions

[A1]

By Atkinson's theorem a bounded operator is Fredholm exactly when it has a bounded parametrix modulo compact operators (Atkinson); compact operators are closed under sums, scalar multiples and composition with bounded operators (Linear combinations of compact operators are compact, Compositions with a compact operator are compact, Fredholm operator cokernel and index).

[A2]

The Fredholm operators form an open subset of B(X,Y) and the index is locally constant (Fredholm index is locally constant, The operator norm as the least bound and as the unit-sphere or unit-ball supremum): for each Fredholm A there is δA>0 such that every bounded B with BA<δA is Fredholm with indB=indA.

Proof

technique · direct

Given: AC, Banach spaces X,Y over one scalar field, a Fredholm T:XY, a compact K:XY, and a parametrix S for T with STIX and TSIY compact.

1.1

For every t[0,1] the operator T+tK is Fredholm: S is a parametrix for it modulo compact operators, because S(T+tK)IX=(STIX)+tSK and (T+tK)SIY=(TSIY)+tKS are compact by [A1], so Atkinson applies.

A1
1.2

The path tT+tK is continuous for the operator norm: (T+sK)(T+tK)stK for all real s,t.

A1A3algebra
2.1

Put U:={t[0,1]:ind(T+tK)=indT}. For every tU, local constancy [A2] gives δ>0 with all operators within δ of T+tK having the same index. With η:=δ/(1+K)>0, every s[0,1] satisfying st<η has (T+sK)(T+tK)stK<δ, hence lies in U.

step 1.2A2
2.2

Put V:=[0,1]U. For every tV, the same argument gives η>0 such that every s[0,1] with st<η has index ind(T+tK)indT and hence lies in V.

step 1.2A2
3.1

Hence U=[0,1]. Indeed 0U. If V were nonempty, then UV=[0,1] would be a disconnection: if tV, step 2.2 supplies a neighbourhood of t whose intersection with [0,1] is contained in V, so this neighbourhood misses U and [A3] gives tU; hence UV=. Similarly step 2.1 gives UV=. Thus the two nonempty sets would be separated, contradicting connectedness of [0,1] in [A3].

step 2.1step 2.2A3
4.1

In particular 1U, so T+K is Fredholm with ind(T+K)=indT, as claimed.

step 1.1step 3.1
CorollaryStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Lambda identity minus compact has index zero

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a Banach space over R or C, let K:XX be a compact operator (Compact linear operator) and let λ0 be a scalar. Then λIK is a Fredholm operator and ind(λIK)=0 (Fredholm operator cokernel and index).

Facts & Assumptions

[A1]

If A is Fredholm and C is compact then A+C is Fredholm with ind(A+C)=indA (Fredholm index is stable under compact perturbations).

[A2]

A scalar multiple of a compact operator is compact (Linear combinations of compact operators are compact); the identity is bounded linear, λI is invertible with inverse λ1I for λ0, and an invertible bounded operator is Fredholm of index 0, because its kernel and cokernel are the zero spaces (Linear map between vector spaces over the same field, A bounded linear operator between normed spaces, Fredholm operator cokernel and index, The quotient vector space (X/M), its cosets, and the quotient map (q:X\to X/M), Banach space).

Proof

technique · direct

Given: AC, a Banach space X over R or C, a compact K:XX and a scalar λ0.

1.1

The operator λI is bounded and invertible with inverse λ1I, hence Fredholm with ind(λI)=dim{0}dim{0}=0.

A2
1.2

The operator K is compact by [A2], and λIK=λI+(K) is a compact perturbation of the Fredholm operator λI.

A2algebra
2.1

By [A1] the operator λIK is Fredholm and ind(λIK)=ind(λI)=0, which is the claim.

step 1.1step 1.2A1

5 · Examples, counterexamples and false statements

None yet.

Sources