Isaacs 7.1, Step 1: the maximal bad -subgroup equals
ProvedOddOrder.Isaacs.Ch07.maximal_badNormalizer_eq_opCoreSay that satisfies the Thompson local hypothesis at (HasThompsonPComplementHypothesis p G) if for every Sylow -subgroup of , both and have a normal -complement (HasNormalPComplement; a normal subgroup that complements every Sylow -subgroup). 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 satisfying the Thompson local hypothesis at , with the induction hypothesis that every finite group (same universe) with satisfying it has a normal -complement. Let be bad with for every bad , and for every bad with . Then
This concludes Step 1 in the minimal-counterexample proof of Isaacs's Theorem 7.1.
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B2_NormalJ_PComplement import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7C_ThompsonPComplement
namespace OddOrder.Isaacs.Ch07
open scoped Pointwise
variable {G : Type*} [Group G]
section MinimalCounterexampleStepOne
theorem maximal_badNormalizer_eq_opCore.{u}
{G : Type u} [Group G] [Finite G] {p : ℕ} [Fact p.Prime]
(hHyp : HasThompsonPComplementHypothesis p G)
(ih : ∀ (H : Type u) [Group H] [Finite H],
Nat.card H < Nat.card G →
HasThompsonPComplementHypothesis p H →
OddOrder.Isaacs.Ch05.HasNormalPComplement p H)
{U : Subgroup G} (hU_bad : IsBadNormalizerPSubgroup p U)
(hU_weight_max : ∀ X : Subgroup G, IsBadNormalizerPSubgroup p X →
normalizerPPart p X ≤ normalizerPPart p U)
(hU_card_max : ∀ X : Subgroup G, IsBadNormalizerPSubgroup p X →
normalizerPPart p X = normalizerPPart p U → Nat.card X ≤ Nat.card U) :
U = OddOrder.Isaacs.Ch01.opCore p G := by sorry
end MinimalCounterexampleStepOne
end OddOrder.Isaacs.Ch07