Isaacs 7.6, Step 7: for
ProvedOddOrder.Isaacs.Ch07.omega1ZCenterOpCore_relIndex_inter_A_lefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let 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 and (omega1ZCenterOpCore G p).
Let be a Sylow -subgroup of and . If , then
This is Step 7 of the proof of Isaacs's Theorem 7.6, feeding the application of Theorem 7.5 in Step 8.
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.
Preamble
import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7A2_NormalPThm75 import Definitions.Def_OddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B1_NormalJ_Setup
Formal statement
namespace OddOrder.Isaacs.Ch07
open scoped commutatorElement
open scoped Pointwise
variable {G : Type*} [Group G]
theorem omega1ZCenterOpCore_relIndex_inter_A_le
{G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime]
(P : Sylow p G) {A : Subgroup G}
(hA : A ∈ Subgroup.maxElemAbelianIn (P : Subgroup G) p)
(hA_D_relIndex : (OddOrder.Isaacs.Ch01.opCore p G).relIndex A ≤ p) :
A.relIndex (omega1ZCenterOpCore G p) ≤ p := by sorry
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/S7B1_NormalJ.lean#L423-L562