Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Discrete and essential spectrum of a self-adjoint operator

Definition

Assume the Axiom of Choice. Let A be a self-adjoint operator on a complex Hilbert space H with spectral projection valued measure E on R (Spectral theorem for unbounded self-adjoint operators (PVM form)). The discrete spectrum σd(A) is the set of eigenvalues of A that are isolated points of σ(A) and whose eigenspace is finite dimensional; the essential spectrum is σess(A):=σ(A)σd(A), with σ(A) as in Resolvent and spectrum of an unbounded operator.

For H={0} use its unique PVM directly: the spectrum and both parts are empty and every projection has rank zero. Below suppose H{0}, as required by the cited spectral theorem.

Spectral-projection description, with proofs. Fix λR and write Pε:=E((λε,λ+ε)) for ε>0.

Here rank means the algebraic dimension of the range when finite; rank = means the range is not finite dimensional. The calculus Unbounded Borel functional calculus: domains, products, spectral mapping gives the support facts: E(Rσ(A))=0, and every open interval about a spectral point has nonzero projection. Projections on disjoint sets have orthogonal ranges, and E(B)E(C)=E(BC) Projection valued measure.

  1. E({λ}) is the projection onto ker(Aλ). If x=E({λ})x, its scalar measure Ex is supported on {λ} by the projection identity. Thus μ2dEx=λ2x2<, so xD(A), and (Aλ)x2=μλ2dEx=0. The domain and norm identities are supplied by the unbounded calculus and The unbounded PVM integral is densely defined, closed and normal. Hence Ax=λx. Conversely, for an eigenvector (or the zero vector) the same norm identity gives zero integral. On {μλ1/n} this bounds the measure by n2 times that zero integral; taking the countable union shows Ex(R{λ})=0. Since (IE({λ}))x2 equals this scalar measure, E({λ})x=x.
  2. A finite-rank interval contains only finitely many spectral points. If Pε has rank r< and its interval contained r+1 distinct spectral points, choose disjoint small open intervals about those finitely many points, all contained in the given interval. Each has a nonzero projection by support. Choose one unit vector in each range. They are orthonormal vectors in ranPε, hence linearly independent (take inner products with each vector), contradicting its dimension r. Thus there are at most r spectral points there. In particular any λσ(A) with such a finite-rank Pε is isolated: take a smaller interval around λ excluding the other finitely many points. For that interval the projection is E({λ}) by support, is nonzero by support, and has finite rank since its range lies in ranPε. By item 1, λ is an eigenvalue of finite multiplicity.
  3. The two rank characterizations. If λσd(A), an isolating interval has projection E({λ}), of finite rank by item 1. Conversely, if λ is an eigenvalue and some Pε has finite rank, item 2 proves it discrete. Hence λσd(A)λ is an eigenvalue and some Pε has finite rank. If λσess(A), item 2 excludes every finite-rank interval. Conversely, if every Pε has infinite rank, each is nonzero, so support puts λ in σ(A), and the just-proved discrete characterization excludes it from σd(A). Therefore λσess(A)rankPε= for every ε>0.
  4. σess(A) is closed. If λnσess(A) and λnλ, then for every ε>0 some n has (λnε/2,λn+ε/2)(λε,λ+ε), so rankPεrankPε/2(n)= and λσess(A) by item 3.

The closure conclusion is in R, and also in C since R is closed there. A spectral accumulation point has infinitely many spectral points in every surrounding interval, so item 2 forces infinite rank. An isolated eigenvalue of infinite multiplicity has its infinite-dimensional eigenspace inside every interval range by item 1. Consequently an accumulation point of σ(A) and an isolated eigenvalue of infinite multiplicity both lie in σess(A), and σ(A) is the disjoint union of σd(A) and σess(A).

Depends on

Used by

Dependency tree · two levels

44 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