Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.6, quantum Stein lemma

Open
QAlgorithms.Papers.Independent.Intakenext100.P45.quantumStein

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

prove2quantum

For arbitrary finite-dimensional densities ρ,σ\rho,\sigmaρ,σ and fixed 0<ε<10<\varepsilon<10<ε<1, define βn∗(ε)\beta_n^*(\varepsilon)βn∗​(ε) as the infimum of Tr⁡((I−P)σ⊗n)\operatorname{Tr}((I-P)\sigma^{\otimes n})Tr((I−P)σ⊗n) over all joint effects satisfying Tr⁡(Pρ⊗n)≤ε\operatorname{Tr}(P\rho^{\otimes n})\le\varepsilonTr(Pρ⊗n)≤ε. Then

lim⁡n→∞−1nlog⁡βn∗(ε)=S(ρ∥σ).\lim_{n\to\infty}-\frac1n\log\beta_n^*(\varepsilon)=S(\rho\|\sigma).n→∞lim​−n1​logβn∗​(ε)=S(ρ∥σ).

The extended limit exists, independently of ε\varepsilonε, including the infinite value on support failure.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P45
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P45

open QAlgorithms Filter

open scoped Matrix ComplexConjugate ComplexOrder ENNReal BigOperators Topology

open QAlgorithms.Papers.Independent.Information100.P07
  (support positivePart positiveProjection IsProjection)

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

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

open QAlgorithms.Papers.Independent.Dependency50.P28 (logNonnegativeExtended relativeEntropy)

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

attribute [local instance] Classical.propDecidable Classical.decEq

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

/-- arXiv:0708.4282v1, PDF pp.30,31: §5.6, quantum Stein lemma. -/
theorem quantumStein (rho sigma : Mat I)
    (hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
    (eps : ℝ) (he0 : 0 < eps) (he1 : eps < 1) :
    HasRate (constrainedTypeII rho sigma eps) (relativeEntropy rho sigma) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P45

end
Source
Asymptotic Error Rates in Quantum Hypothesis Testing, arXiv:0708.4282v1, PDF p. 30, §5.6, quantum Stein lemma
Read-back

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

Let III be any finite index type with decidable equality, let ρ,σ\rho,\sigmaρ,σ be complex matrices indexed by III, each positive semidefinite with trace 111, and let 0<ε<10<\varepsilon<10<ε<1. For n≥1n\ge1n≥1, write ρ⊗n\rho^{\otimes n}ρ⊗n for the matrix with entries ∏j=1nρxjyj\prod_{j=1}^{n}\rho_{x_jy_j}∏j=1n​ρxj​yj​​, and similarly for σ\sigmaσ. Define

βk=inf⁡{Re⁡Tr⁡((1−P)σ⊗(k+1)):P≥0, 1−P≥0, Re⁡Tr⁡(Pρ⊗(k+1))≤ε}.\beta_k=\inf\left\{\operatorname{Re}\operatorname{Tr}\bigl((1-P)\sigma^{\otimes(k+1)}\bigr): P\ge0,\ 1-P\ge0,\ \operatorname{Re}\operatorname{Tr}\bigl(P\rho^{\otimes(k+1)}\bigr)\le\varepsilon\right\}.βk​=inf{ReTr((1−P)σ⊗(k+1)):P≥0, 1−P≥0, ReTr(Pρ⊗(k+1))≤ε}.

Then

lim⁡k→∞−L(βk)k+1=D(ρ∥σ)in [−∞,+∞],\lim_{k\to\infty}\frac{-L(\beta_k)}{k+1}=D(\rho\Vert\sigma) \quad\text{in }[-\infty,+\infty],k→∞lim​k+1−L(βk​)​=D(ρ∥σ)in [−∞,+∞],

where L(x)=log⁡xL(x)=\log xL(x)=logx for x>0x>0x>0 and L(x)=−∞L(x)=-\inftyL(x)=−∞ for x≤0x\le0x≤0, using natural logarithms. Here

D(ρ∥σ)={Re⁡Tr⁡ ⁣(ρ(log⁡ρ−log⁡σ))Re⁡Tr⁡ρ,ker⁡σ⊆ker⁡ρ,+∞,otherwise,D(\rho\Vert\sigma)= \begin{cases} \dfrac{\operatorname{Re}\operatorname{Tr}\!\left(\rho(\log\rho-\log\sigma)\right)} {\operatorname{Re}\operatorname{Tr}\rho}, &\ker\sigma\subseteq\ker\rho,\\ +\infty,&\text{otherwise}, \end{cases}D(ρ∥σ)=⎩⎨⎧​ReTrρReTr(ρ(logρ−logσ))​,+∞,​kerσ⊆kerρ,otherwise,​

with matrix logarithms defined by continuous functional calculus and the scalar convention log⁡0=0\log0=0log0=0; the denominator equals 111 under the hypotheses. Thus a zero value of βk\beta_kβk​ gives rate +∞+\infty+∞. The density-matrix hypotheses cannot hold when III is empty.

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