Alternating matrices in arbitrary characteristic
DefinitionDetSupportRank_DeterminantSupport_Supplement_AlternatingMatricesalgebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
A square matrix over a ring is alternating when
The zero-diagonal condition is retained in characteristic two. This generic predicate states no Pfaffian identity and imposes no invertibility or characteristic restriction.
Definition code
import Mathlib
noncomputable section
open scoped BigOperators
namespace DetSupportRank.DeterminantSupport.Supplement
/-- Alternation includes the zero diagonal also in characteristic two; §4.1, p.9. -/
def IsAlternating {R : Type*} [Zero R] [Neg R] {n : ℕ}
(A : Matrix (Fin n) (Fin n) R) : Prop :=
(∀ i, A i i = 0) ∧ ∀ i j, A j i = -A i j
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.1, alternating-matrix setting, p. 9 (PDF p. 9); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf