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.
Symmetric, self-adjoint and essentially self-adjoint operators
Definition
Assume Countable Choice. Let be a densely defined linear operator on .
- is symmetric when , that is, and for all ; equivalently for all .
- is self-adjoint when , that is, the domains and the values agree.
- is essentially self-adjoint when its closure is self-adjoint; by Closability is equivalent to density of the adjoint domain this presupposes that is closable.
Consequences, with proofs. These are part of the content of the definition.
- A symmetric is closable. and is closed (The adjoint is well defined, closed, and reverses inclusions), so is a closed extension of . In particular the closure exists and .
- The closure of a symmetric operator is symmetric. If , the inclusion reversal of The adjoint is well defined, closed, and reverses inclusions applied to gives , that is . Applying it once more to the inclusion gives , that is . Since and (Closability is equivalent to density of the adjoint domain), this reads : the closure is symmetric. (Each application is legitimate because the adjoint is defined once its operator is densely defined, and is dense because , so that contains the dense domain .)
- A self-adjoint operator has no proper symmetric extension. If and , then by inclusion reversal, so and all inclusions are equalities.
- A self-adjoint operator is closed, being equal to the adjoint of the densely defined , and an essentially self-adjoint operator has exactly one self-adjoint extension, namely : a self-adjoint extension of is closed, hence contains the least closed extension , and then by item 2 and symmetry, so .
Depends on
- Adjoint of a densely defined operator
- Closability is equivalent to density of the adjoint domain
- The adjoint is well defined, closed, and reverses inclusions
- Closure of a closable operator
- Densely defined, closed and closable operators, and cores
- Unbounded linear operators: domain, graph and extension
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Existence of self-adjoint extensions is equality of deficiency indices Corollary
- Unitary groups converge under strong resolvent convergence Corollary
- A symmetric closed operator that is not self-adjoint Counterexample
- An everywhere-defined closed operator on a Banach space is bounded Counterexample
- Cayley transform of a self-adjoint operator Definition
- Deficiency subspaces and deficiency indices Definition
- Discrete and essential spectrum of a self-adjoint operator Definition
- Norm and strong resolvent convergence Definition
- Pure point, absolutely continuous and singular continuous spectral subspaces Definition
- Relative compactness with respect to an operator Definition
- Periodic derivative and its unitary translation group Example
- A self-adjoint operator generates a strongly continuous unitary group Lemma
- Spectral form domain and core of a semibounded operator Lemma
- The generator of a unitary group is closed and skew-adjoint Lemma
- The resolvent star algebra is dense in C₀(R) Lemma
- Cayley correspondence between self-adjoint operators and unitaries Theorem
- Kato-Rellich theorem Theorem
- Min-max principle below the essential spectrum Theorem
- Range criterion for self-adjointness Theorem
- Resolvent of a self-adjoint operator: nonreal resolvents and the estimate Theorem
- Spectral theorem for unbounded self-adjoint operators (PVM form) Theorem
- Stone's theorem: unitary groups and self-adjoint generators Theorem
- Unbounded Borel functional calculus: domains, products, spectral mapping Theorem
- Weyl's theorem: invariance of the essential spectrum Theorem
Dependency tree · two levels
23 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
- Dana P. Williams, Lecture Notes on the Spectral Theorem (standard reference, not scraped)
- Gerald Teschl, Mathematical Methods in Quantum Mechanics, second edition (standard reference, not scraped)
- Theo Buehler and Dietmar A. Salamon, Functional Analysis (standard reference, not scraped)