Faithful elementary abelian conjugation action gives the norm-one Galois-field model
ProvedOddOrder.RepresentationTheory.ConjugationFieldModel.exists_normOne_galoisField_conjugation_reprfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group, primes with odd, and subgroups such that:
- is elementary abelian of exponent and ;
- is commutative and normalizes , with ;
- (the action of on is faithful).
Then there exist an additive isomorphism and an injective homomorphism such that the range of is the group of norm-one units of , and for all and ,
That is, conjugation by on is realized as multiplication by norm-one units on the field . No field structure or representation is assumed in advance; the field is constructed by a Singer-type argument.
Formalization Note is an equivalence Additive ↥E ≃+ GaloisField r s, the group of norm-one units is normOneUnits r s, and the conjugation action is encoded by conjugate hCnorm c x.
Preamble
import Definitions.Def_OddOrder_BG_AppC_NormSet import Definitions.Def_OddOrder_BG_Ch1_Preliminary_OperatorMaschke import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SingerField import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ConjugationFieldModel
Formal statement
namespace OddOrder.RepresentationTheory.ConjugationFieldModel
open OddOrder.GroupTheory
open OddOrder.BG.AppC.NormSet
variable {G : Type*} [Group G]
set_option maxHeartbeats 1000000 in
-- The Singer construction expands a large group-algebra module term during elaboration; this
-- local limit matches the existing concrete `P/U` instantiation.
open scoped IsMulCommutative in
theorem exists_normOne_galoisField_conjugation_repr [Finite G]
{r s : ℕ} (hr : r.Prime) (hs : s.Prime) (hsodd : Odd s)
{E C : Subgroup G} (hE : IsElementaryAbelian r ↥E)
(hCcomm : IsMulCommutative ↥C)
(hCnorm : C ≤ Subgroup.normalizer (E : Set G))
(hcardE : Nat.card ↥E = r ^ s)
(hcardC : Nat.card ↥C = (r ^ s - 1) / (r - 1))
(hfaith : C ⊓ Subgroup.centralizer (E : Set G) = ⊥) :
letI : Fact r.Prime := ⟨hr⟩
∃ (e : Additive ↥E ≃+ GaloisField r s) (μ : ↥C →* (GaloisField r s)ˣ),
Function.Injective μ ∧
μ.range = normOneUnits r s ∧
∀ (c : ↥C) (x : ↥E),
e (Additive.ofMul (conjugate hCnorm c x)) =
((μ c : (GaloisField r s)ˣ) : GaloisField r s) * e (Additive.ofMul x) := by sorry
end OddOrder.RepresentationTheory.ConjugationFieldModelSource
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/ConjugationFieldModel.lean#L95-L197