Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Application Eq. (21): continuity-based R and R_H bounds

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.continuity_nonlocality_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. Let rho be PPT on local dimensions a,b>=1 and belong to D(epsilon), with 0<epsilon<1/2 and an actual separable witness for that membership. Membership in D(epsilon) means that a normalized separable sigma on the same space satisfies ||rho^Gamma-sigma^Gamma||_1<=epsilon. Write d=ab for TOTAL bipartite dimension and h(epsilon)=-epsilon log_2(epsilon)-(1-epsilon)log_2(1-epsilon). Then

R(ρ)≤4ϵlog⁡2d+2h(ϵ),RH(ρ)≤4ϵlog⁡2d+2h(ϵ).R(\rho)\le4\epsilon\log_2d+2h(\epsilon),\qquad R_H(\rho)\le4\epsilon\log_2d+2h(\epsilon).R(ρ)≤4ϵlog2​d+2h(ϵ),RH​(ρ)≤4ϵlog2​d+2h(ϵ).

The PPT standing condition is retained from the invoked corollary. This makes both asymptotic measures small near the transposed separable set.

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 p.4, Eq.(21): standing PPT condition retained from Corollary 3.
Dimension is TOTAL bipartite dimension, logs in bits, source constant 4. -/
theorem continuity_nonlocality_bounds (a b : ℕ+) (rho : Op (Fin a × Fin b))
    (hppt : (transposeSecond rho).PosSemidef) (epsilon : ℝ)
    (hepsilon : 0 < epsilon) (hsmall : epsilon < 1/2) (hnear : rho ∈ nearSep epsilon) :
    let bound := ENNReal.ofReal (4 * epsilon * (Real.log ((a : ℝ) * (b : ℝ)) / Real.log 2) +
      2 * binEntropy2 epsilon)
    asymptoticR false rho ≤ bound ∧ asymptoticRH false rho ≤ bound := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 4, Application Eq. (21): continuity-based R and R_H bounds
Read-back

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

For all positive integers a,ba,ba,b, every complex matrix ρ\rhoρ on Ca⊗Cb\mathbb C^a\otimes\mathbb C^bCa⊗Cb, and every real 0<ϵ<120<\epsilon<\tfrac120<ϵ<21​, assume that ρΓ⪰0\rho^\Gamma\succeq0ρΓ⪰0 and that ρ\rhoρ is positive semidefinite of trace 111 and admits a separable density matrix σ\sigmaσ satisfying ∥ρΓ−σΓ∥1≤ϵ\|\rho^\Gamma-\sigma^\Gamma\|_1\le\epsilon∥ρΓ−σΓ∥1​≤ϵ. Here (XΓ)(i,j),(k,l)=X(i,l),(k,j)(X^\Gamma)_{(i,j),(k,l)}=X_{(i,l),(k,j)}(XΓ)(i,j),(k,l)​=X(i,l),(k,j)​, ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​, and a separable density matrix is a finite convex combination of tensor products of local positive semidefinite trace-111 matrices. Then

R(ρ)≤max⁡ ⁣{0, 4ϵlog⁡(ab)log⁡2+2h2(ϵ)},RH(ρ)≤max⁡ ⁣{0, 4ϵlog⁡(ab)log⁡2+2h2(ϵ)},R(\rho)\le \max\!\left\{0,\, 4\epsilon\frac{\log(ab)}{\log2}+2h_2(\epsilon)\right\}, \qquad R_H(\rho)\le \max\!\left\{0,\, 4\epsilon\frac{\log(ab)}{\log2}+2h_2(\epsilon)\right\},R(ρ)≤max{0,4ϵlog2log(ab)​+2h2​(ϵ)},RH​(ρ)≤max{0,4ϵlog2log(ab)​+2h2​(ϵ)},

where h2(t)=[−tlog⁡t−(1−t)log⁡(1−t)]/log⁡2h_2(t)=[-t\log t-(1-t)\log(1-t)]/\log2h2​(t)=[−tlogt−(1−t)log(1−t)]/log2, with zero contributions at the endpoints, and the bounds are regarded as elements of [0,+∞][0,+\infty][0,+∞]. The quantities R,RHR,R_HR,RH​ are defined as follows. A Bell experiment applies a map Φ\PhiΦ in the closure of finite LOCC maps to positive finite output dimensions, then measures local POVMs in any scenario with positive finite input and output counts; finite LOCC maps are generated by identities and finite complete local Kraus operations with outcome-dependent continuations, summing over the outcomes. Its box is Pθ(x,y,u,v)=Re⁡tr⁡[(Ax,u⊗By,v)Φ(θ)]P_\theta(x,y,u,v)=\operatorname{Re}\operatorname{tr}[(A_{x,u}\otimes B_{y,v})\Phi(\theta)]Pθ​(x,y,u,v)=Retr[(Ax,u​⊗By,v​)Φ(θ)], where each local POVM has positive semidefinite effects summing to the identity. For any box PPP, define N(P)=sup⁡πinf⁡Q∑x,yπ(x,y)Dcl,2(Pxy∥Qxy)\mathcal N(P)=\sup_\pi\inf_Q\sum_{x,y}\pi(x,y)D_{\mathrm{cl},2}(P_{xy}\|Q_{xy})N(P)=supπ​infQ​∑x,y​π(x,y)Dcl,2​(Pxy​∥Qxy​), where π\piπ ranges over nonnegative input distributions summing to 111, and QQQ ranges over finite convex combinations of deterministic boxes 1{u=f(x), v=g(y)}\mathbf1_{\{u=f(x),\,v=g(y)\}}1{u=f(x),v=g(y)}​. The classical divergence is +∞+\infty+∞ if some first-distribution entry is positive while the corresponding second-distribution entry is zero; otherwise it is the nonnegative part of ∑i:pi≠0pilog⁡(pi/qi)/log⁡2\sum_{i:p_i\ne0}p_i\log(p_i/q_i)/\log2∑i:pi​=0​pi​log(pi​/qi​)/log2. Let Rn(ρ)R_n(\rho)Rn​(ρ) be the supremum of N(Pρ[n])\mathcal N(P_{\rho^{[n]}})N(Pρ[n]​) over Bell experiments, where ρ[n]\rho^{[n]}ρ[n] is the grouped nnn-fold tensor power. Let Hn(ρ)H_n(\rho)Hn​(ρ) instead take the supremum over an experiment and a selected branch of complete finite local Kraus families after Φ\PhiΦ: for the branch ω=KΦ(ρ[n])K†\omega=K\Phi(\rho^{[n]})K^\daggerω=KΦ(ρ[n])K†, with KKK the tensor product of the selected local operators and p=Re⁡tr⁡ωp=\operatorname{Re}\operatorname{tr}\omegap=Retrω, its value is 000 if p=0p=0p=0, and p N(Pω/p)p\,\mathcal N(P_{\omega/p})pN(Pω/p​) otherwise, with the experiment’s measurements applied to the normalized branch. Finally, R(ρ)=lim sup⁡n→∞Rn(ρ)/nR(\rho)=\limsup_{n\to\infty}R_n(\rho)/nR(ρ)=limsupn→∞​Rn​(ρ)/n and RH(ρ)=lim sup⁡n→∞Hn(ρ)/nR_H(\rho)=\limsup_{n\to\infty}H_n(\rho)/nRH​(ρ)=limsupn→∞​Hn​(ρ)/n, using positive block lengths and limits in [0,+∞][0,+\infty][0,+∞].

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