Bender–Glauberman §1C: Frattini and Burnside operator lemmas (Lemmas 1.7–1.10)
DefinitionOddOrder_BG_Ch1_Preliminary_S01_BurnsideOperatorfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Formalizes the shared finite -group statements of Bender–Glauberman §1: Lemma 1.7 (Frattini quotient is elementary abelian) and Lemmas 1.8–1.10 (the Burnside operator machinery on -groups and fixed points of coprime automorphisms).
Main definitions: coprime_stabilizes_chain_trivial (BG Lemma 1.9, multi-step general form: a coprime action stabilizing a chain acts trivially), restrictAction (restricting an operator action to an -invariant subgroup), and coprime_nilpotent_acts_trivially_of_centralizer_self (BG Proposition 1.10: for acting coprimely on a nilpotent with self-centralizing condition, the action is trivial).
The bundle also proves 8 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/BG/Ch1_Preliminary/S01_BurnsideOperator.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_BG_Ch1_Preliminary_S01_FrattiniBurnside
namespace OddOrder.BG.Ch1.S01
open OddOrder.Isaacs.Ch01
open Pointwise
private theorem quotient_bot_isElementaryAbelian
{p : ℕ} {R : Type*} [Group R]
(hR : OddOrder.GroupTheory.IsElementaryAbelian p R) :
OddOrder.GroupTheory.IsElementaryAbelian p (R ⧸ (⊥ : Subgroup R)) := by
refine ⟨?_, ?_⟩
· intro a b
obtain ⟨x, rfl⟩ := QuotientGroup.mk'_surjective (⊥ : Subgroup R) a
obtain ⟨y, rfl⟩ := QuotientGroup.mk'_surjective (⊥ : Subgroup R) b
rw [← map_mul, hR.1 x y, map_mul]
· intro a
obtain ⟨x, rfl⟩ := QuotientGroup.mk'_surjective (⊥ : Subgroup R) a
rw [← map_pow, hR.2 x, map_one]
/-- **BG Lemma 1.7(c)**: For a finite p-group `R`, `Φ(R) = 1` iff `R` is elementary abelian.
Forward direction is the direct Frattini p-group argument. Reverse direction uses Isaacs Lemma 4.5:
`Φ(P) ≤ N ↔ P/N` is elementary abelian, with `N = ⊥`. -/
theorem frattini_eq_bot_iff_isElementaryAbelian
{p : ℕ} [Fact p.Prime] {R : Type*} [Group R] [Finite R]
(hR : IsPGroup p R) :
frattini R = ⊥ ↔ OddOrder.GroupTheory.IsElementaryAbelian p R := by
refine ⟨OddOrder.GroupTheory.IsPGroup.isElementaryAbelian_of_frattini_eq_bot hR,
fun hElem => ?_⟩
have hle : frattini R ≤ (⊥ : Subgroup R) :=
(OddOrder.Isaacs.Ch04.frattini_le_iff_isElementaryAbelian_quotient_of_pgroup
(P := R) (p := p) (N := (⊥ : Subgroup R)) hR).2
(quotient_bot_isElementaryAbelian hElem)
exact le_antisymm hle bot_le
private theorem pow_closure_characteristic
{n : ℕ} {R : Type*} [Group R] :
(Subgroup.closure (Set.range (fun x : R => x ^ n))).Characteristic := by
rw [Subgroup.characteristic_iff_map_le]
intro φ
rw [MonoidHom.map_closure, Subgroup.closure_le]
rintro _ ⟨_, ⟨x, rfl⟩, rfl⟩
exact Subgroup.subset_closure ⟨φ x, by simp [map_pow]⟩
/-- **BG Lemma 1.7(d) (⊆ direction)**: In a finite p-group `R`,
`Φ(R)` lies in the subgroup generated by commutators and p-th powers.
Let `K = R' ⊔ ⟨x^p | x ∈ R⟩`. The p-th-power closure is characteristic, hence normal, so
`K` is normal. Then `R/K` is elementary abelian: commutators and p-th powers vanish in the
quotient. Ch.4 Lemma 4.5 gives `Φ(R) ≤ K`. -/
theorem frattini_le_commutator_sup_pow_closure
{p : ℕ} [Fact p.Prime] {R : Type*} [Group R] [Finite R]
(hR : IsPGroup p R) :
frattini R ≤ commutator R ⊔ Subgroup.closure (Set.range (fun x : R => x ^ p)) := by
let Pows : Subgroup R := Subgroup.closure (Set.range (fun x : R => x ^ p))
let K : Subgroup R := commutator R ⊔ Pows
have hPowsChar : Pows.Characteristic := by
dsimp [Pows]
exact pow_closure_characteristic
have hPowsNorm : Pows.Normal := inferInstance
have hKNorm : K.Normal := by
dsimp [K]
infer_instance
have hElem : OddOrder.GroupTheory.IsElementaryAbelian p (R ⧸ K) := by
refine ⟨?_, ?_⟩
· have hcomm_le : commutator R ≤ K := by
dsimp [K]
exact le_sup_left
exact (Subgroup.Normal.quotient_commutative_iff_commutator_le.mpr hcomm_le).is_comm.comm
· intro q
obtain ⟨x, rfl⟩ := QuotientGroup.mk_surjective q
rw [← QuotientGroup.mk_pow, QuotientGroup.eq_one_iff]
dsimp [K, Pows]
exact
(le_sup_right :
Subgroup.closure (Set.range (fun x : R => x ^ p)) ≤
commutator R ⊔ Subgroup.closure (Set.range (fun x : R => x ^ p)))
(Subgroup.subset_closure ⟨x, rfl⟩)
have hle : frattini R ≤ K :=
(OddOrder.Isaacs.Ch04.frattini_le_iff_isElementaryAbelian_quotient_of_pgroup
(P := R) (p := p) (N := K) hR).2 hElem
simpa [K, Pows] using hle
/-- **BG Lemma 1.7(d)**: For a finite p-group `R`,
`Φ(R) = ⟨R', x^p | x ∈ R⟩`. -/
theorem commutator_sup_pow_closure_eq_frattini
{p : ℕ} [Fact p.Prime] {R : Type*} [Group R] [Finite R]
(hR : IsPGroup p R) :
commutator R ⊔ Subgroup.closure (Set.range (fun x : R => x ^ p)) = frattini R :=
le_antisymm
(OddOrder.GroupTheory.IsPGroup.commutator_sup_pow_closure_le_frattini hR)
(frattini_le_commutator_sup_pow_closure hR)
/-- **BG Theorem 1.8 (Burnside, operator on p-group)**: `A` を operator group とし,
`R` を p-群とする. `(|A|, |R|) = 1` かつ `A` が `R/Φ(R)` に自明に作用するとき,
`A` は `R` に自明に作用する.
**証明**: Isaacs Cor 3.29 (`OddOrder.Isaacs.Ch04.aFixed_quotient_frattini`:
Prop 1.5(d) + Lem 1.7(a) 合成形) を `G ↦ R` で適用するだけ.
⚠ 2026-07-19 以前は Cor 3.29 が `Group.IsSolvable A ∨ Group.IsSolvable G` を要求していたので、
ここで `R` p-群 ⇒ `IsNilpotent R` ⇒ `Group.IsSolvable R` を経由して `Or.inr` を渡していた。
Cor 3.29 が**書籍どおり可解性なしに一般化された**ため、その経由は不要になった。
**Isaacs 対応**: Isaacs FGT Thm 1.8 (完全一致). 本実装は Ch.4 forward §3E coprime action
machinery 経由で独立に成立している (Ch.1 §1B = 1.7–1.10 は別ルートで被覆済 —
`Ch01_Sylow/Basic.lean` の対応表).
**no-wrapper policy 例外**: 仮定特殊化 (`p`-群という文脈固有の仮定で述べ直す). -/
theorem burnside_operator {p : ℕ} [Fact p.Prime] {R : Type*} [Group R] [Finite R]
{A : Type*} [Group A] [Finite A]
(_hP : IsPGroup p R) {φ : A →* MulAut R}
(hCop : Nat.Coprime (Nat.card A) (Nat.card R))
(h_triv_quot : ∀ a : A, ∀ r : R, ∃ x ∈ _root_.frattini R, (φ a) r = r * x) :
∀ a : A, ∀ r : R, (φ a) r = r := by
exact OddOrder.Isaacs.Ch04.aFixed_quotient_frattini hCop h_triv_quot
/-- **Element form of BG Theorem 1.8 (Burnside)**: a `p'`-order automorphism `f` of a finite
`p`-group `H` all of whose powers act trivially modulo `Φ(H)` is the identity.
The elementwise companion of `burnside_operator`: apply it to the cyclic operator group
`⟨f⟩ = Subgroup.zpowers f` (coprimality of `|⟨f⟩|` with `|H| = pⁿ` follows from the `p'`-order
of `f`). Used by BG Theorem 3.6 (3.9) (`S03f_Prelim`) and Lemma 4.17 (`S04_PGroupsSmallRank`). -/
theorem mulAut_eq_one_of_coprime_orderOf_of_frattini {p : ℕ} [Fact p.Prime]
{H : Type*} [Group H] [Finite H] (hH : IsPGroup p H)
(f : MulAut H) (hcop : Nat.Coprime (orderOf f) p)
(htriv : ∀ z : ℤ, ∀ r : H, ∃ x ∈ _root_.frattini H, (f ^ z) r = r * x) :
f = 1 := by
classical
set B : Subgroup (MulAut H) := Subgroup.zpowers f with hB
set ψ : ↥B →* MulAut H := B.subtype with hψ
obtain ⟨n, hn⟩ := IsPGroup.iff_card.mp hH
have hcop' : Nat.Coprime (Nat.card ↥B) (Nat.card H) := by
rw [hB, Nat.card_zpowers, hn]
exact Nat.Coprime.pow_right n hcop
have htriv' : ∀ b : ↥B, ∀ r : H, ∃ x ∈ _root_.frattini H, (ψ b) r = r * x := by
rintro ⟨b, hb⟩ r
rw [hB, Subgroup.mem_zpowers_iff] at hb
obtain ⟨z, rfl⟩ := hb
exact htriv z r
have hconc := burnside_operator hH (φ := ψ) hcop' htriv'
ext r
rw [MulAut.one_apply]
exact hconc ⟨f, Subgroup.mem_zpowers f⟩ r
/-- **BG Lemma 1.9 (2-step instance, ambient G 形)**: 有限群 `G`, `A` coprime operator,
`N ⊴ G` が `A`-不変. `A` が `N` 上に自明 + `A` が `G/N` 上に自明 ⇒ `A` が `G` 上に自明.
**BG 原 statement との関係**: BG Lem 1.9 は「A が G の normal series を stabilize するとき
A/C_A(G) is π-group (G π-group)」と多段で述べるが, 証明は §1 内の各 induction step で
本 2-step の繰り返し適用. 本実装は §1 で使用される **2-step instance に絞った形** で,
多段版は本 2-step を normal series の長さで induct すれば得られる.
**証明**: 任意の `g : G` に対し Isaacs Cor 3.28 (`coprime_fixedPoints_quotient`) で
`∃ c ∈ C_G(A), c·N = g·N` を取り, `g = c · n⁻¹` (`n ∈ N`) と書く. すると
`φ a g = φ a c · φ a n⁻¹ = c · n⁻¹ = g` (`c ∈ C_G(A)` で `A`-fix, `n ∈ N` で `h_triv_N`).
**Isaacs 対応**: 直接対応無し (Ch.3 §3E coprime action machinery の application).
**no-wrapper policy 例外**: 2-step extension lemma, §1 内 Prop 1.10 等で再利用. -/
theorem coprime_actsTrivially_of_normal_and_quotient
{G : Type*} [Group G] [Finite G]
{A : Type*} [Group A] [Finite A]
{φ : A →* MulAut G} (hCop : Nat.Coprime (Nat.card A) (Nat.card G))
(hSolv : Group.IsSolvable A ∨ Group.IsSolvable G)
{N : Subgroup G} [N.Normal]
(hN_inv : OddOrder.Isaacs.Ch03.IsAInvariant φ N)
(h_triv_N : ∀ a : A, ∀ n ∈ N, (φ a) n = n)
(h_triv_quot : ∀ a : A, ∀ g : G, ∃ x ∈ N, (φ a) g = g * x) :
∀ a : A, ∀ g : G, (φ a) g = g := by
intro a g
obtain ⟨c, hc_fix, hc_coset⟩ :=
OddOrder.Isaacs.Ch04.coprime_fixedPoints_quotient hCop hSolv hN_inv
(fun a' => h_triv_quot a' g)
obtain ⟨n, hn_in, hc_eq⟩ := hc_coset
have hg_eq : g = c * n⁻¹ := by rw [hc_eq]; group
rw [hg_eq, map_mul, hc_fix a, map_inv, h_triv_N a n hn_in]
open OddOrder.Isaacs.Ch03 in
/-- **BG Lemma 1.9 (多段一般形, coprime 核)**: 有限群 `K` に有限群 `A` が
`ψ : A →* MulAut K` で coprime (`(|A|,|K|)=1`) 作用し, `A` または `K` が可解とする.
`K` の正規降鎖 `s` (`Antitone`, `s 0 = ⊤`, `s n = ⊥`, 各 `s i ◁ K`, `ψ`-不変) を `A` が
**stabilize** (各 factor `s i / s (i+1)` 上自明: `∀ x ∈ s i, ∃ y ∈ s (i+1), ψ a x = x * y`)
するなら, `ψ` は自明 (`∀ a, ψ a = 1`).
BG Lem 1.9 の原 statement「`G` solvable π-群, `A` が normal series を stabilize ⇒
`A/C_A(G)` は π-群」は, π'-元 `a` に対し `⟨a⟩` を本補題に渡す (coprime 性 = π'-性) ことで
elementwise に従う (§5 Thm 5.5 がこの形で使用)。AppA (PSTAB) の chain-stabilizer 補題も
本補題経由 (旧 AppA private から §1 へ昇格, 2026-06-02)。
`coprime_actsTrivially_of_normal_and_quotient` (2-step) を `↥(s i)` 上へ
`IsAInvariant.restrict` で制限し, 鎖を `m`-bound 付き上向き帰納で下降して `s 0 = ⊤` に到達. -/
theorem coprime_stabilizes_chain_trivial
{K : Type*} [Group K] [Finite K] {A : Type*} [Group A] [Finite A]
(ψ : A →* MulAut K) (hcop : (Nat.card A).Coprime (Nat.card K))
(hsolv : Group.IsSolvable A ∨ Group.IsSolvable K)
(s : ℕ → Subgroup K) (hanti : Antitone s) (hs0 : s 0 = ⊤) {n : ℕ} (hsn : s n = ⊥)
(hnorm : ∀ i, (s i).Normal)
(hinv : ∀ i, IsAInvariant ψ (s i))
(htriv : ∀ i, ∀ a : A, ∀ x ∈ s i, ∃ y ∈ s (i + 1), (ψ a) x = x * y) :
∀ a : A, ψ a = 1 := by
-- One step down: trivial on `s (i+1)` ⇒ trivial on `s i` (via the coprime 2-step lemma).
have stepdown : ∀ i, (∀ a : A, ∀ x, x ∈ s (i + 1) → (ψ a) x = x) →
∀ a : A, ∀ x, x ∈ s i → (ψ a) x = x := by
intro i hIH
have hN1 : (s (i + 1)).Normal := hnorm (i + 1)
have hcopi : (Nat.card A).Coprime (Nat.card ↥(s i)) :=
hcop.coprime_dvd_right (Subgroup.card_subgroup_dvd_card (s i))
have hsolvi : Group.IsSolvable A ∨ Group.IsSolvable ↥(s i) := by
rcases hsolv with h | h
· exact Or.inl h
· have := h; exact Or.inr inferInstance
have hInvN : IsAInvariant ((hinv i).restrict) ((s (i + 1)).subgroupOf (s i)) := by
rw [isAInvariant_iff_smul_mem]
intro a' g hg
rw [Subgroup.mem_subgroupOf] at hg ⊢
rw [IsAInvariant.restrict_apply_val]
exact (hinv (i + 1)).smul_mem a' hg
have htrivN : ∀ a' : A, ∀ g ∈ (s (i + 1)).subgroupOf (s i),
((hinv i).restrict a') g = g := by
intro a' g hg
rw [Subgroup.mem_subgroupOf] at hg
exact Subtype.ext (by rw [IsAInvariant.restrict_apply_val]; exact hIH a' g.val hg)
have htrivQ : ∀ a' : A, ∀ g : ↥(s i),
∃ y ∈ (s (i + 1)).subgroupOf (s i), ((hinv i).restrict a') g = g * y := by
intro a' g
obtain ⟨y, hy_mem, hy_eq⟩ := htriv i a' g.val g.property
refine ⟨⟨y, hanti (Nat.le_succ i) hy_mem⟩, ?_, ?_⟩
· rw [Subgroup.mem_subgroupOf]; exact hy_mem
· exact Subtype.ext (by rw [IsAInvariant.restrict_apply_val, Subgroup.coe_mul]; exact hy_eq)
have hconc := coprime_actsTrivially_of_normal_and_quotient
(φ := (hinv i).restrict) hcopi hsolvi hInvN htrivN htrivQ
intro a x hx
have h2 := congrArg Subtype.val (hconc a ⟨x, hx⟩)
rw [IsAInvariant.restrict_apply_val] at h2
exact h2
-- `s i = ⊥` for `i ≥ n`, and `stepdown` propagates triviality down to `s 0 = ⊤`.
have key : ∀ m i, n ≤ i + m → ∀ a : A, ∀ x, x ∈ s i → (ψ a) x = x := by
intro m
induction m with
| zero =>
intro i hi a x hx
have hxn : x ∈ s n := hanti (by simpa using hi) hx
rw [hsn, Subgroup.mem_bot] at hxn
subst hxn
exact map_one (ψ a)
| succ m ih =>
intro i hi a x hx
exact stepdown i (ih (i + 1) (by omega)) a x hx
intro a
refine MulEquiv.ext (fun x => ?_)
change (ψ a) x = x
exact key n 0 (by omega) a x (by rw [hs0]; exact Subgroup.mem_top x)
open OddOrder.Isaacs.Ch03 (IsAInvariant) in
/-- 演算子作用 `φ : A →* MulAut G` を `A`-不変部分群 `H` へ制限し `A →* MulAut ↥H` を得る.
Prop 1.10 等で `A` の作用を `N_G(C)` などの不変部分群上で扱うための橋. -/
def restrictAction {A G : Type*} [Group A] [Group G] {φ : A →* MulAut G} {H : Subgroup G}
(hH : IsAInvariant φ H) : A →* MulAut ↥H where
toFun a :=
{ toFun := fun g => ⟨φ a g, hH.smul_mem a g.2⟩
invFun := fun g => ⟨(φ a)⁻¹ g, hH.inv_smul_mem a g.2⟩
left_inv := fun g => Subtype.ext (MulAut.inv_apply_self G (φ a) g.1)
right_inv := fun g => Subtype.ext (MulAut.apply_inv_self G (φ a) g.1)
map_mul' := fun x y => Subtype.ext (map_mul (φ a) x.1 y.1) }
map_one' := MulEquiv.ext fun g => Subtype.ext <| by
change (φ 1) g.1 = g.1; rw [map_one, MulAut.one_apply]
map_mul' a b := MulEquiv.ext fun g => Subtype.ext <| by
change (φ (a * b)) g.1 = (φ a) ((φ b) g.1); rw [map_mul, MulAut.mul_apply]
open OddOrder.Isaacs.Ch03 (IsAInvariant) in
@[simp]
theorem restrictAction_apply {A G : Type*} [Group A] [Group G] {φ : A →* MulAut G}
{H : Subgroup G} (hH : IsAInvariant φ H) (a : A) (g : ↥H) :
(restrictAction hH a g : G) = φ a g := rfl
open OddOrder.Isaacs.Ch03 (IsAInvariant) in
/-- **BG Proposition 1.10** (mmd L445): `A` が冪零群 `G` 上の演算子群で `(|A|,|G|)=1`.
`C := C_G(A)` (`fixedPointsOfMulAut φ`) とおく. `C_G(C) ⊆ C` なら `A` は `G` 上自明に作用.
**証明** (BG): `x ∈ N_G(C)`, `a ∈ A`, `y ∈ C` に対し `xᵃx⁻¹ ∈ C_G(C) ⊆ C` を示すと `A` が
`N_G(C)/C` を中心化. `C` は `A`-fixed なので Lemma 1.9
(`coprime_actsTrivially_of_normal_and_quotient`) で `A` は `N_G(C)` 上自明 ⇒ `N_G(C) ⊆ C`
⇒ `C` self-normalizing ⇒ (冪零の normalizer condition) `C = ⊤` ⇒ `A` は `G` 上自明. -/
theorem coprime_nilpotent_acts_trivially_of_centralizer_self
{A G : Type*} [Group A] [Finite A] [Group G] [Finite G] [Group.IsNilpotent G]
{φ : A →* MulAut G}
(hCop : Nat.Coprime (Nat.card A) (Nat.card G))
(hCC : Subgroup.centralizer (Subgroup.fixedPointsOfMulAut φ : Set G)
≤ Subgroup.fixedPointsOfMulAut φ) :
∀ a : A, ∀ g : G, (φ a) g = g := by
set C := Subgroup.fixedPointsOfMulAut φ with hC
-- `C` is `A`-invariant (fixed pointwise).
have hC_inv : IsAInvariant φ C := by
rw [OddOrder.Isaacs.Ch03.isAInvariant_iff_smul_mem]
intro a g hg
rw [hC, Subgroup.mem_fixedPointsOfMulAut] at hg ⊢
intro a'
rw [hg a, hg a']
-- `N := N_G(C)` is `A`-invariant, contains `C`.
have hNC_inv : IsAInvariant φ (Subgroup.normalizer (C : Set G)) := hC_inv.normalizer
have hC_le_NC : C ≤ Subgroup.normalizer (C : Set G) := Subgroup.le_normalizer
have : (C.subgroupOf (Subgroup.normalizer (C : Set G))).Normal := Subgroup.normal_in_normalizer
-- coprimality / solvability descend to `↥N`.
have hcardNC : Nat.card ↥(Subgroup.normalizer (C : Set G)) ∣ Nat.card G :=
(Subgroup.normalizer (C : Set G)).card_subgroup_dvd_card
have hCopNC : Nat.Coprime (Nat.card A) (Nat.card ↥(Subgroup.normalizer (C : Set G))) :=
hCop.coprime_dvd_right hcardNC
have : Group.IsSolvable G := inferInstance
-- engine hypotheses (acting via `restrictAction hNC_inv` on `↥N`).
have hNinv_eng : IsAInvariant (restrictAction hNC_inv)
(C.subgroupOf (Subgroup.normalizer (C : Set G))) := by
rw [OddOrder.Isaacs.Ch03.isAInvariant_iff_smul_mem]
intro a x hx
have hx' : (x : G) ∈ C := Subgroup.mem_subgroupOf.mp hx
rw [Subgroup.mem_subgroupOf, restrictAction_apply]
exact hC_inv.smul_mem a hx'
have hTrivN_eng : ∀ a : A, ∀ x ∈ C.subgroupOf (Subgroup.normalizer (C : Set G)),
(restrictAction hNC_inv a) x = x := by
intro a x hx
rw [Subgroup.mem_subgroupOf] at hx
apply Subtype.ext
rw [restrictAction_apply]
exact (Subgroup.mem_fixedPointsOfMulAut.mp hx) a
have hQuot_eng : ∀ a : A, ∀ x : ↥(Subgroup.normalizer (C : Set G)),
∃ y ∈ C.subgroupOf (Subgroup.normalizer (C : Set G)),
(restrictAction hNC_inv a) x = x * y := by
intro a x
set g : G := x.1 with hg
have hgNC : g ∈ Subgroup.normalizer (C : Set G) := x.2
-- (i) `t := φ a g * g⁻¹` centralizes `C`, hence `t ∈ C`.
have htC : (φ a) g * g⁻¹ ∈ C := by
apply hCC
rw [Subgroup.mem_centralizer_iff]
intro y hy
rw [SetLike.mem_coe] at hy
have hyc : g⁻¹ * y * g ∈ C := by
have h := Subgroup.mem_normalizer_iff.mp (inv_mem hgNC) y
rw [inv_inv] at h
exact h.mp hy
have hfix : (φ a) (g⁻¹ * y * g) = g⁻¹ * y * g := by
rw [hC, Subgroup.mem_fixedPointsOfMulAut] at hyc; exact hyc a
rw [map_mul, map_mul, map_inv] at hfix
have hyfix : (φ a) y = y := by
rw [hC, Subgroup.mem_fixedPointsOfMulAut] at hy; exact hy a
rw [hyfix] at hfix
-- `hfix : (φ a g)⁻¹ * y * (φ a g) = g⁻¹ * y * g` ⇒ `Commute (φ a g * g⁻¹) y`.
have key : ((φ a) g * g⁻¹) * y * ((φ a) g * g⁻¹)⁻¹ = y :=
calc ((φ a) g * g⁻¹) * y * ((φ a) g * g⁻¹)⁻¹
= (φ a) g * (g⁻¹ * y * g) * ((φ a) g)⁻¹ := by group
_ = (φ a) g * (((φ a) g)⁻¹ * y * ((φ a) g)) * ((φ a) g)⁻¹ := by rw [← hfix]
_ = y := by group
exact (mul_inv_eq_iff_eq_mul.mp key).symm
-- (ii) `g⁻¹ * φ a g ∈ C` (conjugate of `t` by `g⁻¹`, `C` normal in `N_G(C)`).
have hyC : g⁻¹ * (φ a) g ∈ C := by
have h := Subgroup.mem_normalizer_iff.mp (inv_mem hgNC) ((φ a) g * g⁻¹)
rw [inv_inv] at h
have h2 : g⁻¹ * ((φ a) g * g⁻¹) * g ∈ C := h.mp htC
rwa [show g⁻¹ * ((φ a) g * g⁻¹) * g = g⁻¹ * (φ a) g by group] at h2
refine ⟨⟨g⁻¹ * (φ a) g, hC_le_NC hyC⟩, ?_, ?_⟩
· rw [Subgroup.mem_subgroupOf]; exact hyC
· apply Subtype.ext
rw [restrictAction_apply]
simp only [Subgroup.coe_mul]
rw [← hg]; group
-- engine ⇒ `A` trivial on `N_G(C)`.
have hTrivNC : ∀ a : A, ∀ x : ↥(Subgroup.normalizer (C : Set G)),
(restrictAction hNC_inv a) x = x :=
coprime_actsTrivially_of_normal_and_quotient hCopNC (Or.inr inferInstance)
hNinv_eng hTrivN_eng hQuot_eng
-- `N_G(C) ⊆ C`, so `C` is self-normalizing.
have hNC_le_C : Subgroup.normalizer (C : Set G) ≤ C := by
intro g hg
rw [hC, Subgroup.mem_fixedPointsOfMulAut]
intro a
exact congrArg Subtype.val (hTrivNC a ⟨g, hg⟩)
-- nilpotent ⇒ self-normalizing subgroup is `⊤`.
have hNCeqC : Subgroup.normalizer (C : Set G) = C := le_antisymm hNC_le_C hC_le_NC
have hC_top : C = ⊤ :=
(normalizerCondition_iff_only_full_group_self_normalizing.mp
Group.normalizerCondition_of_isNilpotent) C hNCeqC
intro a g
have hmem : g ∈ C := hC_top ▸ Subgroup.mem_top g
rw [hC, Subgroup.mem_fixedPointsOfMulAut] at hmem
exact hmem a
end OddOrder.BG.Ch1.S01
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/BG/Ch1_Preliminary/S01_BurnsideOperator.lean