Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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.

Orthonormal eigenbasis for a compact self adjoint operator

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H be a real or complex Hilbert space (Hilbert space) and let TB(H) be a compact self-adjoint operator (Compact linear operator, Self-adjoint, positive, unitary and normal operators). Then T has a Hilbert basis (Orthonormal families, complete orthonormal systems and Hilbert bases) consisting of eigenvectors of T (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker(TλI), and the spectrum σF(T) of an endomorphism): one may take the union of orthonormal bases of the finitely many-dimensional nonzero eigenspaces with a Hilbert basis of kerT. If kerT={0} no vectors from the kernel are needed, and if all nonzero eigenspaces are absent (that is T=0) the union is a Hilbert basis of H=kerT.

Facts & Assumptions

Given: AC, a real or complex Hilbert space H, a compact self-adjoint T, the set Σ of its nonzero eigenvalues, the eigenspaces Eλ for λΣ, and M:=spanλΣEλ.

[A1]

Spectral theorem. Σ is finite or countably infinite with finite multiplicities, the nonzero eigenvalues are real and distinct eigenspaces are orthogonal, M=(kerT)=ranT and H=MM with M=kerT (Spectral theorem for compact self adjoint operators, Eigenspaces of a self adjoint operator are orthogonal, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker(TλI), and the spectrum σF(T) of an endomorphism).

[A2]

Orthonormal families. An orthonormal family has unit vectors which are pairwise orthogonal, and every finite-dimensional real or complex inner product space has an orthonormal basis, the empty one in dimension zero; the closed linear span of an orthonormal family is a closed subspace, and a Hilbert basis is a complete orthonormal family (Orthonormal families, complete orthonormal systems and Hilbert bases, Every finite-dimensional real or complex inner product space has an orthonormal basis).

[A3]

Complements. S is a closed linear subspace for every subset S; orthogonality is symmetric and bilinear in the obvious sense; for closed M one has H=MM with M=M (Orthogonality and the orthogonal complement, Orthogonal complements are closed, Orthogonal decomposition by a closed subspace).

[A5]

Closed subspaces are complete. A closed subspace of a complete metric space is complete in ZF, so a closed subspace of a Hilbert space is again a Hilbert space (Closed subspaces of complete metric spaces are complete; the converse under countable choice, Hilbert space). The set of orthonormal families in a subset of H is a poset under inclusion, and the inclusion-union of a chain of orthonormal families is orthonormal (Orthonormal families, complete orthonormal systems and Hilbert bases, Partial order and partially ordered set, Chain in a poset).

Proof

technique · direct

Given: AC, the compact self-adjoint T, the nonzero eigenspaces Eλ, their closed span M, and the kernel K0:=kerT.

1.1

An orthonormal family spanning M. For every λΣ the eigenspace Eλ is finite-dimensional by [A1], so it has an orthonormal basis by [A2]; the disjoint union E of all these finite bases is an orthonormal family, because each basis is orthonormal and vectors belonging to distinct eigenvalues are orthogonal by [A1]. Its closed linear span is M by the definition of M, and M=(kerT) by [A1].

A1A2
1.2

A maximal orthonormal family in the kernel. Let P be the set of orthonormal families contained in kerT, ordered by inclusion. This is a nonempty poset (the empty family belongs to it) and the union of any chain in P is again an orthonormal family contained in kerT, hence an upper bound of the chain; therefore Zorn's lemma [A4] provides a maximal element BP.

A2A4A5
2.1

B is complete in the kernel. Let W:=spanBkerT be the closed span of B, which is a closed subspace of the Hilbert space kerT [A5]; if WkerT then by the orthogonal decomposition in the Hilbert space kerT [A3] there is vkerTW with v0. Then v/v has norm 1, is orthogonal to every element of B, and lies in kerT, so B{v/v} is an orthonormal family in kerT strictly containing B, contradicting maximality; hence W=kerT, that is B is a complete orthonormal family of the Hilbert space kerT.

step 1.2A2A3A5
3.1

The union is a Hilbert basis of H. The union EB is an orthonormal family: it is the union of two orthonormal families, and every bBkerT is orthogonal to every eEM=(kerT) by [step 1.1] and [A1]. Its closed linear span contains M (by [step 1.1]) and kerT (by [step 2.1]), hence contains MkerT=H by [A1]; therefore EB is complete and is a Hilbert basis of H.

step 1.1step 2.1A1A2A3
4.1

Conclusion. Every element of EB is an eigenvector of T: the vectors of E lie in nonzero eigenspaces, while every bB is a unit vector in kerT, so b0 and Tb=0=0b (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker(TλI), and the spectrum σF(T) of an endomorphism). Thus, whenever B is nonempty, 0 is an eigenvalue witnessed by each of its members; when kerT={0} one has B=, and the proof neither needs nor asserts that 0 is an eigenvalue. By [step 3.1] the family EB is a Hilbert basis of H consisting of eigenvectors of T, which proves the corollary; the degenerate descriptions in the statement are the cases M={0} (then E= and B spans kerT=H) and kerT={0} (then B=).

step 3.1A1A2A4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

90 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