Eqs. (7)–(12) — I_{M_A M_B (P+1)(P+1)} ≤ 0 for every deterministic local strategy
ProvedBellDetEff.TwoParty.cases_1_3_deterministicbell-inequalitylocal-hidden-variablesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a prime with . Let map A's inputs to outputs in and map B's inputs to outputs in , and let be the deterministic local behaviour (eq. (7)). Then the Bell expression of eq. (6) satisfies
This is the content of Cases 1–3 of the proof of Theorem 2 (the cases where A or B always outputs , 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 for every (a with contributes rather than ); the inequality holds in every case. is any prime with , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.