Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (9.7.b): Uˉ\bar UUˉ acts on Hˉ=H/N\bar H=H/NHˉ=H/N as multiplication on GF(pq)GF(p^q)GF(pq)

Proved
OddOrder.Peterfalvi.S11.caseB_exists_galoisField_repr

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group and M≤GM\le GM≤G a subgroup, with the Peterfalvi Types I--V setup data : TypesIIIIIIVSetup M (with subgroup HHH and parameter q=q=q= data.q), a chief-factor datum chief : ChiefFactorData data (with p=p=p= chief.p prime, NNN, H0H_0H0​), and the Section 11 character data chars. Suppose the data are in Clifford case B (caseB : CliffordCaseBData chars). Let Uˉ=\bar U=Uˉ= MonoidHom.range (uActionHom data chief) be the image of UUU acting on Hˉ=H/N\bar H=H/NHˉ=H/N. Then there exist an additive isomorphism e:Hˉ→GF(pq)e:\bar H\to GF(p^q)e:Hˉ→GF(pq) (GaloisField p q) and an injective homomorphism μ:Uˉ→GF(pq)×\mu:\bar U\to GF(p^q)^\timesμ:Uˉ→GF(pq)× such that

e(u⋅x)=μ(u) e(x)for all u∈Uˉ, x∈Hˉ.e(u\cdot x)=\mu(u)\,e(x)\qquad\text{for all }u\in\bar U,\ x\in\bar H .e(u⋅x)=μ(u)e(x)for all u∈Uˉ, x∈Hˉ.

This is Peterfalvi (9.7.b), the field model of the faithful irreducible action in case B.

Formalization Note. Hˉ\bar HHˉ is written additively via Additive; the Fact chief.p.Prime instance is supplied inside the statement with letI.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_WielandtSetup
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_CliffordData
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_CuS0
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_CharacterCounts
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_Coherence911
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_SummandComplementKernel
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_ThetaCountAssembly
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SingerLineBound
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SemilinearImprimitiveBound
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_LineScalarCharacter
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_AInvariantSubrep
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SingerField
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SemilinearFieldAut
import Definitions.Def_OddOrder_Peterfalvi_S11_GaloisFieldModel
import Mathlib.GroupTheory.SpecificGroups.Cyclic.Basic
import Mathlib.RepresentationTheory.Subrepresentation
Formal statement
namespace OddOrder.Peterfalvi.S11

open OddOrder.GroupTheory OddOrder.RepresentationTheory OddOrder.Isaacs.Ch03

open OddOrder.Isaacs.Ch03.IsAInvariant (quotientMulAutHom)

open scoped IsMulCommutative

variable {G : Type*} [Group G]

set_option backward.isDefEq.respectTransparency false in

theorem caseB_exists_galoisField_repr [Finite G] {M : Subgroup G}
    {data : TypesIIIIIIVSetup M} {chief : ChiefFactorData data}
    (chars : Section11CharacterData data chief) (caseB : CliffordCaseBData chars) :
    letI : Fact chief.p.Prime := ⟨chief.p_prime⟩
    ∃ (e : Additive (↥data.H ⧸ chief.N) ≃+ GaloisField chief.p data.q)
      (μ : ↥(MonoidHom.range (uActionHom data chief)) →*
        (GaloisField chief.p data.q)ˣ),
      Function.Injective μ ∧
      ∀ (u : ↥(MonoidHom.range (uActionHom data chief)))
        (x : ↥data.H ⧸ chief.N),
        e (Additive.ofMul ((MonoidHom.range (uActionHom data chief)).subtype u x)) =
          ((μ u : (GaloisField chief.p data.q)ˣ) : GaloisField chief.p data.q) *
            e (Additive.ofMul x) := by sorry

end OddOrder.Peterfalvi.S11
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/Peterfalvi/S11_GaloisFieldModel.lean#L29-L137

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