Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

eq46

Open
QAlgorithms.Papers.Independent.Support50.P15.eq46

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ,σ\rho,\sigmaρ,σ be normalized states in dimension d≥2d\ge2d≥2 and let the coding base D>1D>1D>1 be real. Define expected savings δ=(S(ρ)−S(σ))/log⁡D\delta=(S(\rho)-S(\sigma))/\log Dδ=(S(ρ)−S(σ))/logD. With relative entropy in nats and infinity retained,

D(ρ∥σ)log⁡D≥M(δlog⁡D,d)log⁡D.\frac{D(\rho\|\sigma)}{\log D}\ge\frac{M(\delta\log D,d)}{\log D}.logDD(ρ∥σ)​≥logDM(δlogD,d)​.

If δ≥0\delta\ge0δ≥0, the latter quantity is at least 2δ2log⁡D/(log⁡2(d−1)+4)2\delta^2\log D/(\log^2(d-1)+4)2δ2logD/(log2(d−1)+4). The entropic inequality holds for classical diagonal laws and quantum states; an actual code alphabet has integer size at least two. It bounds the excess length arising from a wrong source model.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P15
Formal statement
noncomputable section

attribute [local instance] Classical.propDecidable

open scoped Matrix ComplexConjugate ENNReal Matrix.Norms.L2Operator

open Filter MeasureTheory

namespace QAlgorithms.Papers.Independent.Support50.P15

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

/-- Eq. (46), PDF pp.14--15, valid for both classical and quantum states.
Only the final quadratic bound requires nonnegative savings. -/
theorem eq46 {d : ℕ} (hd : 2 ≤ d) (a b : EntropyState d) (base : ℝ) (hb : 1 < base) :
    let delta := difference a.val b.val / Real.log base
    tightBound d (delta * Real.log base) / (Real.log base : EReal) ≤ stateRelativeNats a b / (Real.log base : EReal) ∧
    (0 ≤ delta → ((delta ^ 2 * (2 * Real.log base) / redundancyScale d : ℝ) : EReal) ≤
      tightBound d (delta * Real.log base) / (Real.log base : EReal)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P15

end
Source
Tight bound on relative entropy by entropy difference, arXiv:1304.0036v3, PDF p. 14, eq46
Read-back

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

Let d≥2d\ge2d≥2 be a natural number, let a,ba,ba,b be arbitrary complex d×dd\times dd×d density matrices, meaning positive semidefinite matrices of trace 111, and let the real number base>1\mathrm{base}>1base>1. Write S(ρ)=−Re⁡Tr⁡(ρlog⁡ρ)S(\rho)=-\operatorname{Re}\operatorname{Tr}(\rho\log\rho)S(ρ)=−ReTr(ρlogρ), using spectral functional calculus and 0log⁡0=00\log0=00log0=0, and let δ=(S(a)−S(b))/log⁡(base)\delta=(S(a)-S(b))/\log(\mathrm{base})δ=(S(a)−S(b))/log(base). Define D(a∥b)=+∞D(a\Vert b)=+\inftyD(a∥b)=+∞ when ker⁡b⊈ker⁡a\ker b\not\subseteq\ker akerb⊆kera, and otherwise D(a∥b)=max⁡{0,Re⁡Tr⁡(alog⁡a−alog⁡b)}D(a\Vert b)=\max\{0,\operatorname{Re}\operatorname{Tr}(a\log a-a\log b)\}D(a∥b)=max{0,ReTr(aloga−alogb)}, with the functional-calculus logarithm equal to 000 at eigenvalue 000. For H2(u)=−ulog⁡u−(1−u)log⁡(1−u)H_2(u)=-u\log u-(1-u)\log(1-u)H2​(u)=−ulogu−(1−u)log(1−u), put hd(u)=H2(u)+ulog⁡(d−1)h_d(u)=H_2(u)+u\log(d-1)hd​(u)=H2​(u)+ulog(d−1) and

Bd(z)=inf⁡0≤s,r≤(d−1)/dhd(s)−hd(r)=zK(s,r),B_d(z)=\inf_{\substack{0\le s,r\le(d-1)/d\\h_d(s)-h_d(r)=z}}K(s,r),Bd​(z)=0≤s,r≤(d−1)/dhd​(s)−hd​(r)=z​inf​K(s,r),

where K(s,r)=k(s,r)+k(1−s,1−r)K(s,r)=k(s,r)+k(1-s,1-r)K(s,r)=k(s,r)+k(1−s,1−r), with k(p,q)=0k(p,q)=0k(p,q)=0 if p=0p=0p=0, +∞+\infty+∞ if p≠0=qp\ne0=qp=0=q, and plog⁡(p/q)p\log(p/q)plog(p/q) otherwise; an empty infimum is +∞+\infty+∞. Then

Bd(δlog⁡(base))log⁡(base)≤D(a∥b)log⁡(base),\frac{B_d(\delta\log(\mathrm{base}))}{\log(\mathrm{base})} \le \frac{D(a\Vert b)}{\log(\mathrm{base})},log(base)Bd​(δlog(base))​≤log(base)D(a∥b)​,

and, if 0≤δ0\le\delta0≤δ, also

2δ2log⁡(base)[log⁡(d−1)]2+4≤Bd(δlog⁡(base))log⁡(base).\frac{2\delta^2\log(\mathrm{base})}{[\log(d-1)]^2+4} \le \frac{B_d(\delta\log(\mathrm{base}))}{\log(\mathrm{base})}.[log(d−1)]2+42δ2log(base)​≤log(base)Bd​(δlog(base))​.

Both comparisons take place in the extended reals; neither density matrix is required to have full rank.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · 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