Peterfalvi (14.7): existence of `FieldNormalizerData` from a field model of with -action
ProvedOddOrder.Peterfalvi.S16.fieldNormalizerData_of_reprfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let hyp be a Peterfalvi §14 configuration with primes and subgroups of hyp.base; write (GaloisField p q). Suppose we are given:
- an additive isomorphism (writing additively);
- an injective homomorphism whose range is the norm-one units
AppC.NormSet.normOneUnits p q; - normalizes : for , (
hUP); - compatibility for all , ;
- the prime-line identification: the image of the -span of under
fieldNormalizerKernelTransport hyp eequals ; - ;
- ;
- is elementary abelian of exponent (
IsElementaryAbelian q Q); - normalizes ;
- some with (as
MulAut.conj yQ • W2) contained in .
Then FieldNormalizerData hyp is nonempty.
This is the ungated reduction at the heart of (14.7): the embedding is built as a SemidirectProduct.lift of two transport homomorphisms, glued by the (14.2)(a) field model. All hypotheses are inputs; no §13 character theory is invoked.
Formalization Note. Fact p.Prime instances are introduced via letI; is regarded as Additive ↥P.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TSideTypeP import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisBasics import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisSwap import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_DegreesFirstSplit import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_PairStructure import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_CountingLayer import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization import Definitions.Def_OddOrder_Peterfalvi_S13_ElementaryAbelianKernel import Definitions.Def_OddOrder_BG_Ch2_Uniqueness_S07_Theorem74 import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_TSideDegrees import Definitions.Def_OddOrder_Peterfalvi_S12_MaximalIII_IV_V_Core_Hypothesis import Definitions.Def_OddOrder_Peterfalvi_S12_MaximalIII_IV_V_Core_CharacterParameters import Definitions.Def_OddOrder_Peterfalvi_S12_MaximalIII_IV_V_Core_DadeCalculations import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_PrimeTIResidue import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S13_Orthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeSupply import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentProjectionRigidity import Definitions.Def_OddOrder_BG_AppC_LemmaC3_Step4Capstone import Definitions.Def_OddOrder_Peterfalvi_S16_CoreLemmas import Definitions.Def_OddOrder_Peterfalvi_S07_CoherenceGalois import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_GaloisInnerTransport import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_TGapGridAlignment import Definitions.Def_OddOrder_Peterfalvi_S13_NonGaloisExclusion import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupL
Formal statement
namespace OddOrder.Peterfalvi.S16
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
open scoped BigOperators
variable {G : Type*} [Group G]
set_option backward.isDefEq.respectTransparency false in
theorem fieldNormalizerData_of_repr (hyp : Hypothesis (G := G))
(e : letI : Fact hyp.base.p.Prime := ⟨hyp.base.p_prime⟩
Additive ↥hyp.base.P ≃+ GaloisField hyp.base.p hyp.base.q)
(μ : letI : Fact hyp.base.p.Prime := ⟨hyp.base.p_prime⟩
↥hyp.base.U →* (GaloisField hyp.base.p hyp.base.q)ˣ)
(hμ_inj : Function.Injective μ)
(hμ_range : letI : Fact hyp.base.p.Prime := ⟨hyp.base.p_prime⟩
μ.range = OddOrder.BG.AppC.NormSet.normOneUnits hyp.base.p hyp.base.q)
(hUP : ∀ (v : ↥hyp.base.U) (x : ↥hyp.base.P),
(v : G) * (x : G) * (v : G)⁻¹ ∈ hyp.base.P)
(hcompat : letI : Fact hyp.base.p.Prime := ⟨hyp.base.p_prime⟩
∀ (v : ↥hyp.base.U) (x : ↥hyp.base.P),
e (Additive.ofMul (⟨(v : G) * (x : G) * (v : G)⁻¹, hUP v x⟩ : ↥hyp.base.P))
= ((μ v : (GaloisField hyp.base.p hyp.base.q)ˣ) :
GaloisField hyp.base.p hyp.base.q) * e (Additive.ofMul x))
(hW2 : letI : Fact hyp.base.p.Prime := ⟨hyp.base.p_prime⟩
(((Submodule.span (ZMod hyp.base.p)
({(1 : GaloisField hyp.base.p hyp.base.q)} :
Set (GaloisField hyp.base.p hyp.base.q))).toAddSubgroup).toSubgroup).map
(fieldNormalizerKernelTransport hyp e) = hyp.base.W2)
(hPU_disj : hyp.base.P ⊓ hyp.base.U = ⊥)
(hcyclotomic :
Nat.Coprime ((hyp.base.p ^ hyp.base.q - 1) / (hyp.base.p - 1)) (hyp.base.p - 1))
(hQ_elemAb : IsElementaryAbelian hyp.base.q ↥hyp.base.Q)
(hW2_norm_Q : hyp.base.W2 ≤ Subgroup.normalizer (hyp.base.Q : Set G))
(yQ : G) (hyQ_mem : yQ ∈ hyp.base.Q)
(hW2_conj_y : MulAut.conj yQ • hyp.base.W2 ≤ Subgroup.normalizer (hyp.base.U : Set G)) :
Nonempty (FieldNormalizerData hyp) := by sorry
end OddOrder.Peterfalvi.S16Source
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/S16_NonExistenceG/SubgroupL.lean#L454-L633