Isaacs 7.6, Step 1(b): for
ProvedOddOrder.Isaacs.Ch07.oPiCorePrime_subgroup_eq_bot_of_opCore_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 .
Assume is -separable and . Then for every subgroup with ,
where is computed in the group .
This is Step 1(b) of the proof of Isaacs's Theorem 7.6; it lets the induction hypothesis be applied to such subgroups .
Preamble
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
Formal statement
namespace OddOrder.Isaacs.Ch07
open scoped commutatorElement
open scoped Pointwise
variable {G : Type*} [Group G]
theorem oPiCorePrime_subgroup_eq_bot_of_opCore_le
{G : Type*} [Group G] [Finite G] {p : ℕ} [Fact p.Prime]
[OddOrder.Isaacs.Ch03.IsPiSeparable ({p} : Set ℕ) G]
(h_oPiPrime_trivial : OddOrder.Isaacs.Ch03.oPiCore {q | q ≠ p} G = ⊥)
{H : Subgroup G} (hUH : OddOrder.Isaacs.Ch01.opCore p G ≤ H) :
OddOrder.Isaacs.Ch03.oPiCore {q | q ≠ p} (↥H) = ⊥ := 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/S7B2_NormalJClose.lean#L57-L138