Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 6.3 — the A-bound as a limit of resolvent norms

Proved
TeschlQM.KatoRellich.relativeBound_eq_limit

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

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

Let AAA be a self-adjoint operator and BBB an AAA bounded operator in a complex Hilbert space H\mathfrak{H}H. Then the AAA-bound of BBB is

lim⁡λ→∞∥BRA(±iλ)∥,(6.2)\lim_{\lambda \to \infty} \|BR_A(\pm i\lambda)\|, \tag{6.2}λ→∞lim​∥BRA​(±iλ)∥,(6.2)

for each choice of sign. If AAA is bounded from below (by some γ∈R\gamma \in \mathbb{R}γ∈R), then also A-bound of B=lim⁡λ→∞∥BRA(−λ)∥.\text{$A$-bound of } B = \lim_{\lambda \to \infty} \|BR_A(-\lambda)\|.A-bound of B=limλ→∞​∥BRA​(−λ)∥.

This formula is what gives ∥BRA(±iλ)∥<1\|BR_A(\pm i\lambda)\| < 1∥BRA​(±iλ)∥<1 for large λ\lambdaλ when the AAA-bound is less than one.

Formalization Note. The limits are taken in [0,∞][0,\infty][0,∞] along λ→+∞\lambda \to +\inftyλ→+∞ in R\mathbb{R}R; only eventual values matter, and for λ>0\lambda > 0λ>0 (resp. λ\lambdaλ large) the points ±iλ\pm i\lambda±iλ (resp. −λ-\lambda−λ) lie in ρ(A)\rho(A)ρ(A).

Preamble
import Mathlib
import Definitions.Def_TeschlQM_KatoRellich_IsRelativelyBounded
import Definitions.Def_TeschlQM_Shared_IsBoundedBelowBy
import Definitions.Def_TeschlQM_KatoRellich_resolvent
import Definitions.Def_TeschlQM_KatoRellich_compCLM
import Definitions.Def_TeschlQM_KatoRellich_opNorm
Formal statement
namespace TeschlQM.KatoRellich

open scoped ENNReal
open Filter Topology Complex

/-- Teschl, Lemma 6.3 and (6.2), p. 134. If `A` is self-adjoint and `B` is `A` bounded, the
`A`-bound of `B` is `lim_{λ→∞} ‖BR_A(±iλ)‖` (both signs). If `A` is bounded from below, `±iλ`
may be replaced by `-λ`. -/
theorem relativeBound_eq_limit {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
    [CompleteSpace H] (A B : H →ₗ.[ℂ] H) (hA : IsSelfAdjoint A) (hB : IsRelativelyBounded A B) :
    Tendsto (fun t : ℝ => opNorm (compCLM B (resolvent A ((t : ℂ) * I)))) atTop
        (𝓝 (relativeBound A B)) ∧
      Tendsto (fun t : ℝ => opNorm (compCLM B (resolvent A (-((t : ℂ) * I))))) atTop
        (𝓝 (relativeBound A B)) ∧
      ∀ γ : ℝ, TeschlQM.Shared.IsBoundedBelowBy A γ →
        Tendsto (fun t : ℝ => opNorm (compCLM B (resolvent A (-(t : ℂ))))) atTop
          (𝓝 (relativeBound A B)) := by sorry

end TeschlQM.KatoRellich
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 134, Lemma 6.3, Eq. (6.2)
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. The variable ttt ranges over the reals and tends to +∞+\infty+∞.

Definitions used.

  • Self-adjoint is Mathlib's notion for partially defined operators: AAA equals its adjoint A∗A^*A∗, with the same domain and the same values. Mathlib's adjoint is the usual Hilbert-space adjoint when D(A)\mathcal D(A)D(A) is dense, and takes a conventional value otherwise.
  • AAA-bounded. BBB is AAA-bounded if there exist real a,b≥0a, b \ge 0a,b≥0 with D(A)⊆D(B)\mathcal D(A) \subseteq \mathcal D(B)D(A)⊆D(B) and ∥Bψ∥≤a∥Aψ∥+b∥ψ∥\|B\psi\| \le a\|A\psi\| + b\|\psi\|∥Bψ∥≤a∥Aψ∥+b∥ψ∥ on D(A)\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 those aaa.
  • Resolvent. RA(w)R_A(w)RA​(w) is the unique bounded, everywhere-defined two-sided inverse of A−w:D(A)→HA - w : \mathcal D(A) \to HA−w:D(A)→H when one exists, that is, when w∈ρ(A)w \in \rho(A)w∈ρ(A). Otherwise it is the zero operator.
  • The product BRA(w)BR_A(w)BRA​(w) has domain {φ:RA(w)φ∈D(B)}\{\varphi : R_A(w)\varphi \in \mathcal D(B)\}{φ:RA​(w)φ∈D(B)} and acts by φ↦B(RA(w)φ)\varphi \mapsto B(R_A(w)\varphi)φ↦B(RA​(w)φ).
  • Operator norm. ∥T∥=sup⁡φ∈D(T)∥Tφ∥/∥φ∥∈[0,∞]\|T\| = \sup_{\varphi \in \mathcal D(T)} \|T\varphi\|/\|\varphi\| \in [0,\infty]∥T∥=supφ∈D(T)​∥Tφ∥/∥φ∥∈[0,∞], with the term at φ=0\varphi = 0φ=0 equal to 000.
  • "AAA is bounded below by γ\gammaγ" is the predicate TeschlQM.Shared.IsBoundedBelowBy A γ. It is defined in a separate module whose text is not shown here.

Hypotheses.

  • AAA is self-adjoint.
  • BBB is AAA-bounded.

Conclusion. All three limits below hold in the topology of [0,∞][0,\infty][0,∞]: 1.

lim⁡t→+∞∥BRA(it)∥=rb⁡A(B)\lim_{t \to +\infty} \bigl\|B R_A(it)\bigr\| = \operatorname{rb}_A(B)t→+∞lim​​BRA​(it)​=rbA​(B)
lim⁡t→+∞∥BRA(−it)∥=rb⁡A(B)\lim_{t \to +\infty} \bigl\|B R_A(-it)\bigr\| = \operatorname{rb}_A(B)t→+∞lim​​BRA​(−it)​=rbA​(B)
  1. For every real γ\gammaγ such that AAA is bounded below by γ\gammaγ:
lim⁡t→+∞∥BRA(−t)∥=rb⁡A(B).\lim_{t \to +\infty} \bigl\|B R_A(-t)\bigr\| = \operatorname{rb}_A(B).t→+∞lim​​BRA​(−t)​=rbA​(B).

Degenerate cases.

  • If some point ±it\pm it±it or −t-t−t is not in ρ(A)\rho(A)ρ(A), then RAR_ARA​ there is the zero operator. In that case BRABR_ABRA​ there has domain HHH, is identically 000, and has norm 000.
  • Only the behaviour for large ttt affects the limits.
  • If H={0}H = \{0\}H={0}, every quantity is 000.
  • If no γ\gammaγ satisfies the lower-bound predicate, the third claim is vacuous.
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