Lemma 2 (Straddling Lemma), p. 42 — for ∅ ⊊ I ⊊ [k], ∏_{i∈I} α_i and ∏_{i∈I′} α′_i are distinct multilinear monomials in the γ's
ProvedGGHRSW.ColoredMatrix.lemma_2Fix an integer and formal variables . Set
with index arithmetic modulo . For any subsets with , the products
are multilinear monomials in , and they are distinct.
The bundling of the scalars along a block of steps is what prevents an adversary from combining an inconsistent assignment of a block in the primal program with any part of the dummy program; this lemma is the combinatorial core of that argument.
Formalization Note. Monomials are represented by their exponent vectors in (finitely supported functions on ), with 0-based indices: for become coordinates and for , and becomes coordinate . "Multilinear" is the statement that every exponent is at most . The page's random drawing of the 's "" plays no role in the statement, which is about formal monomials, and is omitted.
import Mathlib
namespace GGHRSW.ColoredMatrix
theorem lemma_2 (k : ℕ) (I I' : Finset (Fin k)) (hI : I.Nonempty) (hIk : I ≠ Finset.univ) :
let a : Fin (2 * k) →₀ ℕ := ∑ i ∈ I,
(Finsupp.single (⟨2 * i.val, by omega⟩ : Fin (2 * k)) 1 +
Finsupp.single (⟨2 * i.val + 1, by omega⟩ : Fin (2 * k)) 1)
let a' : Fin (2 * k) →₀ ℕ := ∑ i ∈ I',
(Finsupp.single (⟨2 * i.val + 1, by omega⟩ : Fin (2 * k)) 1 +
Finsupp.single (⟨(2 * i.val + 2) % (2 * k), Nat.mod_lt _ (by have := i.isLt; omega)⟩ : Fin (2 * k)) 1)
a ≠ a' ∧ (∀ x, a x ≤ 1) ∧ (∀ x, a' x ≤ 1) := by sorry
end GGHRSW.ColoredMatrix
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.