Bender–Glauberman Appendix C, Lemma C.3: the conjugate prime line
DefinitionOddOrder_BG_AppC_LemmaC3_ConjugateLinefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Develops Steps 3 and 4 of Bender–Glauberman Appendix C, Lemma C.3 (§3, pp. 148–152) on the conjugate prime line with generator , where comes from Hypothesis (B). The element has order , and normalizes (unlike itself), so conjugation by induces an automorphism of the norm-one group of -power order.
Main definitions: P1 (the conjugate prime-line subgroup), t (the -conjugate of ), finite_P1, tConjUAut (conjugation by as an automorphism of ), tConjNormOneUnitsAut (transported to the concrete norm-one unit group) and w2ConjQAut (conjugation action of on the normal elementary abelian subgroup ).
The bundle also proves 13 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/AppC_LemmaC3_ConjugateLine.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_AppC_LemmaC3_Setup
import Definitions.Def_OddOrder_Mathlib_Subgroup
import Definitions.Def_OddOrder_Isaacs_Ch04_Commutators_Main_ThreeSubgroupsCoprime
namespace OddOrder.BG.AppC
open scoped Pointwise
open scoped BigOperators
variable {p q : ℕ} [Fact p.Prime] {G : Type*} [Group G]
namespace FieldNormalizerData
/-- Applying the norm-one/unit equivalence is just `σ` on the concrete
semidirect-product complement. -/
theorem normOneUnitsEquivU_apply_coe (data : FieldNormalizerData p q G)
(u : NormSet.normOneUnits p q) :
(data.normOneUnitsEquivU u : G) = data.sigma (SemidirectProduct.inr u) := by
rfl
/-- The conjugate prime-line subgroup `P₁` used in BG Appendix C, expressed
with Lean left-conjugation convention. -/
noncomputable def P1 (data : FieldNormalizerData p q G) :
Subgroup G :=
MulAut.conj data.y • data.W2
/-- The BG element `t`, the `y`-conjugate of `s` in Lean convention. -/
noncomputable def t (data : FieldNormalizerData p q G) : G :=
MulAut.conj data.y data.s
/-- The transported conjugate generator lies in `P₁`. -/
theorem t_mem_P1 (data : FieldNormalizerData p q G) :
data.t ∈ data.P1 := by
dsimp [P1, t]
rw [Subgroup.mem_pointwise_smul_iff_inv_smul_mem]
convert data.s_mem_W2 using 1
simp
group
/-- The conjugate generator `t` is nontrivial. -/
theorem t_ne_one (data : FieldNormalizerData p q G) :
data.t ≠ 1 := by
intro ht
exact data.s_ne_one ((MulAut.conj data.y).injective (by simpa [t] using ht))
/-- The conjugate generator `t` has `p`-th power equal to `1`. -/
theorem t_pow_p_eq_one (data : FieldNormalizerData p q G) :
data.t ^ p = 1 := by
simpa [t, map_pow] using congrArg (MulAut.conj data.y) data.s_pow_p_eq_one
/-- The conjugate generator `t` has exact order `p`. -/
theorem t_orderOf_eq_p (data : FieldNormalizerData p q G) :
orderOf data.t = p := by
have hdiv : orderOf data.t ∣ p :=
orderOf_dvd_of_pow_eq_one data.t_pow_p_eq_one
rcases (Fact.out : Nat.Prime p).eq_one_or_self_of_dvd (orderOf data.t) hdiv with h | h
· exact False.elim (data.t_ne_one (orderOf_eq_one_iff.mp h))
· exact h
/-- The conjugate prime line `P₁ = P₀^y` is generated by the conjugate generator
`t = s^y`. -/
theorem P1_eq_zpowers_t (data : FieldNormalizerData p q G) :
data.P1 = Subgroup.zpowers data.t := by
rw [P1, data.W2_eq_zpowers_s, Subgroup.pointwise_smul_def]
simp [t]
/-- The conjugate prime line `P₁ = ⟨t⟩` is finite, of order `p`. -/
instance finite_P1 (data : FieldNormalizerData p q G) : Finite data.P1 :=
Nat.finite_of_card_ne_zero (by
rw [data.P1_eq_zpowers_t, Nat.card_zpowers, data.t_orderOf_eq_p]
exact (Fact.out : Nat.Prime p).ne_zero)
/-- `P₁` normalizes Peterfalvi subgroup `U`, as required in BG C.3 Step 3. -/
theorem P1_normalizes_U (data : FieldNormalizerData p q G) :
data.P1 ≤ Subgroup.normalizer (data.U : Set G) := by
simpa [P1] using data.W2_conj_y_normalizes_U
/-- The conjugate generator `t` normalizes `U`. -/
theorem t_normalizes_U (data : FieldNormalizerData p q G) :
data.t ∈ Subgroup.normalizer (data.U : Set G) :=
data.P1_normalizes_U data.t_mem_P1
/-- Conjugation by `t` as an automorphism of Peterfalvi's subgroup `U`. -/
noncomputable def tConjUAut (data : FieldNormalizerData p q G) : MulAut data.U :=
data.U.normalizerMonoidHom ⟨data.t, data.t_normalizes_U⟩
/-- The subgroup automorphism `tConjUAut` is ambient conjugation by `t`. -/
theorem tConjUAut_apply_coe (data : FieldNormalizerData p q G) (u : data.U) :
(data.tConjUAut u : G) = data.t * (u : G) * data.t⁻¹ := by
rfl
/-- Conjugation by `t`, transported back to the concrete norm-one unit group. -/
noncomputable def tConjNormOneUnitsAut (data : FieldNormalizerData p q G)
: MulAut (NormSet.normOneUnits p q) :=
(MulAut.congr data.normOneUnitsEquivU).symm data.tConjUAut
/-- The transported automorphism agrees with conjugation by `t` after applying
`σ` to the concrete complement. -/
theorem normOneUnitsEquivU_tConjNormOneUnitsAut (data : FieldNormalizerData p q G)
(u : NormSet.normOneUnits p q) :
data.normOneUnitsEquivU (data.tConjNormOneUnitsAut u) =
data.tConjUAut (data.normOneUnitsEquivU u) := by
simp [tConjNormOneUnitsAut]
/-- After transporting back to the concrete complement, the `t`-automorphism is
ambient conjugation of `σ(inr u)`. -/
theorem normOneUnitsEquivU_tConjNormOneUnitsAut_apply_coe
(data : FieldNormalizerData p q G)
(u : NormSet.normOneUnits p q) :
(data.normOneUnitsEquivU (data.tConjNormOneUnitsAut u) : G) =
data.t * data.sigma (SemidirectProduct.inr u) * data.t⁻¹ := by
calc
(data.normOneUnitsEquivU (data.tConjNormOneUnitsAut u) : G) =
(data.tConjUAut (data.normOneUnitsEquivU u) : G) := by
rw [data.normOneUnitsEquivU_tConjNormOneUnitsAut]
_ = data.t * (data.normOneUnitsEquivU u : G) * data.t⁻¹ :=
data.tConjUAut_apply_coe (data.normOneUnitsEquivU u)
_ = data.t * data.sigma (SemidirectProduct.inr u) * data.t⁻¹ := by
rw [data.normOneUnitsEquivU_apply_coe]
/-- Iterating the transported `t`-automorphism agrees with conjugation by
the corresponding natural power of `t` after applying `σ` to the concrete
complement. -/
theorem normOneUnitsEquivU_tConjNormOneUnitsAut_pow_apply_coe
(data : FieldNormalizerData p q G)
(n : ℕ) (u : NormSet.normOneUnits p q) :
(data.normOneUnitsEquivU ((data.tConjNormOneUnitsAut ^ n) u) : G) =
data.t ^ n * data.sigma (SemidirectProduct.inr u : NormSet.normOneFrobeniusGroup p q) *
(data.t ^ n)⁻¹ := by
induction n with
| zero =>
simp [data.normOneUnitsEquivU_apply_coe]
| succ n ih =>
calc
(data.normOneUnitsEquivU ((data.tConjNormOneUnitsAut ^ (n + 1)) u) : G) =
data.t *
(data.normOneUnitsEquivU ((data.tConjNormOneUnitsAut ^ n) u) : G) *
data.t⁻¹ := by
rw [pow_succ']
exact data.normOneUnitsEquivU_tConjNormOneUnitsAut_apply_coe
((data.tConjNormOneUnitsAut ^ n) u)
_ = data.t *
(data.t ^ n *
data.sigma (SemidirectProduct.inr u : NormSet.normOneFrobeniusGroup p q) *
(data.t ^ n)⁻¹) *
data.t⁻¹ := by
rw [ih]
_ = data.t ^ (n + 1) *
data.sigma (SemidirectProduct.inr u : NormSet.normOneFrobeniusGroup p q) *
(data.t ^ (n + 1))⁻¹ := by
group
/-- The natural-power conjugate of a concrete complement element is the `σ`
image of the corresponding power of the transported norm-one automorphism. -/
theorem t_pow_conj_sigma_inr_eq_sigma_inr_tConjNormOneUnitsAut_pow
(data : FieldNormalizerData p q G)
(n : ℕ) (u : NormSet.normOneUnits p q) :
data.t ^ n * data.sigma (SemidirectProduct.inr u : NormSet.normOneFrobeniusGroup p q) *
(data.t ^ n)⁻¹ =
data.sigma
(SemidirectProduct.inr ((data.tConjNormOneUnitsAut ^ n) u) :
NormSet.normOneFrobeniusGroup p q) := by
rw [← data.normOneUnitsEquivU_apply_coe ((data.tConjNormOneUnitsAut ^ n) u)]
exact (data.normOneUnitsEquivU_tConjNormOneUnitsAut_pow_apply_coe n u).symm
/-- The conjugation action of `W₂ = σ(P₀)` on the normal elementary abelian
subgroup `Q`, restricted to `↥Q`. This is the coprime action used to
instantiate BG Appendix C Remark (X)'s decomposition `Q = C_Q(P₀) × ⁅Q, P₀⁆`
(Isaacs Thm 4.34 / BG Prop 1.6(d)) in the Lemma C.3 Step 4 kernel argument. -/
noncomputable def w2ConjQAut (data : FieldNormalizerData p q G) :
↥data.W2 →* MulAut ↥data.Q :=
(Subgroup.normalizerMonoidHom (H := data.Q)).comp
(Subgroup.inclusion data.W2_normalizes_Q)
end FieldNormalizerData
end OddOrder.BG.AppC
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/AppC_LemmaC3_ConjugateLine.lean