Theorem 1.1 — Optimal lower bound for all determinant-support polynomials
ProvedDetSupportRank.DeterminantSupport.theorem_1_1algebracombinatoricsdeterminantsupportp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be any field, let , and choose independent nonzero coefficients for every permutation. For the formal polynomial
the full partition rank satisfies
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 .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.