Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.12 — Analytic rank at most three and Gowers norm bound

Open
DetSupportRank.DeterminantSupport.Supplement.proposition_4_12

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

algebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let FqF_qFq​ be any finite field of characteristic two and n≥d≥3n\ge d\ge3n≥d≥3. Evaluate Ed,nE_{d,n}Ed,n​ on all ddd independent row vectors with the uniform distribution. Then

AR⁡(Ed,n)≤3.\operatorname{AR}(E_{d,n})\le3.AR(Ed,n​)≤3.

For every nontrivial additive character χ:Fq→C×\chi:F_q\to\mathbb C^\timesχ:Fq​→C×, the actual squarefree elementary symmetric polynomial also satisfies

∥χ∘ed,n∥Ud2d≥q−3.\|\chi\circ e_{d,n}\|_{U^d}^{2^d}\ge q^{-3}.∥χ∘ed,n​∥Ud2d​≥q−3.

Both conclusions are retained. This supports the analytic-rank and Gowers clauses of Theorem 1.2, with the full field cardinality q=∣Fq∣q=|F_q|q=∣Fq​∣.

Differences from the source:

  • encoding: one-based indices in [n] → zero-based indices Fin n; reason: the increasing bijection preserves rows, columns and complements; paper i becomes r.val+1, also in signs
  • encoding: analytic rank given by bias = q^(−AR) → EReal-valued negative logarithm, with nonpositive bias assigned +∞; reason: source multilinear inputs have positive bias; a finite upper bound cannot exploit log(0)=0; the extension changes no source instance
  • encoding: Gowers norm raised to the power 2^d → real normalized cube average for every nontrivial AddChar F ℂ; reason: this is precisely the displayed power on the source domain; finite-field additive characters are unit-valued, with no character or field omitted
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_ElementaryMultisymmetric
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_AnalyticRank
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_GowersPower

noncomputable section
open scoped BigOperators
Formal statement
namespace DetSupportRank.DeterminantSupport.Supplement

/-- Proposition 4.12, p.13, proved p.15: both conclusions and every nontrivial character. -/
theorem proposition_4_12 {F : Type*} [Field F] [Fintype F] [CharP F 2]
    (n d : ℕ) (hnd : d ≤ n) (hd : 3 ≤ d) :
    analyticRank (fun x : (Fin d × Fin n) → F =>
        MvPolynomial.eval x (elementaryMultisymmetric F d n)) ≤ 3 ∧
      ∀ χ : AddChar F ℂ, χ ≠ 1 →
        (Fintype.card F : ℝ) ^ (-3 : ℤ) ≤
          gowersPower d (fun x : Fin n → F =>
            χ (MvPolynomial.eval x (MvPolynomial.esymm (Fin n) F d))) := by sorry

end DetSupportRank.DeterminantSupport.Supplement
Source
Neil Krishnan, Guy Moshkovitz, Optimal partition rank bounds for the determinant and other multilinear polynomials, STOC 2027 submission #631 (October 2026), Proposition 4.12, p. 13 (PDF p. 13); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.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