Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (7)–(12) — I_{M_A M_B (P+1)(P+1)} ≤ 0 for every deterministic local strategy

Proved
BellDetEff.TwoParty.cases_1_3_deterministic

by mikedeng1 · Oct 20, 2026 · Mathlib 0df444a (Lean v4.33.1)

bell-inequalitylocal-hidden-variablesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a prime with P≥max⁡(MA,MB)P\ge\max(M_A,M_B)P≥max(MA​,MB​). Let FFF map A's inputs {1,…,MA}\{1,\dots,M_A\}{1,…,MA​} to outputs in {0,…,P−1}∪{Φ}\{0,\dots,P-1\}\cup\{\Phi\}{0,…,P−1}∪{Φ} and GGG map B's inputs {1,…,MB}\{1,\dots,M_B\}{1,…,MB​} to outputs in {0,…,P−1}∪{Φ}\{0,\dots,P-1\}\cup\{\Phi\}{0,…,P−1}∪{Φ}, and let pF,G(a,b∣x,y)=[F(x)=a] [G(y)=b]p_{F,G}(a,b\mid x,y)=[F(x)=a]\,[G(y)=b]pF,G​(a,b∣x,y)=[F(x)=a][G(y)=b] be the deterministic local behaviour (eq. (7)). Then the Bell expression of eq. (6) satisfies

IMAMB(P+1)(P+1)(pF,G)≤0.I_{M_AM_B(P+1)(P+1)}(p_{F,G})\le 0.IMA​MB​(P+1)(P+1)​(pF,G​)≤0.

This is the content of Cases 1–3 of the proof of Theorem 2 (the cases where A or B always outputs Φ\PhiΦ, where both answer on at least two inputs, and where one of them answers on exactly one input).

Formalization Note This states the conclusion of Case 3 as true. The middle equality of the paper's display (12) holds only when G(y)≠ΦG(y)\ne\PhiG(y)=Φ for every y≠1y\ne 1y=1 (a yyy with G(y)=ΦG(y)=\PhiG(y)=Φ contributes 000 rather than −1-1−1); the inequality ≤0\le 0≤0 holds in every case. PPP is any prime with MA,MB≤PM_A,M_B\le PMA​,MB​≤P, not only the minimal one.

Preamble
import Mathlib
import Definitions.Def_BellDetEff_TwoParty_BellInequality
Formal statement
namespace BellDetEff.TwoParty

/-- Cases 1–3, proof of Theorem 2 (Cao–Peng, arXiv:1607.04350v1, pp. 2–3, eqs. (7)–(12)): for a
prime `P ≥ max(MA, MB)` and every deterministic local strategy `F(x) = a`, `G(y) = b` with outputs
in `{0, …, P − 1} ∪ {Φ}`, the Bell expression (6) is at most `0`. -/
theorem cases_1_3_deterministic (P MA MB : ℕ) [Fact P.Prime] (hAP : MA ≤ P) (hBP : MB ≤ P)
    (F : Fin MA → Option (Fin P)) (G : Fin MB → Option (Fin P)) :
    bellValue P (deterministic F G) ≤ 0 := by sorry

end BellDetEff.TwoParty
Source
Cao & Peng, Tight detection efficiency bounds of Bell tests in no-signaling theories, arXiv:1607.04350v1, pp. 2–3, proof of Theorem 2, eqs. (7)–(12), Cases 1–3
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me