Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

7.1

Open
QAlgorithms.Papers.Independent.Intakenext100.P07.quantum_chernoff

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. The upward conditional entropy optimizes the negative divergence over normalized reference states on the conditioning system; the downward entropy uses the actual marginal. The notation H(A∣B)=H(AB)−H(B)H(A|B)=H(AB)-H(B)H(A∣B)=H(AB)−H(B) denotes conditional von Neumann entropy. In hypothesis testing, αn(T;ρ)=Tr⁡((I−T)ρ⊗n)\alpha_n(T;\rho)=\operatorname{Tr}((I-T)\rho^{\otimes n})αn​(T;ρ)=Tr((I−T)ρ⊗n) and βn(T;σ)=Tr⁡(Tσ⊗n)\beta_n(T;\sigma)=\operatorname{Tr}(T\sigma^{\otimes n})βn​(T;σ)=Tr(Tσ⊗n), with 0≤T≤I0\le T\le I0≤T≤I. The value αn∗(u)\alpha_n^*(u)αn∗​(u) minimizes the first error subject to the second being at most uuu.

For any two normalized states, lim_n −(1/n)log min_{0≤T≤I}(α_n(T;ρ)+β_n(T;σ))/2 = max_{0≤s≤1} −log Tr ρ^s σ^(1−s), with endpoint support projections and extended infinity when orthogonal.

lim⁡n→∞−1nlog⁡2min⁡0≤Tn≤Iαn(Tn;ρ)+βn(Tn;σ)2=max⁡0≤s≤1−log⁡2Tr⁡(ρsσ1−s).\lim_{n\to\infty}-\frac1n\log_2\min_{0\le T_n\le I}\frac{\alpha_n(T_n;\rho)+\beta_n(T_n;\sigma)}2=\max_{0\le s\le1}-\log_2\operatorname{Tr}(\rho^s\sigma^{1-s}).n→∞lim​−n1​log2​0≤Tn​≤Imin​2αn​(Tn​;ρ)+βn​(Tn​;σ)​=0≤s≤1max​−log2​Tr(ρsσ1−s).

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#7.1
7.1, arXiv:1504.00233v5, PDF p.114. -/
theorem quantum_chernoff [Nonempty I] (r s : paperMat I) (hr : IsDensityMatrix r) (hs : IsDensityMatrix s) :
    ∃ a ∈ Set.Icc (0:ℝ) 1,
      (∀ b ∈ Set.Icc (0:ℝ) 1, -paperLogE (paperRenyiQ false r s b) ≤ -paperLogE (paperRenyiQ false r s a)) ∧
      Tendsto (fun n : ℕ => ((1/(n:ℝ):ℝ):EReal)*(-paperLogE (paperSymmetricError (paperTensorPower r n) (paperTensorPower s n))))
        atTop (nhds (-paperLogE (paperRenyiQ false r s a))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P07

end
Source
Quantum Information Processing with Finite Resources -- Mathematical Foundations, arXiv:1504.00233v5, PDF p. 114, 7.1
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, and let r,sr,sr,s be positive semidefinite complex matrices on III, each of trace one. For real ttt, let X[t]X^{[t]}X[t] denote functional calculus with the function zero at zero and xtx^txt elsewhere, so in particular X[0]X^{[0]}X[0] vanishes on the kernel of XXX. Define

Qb=Re⁡tr⁡(r[b]s[1−b]),L(x)={−∞,x=0,log⁡2x,x≠0,Q_b=\operatorname{Re}\operatorname{tr}(r^{[b]}s^{[1-b]}),\qquad L(x)= \begin{cases}-\infty,&x=0,\\ \log_2x,&x\ne0,\end{cases}Qb​=Retr(r[b]s[1−b]),L(x)={−∞,log2​x,​x=0,x=0,​

where LLL is extended real. For any two matrices X,YX,YX,Y of the same size, define

esym(X,Y)=inf⁡T⪰0I−T⪰0Re⁡tr⁡[(I−T)X]+Re⁡tr⁡(TY)2,e_{\mathrm{sym}}(X,Y)= \inf_{\substack{T\succeq0\\I-T\succeq0}} \frac{\operatorname{Re}\operatorname{tr}[(I-T)X] +\operatorname{Re}\operatorname{tr}(TY)}2,esym​(X,Y)=T⪰0I−T⪰0​inf​2Retr[(I−T)X]+Retr(TY)​,

where this infimum is real-valued. Define tensor powers entrywise by (X⊗n)x,y=∏i<nXxi,yi(X^{\otimes n})_{x,y}=\prod_{i<n}X_{x_i,y_i}(X⊗n)x,y​=∏i<n​Xxi​,yi​​ for x,y:{0,…,n−1}→Ix,y:\{0,\ldots,n-1\}\to Ix,y:{0,…,n−1}→I. There exists a real a∈[0,1]a\in[0,1]a∈[0,1] such that −L(Qb)≤−L(Qa)-L(Q_b)\le-L(Q_a)−L(Qb​)≤−L(Qa​) for every real b∈[0,1]b\in[0,1]b∈[0,1], and

lim⁡n→∞1n[−L(esym(r⊗n,s⊗n))]=−L(Qa)\lim_{n\to\infty}\frac1n \bigl[-L(e_{\mathrm{sym}}(r^{\otimes n},s^{\otimes n}))\bigr] =-L(Q_a)n→∞lim​n1​[−L(esym​(r⊗n,s⊗n))]=−L(Qa​)

in the extended-real topology. The optimization includes both endpoint orders 0,10,10,1, with the specified zero-at-zero power convention; zero arguments of LLL give +∞+\infty+∞ after negation. The sequence is defined also at n=0n=0n=0: its tensor powers use empty products and its real reciprocal 1/01/01/0 is zero, with the resulting multiplication interpreted in the extended reals.

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