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 ()