Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
🤖 AI Summary
This work presents the first formal verification in a theorem prover of the constructive direction (“forward direction”) of Seymour’s Theorem for regular matroids. To achieve this, we developed an extensible matroid formalization library in Lean 4, supporting matroids of finite rank over possibly infinite ground sets, totally unimodular matrices, standard vector matroid representations, and binary matroid 1-, 2-, and 3-sums. Our methodology integrates type-theoretic modeling with structured proof strategies to ensure logical rigor and reusability. The entire constructive proof of Seymour’s Theorem—including all key decomposition and composition steps—has been fully formalized and verified via Lean’s type checker and consistency checks. Main contributions are: (1) the first formal verification of the constructive direction of Seymour’s Theorem; (2) the first matroid library supporting unified modeling of finite-rank matroids over infinite ground sets; and (3) a scalable foundation for formalizing combinatorics and matroid theory.
Application Category
📝 Abstract
Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited number of notions and results have been implemented so far. In this work, we formalize the proof of the forward (composition) direction of Seymour's theorem for regular matroids. To this end, we develop a library in Lean 4 that implements definitions and results about totally unimodular matrices, vector matroids, their standard representations, regular matroids, and 1-, 2-, and 3-sums of matrices and binary matroids given by their standard representations. Using this framework, we formally state Seymour's decomposition theorem and implement a formally verified proof of the composition direction in the setting where the matroids have finite rank and may have infinite ground sets.
Problem
Research questions and friction points this paper is trying to address.
Formalizing Seymour's decomposition theorem proof for regular matroids
Developing Lean 4 library for matroid theory concepts and operations
Verifying composition direction with finite rank and infinite ground sets
Innovation
Methods, ideas, or system contributions that make the work stand out.
Formally verified proof using Lean 4
Library implements unimodular matrices and matroids
Handles finite rank with infinite ground sets
🔎 Similar Papers
No similar papers found.
