Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.3 — reversing a cut preserves Pfaffianity

Open
PfaffianRecognition.Recognition.Supplement.lemma_4_3

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

complexity-theorygraph-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1pfaffian

Let GGG be a finite simple graph with a perfect matching, DDD an orientation of GGG and X⊆V(G)X\subseteq V(G)X⊆V(G). Let DXD^XDX be obtained from DDD by reversing every edge with exactly one endpoint in XXX. Then

D is Pfaffian  ⟺  DX is Pfaffian.D\text{ is Pfaffian}\iff D^X\text{ is Pfaffian}.D is Pfaffian⟺DX is Pfaffian.

The paper attributes this to [dCLM05]; it is used in the converse direction of Theorem 1.2.

Differences from the source:

  • encoding: arbitrary finite simple graph G → SimpleGraph (Fin N) for every N, vertices in a fixed order; reason: every finite simple graph has such a labelling; no instance is removed
Preamble
import Definitions.Def_PfaffianRecognition_Recognition_Supplement_cut_model
Formal statement
namespace PfaffianRecognition.Recognition.Supplement

open PfaffianRecognition.Recognition

/-- Lemma 4.3, p. 12 ([dCLM05]). Reversing the edges of a cut preserves Pfaffianity. -/
theorem lemma_4_3 {N : ℕ} {G : SimpleGraph (Fin N)}
    (hG : ∃ F : Finset G.edgeSet, MulmuleyVV.Matching.IsPerfectMatchingEdges G F)
    (D : Orientation G) (X : Set (Fin N)) :
    IsPfaffianOrientation D ↔ IsPfaffianOrientation (cutReversal D X) := by sorry

end PfaffianRecognition.Recognition.Supplement
Source
Priyanshu Pant, Ranveer Singh, Pfaffian Recognition is in coRP, STOC 2027 submission #858 (October 2026), Lemma 4.3, p. 12; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/858.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