Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Feit–Thompson theorem: every finite group of odd order is solvable

Proved
CayleyErdosGyarfas.feit_thompson

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theorysolvable-groups

Let GGG be a finite group of odd order. Then GGG is solvable: its derived series G=G(0)⊵G(1)⊵G(2)⊵⋯G = G^{(0)} \trianglerighteq G^{(1)} \trianglerighteq G^{(2)} \trianglerighteq \cdotsG=G(0)⊵G(1)⊵G(2)⊵⋯, defined by G(i+1)=[G(i),G(i)]G^{(i+1)} = [G^{(i)}, G^{(i)}]G(i+1)=[G(i),G(i)], reaches the trivial subgroup after finitely many steps:

∣G∣ odd  ⟹  G(n)={1} for some n≥0.|G| \text{ odd} \;\Longrightarrow\; G^{(n)} = \{1\} \text{ for some } n \ge 0 .∣G∣ odd⟹G(n)={1} for some n≥0.

This is the odd order theorem of Feit and Thompson (1963). The proof of Theorem 1.1 of the source paper (§2, p. 4) invokes it to conclude that a minimal counterexample to the claim made there (every Cayley graph of a noncyclic group of odd order contains a symmetric figure-eight) is solvable, so that its minimal normal subgroups are elementary abelian. It is a supporting statement of this mission, cited rather than proved by the paper, and Mathlib does not contain it.

Formalization Note Solvability is Mathlib's Group.IsSolvable G: some term derivedSeries G n of the derived series equals ⊥. The type is that of OddOrder.feitThompson in Yawara Ishida's Lean 4 development (https://github.com/yawara/odd-order), a port of which is vendored and proved in Palomar entry PALOMAR-2026-11-04-000015.

Preamble
import Mathlib.GroupTheory.Solvable
import Mathlib.SetTheory.Cardinal.Finite
Formal statement
namespace CayleyErdosGyarfas

/-- **Feit–Thompson theorem** (Feit–Thompson 1963): every finite group of odd order is
solvable. Supporting statement: the proof of Theorem 1.1 of arXiv:2611.05060v1 invokes it
(§2, p. 4). The type is that of `OddOrder.feitThompson` in Yawara Ishida's Lean 4
development. -/
theorem feit_thompson {G : Type*} [Group G] [Finite G] (hodd : Odd (Nat.card G)) :
    Group.IsSolvable G := by sorry

end CayleyErdosGyarfas
Source
M. C. Burkhart, Odd-ordered Cayley graphs satisfy Erdős–Gyárfás, arXiv:2611.05060v1 (3 Nov 2026), https://arxiv.org/abs/2611.05060v1, §2, p. 4 (proof of Theorem 1.1: “By Feit–Thompson, G is solvable.”). The theorem itself is W. Feit and J. G. Thompson, Solvability of groups of odd order, Pacific J. Math. 13 (1963), 775–1029, https://doi.org/10.2140/pjm.1963.13.775. Lean type as `OddOrder.feitThompson` in https://github.com/yawara/odd-order (commit 7a412ea), vendored in Palomar entry PALOMAR-2026-11-04-000015 (https://palomar-registry.org/entry?id=PALOMAR-2026-11-04-000015).
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

For every group GGG, satisfying the two hypotheses below, the statement asserts that GGG is solvable. Here GGG is an arbitrary type, in any universe of types, with a group structure written multiplicatively with identity 111. The hypotheses are:

  1. GGG is finite, i.e. there is a bijection between GGG and {0,1,…,m−1}\{0, 1, \dots, m-1\}{0,1,…,m−1} for some m∈Nm \in \mathbb{N}m∈N;
  2. the order ∣G∣|G|∣G∣ is odd, i.e. ∣G∣=2k+1|G| = 2k+1∣G∣=2k+1 for some k∈Nk \in \mathbb{N}k∈N.

Solvable has this exact meaning: there exists n∈Nn \in \mathbb{N}n∈N, with n=0n = 0n=0 allowed, such that

G(n)={1}.G^{(n)} = \{1\}.G(n)={1}.

Here (G(i))i∈N(G^{(i)})_{i \in \mathbb{N}}(G(i))i∈N​ is the derived series. It is defined by recursion and starts at index 000 with the whole group:

G(0)=G,G(i+1)=⟨ [a,b]  :  a,b∈G(i) ⟩(i≥0).G^{(0)} = G, \qquad G^{(i+1)} = \big\langle\, [a,b] \;:\; a, b \in G^{(i)} \,\big\rangle \quad (i \ge 0).G(0)=G,G(i+1)=⟨[a,b]:a,b∈G(i)⟩(i≥0).

In this formula ⟨S⟩\langle S \rangle⟨S⟩ is the subgroup of GGG generated by the set SSS, and the commutator of two elements is [a,b]=a b a−1b−1[a,b] = a\,b\,a^{-1}b^{-1}[a,b]=aba−1b−1. So G(1)G^{(1)}G(1) is the commutator subgroup of GGG. The series is decreasing (G(i+1)⊆G(i)G^{(i+1)} \subseteq G^{(i)}G(i+1)⊆G(i)), and once a term equals {1}\{1\}{1}, every later term also equals {1}\{1\}{1}. "Some term is trivial" therefore means the same as "the series is eventually trivial". The statement gives no bound on nnn (the derived length) and asserts nothing beyond the existence of such an nnn.

The order ∣G∣|G|∣G∣ is the library's natural-number cardinality of the underlying set of GGG. It is the number of elements when GGG is finite, and by convention 000 when GGG is infinite. Here GGG is assumed finite and is nonempty because it contains 111. So ∣G∣|G|∣G∣ is the actual number of elements, ∣G∣≥1|G| \ge 1∣G∣≥1, and the junk value 000 cannot occur. The oddness hypothesis alone also rules out the value 000, because 000 is even. Oddness therefore already forces GGG to be finite, which means the finiteness hypothesis follows from the oddness hypothesis.

Edge cases: the trivial group satisfies both hypotheses (∣G∣=1=2⋅0+1|G| = 1 = 2\cdot 0 + 1∣G∣=1=2⋅0+1). For it the conclusion holds with n=0n = 0n=0, because G(0)=G={1}G^{(0)} = G = \{1\}G(0)=G={1}. The hypotheses can be satisfied, for example by every cyclic group of odd order, so the statement is not vacuous. Every notion used is the standard library definition, and no custom definitions are involved. These notions are group, finiteness, cardinality, oddness of a natural number, subgroup generated by a set, commutator, derived series and solvability.

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

    Confirmed by the moderator at approval.

  • Endorsed by burkh4rt · Nov 12, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me