Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

BG Appendix C: the three (C.5) factors admit compatible normal forms

Proved
OddOrder.BG.AppC.FieldNormalizerData.exists_step4C5NormalForms

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, and let a,ba,ba,b be norm-one units of Fpq\mathbb{F}_{p^q}Fpq​. Then the type Step4C5NormalForms data a b is nonempty: the three factors in relation (C.4) (the factors called (C.5)) admit Step 1 normal forms σ(ui) σ(ci) σ(vi)\sigma(u_i)\,\sigma(c_i)\,\sigma(v_i)σ(ui​)σ(ci​)σ(vi​) (ci∈Z/pc_i\in\mathbb{Z}/pci​∈Z/p, ui,viu_i,v_iui​,vi​ norm-one units) together with compatible readings of their right complement components modulo PPP.

This existence statement supplies the normal forms to which the later steps of Lemma C.3 (such as (C.6), (C.7), (C.9)) are applied.

Formalization Note Nonemptiness is stated as Nonempty (Step4C5NormalForms data a b); the structure records the coordinates, units, the three normal-form equations and the right-component identities.

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 exists_step4C5NormalForms
    (data : FieldNormalizerData p q G)
    (a b : NormSet.normOneUnits p q) :
    Nonempty (Step4C5NormalForms data a b) := 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#L244-L296

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