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.
Weyl's theorem: invariance of the essential spectrum
Statement
Assume the Axiom of Choice. Let be self-adjoint operators such that is compact for one nonreal (equivalently, for every ). Then . In particular a bounded self-adjoint compact perturbation preserves the essential spectrum, and if is symmetric and -compact, then with .
Facts & Assumptions
exactly when has an orthonormal singular Weyl sequence at (Weyl criterion for the essential spectrum, Discrete and essential spectrum of a self-adjoint operator).
For and one has on , equivalently (Resolvent and spectrum of an unbounded operator).
A compact operator maps weakly convergent sequences to norm convergent sequences, and is bounded (Compact operator sends weakly convergent sequences to norm convergent sequences, Compact linear operator).
For self-adjoint and nonreal , the bounded resolvent identity gives , where and the inverse first factor is . Hence compactness of transfers to , and conversely by exchanging (The resolvent star algebra is dense in C_0(R), Compositions with a compact operator are compact).
An -compact symmetric has -bound zero, so Kato-Rellich makes self-adjoint on ; the second resolvent identity holds for in the common resolvent set (Relative compactness with respect to an operator, Kato-Rellich theorem, Second resolvent identity for a closed perturbation).
Proof
Given: Self-adjoint with compact resolvent difference at a nonreal .
Let and let be the orthonormal Weyl sequence of [A1]. By [A2] and one has ; since is compact and , [A3] gives as well.
Parameter independence is [A4].
Then by [A2] and step 1.1, and ; the normalized vectors lie in , have unit norm, converge weakly to and satisfy , so they form a singular Weyl sequence and by [A1]. Interchanging the roles of and gives equality.
Bounded compact perturbations: if is bounded, symmetric and compact, then is self-adjoint with by Kato-Rellich applied with the admissible pair , and the second resolvent identity gives , compact as a product of the compact with bounded factors; so by step 2.1.
-compact perturbations: for symmetric that is -compact, [A5] makes self-adjoint with and gives , a product of the bounded operator with the compact operator , hence compact; then step 2.1 applies.
The claims are steps 1.1, 1.2 and 2.1 (compact resolvent difference), 3.1 (bounded compact perturbations) and 3.2 (-compact perturbations). ∎
Depends on
- Discrete and essential spectrum of a self-adjoint operator
- Weyl criterion for the essential spectrum
- Relative compactness with respect to an operator
- Second resolvent identity for a closed perturbation
- The resolvent star algebra is dense in C_0(R)
- Kato-Rellich theorem
- Compact operator sends weakly convergent sequences to norm convergent sequences
- Resolvent and spectrum of an unbounded operator
- The Axiom of Choice
- Symmetric, self-adjoint and essentially self-adjoint operators
- Compositions with a compact operator are compact
- Compact linear operator
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
72 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
- Gerald Teschl, Mathematical Methods in Quantum Mechanics, second edition (standard reference, not scraped)