Peterfalvi (13.12): numerical elimination forcing , ,
ProvedOddOrder.Peterfalvi.S15.c_eq_one_forces_paramsfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be natural numbers and a rational number. Assume: prime, , , ; and ; if ; if ; if and ; the value formula
and the bound
Then , and .
This is the arithmetic heart of (13.12); the remaining case is excluded structurally elsewhere.
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 c_eq_one_forces_params {p q c : ℕ} {m : ℚ}
(hp : p.Prime) (hq : q.Prime) (hp3 : 3 ≤ p) (hq2 : q ≠ 2) (hpq : p ≠ q)
(hc2q1 : 2 * q + 1 ≤ c) (h2q : 2 * q ∣ c - 1)
(hm5 : 5 ≤ q → (7 : ℚ) / 10 < m) (hm7 : 7 ≤ q → (8 : ℚ) / 10 < m)
(hm49 : q = 3 → 5 ≤ p → (49 : ℚ) / 100 < m)
(hmval : m = 1 - 1 / ((q : ℚ) - 1) - ((q : ℚ) - 1) / (q : ℚ) ^ p
+ 1 / (((q : ℚ) - 1) * (q : ℚ) ^ p))
(hbound : m < (q : ℚ) * ((p : ℚ) ^ q - 1)
/ ((c : ℚ) * (p : ℚ) ^ (q - 1) * ((p : ℚ) - 1))) :
p = 5 ∧ q = 3 ∧ c = 7 := 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#L571-L696