Eqs. (8)–(11) — the congruences a_i + b_j ≡ x_i y_j (mod P) have no common solution for a prime P
ProvedBellDetEff.TwoParty.eqs_8_11_inconsistentbell-inequalitymodular-arithmeticp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a prime and let be integers with and . Then there are no residues such that
This is Case 2 of the proof of Theorem 2: if A answers on two different inputs and B answers on two different inputs, then at least one of the four corresponding coefficients of the Bell expression is .
Formalization Note The residues are elements of ZMod P, and are natural numbers cast into ZMod P.
Preamble
import Mathlib
Formal statement
namespace BellDetEff.TwoParty
/-- Eqs. (8)–(11), proof of Theorem 2 (Cao–Peng, arXiv:1607.04350v1, pp. 2–3): for a prime `P`
and `1 ≤ x₁ ≠ x₂ ≤ P`, `1 ≤ y₁ ≠ y₂ ≤ P`, no `a₁, a₂, b₁, b₂` satisfy the four congruences
`a_i + b_j ≡ x_i y_j (mod P)`. -/
theorem eqs_8_11_inconsistent (P : ℕ) [Fact P.Prime] (x₁ x₂ y₁ y₂ : ℕ)
(hx₁ : 1 ≤ x₁) (hx₁P : x₁ ≤ P) (hx₂ : 1 ≤ x₂) (hx₂P : x₂ ≤ P)
(hy₁ : 1 ≤ y₁) (hy₁P : y₁ ≤ P) (hy₂ : 1 ≤ y₂) (hy₂P : y₂ ≤ P)
(hx : x₁ ≠ x₂) (hy : y₁ ≠ y₂) (a₁ a₂ b₁ b₂ : ZMod P) :
¬ (a₁ + b₁ = (x₁ : ZMod P) * y₁ ∧ a₁ + b₂ = (x₁ : ZMod P) * y₂ ∧
a₂ + b₁ = (x₂ : ZMod P) * y₁ ∧ a₂ + b₂ = (x₂ : ZMod P) * y₂) := 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, Case 2, eqs. (8)–(11)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.