Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2.26 — self-adjoint extensions exist iff the defect indices are equal

Proved
TeschlQM.SelfAdjoint.selfAdjoint_extension_iff

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

defect-indicesextensionsfunctional-analysisp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1self-adjoint-operators

Let AAA be a symmetric operator on a complex Hilbert space H\mathfrak{H}H, with defect spaces K±=Ran⁡(A±i)⊥K_\pm = \operatorname{Ran}(A \pm \mathrm{i})^\perpK±​=Ran(A±i)⊥ and defect indices d±(A)=dim⁡K±d_\pm(A) = \dim K_\pmd±​(A)=dimK±​. Then AAA has a self-adjoint extension, that is a self-adjoint BBB with D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B) and B=AB = AB=A on D(A)\mathfrak{D}(A)D(A), if and only if

d+(A)=d−(A).d_+(A) = d_-(A).d+​(A)=d−​(A).

This is von Neumann's criterion. It decides whether a formal quantum-mechanical Hamiltonian given on a convenient domain can be turned into a genuine observable at all, and it is the starting point for classifying all such realizations.

Formalization Note. Operators are LinearPMaps; extension is A ≤ B; self-adjointness is Mathlib's IsSelfAdjoint. Symmetric includes a dense domain, so A∗A^*A∗ is the book's adjoint. K±K_\pmK±​ are defined as Ran⁡(A±i)⊥\operatorname{Ran}(A \pm \mathrm{i})^\perpRan(A±i)⊥, not as kernels of A∓iA \mp \mathrm{i}A∓i (which are trivial for symmetric AAA). Equality of the Hilbert dimensions d±d_\pmd±​ is expressed as the existence of a unitary (surjective linear isometry) K+→K−K_+ \to K_-K+​→K−​. No separability of H\mathfrak{H}H is assumed; the statement holds for every complex Hilbert space.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_Shared_IsSymmetric
import Definitions.Def_TeschlQM_SelfAdjoint_defectSpace
Formal statement
namespace TeschlQM.SelfAdjoint

/-- Teschl, Theorem 2.26, first sentence (p. 82): a symmetric operator has self-adjoint extensions
if and only if its defect indices are equal. An extension `B ⊇ A` is `A ≤ B` (`𝔇(A) ⊆ 𝔇(B)`
and `B = A` on `𝔇(A)`); equality of `d₊ = dim Ran(A + i)^⊥` and `d₋ = dim Ran(A - i)^⊥` is the
existence of a unitary between the two defect spaces. -/
theorem selfAdjoint_extension_iff {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    (A : H →ₗ.[ℂ] H) (hA : TeschlQM.Shared.IsSymmetric A) :
    (∃ B : H →ₗ.[ℂ] H, A ≤ B ∧ IsSelfAdjoint B) ↔ HasEqualDefectIndices A := by sorry

end TeschlQM.SelfAdjoint
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 82, Theorem 2.26
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let HHH be a complex Hilbert space: a complex inner product space (H,⟨⋅,⋅⟩)(H, \langle\cdot,\cdot\rangle)(H,⟨⋅,⋅⟩) that is complete in its norm. No separability is assumed, and HHH may be the zero space. Let AAA be a partially defined linear operator on HHH. That is, AAA has a domain D(A)\mathfrak{D}(A)D(A), which is some complex linear subspace of HHH, and AAA is a C\mathbb{C}C-linear map D(A)→H\mathfrak{D}(A) \to HD(A)→H. Nothing in the statement requires D(A)\mathfrak{D}(A)D(A) to be dense or closed, or requires AAA to be closed or bounded. Assume the hypothesis

IsSymmetric(A),\mathrm{IsSymmetric}(A),IsSymmetric(A),

where IsSymmetric\mathrm{IsSymmetric}IsSymmetric is a predicate defined elsewhere in this bundle (TeschlQM.Shared.IsSymmetric). Its definition is not shown in the code I was given, so I cannot unfold it here. Whether it includes density of D(A)\mathfrak{D}(A)D(A) or the symmetry condition ⟨Ax,y⟩=⟨x,Ay⟩\langle Ax, y\rangle = \langle x, Ay\rangle⟨Ax,y⟩=⟨x,Ay⟩ for x,y∈D(A)x, y \in \mathfrak{D}(A)x,y∈D(A) has to be checked in that definition.

The statement asserts the following equivalence:

(∃ B: A≤B  and  B∗=B)  ⟺  HasEqualDefectIndices(A).\Big(\exists\, B:\ A \le B \ \text{ and } \ B^* = B\Big) \iff \mathrm{HasEqualDefectIndices}(A).(∃B: A≤B  and  B∗=B)⟺HasEqualDefectIndices(A).
  • BBB: BBB ranges over all partially defined C\mathbb{C}C-linear operators on HHH.
  • A≤BA \le BA≤B: BBB extends AAA. This means D(A)⊆D(B)\mathfrak{D}(A) \subseteq \mathfrak{D}(B)D(A)⊆D(B) and Bx=AxBx = AxBx=Ax for every x∈D(A)x \in \mathfrak{D}(A)x∈D(A).
  • B∗=BB^* = BB∗=B: BBB is self-adjoint in the sense of the library's adjoint of partially defined operators. BBB must equal its adjoint B∗B^*B∗, with the same domain and the same values.
    • The domain of B∗B^*B∗ is the set of y∈Hy \in Hy∈H for which x↦⟨y,Bx⟩x \mapsto \langle y, Bx\ranglex↦⟨y,Bx⟩ is continuous on D(B)\mathfrak{D}(B)D(B).
    • When D(B)\mathfrak{D}(B)D(B) is dense, B∗yB^*yB∗y is the usual adjoint vector.
    • When D(B)\mathfrak{D}(B)D(B) is not dense, the library defines B∗B^*B∗ as the zero map on that domain.
    • For H≠{0}H \ne \{0\}H={0}, the library shows that a self-adjoint operator in this sense has a dense domain.
  • HasEqualDefectIndices(A)\mathrm{HasEqualDefectIndices}(A)HasEqualDefectIndices(A): another predicate defined elsewhere in this bundle. Judging by its imports, it is presumably built on the bundle's defectSpace definition, but its definition is not shown in the code I was given. The Lean comment above the theorem says it expresses "equality of d+=dim⁡Ran⁡(A+i)⊥d_+ = \dim \operatorname{Ran}(A+i)^\perpd+​=dimRan(A+i)⊥ and d−=dim⁡Ran⁡(A−i)⊥d_- = \dim \operatorname{Ran}(A-i)^\perpd−​=dimRan(A−i)⊥ … as the existence of a unitary between the two defect spaces." That is a comment, not code, and I cannot confirm from the code alone that the predicate says this.

The equivalence runs both ways. If some self-adjoint extension of AAA exists, then AAA has equal defect indices. Conversely, if AAA has equal defect indices, a self-adjoint extension exists. The extension BBB may be AAA itself, and nothing is said about how many such extensions there are.

Degenerate cases.

  • H={0}H = \{0\}H={0}: there is exactly one partially defined operator, with domain {0}\{0\}{0} and value 000. It equals its own adjoint, so the left-hand side holds with B=AB = AB=A. The statement then asserts that HasEqualDefectIndices(A)\mathrm{HasEqualDefectIndices}(A)HasEqualDefectIndices(A) holds as well. Whether that is true depends on the unseen definition; for example, a unitary between two zero spaces exists trivially.
  • Non-dense domain: if IsSymmetric\mathrm{IsSymmetric}IsSymmetric does not require D(A)\mathfrak{D}(A)D(A) to be dense, the hypothesis allows non-densely defined AAA. For such AAA, the library's convention (the adjoint is zero on non-dense domains) affects which operators BBB count as self-adjoint only through BBB itself. When H≠{0}H \ne \{0\}H={0}, any qualifying BBB must be densely defined.
  • Unsatisfiable or trivially true predicates: if either IsSymmetric\mathrm{IsSymmetric}IsSymmetric or HasEqualDefectIndices\mathrm{HasEqualDefectIndices}HasEqualDefectIndices is defined so that it can never hold, or always holds, the equivalence inherits that. I cannot tell which from the code shown.
  • No finiteness condition: no dimension or cardinality assumption is placed on the defect spaces. The statement covers infinite defect indices on the same footing as finite ones.
Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 2, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me