Lemma 4.10 — multiplication in majority coordinates
ProvedAC02Frege.lemma_4_10_multiplication_majorityac0-2-fregemajority-liftingp2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-calculusproof-complexity
Let be odd, a CNF on variables and an integer. For all polynomials in the lifted variables,
Moreover,
Both statements hold with replaced by the number of blocks on which depends.
This is the lifted replacement of Fact 2.5: multiplication is controlled by the coefficient degree of the known member and the ordinary degree of the factor.
Differences from the source:
- encoding: ℓ odd, m = (ℓ − 1)/2 (standing assumption of §4) → hypothesis Odd ℓ, m = ℓ / 2; reason: same instances
- encoding: polynomials over F2 identified with functions on the cube; products of functions → MvPolynomial over ZMod 2; products multilinearized by ML (membership in Ĉ_D and β depend only on ML p); reason: Definition 2.1 identifies a function with its multilinear polynomial; no instance changes
- encoding: deg_x v; the number of blocks on which v depends → totalDegree (ML v); the number of blocks i some x_{i,a} of which occurs in ML v; reason: a function depends on a variable iff it occurs in its multilinear polynomial
- encoding: β with β(0) = −∞, sums β(p) + d → WithBot ℕ with ⊥ + d = ⊥; reason: same values
Preamble
import Mathlib import Definitions.Def_LiftSAParity_CNF import Definitions.Def_AC02Frege_ML import Definitions.Def_AC02Frege_PC import Definitions.Def_AC02Frege_lift import Definitions.Def_AC02Frege_majorityExpansion
Formal statement
namespace AC02Frege
open MvPolynomial LiftSAParity
/-- Alekseev–Gryaznov–Pitassi–Robere–Shekhovtsov–Tzameret, *Progress on AC0[2]-Frege Lower Bounds*, manuscript (sha256 88d149fa…), Lemma 4.10, pp.22–23 (multiplication in majority coordinates): for odd `ℓ` and all
polynomials `p, v` in the lifted variables, `β(pv) ≤ β(p) + deg_x v`; moreover
`p ∈ Ĉ_D, β(p) + deg_x v ≤ D ⟹ pv ∈ Ĉ_D`; both statements hold with `deg_x v` replaced by the
number of blocks on which `v` depends.
**Formalization Note** `pv` is the product of functions (membership and `β` depend only on
`ML (p * v)`); `deg_x v` is the degree of the multilinear polynomial `ML v`; `β` is in
`WithBot ℕ` with `⊥ + d = ⊥`. -/
theorem lemma_4_10_multiplication_majority {n ℓ : ℕ} (hℓ : Odd ℓ) (F : CNF (Fin n)) (D : ℕ) :
(∀ p v : MvPolynomial (Fin n × Fin ℓ) (ZMod 2),
coeffDeg (p * v) ≤ coeffDeg p + ((ML v).totalDegree : WithBot ℕ)) ∧
(∀ p v : MvPolynomial (Fin n × Fin ℓ) (ZMod 2), p ∈ CHat F ℓ D →
coeffDeg p + ((ML v).totalDegree : WithBot ℕ) ≤ (D : WithBot ℕ) → p * v ∈ CHat F ℓ D) ∧
(∀ p v : MvPolynomial (Fin n × Fin ℓ) (ZMod 2),
coeffDeg (p * v) ≤ coeffDeg p + ((blocksOf v : ℕ) : WithBot ℕ)) ∧
(∀ p v : MvPolynomial (Fin n × Fin ℓ) (ZMod 2), p ∈ CHat F ℓ D →
coeffDeg p + ((blocksOf v : ℕ) : WithBot ℕ) ≤ (D : WithBot ℕ) → p * v ∈ CHat F ℓ D) := by sorry
end AC02Frege
Source
Alekseev, Gryaznov, Pitassi, Robere, Shekhovtsov, Tzameret, Progress on AC0[2]-Frege Lower Bounds (manuscript dated November 3, 2026, STOC 2027 submission, sha256 88d149fa2bcae702e55a6b72efecda2b4137fd18dca3e23a056c3db5da0ece61), Lemma 4.10, pp.22–23
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.