Eq. (15) — the witness box under efficiency η has Bell value η²(M_A M_B − 1) − η(M_A + M_B − 2)
ProvedBellDetEff.TwoParty.eq_15bell-inequalitydetection-efficiencyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a prime and integers with and . Let be the box of eq. (13) and the corresponding behaviour under detector efficiency (eq. (2)). Then for every real , the Bell expression (6) evaluates to
Since the expression is at most for every local hidden variable model, cannot be simulated locally as soon as this value is positive, i.e. for ; this is how the paper concludes Theorem 2.
Formalization Note The identity is polynomial in and is stated for every real . The hypotheses are not needed for the identity and are kept for uniformity with the other results; is needed for the count .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.