Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.13), numeric core: the estimates force q=3q=3q=3 and u=(p−1)2/4u=(p-1)^2/4u=(p−1)2/4

Proved
OddOrder.Peterfalvi.S15.caseA_numeric_parameters

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let p,q,up, q, up,q,u be natural numbers and mmm a rational number. Assume:

  • 3≤p3 \le p3≤p, qqq is prime and q≠2q \ne 2q=2, and 2∣p−12 \mid p-12∣p−1;
  • if q≥5q \ge 5q≥5 then m>7/10m > 7/10m>7/10;
  • if q=3q = 3q=3 then (p2−1)/6<u(p^2-1)/6 < u(p2−1)/6<u (with p2−1p^2-1p2−1 computed in N\mathbb{N}N and then cast to Q\mathbb{Q}Q);
  • u>m p q−1/qu > m\, p^{\,q-1}/qu>mpq−1/q in Q\mathbb{Q}Q;
  • u∣((p−1)/2)q−1u \mid \bigl((p-1)/2\bigr)^{q-1}u∣((p−1)/2)q−1 (natural-number division).

Then

q=3andu=(p−1)2/4.q = 3 \quad\text{and}\quad u = (p-1)^2/4 .q=3andu=(p−1)2/4.

This is the purely arithmetical core of Peterfalvi (13.13): for q≥5q \ge 5q≥5 the divisibility bound contradicts m>7/10m > 7/10m>7/10, and for q=3q=3q=3 a proper divisor of ((p−1)/2)2((p-1)/2)^2((p−1)/2)2 would be too small to satisfy (13.11.c).

Formalization Note. Subtraction and division in p−1p-1p−1, (p−1)/2(p-1)/2(p−1)/2, (p−1)2/4(p-1)^2/4(p−1)2/4 and p2−1p^2-1p2−1 are natural-number operations. The theorem is stated in a section with an unused variable GGG; 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.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/OrderDetermination.lean#L170-L310

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