A Blueprint for the Formalization of Seymour's Matroid Decomposition Theorem
Combinatorics
2026-01-06 v1
Abstract
This document is a blueprint for the formalization in Lean of the structural theory of regular matroids underlying Seymour's decomposition theorem. We present a modular account of regularity via totally unimodular representations, show that regularity is preserved under -, -, and -sums, and establish regularity for several special classes of matroids, including graphic, cographic, and the matroid . The blueprint records the logical structure of the proof, the precise dependencies between results, and their correspondence with Lean declarations. It is intended both as a guide for the ongoing formalization effort and as a human-readable reference for the organization of the proof.
Cite
@article{arxiv.2601.01255,
title = {A Blueprint for the Formalization of Seymour's Matroid Decomposition Theorem},
author = {Ivan Sergeev and Martin Dvorak and Cameron Rampell and Mark Sandey and Pietro Monticone},
journal= {arXiv preprint arXiv:2601.01255},
year = {2026}
}
Comments
18 pages, 0 figures