Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.4.2 (4.102): first-order Taylor remainder

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.renyi_taylor

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Tildes denote sandwiched Rényi quantities and bars denote Petz quantities. Their trace functionals are Q~α=Tr⁡(σ(1−α)/(2α)ρσ(1−α)/(2α))α\widetilde Q_\alpha=\operatorname{Tr}(\sigma^{(1-\alpha)/(2\alpha)}\rho\sigma^{(1-\alpha)/(2\alpha)})^\alphaQ​α​=Tr(σ(1−α)/(2α)ρσ(1−α)/(2α))α and Q‾α=Tr⁡(ρασ1−α)\overline Q_\alpha=\operatorname{Tr}(\rho^\alpha\sigma^{1-\alpha})Q​α​=Tr(ρασ1−α); the divergences include division by Tr⁡ρ\operatorname{Tr}\rhoTrρ inside the logarithm. Matrix powers vanish on the kernel, including power zero. The notation ρ≪σ\rho\ll\sigmaρ≪σ means support inclusion.

For fixed normalized ρ≪σ and a compact positive-order interval [a,b] containing 1, there exists K≥0 before α such that both Rényi divergences differ from D+(α−1)V/(2log(e)) in absolute value by at most K(α−1)².

∣Dα(ρ∥σ)−D(ρ∥σ)−α−12log⁡2eV(ρ∥σ)∣≤K(α−1)2.\left|D_\alpha(\rho\|\sigma)-D(\rho\|\sigma)-\frac{\alpha-1}{2\log_2e}V(\rho\|\sigma)\right|\le K(\alpha-1)^2.​Dα​(ρ∥σ)−D(ρ∥σ)−2log2​eα−1​V(ρ∥σ)​≤K(α−1)2.

This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
Formal statement
noncomputable section

open Filter

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P07

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I J A B C D X Y Z : Type*}

variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z]

/-- NODE paper:1504.00233#4.taylor
§4.4.2 (4.102): first-order Taylor remainder, arXiv:1504.00233v5, PDF p.72. -/
theorem renyi_taylor [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s)
    (hc : paperSupported r s) (a b : ℝ) (ha : 0 < a) (ha1 : a ≤ 1) (hb1 : 1 ≤ b) :
    ∃ K : ℝ, 0 < K ∧ ∀ sand : Bool, ∀ t ∈ Set.Icc a b,
      |paperRenyiReal sand r s t-(paperRelativeD r s).toReal-(t-1)*paperVariance r s/(2*Real.logb 2 (Real.exp 1))| ≤ K*(t-1)^2 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 72, §4.4.2 (4.102): first-order Taylor remainder
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let III be a finite, nonempty index type with decidable equality, let r,sr,sr,s be positive semidefinite complex matrices indexed by III, each of trace 111, and suppose ker⁡s⊆ker⁡r\ker s\subseteq\ker rkers⊆kerr. Let a,b∈Ra,b\in\mathbb Ra,b∈R satisfy 0<a≤1≤b0<a\le1\le b0<a≤1≤b. Write M[p]M^{[p]}M[p] for functional calculus of x↦xpx\mapsto x^px↦xp away from zero with value zero at zero, including for zero and negative exponents, and let L(M)L(M)L(M) be functional calculus of the total real logarithm log⁡2\log_2log2​, with log⁡20=0\log_2 0=0log2​0=0. Put

D=Re⁡tr⁡(r(L(r)−L(s)))Re⁡tr⁡r,V=Re⁡tr⁡ ⁣(r(L(r)−L(s)−D 1)2).D=\frac{\operatorname{Re}\operatorname{tr}(r(L(r)-L(s)))} {\operatorname{Re}\operatorname{tr}r}, \qquad V=\operatorname{Re}\operatorname{tr}\!\left(r(L(r)-L(s)-D\,1)^2\right).D=RetrrRetr(r(L(r)−L(s)))​,V=Retr(r(L(r)−L(s)−D1)2).

For either Qt=Re⁡tr⁡(r[t]s[1−t])Q_t=\operatorname{Re}\operatorname{tr}(r^{[t]}s^{[1-t]})Qt​=Retr(r[t]s[1−t]) or Qt=Re⁡tr⁡[(s[(1−t)/(2t)]rs[(1−t)/(2t)])[t]]Q_t=\operatorname{Re}\operatorname{tr}\bigl[(s^{[(1-t)/(2t)]}rs^{[(1-t)/(2t)]})^{[t]}\bigr]Qt​=Retr[(s[(1−t)/(2t)]rs[(1−t)/(2t)])[t]], define f(t)f(t)f(t) as the real conversion of the extended-real quantity that is DDD at t=1t=1t=1 and (t−1)−1L(Qt/Re⁡tr⁡r)(t-1)^{-1}\mathcal L(Q_t/\operatorname{Re}\operatorname{tr}r)(t−1)−1L(Qt​/Retrr) otherwise, where L(0)=−∞\mathcal L(0)=-\inftyL(0)=−∞, L(x)=log⁡2x\mathcal L(x)=\log_2 xL(x)=log2​x otherwise, and real conversion sends both infinities to zero. There exists a single real constant K>0K>0K>0 such that, simultaneously for both choices and every t∈[a,b]t\in[a,b]t∈[a,b],

∣f(t)−D−(t−1)V2log⁡2(e)∣≤K(t−1)2.\left|f(t)-D-\frac{(t-1)V}{2\log_2(e)}\right| \le K(t-1)^2.​f(t)−D−2log2​(e)(t−1)V​​≤K(t−1)2.

The interval includes its endpoints and may be the singleton {1}\{1\}{1}; the same KKK must work throughout the interval for both choices.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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