Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (15) — the witness box under efficiency η has Bell value η²(M_A M_B − 1) − η(M_A + M_B − 2)

Proved
BellDetEff.TwoParty.eq_15

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

bell-inequalitydetection-efficiencyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let PPP be a prime and MA,MBM_A,M_BMA​,MB​ integers with 1≤MA≤P1\le M_A\le P1≤MA​≤P and 1≤MB≤P1\le M_B\le P1≤MB​≤P. Let pNSp^{NS}pNS be the box of eq. (13) and pηNSp^{NS}_\etapηNS​ the corresponding behaviour under detector efficiency η\etaη (eq. (2)). Then for every real η\etaη, the Bell expression (6) evaluates to

IMAMB(P+1)(P+1)(pηNS)=η2(MAMB−1)−η(MA+MB−2).I_{M_AM_B(P+1)(P+1)}(p^{NS}_\eta)=\eta^2(M_AM_B-1)-\eta(M_A+M_B-2).IMA​MB​(P+1)(P+1)​(pηNS​)=η2(MA​MB​−1)−η(MA​+MB​−2).

Since the expression is at most 000 for every local hidden variable model, pηNSp^{NS}_\etapηNS​ cannot be simulated locally as soon as this value is positive, i.e. for η>(MA+MB−2)/(MAMB−1)\eta>(M_A+M_B-2)/(M_AM_B-1)η>(MA​+MB​−2)/(MA​MB​−1); this is how the paper concludes Theorem 2.

Formalization Note The identity is polynomial in η\etaη and is stated for every real η\etaη. The hypotheses MA,MB≤PM_A,M_B\le PMA​,MB​≤P are not needed for the identity and are kept for uniformity with the other results; MA,MB≥1M_A,M_B\ge 1MA​,MB​≥1 is needed for the count MAMB−1M_AM_B-1MA​MB​−1.

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

/-- Eq. (15), proof of Theorem 2 (Cao–Peng, arXiv:1607.04350v1, p. 3): the Bell value (6) of the
witness behaviour (13) under detector efficiency `η`, for a prime `P` and `1 ≤ MA, MB ≤ P`, is `η²(MA MB − 1) − η(MA + MB − 2)`. -/
theorem eq_15 (P MA MB : ℕ) [Fact P.Prime] (hA : 1 ≤ MA) (hB : 1 ≤ MB) (hAP : MA ≤ P)
    (hBP : MB ≤ P) (η : ℝ) :
    bellValue P (withEff (witnessBox P MA MB) η) =
      η ^ 2 * ((MA : ℝ) * MB - 1) - η * ((MA : ℝ) + MB - 2) := by sorry

end BellDetEff.TwoParty
Source
Cao & Peng, Tight detection efficiency bounds of Bell tests in no-signaling theories, arXiv:1607.04350v1, p. 3, proof of Theorem 2, eq. (15)
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