Peterfalvi (13.10):
ProvedOddOrder.Peterfalvi.S15.CharacterDegreeCore.analytic_inequality_of_caseB_factsfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite minimal simple group of odd order, hyp : Hypothesis (G := G) the Peterfalvi Section 13 hypothesis package with parameters , core : CharacterDegreeCore hyp and lam : LambdaClusterData hyp. Assume , , commutative, and pins : NuGridSupplyData hyp. Then
(as rational numbers).
This is the endpoint of Peterfalvi (13.10): the explicit case-B facts and the Core/cluster character data force the inequality.
Formalization Note. The hypothesis on is an equation of natural numbers with natural division, and is computed in before casting.
Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Canonicalization
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
variable {G : Type*} [Group G]
section
theorem CharacterDegreeCore.analytic_inequality_of_caseB_facts [Finite G]
(hG : OddOrder.BG.IsMinimalSimpleOdd G) {hyp : Hypothesis (G := G)}
(core : CharacterDegreeCore hyp) (lam : LambdaClusterData hyp)
(hD : hyp.D = ⊥) (hv : hyp.v = (hyp.q ^ hyp.p - 1) / (hyp.q - 1))
(hQcomm : IsMulCommutative ↥hyp.Q) (pins : NuGridSupplyData hyp) :
(hyp.u : ℚ) / (hyp.c : ℚ) >
hyp.m * ((hyp.p ^ (hyp.q - 1) : ℕ) : ℚ) / (hyp.q : ℚ) := 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/AnalyticRelayer.lean#L537-L561