Peterfalvi (13.6): lower bound (Core form)
ProvedOddOrder.Peterfalvi.S15.CharacterDegreeCore.lambda_tau1_sharp_norm_lower_corefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group with IsMinimalSimpleOdd G, let hyp : Hypothesis be the Peterfalvi (13.1) configuration, and let a LambdaClusterData hyp (the -cluster, with character lam.lambda, a class function on ) and core : CharacterDegreeCore hyp (Core data providing the -extension core.tau1S). Put and . Then
The estimate (13.6) feeds the constructed (13.5) correction package into the abstract Case B norm engine and is then compared with the -grid bounds in Section 13.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
section
open scoped Classical in
open scoped FiniteInduce in
theorem CharacterDegreeCore.lambda_tau1_sharp_norm_lower_core [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
(core : CharacterDegreeCore hyp) (lam : LambdaClusterData hyp) :
(Nat.card ↥hyp.S : ℝ) - ((hyp.u * hyp.q : ℕ) : ℝ) ^ 2
≤ ∑ x ∈ (Set.toFinite (sharpSubgroup hyp.H)).toFinset,
‖core.tau1S lam.lambda x‖ ^ 2 := by sorry
end
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_CaseBEndgameSupply/LambdaCorrection.lean#L503-L566