Theorem 6.4 — Kato–Rellich (self-adjoint case, with the lower bound (6.3))
ProvedTeschlQM.KatoRellich.kato_rellichLet be a 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 self-adjoint.
If moreover is bounded from below by , and , are constants for which (6.1) holds, then is bounded from below by
This is the basic perturbation theorem for self-adjoint operators: it gives self-adjointness of Schrödinger operators for potentials that are small relative to the kinetic energy.
Formalization Note. The book prints the lower bound (6.3) as . Because , that expression equals , and this is false: in with (), the real symmetric matrix with entries , and , the best is while the lowest eigenvalue of is . The statement uses , which is Kato's constant (Perturbation Theory for Linear Operators, Thm V.4.11). "-bound less than one" is relativeBound A B < 1 in , which includes relative boundedness. The sum is Mathlib's sum of LinearPMaps, defined on ; the first conjunct asserts that this is .
Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.
import Mathlib import Definitions.Def_TeschlQM_Shared_IsSymmetric 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, self-adjoint case with the lower bound (6.3).
If `A` is self-adjoint and `B` is symmetric with `A`-bound less than one, then `A + B` with
`𝔇(A + B) = 𝔇(A)` is self-adjoint. If moreover `A ≥ γ` and (6.1) holds with constants `a < 1`, `b`,
then `A + B ≥ γ - max(a|γ| + b, b/(1 - a))`. The book prints `b/(a - 1)`, which is false
(see the moderation notes); `b/(1 - a)` is the corrected constant (Kato, Thm V.4.11). -/
theorem kato_rellich {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
(A B : H →ₗ.[ℂ] H) (hA : IsSelfAdjoint A) (hB : TeschlQM.Shared.IsSymmetric B)
(hbound : relativeBound A B < 1) :
(A + B).domain = A.domain ∧ IsSelfAdjoint (A + B) ∧
∀ γ 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
Let be a complex Hilbert space: a complex inner-product space that is complete in its norm. may be any such space, including the zero space . Let and be partially defined linear operators on . Each has a domain, which is a complex linear subspace or of , and is a -linear map from that domain into . The statement does not assume that either domain is dense or closed.
The sum is the operator with domain
Hypotheses:
- is self-adjoint: as partially defined operators, so the domains and the values are equal. Here is the library's adjoint of a partially defined operator. Its domain is the set of for which is continuous on . On that domain it acts as the usual adjoint when is dense, and as the zero map when is not dense.
- is symmetric: satisfies the imported predicate
TeschlQM.Shared.IsSymmetric. Its definition is not shown in the code given here, so its exact content cannot be stated from this code. - Relative bound below 1: , where is the imported quantity
relativeBound A B. Its definition and value type are not shown in the code; the extended non-negative reals are brought into scope, so it may take values there.
Conclusion. The statement asserts all three of the following:
-
(i) Domain: , which is the same as saying .
-
(ii) Self-adjointness: is self-adjoint in the same sense as hypothesis 1, that is, .
-
(iii) Lower bound: for every triple of real numbers with
- ,
- and satisfying the imported predicate
IsRelativelyBoundedWith A B a b(whose definition is not shown), and - satisfying the imported predicate
IsBoundedBelowBy A γ(whose definition is not shown),
the operator satisfies
IsBoundedBelowBywith the constant
Nothing in part (iii) requires , or , and may be any real number below . Part (iii) contains no reference to . Its only link to the global hypotheses is that it sits inside the same conclusion.
Degenerate cases:
- Division: because , the denominator is strictly positive, so the division never falls back on a default value.
- Negative constants: if negative or satisfy the relative-boundedness predicate, the maximum can be negative. The asserted lower bound for would then be strictly larger than . Whether such and can occur depends on the predicate's definition, which is not shown.
- Zero space: if , every domain is and the operators are zero. Conclusions (i) and (ii) then hold trivially, and (iii) reduces to whatever the imported predicates say about the zero operator.
- Non-dense domain: if is not dense, hypothesis 1 compares with the library's zero-valued default adjoint.
- Vacuous case: if the imported predicates can never hold together for a given , part (iii) is vacuous for that triple.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.