Lemma 1 — for η1 < η2, if p^NS_η2 is LHV-simulable then so is p^NS_η1
ProvedBellDetEff.TwoParty.lemma_1detection-efficiencylocal-hidden-variablesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a no-signaling behaviour with finite output alphabets, and let . If the behaviour under detector efficiency (eq. (2)) can be simulated by a local hidden variable model, then so can .
Local simulability is therefore monotone in the detector efficiency, which is what makes the threshold and the bound of eq. (A3) meaningful: the set of efficiencies with a local model is an interval starting at .
Formalization Note The range , is implicit in the paper (efficiencies are probabilities); outside the behaviour of eq. (2) has negative entries. LHV models range over arbitrary probability spaces.
Preamble
import Mathlib import Definitions.Def_BellDetEff_TwoParty_Efficiency
Formal statement
namespace BellDetEff.TwoParty
/-- Lemma 1 (Cao–Peng, arXiv:1607.04350v1, p. 5): for efficiencies `0 ≤ η₁ < η₂ ≤ 1`, if
`p^NS_{η₂}` can be simulated by an LHV model, then so can `p^NS_{η₁}`. -/
theorem lemma_1 {KA KB MA MB : ℕ} (p : Fin KA → Fin KB → Fin MA → Fin MB → ℝ)
(hp : IsBehaviour p) (hns : NoSignaling p) (η₁ η₂ : ℝ) (h₁ : 0 ≤ η₁) (h₁₂ : η₁ < η₂)
(h₂ : η₂ ≤ 1) (hsim : LHVSimulable (withEff p η₂)) :
LHVSimulable (withEff p η₁) := by sorry
end BellDetEff.TwoParty
Source
Cao & Peng, Tight detection efficiency bounds of Bell tests in no-signaling theories, arXiv:1607.04350v1, p. 5, Appendix A, Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.