Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 1, Eq. (1): partial-transpose Bell-value difference

Open
QAlgorithms.Papers.Independent.Intakethird100.P09.partialTranspose_bell_difference

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. Let rho and sigma have the same positive local dimension d, and fix the same local POVMs for both. Write S_M for the resulting Bell operator and S_M(rho) for its expectation. Then

∣SM(ρ)−SM(σ)∣≤∥SMΓ∥∞ ∥ρΓ−σΓ∥1.|S_M(\rho)-S_M(\sigma)|\le\|S_M^\Gamma\|_\infty\,\|\rho^\Gamma-\sigma^\Gamma\|_1.∣SM​(ρ)−SM​(σ)∣≤∥SMΓ​∥∞​∥ρΓ−σΓ∥1​.

The coefficients may be signed, and neither state needs to be PPT. This relates a fixed Bell-value difference to distinguishability after transposition.

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, Theorem 1, Eq.(1): general real Bell coefficients, fixed common POVMs.
Neither state is assumed PPT; the full trace norm is used. -/
theorem partialTranspose_bell_difference (d : ℕ+) (S : BellScenario) (s : BellCoefficients S)
    (rho sigma : Op (Fin d × Fin d)) (hrho : IsDensityMatrix rho)
    (hsigma : IsDensityMatrix sigma) (M : Measurements S (Fin d) (Fin d)) :
    |bellValue s (measuredBox M rho) - bellValue s (measuredBox M sigma)| ≤
      bellOperatorNorm (transposeSecond (bellOperator s M)) *
        traceNorm (transposeSecond rho - transposeSecond sigma) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P09

end
Source
Bounds on quantum nonlocality via partial transposition, arXiv:1407.6999v3, PDF p. 2, Theorem 1, Eq. (1): partial-transpose Bell-value difference
Read-back

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

Let ddd be any positive integer, let X,Y,A,BX,Y,A,BX,Y,A,B be finite index sets of specified positive sizes forming a Bell scenario, and let sxyabs_{xyab}sxyab​ be arbitrary real coefficients. Let ρ,σ\rho,\sigmaρ,σ be positive semidefinite complex matrices of trace 111 on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd. For every pair of measurement families Ma∣x,Nb∣yM_{a|x},N_{b|y}Ma∣x​,Nb∣y​ on Cd\mathbb C^dCd, with every effect positive semidefinite and ∑aMa∣x=I\sum_aM_{a|x}=I∑a​Ma∣x​=I, ∑bNb∣y=I\sum_bN_{b|y}=I∑b​Nb∣y​=I, define Pω(a,b∣x,y)=Re⁡tr⁡((Ma∣x⊗Nb∣y)ω)P_\omega(a,b|x,y)=\operatorname{Re}\operatorname{tr}((M_{a|x}\otimes N_{b|y})\omega)Pω​(a,b∣x,y)=Retr((Ma∣x​⊗Nb∣y​)ω), Bs(P)=∑x,y,a,bsxyabP(a,b∣x,y)B_s(P)=\sum_{x,y,a,b}s_{xyab}P(a,b|x,y)Bs​(P)=∑x,y,a,b​sxyab​P(a,b∣x,y), and Bs,M,N=∑x,y,a,bsxyabMa∣x⊗Nb∣yB_{s,M,N}=\sum_{x,y,a,b}s_{xyab}M_{a|x}\otimes N_{b|y}Bs,M,N​=∑x,y,a,b​sxyab​Ma∣x​⊗Nb∣y​. If 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)​ denotes transpose on the second factor, then

∣Bs(Pρ)−Bs(Pσ)∣≤∥T2(Bs,M,N)∥  ∥T2(ρ)−T2(σ)∥1.|B_s(P_\rho)-B_s(P_\sigma)| \le \|T_2(B_{s,M,N})\|\;\|T_2(\rho)-T_2(\sigma)\|_1.∣Bs​(Pρ​)−Bs​(Pσ​)∣≤∥T2​(Bs,M,N​)∥∥T2​(ρ)−T2​(σ)∥1​.

Here the first norm is the ambient matrix norm appearing in the definition of bellOperatorNorm, and ∥Z∥1=Re⁡tr⁡Z†Z\|Z\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Z^\dagger Z}∥Z∥1​=RetrZ†Z​. There is no sign restriction on the coefficients, and d=1d=1d=1 and 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