Isaacs Ch. 3: solvable groups are -separable, , and -invariant subgroups
DefinitionOddOrder_Isaacs_Ch03_SplitExtensions_Mainfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
The tail of the Chapter 3 (Split Extensions) formalization of Isaacs, Finite Group Theory, including Cor 3.19 (finite solvable groups are -separable for every ), the subgroup and the notion of subgroups invariant under an automorphism action.
Main definitions: oPiPrimePiCore (, the preimage of ), IsAInvariant (a subgroup is -invariant under ) and its restricted action on , and isPiSeparable_of_isSolvable.
The bundle also proves 27 supporting lemmas used by later statements.
Definition code
/-
Copyright (c) 2026 Yawara Ishida. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Yawara Ishida
-/
-- From github.com/yawara/odd-order @ 20a6fccbb63c (Apache-2.0; LICENSE at that commit):
-- OddOrder/Isaacs/Ch03_SplitExtensions/Main.lean
-- Generated for Prove2Me by deleting declarations; the remaining commands are verbatim except:
-- `private` dropped where another file uses the declaration, and a solution's main theorem
-- renamed `_root_.solution` (platform convention).
import Definitions.Def_OddOrder_Isaacs_Ch03_SplitExtensions_CrossedHomomorphism
import Definitions.Def_OddOrder_Isaacs_Ch03_SplitExtensions_CyclicExtensions
import Definitions.Def_OddOrder_Isaacs_Ch03_SplitExtensions_WreathProduct
import Definitions.Def_OddOrder_Isaacs_Ch03_SplitExtensions_PiSeparableSeries
import Definitions.Def_OddOrder_Isaacs_Ch03_SplitExtensions_Theorem315
namespace OddOrder.Isaacs.Ch03
open SemidirectProduct
open scoped Pointwise
section
variable {G : Type*} [Group G]
/-- **Isaacs Cor 3.19**: `G` 有限 solvable ⇒ 全 π について π-separable. instance 形.
戦略: `Nat.card G ≤ Nat.card (Fₙ) + k` の `k` についての強誘導. 各ステップで
`Fₙ < ⊤` なら `G/Fₙ` 非自明可解で `exists_oPiCore_ne_bot_or_oPi'Core_ne_bot` 適用,
`Fₙ < F_{n+1}` ⇒ `|Fₙ| < |F_{n+1}|` で measure 単調減少. -/
instance isPiSeparable_of_isSolvable (π : Set ℕ) (G : Type*) [Group G] [Finite G]
[Group.IsSolvable G] :
IsPiSeparable π G where
exists_top := by
classical
suffices h : ∀ (k : ℕ) (n : ℕ),
Nat.card G ≤ Nat.card (piFittingSeries π G n) + k →
∃ m, piFittingSeries π G m = ⊤ from
h (Nat.card G) 0 (by simp)
intro k
induction k with
| zero =>
intro n hk
refine ⟨n, ?_⟩
have hle : piFittingSeries π G n ≤ (⊤ : Subgroup G) := le_top
apply Subgroup.eq_of_le_of_card_ge hle
have hcardTop : Nat.card ↥(⊤ : Subgroup G) = Nat.card G :=
Nat.card_congr Subgroup.topEquiv.toEquiv
omega
| succ k ih =>
intro n hk
by_cases h_top : piFittingSeries π G n = ⊤
· exact ⟨n, h_top⟩
· have hFn_lt_top : piFittingSeries π G n < ⊤ := lt_of_le_of_ne le_top h_top
have : Nontrivial (G ⧸ piFittingSeries π G n) := by
rw [QuotientGroup.nontrivial_iff]
exact ne_of_lt hFn_lt_top
have : Group.IsSolvable (G ⧸ piFittingSeries π G n) := inferInstance
have hOplus : oPiCore π (G ⧸ piFittingSeries π G n) ⊔
oPiCore {p | p ∉ π} (G ⧸ piFittingSeries π G n) ≠ ⊥ := by
rcases exists_oPiCore_ne_bot_or_oPi'Core_ne_bot (G := G ⧸ piFittingSeries π G n) π with
hπ | hπ'
· intro h; exact hπ (le_bot_iff.mp (h ▸ le_sup_left))
· intro h; exact hπ' (le_bot_iff.mp (h ▸ le_sup_right))
have hFn_lt : piFittingSeries π G n < piFittingSeries π G (n + 1) :=
(piFittingSeries_lt_succ_iff π n).mpr hOplus
have hcard_lt : Nat.card (piFittingSeries π G n) <
Nat.card (piFittingSeries π G (n + 1)) := by
rcases lt_iff_le_and_ne.mp hFn_lt with ⟨hle, hne⟩
refine lt_of_le_of_ne (Subgroup.card_le_of_le hle) ?_
intro hcard_eq
exact hne (Subgroup.eq_of_le_of_card_ge hle (le_of_eq hcard_eq.symm))
apply ih (n + 1)
omega
/-- **`C/B` nontrivial when `B < C`**:
`B < C` strict + `B ⊴ G` ⇒ `C.map (QuotientGroup.mk' B) ≠ ⊥`. -/
theorem Subgroup.map_quotientGroup_mk_ne_bot_of_lt {G : Type*} [Group G]
{B C : Subgroup G} [B.Normal] (hBC : B < C) :
C.map (QuotientGroup.mk' B) ≠ ⊥ := by
intro h
have hCleB : C ≤ B := by
intro c hc
have hmem : (QuotientGroup.mk' B) c ∈ C.map (QuotientGroup.mk' B) := ⟨c, hc, rfl⟩
rw [h, Subgroup.mem_bot] at hmem
rwa [QuotientGroup.mk'_apply, QuotientGroup.eq_one_iff] at hmem
exact absurd hCleB (fun hCB => (lt_irrefl _) (hBC.trans_le hCB))
/-- **Hall-Higman 3.21 setup**:
`¬ centralizer(O) ≤ O ⇒ B := centralizer(O) ⊓ O < centralizer(O)`. -/
theorem hall_higman_B_lt_C_of_not_le {G : Type*} [Group G] (π : Set ℕ)
(h_not_le : ¬ Subgroup.centralizer (oPiCore π G : Set G) ≤ oPiCore π G) :
Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G <
Subgroup.centralizer (oPiCore π G : Set G) := by
refine lt_of_le_of_ne inf_le_left ?_
intro h
apply h_not_le
rw [show Subgroup.centralizer (oPiCore π G : Set G) =
Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G from h.symm]
exact inf_le_right
/-- **Hall-Higman 3.21 case π closure**: K, B, C 関係 + K/B π-group + B < K ⇒ False. -/
theorem hall_higman_case_pi_contradiction
{G : Type*} [Group G] [Finite G] (π : Set ℕ)
{K : Subgroup G} [K.Normal]
(hKle : K ≤ Subgroup.centralizer (oPiCore π G : Set G))
(hBle : Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G ≤ K)
(hQpi : ∀ p ∈ (Nat.card ((↥K) ⧸
(Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G).subgroupOf K)).primeFactors,
p ∈ π)
(hStrict : Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G < K) :
False := by
have hBpi : Subgroup.IsPiGroup π
(Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G) :=
Subgroup.IsPiGroup.le inf_le_right (oPiCore.isPiGroup π)
have hBsubpi : Subgroup.IsPiGroup π
((Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G).subgroupOf K) :=
Subgroup.IsPiGroup.subgroupOf hBle hBpi
have hKpi : Subgroup.IsPiGroup π K := fun p hp =>
IsPiGroup.of_normal_quotient _ hBsubpi hQpi p hp
have hKle_B := hall_higman_case_pi_K_le_B π hKpi hKle
exact absurd hKle_B (lt_irrefl _ ∘ hStrict.trans_le)
/-- **Hall-Higman 3.21 case π body**: case π での K construction + 矛盾.
case π 仮定 (`oPiCore π (↥CB) ≠ ⊥`) から K = preimage of K_quot を構築し
`hall_higman_case_pi_contradiction` で False を導出. -/
private theorem hall_higman_case_pi_body
{G : Type*} [Group G] [Finite G] (π : Set ℕ)
(h_not_le : ¬ Subgroup.centralizer (oPiCore π G : Set G) ≤ oPiCore π G)
(hCπ : oPiCore π ↥((Subgroup.centralizer (oPiCore π G : Set G)).map
(QuotientGroup.mk' (Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G))) ≠ ⊥) :
False := by
set O : Subgroup G := oPiCore π G with hO_def
set C : Subgroup G := Subgroup.centralizer (O : Set G) with hC_def
set B : Subgroup G := C ⊓ O with hB_def
have hO_normal : O.Normal := inferInstance
have hC_normal : C.Normal := Subgroup.normal_centralizer
have hB_normal : B.Normal := by rw [hB_def]; infer_instance
have hBC_lt : B < C := hall_higman_B_lt_C_of_not_le π h_not_le
set CB : Subgroup (G ⧸ B) := C.map (QuotientGroup.mk' B) with hCB_def
have hCB_normal : CB.Normal := hC_normal.map _ QuotientGroup.mk_surjective
set K_quot : Subgroup ↥CB := oPiCore π ↥CB
have hKq_norm : K_quot.Normal := inferInstance
have hKq_char : K_quot.Characteristic := inferInstance
set K_GB : Subgroup (G ⧸ B) := K_quot.map CB.subtype with hKGB_def
have hKGB_norm : K_GB.Normal := inferInstance
set K : Subgroup G := K_GB.comap (QuotientGroup.mk' B) with hK_def
have hK_norm : K.Normal := inferInstance
have hKGB_le_CB : K_GB ≤ CB := by
have hRangEq : CB = (⊤ : Subgroup ↥CB).map CB.subtype := by
rw [← MonoidHom.range_eq_map]; exact CB.range_subtype.symm
rw [hRangEq]; exact Subgroup.map_mono le_top
have hKle_C : K ≤ C := Subgroup.comap_le_of_le_map_quotient inf_le_left hKGB_le_CB
have hBle_K : B ≤ K := by
intro x hx
simp only [hK_def, Subgroup.mem_comap]
rw [show (QuotientGroup.mk' B) x = 1 from (QuotientGroup.eq_one_iff x).mpr hx]
exact K_GB.one_mem
have hBK_lt : B < K := by
refine lt_of_le_of_ne hBle_K ?_
intro hBKeq
apply hCπ
have hKGB_bot : K_GB = ⊥ := by
rw [eq_bot_iff]
intro y hy
obtain ⟨x, hxy⟩ := QuotientGroup.mk_surjective y
rw [← hxy] at hy ⊢
have hx_K : x ∈ K := Subgroup.mem_comap.mpr hy
rw [← hBKeq] at hx_K
exact (QuotientGroup.eq_one_iff x).mpr hx_K
apply Subgroup.map_injective CB.subtype_injective
rw [Subgroup.map_bot]
exact hKGB_bot
have hQpi : ∀ p ∈ (Nat.card ((↥K) ⧸ (B.subgroupOf K))).primeFactors, p ∈ π := by
intro p hp
rw [Subgroup.nat_card_quotient_subgroupOf_eq_card_map B K] at hp
have hKmap_eq : K.map (QuotientGroup.mk' B) = K_GB :=
Subgroup.map_comap_eq_self_of_surjective QuotientGroup.mk_surjective K_GB
rw [hKmap_eq] at hp
have hcard : Nat.card ↥K_GB = Nat.card ↥K_quot :=
Nat.card_congr
(Subgroup.equivMapOfInjective K_quot CB.subtype CB.subtype_injective).symm.toEquiv
rw [hcard] at hp
exact (oPiCore.isPiGroup (G := ↥CB) π) p hp
exact hall_higman_case_pi_contradiction π hKle_C hBle_K hQpi hBK_lt
/-- **Hall-Higman 3.21 case π' body**: case π' での K + Schur-Zassenhaus + H' ⊴ K + 矛盾. -/
private theorem hall_higman_case_pi'_body
{G : Type*} [Group G] [Finite G] (π : Set ℕ)
(hπ' : oPiCore {p | p ∉ π} G = ⊥)
(h_not_le : ¬ Subgroup.centralizer (oPiCore π G : Set G) ≤ oPiCore π G)
(hCπ' : oPiCore {p | p ∉ π} ↥((Subgroup.centralizer (oPiCore π G : Set G)).map
(QuotientGroup.mk' (Subgroup.centralizer (oPiCore π G : Set G) ⊓ oPiCore π G))) ≠ ⊥) :
False := by
set O : Subgroup G := oPiCore π G with hO_def
set C : Subgroup G := Subgroup.centralizer (O : Set G) with hC_def
set B : Subgroup G := C ⊓ O with hB_def
have hO_normal : O.Normal := inferInstance
have hC_normal : C.Normal := Subgroup.normal_centralizer
have hB_normal : B.Normal := by rw [hB_def]; infer_instance
have hBC_lt : B < C := hall_higman_B_lt_C_of_not_le π h_not_le
set CB : Subgroup (G ⧸ B) := C.map (QuotientGroup.mk' B) with hCB_def
have hCB_normal : CB.Normal := hC_normal.map _ QuotientGroup.mk_surjective
set K_quot : Subgroup ↥CB := oPiCore {p | p ∉ π} ↥CB
have hKq_norm : K_quot.Normal := inferInstance
have hKq_char : K_quot.Characteristic := inferInstance
set K_GB : Subgroup (G ⧸ B) := K_quot.map CB.subtype with hKGB_def
have hKGB_norm : K_GB.Normal := inferInstance
set K : Subgroup G := K_GB.comap (QuotientGroup.mk' B) with hK_def
have hK_norm : K.Normal := inferInstance
have hKGB_le_CB : K_GB ≤ CB := by
have hRangEq : CB = (⊤ : Subgroup ↥CB).map CB.subtype := by
rw [← MonoidHom.range_eq_map]; exact CB.range_subtype.symm
rw [hRangEq]; exact Subgroup.map_mono le_top
have hKle_C : K ≤ C := Subgroup.comap_le_of_le_map_quotient inf_le_left hKGB_le_CB
have hBle_K : B ≤ K := by
intro x hx
simp only [hK_def, Subgroup.mem_comap]
rw [show (QuotientGroup.mk' B) x = 1 from (QuotientGroup.eq_one_iff x).mpr hx]
exact K_GB.one_mem
have hBK_lt : B < K := by
refine lt_of_le_of_ne hBle_K ?_
intro hBKeq
apply hCπ'
have hKGB_bot : K_GB = ⊥ := by
rw [eq_bot_iff]
intro y hy
obtain ⟨x, hxy⟩ := QuotientGroup.mk_surjective y
rw [← hxy] at hy ⊢
have hx_K : x ∈ K := Subgroup.mem_comap.mpr hy
rw [← hBKeq] at hx_K
exact (QuotientGroup.eq_one_iff x).mpr hx_K
apply Subgroup.map_injective CB.subtype_injective
rw [Subgroup.map_bot]
exact hKGB_bot
have hBpi : Subgroup.IsPiGroup π B :=
Subgroup.IsPiGroup.le inf_le_right (oPiCore.isPiGroup π)
have hBsub_pi : Subgroup.IsPiGroup π (B.subgroupOf K) :=
Subgroup.IsPiGroup.subgroupOf hBle_K hBpi
have hKBindex_pi' : ∀ p ∈ (B.subgroupOf K).index.primeFactors, p ∉ π := by
intro p hp
have hindex_eq : (B.subgroupOf K).index = Nat.card ↥K_GB := by
change Nat.card (↥K ⧸ (B.subgroupOf K)) = _
rw [Subgroup.nat_card_quotient_subgroupOf_eq_card_map B K]
have hKmap_eq : K.map (QuotientGroup.mk' B) = K_GB :=
Subgroup.map_comap_eq_self_of_surjective QuotientGroup.mk_surjective K_GB
rw [hKmap_eq]
rw [hindex_eq] at hp
have hcard : Nat.card ↥K_GB = Nat.card ↥K_quot :=
Nat.card_congr
(Subgroup.equivMapOfInjective K_quot CB.subtype CB.subtype_injective).symm.toEquiv
rw [hcard] at hp
exact (oPiCore.isPiGroup (G := ↥CB) {p | p ∉ π}) p hp
have hBsub_K_normal : (B.subgroupOf K).Normal := inferInstance
have hCoprime : Nat.Coprime (Nat.card ↥(B.subgroupOf K)) (B.subgroupOf K).index :=
Nat.coprime_of_isPiGroup_of_isPiGroup_compl Nat.card_pos.ne'
Subgroup.index_ne_zero_of_finite hBsub_pi hKBindex_pi'
obtain ⟨H', hH'_compl⟩ :=
Subgroup.exists_right_complement'_of_coprime (N := B.subgroupOf K) hCoprime
have hCommute : ∀ n ∈ B.subgroupOf K, ∀ h ∈ H', n * h = h * n := by
intro n hn h _
apply Subtype.ext
change n.val * h.val = h.val * n.val
have hnB : n.val ∈ B := hn
have hnO : n.val ∈ O := by
rw [hB_def, Subgroup.mem_inf] at hnB
exact hnB.2
have hh_in_K : h.val ∈ K := h.property
have hh_in_C : h.val ∈ C := hKle_C hh_in_K
exact (Subgroup.mem_centralizer_iff.mp hh_in_C) n.val hnO
have hH'_normal : H'.Normal := Subgroup.normal_complement_of_commute hH'_compl hCommute
have hH'_card : Nat.card ↥H' = (B.subgroupOf K).index := by
have hCompl_card : Nat.card ↥(B.subgroupOf K) * Nat.card ↥H' = Nat.card ↥K := by
rw [← Nat.card_prod]
exact Nat.card_congr (Subgroup.IsComplement.equiv hH'_compl).symm
have hKcard : Nat.card ↥K =
Nat.card (↥K ⧸ B.subgroupOf K) * Nat.card ↥(B.subgroupOf K) :=
(B.subgroupOf K).card_eq_card_quotient_mul_card_subgroup
have hpos : 0 < Nat.card ↥(B.subgroupOf K) := Nat.card_pos
have heq : Nat.card ↥H' * Nat.card ↥(B.subgroupOf K) =
(B.subgroupOf K).index * Nat.card ↥(B.subgroupOf K) := by
rw [Nat.mul_comm (Nat.card ↥H') _, hCompl_card, hKcard]
change (B.subgroupOf K).index * Nat.card ↥(B.subgroupOf K) =
(B.subgroupOf K).index * Nat.card ↥(B.subgroupOf K)
rfl
exact Nat.eq_of_mul_eq_mul_right hpos heq
have hH'_pi' : Subgroup.IsPiGroup {p | p ∉ π} H' := by
intro p hp
rw [hH'_card] at hp
exact hKBindex_pi' p hp
have hH'_le : H' ≤ oPiCore {p | p ∉ π} ↥K := hH'_pi'.le_oPiCore
have hOpi'_KG_normal : ((oPiCore {p | p ∉ π} ↥K).map K.subtype).Normal := inferInstance
have hOpi'_KG_pi' : Subgroup.IsPiGroup {p | p ∉ π}
((oPiCore {p | p ∉ π} ↥K).map K.subtype) := by
intro p hp
have hcard : Nat.card ↥((oPiCore {p | p ∉ π} ↥K).map K.subtype) =
Nat.card ↥(oPiCore {p | p ∉ π} ↥K) :=
Nat.card_congr (Subgroup.equivMapOfInjective _ K.subtype K.subtype_injective).symm.toEquiv
rw [hcard] at hp
exact oPiCore.isPiGroup (G := ↥K) {p | p ∉ π} p hp
have hKG_le_bot : (oPiCore {p | p ∉ π} ↥K).map K.subtype = ⊥ :=
eq_bot_of_isPiGroup_of_oPiCore_eq_bot {p | p ∉ π} hOpi'_KG_pi' hπ'
have hOpi'_K_bot : oPiCore {p | p ∉ π} ↥K = ⊥ := by
apply Subgroup.map_injective K.subtype_injective
rw [Subgroup.map_bot]
exact hKG_le_bot
have hH'_bot : H' = ⊥ := le_bot_iff.mp (hH'_le.trans (le_of_eq hOpi'_K_bot))
have hBsub_ne_top : B.subgroupOf K ≠ ⊤ := by
intro hEq
rw [Subgroup.subgroupOf_eq_top] at hEq
exact absurd hEq (fun hKleB => (lt_irrefl _) (hBK_lt.trans_le hKleB))
have hH'_card_gt : 1 < Nat.card ↥H' := by
rw [hH'_card]
exact Subgroup.one_lt_index_of_ne_top hBsub_ne_top
have hH'_card_one : Nat.card ↥H' = 1 := by
rw [hH'_bot, Subgroup.card_bot]
omega
/-- **Isaacs Thm 3.21 Hall-Higman 1.2.3** ⭐ **FT クリティカル**.
`G` π-separable + `O_{π'}(G) = ⊥` ⇒ `C_G(O_π(G)) ≤ O_π(G)`.
**所在**: Isaacs PDF p.94 の証明は **Ch.3 内部資産で完結** — π-separable normal series +
`Subgroup.centralizer` + Schur-Zassenhaus + Sylow のみを使う.
**証明戦略** (Isaacs p.94, 5 段階):
1. `C := C_G(O_π(G))`, `B := C ⊓ O_π(G)`. 目標 `B = C`. 背理法で `B < C`.
2. `B` は π-group, `B, C` は G で正規 (characteristic も).
3. `C/B` 非自明 π-separable ⇒ 非自明 characteristic 部分群 `K/B` で π-group か π'-group.
- `K/B ⊴ G/B` ⇒ `K ⊴ G`.
4. Case `K/B` π-group: `K` 正規 π-subgroup (B π-group + K/B π-group). `K ⊆ O_π(G)` で
`B < K ⊆ C` だが `B = C ⊓ O_π(G)` で矛盾.
5. Case `K/B` π'-group: Schur-Zassenhaus で複合 `K = B ⋊ H`, `H > 1` π'-group.
`H ⊆ C ⊆ C_G(B)` で `H ⊴ K`. `H ⊆ O_{π'}(K) ⊴ G` で `O_{π'}(G) = ⊥` 矛盾.
**下流被引用**: Ch.4 Thm 4.33 (mmd L2659), Ch.7 Thm 7.5 (L3853), Thm 7.6 (L3802) の 3 箇所.
**実装状態** ⭐ sorry-free. case π body + case π' body を
`exists_oPiCore_ne_bot_or_oPi'Core_ne_bot_of_isPiSeparable` (↥CB に対して) で場合分けして組み立て.
-/
theorem hall_higman_1_2_3 [Finite G] (π : Set ℕ) [IsPiSeparable π G]
(hπ' : oPiCore {p | p ∉ π} G = ⊥) :
Subgroup.centralizer (oPiCore π G : Set G) ≤ oPiCore π G := by
by_contra h_not_le
set O : Subgroup G := oPiCore π G with hO_def
set C : Subgroup G := Subgroup.centralizer (O : Set G) with hC_def
set B : Subgroup G := C ⊓ O with hB_def
have hO_normal : O.Normal := inferInstance
have hC_normal : C.Normal := Subgroup.normal_centralizer
have hB_normal : B.Normal := by rw [hB_def]; infer_instance
have hBC_lt : B < C := hall_higman_B_lt_C_of_not_le π h_not_le
set CB : Subgroup (G ⧸ B) := C.map (QuotientGroup.mk' B) with hCB_def
have hCB_ne_bot : CB ≠ ⊥ := Subgroup.map_quotientGroup_mk_ne_bot_of_lt hBC_lt
have hCB_nontrivial : Nontrivial ↥CB := (Subgroup.nontrivial_iff_ne_bot CB).mpr hCB_ne_bot
have hCB_normal : CB.Normal := hC_normal.map _ QuotientGroup.mk_surjective
have hQuot_piSeparable : IsPiSeparable π (G ⧸ B) :=
quotient_isPiSeparable π G B
have hCB_piSeparable : IsPiSeparable π ↥CB :=
normalSubgroup_isPiSeparable π (G ⧸ B) CB
rcases exists_oPiCore_ne_bot_or_oPi'Core_ne_bot_of_isPiSeparable (G := ↥CB) π with
hπCase | hπ'Case
· exact hall_higman_case_pi_body π h_not_le hπCase
· exact hall_higman_case_pi'_body π hπ' h_not_le hπ'Case
/-- `O_{π',π}(G)`: the preimage of `O_π(G/O_{π'}(G))`.
This is the subgroup appearing in Isaacs Thm 3.22. The theorem is usually stated as
`[O_{π',π}(G), O_{π',π}(G)] ≤ O_{π'}(G)`, equivalent to π-length at most one. -/
def oPiPrimePiCore (π : Set ℕ) (G : Type*) [Group G] : Subgroup G :=
Subgroup.comap (QuotientGroup.mk' (oPiCore {p | p ∉ π} G))
(oPiCore π (G ⧸ oPiCore {p | p ∉ π} G))
instance oPiPrimePiCore.normal (π : Set ℕ) (G : Type*) [Group G] :
(oPiPrimePiCore π G).Normal := by
rw [oPiPrimePiCore]
infer_instance
/-- The lower `O_{π'}` layer is contained in `O_{π',π}`. -/
theorem oPiCore_compl_le_oPiPrimePiCore (π : Set ℕ) (G : Type*) [Group G] :
oPiCore {p | p ∉ π} G ≤ oPiPrimePiCore π G := by
intro g hg
rw [oPiPrimePiCore, Subgroup.mem_comap]
rw [show (QuotientGroup.mk' (oPiCore {p | p ∉ π} G)) g = 1
from (QuotientGroup.eq_one_iff g).mpr hg]
exact (oPiCore π (G ⧸ oPiCore {p | p ∉ π} G)).one_mem
end
section
variable {G : Type*} [Group G]
/-- **A-不変部分群**: `φ : A →* MulAut G` の作用下で `H ≤ G` が `A`-不変.
i.e., `∀ a ∈ A, φ(a) • H = H`. -/
def IsAInvariant {A : Type*} [Group A] (φ : A →* MulAut G) (H : Subgroup G) : Prop :=
∀ a : A, (φ a : MulAut G) • H = H
/-- A-不変な H に対し, 要素レベルで `(φ a) g ∈ H` が成立. -/
theorem IsAInvariant.smul_mem {A : Type*} [Group A] {φ : A →* MulAut G} {H : Subgroup G}
(hH : IsAInvariant φ H) (a : A) {g : G} (hg : g ∈ H) : (φ a) g ∈ H := by
have : (φ a) g ∈ (φ a) • H := ⟨g, hg, rfl⟩
rwa [hH a] at this
/-- **A-不変の特徴付け**: `IsAInvariant φ H ↔ ∀ a g, g ∈ H ⇒ (φ a) g ∈ H`. -/
theorem isAInvariant_iff_smul_mem {A : Type*} [Group A] {φ : A →* MulAut G} {H : Subgroup G} :
IsAInvariant φ H ↔ ∀ a : A, ∀ g, g ∈ H → (φ a) g ∈ H := by
refine ⟨fun hH a g hg => hH.smul_mem a hg, fun h a => ?_⟩
-- (φ a) • H = H. Show le_antisymm.
apply le_antisymm
· -- (φ a) • H ≤ H: image is in H by assumption
rintro _ ⟨g, hg, rfl⟩
exact h a g hg
· -- H ≤ (φ a) • H: take h, find preimage via (φ a)⁻¹
intro g hg
refine ⟨(φ a)⁻¹ g, ?_, MulAut.apply_inv_self G (φ a) g⟩
-- (φ a)⁻¹ g ∈ H: use h with a := a⁻¹, since φ is a hom, (φ a⁻¹) = (φ a)⁻¹
have hg' : (φ a⁻¹) g ∈ H := h a⁻¹ g hg
rw [φ.map_inv] at hg'
exact hg'
/-- A-不変な H に対し, 要素レベルで `(φ a)⁻¹ g ∈ H` が成立 (= 逆作用 a⁻¹ で smul_mem). -/
theorem IsAInvariant.inv_smul_mem {A : Type*} [Group A] {φ : A →* MulAut G} {H : Subgroup G}
(hH : IsAInvariant φ H) (a : A) {g : G} (hg : g ∈ H) : (φ a)⁻¹ g ∈ H := by
have hHinv : (φ a⁻¹) • H = H := hH a⁻¹
rw [φ.map_inv] at hHinv
have : (φ a)⁻¹ g ∈ (φ a)⁻¹ • H := ⟨g, hg, rfl⟩
rwa [hHinv] at this
/-- If an invariant subgroup of `W` is acted on by an automorphism whose underlying value is
conjugation by `g` in the ambient group, then `g` normalizes its image under `W.subtype`. -/
theorem IsAInvariant.mem_normalizer_map_subtype_of_smul_val {W : Subgroup G}
{A : Type*} [Group A] {φ : A →* MulAut W} {L : Subgroup W}
(hL : IsAInvariant φ L) {a : A} {g : G}
(hval : ∀ k : W, ((φ a k : W) : G) = g * (k : G) * g⁻¹) :
g ∈ Subgroup.normalizer ((L.map W.subtype : Subgroup G) : Set G) := by
rw [Subgroup.mem_normalizer_iff]
intro x
constructor
· rintro ⟨k, hk, rfl⟩
exact ⟨φ a k, hL.smul_mem _ hk, hval k⟩
· rintro ⟨k, hk, hkeq⟩
refine ⟨(φ a)⁻¹ k, hL.inv_smul_mem _ hk, ?_⟩
have hv2 := hval ((φ a)⁻¹ k)
rw [MulAut.apply_inv_self] at hv2
have h3 := hv2.symm.trans hkeq
exact mul_left_cancel (mul_right_cancel h3)
/-- ⊤ は常に A-不変. -/
theorem IsAInvariant.top {A : Type*} [Group A] (φ : A →* MulAut G) :
IsAInvariant φ (⊤ : Subgroup G) := fun a => by
ext x
simp only [Subgroup.mem_pointwise_smul_iff_inv_smul_mem, Subgroup.mem_top]
/-- ⊥ は常に A-不変. -/
theorem IsAInvariant.bot {A : Type*} [Group A] (φ : A →* MulAut G) :
IsAInvariant φ (⊥ : Subgroup G) := fun _ => Subgroup.smul_bot _
/-- A-不変部分群の交わりは A-不変. -/
theorem IsAInvariant.inf {A : Type*} [Group A] {φ : A →* MulAut G} {H K : Subgroup G}
(hH : IsAInvariant φ H) (hK : IsAInvariant φ K) : IsAInvariant φ (H ⊓ K) := fun a => by
rw [Subgroup.smul_inf, hH a, hK a]
/-- A-不変部分群の sup は A-不変. -/
theorem IsAInvariant.sup {A : Type*} [Group A] {φ : A →* MulAut G} {H K : Subgroup G}
(hH : IsAInvariant φ H) (hK : IsAInvariant φ K) : IsAInvariant φ (H ⊔ K) := fun a => by
rw [Subgroup.smul_sup, hH a, hK a]
/-- **Characteristic 部分群は常に A-不変**: H.Characteristic ⇒ IsAInvariant φ H for any φ.
mathlib `characteristic_iff_map_eq` 経由. -/
theorem IsAInvariant.of_characteristic {A : Type*} [Group A] (φ : A →* MulAut G)
{H : Subgroup G} [hH : H.Characteristic] : IsAInvariant φ H := fun a => by
change H.map (φ a).toMonoidHom = H
exact (Subgroup.characteristic_iff_map_eq.mp hH) (φ a)
/-- `derivedSeries G n` は A-不変 (characteristic instance 経由). -/
theorem IsAInvariant.derivedSeries {A : Type*} [Group A] (φ : A →* MulAut G) (n : ℕ) :
IsAInvariant φ (derivedSeries G n) :=
IsAInvariant.of_characteristic φ
/-- `Subgroup.center G` は A-不変 (characteristic instance 経由). -/
theorem IsAInvariant.center {A : Type*} [Group A] (φ : A →* MulAut G) :
IsAInvariant φ (Subgroup.center G) :=
IsAInvariant.of_characteristic φ
/-- `commutator G = G'` は A-不変 (derivedSeries 1 経由). -/
theorem IsAInvariant.commutator_self {A : Type*} [Group A] (φ : A →* MulAut G) :
IsAInvariant φ (commutator G) := by
rw [← derivedSeries_one]
exact IsAInvariant.derivedSeries φ 1
/-- `frattini G` (Frattini subgroup, mathlib def) は A-不変 (characteristic instance 経由). -/
theorem IsAInvariant.frattini {A : Type*} [Group A] (φ : A →* MulAut G) :
IsAInvariant φ (_root_.frattini G) :=
IsAInvariant.of_characteristic φ
/-- A-不変な集合 S の生成部分群 `Subgroup.closure S` は A-不変. -/
theorem IsAInvariant.closure_of_invariant_set {A : Type*} [Group A] {φ : A →* MulAut G}
{S : Set G} (hS : ∀ a : A, (φ a) '' S = S) :
IsAInvariant φ (Subgroup.closure S) := fun a => by
change (Subgroup.closure S).map (φ a).toMonoidHom = Subgroup.closure S
rw [MonoidHom.map_closure]
congr 1
exact hS a
/-- A-不変 + A-不変 の commutator は A-不変 (`Subgroup.map_commutator`). -/
theorem IsAInvariant.commutator {A : Type*} [Group A] {φ : A →* MulAut G} {H K : Subgroup G}
(hH : IsAInvariant φ H) (hK : IsAInvariant φ K) :
IsAInvariant φ ⁅H, K⁆ := fun a => by
change ⁅H, K⁆.map (φ a).toMonoidHom = ⁅H, K⁆
rw [Subgroup.map_commutator]
rw [show H.map (φ a).toMonoidHom = H from hH a,
show K.map (φ a).toMonoidHom = K from hK a]
/-- A-不変部分群の normalizer は A-不変 (`Subgroup.map_normalizer_eq_of_bijective`). -/
theorem IsAInvariant.normalizer {A : Type*} [Group A] {φ : A →* MulAut G} {H : Subgroup G}
(hH : IsAInvariant φ H) : IsAInvariant φ (Subgroup.normalizer H) := fun a => by
change (Subgroup.normalizer H).map (φ a).toMonoidHom = Subgroup.normalizer H
rw [Subgroup.map_normalizer_eq_of_bijective H (φ a).bijective,
show H.map (φ a).toMonoidHom = H from hH a]
/-- A-不変部分群の centralizer は A-不変. `Subgroup.map_centralizer_eq_of_bijective` +
`hH a` で (φ a) '' H = H が言えるので clean. -/
theorem IsAInvariant.centralizer {A : Type*} [Group A] {φ : A →* MulAut G} {H : Subgroup G}
(hH : IsAInvariant φ H) :
IsAInvariant φ (Subgroup.centralizer (H : Set G)) := fun a => by
change (Subgroup.centralizer (H : Set G)).map (φ a).toMonoidHom
= Subgroup.centralizer (H : Set G)
rw [Subgroup.map_centralizer_eq_of_bijective _ _ (φ a).bijective]
congr 1
-- want: (φ a).toMonoidHom '' (H : Set G) = (H : Set G)
have hH_set : ((H.map (φ a).toMonoidHom : Subgroup G) : Set G) = (H : Set G) := by
rw [show H.map (φ a).toMonoidHom = H from hH a]
exact hH_set
/-- A-不変部分群族の iSup は A-不変. -/
theorem IsAInvariant.iSup {A : Type*} [Group A] {φ : A →* MulAut G} {ι : Sort*}
{f : ι → Subgroup G} (hf : ∀ i, IsAInvariant φ (f i)) :
IsAInvariant φ (⨆ i, f i) := fun a => by
change (⨆ i, f i).map (φ a).toMonoidHom = ⨆ i, f i
rw [Subgroup.map_iSup]
exact iSup_congr fun i => hf i a
/-- **A-不変部分群への制限作用**: `φ : A →* MulAut G` + A-inv `H` から
`A →* MulAut ↥H` を構成する. 各 `a : A` で `(φ a)` は `H` を保つので
restricted MulEquiv ↥H ↥H を作る. -/
def IsAInvariant.restrict {A : Type*} [Group A] {φ : A →* MulAut G} {H : Subgroup G}
(hH : IsAInvariant φ H) : A →* MulAut ↥H where
toFun a := {
toFun := fun h => ⟨(φ a) h.val, hH.smul_mem a h.property⟩
invFun := fun h => ⟨(φ a)⁻¹ h.val, hH.inv_smul_mem a h.property⟩
left_inv := fun h => Subtype.ext (MulAut.inv_apply_self G (φ a) h.val)
right_inv := fun h => Subtype.ext (MulAut.apply_inv_self G (φ a) h.val)
map_mul' := fun x y => Subtype.ext (map_mul (φ a) x.val y.val)
}
map_one' := by
apply MulEquiv.ext
intro ⟨g, hg⟩
apply Subtype.ext
change (φ 1) g = g
rw [φ.map_one]
rfl
map_mul' a b := by
apply MulEquiv.ext
intro ⟨g, hg⟩
apply Subtype.ext
change (φ (a * b)) g = (φ a) ((φ b) g)
rw [φ.map_mul]
rfl
/-- restrict の値域への射影: A-inv H に対し, `(IsAInvariant.restrict hH a) h` の underlying
要素は `(φ a) h.val`. -/
@[simp]
theorem IsAInvariant.restrict_apply_val {A : Type*} [Group A] {φ : A →* MulAut G}
{H : Subgroup G} (hH : IsAInvariant φ H) (a : A) (h : ↥H) :
((hH.restrict a) h).val = (φ a) h.val := rfl
/-- A-不変 H と K (`K ≤ G`) に対し, `K.subgroupOf H` は restricted action `hH.restrict`
下で A-不変. -/
theorem IsAInvariant.subgroupOf {A : Type*} [Group A] {φ : A →* MulAut G}
{H K : Subgroup G} (hH : IsAInvariant φ H) (hK : IsAInvariant φ K) :
IsAInvariant hH.restrict (K.subgroupOf H) := fun a => by
ext ⟨g, hg⟩
simp only [Subgroup.mem_pointwise_smul_iff_inv_smul_mem, Subgroup.mem_subgroupOf]
constructor
· intro hmem
-- hmem : ((hH.restrict a)⁻¹ • ⟨g, hg⟩).val ∈ K
-- We have ((hH.restrict a)⁻¹ ⟨g, hg⟩).val = (φ a)⁻¹ g
-- So (φ a)⁻¹ g ∈ K (via hmem). Apply (φ a) to get g ∈ K.
have h1 : ((hH.restrict a)⁻¹ • (⟨g, hg⟩ : ↥H)).val = (φ a)⁻¹ g := rfl
have h2 : (φ a)⁻¹ g ∈ K := h1 ▸ hmem
have : (φ a) ((φ a)⁻¹ g) ∈ K := hK.smul_mem a h2
rwa [MulAut.apply_inv_self] at this
· intro hg_K
-- g ∈ K
-- Want ((hH.restrict a)⁻¹ ⟨g, hg⟩).val ∈ K, i.e., (φ a)⁻¹ g ∈ K.
change ((hH.restrict a)⁻¹ • (⟨g, hg⟩ : ↥H)).val ∈ K
change (φ a)⁻¹ g ∈ K
exact hK.inv_smul_mem a hg_K
end
end OddOrder.Isaacs.Ch03
Source
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/Ch03_SplitExtensions/Main.lean