Lemma 1 — (corrected: transposed tables)
ProvedNoSignalPA.lemma_1cryptographynonlocalityp2o-correctedp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1privacy-amplificationquantum-information
Let , with entries , satisfy the no-signaling equations of Alice's systems and of Bob taken as one system:
- for each , every , every bit and all : ;
- does not depend on .
Then for every and every ,
For a nonsignaling box the left side is Alice's marginal , so the probability of each raw key is a fixed linear functional of the box. The proof of the main result applies it to at fixed .
Differences from the source:
- correction: |Γ_a⟩ built from the tables |γ₀⟩, |γ₁⟩ printed in Lemma 1 (p. 2) → |Γ_a⟩ built from their transposes (gammaCoef); reason: the printed tables are transposed relative to layout (3): for Nr = 1 and the nonsignaling box a = 1 ⊕ x, b = 0, P_{a=0|x=0} = 0 but the printed ⟨γ₀|P⟩ = 1; with the transposes Lemma 1 holds
- generalization: an (Nr + 1)-partite nonsignaling distribution P_{a,b|x,y} → any real vector Q satisfying the homogeneous no-signaling equations of Alice's Nr systems and of Bob as one system; reason: a nonsignaling box satisfies these equations; Q = P gives the paper's statement
- encoding: P_{a|x=0} → Σ_b Q(s, b, 0, y) for every y; reason: this is Alice's marginal; by Bob's no-signaling equation it does not depend on y
Preamble
import Mathlib import Definitions.Def_NoSignalPA_pairing import Definitions.Def_NoSignalPA_gammaVec
Formal statement
namespace NoSignalPA
/-- **Lemma 1 (corrected: transposed tables): `P_{a|x=0} = ⟨Γ_a|P_{a,b|x,y}⟩`.**
Ll. Masanes, *Universally-composable privacy amplification from causality constraints*,
arXiv:0807.2158v4, Lemma 1, p. 2 (PDF p. 2), proved in the Appendix, p. 4: "For any `(Nr + 1)`-partite
nonsignaling distribution `P_{a,b|x,y}` we have `P_{a|x=0} = ⟨Γ_a|P_{a,b|x,y}⟩`, where
`|Γ_a⟩ = |γ_{a1}⟩ ⊗ · · · ⊗ |γ_{aNr}⟩`".
Let `Q(a, b, x, y)` be any real vector of `ℝ^{16^{Nr}}` satisfying the homogeneous no-signaling
equations of Alice's `Nr` systems (`hA`) and of Bob as one system (`hB`). Then for every `s` and
every `y`, `Σ_b Q(s, b, 0, y) = ⟨Γ_s|Q⟩`.
**Formalization Note.** (1) Correction: `Γ_s` is built from the transposes of the printed
tables (`gammaCoef`); with the printed ones the lemma fails for the box `a = 1 ⊕ x`, `b = 0` at
`Nr = 1`. (2) Generalization: `Q` need not be nonnegative or normalized; a nonsignaling box
`P_{a,b|x,y}` is the case `Q = P`, and the left side is then `P_{a=s|x=0}` (read at any `y`). The
proof of the main result uses `Q = P_{a,b,e|x,y,z}` at fixed `e, z`. -/
theorem lemma_1 {Nr : ℕ} (Q : Str Nr → Str Nr → Str Nr → Str Nr → ℝ)
(hA : ∀ (i : Fin Nr) (x : Str Nr) (c : Bool) (y a b : Str Nr),
∑ t : Bool, Q (Function.update a i t) b x y
= ∑ t : Bool, Q (Function.update a i t) b (Function.update x i c) y)
(hB : ∀ (a x y y' : Str Nr), ∑ b : Str Nr, Q a b x y = ∑ b : Str Nr, Q a b x y')
(s y : Str Nr) :
∑ b : Str Nr, Q s b (fun _ => false) y = pairing (gammaVec s) Q := by sorry
end NoSignalPA
Source
Masanes, Universally-composable privacy amplification from causality constraints, arXiv:0807.2158v4, Lemma 1, p.2 (proof in the Appendix, p.4)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.