Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 2.7 — criterion for essential self-adjointness

Proved
TeschlQM.SelfAdjoint.essentiallySelfAdjoint_iff

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

essential-self-adjointnessfunctional-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. Then AAA is essentially self-adjoint if and only if one of the following conditions holds for one z∈C∖Rz \in \mathbb{C}\setminus\mathbb{R}z∈C∖R:

Ran⁡(A+z)‾=Ran⁡(A+z∗)‾=H,orKer⁡(A∗+z)=Ker⁡(A∗+z∗)={0}.\overline{\operatorname{Ran}(A + z)} = \overline{\operatorname{Ran}(A + z^*)} = \mathfrak{H}, \qquad\text{or}\qquad \operatorname{Ker}(A^* + z) = \operatorname{Ker}(A^* + z^*) = \{0\}.Ran(A+z)​=Ran(A+z∗)​=H,orKer(A∗+z)=Ker(A∗+z∗)={0}.

If AAA is nonnegative, that is ⟨ψ,Aψ⟩≥0\langle \psi, A\psi\rangle \ge 0⟨ψ,Aψ⟩≥0 for all ψ∈D(A)\psi \in \mathfrak{D}(A)ψ∈D(A), then real zzz may also be admitted, namely z>0z > 0z>0 (so that the spectral parameter −z-z−z of A+z=A−(−z)A + z = A - (-z)A+z=A−(−z) lies in (−∞,0)(-\infty, 0)(−∞,0)).

Formalization Note. Each of the two conditions is stated separately as equivalent to essential self-adjointness, each with an existential "for one zzz". The closure of the range is Submodule.topologicalClosure; A∗A^*A∗ is Mathlib's LinearPMap.adjoint, which is the book's adjoint because symmetric operators are densely defined. Nonnegativity is Re⁡⟨ψ,Aψ⟩≥0\operatorname{Re}\langle\psi, A\psi\rangle \ge 0Re⟨ψ,Aψ⟩≥0 (the form is real for symmetric AAA), and the admitted zzz are then those with Im⁡z≠0\operatorname{Im} z \ne 0Imz=0 or with zzz real and positive. The book writes "z∈(−∞,0)z \in (-\infty, 0)z∈(−∞,0)" with the conditions on A+zA + zA+z; read literally that is false (A=−d2/dx2A = -d^2/dx^2A=−d2/dx2 on Cc∞(0,∞)C_c^\infty(0,\infty)Cc∞​(0,∞) is nonnegative and not essentially self-adjoint, while Ker⁡(A∗−1)={0}\operatorname{Ker}(A^* - 1) = \{0\}Ker(A∗−1)={0}). The book's proof uses A+εA + \varepsilonA+ε with ε>0\varepsilon > 0ε>0, which is the version stated here.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_Shared_IsSymmetric
import Definitions.Def_TeschlQM_SelfAdjoint_addScalar
import Definitions.Def_TeschlQM_Shared_IsEssentiallySelfAdjoint
Formal statement
namespace TeschlQM.SelfAdjoint

open ComplexConjugate
open scoped InnerProductSpace

/-- Teschl, Lemma 2.7 (p. 66): a symmetric `A` is essentially self-adjoint iff, for one
`z ∈ ℂ \ ℝ`, `closure(Ran(A + z)) = closure(Ran(A + z*)) = ℌ`, iff, for one `z ∈ ℂ \ ℝ`,
`Ker(A* + z) = Ker(A* + z*) = {0}`. If `A` is nonnegative (`⟨ψ, Aψ⟩ ≥ 0` on `𝔇(A)`), real `z`
may also be admitted. The book writes `z ∈ (-∞, 0)`, but its conditions are on `A + z` and its proof
uses `A + ε` with `ε > 0`; read literally the clause is false (`-d²/dx²` on `C_c^∞(0, ∞)` is
nonnegative, not essentially self-adjoint, and `Ker(A* - 1) = {0}`), so the admitted real `z` are
`z ∈ (0, ∞)` in the `A + z` convention, i.e. the spectral point `-z ∈ (-∞, 0)`. -/
theorem essentiallySelfAdjoint_iff {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
    (A : H →ₗ.[ℂ] H) (hA : TeschlQM.Shared.IsSymmetric A) :
    (TeschlQM.Shared.IsEssentiallySelfAdjoint A ↔
      ∃ z : ℂ, z.im ≠ 0 ∧ (rangeAdd A z).topologicalClosure = ⊤ ∧
        (rangeAdd A (conj z)).topologicalClosure = ⊤) ∧
    (TeschlQM.Shared.IsEssentiallySelfAdjoint A ↔
      ∃ z : ℂ, z.im ≠ 0 ∧ kerAdd A.adjoint z = ⊥ ∧ kerAdd A.adjoint (conj z) = ⊥) ∧
    ((∀ ψ : A.domain, 0 ≤ (⟪(ψ : H), A ψ⟫_ℂ).re) →
      (TeschlQM.Shared.IsEssentiallySelfAdjoint A ↔
        ∃ z : ℂ, (z.im ≠ 0 ∨ (z.im = 0 ∧ 0 < z.re)) ∧ (rangeAdd A z).topologicalClosure = ⊤ ∧
          (rangeAdd A (conj z)).topologicalClosure = ⊤) ∧
      (TeschlQM.Shared.IsEssentiallySelfAdjoint A ↔
        ∃ z : ℂ, (z.im ≠ 0 ∨ (z.im = 0 ∧ 0 < z.re)) ∧ kerAdd A.adjoint z = ⊥ ∧
          kerAdd A.adjoint (conj z) = ⊥)) := by sorry

end TeschlQM.SelfAdjoint
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 66, Lemma 2.7
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. ⟨x,y⟩\langle x,y\rangle⟨x,y⟩ is conjugate-linear in xxx. Let AAA be a partial C\mathbb CC-linear operator on HHH with domain D(A)\mathcal D(A)D(A), and assume IsSymmetric(A)\mathrm{IsSymmetric}(A)IsSymmetric(A).

The statement uses the following notation:

  • ESA(A)\mathrm{ESA}(A)ESA(A) denotes the imported predicate IsEssentiallySelfAdjoint.
  • rangeAdd⁡(⋅,⋅)\operatorname{rangeAdd}(\cdot,\cdot)rangeAdd(⋅,⋅) and kerAdd⁡(⋅,⋅)\operatorname{kerAdd}(\cdot,\cdot)kerAdd(⋅,⋅) are imported subspace-valued definitions.
  • The predicates IsSymmetric\mathrm{IsSymmetric}IsSymmetric and ESA\mathrm{ESA}ESA, like these two subspaces, have code that is not shown here.
  • A∗A^*A∗ is the adjoint. When D(A)\mathcal D(A)D(A) is dense, it is the usual adjoint: y∈D(A∗)y\in\mathcal D(A^*)y∈D(A∗) iff ψ↦⟨y,Aψ⟩\psi\mapsto\langle y,A\psi\rangleψ↦⟨y,Aψ⟩ is continuous on D(A)\mathcal D(A)D(A), and then ⟨A∗y,ψ⟩=⟨y,Aψ⟩\langle A^*y,\psi\rangle=\langle y,A\psi\rangle⟨A∗y,ψ⟩=⟨y,Aψ⟩. When D(A)\mathcal D(A)D(A) is not dense, A∗A^*A∗ is the zero operator on all of HHH.
  • S‾\overline{S}S denotes the topological closure of a subspace SSS.

The statement is a conjunction of three parts.

  1. ESA(A)\mathrm{ESA}(A)ESA(A) holds if and only if there exists z∈Cz\in\mathbb Cz∈C with Im⁡z≠0\operatorname{Im}z\neq0Imz=0 such that
rangeAdd⁡(A,z)‾=HandrangeAdd⁡(A,zˉ)‾=H.\overline{\operatorname{rangeAdd}(A,z)}=H\quad\text{and}\quad\overline{\operatorname{rangeAdd}(A,\bar z)}=H.rangeAdd(A,z)​=HandrangeAdd(A,zˉ)​=H.
  1. ESA(A)\mathrm{ESA}(A)ESA(A) holds if and only if there exists z∈Cz\in\mathbb Cz∈C with Im⁡z≠0\operatorname{Im}z\neq0Imz=0 such that
kerAdd⁡(A∗,z)={0}andkerAdd⁡(A∗,zˉ)={0}.\operatorname{kerAdd}(A^*,z)=\{0\}\quad\text{and}\quad\operatorname{kerAdd}(A^*,\bar z)=\{0\}.kerAdd(A∗,z)={0}andkerAdd(A∗,zˉ)={0}.
  1. Suppose Re⁡⟨ψ,Aψ⟩≥0\operatorname{Re}\langle\psi,A\psi\rangle\ge0Re⟨ψ,Aψ⟩≥0 for every ψ∈D(A)\psi\in\mathcal D(A)ψ∈D(A). Only the real part is constrained. Then both of the following hold:

    • ESA(A)\mathrm{ESA}(A)ESA(A) holds if and only if there exists zzz with Im⁡z≠0\operatorname{Im}z\neq0Imz=0, or with Im⁡z=0\operatorname{Im}z=0Imz=0 and Re⁡z>0\operatorname{Re}z>0Rez>0, such that rangeAdd⁡(A,z)‾=rangeAdd⁡(A,zˉ)‾=H\overline{\operatorname{rangeAdd}(A,z)}=\overline{\operatorname{rangeAdd}(A,\bar z)}=HrangeAdd(A,z)​=rangeAdd(A,zˉ)​=H;
    • ESA(A)\mathrm{ESA}(A)ESA(A) holds if and only if there exists zzz satisfying the same condition on zzz, such that kerAdd⁡(A∗,z)=kerAdd⁡(A∗,zˉ)={0}\operatorname{kerAdd}(A^*,z)=\operatorname{kerAdd}(A^*,\bar z)=\{0\}kerAdd(A∗,z)=kerAdd(A∗,zˉ)={0}.

    The admitted real values of zzz are exactly the strictly positive reals. z=0z=0z=0 and negative reals are excluded.

In each part, the right-hand side is existential: a single suitable zzz is enough.

Degenerate cases:

  • For real z>0z>0z>0 in part 3, zˉ=z\bar z=zzˉ=z, so each pair of conditions collapses to one condition.
  • If H={0}H=\{0\}H={0}, every closure equals HHH and every kernel is {0}\{0\}{0} whatever the imported definitions give. So every right-hand side holds, and the statement asserts ESA(A)\mathrm{ESA}(A)ESA(A).
  • If D(A)\mathcal D(A)D(A) is not dense, then A∗A^*A∗ is the zero operator on HHH. The kernel conditions then concern kerAdd⁡\operatorname{kerAdd}kerAdd of that zero operator.
  • Whether the nonnegativity hypothesis or IsSymmetric can be satisfied in a given case depends on the unseen imported definitions.
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