Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (14.11.3), SSS-side: elements outside the conjugates of W#W^\#W# and P#P^\#P# have order prime to ppp

Proved
OddOrder.Peterfalvi.S16.orderOf_coprime_p_of_not_mem_conj

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite minimal simple odd-order group and hyp a Peterfalvi §13 configuration for GGG with prime ppp and subgroups S,P,WS, P, WS,P,W. Assume the Frobenius-kernel property

∀x∈P#,S′∩CG(x)≤P,\forall x\in P^\#,\quad S' \cap C_G(x) \le P ,∀x∈P#,S′∩CG​(x)≤P,

where P#P^\#P# is sharpSubgroup hyp.P (the nonidentity elements of PPP) and S′S'S′ is the derived subgroup of SSS taken in GGG (derivedInG hyp.S). Let g∈Gg\in Gg∈G lie in neither the set of GGG-conjugates of W#W^\#W# nor the set of GGG-conjugates of P#P^\#P# (conjClassSet). Then

gcd⁡(∣g∣, p)=1,\gcd\bigl(|g|,\,p\bigr)=1,gcd(∣g∣,p)=1,

i.e. the order of ggg is prime to ppp.

This is the SSS-side core of (14.11.3): the contrapositive shows that if ppp divides ∣g∣|g|∣g∣ then ggg is conjugate into P#P^\#P# or W#W^\#W#, using the decomposition S=S′⋊W1S = S' \rtimes W_1S=S′⋊W1​ and the coprime coset collapse (2.1).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs
import Definitions.Def_OddOrder_Peterfalvi_S15_SSideGaloisFieldModel
import Definitions.Def_OddOrder_Peterfalvi_S16_PairingCoherence
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
import Definitions.Def_OddOrder_Peterfalvi_S16_GridExpansion
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTGrid
import Definitions.Def_OddOrder_BG_AppC_LemmaC3_Step4Capstone
import Definitions.Def_OddOrder_Peterfalvi_S16_CoreLemmas
import Definitions.Def_OddOrder_GroupTheory_ConjClassSet
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_SemilinearFieldModel
import Definitions.Def_OddOrder_Peterfalvi_S16_G0Coprime
Formal statement
namespace OddOrder.Peterfalvi.S16

open OddOrder.GroupTheory

open scoped Pointwise

variable {G : Type*} [Group G]

theorem orderOf_coprime_p_of_not_mem_conj [Finite G] (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hyp : OddOrder.Peterfalvi.S15.Hypothesis (G := G))
    (hfrob : ∀ x ∈ sharpSubgroup hyp.P,
      derivedInG hyp.S ⊓ Subgroup.centralizer ({x} : Set G) ≤ hyp.P) {g : G}
    (hW : g ∉ conjClassSet (sharpSubgroup hyp.W))
    (hP : g ∉ conjClassSet (sharpSubgroup hyp.P)) :
    Nat.Coprime (orderOf g) hyp.p := by sorry

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_G0Coprime.lean#L412-L533

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