Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.4 — Kato–Rellich (essentially self-adjoint case)

Proved
TeschlQM.KatoRellich.kato_rellich_essentiallySelfAdjoint

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

functional-analysiskato-rellichp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1perturbation-theoryself-adjoint-operators

Let AAA be an essentially self-adjoint operator and BBB a symmetric operator in a complex Hilbert space H\mathfrak{H}H, and suppose the AAA-bound of BBB is less than one. Then A+BA + BA+B, with domain D(A+B)=D(A)\mathfrak{D}(A + B) = \mathfrak{D}(A)D(A+B)=D(A), is essentially self-adjoint, and

D(A‾)⊆D(B‾),A+B‾=A‾+B‾.\mathfrak{D}(\overline{A}) \subseteq \mathfrak{D}(\overline{B}), \qquad \overline{A + B} = \overline{A} + \overline{B}.D(A)⊆D(B),A+B​=A+B.

If moreover AAA is bounded from below by γ\gammaγ, and a∈[0,1)a \in [0,1)a∈[0,1), b≥0b \ge 0b≥0 are constants for which (6.1) holds, then A+BA + BA+B is bounded from below by γ−max⁡(a∣γ∣+b,b/(1−a))\gamma - \max(a|\gamma| + b, b/(1 - a))γ−max(a∣γ∣+b,b/(1−a)).

This is the form of the theorem used when AAA is known only on a core, e.g. −Δ-\Delta−Δ on smooth compactly supported functions.

Formalization Note. Closures are Mathlib's LinearPMap.closure. The lower bound corrects the book's printed b/(a−1)b/(a-1)b/(a−1) to b/(1−a)b/(1-a)b/(1−a); see the goal theorem kato_rellich for the counterexample.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_Shared_IsSymmetric
import Definitions.Def_TeschlQM_Shared_IsEssentiallySelfAdjoint
import Definitions.Def_TeschlQM_KatoRellich_IsRelativelyBounded
import Definitions.Def_TeschlQM_Shared_IsBoundedBelowBy
Formal statement
namespace TeschlQM.KatoRellich

open scoped ENNReal

/-- Teschl, Theorem 6.4 (Kato–Rellich), p. 135, essentially self-adjoint case. If `A` is essentially
self-adjoint and `B` is symmetric with `A`-bound less than one, then `A + B` with
`𝔇(A + B) = 𝔇(A)` is essentially self-adjoint, `𝔇(Ā) ⊆ 𝔇(B̄)` and `\overline{A + B} = Ā + B̄`.
If moreover `A ≥ γ` and (6.1) holds with constants `a < 1`, `b`, then
`A + B ≥ γ - max(a|γ| + b, b/(1 - a))` (the book's `b/(a - 1)` corrected, as in `kato_rellich`). -/
theorem kato_rellich_essentiallySelfAdjoint {H : Type*} [NormedAddCommGroup H]
    [InnerProductSpace ℂ H] [CompleteSpace H]
    (A B : H →ₗ.[ℂ] H) (hA : TeschlQM.Shared.IsEssentiallySelfAdjoint A) (hB : TeschlQM.Shared.IsSymmetric B)
    (hbound : relativeBound A B < 1) :
    (A + B).domain = A.domain ∧ TeschlQM.Shared.IsEssentiallySelfAdjoint (A + B) ∧
      A.closure.domain ≤ B.closure.domain ∧ (A + B).closure = A.closure + B.closure ∧
      ∀ γ a b : ℝ, a < 1 → IsRelativelyBoundedWith A B a b → TeschlQM.Shared.IsBoundedBelowBy A γ →
        TeschlQM.Shared.IsBoundedBelowBy (A + B) (γ - max (a * |γ| + b) (b / (1 - a))) := by sorry

end TeschlQM.KatoRellich
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 135, Theorem 6.4, Eq. (6.3)
Read-back

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

Setting. HHH is a complex Hilbert space. AAA and BBB are partially defined C\mathbb CC-linear operators on HHH.

Definitions used.

  • Sum. A+BA + BA+B has domain D(A)∩D(B)\mathcal D(A) \cap \mathcal D(B)D(A)∩D(B) and acts by ψ↦Aψ+Bψ\psi \mapsto A\psi + B\psiψ↦Aψ+Bψ. The sum Aˉ+Bˉ\bar A + \bar BAˉ+Bˉ is formed the same way.
  • Closure. Aˉ\bar AAˉ is Mathlib's closure: the operator whose graph is the closure of the graph of AAA if AAA is closable, and AAA itself otherwise. The same applies to Bˉ\bar BBˉ and to A+B‾\overline{A+B}A+B​.
  • Essentially self-adjoint, symmetric, bounded below by γ\gammaγ are the predicates TeschlQM.Shared.IsEssentiallySelfAdjoint, TeschlQM.Shared.IsSymmetric and TeschlQM.Shared.IsBoundedBelowBy. They are defined in separate modules whose text is not shown here.
  • AAA-bounded with constants a,ba, ba,b means all of: D(A)⊆D(B)\mathcal D(A) \subseteq \mathcal D(B)D(A)⊆D(B); a≥0a \ge 0a≥0; b≥0b \ge 0b≥0; and ∥Bψ∥≤a∥Aψ∥+b∥ψ∥\|B\psi\| \le a\|A\psi\| + b\|\psi\|∥Bψ∥≤a∥Aψ∥+b∥ψ∥ for all ψ∈D(A)\psi \in \mathcal D(A)ψ∈D(A).
  • AAA-bound. rb⁡A(B)∈[0,∞]\operatorname{rb}_A(B) \in [0,\infty]rbA​(B)∈[0,∞] is the infimum of all aaa for which some bbb makes BBB AAA-bounded with constants a,ba, ba,b, with ∞\infty∞ if there is none.

Hypotheses.

  • AAA is essentially self-adjoint.
  • BBB is symmetric.
  • rb⁡A(B)<1\operatorname{rb}_A(B) < 1rbA​(B)<1. This implies that BBB is AAA-bounded, so in particular D(A)⊆D(B)\mathcal D(A) \subseteq \mathcal D(B)D(A)⊆D(B).

Conclusion. All five of the following hold:

  1. D(A+B)=D(A)\mathcal D(A + B) = \mathcal D(A)D(A+B)=D(A).
  2. A+BA + BA+B is essentially self-adjoint.
  3. D(Aˉ)⊆D(Bˉ)\mathcal D(\bar A) \subseteq \mathcal D(\bar B)D(Aˉ)⊆D(Bˉ).
  4. A+B‾=Aˉ+Bˉ\overline{A + B} = \bar A + \bar BA+B​=Aˉ+Bˉ, as partially defined operators with the same domain and the same values.
  5. For all real numbers γ,a,b\gamma, a, bγ,a,b: if a<1a < 1a<1, BBB is AAA-bounded with constants a,ba, ba,b, and AAA is bounded below by γ\gammaγ, then A+BA + BA+B is bounded below by
γ−max⁡(a∣γ∣+b, b1−a).\gamma - \max\Bigl(a|\gamma| + b,\ \frac{b}{1 - a}\Bigr).γ−max(a∣γ∣+b, 1−ab​).

Degenerate cases.

  • In part 5, a<1a < 1a<1 makes 1−a>01 - a > 01−a>0, so the division is genuine. The constants satisfy a,b≥0a, b \ge 0a,b≥0.
  • If no γ\gammaγ satisfies the lower-bound predicate for AAA, part 5 is vacuous.
  • If H={0}H = \{0\}H={0}, every operator is zero, rb⁡A(B)=0\operatorname{rb}_A(B) = 0rbA​(B)=0, and parts 1, 3 and 4 hold trivially.
  • The meaning of parts 2 and 5 depends entirely on the unseen predicates.
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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me