Isaacs 7.6: for -separable with ,
ProvedOddOrder.Isaacs.Ch07.thompsonJ_le_opCore_of_normal_J_hypothesesLet be a finite group and a prime. Write for the largest normal -subgroup (opCore p G), for the largest normal -subgroup (oPiCore {q | q ≠ p} G), and for the center, viewed as a subgroup of .
Let and let be a Sylow -subgroup of . Assume that is -separable, that every -subgroup of is abelian, that , and that . Then
This is the core of Isaacs's Theorem 7.6 (Steps 1--7 plus the Step 8 normality), proved by strong induction on ; it later yields that is normal in in the Thompson normal -complement theorem.
Formalization Note. appears both as opCore p G and as oPiCore {p} G (the -core for ); Subgroup.relIndex H K is the index . "-separable" is the instance IsPiSeparable {p} G. is maxElemAbelianIn P p, the elementary abelian -subgroups of of maximal order, and is Subgroup.thompsonJ P p, the subgroup they generate.
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7A2_NormalPThm75 import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B1_NormalJ_Setup import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B2_NormalJClose
namespace OddOrder.Isaacs.Ch07
open scoped commutatorElement
open scoped Pointwise
variable {G : Type*} [Group G]
theorem thompsonJ_le_opCore_of_normal_J_hypotheses
{G : Type*} [Group G] [Finite G]
{p : ℕ} [Fact p.Prime] (P : Sylow p G)
(hp2 : p ≠ 2)
(h_pSolvable : OddOrder.Isaacs.Ch03.IsPiSeparable ({p} : Set ℕ) G)
(h2abelian : ∀ S : Subgroup G, IsPGroup 2 S → ∀ x y : ↥S, x * y = y * x)
(h_oPiPrime_trivial : OddOrder.Isaacs.Ch03.oPiCore {q | q ≠ p} G = ⊥)
(h_centralizer_center :
Subgroup.centralizer
(((Subgroup.center (P : Subgroup G)).map (P : Subgroup G).subtype) : Set G)
= (P : Subgroup G)) :
Subgroup.thompsonJ (P : Subgroup G) p ≤ OddOrder.Isaacs.Ch01.opCore p G := by sorry
end OddOrder.Isaacs.Ch07