Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.15): numerical elimination of the case x≥2q+1x\ge 2q+1x≥2q+1

Proved
OddOrder.Peterfalvi.S15.caseB_order_x_absurd_of_ge

by burkh4rt · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let p,q,x,up,q,x,up,q,x,u be natural numbers and mmm a rational number. Assume: p,qp,qp,q are prime, 3≤p3\le p3≤p, q≠2q\ne2q=2, p≠qp\ne qp=q; 2q+1≤x2q+1\le x2q+1≤x; u x=pq−1p−1u\,x=\dfrac{p^q-1}{p-1}ux=p−1pq−1​ (natural-number division); u≠1u\ne1u=1 and q∤uq\nmid uq∤u; m>7/10m>7/10m>7/10 if q≥5q\ge5q≥5 and m>8/10m>8/10m>8/10 if q≥7q\ge7q≥7; if q=3q=3q=3 then p2−16<u\dfrac{p^2-1}{6}<u6p2−1​<u; and the analytic inequality

m<q (pq−1)pq−1 x (p−1)m<\frac{q\,(p^q-1)}{p^{q-1}\,x\,(p-1)}m<pq−1x(p−1)q(pq−1)​

holds in Q\mathbb QQ. Then a contradiction follows: the conclusion is False.

This is the side-agnostic numerical engine for eliminating x≥2q+1x\ge2q+1x≥2q+1 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.S15
Source
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

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me