Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Embedding of the norm-one Frobenius group from a field-model identification

Proved
OddOrder.RepresentationTheory.SemilinearFieldModel.fieldModelEmbedding

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let rrr be a prime, sss a natural number, GGG a group, and E,C≤GE,C\le GE,C≤G subgroups. Suppose given

  • an additive isomorphism e:E→Frse:E\to\mathbb{F}_{r^s}e:E→Frs​;
  • an injective homomorphism μ:C→Frs×\mu:C\to\mathbb{F}_{r^s}^{\times}μ:C→Frs×​ whose range is the group UUU of norm-one units of Frs\mathbb{F}_{r^s}Frs​;
  • the compatibility condition hcompatLift: for every u∈Uu\in Uu∈U, the transport of the multiplication action of uuu on the additive group (via eee) equals conjugation by the element of CCC corresponding to uuu under μ\muμ, composed with the transport of the kernel (stated with kernelTransport e and complementTransport μ);
  • E∩C=1E\cap C=1E∩C=1.

Then there is an injective homomorphism σ:Frs⋊U→G\sigma:\mathbb{F}_{r^s}\rtimes U\to Gσ:Frs​⋊U→G from the norm-one Frobenius group normOneFrobeniusGroup r s such that σ\sigmaσ maps the additive kernel Frs\mathbb{F}_{r^s}Frs​ onto EEE and the complement UUU onto CCC.

Formalization Note The compatibility hypothesis is the equation of monoid homomorphisms required by SemidirectProduct.lift; kernelTransport, complementTransport and normOneMulAction are project-specific encodings.

Preamble
import Definitions.Def_OddOrder_BG_AppC_NormSet
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SemilinearFieldModel
Formal statement
namespace OddOrder.RepresentationTheory.SemilinearFieldModel

open OddOrder.BG.AppC.NormSet

variable {G : Type*} [Group G]

theorem fieldModelEmbedding {r s : ℕ} [Fact r.Prime] {E C : Subgroup G}
    (e : Additive ↥E ≃+ GaloisField r s)
    (μ : ↥C →* (GaloisField r s)ˣ) (hμ_inj : Function.Injective μ)
    (hμ_range : μ.range = normOneUnits r s)
    (hcompatLift : ∀ u : ↥(normOneUnits r s),
      (kernelTransport e).comp ((normOneMulAction r s u).toMonoidHom)
        = (MulAut.conj (complementTransport μ hμ_inj hμ_range u)).toMonoidHom.comp
            (kernelTransport e))
    (hEC_disj : E ⊓ C = ⊥) :
    ∃ σ : normOneFrobeniusGroup r s →* G,
      Function.Injective σ ∧
      (SemidirectProduct.inl :
          additiveFieldGroup r s →* normOneFrobeniusGroup r s).range.map σ = E ∧
      (SemidirectProduct.inr :
          ↥(normOneUnits r s) →* normOneFrobeniusGroup r s).range.map σ = C := by sorry

end OddOrder.RepresentationTheory.SemilinearFieldModel
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/GroupTheory/RepresentationTheory/SemilinearFieldModel.lean#L208-L283

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