Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2.26, (2.103)–(2.104) — domain and action of a self-adjoint extension

Proved
TeschlQM.SelfAdjoint.selfAdjoint_extension_domain

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

cayley-transformextensionsfunctional-analysisp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1self-adjoint-operators

Let AAA be a closed symmetric operator on a complex Hilbert space, let A1A_1A1​ be a self-adjoint extension of AAA and let V1V_1V1​ be the Cayley transform of A1A_1A1​. With K+=Ran⁡(A+i)⊥K_+ = \operatorname{Ran}(A + \mathrm{i})^\perpK+​=Ran(A+i)⊥,

D(A1)=D(A)+(1−V1)K+={ψ+φ+−V1φ+∣ψ∈D(A), φ+∈K+}\mathfrak{D}(A_1) = \mathfrak{D}(A) + (1 - V_1)K_+ = \{\psi + \varphi_+ - V_1\varphi_+ \mid \psi \in \mathfrak{D}(A),\ \varphi_+ \in K_+\}D(A1​)=D(A)+(1−V1​)K+​={ψ+φ+​−V1​φ+​∣ψ∈D(A), φ+​∈K+​}

and

A1(ψ+φ+−V1φ+)=Aψ+iφ++iV1φ+.A_1(\psi + \varphi_+ - V_1\varphi_+) = A\psi + \mathrm{i}\varphi_+ + \mathrm{i}V_1\varphi_+.A1​(ψ+φ+​−V1​φ+​)=Aψ+iφ+​+iV1​φ+​.

Formalization Note. The hypothesis that AAA is closed is added. The book states (2.103) for every symmetric AAA, but for a non-closed one it fails: if AAA is essentially self-adjoint and not closed, then K+={0}K_+ = \{0\}K+​={0} and D(A1)=D(A‾)≠D(A)\mathfrak{D}(A_1) = \mathfrak{D}(\overline{A}) \ne \mathfrak{D}(A)D(A1​)=D(A)=D(A). The book's proof uses H=Ran⁡(A+i)⊕K+\mathfrak{H} = \operatorname{Ran}(A+\mathrm{i}) \oplus K_+H=Ran(A+i)⊕K+​, which holds exactly when Ran⁡(A+i)\operatorname{Ran}(A + \mathrm{i})Ran(A+i) is closed (Lemma 2.27). Since A1A_1A1​ is self-adjoint, D(V1)=H\mathfrak{D}(V_1) = \mathfrak{H}D(V1​)=H, so letting φ+\varphi_+φ+​ range over D(V1)∩K+\mathfrak{D}(V_1) \cap K_+D(V1​)∩K+​ is the same as letting it range over K+K_+K+​.

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

/-- Teschl, Theorem 2.26, (2.103)–(2.104) (p. 82): let `A₁` be a self-adjoint extension of the
symmetric operator `A` and `V₁` its Cayley transform. Then
`𝔇(A₁) = {ψ + φ₊ - V₁φ₊ | ψ ∈ 𝔇(A), φ₊ ∈ K₊}` and `A₁(ψ + φ₊ - V₁φ₊) = Aψ + iφ₊ + iV₁φ₊`.
The hypothesis that `A` is closed is added: without it (2.103) fails (for an essentially
self-adjoint, non-closed `A`, `K₊ = {0}` and `𝔇(A₁) = 𝔇(Ā) ≠ 𝔇(A)`). `𝔇(V₁) = ℌ` since `A₁` is
self-adjoint, so quantifying `φ₊` over `𝔇(V₁) ∩ K₊` is quantifying over `K₊`. -/
theorem selfAdjoint_extension_domain {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    (A A₁ V₁ : H →ₗ.[ℂ] H) (hA : TeschlQM.Shared.IsSymmetric A) (hAc : A.IsClosed)
    (hA₁ : IsSelfAdjoint A₁) (hAA₁ : A ≤ A₁) (hV₁ : IsCayleyTransform A₁ V₁) :
    (A₁.domain : Set H) =
        {x : H | ∃ ψ : A.domain, ∃ φ : V₁.domain, (φ : H) ∈ defectPlus A ∧
          x = (ψ : H) + (φ : H) - V₁ φ} ∧
      ∀ (ψ : A.domain) (φ : V₁.domain), (φ : H) ∈ defectPlus A →
        ∀ h : (ψ : H) + (φ : H) - V₁ φ ∈ A₁.domain,
          A₁ ⟨(ψ : H) + (φ : H) - V₁ φ, h⟩ = A ψ + Complex.I • (φ : H) + Complex.I • V₁ φ := by sorry

end TeschlQM.SelfAdjoint
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 82, Theorem 2.26, Eqs. (2.103)–(2.104)
Read-back

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

Let HHH be a complex Hilbert space: a complete complex inner product space. Let AAA, A1A_1A1​ and V1V_1V1​ be partial C\mathbb CC-linear operators on HHH, with domains D(A)\mathcal D(A)D(A), D(A1)\mathcal D(A_1)D(A1​) and D(V1)\mathcal D(V_1)D(V1​). Assume:

  1. IsSymmetric(A)\mathrm{IsSymmetric}(A)IsSymmetric(A) holds. This predicate is imported and its code is not shown.
  2. AAA is closed: its graph is closed in H×HH\times HH×H.
  3. A1A_1A1​ is self-adjoint: A1=A1∗A_1=A_1^*A1​=A1∗​, with equal domains and values. A1∗A_1^*A1∗​ is the usual adjoint when D(A1)\mathcal D(A_1)D(A1​) is dense, and the zero operator on all of HHH otherwise.
  4. A≤A1A\le A_1A≤A1​: that is, D(A)⊆D(A1)\mathcal D(A)\subseteq\mathcal D(A_1)D(A)⊆D(A1​) and A1ψ=AψA_1\psi=A\psiA1​ψ=Aψ for ψ∈D(A)\psi\in\mathcal D(A)ψ∈D(A).
  5. IsCayleyTransform(A1,V1)\mathrm{IsCayleyTransform}(A_1,V_1)IsCayleyTransform(A1​,V1​) holds. This predicate is imported and its code is not shown.

Let K+(A)K_+(A)K+​(A) denote the imported subspace defectPlus⁡(A)\operatorname{defectPlus}(A)defectPlus(A), whose code is not shown.

Conclusion. Both of the following hold.

  • Domain formula.
D(A1)={ ψ+φ−V1φ  :  ψ∈D(A), φ∈D(V1), φ∈K+(A) }.\mathcal D(A_1)=\{\,\psi+\varphi-V_1\varphi\;:\;\psi\in\mathcal D(A),\ \varphi\in\mathcal D(V_1),\ \varphi\in K_+(A)\,\}.D(A1​)={ψ+φ−V1​φ:ψ∈D(A), φ∈D(V1​), φ∈K+​(A)}.

The φ\varphiφ range only over D(V1)∩K+(A)\mathcal D(V_1)\cap K_+(A)D(V1​)∩K+​(A).

  • Action formula. For every ψ∈D(A)\psi\in\mathcal D(A)ψ∈D(A) and every φ∈D(V1)∩K+(A)\varphi\in\mathcal D(V_1)\cap K_+(A)φ∈D(V1​)∩K+​(A) such that ψ+φ−V1φ∈D(A1)\psi+\varphi-V_1\varphi\in\mathcal D(A_1)ψ+φ−V1​φ∈D(A1​):
A1(ψ+φ−V1φ)=Aψ+iφ+i V1φ.A_1(\psi+\varphi-V_1\varphi)=A\psi+i\varphi+i\,V_1\varphi.A1​(ψ+φ−V1​φ)=Aψ+iφ+iV1​φ.

Degenerate cases:

  • If H={0}H=\{0\}H={0}, every term is 000 and both formulas hold trivially.
  • If D(V1)∩K+(A)={0}\mathcal D(V_1)\cap K_+(A)=\{0\}D(V1​)∩K+​(A)={0}, the domain formula asserts D(A1)=D(A)\mathcal D(A_1)=\mathcal D(A)D(A1​)=D(A), and the action formula reduces to A1ψ=AψA_1\psi=A\psiA1​ψ=Aψ.
  • If D(A1)\mathcal D(A_1)D(A1​) is not dense, A1A_1A1​ cannot equal A1∗A_1^*A1∗​, so no such A1A_1A1​ exists.
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