Proposition 4.2 — Even determinant partition-rank upper bound
OpenDetSupportRank.DeterminantSupport.Supplement.proposition_4_2algebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be any field and even. For the formal determinant in its row parts,
This supplies the even-order upper bound in the determinant equality of Theorem 1.2.
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: integer minimum partition-decomposition length → the published partitionRank valued in ℕ∞; reason: it is the infimum of actual decomposition lengths and is finite and attained on the source domain; there is no changed rank notion
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_PartitionRank import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_PolynomialMatrices noncomputable section open scoped BigOperators
Formal statement
namespace DetSupportRank.DeterminantSupport.Supplement
/-- Proposition 4.2, p.10: the even-order upper bound, over every field. -/
theorem proposition_4_2 {F : Type*} [Field F] (n : ℕ) (hn : 3 ≤ n) (he : Even n) :
partitionRank (determinantPolynomial F n) ≤ ((n - 1 : ℕ) : ℕ∞) := 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.2, p. 10 (PDF p. 10); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf