Isaacs 7.6, Step 5: , i.e.
ProvedOddOrder.Isaacs.Ch07.step5_Abar_card_eq_pLet 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 . Put .
Assume , is -separable, every -subgroup of is abelian, , is a Sylow -subgroup of with , together with the induction hypothesis ih: for every finite group (in the same universe as ) with that is -separable, has all -subgroups abelian and , and for every Sylow -subgroup of with , the Thompson subgroup is normal in . Let with and . Then
that is, the image of in has order .
This is Step 5 of the proof of Isaacs's Theorem 7.6: acts faithfully and coprimely on , and Lemma 6.20 forces it to be cyclic of order .
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 step5_Abar_card_eq_p.{u}
{G : Type u} [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))
(ih : ∀ (H : Type u) [Group H] [Finite H]
[OddOrder.Isaacs.Ch03.IsPiSeparable ({p} : Set ℕ) H],
Nat.card H < Nat.card G →
(∀ S : Subgroup H, IsPGroup 2 S → ∀ x y : ↥S, x * y = y * x) →
OddOrder.Isaacs.Ch03.oPiCore {q | q ≠ p} H = ⊥ →
∀ (Q : Sylow p H),
Subgroup.centralizer
(((Subgroup.center (Q : Subgroup H)).map
(Q : Subgroup H).subtype) : Set H)
= (Q : Subgroup H) →
(Subgroup.thompsonJ (Q : Subgroup H) p).Normal)
{A : Subgroup G}
(hA_mem : A ∈ Subgroup.maxElemAbelianIn (P : Subgroup G) p)
(hA_not_le : ¬ A ≤ OddOrder.Isaacs.Ch01.opCore p G)
(h_P_eq_UA : OddOrder.Isaacs.Ch01.opCore p G ⊔ A = (P : Subgroup G)) :
(OddOrder.Isaacs.Ch01.opCore p G).relIndex A = p := by sorry
end OddOrder.Isaacs.Ch07