Isaacs FGT Ch. 7: normal- close, proof of Thm 7.1 and Thm 7.7 (S7B part 2 and S7C)
DefinitionOddOrder_Isaacs_Ch07_ThompsonSubgroup_S7B2_NormalJ_PComplementfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Isaacs, Finite Group Theory, Chapter 7 (Thompson subgroup), pp. 209-219: the closing of the normal- argument, the proof of Theorem 7.1 and Theorem 7.7.
The bundle consists of lemmas only.
The bundle also proves 1 supporting lemma 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/Ch07_ThompsonSubgroup/S7B2_NormalJ_PComplement.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_Ch07_ThompsonSubgroup_S7B2_NormalJClose
namespace OddOrder.Isaacs.Ch07
open scoped commutatorElement
open scoped Pointwise
variable {G : Type*} [Group G]
open scoped commutatorElement
/-- centralizer ⊆ normalizer (mathlib v4.29.1 に直接の lemma 無し). -/
theorem centralizer_le_normalizer {G : Type*} [Group G] (H : Subgroup G) :
Subgroup.centralizer (H : Set G) ≤ Subgroup.normalizer H := by
intro x hx
rw [Subgroup.mem_normalizer_iff]
intro y
have hcomm : ∀ z ∈ H, z * x = x * z := Subgroup.mem_centralizer_iff.mp hx
have hx_inv_mem : x⁻¹ ∈ Subgroup.centralizer (H : Set G) :=
Subgroup.inv_mem _ hx
have hcomm_inv : ∀ z ∈ H, z * x⁻¹ = x⁻¹ * z :=
Subgroup.mem_centralizer_iff.mp hx_inv_mem
refine ⟨fun hy => ?_, fun hxyx => ?_⟩
· -- y ∈ H ⇒ xyx⁻¹ = y ∈ H
have hxy : x * y = y * x := (hcomm y hy).symm
have : x * y * x⁻¹ = y := by rw [hxy]; group
rw [this]; exact hy
· -- xyx⁻¹ ∈ H ⇒ y = xyx⁻¹ ∈ H
have hcomm_z : (x * y * x⁻¹) * x⁻¹ = x⁻¹ * (x * y * x⁻¹) :=
hcomm_inv (x * y * x⁻¹) hxyx
-- 計算: (xyx⁻¹) * x⁻¹ = x⁻¹*(xyx⁻¹) ⇒ y = xyx⁻¹
have h_eq : y * x⁻¹ = (x * y * x⁻¹) * x⁻¹ := by
rw [hcomm_z]; group
have hy_eq : y = x * y * x⁻¹ := mul_right_cancel h_eq
rw [hy_eq]; exact hxyx
end OddOrder.Isaacs.Ch07
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/Ch07_ThompsonSubgroup/S7B2_NormalJ_PComplement.lean