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:X→X 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λ:=I−K/λ. 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 λI−K=λAλ and, for y∈X, the equation (λI−K)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 ker⁡Aλn=ker⁡Aλm and ran⁡Aλn=ran⁡Aλm for all n≥m, X=ker⁡Aλm⊕ran⁡Aλm, finite-dimensional ker⁡Aλm and a bounded isomorphism Aλ of ran⁡Aλ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 B∈B(X) is invertible with bounded inverse and ∥(μ−λ)B−1∥<1 then B+(μ−λ)I is invertible with bounded inverse; if ∥C∥<1 then I−C 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:X→X, and for λ≠0 the operator Aλ=I−K/λ.

1.1A1

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

1.2A1A2

For λ≠0 the generalized eigenspace satisfies Gλ(K)=⋃n≥1ker⁡(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.

1.3A3

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

1.4A3

σ(K)⊆{λ:∣λ∣≤∥K∥}: if ∣λ∣>∥K∥ then ∥K/λ∥<1 and λI−K=λ(I−K/λ) is invertible with bounded inverse by [A3], so λ∈ρ(K).

1.5A5

If X is infinite dimensional then 0∈σ(K): if 0∈ρ(K) then −K=0I−K 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.

2.1step 1.2A2A3

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

2.2step 1.1step 1.2

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

2.3step 1.3step 1.4A4

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].

3.1step 2.1A2A3

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

4.1step 3.1step 2.3A4

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.

5.1step 1.5step 2.2step 4.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.

Depends on

Used by

Dependency tree · two levels

110 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