Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Small-rate classical exponent agrees with the compact quantum formula

Proved
QAlgorithms.Papers.Independent.Gap48.P41.classical_local_duality

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

prove2quantum

Let XXX be a nonempty finite alphabet, and let p,qp,qp,q be probability distributions on XXX, allowing zero coordinates. Write D(a∥b)D(a\Vert b)D(a∥b) for natural-log Kullback–Leibler divergence, with zero mass contributing zero and support failure giving +∞+\infty+∞. For real r>D(p∥q)r>D(p\Vert q)r>D(p∥q), put

ψ~(s)=log⁡∑j∈Xpj1+sqj−s,p(s)j=e−ψ~(s)pj1+sqj−s,gr(s)=sr−ψ~(s)1+s.\widetilde\psi(s)=\log\sum_{j\in X}p_j^{1+s}q_j^{-s},\qquad p(s)_j=e^{-\widetilde\psi(s)}p_j^{1+s}q_j^{-s},\qquad g_r(s)=\frac{s r-\widetilde\psi(s)}{1+s}.ψ​(s)=logj∈X∑​pj1+s​qj−s​,p(s)j​=e−ψ​(s)pj1+s​qj−s​,gr​(s)=1+ssr−ψ​(s)​.

A zero pjp_jpj​ gives zero tilted mass, and inverse powers act only on positive support. The finite rate condition entails supp⁡p⊆supp⁡q\operatorname{supp}p\subseteq\operatorname{supp}qsuppp⊆suppq. Define

u~(r)=inf⁡p^: D(p^∥q)≤r{D(p^∥p)+r−D(p^∥q)},\widetilde u(r)=\inf_{\widehat p:\,D(\widehat p\Vert q)\le r} \{D(\widehat p\Vert p)+r-D(\widehat p\Vert q)\},u(r)=p​:D(p​∥q)≤rinf​{D(p​∥p)+r−D(p​∥q)},

where the infimum ranges over all probability distributions. The second divergence is finite for every feasible law; the first may be infinite.

Suppose 0<t≤10<t\le10<t≤1 and D(p(t)∥q)=rD(p(t)\Vert q)=rD(p(t)∥q)=r. Then

u~(r)=gr(t)=max⁡0≤s≤1gr(s),\widetilde u(r)=g_r(t)=\max_{0\le s\le1}g_r(s),u(r)=gr​(t)=0≤s≤1max​gr​(s),

with the maximum attained at ttt. Equivalently, for diagonal density matrices ρ=diag⁡(pj)\rho=\operatorname{diag}(p_j)ρ=diag(pj​) and σ=diag⁡(qj)\sigma=\operatorname{diag}(q_j)σ=diag(qj​), this value equals u(r)=max⁡0≤s≤1sr−log⁡Tr⁡(ρ1+sσ−s)1+su(r)=\max_{0\le s\le1}\frac{sr-\log\operatorname{Tr}(\rho^{1+s}\sigma^{-s})}{1+s}u(r)=max0≤s≤1​1+ssr−logTr(ρ1+sσ−s)​, the paper's compact Petz expression (15).

This pins the small-rate comparison by an explicit source-derived tilt condition and does not extend it to arbitrary rates.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P41

open scoped Matrix ComplexOrder BigOperators

open Filter QAlgorithms

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)

open QAlgorithms.Papers.Independent.Information100.P07 (positiveProjection)

open QAlgorithms.Papers.Independent.Dependency50.P28
  (tr SupportLE relativeEntropy scalarPower classicalD typeI accept TestSequence
    scaled logNonnegativeExtended)

open QAlgorithms.Papers.Independent.Claimed50.P15 (legendre)

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

attribute [local instance] Classical.propDecidable Classical.decEq

variable {I : Type} [Fintype I] [DecidableEq I]

variable {X : Type} [Fintype X]

/-- PDF pp.7--9: the small-rate classical exponent equals the compact [0,1]
formula, with an attained maximum. The source's vague 'sufficiently small' is
pinned by a matching tilt with 0<t<=1; the diagonal quantum comparison is explicit. -/
theorem classical_local_duality [Nonempty X] [DecidableEq X]
    (p q : X → ℝ) (hp : IsLaw p) (hq : IsLaw q) (r t : ℝ)
    (hr : classicalD (.finite 1 (by norm_num)) p q < (r : EReal)) (ht0 : 0 < t) (ht1 : t ≤ 1)
    (hlevel : classicalD (.finite 1 (by norm_num)) (tilt p q t) q = (r : EReal)) :
    classicalMinimum p q r = (classicalG p q r t : EReal) ∧
    IsGreatest (classicalG p q r '' Set.Icc 0 1) (classicalG p q r t) ∧
    classicalMinimum p q r =
      (petzExponent (Matrix.diagonal (fun x => (p x : ℂ)))
        (Matrix.diagonal (fun x => (q x : ℂ))) r : EReal) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P41

end
Source
Strong Converse and Stein's Lemma in the Quantum Hypothesis Testing, arXiv:quant-ph/9906090v1, PDF p. 7, §5, unnumbered: small-rate classical exponent agrees with (15)
Read-back

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

Let XXX be a finite, nonempty set with decidable equality, and let p,q:X→Rp,q:X\to\mathbb Rp,q:X→R be nonnegative functions each summing to 111. Define D(u∥v)=∑x:u(x)>0u(x)log⁡(u(x)/v(x))D(u\|v)=\sum_{x:u(x)>0}u(x)\log(u(x)/v(x))D(u∥v)=∑x:u(x)>0​u(x)log(u(x)/v(x)) when v(x)>0v(x)>0v(x)>0 wherever u(x)>0u(x)>0u(x)>0, and D(u∥v)=+∞D(u\|v)=+\inftyD(u∥v)=+∞ otherwise. All logarithms are natural. Set a[z]=aza^{[z]}=a^za[z]=az for a>0a>0a>0 and a[z]=0a^{[z]}=0a[z]=0 for a≤0a\le0a≤0, even for zero or negative exponents, and define ψ(z)=log⁡(∑xp(x)[1+z]q(x)[−z])\psi(z)=\log\bigl(\sum_xp(x)^{[1+z]}q(x)^{[-z]}\bigr)ψ(z)=log(∑x​p(x)[1+z]q(x)[−z]), πz(x)=e−ψ(z)p(x)[1+z]q(x)[−z]\pi_z(x)=e^{-\psi(z)}p(x)^{[1+z]}q(x)^{[-z]}πz​(x)=e−ψ(z)p(x)[1+z]q(x)[−z], and G(r,z)=(zr−ψ(z))/(1+z)G(r,z)=(zr-\psi(z))/(1+z)G(r,z)=(zr−ψ(z))/(1+z). Suppose r,t∈Rr,t\in\mathbb Rr,t∈R satisfy D(p∥q)<rD(p\|q)<rD(p∥q)<r, 0<t≤10<t\le10<t≤1, and D(πt∥q)=rD(\pi_t\|q)=rD(πt​∥q)=r. Let mrm_rmr​ be the extended-real infimum of D(h∥p)+r−D(h∥q)D(h\|p)+r-D(h\|q)D(h∥p)+r−D(h∥q) over all nonnegative h:X→Rh:X\to\mathbb Rh:X→R summing to 111 with D(h∥q)≤rD(h\|q)\le rD(h∥q)≤r. Put A=diag⁡(p)A=\operatorname{diag}(p)A=diag(p) and B=diag⁡(q)B=\operatorname{diag}(q)B=diag(q), regarded as complex matrices; for a positive semidefinite matrix CCC, let C[z]C^{[z]}C[z] mean spectral functional calculus with the function equal to xzx^zxz for x≠0x\ne0x=0 and 000 at x=0x=0x=0. Define

EA,B(r)=sup⁡0≤z≤1(z1+zr−log⁡ ⁣(Re⁡Tr⁡(A[1+z]B[−z]))1+z).E_{A,B}(r)= \sup_{0\le z\le1} \left( \frac{z}{1+z}r- \frac{\log\!\bigl(\operatorname{Re}\operatorname{Tr}(A^{[1+z]}B^{[-z]})\bigr)}{1+z} \right).EA,B​(r)=0≤z≤1sup​(1+zz​r−1+zlog(ReTr(A[1+z]B[−z]))​).

Then mr=G(r,t)m_r=G(r,t)mr​=G(r,t), the real number G(r,t)G(r,t)G(r,t) belongs to {G(r,z):0≤z≤1}\{G(r,z):0\le z\le1\}{G(r,z):0≤z≤1} and is its greatest element, and mr=EA,B(r)m_r=E_{A,B}(r)mr​=EA,B​(r), with real quantities embedded in the extended reals. Zero entries of ppp and qqq are allowed, but D(p∥q)<rD(p\|q)<rD(p∥q)<r requires q>0q>0q>0 wherever p>0p>0p>0; the exact-level hypothesis need not be satisfiable, and is impossible when p=qp=qp=q.

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

    Confirmed by the moderator at approval.

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