Theorem 6.4 — Kato–Rellich (essentially self-adjoint case)
ProvedTeschlQM.KatoRellich.kato_rellich_essentiallySelfAdjointLet be an essentially self-adjoint operator and a symmetric operator in a complex Hilbert space , and suppose the -bound of is less than one. Then , with domain , is essentially self-adjoint, and
If moreover is bounded from below by , and , are constants for which (6.1) holds, then is bounded from below by .
This is the form of the theorem used when is known only on a core, e.g. on smooth compactly supported functions.
Formalization Note. Closures are Mathlib's LinearPMap.closure. The lower bound corrects the book's printed to ; see the goal theorem kato_rellich for the counterexample.
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
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. is a complex Hilbert space. and are partially defined -linear operators on .
Definitions used.
- Sum. has domain and acts by . The sum is formed the same way.
- Closure. is Mathlib's closure: the operator whose graph is the closure of the graph of if is closable, and itself otherwise. The same applies to and to .
- Essentially self-adjoint, symmetric, bounded below by are the predicates
TeschlQM.Shared.IsEssentiallySelfAdjoint,TeschlQM.Shared.IsSymmetricandTeschlQM.Shared.IsBoundedBelowBy. They are defined in separate modules whose text is not shown here. - -bounded with constants means all of: ; ; ; and for all .
- -bound. is the infimum of all for which some makes -bounded with constants , with if there is none.
Hypotheses.
- is essentially self-adjoint.
- is symmetric.
- . This implies that is -bounded, so in particular .
Conclusion. All five of the following hold:
- .
- is essentially self-adjoint.
- .
- , as partially defined operators with the same domain and the same values.
- For all real numbers : if , is -bounded with constants , and is bounded below by , then is bounded below by
Degenerate cases.
- In part 5, makes , so the division is genuine. The constants satisfy .
- If no satisfies the lower-bound predicate for , part 5 is vacuous.
- If , every operator is zero, , and parts 1, 3 and 4 hold trivially.
- The meaning of parts 2 and 5 depends entirely on the unseen predicates.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.