Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — in two-party Bell tests with M_A and M_B inputs, η*_NS ≤ (M_A + M_B − 2)/(M_A M_B − 1)

Proved
BellDetEff.TwoParty.theorem_2

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

bell-nonlocalitydetection-efficiencyno-signalingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider two-party Bell tests in which A has MAM_AMA​ inputs and B has MBM_BMB​ inputs, with MA,MB≥1M_A,M_B\ge 1MA​,MB​≥1 and MAMB≥2M_AM_B\ge 2MA​MB​≥2. Let ηNS∗(MA,MB)\eta^*_{NS}(M_A,M_B)ηNS∗​(MA​,MB​) be the efficiency bound of eq. (A3): the infimum, over all no-signaling behaviours with these inputs and arbitrary finite output alphabets, of the largest detector efficiency at which the behaviour can still be simulated by a local hidden variable model. Then

ηNS∗(MA,MB)≤MA+MB−2MAMB−1.\eta^*_{NS}(M_A,M_B)\le\frac{M_A+M_B-2}{M_AM_B-1}.ηNS∗​(MA​,MB​)≤MA​MB​−1MA​+MB​−2​.

Together with the matching lower bound of Theorem 1 (obtained in the paper by citing a local model of Massar and Pironio), this shows that (MA+MB−2)/(MAMB−1)(M_A+M_B-2)/(M_AM_B-1)(MA​+MB​−2)/(MA​MB​−1) is the exact detection-efficiency threshold for demonstrating the nonlocality of the maximally nonlocal no-signaling theory with two parties. In particular it tends to 000 as the number of inputs grows.

Formalization Note The hypotheses MA,MB≥1M_A,M_B\ge 1MA​,MB​≥1 and MAMB≥2M_AM_B\ge 2MA​MB​≥2 are implicit in the paper. At MA=MB=1M_A=M_B=1MA​=MB​=1 the right-hand side is 0/00/00/0, which Lean evaluates to 000, and the claim would be false: with one input each, every behaviour is local and e=1e=1e=1. The bound is a real number, with no natural-number subtraction. ηNS∗\eta^*_{NS}ηNS∗​ is the infimum over all output alphabets and all no-signaling behaviours, and local hidden variable models range over arbitrary probability spaces with measurable response functions.

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

/-- Theorem 2 (Cao–Peng, arXiv:1607.04350v1, p. 2, eq. (5)): in two-party Bell tests with `MA`
and `MB` inputs, `η*_NS ≤ (MA + MB − 2)/(MA MB − 1)`. -/
theorem theorem_2 (MA MB : ℕ) (hA : 1 ≤ MA) (hB : 1 ≤ MB) (hAB : 2 ≤ MA * MB) :
    etaStarNS MA MB ≤ ((MA : ℝ) + MB - 2) / ((MA : ℝ) * MB - 1) := by sorry

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