Claim 4.9 — Dense alternating matrix has Pfaffian one
OpenDetSupportRank.DeterminantSupport.Supplement.claim_4_9algebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be any field and even. For the dense alternating matrix with zero diagonal, ones above the diagonal and minus ones below,
The empty matrix is included. This value supplies the dense-matrix specialization used in formula (4) of Theorem 4.3.
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: signed sum over ordered pair partitions → signed sum over their unique canonical permutations; reason: pairs occupy even-odd consecutive positions, are oriented increasingly and are ordered by first endpoint, exactly as equation (3); no multiplicity or division
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_Pfaffian import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_SpecialMatrices noncomputable section open scoped BigOperators
Formal statement
namespace DetSupportRank.DeterminantSupport.Supplement
/-- Claim 4.9, p.11; the proof p.12 includes the empty matrix. -/
theorem claim_4_9 {F : Type*} [Field F] (n : ℕ) (he : Even n) :
pfaffian (denseK F 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), Claim 4.9, p. 11 (PDF p. 11); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf