Peterfalvi (13.16): when , from coprimality data
ProvedOddOrder.Peterfalvi.S15.normalizer_U_inf_W2_eq_bot_of_data_and_c_eq_onefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a minimal simple group of odd order (IsMinimalSimpleOdd G), and let hyp : Hypothesis be the Peterfalvi (13.1) configuration for : two maximal subgroups with cyclic, , ( odd primes), and the maximal nilpotent normal Hall subgroups, complements with , , , , , , together with the associated character grids , , (, ). Assume , , and that the of the type-P data of agrees with (hyp.Sdata.W2 = hyp.W2). Then
This assembles the core of (13.16) from the crux via coprime action on .
Preamble
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_S15_HonestTypeP2A0 import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InflationCharacter import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedCharacter import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedTransport import Definitions.Def_OddOrder_Isaacs_Ch06_FrobeniusActions_FrobeniusGroupQuotient import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
theorem normalizer_U_inf_W2_eq_bot_of_data_and_c_eq_one [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
(hc1 : hyp.c = 1)
(hcop : Nat.Coprime (Nat.card ↥hyp.P) (Nat.card ↥(hyp.U ⊔ hyp.W1)))
(hrec : hyp.Sdata.W2 = hyp.W2) :
hyp.U ⊓ Subgroup.normalizer (hyp.W2 : Set G) = ⊥ := by sorry
end OddOrder.Peterfalvi.S15Source
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/S15_SAndTDefs.lean#L491-L639