Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Geelen, Gerards, Kapoor: seven excluded minors for GF(4)\mathrm{GF}(4)GF(4)

Open
TenChallenges.challenge_02_r4_B7

by utkuokur · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

excluded-minorsmatroidsrepresentabilityten-challenges

The excluded minors for quaternary matroids, as the rung S(4,7)S(4,7)S(4,7) of Challenge 2:

for q∈{2,3,4}, the class of GF(q)-representable matroids has at most seven excluded minors up to isomorphism.\text{for } q\in\{2,3,4\},\ \text{the class of } \mathrm{GF}(q)\text{-representable matroids has at most seven excluded minors up to isomorphism.}for q∈{2,3,4}, the class of GF(q)-representable matroids has at most seven excluded minors up to isomorphism.

Geelen, Gerards and Kapoor proved that GF(4)\mathrm{GF}(4)GF(4) has exactly seven excluded minors; the bounds for GF(2)\mathrm{GF}(2)GF(2) and GF(3)\mathrm{GF}(3)GF(3) (one and four) are covered by the same number.

Preamble
import Definitions.Def_TenChallenges_Challenge_02
Formal statement
namespace TenChallenges
theorem challenge_02_r4_B7 : statement_02 4 7 := by sorry
end TenChallenges
Source
J. F. Geelen, A. M. H. Gerards, A. Kapoor, The excluded minors for GF(4)-representable matroids, JCTB 79 (2000), 247–299, https://doi.org/10.1006/jctb.2000.1963, main theorem (Theorem 1.1)
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 statement02(4,7)\mathrm{statement}_{02}(4, 7)statement02​(4,7), a definition from this bundle, which unfolds to the following: for every natural number ppp and every natural number mmm, assuming (as an instance-style hypothesis) that ppp is a prime number, if 0<m0 < m0<m and pm≤4p^m \le 4pm≤4, then ExcludedMinorsAtMost(p,m,7)\mathrm{ExcludedMinorsAtMost}(p, m, 7)ExcludedMinorsAtMost(p,m,7) holds.

The hypotheses "ppp prime, m≥1m \ge 1m≥1, pm≤4p^m \le 4pm≤4" are satisfied by exactly three pairs, (p,m)=(2,1)(p, m) = (2, 1)(p,m)=(2,1), (3,1)(3, 1)(3,1) and (2,2)(2, 2)(2,2). Hence the theorem asserts the conjunction of ExcludedMinorsAtMost(2,1,7)\mathrm{ExcludedMinorsAtMost}(2, 1, 7)ExcludedMinorsAtMost(2,1,7), ExcludedMinorsAtMost(3,1,7)\mathrm{ExcludedMinorsAtMost}(3, 1, 7)ExcludedMinorsAtMost(3,1,7) and ExcludedMinorsAtMost(2,2,7)\mathrm{ExcludedMinorsAtMost}(2, 2, 7)ExcludedMinorsAtMost(2,2,7): one statement for each of GF(2)\mathrm{GF}(2)GF(2), GF(3)\mathrm{GF}(3)GF(3) and GF(4)\mathrm{GF}(4)GF(4), each with the bound B=7B = 7B=7 applied separately to that field (each field gets its own set SSS of at most 777 matroids; there is no joint bound).

Here GF(pm)\mathrm{GF}(p^m)GF(pm) denotes Mathlib's GaloisField p m, the finite field defined as the splitting field of Xpm−XX^{p^m} - XXpm−X over Z/pZ\mathbb{Z}/p\mathbb{Z}Z/pZ; because m≥1m \ge 1m≥1 is assumed, it has exactly pmp^mpm elements.

Unfolding ExcludedMinorsAtMost(p,m,B)\mathrm{ExcludedMinorsAtMost}(p, m, B)ExcludedMinorsAtMost(p,m,B) (bundle definition). It says: there exists a finite set SSS of matroids on the type N\mathbb{N}N (Mathlib matroids whose ground set is a set of natural numbers; the members of SSS 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

∣S∣≤B,|S| \le B,∣S∣≤B,

and for every type β\betaβ (any type in Lean's lowest universe) and every Mathlib matroid MMM on β\betaβ whose ground set E(M)E(M)E(M) is finite, if MMM is an excluded minor for GF(pm)\mathrm{GF}(p^m)GF(pm)-representability (in the sense defined below), then there exists some N∈SN \in SN∈S with N≅MN \cong MN≅M (in the sense defined below). The set SSS is chosen once, before β\betaβ and MMM are quantified. S=∅S = \emptysetS=∅ is permitted; in that case the claim is that no finite matroid is an excluded minor.

Excluded minor (bundle definition IsExcludedMinorFor(P,M)\mathrm{IsExcludedMinorFor}(P, M)IsExcludedMinorFor(P,M), used with P=P =P= "is GF(pm)\mathrm{GF}(p^m)GF(pm)-representable"). MMM is an excluded minor if and only if both

  • MMM is not GF(pm)\mathrm{GF}(p^m)GF(pm)-representable, and
  • every matroid NNN on the same type β\betaβ with N<mMN <_m MN<m​M is GF(pm)\mathrm{GF}(p^m)GF(pm)-representable.

Here N<mMN <_m MN<m​M is Mathlib's strict-minor relation: N≤mMN \le_m MN≤m​M and not M≤mNM \le_m NM≤m​N, where N≤mMN \le_m MN≤m​M means that N=(M/C)∖DN = (M / C) \setminus DN=(M/C)∖D for some sets C,D⊆βC, D \subseteq \betaC,D⊆β (Mathlib's contraction of CCC followed by deletion of DDD; CCC and DDD are arbitrary subsets of β\betaβ, not required to be disjoint or to lie inside E(M)E(M)E(M)). By Mathlib lemmas, N<mMN <_m MN<m​M is equivalent to "N≤mMN \le_m MN≤m​M and N≠MN \ne MN=M", and also to "N≤mMN \le_m MN≤m​M and E(N)⊊E(M)E(N) \subsetneq E(M)E(N)⊊E(M)".

Representability (bundle definition IsGFRepresentable(p,m,M)\mathrm{IsGFRepresentable}(p, m, M)IsGFRepresentable(p,m,M) for a matroid MMM on a type β\betaβ). MMM is GF(pm)\mathrm{GF}(p^m)GF(pm)-representable if and only if there exist a type WWW (in Lean's lowest universe) together with an additive commutative group structure on WWW and a GF(pm)\mathrm{GF}(p^m)GF(pm)-module structure on WWW (so WWW is an arbitrary vector space over GF(pm)\mathrm{GF}(p^m)GF(pm); no finite-dimensionality is required), and a function v:β→Wv : \beta \to Wv:β→W (defined on all of β\betaβ, not only on E(M)E(M)E(M)), such that for every subset I⊆βI \subseteq \betaI⊆β,

I is independent in M  ⟺  the family (vx)x∈I is linearly independent over GF(pm).I \text{ is independent in } M \iff \text{the family } (v_x)_{x \in I} \text{ is linearly independent over } \mathrm{GF}(p^m).I is independent in M⟺the family (vx​)x∈I​ is linearly independent over GF(pm).

The right-hand side is Mathlib's LinearIndepOn: linear independence of the family indexed by the elements of III (so, in particular, x↦vxx \mapsto v_xx↦vx​ is injective on III and vx≠0v_x \ne 0vx​=0 for every x∈Ix \in Ix∈I). The subsets III range over all subsets of β\betaβ, including those not contained in E(M)E(M)E(M); since in Mathlib every independent set of a matroid is contained in its ground set, for such III the left-hand side is false, so the family (vx)x∈I(v_x)_{x \in I}(vx​)x∈I​ must be linearly dependent (for I={x}I = \{x\}I={x} with x∉E(M)x \notin E(M)x∈/E(M) this forces vx=0v_x = 0vx​=0).

Isomorphism (bundle definition Matroid.IsIso, not Mathlib's notion). For NNN a matroid on N\mathbb{N}N and MMM a matroid on β\betaβ, N≅MN \cong MN≅M means: there exists a bijection e:E(N)→E(M)e : E(N) \to E(M)e:E(N)→E(M) such that for every subset I⊆E(N)I \subseteq E(N)I⊆E(N),

I is independent in N  ⟺  e(I) is independent in M.I \text{ is independent in } N \iff e(I) \text{ is independent in } M.I is independent in N⟺e(I) is independent in M.

Finiteness. The hypothesis on MMM is Mathlib's Matroid.Finite, which says exactly that the ground set E(M)E(M)E(M) is a finite set; the type β\betaβ itself may be infinite.

In summary, the theorem asserts: for each of the three fields F=GF(2)\mathbb{F} = \mathrm{GF}(2)F=GF(2), GF(3)\mathrm{GF}(3)GF(3), GF(4)\mathrm{GF}(4)GF(4) separately, there is a set SFS_{\mathbb{F}}SF​ consisting of at most seven matroids on N\mathbb{N}N such that every matroid MMM (on any type) with finite ground set which is not F\mathbb{F}F-representable but all of whose strict minors are F\mathbb{F}F-representable is isomorphic, via a bijection of ground sets carrying independent sets exactly to independent sets, to a member of SFS_{\mathbb{F}}SF​.

Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by utkuokur · Nov 4, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me