Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (14.14.b)/(14.15): arithmetic core forces q=3q=3q=3 and p=5p=5p=5 in case (b)

Proved
OddOrder.Peterfalvi.S16.Hypothesis.caseB_forces_q_three_and_p_five

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let hyp be a Peterfalvi §14 configuration with parameters p=p=p= hyp.base.p, q=q=q= hyp.base.q, v=v=v= hyp.base.v (and no hypothesis on GGG beyond the group). Assume

  • v=(qp−1)/(q−1)v = (q^p-1)/(q-1)v=(qp−1)/(q−1) (natural-number division);
  • v−1pq≤pq−1\dfrac{v-1}{pq} \le pq-1pqv−1​≤pq−1 in Q\mathbb{Q}Q (with v−1v-1v−1 and pq−1pq-1pq−1 computed in N\mathbb{N}N, then cast).

Then

q=3andp=5.q = 3\quad\text{and}\quad p = 5 .q=3andp=5.

The hypothesis on (v−1)/(pq)(v-1)/(pq)(v−1)/(pq) is the (βL,ψ)(\beta_L,\psi)(βL​,ψ)-pairing bound of (14.14.b); combined with the cyclotomic value of vvv it pins down the exceptional primes in the proof via the exponential comparison (14.8.a), which uses the primality and ordering of p,qp,qp,q carried by the configuration hyp.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S16_NonExistenceG_BetaVanishing
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
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
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeSupply
Formal statement
namespace OddOrder.Peterfalvi.S16

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

open scoped BigOperators

variable {G : Type*} [Group G]

namespace Hypothesis

theorem caseB_forces_q_three_and_p_five (hyp : Hypothesis (G := G))
    (hv : hyp.base.v = (hyp.base.q ^ hyp.base.p - 1) / (hyp.base.q - 1))
    (hbound : ((hyp.base.v - 1 : ℕ) : ℚ) / ((hyp.base.p * hyp.base.q : ℕ) : ℚ) ≤
      ((hyp.base.p * hyp.base.q - 1 : ℕ) : ℚ)) :
    hyp.base.q = 3 ∧ hyp.base.p = 5 := by sorry

end Hypothesis

end OddOrder.Peterfalvi.S16
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/S16_NonExistenceG/ComparingLM.lean#L262-L349

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