Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2, Eqs. (15)–(16): asymptotic relative entropy bounds

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.asymptotic_relative_entropy_bounds

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All states are normalized finite-dimensional bipartite density matrices. Gamma denotes transposition of Bob in the fixed product basis. The trace norm is the full trace norm. For a finite Bell expression S with real coefficients, C(S) and Q(S) are its largest signed classical value and its supremal signed quantum value over arbitrary finite local dimensions; Q_S(rho) optimizes complete local POVMs on the fixed state.

The quantities R, T^infinity and R_H optimize arbitrary finite Bell scenarios and LOCC preprocessing of independent copies, using limsup per positive copy number. Input laws are arbitrary joint laws. T^infinity takes its innermost infimum over a one-copy separable sigma, comparing the same channel and the same measurements on rho^n and sigma^n. R_H counts the successful local-filter branch with its probability, after normalizing that branch; a zero-probability branch scores zero. E_r is the unregularized relative entropy of entanglement. All relative entropies and logarithms use bits and retain infinity on support failure. For every such state rho,

R(ρ)≤T∞(ρ)≤Er(ρ).R(\rho)\le T^\infty(\rho)\le E_r(\rho).R(ρ)≤T∞(ρ)≤Er​(ρ).

If rho is PPT, also

T∞(ρ)≤Er(ρΓ).T^\infty(\rho)\le E_r(\rho^\Gamma).T∞(ρ)≤Er​(ρΓ).

These bounds control asymptotic nonlocality using entanglement relative entropy.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P09
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P09

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

open Filter

open QAlgorithms.Entanglement (IsSeparableDensity)

open QAlgorithms.Papers.Independent.Dependency50.P24
  (transposeSecond partyCut xForm swapPrivate hidingOne hidingTwo)

open QAlgorithms.Papers.Independent.Dependency50.P42 (dimensionedPower)

open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)

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

open QAlgorithms.Papers.Independent.Advance50.P47 (Box)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntanglement)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF pp.4,8--9, Theorem 2, Eqs.(15)--(16): both general chain and conditional PPT bound. -/
theorem asymptotic_relative_entropy_bounds (a b : ℕ+) (rho : Op (Fin a × Fin b))
    (hrho : IsDensityMatrix rho) :
    asymptoticR false rho ≤ asymptoticT false rho ∧
    asymptoticT false rho ≤ relativeEntanglement rho ∧
    ((transposeSecond rho).PosSemidef →
      asymptoticT false rho ≤ relativeEntanglement (transposeSecond rho)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 4, Theorem 2, Eqs. (15)–(16): asymptotic relative entropy bounds
Read-back

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

For every pair of positive integers a,ba,ba,b and every positive semidefinite trace-111 matrix ρ\rhoρ on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, the extended-nonnegative-real quantities defined below satisfy

R∞(ρ)≤T∞(ρ)≤ER(ρ),ρT2≥0 ⟹ T∞(ρ)≤ER(ρT2).R_\infty(\rho)\le T_\infty(\rho)\le E_{\mathrm R}(\rho), \qquad \rho^{T_2}\ge0\ \Longrightarrow\ T_\infty(\rho)\le E_{\mathrm R}(\rho^{T_2}).R∞​(ρ)≤T∞​(ρ)≤ER​(ρ),ρT2​≥0 ⟹ T∞​(ρ)≤ER​(ρT2​).

To define these quantities, a Bell experiment on a given input space consists of a map in the ambient topological closure of finite LOCC maps to some positive finite local output dimensions, a finite Bell scenario with positive input and output sizes, and local positive semidefinite measurement effects summing to the identity for each input. Finite LOCC maps are generated by the identity and finite recursive local Kraus measurements satisfying ∑iEi†Ei=I\sum_iE_i^\dagger E_i=I∑i​Ei†​Ei​=I, followed by branch-dependent finite LOCC maps and summation of their outputs. The resulting box is P(a,b∣x,y)=Re⁡tr⁡((Ma∣x⊗Nb∣y)L(ω))P(a,b|x,y)=\operatorname{Re}\operatorname{tr}((M_{a|x}\otimes N_{b|y})L(\omega))P(a,b∣x,y)=Retr((Ma∣x​⊗Nb∣y​)L(ω)). For any such scenario, let P\mathcal PP be all nonnegative input weights p(x,y)p(x,y)p(x,y) summing to 111, and let L\mathcal LL be all boxes Q(a,b∣x,y)=∑iwi1a=fi(x)1b=gi(y)Q(a,b|x,y)=\sum_iw_i\mathbf1_{a=f_i(x)}\mathbf1_{b=g_i(y)}Q(a,b∣x,y)=∑i​wi​1a=fi​(x)​1b=gi​(y)​ with finitely many nonnegative weights summing to 111. Define Dp(P∥Q)=∑x,yp(x,y)DKL,2(P(⋅,⋅∣x,y)∥Q(⋅,⋅∣x,y))D_p(P\|Q)=\sum_{x,y}p(x,y)D_{\mathrm{KL},2}(P(\cdot,\cdot|x,y)\|Q(\cdot,\cdot|x,y))Dp​(P∥Q)=∑x,y​p(x,y)DKL,2​(P(⋅,⋅∣x,y)∥Q(⋅,⋅∣x,y)), where the classical divergence is +∞+\infty+∞ if some positive numerator probability has zero denominator, and otherwise is the nonnegative truncation of ∑a,b:P(a,b)>0P(a,b)log⁡2(P(a,b)/Q(a,b))\sum_{a,b:P(a,b)>0}P(a,b)\log_2(P(a,b)/Q(a,b))∑a,b:P(a,b)>0​P(a,b)log2​(P(a,b)/Q(a,b)). Then Rn(ρ)=sup⁡Esup⁡p∈Pinf⁡Q∈LDp(PE,ρ⊗n∥Q)R_n(\rho)=\sup_{\mathcal E}\sup_{p\in\mathcal P}\inf_{Q\in\mathcal L}D_p(P_{\mathcal E,\rho^{\otimes n}}\|Q)Rn​(ρ)=supE​supp∈P​infQ∈L​Dp​(PE,ρ⊗n​∥Q), whereas Tn(ρ)=sup⁡Esup⁡p∈Pinf⁡σ∈Sepa,bDp(PE,ρ⊗n∥PE,σ⊗n)T_n(\rho)=\sup_{\mathcal E}\sup_{p\in\mathcal P}\inf_{\sigma\in\mathrm{Sep}_{a,b}}D_p(P_{\mathcal E,\rho^{\otimes n}}\|P_{\mathcal E,\sigma^{\otimes n}})Tn​(ρ)=supE​supp∈P​infσ∈Sepa,b​​Dp​(PE,ρ⊗n​∥PE,σ⊗n​); in the latter infimum, a single separable state σ\sigmaσ on the original a×ba\times ba×b space is repeated nnn times. Tensor powers have entries (ρ⊗n)(u,v),(u′,v′)=∏i=0n−1ρ(ui,vi),(ui′,vi′)(\rho^{\otimes n})_{(u,v),(u',v')}=\prod_{i=0}^{n-1}\rho_{(u_i,v_i),(u'_i,v'_i)}(ρ⊗n)(u,v),(u′,v′)​=∏i=0n−1​ρ(ui​,vi​),(ui′​,vi′​)​, relabeled by finite index sets. The two asymptotic quantities are R∞=lim sup⁡j→∞Rj+1/(j+1)R_\infty=\limsup_{j\to\infty}R_{j+1}/(j+1)R∞​=limsupj→∞​Rj+1​/(j+1) and T∞=lim sup⁡j→∞Tj+1/(j+1)T_\infty=\limsup_{j\to\infty}T_{j+1}/(j+1)T∞​=limsupj→∞​Tj+1​/(j+1). Finally, Sepa,b\mathrm{Sep}_{a,b}Sepa,b​ consists of finite convex combinations of products of local density matrices, and ER(ω)=inf⁡σ∈Sepa,bD2(ω∥σ)E_{\mathrm R}(\omega)=\inf_{\sigma\in\mathrm{Sep}_{a,b}}D_2(\omega\|\sigma)ER​(ω)=infσ∈Sepa,b​​D2​(ω∥σ), where D2=+∞D_2=+\inftyD2​=+∞ unless both arguments are density matrices and ker⁡σ⊆ker⁡ω\ker\sigma\subseteq\ker\omegakerσ⊆kerω; otherwise D2(ω∥σ)=max⁡{Re⁡tr⁡(ωlog⁡ω−ωlog⁡σ),0}/log⁡2D_2(\omega\|\sigma)=\max\{\operatorname{Re}\operatorname{tr}(\omega\log\omega-\omega\log\sigma),0\}/\log2D2​(ω∥σ)=max{Retr(ωlogω−ωlogσ),0}/log2, with matrix functions defined by functional calculus and the real logarithm assigned its total value 000 at zero. The transpose is ω(i,j),(k,l)T2=ω(i,l),(k,j)\omega^{T_2}_{(i,j),(k,l)}=\omega_{(i,l),(k,j)}ω(i,j),(k,l)T2​​=ω(i,l),(k,j)​, and local dimension 111 is included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me