Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.22 — D̲μ ≤ liminf (1/π) Im F(λ+iε) ≤ limsup (1/π) Im F(λ+iε) ≤ D̄μ

Proved
TeschlQM.Herglotz.deriv_le_boundary_im

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

differentiation-of-measuresherglotz-functionsmeasure-theoryp2o-batch-books5p2o-gran-per-chapterp2o-plan-bookp2o-v1

Let μ\muμ be a finite Borel measure on R\mathbb{R}R with Borel transform FFF, and let D‾μ\underline{D}\muD​μ, D‾μ\overline{D}\muDμ be its lower and upper derivatives with respect to Lebesgue measure. Then for every λ∈R\lambda \in \mathbb{R}λ∈R

(D‾μ)(λ)≤lim inf⁡ε↓01πIm⁡F(λ+iε)≤lim sup⁡ε↓01πIm⁡F(λ+iε)≤(D‾μ)(λ).(\underline{D}\mu)(\lambda) \le \liminf_{\varepsilon\downarrow 0} \frac1\pi \operatorname{Im} F(\lambda + i\varepsilon) \le \limsup_{\varepsilon\downarrow 0} \frac1\pi \operatorname{Im} F(\lambda + i\varepsilon) \le (\overline{D}\mu)(\lambda).(D​μ)(λ)≤ε↓0liminf​π1​ImF(λ+iε)≤ε↓0limsup​π1​ImF(λ+iε)≤(Dμ)(λ).

So the boundary values of Im⁡F\operatorname{Im} FImF are squeezed between the lower and upper derivatives of μ\muμ, which is how the Radon–Nikodym derivative of μ\muμ is read off from FFF.

Formalization Note. The printed (3.90) has 1πF(λ+iε)\frac1\pi F(\lambda + i\varepsilon)π1​F(λ+iε) without Im⁡\operatorname{Im}Im, a complex number that cannot be compared with the real derivatives; the proof on the same page estimates Im⁡(F(λ+iε))\operatorname{Im}(F(\lambda + i\varepsilon))Im(F(λ+iε)), and that is what is stated. Since Im⁡F(λ+iε)=∫ε/((t−λ)2+ε2) dμ(t)≥0\operatorname{Im} F(\lambda + i\varepsilon) = \int \varepsilon/((t-\lambda)^2+\varepsilon^2)\,d\mu(t) \ge 0ImF(λ+iε)=∫ε/((t−λ)2+ε2)dμ(t)≥0 for ε>0\varepsilon > 0ε>0, the quantities are compared in [0,∞][0,\infty][0,∞] via ENNReal.ofReal, which loses nothing on nonnegative reals.

Preamble
import Mathlib
import Definitions.Def_TeschlQM_Herglotz_borelTransform
import Definitions.Def_TeschlQM_Herglotz_lowerDeriv
import Definitions.Def_TeschlQM_Herglotz_upperDeriv

open MeasureTheory Filter
open scoped ENNReal Topology
Formal statement
namespace TeschlQM.Herglotz

/-- Teschl, p. 108, Theorem 3.22. Let `μ` be a finite Borel measure and `F` its Borel transform.
Then, for every `λ ∈ ℝ`, (3.90)
`(D̲μ)(λ) ≤ liminf_{ε↓0} (1/π) Im F(λ + iε) ≤ limsup_{ε↓0} (1/π) Im F(λ + iε) ≤ (D̄μ)(λ)`.
The printed (3.90) omits `Im`; the proof on pp. 108–109 estimates `Im(F(λ + iε))`, which is
nonnegative for `ε > 0`, so the quantities are compared in `[0, ∞]`. -/
theorem deriv_le_boundary_im (μ : Measure ℝ) [IsFiniteMeasure μ] (t : ℝ) :
    lowerDeriv μ t ≤ liminf (fun ε : ℝ => ENNReal.ofReal
        ((borelTransform μ ((t : ℂ) + (ε : ℂ) * Complex.I)).im / Real.pi)) (𝓝[>] (0 : ℝ)) ∧
    liminf (fun ε : ℝ => ENNReal.ofReal
        ((borelTransform μ ((t : ℂ) + (ε : ℂ) * Complex.I)).im / Real.pi)) (𝓝[>] (0 : ℝ)) ≤
      limsup (fun ε : ℝ => ENNReal.ofReal
        ((borelTransform μ ((t : ℂ) + (ε : ℂ) * Complex.I)).im / Real.pi)) (𝓝[>] (0 : ℝ)) ∧
    limsup (fun ε : ℝ => ENNReal.ofReal
        ((borelTransform μ ((t : ℂ) + (ε : ℂ) * Complex.I)).im / Real.pi)) (𝓝[>] (0 : ℝ)) ≤
      upperDeriv μ t := by sorry

end TeschlQM.Herglotz
Source
Teschl, Mathematical Methods in Quantum Mechanics, AMS GSM 99, 2009, p. 108, Theorem 3.22
Read-back

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

Let μ\muμ be a finite Borel measure on R\mathbb{R}R, let t∈Rt\in\mathbb{R}t∈R, and let F(z)=∫Rdμ(s)s−zF(z)=\int_{\mathbb{R}}\frac{d\mu(s)}{s-z}F(z)=∫R​s−zdμ(s)​ be its Borel transform (Bochner integral, 000 if not integrable). For ε>0\varepsilon>0ε>0 define

g(ε)=max⁡ ⁣(0, 1πIm⁡F(t+iε))∈[0,∞).g(\varepsilon)=\max\!\Big(0,\ \tfrac{1}{\pi}\operatorname{Im} F(t+i\varepsilon)\Big)\in[0,\infty).g(ε)=max(0, π1​ImF(t+iε))∈[0,∞).

This is a real number converted to [0,∞][0,\infty][0,∞], with negative values replaced by 000.

Also define

(D‾μ)(t)=lim inf⁡ε↓0μ((t−ε,t+ε))2εand(D‾μ)(t)=lim sup⁡ε↓0μ((t−ε,t+ε))2ε,(\underline{D}\mu)(t)=\liminf_{\varepsilon\downarrow0}\frac{\mu((t-\varepsilon,t+\varepsilon))}{2\varepsilon} \quad\text{and}\quad (\overline{D}\mu)(t)=\limsup_{\varepsilon\downarrow0}\frac{\mu((t-\varepsilon,t+\varepsilon))}{2\varepsilon},(D​μ)(t)=ε↓0liminf​2εμ((t−ε,t+ε))​and(Dμ)(t)=ε↓0limsup​2εμ((t−ε,t+ε))​,

both computed in [0,∞][0,\infty][0,∞]. The statement asserts the chain

(D‾μ)(t) ≤ lim inf⁡ε↓0g(ε) ≤ lim sup⁡ε↓0g(ε) ≤ (D‾μ)(t).(\underline{D}\mu)(t)\ \le\ \liminf_{\varepsilon\downarrow 0} g(\varepsilon)\ \le\ \limsup_{\varepsilon\downarrow 0} g(\varepsilon)\ \le\ (\overline{D}\mu)(t).(D​μ)(t) ≤ ε↓0liminf​g(ε) ≤ ε↓0limsup​g(ε) ≤ (Dμ)(t).

All liminfs and limsups are taken in [0,∞][0,\infty][0,∞], with ε→0\varepsilon\to0ε→0 through strictly positive values.

If μ=0\mu=0μ=0, every quantity in the chain is 000.

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