Peterfalvi (14.11.2) on the -side: is a signed -grid sum minus a unit-norm
ProvedOddOrder.Peterfalvi.S16.OrthogonalitySwitchData.lSide_expansion_classificationfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple odd-order group with no maximal subgroup of type V (hnoV), hncH0C : S13.H0CNoncoherenceRefuter G, and hyp a Peterfalvi §14 configuration with parameters and grid . Let be a maximal subgroup of and dataL : TypeICoherent78Data L. Write (dataL.h78 hG).beta, (dataL.h78 hG).nu, the distinguished member (dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct. Assume
- and ;
- the complement index ;
- and in (with , , computed in ), where is
Nat.card dataL.typeIHyp.Hand is the index in of the subgroup(maxNilpotentNormalHall L).subgroupOf L, the maximal normal nilpotent Hall subgroup of regarded inside .
Then there are signs (, ) and a class function on such that or , and
This is the -instance of the general (14.11.2) expansion: the rigidity of the -grid projection and the norm-one classification of the removed character are combined with the Bessel bound.
Formalization Note. The index is ((maxNilpotentNormalHall L).subgroupOf L).index, cast to .
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_BetaVanishing import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines 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_CharacterDegreeSupply
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]
namespace OrthogonalitySwitchData
open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
theorem lSide_expansion_classification [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
(hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
(hncH0C : OddOrder.Peterfalvi.S13.H0CNoncoherenceRefuter G)
{hyp : Hypothesis (G := G)} {L : Subgroup G} (hLmax : L ∈ maximalSubgroups G)
(dataL : TypeICoherent78Data L)
(hq3 : hyp.base.q = 3) (hp5 : hyp.base.p = 5)
(hepq : (dataL.h78 hG).complementIndex = hyp.base.p * hyp.base.q)
(hub_u : ((hyp.base.u - 1 : ℕ) : ℚ) / (hyp.base.q : ℚ) <
((Nat.card ↥dataL.typeIHyp.H - 1 : ℕ) : ℚ)
/ (((maxNilpotentNormalHall L).subgroupOf L).index : ℚ))
(hub_v : ((hyp.base.v - 1 : ℕ) : ℚ) / (hyp.base.p : ℚ) <
((Nat.card ↥dataL.typeIHyp.H - 1 : ℕ) : ℚ)
/ (((maxNilpotentNormalHall L).subgroupOf L).index : ℚ)) :
∃ (signs : Fin hyp.base.q → Fin hyp.base.p → ℤ) (chi : ClassFunction G ℂ),
(∀ i j, signs i j = 1 ∨ signs i j = -1) ∧
(chi = (dataL.h78 hG).nu ((dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct) ∨
chi = -((dataL.h78 hG).nu
(((dataL.h78 hG).hyp76.zeta (dataL.h78 hG).zetaDistinct).conj))) ∧
(dataL.h78 hG).beta =
(∑ i : Fin hyp.base.q, ∑ j : Fin hyp.base.p,
(signs i j : ℂ) • hyp.base.eta i j) - chi := by sorry
end OrthogonalitySwitchData
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/ComparingLMBasic.lean#L433-L542