Peterfalvi (13.18.d): residual-norm bound
ProvedOddOrder.Peterfalvi.S15.gammaGrid_Y_norm_bound_auxfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple group of odd order (IsMinimalSimpleOdd G) with no maximal subgroup of type V, and let hyp : Hypothesis (G := G) be the Peterfalvi Section 13 hypothesis package (subgroups and parameters ). Assume . Let be class functions on with (GammaGrid hG hyp = X + Y), , and for all , (hyp.eta i k). Then
This is the core of the residual-norm bound of Peterfalvi (13.18.d).
Formalization Note. The statement is formulated with the instances scoped by FiniteInduce; are cast to .
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacterBasic import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise
variable {G : Type*} [Group G]
open scoped OddOrder.Peterfalvi.S12.FiniteInduce in
theorem gammaGrid_Y_norm_bound_aux [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G)
(hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
(hyp : Hypothesis (G := G)) (hc1 : hyp.c = 1)
(X Y : ClassFunction G ℂ) (defXY : GammaGrid hG hyp = X + Y)
(oXY : ClassFunction.inner X Y = 0)
(oYeta : ∀ (i : Fin hyp.q) (k : Fin hyp.p), ClassFunction.inner Y (hyp.eta i k) = 0) :
(ClassFunction.inner Y Y).re ≤ ((hyp.u : ℚ) - 1) / (hyp.q : ℚ) := 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_BridgeCharacter.lean#L632-L824