Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 2: corrected nonnegative-coefficient version

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.nearSep_uniform_bell_bound

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. Fix positive local dimension d, epsilon>0, and nonnegative Bell coefficients. Define D(epsilon) using normalized states with an actual separable witness sigma satisfying the full-norm bound on their partial transposes. Then

sup⁡ρ∈D(ϵ)QS(ρ)≤C(S)+ϵQ(S).\sup_{\rho\in D(\epsilon)}Q_S(\rho)\le C(S)+\epsilon Q(S).ρ∈D(ϵ)sup​QS​(ρ)≤C(S)+ϵQ(S).

The state supremum has this fixed dimension, while Q(S) remains dimension-unrestricted. This corrected nonnegative-coefficient version gives a uniform bound for the near-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.3, Corollary 2, Eq.(6), CORRECTED to nonnegative Bell coefficients.
Dimension is fixed before taking the state supremum; Q(S) remains unrestricted. -/
theorem nearSep_uniform_bell_bound (d : ℕ+) (S : BellScenario) (s : BellCoefficients S)
    (hs : ∀ x y a b, 0 ≤ s x y a b) (epsilon : ℝ) (hepsilon : 0 < epsilon) :
    sSup {v : ℝ | ∃ rho : Op (Fin d × Fin d), rho ∈ nearSep epsilon ∧
      v = stateValue s rho} ≤ classicalBound s + epsilon * quantumBound s := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 3, Corollary 2: corrected nonnegative-coefficient version
Read-back

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

For every positive integer ddd, every Bell scenario with positive finite input and output sizes, every family of nonnegative real Bell coefficients sxyabs_{xyab}sxyab​, and every real ϵ>0\epsilon>0ϵ>0,

sup⁡ρ∈NϵVs(ρ)≤Cs+ϵQs.\sup_{\rho\in\mathcal N_\epsilon}V_s(\rho)\le C_s+\epsilon Q_s.ρ∈Nϵ​sup​Vs​(ρ)≤Cs​+ϵQs​.

Here Nϵ\mathcal N_\epsilonNϵ​ consists of positive semidefinite trace-111 matrices ρ\rhoρ on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd admitting a finite separable density matrix τ=∑jwjAj⊗Bj\tau=\sum_jw_jA_j\otimes B_jτ=∑j​wj​Aj​⊗Bj​ with ∥T2(ρ)−T2(τ)∥1≤ϵ\|T_2(\rho)-T_2(\tau)\|_1\le\epsilon∥T2​(ρ)−T2​(τ)∥1​≤ϵ, where wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and Aj,BjA_j,B_jAj​,Bj​ are positive semidefinite of trace 111. The transpose is T2(Z)(i,j),(k,l)=Z(i,l),(k,j)T_2(Z)_{(i,j),(k,l)}=Z_{(i,l),(k,j)}T2​(Z)(i,j),(k,l)​=Z(i,l),(k,j)​, and ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​. The quantity Vs(ρ)V_s(\rho)Vs​(ρ) is the supremum over local measurement effects Ma∣x,Nb∣y≥0M_{a|x},N_{b|y}\ge0Ma∣x​,Nb∣y​≥0, summing to the identity for each input, of ∑x,y,a,bsxyabRe⁡tr⁡((Ma∣x⊗Nb∣y)ρ)\sum_{x,y,a,b}s_{xyab}\operatorname{Re}\operatorname{tr}((M_{a|x}\otimes N_{b|y})\rho)∑x,y,a,b​sxyab​Retr((Ma∣x​⊗Nb∣y​)ρ); CsC_sCs​ is the supremum of ∑x,ysxy,f(x),g(y)\sum_{x,y}s_{xy,f(x),g(y)}∑x,y​sxy,f(x),g(y)​ over deterministic functions f,gf,gf,g; and QsQ_sQs​ is the supremum of the measured expression over all positive finite local dimensions, all density matrices, and all such measurements. The supremum on the left is the real supremum specified in the declaration; d=1d=1d=1 and identically zero coefficients are 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