Peterfalvi (13.13), numeric core: the estimates force and
ProvedOddOrder.Peterfalvi.S15.caseA_numeric_parametersfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be natural numbers and a rational number. Assume:
- , is prime and , and ;
- if then ;
- if then (with computed in and then cast to );
- in ;
- (natural-number division).
Then
This is the purely arithmetical core of Peterfalvi (13.13): for the divisibility bound contradicts , and for a proper divisor of would be too small to satisfy (13.11.c).
Formalization Note. Subtraction and division in , , and are natural-number operations. The theorem is stated in a section with an unused variable ; it does not depend on any group.
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 caseA_numeric_parameters {p q u : ℕ} {m : ℚ}
(hp3 : 3 ≤ p) (hqprime : q.Prime) (hqne2 : q ≠ 2)
(hpeven : 2 ∣ p - 1)
(hm5 : 5 ≤ q → (7 : ℚ) / 10 < m)
(h13c : q = 3 → (((p ^ 2 - 1 : ℕ) : ℚ) / 6) < (u : ℚ))
(hanalytic : (u : ℚ) >
m * ((p ^ (q - 1) : ℕ) : ℚ) / (q : ℚ))
(hdiv : u ∣ ((p - 1) / 2) ^ (q - 1)) :
q = 3 ∧ u = (p - 1) ^ 2 / 4 := 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#L170-L310