Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.2 — a small proper ambiguity subgroup

Open
ZamirInversion581.Mult.Supplement.lemma_4_2

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

complexity-theoryfinite-fieldslinear-algebrap2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let FFF be a finite field with q>2q>2q>2, write m=q−1m=q-1m=q−1, and let ε>0\varepsilon>0ε>0. Let P,P^P,\widehat PP,P be probability laws on FFF with p=P(1)≥1/m+εp=P(1)\ge1/m+\varepsilonp=P(1)≥1/m+ε and ∥P^−P∥∞≤ρ=ε2/10000\|\widehat P-P\|_\infty\le\rho=\varepsilon^2/10000∥P−P∥∞​≤ρ=ε2/10000. Define

S={a∈F×:P^(a)≥ε/2, ∥P^−aP^∥∞≤6ρ},H=⟨S⟩.S=\{a\in F^\times:\widehat P(a)\ge\varepsilon/2,\ \|\widehat P-a\widehat P\|_\infty\le6\rho\},\qquad H=\langle S\rangle.S={a∈F×:P(a)≥ε/2, ∥P−aP∥∞​≤6ρ},H=⟨S⟩.

Then HHH is proper and, writing h=∣H∣h=|H|h=∣H∣, all the following conclusions hold:

h<11/m+ε/2,h∣m,h<m,h<2/ε,h<1p−ε/4.h<\frac1{1/m+\varepsilon/2},\qquad h\mid m,\qquad h<m,\qquad h<2/\varepsilon,\qquad h<\frac1{p-\varepsilon/4}.h<1/m+ε/21​,h∣m,h<m,h<2/ε,h<p−ε/41​.

The precise bound controls the determinant ambiguity left by preprocessing. Neither the factor six nor the denominator 10000 is replaced by an unspecified constant.

Differences from the source:

  • generalization: P is a normalized-answer law and Phat its empirical approximation → arbitrary probability laws P and Phat satisfying the same heavy-atom and approximation hypotheses; reason: the lemma uses only these laws and inequalities; every empirical calibration is included
  • encoding: generated multiplicative subgroup and its order → Subgroup.closure in Fˣ and its natural cardinal, cast to real numbers for inequalities; reason: this is exactly the finite subgroup generated by the displayed set S
Preamble
import Mathlib
import Definitions.Def_ZamirInversion581_Mult_Supplement_Statistics

set_option autoImplicit false
Formal statement
namespace ZamirInversion581.Mult.Supplement

/-- Lemma 4.2, p.22; event (4) and definition (5), without restricting P to a normalized law. -/
theorem lemma_4_2 (F : Type*) [Field F] [Fintype F] [DecidableEq F]
    (hq : 2 < Fintype.card F) (ε : ℝ) (hε : 0 < ε) (P Phat : PMF F)
    (hp : 1 / (Fintype.card F - 1 : ℝ) + ε ≤ mass P 1)
    (hevent : distLaw Phat P ≤ ε ^ 2 / 10000) :
    let H := ambiguity ε Phat
    H ≠ ⊤ ∧
    (Nat.card H : ℝ) < 1 / (1 / (Fintype.card F - 1 : ℝ) + ε / 2) ∧
    Nat.card H ∣ Fintype.card F - 1 ∧
    (Nat.card H : ℝ) < (Fintype.card F - 1 : ℝ) ∧
    (Nat.card H : ℝ) < 2 / ε ∧
    (Nat.card H : ℝ) < 1 / (mass P 1 - ε / 4) := by sorry

end ZamirInversion581.Mult.Supplement
Source
Or Zamir, STOC 2027 submission #581 (October 2026), source.pdf SHA-256 175df18b5c98634c390c15a304942f462478044bddc6b15bad02e5a2db2bb917, p.22, Lemma 4.2. https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/581.pdf

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