Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Spectral theorem for compact self adjoint operators

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a real or complex Hilbert space (Hilbert space) and let T∈B(H) be a compact self-adjoint operator (Compact linear operator, Self-adjoint, positive, unitary and normal operators, A bounded linear operator between normed spaces). Let

Σ:={λ:λ is an eigenvalue of T, λ≠0}

be its set of nonzero eigenvalues (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism), with eigenspaces Eλ=ker⁡(T−λI) for λ∈Σ. Then:

  1. Σ is a finite or countably infinite set of real numbers, each eigenvalue has finite multiplicity in the sense dim⁡Eλ<+∞, and for every real ε>0 there are only finitely many λ∈Σ with ∣λ∣≥ε; in particular every point of F∖{0} has a neighbourhood containing only finitely many elements of Σ, so the only possible accumulation point of Σ is 0;
  2. the closed linear span M of ⋃λ∈ΣEλ satisfies M=(ker⁡T)⊥=ran⁡T‾ (Orthogonality and the orthogonal complement), and H=M⊕M⊥ with M⊥⊆ker⁡T;
  3. for every x∈H the finite-subset net of ∑λ∈ΣλPλx over the orthogonal projections Pλ onto Eλ converges in norm and Tx=∑λ∈ΣλPλx;
  4. if in addition H is a complex Hilbert space, then the nonzero spectrum agrees with the nonzero eigenvalues, σ(T)∩{μ∈C:μ≠0}=Σ.

No Hilbert basis of ker⁡T is selected anywhere: only the orthonormal bases of the finite-dimensional eigenspaces Eλ, λ≠0, are used.

Facts & Assumptions

Given: Countable Choice, a real or complex Hilbert space H, a compact self-adjoint T∈B(H), the set Σ of nonzero eigenvalues, their eigenspaces Eλ=ker⁡(T−λI), and M:=span⁡‾⋃λ∈ΣEλ (the closed linear span).

[A1]

Self-adjointness and eigenspaces. q(x)=⟨Tx,x⟩ is real and ⟨Tx,y⟩=⟨x,Ty⟩ for all x,y; Eλ=ker⁡(T−λI) is the eigenspace of λ and is a linear subspace (Self-adjoint, positive, unitary and normal operators, The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism, Linear subspace of a vector space, Kernel and image of a linear map).

[A2]

Extremal eigenvalue and orthogonality. Every nonzero compact self-adjoint operator has ∥S∥ or −∥S∥ as an eigenvalue with a unit eigenvector (Norm point of a compact self adjoint operator is an eigenvalue up to sign); eigenvalues of a self-adjoint operator are real and distinct eigenspaces are orthogonal (Eigenspaces of a self adjoint operator are orthogonal); Eλ and Eλ⊥ are closed T-invariant subspaces on which T satisfies the self-adjoint identity (Orthogonal complement of an eigenspace is invariant).

[A4]

Subspace compactness. If W is a closed subspace of H, the inclusion ι:W→H is a bounded linear operator and Tι is compact (Compositions with a compact operator are compact, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A5]

Finite dimension. A normed space has compact closed unit ball exactly when it admits an ordered basis of finite length (The closed unit ball is compact if and only if the normed space is finite-dimensional); every finite-dimensional real or complex inner product space has an orthonormal basis, the empty one in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis); an orthonormal family is linearly independent with unit vectors (Orthonormal families, complete orthonormal systems and Hilbert bases).

[A6]

Orthogonal complements and expansion. For every subset S, S⊥ is a closed linear subspace; u⊥v means ⟨u,v⟩=0 (Orthogonality and the orthogonal complement, Orthogonal complements are closed); M⊥⊥=M‾ for a linear subspace M (The double orthogonal complement of a subspace is its closure); H=M⊕M⊥ for closed M, with unique decomposition (Orthogonal decomposition by a closed subspace); the finite-subset net of ∑j⟨x,ej⟩ej converges to x for a complete orthonormal family, with Parseval's identity (Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family); finite Bessel: ∑j∈F∣⟨x,ej⟩∣2≤∥x∥2 (The finite Bessel inequality and best approximation by a finite orthonormal family); a square-summable orthogonal family has a norm-convergent finite-subset net whose limit has the sums of the squared norms (Square-summable orthogonal families have norm-convergent finite sums, Square-summable families on an arbitrary index set and the space ℓ2(I)).

[A7]

Cardinality and Archimedes. Under ACω a countable union of at most countable sets is at most countable, and subsets of at most countable sets are at most countable (Countable unions of at most countable sets, assuming ACω, Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable, The Axiom of Countable Choice (ACω)); for every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[A9]

Spectrum. For a complex Banach space, μ∈ρ(T) means μI−T is bijective with bounded inverse, σ(T)=C∖ρ(T), and every eigenvalue lies in σ(T) (Spectrum and resolvent of a bounded operator).

Proof

technique · direct

Given: Countable Choice, the compact self-adjoint T, the set Σ of its nonzero eigenvalues, the eigenspaces Eλ, the closed span M, and the closed unit ball B‾.

1.1A2A3A5

Nonzero eigenspaces are finite-dimensional. Let λ∈Σ and let C:=T(B‾)‾, which is compact by [A3]. If x∈Eλ with ∥x∥≤1 then Tx=λx, so x=λ−1Tx∈λ−1T(B‾)⊆λ−1C; thus B‾Eλ:={x∈Eλ:∥x∥≤1}⊆λ−1C, and λ−1C is compact as a continuous image of a compact set [A3]. The set Eλ is closed [A2], so B‾Eλ is closed in H and hence compact as a closed subset of the compact set λ−1C [A3]; by the closed-unit-ball criterion [A5] applied to the normed space Eλ, the space Eλ has finite dimension, so its multiplicity is finite.

1.2A1A2A3A8algebra

Only finitely many eigenvalues above each threshold. Fix ε>0 and put Σε:={λ∈Σ:∣λ∣≥ε}. The compact set C:=T(B‾)‾ has a finite cover by open balls of radius ε/2 with centres in C, by applying compactness to the cover by all such balls [A3]. For each ball U in that finite cover let LU consist of those λ∈Σε for which Te∈U for some unit e∈Eλ. If distinct λ,ν belonged to LU, their witnessing unit eigenvectors e,f would be orthogonal by [A2], and hence ∥Te−Tf∥2=∣λ∣2+∣ν∣2≥2ε2, whereas two points of U have distance less than ε. Thus each LU has at most one element. Every λ∈Σε has a unit eigenvector whose image belongs to C, so Σε=⋃ULU is finite. This argument makes no infinite choice of eigenvectors. For a≠0, the ball B(a,∣a∣/2) meets Σ only inside Σ∣a∣/2, proving local finiteness away from zero.

1.3A1A2A3A4A6

M⊥ is annihilated by T. Since M is the closed linear span of the subspaces Eλ, a vector is orthogonal to M exactly when it is orthogonal to every Eλ; hence M⊥=⋂λ∈ΣEλ⊥ is a closed linear subspace, and it is T-invariant because each Eλ⊥ is T-invariant [A2]. As a closed subspace of the Hilbert space H, M⊥ is complete [A3], and the restriction S:M⊥→M⊥ is compact: [A4] gives compact closure in H of each bounded image, that closure lies in the closed subspace M⊥, and its subspace topology is unchanged and self-adjoint, since for u,v∈M⊥ one has ⟨Tu,v⟩=⟨u,Tv⟩ in H and both vectors lie again in M⊥. If S≠0, the extremal eigenvalue lemma [A2] provides μ=±∥S∥≠0 and w∈M⊥∖{0} with Sw=μw, hence Tw=μw and w∈Eμ⊆M; then w∈M∩M⊥, so ⟨w,w⟩=0 and w=0 by positive definiteness, a contradiction. Therefore S=0, that is T vanishes on M⊥.

2.1step 1.2A1A2A5A7

An orthonormal family with closed span M. By [step 1.2] each set Σ1/(n+1)={λ∈Σ:∣λ∣≥1/(n+1)}, n∈N, is finite, and every λ∈Σ lies in some Σ1/(n+1) because ∣λ∣>0 and 1/(n+1)<∣λ∣ for a suitable n by [A7]; hence Σ=⋃n∈NΣ1/(n+1) is at most countable by [A7]. By Countable Choice [A7], choose for every λ∈Σ an orthonormal basis (eλ,1,…,eλ,dλ) of the finite-dimensional space Eλ, which exists by [A5], and let (ej)j∈J be the disjoint union of these finite families indexed by the at most countable set Σ, so that J is at most countable. Every ej has norm 1, and orthonormal bases of orthogonal eigenspaces [A2] make (ej)j∈J an orthonormal family whose closed linear span is M by the definition of M.

2.2step 1.3A1A6algebra

The support of the operator. Every eigenvector with nonzero eigenvalue is orthogonal to ker⁡T, because for y∈ker⁡T and x∈Eλ with λ≠0 one has λ⟨x,y⟩=⟨Tx,y⟩=⟨x,Ty⟩=0 by self-adjointness, so ⟨x,y⟩=0; since (ker⁡T)⊥ is closed [A6] and contains each Eλ, it contains M, while [step 1.3] and [A6] give (ker⁡T)⊥⊆(M⊥)⊥=M‾=M; hence M=(ker⁡T)⊥. Moreover ran⁡T⊆(ker⁡T)⊥ by the same computation read with x arbitrary, so ran⁡T‾⊆(ker⁡T)⊥, and if z⊥ran⁡T then 0=⟨z,Tx⟩=⟨Tz,x⟩ for every x, whence Tz=0 and z∈ker⁡T; applying [A6] to the linear subspace ran⁡T gives ran⁡T‾=(ran⁡T)⊥⊥⊆(ker⁡T)⊥, while the previous inclusion reverses after taking complements: (ker⁡T)⊥⊆ran⁡T⊥⊥=ran⁡T‾.

3.1step 1.3step 2.1step 2.2A1A6A8algebra

The spectral expansion. Let x∈H. By [A6] and [step 2.2] there is a unique decomposition x=m+n with m∈M and n∈M⊥, and by [step 1.3] n∈ker⁡T, so Tn=0. By [step 2.1] the family (ej) is complete in M, so the Fourier expansion [A6] gives m=∑j∈J⟨m,ej⟩ej as the limit of the finite-subset net, and the same holds with ⟨x,ej⟩ in place of ⟨m,ej⟩ because x−m∈M⊥. Writing Pλx:=∑i=1dλ⟨x,eλ,i⟩eλ,i∈Eλ, the family (Pλx)λ∈Σ is orthogonal with ∑λ∥Pλx∥2≤∥x∥2 by Bessel [A6], so by [A6] the finite-subset net ∑λ∈FPλx converges to some m′∈M; for every j the difference m−m′ is orthogonal to ej, hence to M, so m−m′∈M∩M⊥={0} and m′=m. Finally T(∑λ∈FPλx)=∑λ∈FλPλx for finite F because each Pλx∈Eλ, and continuity of T [A8] carries the convergent net (Pλx) to Tm; hence the finite-subset net of (λPλx) converges to Tm, and adding Tn=0 gives Tx=∑λ∈ΣλPλx.

3.2step 1.2step 2.1A6A8algebra

A spectral gap off the eigenvalue set. Let μ≠0 with μ∉Σ. The set A:={λ∈Σ:∣λ∣≥∣μ∣/2} is finite by [step 1.2], and μ∉A; set δ:=min⁡({∣μ−λ∣:λ∈A}∪{∣μ∣/2}), a positive real number because A is finite and every displayed distance is positive. For every λ∈Σ one has ∣μ−λ∣≥δ: if ∣λ∣≥∣μ∣/2 this is the definition of δ, and if ∣λ∣<∣μ∣/2 then ∣μ−λ∣≥∣μ∣−∣λ∣>∣μ∣/2≥δ by the triangle inequality [A8]. Consequently, for every z∈H the orthogonal family ((μ−λ)−1Pλz)λ∈Σ has ∑λ∣μ−λ∣−2∥Pλz∥2≤δ−2∑λ∥Pλz∥2≤δ−2∥z∥2<+∞ by Bessel [A6], so [A6] makes its finite-subset net converge to a vector of norm ≤δ−1∥z∥.

4.1step 2.1step 3.2A6A8algebra

The candidate inverse. Fix μ≠0 with μ∉Σ and, for z∈H, write z=m(z)+n(z) with m(z)∈M, n(z)∈M⊥ as in [step 3.1]. The limit of the finite-subset net in [step 3.2] is unique: if the same net converges to y and to y′, then for any ε>0 there are finite sets F0,F1⊆Σ such that every F⊇F0 has ∥aF−y∥<ε/2 and every F⊇F1 has ∥aF−y′∥<ε/2; at F=F0∪F1 the triangle inequality gives ∥y−y′∥<ε, and hence y=y′. We may therefore define Az:=∑λ∈Σ(μ−λ)−1Pλz+μ−1n(z), where the first term is that unique limit. The map A is linear because each Pλ is linear and limits respect linear combinations, and ∥Az∥2≤δ−2∥m(z)∥2+∣μ∣−2∥n(z)∥2≤max⁡(δ−1,∣μ∣−1)2∥z∥2 by orthogonality of the decomposition [A6], so A is a bounded linear operator on H.

5.1step 1.3step 2.2step 3.1step 3.2step 4.1A1A2A6A8A9algebra

The inverse identities and the spectrum. Work now over C and fix μ≠0 outside Σ. For finite F⊆Σ, put aF(z):=∑λ∈F(μ−λ)−1Pλz. Since T acts as λI on Eλ, one has (μI−T)aF(z)=∑λ∈FPλz. By [step 3.2] and continuity of μI−T, taking limits gives (μI−T)lim⁡FaF(z)=m(z). Also (μI−T)(μ−1n(z))=n(z) because Tn(z)=0. Thus (μI−T)Az=z. For the other identity, self-adjointness and the finite formula for Pλ give PλTw=λPλw: for each basis vector e∈Eλ, ⟨Tw,e⟩=⟨w,Te⟩=λ⟨w,e⟩, since λ is real. Moreover Tw∈M by [step 2.2], so n((μI−T)w)=μn(w) by uniqueness of the orthogonal decomposition. Consequently A(μI−T)w=lim⁡F∑λ∈FPλw+n(w)=m(w)+n(w)=w. This proves that A is a bounded two-sided inverse, so μ∈ρ(T) [A9]. Conversely a nonzero eigenvector makes λI−T noninjective, so every λ∈Σ lies in σ(T). Therefore σ(T)∩{μ≠0}=Σ.

6.1step 1.1step 1.2step 2.1step 2.2step 3.1step 5.1A2∎

Conclusion. Claim 1 is the combination of [step 1.1], [step 1.2], [step 2.1] and the reality of eigenvalues in [A2]; claim 2 is [step 2.2] together with the decomposition of [step 3.1]; claim 3 is [step 3.1]; claim 4 is [step 5.1]. At no point was a Hilbert basis of ker⁡T selected: the chosen vectors all lie in the eigenspaces Eλ with λ≠0, which are contained in (ker⁡T)⊥ by [step 3.1].

Depends on

Dependency tree · 2 levels

Sources