Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.8 — General normalized Pfaffian determinant expansion with valid row partitions

Open
DetSupportRank.DeterminantSupport.Supplement.theorem_4_8

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebracombinatoricsdeterminantsupportp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let FFF be any field, n≥3n\ge3n≥3 even, and KKK any alternating scalar n×nn\times nn×n matrix such that pf⁡(K)=1\operatorname{pf}(K)=1pf(K)=1. Put M=XKXTM=XKX^{\mathsf T}M=XKXT and Si={1,i}S_i=\{1,i\}Si​={1,i}. Then the formal identity is

det⁡n(X)=∑i=2n(−1)iM1,ipf⁡(MSic,Sic).\det_n(X)=\sum_{i=2}^n(-1)^iM_{1,i}\operatorname{pf}(M_{S_i^c,S_i^c}).ndet​(X)=i=2∑n​(−1)iM1,i​pf(MSic​,Sic​​).

For each displayed term, SiS_iSi​ is a nonempty proper row subset, M1,iM_{1,i}M1,i​ is set-multilinear on SiS_iSi​, and its displayed Pfaffian factor is set-multilinear on the complementary rows. Thus this is an actual partition decomposition with n−1n-1n−1 terms. No characteristic, invertibility, or assumed-decomposition condition is added. This companion theorem supplies the general family behind the two identities 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
  • encoding: the expansion is a valid partition rank decomposition → the identity, the displayed factors’ set-multilinearity on complementary nonempty proper row subsets, and HasPartitionDecomposition with length n−1; reason: spells out every part of validity using the unchanged published predicate; no decomposition fact becomes a hypothesis
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_PartitionRank
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_AlternatingMatrices
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_Pfaffian
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_PolynomialMatrices

noncomputable section
open scoped BigOperators
Formal statement
namespace DetSupportRank.DeterminantSupport.Supplement

/-- Theorem 4.8, p.11: the actual expansion and validity of its displayed row factors.
No hypothesis asserts the expansion or multilinearity of its factors. -/
theorem theorem_4_8 {F : Type*} [Field F] (n : ℕ) (hn : 3 ≤ n) (he : Even n)
    (K : Matrix (Fin n) (Fin n) F) (hK : IsAlternating K) (hpf : pfaffian K = 1) :
    let M := conjugatedMatrix K
    let first : Fin n := ⟨0, by omega⟩
    (determinantPolynomial F n =
      ∑ r ∈ Finset.univ.filter (fun r : Fin n => r.val ≠ 0),
        MvPolynomial.C ((-1 : F) ^ (r.val + 1)) * M first r *
          pfaffian (orderedSubmatrix M (Finset.univ \ firstRowPair r)
            (Finset.univ \ firstRowPair r))) ∧
    (∀ r : Fin n, r.val ≠ 0 →
      (firstRowPair r).Nonempty ∧ firstRowPair r ≠ Finset.univ ∧
      SetMultCost.IsSetMultilinearOn Prod.fst (firstRowPair r) (M first r) ∧
      SetMultCost.IsSetMultilinearOn Prod.fst (Finset.univ \ firstRowPair r)
        (pfaffian (orderedSubmatrix M (Finset.univ \ firstRowPair r)
          (Finset.univ \ firstRowPair r)))) ∧
    HasPartitionDecomposition (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), Theorem 4.8, p. 11 (PDF p. 11); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/631.pdf

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me