BG Appendix C (C.9): and its -conjugate lie in
ProvedOddOrder.BG.AppC.FieldNormalizerData.relationC9_w3_mem_P_sup_U_and_conjfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let data : FieldNormalizerData p q G be the field-normalizer data of Bender--Glauberman Appendix C (with , and as usual). Let be norm-one units of such that and lie in the norm set and , and let forms : Step4C5NormalForms data a b be normal forms of the three (C.5) factors, with prime-line coordinate and complement elements . Put
Then
This is relation (C.9) for the third word: comparing (C.7) for with (C.7) for gives these two memberships in .
Formalization Note is NormSet.normN, the norm set is NormSet.normSetE p q, and is the join of subgroups of .
Preamble
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_NormalForms import Definitions.Def_OddOrder_BG_AppC_LemmaC3_Step4Capstone
Formal statement
namespace OddOrder.BG.AppC
open OddOrder.GroupTheory
open scoped Pointwise
open scoped BigOperators
variable {p q : ℕ} [Fact p.Prime] {G : Type*} [Group G]
namespace FieldNormalizerData
section Step4
theorem relationC9_w3_mem_P_sup_U_and_conj
(data : FieldNormalizerData p q G)
{a b : NormSet.normOneUnits p q}
(ha : unitVal a⁻¹ ∈ NormSet.normSetE p q)
(hb : unitVal b⁻¹ ∈ NormSet.normSetE p q)
(hab : unitVal a⁻¹ + unitVal b⁻¹ = 2)
(forms : Step4C5NormalForms data a b) :
let S1 := data.sigma (primeLineElement p q forms.c1)
let W3pow := data.sigma
(SemidirectProduct.inr (forms.w3 ^ (p - 1)) :
NormSet.normOneFrobeniusGroup p q)
S1 * W3pow * S1⁻¹ ∈ data.P ⊔ data.U ∧
data.t ^ 2 * (S1 * W3pow * S1⁻¹) * (data.t ^ 2)⁻¹ ∈
data.P ⊔ data.U := by sorry
end Step4
end FieldNormalizerData
end OddOrder.BG.AppCSource
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_Step4Capstone.lean#L42-L157