Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 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.

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

Depends on

Used by

Dependency tree · two levels

103 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