Isaacs §4B: commutators of weight and the action commutator
DefinitionOddOrder_Isaacs_Ch04_Commutators_Main_ThreeSubgroupsfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Part of the Isaacs, Finite Group Theory, Chapter 4 formalization, around the three-subgroups lemma and its coprime-action versions. It introduces commutator bracket trees of weight and the action commutator subgroup .
Main definitions: CommutatorTree (bracket trees of weight , Isaacs p. 124, with leaves ), weight (number of leaves), eval (the subgroup a tree determines), leftTree (the left-normed tree ), and actionCommutator (, generated by , shown normal in ).
The bundle also proves 22 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/Ch04_Commutators/Main/ThreeSubgroups.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_Ch04_Commutators_Main_CommutatorBasics
namespace OddOrder.Isaacs.Ch04
open scoped commutatorElement
variable {G : Type*} [Group G]
section
/-- **Isaacs Cor 4.10** (Three-subgroups mod `N`):
`N ⊴ G` を含む形での 4.9 — `⁅⁅H₂, H₃⁆, H₁⁆ ≤ N ∧ ⁅⁅H₃, H₁⁆, H₂⁆ ≤ N
⇒ ⁅⁅H₁, H₂⁆, H₃⁆ ≤ N`.
商写像 `G → G/N` で push し, image 上で mathlib `commutator_commutator_eq_bot_of_rotate`
を適用. -/
theorem commutator_commutator_le_of_rotate {H₁ H₂ H₃ N : Subgroup G} [N.Normal]
(h1 : ⁅⁅H₂, H₃⁆, H₁⁆ ≤ N) (h2 : ⁅⁅H₃, H₁⁆, H₂⁆ ≤ N) :
⁅⁅H₁, H₂⁆, H₃⁆ ≤ N := by
-- Use `≤ N ↔ map (mk' N) = ⊥` (since ker (mk' N) = N).
set π : G →* G ⧸ N := QuotientGroup.mk' N with hπ
have to_quot : ∀ {K : Subgroup G}, K ≤ N ↔ K.map π = ⊥ := by
intro K
rw [eq_bot_iff, Subgroup.map_le_iff_le_comap]
constructor
· intro h x hx
rw [Subgroup.mem_comap, hπ, Subgroup.mem_bot, QuotientGroup.mk'_apply,
QuotientGroup.eq_one_iff]
exact h hx
· intro h x hx
have := h hx
rw [Subgroup.mem_comap, hπ, Subgroup.mem_bot, QuotientGroup.mk'_apply,
QuotientGroup.eq_one_iff] at this
exact this
rw [to_quot]
rw [to_quot] at h1 h2
-- Map distributes over commutator.
simp only [Subgroup.map_commutator] at h1 h2 ⊢
exact Subgroup.commutator_commutator_eq_bot_of_rotate h1 h2
/-- **重み `n` の交換子の括弧木** (Isaacs p.124 "commutator of **weight** `n`").
葉 = `G` のコピー, 節 = 部分群交換子 `⁅-,-⁆`. -/
inductive CommutatorTree : Type
| /-- `G` のコピー 1 個 (重み 1). -/ leaf : CommutatorTree
| /-- 2 つの交換子の交換子 `⁅l, r⁆`. -/ node : CommutatorTree → CommutatorTree →
CommutatorTree
deriving DecidableEq
namespace CommutatorTree
/-- 木の**重み** = 葉の個数 (Isaacs の weight). -/
def weight : CommutatorTree → ℕ
| leaf => 1
| node l r => l.weight + r.weight
/-- 括弧木が定める `G` の部分群: 葉 ↦ `⊤ = G`, 節 ↦ `⁅-,-⁆`. -/
def eval (G : Type*) [Group G] : CommutatorTree → Subgroup G
| leaf => ⊤
| node l r => ⁅eval G l, eval G r⁆
@[simp] theorem weight_leaf : leaf.weight = 1 := rfl
@[simp] theorem weight_node (l r : CommutatorTree) :
(node l r).weight = l.weight + r.weight := rfl
@[simp] theorem eval_leaf : eval G leaf = ⊤ := rfl
@[simp] theorem eval_node (l r : CommutatorTree) :
eval G (node l r) = ⁅eval G l, eval G r⁆ := rfl
/-- **左結合の重み `n+1` の木** `⁅...⁅⁅G,G⁆,G⁆...,G⁆`. -/
def leftTree : ℕ → CommutatorTree
| 0 => leaf
| n + 1 => node (leftTree n) leaf
@[simp] theorem weight_leftTree (n : ℕ) : (leftTree n).weight = n + 1 := by
induction n with
| zero => rfl
| succ n ih => simp [leftTree, ih]
/-- 書籍の但し書き「左結合の重み `n` の交換子は**ちょうど** `G^n`」
(mathlib indexing で `G^{n+1} = lcs n`). -/
@[simp] theorem eval_leftTree (n : ℕ) :
eval G (leftTree n) = (⊤ : Subgroup G).lowerCentralSeries n := by
induction n with
| zero => rfl
| succ n ih => simp [leftTree, ih]
end CommutatorTree
end
section
/-- A finite `p`-group is a `{p}`-group in the π-group sense. -/
theorem isPiGroup_singleton_of_isPGroup {G : Type*} [Group G] [Finite G]
{p : ℕ} [Fact p.Prime] {H : Subgroup G} (hH : IsPGroup p H) :
OddOrder.Isaacs.Ch03.Subgroup.IsPiGroup ({p} : Set ℕ) H := by
intro q hq
obtain ⟨n, hn⟩ := (IsPGroup.iff_card (G := H)).mp hH
rw [hn] at hq
by_cases hn0 : n = 0
· simp [hn0] at hq
· rw [Nat.primeFactors_prime_pow hn0 Fact.out] at hq
simpa using hq
/-- A finite `{p}`-group in the π-group sense is a `p`-group. -/
theorem isPGroup_of_isPiGroup_singleton {G : Type*} [Group G] [Finite G]
{p : ℕ} [Fact p.Prime] {H : Subgroup G}
(hH : OddOrder.Isaacs.Ch03.Subgroup.IsPiGroup ({p} : Set ℕ) H) :
IsPGroup p H := by
rw [IsPGroup.iff_card]
exact ⟨(Nat.card H).primeFactorsList.length,
Nat.eq_prime_pow_of_unique_prime_dvd Nat.card_pos.ne' (fun {q} hq_prime hq_dvd => by
have hq_pf : q ∈ (Nat.card H).primeFactors :=
Nat.mem_primeFactors.mpr ⟨hq_prime, hq_dvd, Nat.card_pos.ne'⟩
simpa using hH q hq_pf)⟩
/-- Singleton π-core agrees with the usual `p`-core. -/
theorem oPiCore_singleton_eq_opCore {G : Type*} [Group G] [Finite G]
(p : ℕ) [Fact p.Prime] :
OddOrder.Isaacs.Ch03.oPiCore ({p} : Set ℕ) G =
OddOrder.Isaacs.Ch01.opCore p G := by
apply le_antisymm
· exact OddOrder.Isaacs.Ch01.normal_pgroup_le_opCore
(isPGroup_of_isPiGroup_singleton (OddOrder.Isaacs.Ch03.oPiCore.isPiGroup ({p} : Set ℕ)))
· exact OddOrder.Isaacs.Ch03.Subgroup.IsPiGroup.le_oPiCore
(isPiGroup_singleton_of_isPGroup (OddOrder.Isaacs.Ch01.opCore_isPGroup p G))
/-- **作用交換子部分群** `[G, A]_φ` := 集合 `{g * (φ a) g⁻¹ : g ∈ G, a ∈ A}` の生成部分群.
これは Γ = G ⋊[φ] A 内で `⁅inl(G), inr(A)⁆` を `inl : G →* Γ` 経由で pull back した
ものに対応する. 具体的計算: `[inl(g), inr(a)] = inl(g * (φ a) g⁻¹)` (`inl_aut` 経由).
下流 Isaacs §4D 4.28-4.30 の `[G, A]` 記号の自然な実装. -/
def actionCommutator {A G : Type*} [Group A] [Group G] (φ : A →* MulAut G) : Subgroup G :=
Subgroup.closure {x : G | ∃ g : G, ∃ a : A, x = g * (φ a) g⁻¹}
/-- 自明作用 (φ = 1) の場合, `actionCommutator = ⊥` (各 generator = g * g⁻¹ = 1). -/
@[simp]
theorem actionCommutator_one_eq_bot {A G : Type*} [Group A] [Group G] :
actionCommutator (1 : A →* MulAut G) = ⊥ := by
rw [actionCommutator, Subgroup.closure_eq_bot_iff]
rintro _ ⟨g, a, rfl⟩
change g * (1 : MulAut G) g⁻¹ = 1
simp
/-- **`actionCommutator φ` は φ 作用下で A-不変**.
`(φ b) (g * (φ a) g⁻¹) = (φ b) g * (φ (b * a * b⁻¹)) ((φ b) g)⁻¹` (generator → generator 写像)
が両方向で成り立つので生成集合自体が `(φ b)`-stable. `closure_of_invariant_set` で結論. -/
theorem _root_.OddOrder.Isaacs.Ch03.IsAInvariant.actionCommutator
{A G : Type*} [Group A] [Group G] (φ : A →* MulAut G) :
OddOrder.Isaacs.Ch03.IsAInvariant φ (actionCommutator φ) := by
apply OddOrder.Isaacs.Ch03.IsAInvariant.closure_of_invariant_set
intro b
-- generator g * (φ a) g⁻¹ → (φ b) g * (φ (b·a·b⁻¹)) ((φ b) g)⁻¹ (= 別の generator).
have key : ∀ g : G, ∀ a : A,
(φ b) (g * (φ a) g⁻¹) = (φ b) g * (φ (b * a * b⁻¹)) ((φ b) g)⁻¹ := by
intro g a
rw [map_mul (φ b)]
congr 1
-- (φ b) ((φ a) g⁻¹) = (φ (b·a·b⁻¹)) ((φ b) g)⁻¹
rw [show ((φ b) g)⁻¹ = (φ b) g⁻¹ from (map_inv (φ b) g).symm,
show φ (b * a * b⁻¹) = (φ b) * (φ a) * (φ b)⁻¹ from by rw [map_mul, map_mul, map_inv],
MulAut.mul_apply, MulAut.mul_apply, MulAut.inv_apply_self]
ext x
refine ⟨?_, ?_⟩
· -- (φ b) '' S ⊆ S
rintro ⟨_, ⟨g, a, rfl⟩, rfl⟩
exact ⟨(φ b) g, b * a * b⁻¹, key g a⟩
· -- S ⊆ (φ b) '' S: take preimage via (φ b)⁻¹
rintro ⟨g, a, rfl⟩
refine ⟨(φ b)⁻¹ g * (φ (b⁻¹ * a * b)) ((φ b)⁻¹ g)⁻¹,
⟨(φ b)⁻¹ g, b⁻¹ * a * b, rfl⟩, ?_⟩
rw [map_mul (φ b)]
congr 1
· exact MulAut.apply_inv_self (M := G) (φ b) g
-- (φ b) ((φ (b⁻¹·a·b)) ((φ b)⁻¹ g)⁻¹) = (φ a) g⁻¹
rw [show ((φ b)⁻¹ g)⁻¹ = (φ b)⁻¹ g⁻¹ from (map_inv ((φ b)⁻¹) g).symm,
show φ (b⁻¹ * a * b) = (φ b)⁻¹ * (φ a) * (φ b) from by rw [map_mul, map_mul, map_inv],
MulAut.mul_apply, MulAut.mul_apply, MulAut.apply_inv_self, MulAut.apply_inv_self]
/-- **`(actionCommutator φ).map inl = ⁅inl.range, inr.range⁆`** (Γ = G ⋊[φ] A 内).
Γ 経由で `actionCommutator` を Γ 内 commutator subgroup と同一視. `inl` 経由 push が
Γ 内 commutator `⁅inl.range, inr.range⁆` に一致. これと Lem 4.1 (`⁅H, K⁆ ⊴ ⟨H, K⟩`)
を組合せて `(actionCommutator φ).Normal` (G 内) を導出する経路の主補題.
**証明**: 両側 `Subgroup.closure` 形に展開し集合等式. 生成元の対応は
`⁅inl g, inr a⁆ = inl (g * (φ a) g⁻¹)` (`SemidirectProduct.commutator_inl_inr`). -/
theorem actionCommutator_map_inl
{A G : Type*} [Group A] [Group G] (φ : A →* MulAut G) :
(actionCommutator φ).map (SemidirectProduct.inl : G →* G ⋊[φ] A) =
⁅(SemidirectProduct.inl : G →* G ⋊[φ] A).range,
(SemidirectProduct.inr : A →* G ⋊[φ] A).range⁆ := by
rw [actionCommutator, MonoidHom.map_closure, Subgroup.commutator_def]
congr 1
ext y
refine ⟨?_, ?_⟩
· rintro ⟨_, ⟨g, a, rfl⟩, rfl⟩
refine ⟨SemidirectProduct.inl g, ⟨g, rfl⟩, SemidirectProduct.inr a, ⟨a, rfl⟩, ?_⟩
exact SemidirectProduct.commutator_inl_inr (φ := φ) g a
· rintro ⟨_, ⟨g, rfl⟩, _, ⟨a, rfl⟩, rfl⟩
refine ⟨g * (φ a) g⁻¹, ⟨g, a, rfl⟩, ?_⟩
exact (SemidirectProduct.commutator_inl_inr (φ := φ) g a).symm
/-- Restricted-action version of `actionCommutator_map_inl`.
If `B` acts on `G` through `i : B →* A` and `φ : A →* MulAut G`, then the
`B`-action commutator maps into the same semidirect product `G ⋊[φ] A` as the
commutator of `inl(G)` with the image of `B` inside `inr(A)`. -/
theorem actionCommutator_map_inl_comp
{A B G : Type*} [Group A] [Group B] [Group G]
(φ : A →* MulAut G) (i : B →* A) :
(actionCommutator (φ.comp i)).map (SemidirectProduct.inl : G →* G ⋊[φ] A) =
⁅(SemidirectProduct.inl : G →* G ⋊[φ] A).range,
((SemidirectProduct.inr : A →* G ⋊[φ] A).comp i).range⁆ := by
rw [actionCommutator, MonoidHom.map_closure, Subgroup.commutator_def]
congr 1
ext y
refine ⟨?_, ?_⟩
· rintro ⟨_, ⟨g, b, rfl⟩, rfl⟩
refine ⟨SemidirectProduct.inl g, ⟨g, rfl⟩,
SemidirectProduct.inr (i b), ⟨b, rfl⟩, ?_⟩
exact SemidirectProduct.commutator_inl_inr (φ := φ) g (i b)
· rintro ⟨_, ⟨g, rfl⟩, _, ⟨b, rfl⟩, rfl⟩
refine ⟨g * (φ (i b)) g⁻¹, ⟨g, b, rfl⟩, ?_⟩
exact (SemidirectProduct.commutator_inl_inr (φ := φ) g (i b)).symm
/-- **`actionCommutator φ` は G で normal subgroup**.
経路: `actionCommutator_map_inl` で `(actionCommutator φ).map inl = ⁅inl.range, inr.range⁆`,
Γ 内で `inl.range ⊔ inr.range = ⊤` (`SemidirectProduct.inl_range_sup_inr_range_eq_top`) より
Lem 4.1 系 `commutator_normal_of_sup_eq_top` で `⁅inl.range, inr.range⁆.Normal`. `inl`
injectivity で pull back (`Subgroup.Normal.of_map_injective`).
Isaacs §4C 冒頭注 (Lem 4.1 を Γ で適用) を直接実装. -/
instance actionCommutator.normal {A G : Type*} [Group A] [Group G] (φ : A →* MulAut G) :
(actionCommutator φ).Normal := by
refine Subgroup.Normal.of_map_injective
(φ := (SemidirectProduct.inl : G →* G ⋊[φ] A)) SemidirectProduct.inl_injective ?_
rw [actionCommutator_map_inl]
exact commutator_normal_of_sup_eq_top SemidirectProduct.inl_range_sup_inr_range_eq_top
/-- **Isaacs Lemma 4.20** (element form, right): `actionCommutator φ ≤ N` iff
`∀ a g, (φ a) g * g⁻¹ ∈ N`. つまり `actionCommutator φ` は
`{(φ a) g * g⁻¹ : a g}` で生成される最小の部分群.
**意味**: `N ⊴ G` が `A`-不変なら `actionCommutator ≤ N ↔ A acts trivially on G/N`
(右剰余類 `Nx` が A 不変 ↔ `(φ a) x ∈ Nx`).
**証明**: `actionCommutator` は `g * (φ a) g⁻¹ = ((φ a) g * g⁻¹)⁻¹` で生成されるので
`(φ a) g * g⁻¹` の集合と同じ subgroup を生成する. -/
theorem actionCommutator_le_iff {A G : Type*} [Group A] [Group G]
(φ : A →* MulAut G) (N : Subgroup G) :
actionCommutator φ ≤ N ↔ ∀ a : A, ∀ g : G, (φ a) g * g⁻¹ ∈ N := by
constructor
· intro h a g
have h_gen : g * (φ a) g⁻¹ ∈ actionCommutator φ :=
Subgroup.subset_closure ⟨g, a, rfl⟩
have h_inv : (φ a) g * g⁻¹ = (g * (φ a) g⁻¹)⁻¹ := by
rw [show (φ a) g⁻¹ = ((φ a) g)⁻¹ from map_inv (φ a) g]
group
rw [h_inv]
exact Subgroup.inv_mem _ (h h_gen)
· intro h
rw [actionCommutator, Subgroup.closure_le]
rintro _ ⟨g, a, rfl⟩
have h_form : g * (φ a) g⁻¹ = ((φ a) g * g⁻¹)⁻¹ := by
rw [show (φ a) g⁻¹ = ((φ a) g)⁻¹ from map_inv (φ a) g]
group
rw [h_form]
exact Subgroup.inv_mem _ (h a g)
/-- **Isaacs Lemma 4.20** (element form, left): `actionCommutator φ ≤ N` iff
`∀ a g, g⁻¹ * (φ a) g ∈ N`. 左剰余類 `xN` 形.
**意味**: 左剰余類 `xN` が `A` 不変 ↔ `(φ a) x ∈ xN` ↔ `x⁻¹ * (φ a) x ∈ N`. -/
theorem actionCommutator_le_iff_left {A G : Type*} [Group A] [Group G]
(φ : A →* MulAut G) (N : Subgroup G) :
actionCommutator φ ≤ N ↔ ∀ a : A, ∀ g : G, g⁻¹ * (φ a) g ∈ N := by
rw [actionCommutator_le_iff]
-- ∀ a g, (φ a) g * g⁻¹ ∈ N ↔ ∀ a g, g⁻¹ * (φ a) g ∈ N
constructor
· intro h a x
have h' := h a x⁻¹
rw [show (φ a) x⁻¹ = ((φ a) x)⁻¹ from map_inv (φ a) x] at h'
-- h' : ((φ a) x)⁻¹ * x⁻¹⁻¹ ∈ N
have h_eq : ((φ a) x)⁻¹ * x⁻¹⁻¹ = (x⁻¹ * (φ a) x)⁻¹ := by group
rw [h_eq] at h'
simpa using Subgroup.inv_mem _ h'
· intro h a x
have h' := h a x⁻¹
rw [show (φ a) x⁻¹ = ((φ a) x)⁻¹ from map_inv (φ a) x] at h'
have h_eq : x⁻¹⁻¹ * ((φ a) x)⁻¹ = ((φ a) x * x⁻¹)⁻¹ := by group
rw [h_eq] at h'
simpa using Subgroup.inv_mem _ h'
/-- `actionCommutator φ = ⊥` iff `A` acts trivially on `G` (`∀ a g, (φ a) g = g`).
Lem 4.20 left form を `N = ⊥` で特殊化. BaerMul wrapper への翻訳に基本. -/
theorem actionCommutator_eq_bot_iff_acts_trivially {A G : Type*} [Group A] [Group G]
(φ : A →* MulAut G) :
actionCommutator φ = ⊥ ↔ ∀ a : A, ∀ g : G, (φ a) g = g := by
rw [eq_bot_iff, actionCommutator_le_iff_left]
refine ⟨fun h a g => ?_, fun h a g => ?_⟩
· have hg := h a g
rw [Subgroup.mem_bot, inv_mul_eq_one] at hg
exact hg.symm
· rw [Subgroup.mem_bot, h a g, inv_mul_cancel]
/-- **A-不変部分群への作用制限**: `φ : A →* MulAut G` + `IsAInvariant φ H` から
`A →* MulAut ↥H` を構成. 関数本体は `(φ a)` を `H` に制限したもの.
Thm 4.36 induction で IH を `[G, A] < G` 等の subgroup に適用するために必要. -/
def _root_.OddOrder.Isaacs.Ch03.IsAInvariant.toMulAutHom {A G : Type*} [Group A] [Group G]
{φ : A →* MulAut G} {H : Subgroup G}
(hH : OddOrder.Isaacs.Ch03.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 (by
change (φ a)⁻¹ ((φ a) h.val) = h.val
simp)
right_inv := fun h => Subtype.ext (by
change (φ a) ((φ a)⁻¹ h.val) = h.val
simp)
map_mul' := fun x y => Subtype.ext (map_mul (φ a) x.val y.val)
}
map_one' := by
ext h
change ((φ 1 : MulAut G) h.val) = h.val
simp
map_mul' a b := by
ext h
change ((φ (a * b) : MulAut G) h.val) = ((φ a) ((φ b) h.val))
rw [map_mul]; rfl
@[simp] lemma _root_.OddOrder.Isaacs.Ch03.IsAInvariant.toMulAutHom_apply_val
{A G : Type*} [Group A] [Group G] {φ : A →* MulAut G} {H : Subgroup G}
(hH : OddOrder.Isaacs.Ch03.IsAInvariant φ H) (a : A) (h : H) :
((OddOrder.Isaacs.Ch03.IsAInvariant.toMulAutHom hH a) h).val =
(φ a) h.val := rfl
/-- If `H` is A-invariant and `K` is characteristic in `H`, then the image of `K`
inside `G` is A-invariant. -/
theorem _root_.OddOrder.Isaacs.Ch03.IsAInvariant.map_subtype_of_characteristic
{A G : Type*} [Group A] [Group G] {φ : A →* MulAut G}
{H : Subgroup G} (hH : OddOrder.Isaacs.Ch03.IsAInvariant φ H)
{K : Subgroup H} [K.Characteristic] :
OddOrder.Isaacs.Ch03.IsAInvariant φ (K.map H.subtype) := by
rw [OddOrder.Isaacs.Ch03.isAInvariant_iff_smul_mem]
intro a x hx
rcases hx with ⟨k, hk, rfl⟩
let ψ : A →* MulAut H := OddOrder.Isaacs.Ch03.IsAInvariant.toMulAutHom hH
have hK_map : K.map (ψ a).toMonoidHom = K :=
(Subgroup.characteristic_iff_map_eq.mp inferInstance) (ψ a)
have hk' : (ψ a) k ∈ K := by
have : (ψ a) k ∈ K.map (ψ a).toMonoidHom := ⟨k, hk, rfl⟩
rwa [hK_map] at this
exact ⟨(ψ a) k, hk', rfl⟩
/-- **A-不変正規部分群で割った商群への誘導作用**.
`N` が `φ` で不変なら, 各 `φ a` は `G/N` の自己同型を誘導する. -/
noncomputable def _root_.OddOrder.Isaacs.Ch03.IsAInvariant.quotientMulAutHom
{A G : Type*} [Group A] [Group G] {φ : A →* MulAut G}
{N : Subgroup G} [N.Normal]
(hN : OddOrder.Isaacs.Ch03.IsAInvariant φ N) : A →* MulAut (G ⧸ N) where
toFun a := QuotientGroup.congr N N (φ a) (by
change N.map (φ a).toMonoidHom = N
exact hN a)
map_one' := by
ext q
refine QuotientGroup.induction_on q ?_
intro g
simp
map_mul' a b := by
ext q
refine QuotientGroup.induction_on q ?_
intro g
simp [map_mul]
@[simp] lemma _root_.OddOrder.Isaacs.Ch03.IsAInvariant.quotientMulAutHom_apply_mk'
{A G : Type*} [Group A] [Group G] {φ : A →* MulAut G}
{N : Subgroup G} [N.Normal]
(hN : OddOrder.Isaacs.Ch03.IsAInvariant φ N) (a : A) (g : G) :
(_root_.OddOrder.Isaacs.Ch03.IsAInvariant.quotientMulAutHom hN a)
(QuotientGroup.mk' N g) =
QuotientGroup.mk' N ((φ a) g) := rfl
@[simp] lemma _root_.OddOrder.Isaacs.Ch03.IsAInvariant.quotientMulAutHom_apply
{A G : Type*} [Group A] [Group G] {φ : A →* MulAut G}
{N : Subgroup G} [N.Normal]
(hN : OddOrder.Isaacs.Ch03.IsAInvariant φ N) (a : A) (g : G) :
(_root_.OddOrder.Isaacs.Ch03.IsAInvariant.quotientMulAutHom hN a) (g : G ⧸ N) =
((φ a) g : G ⧸ N) := rfl
/-- The action commutator descends to quotients as the image of the action commutator. -/
theorem actionCommutator_quotient_eq_map
{A G : Type*} [Group A] [Group G] {φ : A →* MulAut G}
{N : Subgroup G} [N.Normal]
(hN : OddOrder.Isaacs.Ch03.IsAInvariant φ N) :
actionCommutator (_root_.OddOrder.Isaacs.Ch03.IsAInvariant.quotientMulAutHom hN) =
(actionCommutator φ).map (QuotientGroup.mk' N) := by
rw [actionCommutator, actionCommutator, MonoidHom.map_closure]
congr 1
ext y
constructor
· rintro ⟨q, a, rfl⟩
refine QuotientGroup.induction_on q ?_
intro g
refine ⟨g * (φ a) g⁻¹, ⟨g, a, rfl⟩, ?_⟩
simp [map_mul]
· rintro ⟨_, ⟨g, a, rfl⟩, rfl⟩
exact ⟨QuotientGroup.mk' N g, a, by simp [map_mul]⟩
end
end OddOrder.Isaacs.Ch04
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/Ch04_Commutators/Main/ThreeSubgroups.lean