Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

eq44

Open
QAlgorithms.Papers.Independent.Support50.P15.eq44

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

prove2quantum

Let d≥2d\ge2d≥2, HHH be Hermitian, T>0T>0T>0, and ρi\rho_iρi​ a normalized full-rank state. Put ρf=e−H/T/tr⁡(e−H/T)\rho_f=e^{-H/T}/\operatorname{tr}(e^{-H/T})ρf​=e−H/T/tr(e−H/T), ΔS=S(ρf)−S(ρi)\Delta S=S(\rho_f)-S(\rho_i)ΔS=S(ρf​)−S(ρi​), and let W=F(ρi)−F(ρf)W=F(\rho_i)-F(\rho_f)W=F(ρi​)−F(ρf​) be available work, identified with the process supremum in Eqs. (41)--(43). For every N≥N(d)N\ge N(d)N≥N(d),

W≥TM(−ΔS,d)≥TN(e−ΔS/N−1+ΔS/N).W\ge TM(-\Delta S,d)\ge TN(e^{-\Delta S/N}-1+\Delta S/N).W≥TM(−ΔS,d)≥TN(e−ΔS/N−1+ΔS/N).

For a fixed local dimension l≥2l\ge2l≥2 and temperature T>0T>0T>0, consider any sequence of such systems with dn=lnd_n=l^ndn​=ln and entropy-density changes ΔSn/n→Δs\Delta S_n/n\to\Delta sΔSn​/n→Δs. Then

lim inf⁡n→∞Wn≥2T(Δslog⁡l)2.\liminf_{n\to\infty}W_n\ge2T\left(\frac{\Delta s}{\log l}\right)^2.n→∞liminf​Wn​≥2T(loglΔs​)2.

The liminf is in the extended real order, so unbounded work sequences are retained. The printed asymptotic sign does not supply the coefficient-two bound in every finite dimension.

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. (44), PDF p.13. The printed asymptotic sign is not a finite-d inequality with coefficient 2.
The liminf takes place in EReal, retaining unbounded work sequences. -/
theorem eq44 :
    (∀ d : ℕ, 2 ≤ d → ∀ h : Matrix (Fin d) (Fin d) ℂ, h.IsHermitian →
      ∀ t : ℝ, 0 < t → ∀ a : EntropyState d, fullRank a.val →
      (t : EReal) * tightBound d (-difference (thermalFinite h t) a.val) ≤ (availableWork h t a : EReal) ∧
      (∀ n : ℝ, maxVariance d ≤ n →
        ((t * exponentialBound n (-difference (thermalFinite h t) a.val) : ℝ) : EReal) ≤
          (t : EReal) * tightBound d (-difference (thermalFinite h t) a.val))) ∧
    (∀ (l : ℕ), 2 ≤ l → ∀ t : ℝ, 0 < t →
      ∀ (h : (n : ℕ) → Matrix (Fin (l ^ n)) (Fin (l ^ n)) ℂ)
        (a : (n : ℕ) → EntropyState (l ^ n)),
      (∀ n, (h n).IsHermitian ∧ fullRank (a n).val) →
      ∀ s : ℝ, Tendsto (fun n : ℕ => difference (thermalFinite (h n) t) (a n).val / n) atTop (nhds s) →
        ((2 * t * (s / Real.log l) ^ 2 : ℝ) : EReal) ≤
          Filter.liminf (fun n => (availableWork (h n) t (a n) : EReal)) atTop) := by sorry

end QAlgorithms.Papers.Independent.Support50.P15

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

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

Use natural logarithms and write S(ρ)=−Re⁡Tr⁡(ρlog⁡ρ)S(\rho)=-\operatorname{Re}\operatorname{Tr}(\rho\log\rho)S(ρ)=−ReTr(ρlogρ) for the entropy of a density matrix, with 0log⁡0=00\log0=00log0=0. For d≥2d\ge2d≥2, put md=(d−1)/dm_d=(d-1)/dmd​=(d−1)/d, 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), and hd(u)=H2(u)+ulog⁡(d−1)h_d(u)=H_2(u)+u\log(d-1)hd​(u)=H2​(u)+ulog(d−1). Define the extended real binary relative entropy 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), where k(p,q)=0k(p,q)=0k(p,q)=0 if p=0p=0p=0, k(p,q)=+∞k(p,q)=+\inftyk(p,q)=+∞ if p≠0p\ne0p=0 and q=0q=0q=0, and otherwise k(p,q)=plog⁡(p/q)k(p,q)=p\log(p/q)k(p,q)=plog(p/q). Set

Bd(z)=inf⁡{K(s,r):0≤s,r≤md, hd(s)−hd(r)=z},Vd=sup⁡0<r<1/2r(1−r)[log⁡ ⁣(1−rr(d−1))]2,En(z)=n(ez/n−1−z/n),B_d(z)=\inf\{K(s,r):0\le s,r\le m_d,\ h_d(s)-h_d(r)=z\},\quad V_d=\sup_{0<r<1/2}r(1-r)\left[\log\!\left(\frac{1-r}{r}(d-1)\right)\right]^2,\quad E_n(z)=n\bigl(e^{z/n}-1-z/n\bigr),Bd​(z)=inf{K(s,r):0≤s,r≤md​, hd​(s)−hd​(r)=z},Vd​=0<r<1/2sup​r(1−r)[log(r1−r​(d−1))]2,En​(z)=n(ez/n−1−z/n),

where an empty extended-real infimum is +∞+\infty+∞. For a Hermitian hhh and positive ttt, let bh,t=e−h/t/Tr⁡(e−h/t)b_{h,t}=e^{-h/t}/\operatorname{Tr}(e^{-h/t})bh,t​=e−h/t/Tr(e−h/t) and

W(h,t,a)=Re⁡Tr⁡(ha)−tS(a)−Re⁡Tr⁡(hbh,t)+tS(bh,t).W(h,t,a)=\operatorname{Re}\operatorname{Tr}(ha)-tS(a) -\operatorname{Re}\operatorname{Tr}(hb_{h,t})+tS(b_{h,t}).W(h,t,a)=ReTr(ha)−tS(a)−ReTr(hbh,t​)+tS(bh,t​).

The declaration asserts two statements. First, for every natural d≥2d\ge2d≥2, every Hermitian complex d×dd\times dd×d matrix hhh, every real t>0t>0t>0, and every density matrix aaa with zero kernel, writing z=S(a)−S(bh,t)z=S(a)-S(b_{h,t})z=S(a)−S(bh,t​), one has

tBd(z)≤W(h,t,a),tEn(z)≤tBd(z)for every real n≥Vd,tB_d(z)\le W(h,t,a),\qquad tE_n(z)\le tB_d(z)\quad\text{for every real }n\ge V_d,tBd​(z)≤W(h,t,a),tEn​(z)≤tBd​(z)for every real n≥Vd​,

as extended-real inequalities. Second, for every natural l≥2l\ge2l≥2, every fixed real t>0t>0t>0, and sequences hn,anh_n,a_nhn​,an​ indexed by all natural numbers, where hnh_nhn​ is a Hermitian complex ln×lnl^n\times l^nln×ln matrix and ana_nan​ is a density matrix of that dimension with zero kernel, if a real sss satisfies

S(bhn,t)−S(an)n⟶s(n→∞),\frac{S(b_{h_n,t})-S(a_n)}{n}\longrightarrow s\quad(n\to\infty),nS(bhn​,t​)−S(an​)​⟶s(n→∞),

then

2t(slog⁡l)2≤lim inf⁡n→∞W(hn,t,an)2t\left(\frac{s}{\log l}\right)^2 \le \liminf_{n\to\infty}W(h_n,t,a_n)2t(logls​)2≤n→∞liminf​W(hn​,t,an​)

in the extended reals. The sequences include n=0n=0n=0, where their dimension is 111 and the displayed quotient uses the convention that real division by zero is zero.

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