Geelen, Gerards, Kapoor: seven excluded minors for
OpenTenChallenges.challenge_02_r4_B7The excluded minors for quaternary matroids, as the rung of Challenge 2:
Geelen, Gerards and Kapoor proved that has exactly seven excluded minors; the bounds for and (one and four) are covered by the same number.
import Definitions.Def_TenChallenges_Challenge_02
namespace TenChallenges theorem challenge_02_r4_B7 : statement_02 4 7 := by sorry end TenChallenges
Read-back
What the Lean code literally says, in plain math · claude-fable-5-1
Statement. The theorem TenChallenges.challenge_02_r4_B7 asserts the proposition , a definition from this bundle, which unfolds to the following: for every natural number and every natural number , assuming (as an instance-style hypothesis) that is a prime number, if and , then holds.
The hypotheses " prime, , " are satisfied by exactly three pairs, , and . Hence the theorem asserts the conjunction of , and : one statement for each of , and , each with the bound applied separately to that field (each field gets its own set of at most matroids; there is no joint bound).
Here denotes Mathlib's GaloisField p m, the finite field defined as the splitting field of over ; because is assumed, it has exactly elements.
Unfolding (bundle definition). It says: there exists a finite set of matroids on the type (Mathlib matroids whose ground set is a set of natural numbers; the members of are pairwise distinct as matroids, but nothing requires them to be pairwise non-isomorphic, to have finite ground sets, to be excluded minors, or to be non-representable) such that
and for every type (any type in Lean's lowest universe) and every Mathlib matroid on whose ground set is finite, if is an excluded minor for -representability (in the sense defined below), then there exists some with (in the sense defined below). The set is chosen once, before and are quantified. is permitted; in that case the claim is that no finite matroid is an excluded minor.
Excluded minor (bundle definition , used with "is -representable"). is an excluded minor if and only if both
- is not -representable, and
- every matroid on the same type with is -representable.
Here is Mathlib's strict-minor relation: and not , where means that for some sets (Mathlib's contraction of followed by deletion of ; and are arbitrary subsets of , not required to be disjoint or to lie inside ). By Mathlib lemmas, is equivalent to " and ", and also to " and ".
Representability (bundle definition for a matroid on a type ). is -representable if and only if there exist a type (in Lean's lowest universe) together with an additive commutative group structure on and a -module structure on (so is an arbitrary vector space over ; no finite-dimensionality is required), and a function (defined on all of , not only on ), such that for every subset ,
The right-hand side is Mathlib's LinearIndepOn: linear independence of the family indexed by the elements of (so, in particular, is injective on and for every ). The subsets range over all subsets of , including those not contained in ; since in Mathlib every independent set of a matroid is contained in its ground set, for such the left-hand side is false, so the family must be linearly dependent (for with this forces ).
Isomorphism (bundle definition Matroid.IsIso, not Mathlib's notion). For a matroid on and a matroid on , means: there exists a bijection such that for every subset ,
Finiteness. The hypothesis on is Mathlib's Matroid.Finite, which says exactly that the ground set is a finite set; the type itself may be infinite.
In summary, the theorem asserts: for each of the three fields , , separately, there is a set consisting of at most seven matroids on such that every matroid (on any type) with finite ground set which is not -representable but all of whose strict minors are -representable is isomorphic, via a bijection of ground sets carrying independent sets exactly to independent sets, to a member of .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.