Peterfalvi (13.15): numerical elimination of the case
ProvedOddOrder.Peterfalvi.S15.caseB_order_x_absurd_of_gefeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be natural numbers and a rational number. Assume: are prime, , , ; ; (natural-number division); and ; if and if ; if then ; and the analytic inequality
holds in . Then a contradiction follows: the conclusion is False.
This is the side-agnostic numerical engine for eliminating in (13.15), combining the analytic inequality (13.10), (13.12) with the (13.11) bounds.
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
variable {G : Type*} [Group G]
theorem caseB_order_x_absurd_of_ge {p q x u : ℕ} {m : ℚ}
(hp : p.Prime) (hq : q.Prime) (hp3 : 3 ≤ p) (hq2 : q ≠ 2) (hpq : p ≠ q)
(hx : 2 * q + 1 ≤ x)
(hux : u * x = (p ^ q - 1) / (p - 1))
(hu_ne_one : u ≠ 1) (hu_cop_q : ¬ q ∣ u)
(hm5 : 5 ≤ q → (7 : ℚ) / 10 < m) (hm7 : 7 ≤ q → (8 : ℚ) / 10 < m)
(h11c : q = 3 → ((p : ℚ) ^ 2 - 1) / 6 < (u : ℚ))
(hanalytic : m < (q : ℚ) * ((p : ℚ) ^ q - 1)
/ ((p : ℚ) ^ (q - 1) * (x : ℚ) * ((p : ℚ) - 1))) :
False := 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/CaseBOrder.lean#L44-L150