Peterfalvi (14.11.2): if then and is a signed -grid sum minus
ProvedOddOrder.Peterfalvi.S16.betaM_expansionfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple odd-order group with no maximal subgroup of type V (hnoV), assume hncH0C : S13.H0CNoncoherenceRefuter G, let hyp be a Peterfalvi §14 configuration with primes and grid , and let Mdata : MHypothesis hyp with kernel and complement index . Assume . Then , and there are signs (, ) and a class function on such that for all and
where Mdata.betaM, Mdata.tau1 Mdata.psi.
In (14.11.2) the character is or ; this public statement keeps only the pointwise norm consequence .
Formalization Note. The proof derives the full classification internally; the stated conclusion records only the consequence about absolute values.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentEtaOrthogonality import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_CoherentProjectionRigidity import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupL import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_SubgroupMCore
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]
theorem betaM_expansion [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)) (Mdata : MHypothesis hyp)
(hne : Mdata.K ≠ hyp.base.V) :
Mdata.e = hyp.base.p * hyp.base.q ∧
∃ ε : Fin hyp.base.q → Fin hyp.base.p → ℤ,
(∀ i j, ε i j = 1 ∨ ε i j = -1) ∧
∃ χ : ClassFunction G ℂ,
(∀ g : G, ‖χ g‖ = ‖(Mdata.tau1 Mdata.psi) g‖) ∧
Mdata.betaM =
(∑ i : Fin hyp.base.q, ∑ j : Fin hyp.base.p,
(ε i j : ℂ) • hyp.base.eta i j) - χ := 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/SubgroupMCore.lean#L1272-L1304