Theorem 4.3 — Both explicit n−1-product determinant identities (4) and (5)
OpenDetSupportRank.DeterminantSupport.Supplement.theorem_4_3algebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be any field and let be even, with . Put and take all minors in increasing row and column order. Both identities hold in the formal polynomial ring:
In each product the two sums are independent. Complements are in the full . These are the two explicit determinant decompositions (4) and (5), not merely a rank upper bound.
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: determinants of equal-size ordered row and column subsets → ordered minors with a zero extension at unequal sizes; reason: all uses have equal sizes by their index sets and the source size assumptions; the undefined extension is never used
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_PolynomialMatrices import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_SpecialMatrices noncomputable section open scoped BigOperators
Formal statement
namespace DetSupportRank.DeterminantSupport.Supplement
/-- Theorem 4.3, p.10: BOTH products of independently indexed sums, formulas (4) and (5).
The paper's one-based i becomes r.val+1, including in the sign. -/
theorem theorem_4_3 {F : Type*} [Field F] (n : ℕ) (hn : 3 ≤ n) (he : Even n) :
(determinantPolynomial F n =
∑ r ∈ Finset.univ.filter (fun r : Fin n => r.val ≠ 0),
MvPolynomial.C ((-1 : F) ^ (r.val + 1)) *
sumColumnMinors (firstRowPair r) 2 *
sumColumnMinors (Finset.univ \ firstRowPair r) (n - 2)) ∧
(determinantPolynomial F n =
∑ r ∈ Finset.univ.filter (fun r : Fin n => r.val ≠ 0),
MvPolynomial.C ((-1 : F) ^ (r.val + 1)) *
(∑ b : Fin (n / 2), variableMinor (firstRowPair r) (adjacentBlock b)) *
(∑ b : Fin (n / 2),
variableMinor (Finset.univ \ firstRowPair r) (Finset.univ \ adjacentBlock b))) := 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), Theorem 4.3, p. 10 (PDF p. 10); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf