Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BG Appendix C (C.7): rearranged substitution relation in terms of w1,w2,w3w_1,w_2,w_3w1​,w2​,w3​

Proved
OddOrder.BG.AppC.FieldNormalizerData.relationC7

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let data : FieldNormalizerData p q G be the field-normalizer data of Bender--Glauberman Appendix C, with s=σ(1P0)s=\sigma(1_{P_0})s=σ(1P0​​), t=ysy−1t=ysy^{-1}t=ysy−1, and σ(⋅)\sigma(\cdot)σ(⋅) denoting images in GGG of elements of H=P⋊UH=P\rtimes UH=P⋊U. Let a,ba,ba,b be norm-one units of Fpq\mathbb{F}_{p^q}Fpq​ with a−1+b−1=2a^{-1}+b^{-1}=2a−1+b−1=2 in Fpq\mathbb{F}_{p^q}Fpq​, and let forms : Step4C5NormalForms data a b be normal forms of the three (C.5) factors, with prime-line coordinates c1,c2,c3∈Z/pc_1,c_2,c_3\in\mathbb{Z}/pc1​,c2​,c3​∈Z/p and complement elements w1,w2,w3∈Uw_1,w_2,w_3\in Uw1​,w2​,w3​∈U. Then

t−1 σ(c2) t−1=(σ(w1) σ(c3) σ(w2) t2 σ(c1) σ(w3))−1.t^{-1}\,\sigma(c_2)\,t^{-1}=\Bigl(\sigma(w_1)\,\sigma(c_3)\,\sigma(w_2)\,t^{2}\,\sigma(c_1)\,\sigma(w_3)\Bigr)^{-1}.t−1σ(c2​)t−1=(σ(w1​)σ(c3​)σ(w2​)t2σ(c1​)σ(w3​))−1.

This is relation (C.7), obtained by rearranging the (C.5) substitution relation and absorbing the conjugated complement terms into w1,w2,w3w_1,w_2,w_3w1​,w2​,w3​.

Formalization Note Step4C5NormalForms is a project structure bundling the normal-form data; wiw_iwi​ are the fields w1, w2, w3 of forms, and σ(w)\sigma(w)σ(w) is data.sigma (SemidirectProduct.inr w).

Preamble
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_ScalarCalculus
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_NormalForms
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 relationC7
    (data : FieldNormalizerData p q G)
    {a b : NormSet.normOneUnits p q}
    (hab : unitVal a⁻¹ + unitVal b⁻¹ = 2)
    (forms : Step4C5NormalForms data a b) :
    data.t⁻¹ * data.sigma (primeLineElement p q forms.c2) * data.t⁻¹ =
      (data.sigma (SemidirectProduct.inr forms.w1 : NormSet.normOneFrobeniusGroup p q) *
        data.sigma (primeLineElement p q forms.c3) *
          data.sigma (SemidirectProduct.inr forms.w2 : NormSet.normOneFrobeniusGroup p q) *
            data.t ^ 2 * data.sigma (primeLineElement p q forms.c1) *
              data.sigma
                (SemidirectProduct.inr forms.w3 : NormSet.normOneFrobeniusGroup p q))⁻¹ := by sorry

end Step4

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_NormalForms.lean#L680-L767

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me