Proof of Theorem 2 — every LHV behaviour satisfies I_{M_A M_B (P+1)(P+1)} ≤ 0
ProvedBellDetEff.TwoParty.lhv_boundbell-inequalitylocal-hidden-variablesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a prime with , and let be a behaviour with inputs , and outputs in for each party. If can be simulated by a local hidden variable model, i.e.
for some probability space and measurable local response probabilities, then
This is the local bound of the Bell inequality (6), the first half of the proof of Theorem 2. It holds for arbitrary hidden-variable spaces, not only for finite mixtures of deterministic strategies.
Formalization Note The marginals in the Bell expression are averages over the other party's input; for an LHV behaviour they agree with the marginal at every fixed input of the other party. is any prime with .
Preamble
import Mathlib import Definitions.Def_BellDetEff_TwoParty_BellInequality
Formal statement
namespace BellDetEff.TwoParty
/-- The LHV bound, proof of Theorem 2 (Cao–Peng, arXiv:1607.04350v1, p. 2): for a prime
`P ≥ max(MA, MB)`, every behaviour with outputs `{0, …, P − 1} ∪ {Φ}` that can be simulated by an
LHV model (eq. (3)) satisfies `I_{M_A M_B (P+1)(P+1)} ≤ 0`. -/
theorem lhv_bound (P MA MB : ℕ) [Fact P.Prime] (hAP : MA ≤ P) (hBP : MB ≤ P)
(p : Option (Fin P) → Option (Fin P) → Fin MA → Fin MB → ℝ) (hp : LHVSimulable p) :
bellValue P p ≤ 0 := by sorry
end BellDetEff.TwoParty
Source
Cao & Peng, Tight detection efficiency bounds of Bell tests in no-signaling theories, arXiv:1607.04350v1, p. 2, proof of Theorem 2 ("First, we prove I ≤ 0 with LHV strategies")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.