Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 1, p. 4 — A(A+x)−1−B(B+x)−1=∫01ddt(B+tΔ)(B+tΔ+x)−1dt=∫01x(B+tΔ+x)−1Δ(B+tΔ+x)−1dtA(A+x)^{-1}-B(B+x)^{-1}=\int_0^1 \frac{d}{dt}(B+t\Delta)(B+t\Delta+x)^{-1}dt=\int_0^1 x(B+t\Delta+x)^{-1}\Delta(B+t\Delta+x)^{-1}dtA(A+x)−1−B(B+x)−1=∫01​dtd​(B+tΔ)(B+tΔ+x)−1dt=∫01​x(B+tΔ+x)−1Δ(B+tΔ+x)−1dt

Proved
QChernoff.Trace.resolvent_integral

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

operator-integralp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-chernoffresolvent

Let HHH be a complex Hilbert space, A,B≥0A,B\ge0A,B≥0 positive bounded operators on HHH, Δ:=A−B\Delta:=A-BΔ:=A−B, and x>0x>0x>0 a real number. For 0≤t≤10\le t\le 10≤t≤1 the operator B+tΔ=(1−t)B+tAB+t\Delta=(1-t)B+tAB+tΔ=(1−t)B+tA is positive, so B+tΔ+xB+t\Delta+xB+tΔ+x is invertible. Then

A(A+x)−1−B(B+x)−1=∫01ddt[(B+tΔ)(B+tΔ+x)−1]dt=∫01x (B+tΔ+x)−1 Δ (B+tΔ+x)−1 dt,A(A+x)^{-1}-B(B+x)^{-1}=\int_0^1\frac{d}{dt}\Big[(B+t\Delta)(B+t\Delta+x)^{-1}\Big]dt=\int_0^1 x\,(B+t\Delta+x)^{-1}\,\Delta\,(B+t\Delta+x)^{-1}\,dt ,A(A+x)−1−B(B+x)−1=∫01​dtd​[(B+tΔ)(B+tΔ+x)−1]dt=∫01​x(B+tΔ+x)−1Δ(B+tΔ+x)−1dt,

both integrands being integrable operator-valued functions of ttt on [0,1][0,1][0,1].

This identity reduces the positivity of Tr⁡[PB(A(A+x)−1−B(B+x)−1)]\operatorname{Tr}[PB(A(A+x)^{-1}-B(B+x)^{-1})]Tr[PB(A(A+x)−1−B(B+x)−1)] in the proof of Lemma 1 to the positivity statement (10).

Formalization Note The integrals are interval integrals of functions R→(H→LH)\mathbb R\to(H\to_L H)R→(H→L​H); tΔt\DeltatΔ uses the real scalar action and the shift xxx is (x:C)⋅1(x:\mathbb C)\cdot\mathbb 1(x:C)⋅1.

Differences from the source:

  • generalization: operators of unspecified dimension → bounded positive operators on an arbitrary complex Hilbert space; reason: p. 3 states that the proof goes through in infinite dimensions; H = ℂⁿ is the matrix case
  • encoding: the display, inside "for all x > 0" → x : ℝ with 0 < x as an explicit hypothesis; reason: the display is asserted for the x > 0 of the surrounding integral
  • encoding: the chain A(A+x)⁻¹ − B(B+x)⁻¹ = (B+∆)(B+∆+x)⁻¹ − B(B+x)⁻¹ = ∫₀¹ dt d/dt(…) = ∫₀¹ dt x(…)∆(…) → the first step (B + ∆ = A) is not restated; the other two equalities are the two conjuncts, with d/dt as Mathlib's deriv and (·)⁻¹ as Ring.inverse; reason: B + (A − B) = A is an identity of the definitions; the function of τ is differentiable on a neighbourhood of [0, 1] because the invertible operators form an open set, so deriv is the true derivative and Ring.inverse the true inverse
  • encoding: existence of the two integrals over [0, 1] (implicit in the display) → two explicit IntervalIntegrable conjuncts in the conclusion; reason: they assert that neither interval integral is Lean's junk value 0 of a non-integrable function; this makes the statement stronger, not weaker
Preamble
import Mathlib
Formal statement
namespace QChernoff.Trace

/-- Proof of Lemma 1, Appendix A, p. 4: for `x > 0` and `Δ = A − B`, the resolvent difference
`A(A + x)⁻¹ − B(B + x)⁻¹` equals `∫₀¹ d/dt (B + tΔ)(B + tΔ + x)⁻¹ dt`, which in turn equals
`∫₀¹ x (B + tΔ + x)⁻¹ Δ (B + tΔ + x)⁻¹ dt`; both integrands are integrable on `[0, 1]`. -/
theorem resolvent_integral {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
    [CompleteSpace H] (A B : H →L[ℂ] H) (hA : 0 ≤ A) (hB : 0 ≤ B) (x : ℝ) (hx : 0 < x) :
    IntervalIntegrable
        (deriv (fun τ : ℝ => (B + τ • (A - B)) * Ring.inverse (B + τ • (A - B) + (x : ℂ) • 1)))
        MeasureTheory.volume 0 1 ∧
      IntervalIntegrable
        (fun t : ℝ => x • (Ring.inverse (B + t • (A - B) + (x : ℂ) • 1) * (A - B) *
          Ring.inverse (B + t • (A - B) + (x : ℂ) • 1)))
        MeasureTheory.volume 0 1 ∧
      A * Ring.inverse (A + (x : ℂ) • 1) - B * Ring.inverse (B + (x : ℂ) • 1) =
        ∫ t in (0 : ℝ)..1,
          deriv (fun τ : ℝ => (B + τ • (A - B)) * Ring.inverse (B + τ • (A - B) + (x : ℂ) • 1)) t ∧
      ∫ t in (0 : ℝ)..1,
          deriv (fun τ : ℝ => (B + τ • (A - B)) * Ring.inverse (B + τ • (A - B) + (x : ℂ) • 1)) t =
        ∫ t in (0 : ℝ)..1, x • (Ring.inverse (B + t • (A - B) + (x : ℂ) • 1) * (A - B) *
          Ring.inverse (B + t • (A - B) + (x : ℂ) • 1)) := by sorry

end QChernoff.Trace
Source
Audenaert et al., The Quantum Chernoff Bound, arXiv:quant-ph/0610027v1, p. 4, unnumbered display in the proof of Lemma 1, Appendix A
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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