Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — for η1 < η2, if p^NS_η2 is LHV-simulable then so is p^NS_η1

Proved
BellDetEff.TwoParty.lemma_1

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

detection-efficiencylocal-hidden-variablesp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ppp be a no-signaling behaviour with finite output alphabets, and let 0≤η1<η2≤10\le\eta_1<\eta_2\le 10≤η1​<η2​≤1. If the behaviour pη2p_{\eta_2}pη2​​ under detector efficiency η2\eta_2η2​ (eq. (2)) can be simulated by a local hidden variable model, then so can pη1p_{\eta_1}pη1​​.

Local simulability is therefore monotone in the detector efficiency, which is what makes the threshold e(p)e(p)e(p) and the bound ηNS∗\eta^*_{NS}ηNS∗​ of eq. (A3) meaningful: the set of efficiencies with a local model is an interval starting at 000.

Formalization Note The range 0≤η10\le\eta_10≤η1​, η2≤1\eta_2\le 1η2​≤1 is implicit in the paper (efficiencies are probabilities); outside [0,1][0,1][0,1] 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
  • 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