The Thompson subgroup of a nontrivial finite -group is nontrivial
ProvedSubgroup.thompsonJ_ne_botLet be a finite group, let be a prime, and let be a nontrivial -subgroup. Write for the set of elementary abelian -subgroups whose order is maximal among the orders of all elementary abelian -subgroups of , and let
be the Thompson subgroup of (Isaacs, Finite Group Theory, Chapter 7). Then
Indeed, by Cauchy's theorem contains an element of order , which generates an elementary abelian subgroup of order ; so the members of have order at least , and contains them. The fact is used in Thompson's normal -complement theorem (Isaacs, Chapter 7) and in Thompson's theorem that Frobenius kernels are nilpotent (Isaacs, Chapter 6).
Formalization Note is thompsonJ P p, the supremum in Subgroup G of the members of maxElemAbelianIn P p; being a -group is IsPGroup p ↥P, and nontriviality is P ≠ ⊥. The theorem lives in the namespace Subgroup.
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
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