Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — Optimal lower bound for all determinant-support polynomials

Proved
DetSupportRank.DeterminantSupport.theorem_1_1

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

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

Let FFF be any field, let n>2n>2n>2, and choose independent nonzero coefficients cσ∈F×c_\sigma\in F^\timescσ​∈F× for every permutation. For the formal polynomial

D=∑σ∈Sncσ∏i=1nxi,σ(i),D=\sum_{\sigma\in S_n}c_\sigma\prod_{i=1}^n x_{i,\sigma(i)},D=σ∈Sn​∑​cσ​i=1∏n​xi,σ(i)​,

the full partition rank satisfies

PR⁡F(D)≥{n,n odd,n−1,n even.\operatorname{PR}_F(D)\ge\begin{cases}n,&n\text{ odd},\\n-1,&n\text{ even}.\end{cases}PRF​(D)≥{n,n−1,​n odd,n even.​

Partition factors may split the rows along any nonempty proper subset, independently in every summand. The theorem includes finite fields and characteristic two, with parity determined only by the integer nnn.

Differences from the source:

  • encoding: finite coordinate sets [n] and finite tuples → zero-based Fin n, finite subsets, and functions on finite index sets; reason: the index sets are related by a bijection; every source instance is retained
  • encoding: independent nonzero field coefficients cσ → a function from permutations to field units; reason: every nonzero field element determines a unique unit, so this parametrizes exactly the source family
  • encoding: minimum finite decomposition length and hyperplane-covering size → infimum of actual witness lengths in ℕ∞, with empty infimum ∞; reason: on the source domain partition rank is finite and attained by a row expansion; the separate attainment target records this, and Theorem 3.9 also implies finite covering rank
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_DeterminantFamily

noncomputable section
open scoped BigOperators
Formal statement
namespace DetSupportRank.DeterminantSupport
attribute [local instance] Classical.propDecidable Classical.decEq

/-- Krishnan–Moshkovitz, STOC 2027 submission #631, Theorem 1.1, p.2. -/
theorem theorem_1_1 {K : Type*} [Field K] {n : ℕ}
    (hn : 2 < n) (c : Equiv.Perm (Fin n) → Kˣ) :
    (if Odd n then (n : ℕ∞) else ((n - 1 : ℕ) : ℕ∞)) ≤
      partitionRank (determinantSupportPolynomial c) := by sorry

end DetSupportRank.DeterminantSupport
Source
Neil Krishnan, Guy Moshkovitz, Optimal partition rank bounds for the determinant and other multilinear polynomials, STOC 2027 submission #631 (October 2026), Theorem 1.1, p. 2; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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