Peterfalvi (13.16): from coprimality data
ProvedOddOrder.Peterfalvi.S15.normalizer_V_inf_W1_eq_bot_of_datafeit-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 is of type II, that , that is an elementary abelian -group, and that . Then
This assembles the -side core of (13.16) from the crux using coprime action on the abelian group .
Preamble
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_V_inf_W1_eq_bot_of_data [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
(hTTypeII : IsTypeII hyp.T)
(hcop : Nat.Coprime (Nat.card ↥hyp.Q) (Nat.card ↥(hyp.V ⊔ hyp.W2)))
(hQ_elemAb : IsElementaryAbelian hyp.q ↥hyp.Q)
(hDbot : hyp.V ⊓ Subgroup.centralizer (hyp.Q : Set G) = ⊥) :
hyp.V ⊓ Subgroup.normalizer (hyp.W1 : 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_SAndTBasic.lean#L424-L587