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.
The minimal derivative has deficiency indices (1,1) and many self-adjoint extensions
Statement refuted
Assume the Axiom of Choice (and hence Countable Choice and Dependent Choice). Let be the minimal operator of A symmetric closed operator that is not self-adjoint, that is on in . Then is a closed symmetric operator with : and . Consequently is not self-adjoint but has infinitely many self-adjoint extensions, and these are exactly the operators
Facts & Assumptions
The minimal operator is densely defined, closed and symmetric but not self-adjoint, and with (A symmetric closed operator that is not self-adjoint).
Self-adjoint extensions of a closed symmetric operator correspond bijectively to unitary operators , with domain and action (Von Neumann parameterization of self-adjoint extensions, Deficiency subspaces and deficiency indices).
A closed symmetric operator has a self-adjoint extension if and only if its deficiency indices agree; its extensions are indexed by the unitaries between the deficiency subspaces (Existence of self-adjoint extensions is equality of deficiency indices).
Counterexample
Given: The minimal operator on .
By A symmetric closed operator that is not self-adjoint, is densely defined, closed, symmetric and not self-adjoint, and with .
and : the equations and read and .
Hence and ; by the von Neumann parameterization the self-adjoint extensions of correspond bijectively to the unitaries , that is, to the numbers with and .
Domains: by the parameterization, . For the element is with , so its endpoint values are at and at ; hence consists exactly of the absolutely continuous with and , where .
In particular there are infinitely many self-adjoint extensions, so is not self-adjoint; the case of equal to a suitable value reproduces the periodic operator of Periodic derivative and its unitary translation group.
The map is a bijection from onto the unit circle: for one computes , and for the formula inverts it and satisfies .
Therefore the self-adjoint extensions of are exactly the operators of the statement, one for each on the unit circle; itself is not among them because it is not self-adjoint.
Depends on
- A symmetric closed operator that is not self-adjoint
- Deficiency subspaces and deficiency indices
- Von Neumann parameterization of self-adjoint extensions
- Existence of self-adjoint extensions is equality of deficiency indices
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Spectral theorem for unbounded self-adjoint operators (PVM form)
- Absolute continuity on a compact interval
- Periodic derivative and its unitary translation group
Used by
Dependency tree · two levels
64 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)