BG Lemma C.3, Step 4: right component of a normal form equals
ProvedOddOrder.BG.AppC.FieldNormalizerData.right_component_of_step4_sigma_inr_decompositionfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let data : FieldNormalizerData p q G be the field-normalizer data of Bender--Glauberman Appendix C, with . Let , let be norm-one units of (elements of the complement ), and let . If
in (where is the image of in the prime-field line ), then
This is the "mod " bridge of Step 4 of Lemma C.3 in neutral form: reading the equation modulo the additive kernel gives the right-projection. It is reused for both the forward and backward equations of (C.5).
Preamble
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_ConjugateLine import Definitions.Def_OddOrder_BG_AppC_LemmaC3_ScalarCalculus
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 right_component_of_step4_sigma_inr_decomposition
(data : FieldNormalizerData p q G)
(m r : ℤ) (w u₁ v₁ : NormSet.normOneUnits p q) (c : ZMod p)
(hdec : data.s ^ m *
data.sigma (SemidirectProduct.inr w : NormSet.normOneFrobeniusGroup p q) *
data.s ^ r =
data.sigma (SemidirectProduct.inr u₁ : NormSet.normOneFrobeniusGroup p q) *
data.sigma (primeLineElement p q c) *
data.sigma (SemidirectProduct.inr v₁ : NormSet.normOneFrobeniusGroup p q)) :
w = u₁ * v₁ := 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_ScalarCalculus.lean#L327-L377