Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 1: corrected nonnegative-coefficient version

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.separable_distance_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. Assume every coefficient of S is nonnegative and rho has positive equal local dimensions. Let SEP denote the normalized separable states on that same space. Then

QS(ρ)≤C(S)+Q(S)inf⁡σ∈SEP∥ρΓ−σΓ∥1=C(S)+Q(S)inf⁡σ∈SEP∥ρΓ−σ∥1.Q_S(\rho)\le C(S)+Q(S)\inf_{\sigma\in\mathrm{SEP}}\|\rho^\Gamma-\sigma^\Gamma\|_1=C(S)+Q(S)\inf_{\sigma\in\mathrm{SEP}}\|\rho^\Gamma-\sigma\|_1.QS​(ρ)≤C(S)+Q(S)σ∈SEPinf​∥ρΓ−σΓ∥1​=C(S)+Q(S)σ∈SEPinf​∥ρΓ−σ∥1​.

The equality of the two infima is included. This is an explicitly corrected restriction of the printed unrestricted claim; it bounds fixed-state nonlocality by distance to SEP.

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.2,6--7, Corollary 1, Eq.(4), CORRECTED domain: all coefficients nonnegative.
Printed unrestricted signed formula is false. Also retains the equivalent untransposed-SEP form. -/
theorem separable_distance_bell_bound (d : ℕ+) (S : BellScenario) (s : BellCoefficients S)
    (hs : ∀ x y a b, 0 ≤ s x y a b) (rho : Op (Fin d × Fin d))
    (hrho : IsDensityMatrix rho) :
    stateValue s rho ≤ classicalBound s + quantumBound s * sepDistance rho ∧
    sepDistance rho = sepDistanceUntransposed rho ∧
    stateValue s rho ≤ classicalBound s + quantumBound s * sepDistanceUntransposed rho := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 2, Corollary 1: 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 numbers of inputs and outputs, every family of real coefficients sxyab≥0s_{xyab}\ge0sxyab​≥0, and every positive semidefinite trace-111 matrix ρ\rhoρ on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd, the following three assertions hold:

Vs(ρ)≤Cs+QsD(ρ),D(ρ)=D′(ρ),Vs(ρ)≤Cs+QsD′(ρ).V_s(\rho)\le C_s+Q_sD(\rho),\qquad D(\rho)=D'(\rho),\qquad V_s(\rho)\le C_s+Q_sD'(\rho).Vs​(ρ)≤Cs​+Qs​D(ρ),D(ρ)=D′(ρ),Vs​(ρ)≤Cs​+Qs​D′(ρ).

Here Vs(ρ)V_s(\rho)Vs​(ρ) is the real supremum, over all local positive semidefinite measurement effects 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 output functions f,gf,gf,g; and QsQ_sQs​ is the supremum of the same measured Bell expression over all positive finite local dimensions, all positive semidefinite trace-111 bipartite matrices, and all such local measurements. With 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 two distances are D(ρ)=inf⁡τ∈Sepd∥T2(ρ)−T2(τ)∥1D(\rho)=\inf_{\tau\in\mathrm{Sep}_d}\|T_2(\rho)-T_2(\tau)\|_1D(ρ)=infτ∈Sepd​​∥T2​(ρ)−T2​(τ)∥1​ and D′(ρ)=inf⁡τ∈Sepd∥T2(ρ)−τ∥1D'(\rho)=\inf_{\tau\in\mathrm{Sep}_d}\|T_2(\rho)-\tau\|_1D′(ρ)=infτ∈Sepd​​∥T2​(ρ)−τ∥1​. The set Sepd\mathrm{Sep}_dSepd​ consists exactly of finite sums τ=∑jwjAj⊗Bj\tau=\sum_jw_jA_j\otimes B_jτ=∑j​wj​Aj​⊗Bj​, where wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and all Aj,BjA_j,B_jAj​,Bj​ are positive semidefinite of trace 111. The case d=1d=1d=1, zero coefficients, and scenarios with one-element input or output sets 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