Isaacs 7.1, Step 1: a bad -subgroup maximizing the -part of , then
ProvedOddOrder.Isaacs.Ch07.exists_lexicographically_maximal_badNormalizerPSubgroupfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Call a subgroup bad (IsBadNormalizerPSubgroup p U) if , is a -group, and has no normal -complement. For a subgroup , let (normalizerPPart p X) denote the -part of , i.e. .
Let be a finite group and a prime, and suppose has no normal -complement. Then there exists a bad subgroup such that
This is the lexicographic choice of in Step 1 of the minimal-counterexample argument for Isaacs's Theorem 7.1; is then shown to be .
Preamble
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B2_NormalJ_PComplement import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7C_ThompsonPComplement
Formal statement
namespace OddOrder.Isaacs.Ch07
open scoped Pointwise
variable {G : Type*} [Group G]
section MinimalCounterexampleStepOne
theorem exists_lexicographically_maximal_badNormalizerPSubgroup
[Finite G] {p : ℕ} [Fact p.Prime]
(hG : ¬ OddOrder.Isaacs.Ch05.HasNormalPComplement p G) :
∃ U : Subgroup G,
IsBadNormalizerPSubgroup p U ∧
(∀ X : Subgroup G, IsBadNormalizerPSubgroup p X →
normalizerPPart p X ≤ normalizerPPart p U) ∧
(∀ X : Subgroup G, IsBadNormalizerPSubgroup p X →
normalizerPPart p X = normalizerPPart p U → Nat.card X ≤ Nat.card U) := by sorry
end MinimalCounterexampleStepOne
end OddOrder.Isaacs.Ch07Source
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/Isaacs/Ch07_ThompsonSubgroup/S7C_ThompsonPComplement.lean#L416-L462