Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.10 — Sparse alternating matrix and all its principal Pfaffians

Open
DetSupportRank.DeterminantSupport.Supplement.claim_4_10

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 and n≥0n\ge0n≥0 even. For the sparse alternating block matrix LnL_nLn​, and every principal index subset J⊆[n]J\subseteq[n]J⊆[n],

pf⁡(Ln)=1,pf⁡((Ln)J,J)={1J aligned,0J not aligned.\operatorname{pf}(L_n)=1,\qquad \operatorname{pf}((L_n)_{J,J})=\begin{cases}1&J\text{ aligned},\\0&J\text{ not aligned}.\end{cases}pf(Ln​)=1,pf((Ln​)J,J​)={10​J aligned,J not aligned.​

Aligned means a union of whole adjacent two-element blocks; all submatrices inherit increasing order. The empty matrix and empty subset are included. This full dichotomy supplies the sparse-matrix specialization used in formula (5) 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: even-order source Pfaffian and all principal subsets → odd-order principal matching sum is zero; reason: there are no perfect matchings of an odd set; this total convention changes no even-order source instance, and retains every subset in the printed dichotomy
Preamble
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_OrderedSubmatrices
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_Pfaffian
import Definitions.Def_DetSupportRank_DeterminantSupport_Supplement_SpecialMatrices

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

/-- Claim 4.10, p.12: the full principal-submatrix dichotomy, including the empty subset. -/
theorem claim_4_10 {F : Type*} [Field F] (n : ℕ) (he : Even n) :
    pfaffian (sparseL F n) = 1 ∧
      ∀ J : Finset (Fin n),
        pfaffian (orderedSubmatrix (sparseL F n) J J) =
          if IsAligned J then 1 else 0 := 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.10, p. 12 (PDF p. 12); 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