Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lift compatibility from textbook CCC-equivariance of the field isomorphism

Proved
OddOrder.RepresentationTheory.SemilinearFieldModel.hcompatLift_of_equivariant

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, E,C≤GE,C\le GE,C≤G subgroups, e:E→Frse:E\to\mathbb{F}_{r^s}e:E→Frs​ an additive isomorphism, and μ:C→Frs×\mu:C\to\mathbb{F}_{r^s}^{\times}μ:C→Frs×​ an injective homomorphism whose range is the group UUU of norm-one units. Assume CCC normalizes EEE elementwise (for v∈Cv\in Cv∈C, x∈Ex\in Ex∈E, vxv−1∈Evxv^{-1}\in Evxv−1∈E) and that eee is CCC-equivariant:

e(vxv−1)=μ(v)⋅e(x)(v∈C, x∈E).e(vxv^{-1})=\mu(v)\cdot e(x)\qquad(v\in C,\ x\in E).e(vxv−1)=μ(v)⋅e(x)(v∈C, x∈E).

Then for every u∈Uu\in Uu∈U, the transported multiplication action of uuu agrees with conjugation by the corresponding element of CCC after transport along eee:

kernelTransport e∘(mult. by u)=conj(complementTransport μ u)∘kernelTransport e\text{kernelTransport }e\circ(\text{mult. by }u)=\mathrm{conj}\bigl(\text{complementTransport }\mu\ u\bigr)\circ\text{kernelTransport }ekernelTransport e∘(mult. by u)=conj(complementTransport μ u)∘kernelTransport e

as monoid homomorphisms (the hcompatLift condition demanded by fieldModelEmbedding).

This derives the SemidirectProduct.lift compatibility from the textbook equivariance of Peterfalvi (14.2)(a); it is the generic bridge used on both the P/UP/UP/U and Q/VQ/VQ/V sides.

Formalization Note kernelTransport, complementTransport, normOneMulAction are project definitions; the proof transports the conjugation identity across eee and inverts μ\muμ inside complementTransport.

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]

set_option backward.isDefEq.respectTransparency false in

theorem hcompatLift_of_equivariant {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)
    (hCE : ∀ (v : ↥C) (x : ↥E), (v : G) * (x : G) * (v : G)⁻¹ ∈ E)
    (hcompat : ∀ (v : ↥C) (x : ↥E),
      e (Additive.ofMul (⟨(v : G) * (x : G) * (v : G)⁻¹, hCE v x⟩ : ↥E))
        = ((μ v : (GaloisField r s)ˣ) : GaloisField r s) * e (Additive.ofMul x)) :
    ∀ u : ↥(normOneUnits r s),
      (kernelTransport e).comp ((normOneMulAction r s u).toMonoidHom)
        = (MulAut.conj (complementTransport μ hμ_inj hμ_range u)).toMonoidHom.comp
            (kernelTransport e) := 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#L157-L206

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