Increasingly ordered submatrices and their determinants
DefinitionDetSupportRank_DeterminantSupport_Supplement_OrderedSubmatricesalgebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
For a matrix and finite row and column subsets , use their increasing enumerations to form . When the cardinalities agree, its determinant is
The empty square minor has determinant one. The helper returns zero for unequal sizes, where a determinant is undefined in the source; no theorem in this supplement uses that extension. This fixes every minor sign and makes the same convention available over scalar and polynomial coefficient rings.
Definition code
import Mathlib
noncomputable section
open scoped BigOperators
namespace DetSupportRank.DeterminantSupport.Supplement
/-- Increasing enumeration of both row and column subsets; §4.2, p.10. -/
def orderedSubmatrix {R : Type*} {a b : ℕ} (A : Matrix (Fin a) (Fin b) R)
(I : Finset (Fin a)) (J : Finset (Fin b)) : Matrix (Fin I.card) (Fin J.card) R :=
A.submatrix (I.orderEmbOfFin rfl) (J.orderEmbOfFin rfl)
/-- Determinant of an ordered square minor. The extension to unequal sizes is zero. -/
def determinantMinor {R : Type*} [CommRing R] {a b : ℕ}
(A : Matrix (Fin a) (Fin b) R) (I : Finset (Fin a)) (J : Finset (Fin b)) : R :=
if h : J.card = I.card then
Matrix.det (A.submatrix (I.orderEmbOfFin rfl) (J.orderEmbOfFin h))
else 0
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), §4.2, submatrix convention, p. 10 (PDF p. 10); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf