Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Ordering and positivity of statistical strengths

Proved
QAlgorithms.Papers.Independent.Intakethird100.P80.fact1

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

prove2quantum

Fix a finite quantum experiment QQQ, with nonempty setting and outcome alphabets. A local theory is any probability law on all potential outcomes; its predictions are coordinate marginals. Let U(σ,π)=D2(Qσ∥Pσ;π)U(\sigma,\pi)=D_2(Q_\sigma\|P_{\sigma;\pi})U(σ,π)=D2​(Qσ​∥Pσ;π​), with the same setting law on both sides. Define u(σ)=inf⁡πU(σ,π)u(\sigma)=\inf_\pi U(\sigma,\pi)u(σ)=infπ​U(σ,π), SUNI=u(σ∘)S^{\rm UNI}=u(\sigma^\circ)SUNI=u(σ∘) for uniform settings, SUC=sup⁡σ productu(σ)S^{\rm UC}=\sup_{\sigma\text{ product}}u(\sigma)SUC=supσ product​u(σ), and SCOR=sup⁡σu(σ)S^{\rm COR}=\sup_\sigma u(\sigma)SCOR=supσ​u(σ). Then

SUNI≤SUC≤SCOR,SUNI>0 ⟺ Q has no local model.S^{\rm UNI}\le S^{\rm UC}\le S^{\rm COR},\qquad S^{\rm UNI}>0\ \Longleftrightarrow\ Q\text{ has no local model}.SUNI≤SUC≤SCOR,SUNI>0 ⟺ Q has no local model.

This relates the three experimental freedoms and detects proper nonlocality. All divergences are in bits and may initially take the value +∞+\infty+∞.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P80
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P80

open scoped BigOperators ENNReal Topology Classical

open MeasureTheory Filter

/-- PDF p.8, Fact 1: ordering and strict positivity of the UNIFORM strength. -/
theorem fact1 {S : BellExperiment} (Q : Table S) (hQ : NonlocalityProof Q) :
    uniformStrength Q ≤ uncorrelatedStrength Q ∧
    uncorrelatedStrength Q ≤ correlatedStrength Q ∧
    (0 < uniformStrength Q ↔ Proper Q) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P80

end
Source
The statistical strength of nonlocality proofs, arXiv:quant-ph/0307125v2, PDF p. 8, Fact 1: ordering and positivity of statistical strengths
Read-back

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

For every Bell experiment SSS with k>0k>0k>0 parties, positive finite setting counts, and positive finite outcome counts at every local setting, let A\mathcal AA be its joint settings, Xa\mathcal X_aXa​ its joint outcomes at aaa, and V\mathcal VV its assignments of outcomes to every local setting, with v(a)v(a)v(a) denoting the selected joint outcome. Let Q(a,x)Q(a,x)Q(a,x) be a real table satisfying all three following hypotheses: for each aaa, its entries are nonnegative and ∑x∈XaQ(a,x)=1\sum_{x\in\mathcal X_a}Q(a,x)=1∑x∈Xa​​Q(a,x)=1; for every subset JJJ of parties, every pair a,ba,ba,b of joint settings agreeing on JJJ, and every v∈Vv\in\mathcal Vv∈V, the sums of Q(a,x)Q(a,x)Q(a,x) over outcomes satisfying xi=vi(ai)x_i=v_i(a_i)xi​=vi​(ai​) for all i∈Ji\in Ji∈J and of Q(b,x)Q(b,x)Q(b,x) over outcomes satisfying xi=vi(bi)x_i=v_i(b_i)xi​=vi​(bi​) for all i∈Ji\in Ji∈J are equal; and there exist positive integers did_idi​, a positive semidefinite complex matrix ρ\rhoρ of trace one indexed by ∏i{0,…,di−1}\prod_i\{0,\ldots,d_i-1\}∏i​{0,…,di​−1}, and, for every party iii and local setting ccc, positive semidefinite matrices Mi,c,zM_{i,c,z}Mi,c,z​ indexed by {0,…,di−1}\{0,\ldots,d_i-1\}{0,…,di​−1}, summing to the identity over its local outcomes zzz, such that

Q(a,x)=Re⁡tr⁡(Ea,xρ),Ea,x(u,w)=∏iMi,ai,xi(ui,wi).Q(a,x)=\operatorname{Re}\operatorname{tr}(E_{a,x}\rho), \qquad E_{a,x}(u,w)=\prod_i M_{i,a_i,x_i}(u_i,w_i).Q(a,x)=Retr(Ea,x​ρ),Ea,x​(u,w)=i∏​Mi,ai​,xi​​(ui​,wi​).

For a probability distribution ppp on V\mathcal VV, put Lp(a,x)=∑v: v(a)=xp(v)L_p(a,x)=\sum_{v:\,v(a)=x}p(v)Lp​(a,x)=∑v:v(a)=x​p(v). For a probability distribution sss on A\mathcal AA, define DQ,s(p)=+∞D_{Q,s}(p)=+\inftyDQ,s​(p)=+∞ if some trial has s(a)Q(a,x)>0s(a)Q(a,x)>0s(a)Q(a,x)>0 and s(a)Lp(a,x)=0s(a)L_p(a,x)=0s(a)Lp​(a,x)=0; otherwise define it as the nonnegative truncation of

∑a,x{0,s(a)Q(a,x)=0,s(a)Q(a,x)log⁡2 ⁣s(a)Q(a,x)s(a)Lp(a,x),s(a)Q(a,x)≠0.\sum_{a,x} \begin{cases} 0,&s(a)Q(a,x)=0,\\ s(a)Q(a,x)\log_2\!\dfrac{s(a)Q(a,x)}{s(a)L_p(a,x)},&s(a)Q(a,x)\ne0. \end{cases}a,x∑​⎩⎨⎧​0,s(a)Q(a,x)log2​s(a)Lp​(a,x)s(a)Q(a,x)​,​s(a)Q(a,x)=0,s(a)Q(a,x)=0.​

Let FQ(s)=inf⁡p≥0, ∑vp(v)=1DQ,s(p)F_Q(s)=\inf_{p\ge0,\ \sum_vp(v)=1}D_{Q,s}(p)FQ​(s)=infp≥0, ∑v​p(v)=1​DQ,s​(p), let u(a)=1/∣A∣u(a)=1/|\mathcal A|u(a)=1/∣A∣, let UQ=FQ(u)U_Q=F_Q(u)UQ​=FQ​(u), let IQI_QIQ​ be the supremum of FQ(s)F_Q(s)FQ​(s) over all distributions of the form s(a)=∏isi(ai)s(a)=\prod_i s_i(a_i)s(a)=∏i​si​(ai​) with each sis_isi​ a local setting probability distribution, and let CQC_QCQ​ be the supremum of FQ(s)F_Q(s)FQ​(s) over all joint setting probability distributions. Then, as extended nonnegative real inequalities and a logical equivalence,

UQ≤IQ,IQ≤CQ,0<UQ ⟺ ¬∃p:V→R (p≥0 ∧ ∑vp(v)=1 ∧ ∀a,x, Lp(a,x)=Q(a,x)).U_Q\le I_Q,\qquad I_Q\le C_Q,\qquad 0<U_Q\ \Longleftrightarrow\ \neg\exists p:\mathcal V\to\mathbb R\ \left(p\ge0\ \land\ \sum_vp(v)=1\ \land\ \forall a,x,\ L_p(a,x)=Q(a,x)\right).UQ​≤IQ​,IQ​≤CQ​,0<UQ​ ⟺ ¬∃p:V→R (p≥0 ∧ v∑​p(v)=1 ∧ ∀a,x, Lp​(a,x)=Q(a,x)).

All setting and potential distributions may have zero coordinates, the marginal-consistency hypothesis includes the empty subset of parties, and the infima and suprema do not assert attainment.

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