Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Thompson subgroup J(P)J(P)J(P) of a nontrivial finite ppp-group is nontrivial

Proved
Subgroup.thompsonJ_ne_bot

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group, let ppp be a prime, and let P≤GP \le GP≤G be a nontrivial ppp-subgroup. Write E(P)\mathcal{E}(P)E(P) for the set of elementary abelian ppp-subgroups E≤PE \le PE≤P whose order is maximal among the orders of all elementary abelian ppp-subgroups of PPP, and let

J(P)  =  ⟨E  :  E∈E(P)⟩J(P) \;=\; \bigl\langle E \;:\; E \in \mathcal{E}(P) \bigr\rangleJ(P)=⟨E:E∈E(P)⟩

be the Thompson subgroup of PPP (Isaacs, Finite Group Theory, Chapter 7). Then

J(P)≠1.J(P) \neq 1 .J(P)=1.

Indeed, by Cauchy's theorem PPP contains an element of order ppp, which generates an elementary abelian subgroup of order ppp; so the members of E(P)\mathcal{E}(P)E(P) have order at least p>1p > 1p>1, and J(P)J(P)J(P) contains them. The fact is used in Thompson's normal ppp-complement theorem (Isaacs, Chapter 7) and in Thompson's theorem that Frobenius kernels are nilpotent (Isaacs, Chapter 6).

Formalization Note J(P)J(P)J(P) is thompsonJ P p, the supremum in Subgroup G of the members of maxElemAbelianIn P p; being a ppp-group is IsPGroup p ↥P, and nontriviality is P ≠ ⊥. The theorem lives in the namespace Subgroup.

Preamble
import Definitions.Def_OddOrder_GroupTheory_ElementaryAbelian
import Definitions.Def_OddOrder_GroupTheory_ThompsonSubgroup
import Mathlib.Algebra.Group.Subgroup.Basic
import Mathlib.Data.Set.Card
import Mathlib.Data.Set.Finite.Lemmas
Formal statement
namespace Subgroup

variable {G : Type*} [Group G]

theorem thompsonJ_ne_bot [Finite G] {p : ℕ} [Fact p.Prime] {P : Subgroup G}
    (hP_pgroup : IsPGroup p ↥P) (hP_ne_bot : P ≠ ⊥) :
    thompsonJ P p ≠ ⊥ := by sorry

end Subgroup
Source
Yawara Ishida, Lean 4 formalization of the Feit–Thompson (odd order) theorem, github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0), https://github.com/yawara/odd-order/blob/20a6fccbb63c0b138acda9f7fafd798c42f9441b/OddOrder/GroupTheory/ThompsonSubgroup.lean#L152-L207

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