Peterfalvi (13.11): elementary numerical bounds for and
ProvedOddOrder.Peterfalvi.S15.numeric_bounds_of_analytic_inequalityfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a minimal simple group of odd order (IsMinimalSimpleOdd G), and let hyp : Hypothesis be the Peterfalvi (13.1) configuration for : two maximal subgroups with cyclic, , ( odd primes), and the maximal nilpotent normal Hall subgroups, complements with , , , , , , together with the associated character grids , , (, ). Assume the analytic inequality (13.10)
Then: if then ; if then ; and if then and .
These bounds feed the numerical eliminations (13.12) and (13.15).
Preamble
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
Formal statement
namespace OddOrder.Peterfalvi.S15
open OddOrder.GroupTheory
open OddOrder.RepresentationTheory
open OddOrder.Isaacs
open scoped Pointwise IsMulCommutative
variable {G : Type*} [Group G]
theorem numeric_bounds_of_analytic_inequality [Finite G]
(hyp : Hypothesis (G := G))
(h1310 : (hyp.u : ℚ) / (hyp.c : ℚ) >
hyp.m * ((hyp.p ^ (hyp.q - 1) : ℕ) : ℚ) / (hyp.q : ℚ)) :
(7 ≤ hyp.q → hyp.m > (8 / 10 : ℚ)) ∧
(5 ≤ hyp.q → hyp.m > (7 / 10 : ℚ)) ∧
(hyp.q = 3 →
hyp.m > (49 / 100 : ℚ) ∧
(hyp.u : ℚ) / (hyp.c : ℚ) > (((hyp.p ^ 2 - 1 : ℕ) : ℚ) / 6)) := 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_SAndT_Setup/OrderDetermination.lean#L509-L569