Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (14.6): center trapping, Z(R)≤R0Z(R)\le R_0Z(R)≤R0​ for R0∈Sylr(U)R_0\in\mathrm{Syl}_r(U)R0​∈Sylr​(U) noncyclic

Proved
OddOrder.Peterfalvi.S15.sylow_center_le_U_sylow_of_centralizer_witness

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite minimal simple group of odd order and hyp : Hypothesis (G := G) the Peterfalvi Section 13 hypothesis package, with subgroups P,U≤GP,U\le GP,U≤G. Let rrr be a prime, let R0R_0R0​ be a noncyclic Sylow rrr-subgroup of UUU, let K≤GK\le GK≤G with U≤KU\le KU≤K, and let RRR be a Sylow rrr-subgroup of KKK whose image contains the image of R0R_0R0​ (under Subgroup.inclusion). Let x∈Gx\in Gx∈G lie in the image of R0R_0R0​ with x≠1x\ne1x=1 and P∩CG(x)≠1P\cap C_G(x)\ne1P∩CG​(x)=1. Then the center of (the image in GGG of) RRR is contained in (the image in GGG of) R0R_0R0​:

Z(R) ≤ R0.Z(R)\ \le\ R_0 .Z(R) ≤ R0​.

The nontrivial point of P∩CG(x)P\cap C_G(x)P∩CG​(x) places xxx in the type-P2P_2P2​ support; the TI property gives CG(x)≤SC_G(x)\le SCG​(x)≤S, and the Hall property of UUU in SSS forces Z(R)≤R0Z(R)\le R_0Z(R)≤R0​. It is used in Peterfalvi (14.6).

Formalization Note. Subgroups are transported to GGG by Subgroup.map _.subtype; "P∩CG(x)≠1P\cap C_G(x)\ne1P∩CG​(x)=1" is hyp.P ⊓ Subgroup.centralizer {x} ≠ ⊥.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndTDefs
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 sylow_center_le_U_sylow_of_centralizer_witness [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
    {r : ℕ} (hr : r.Prime)
    (R₀ : Sylow r ↥hyp.U) (hR₀nc : ¬ IsCyclic ↥(R₀ : Subgroup ↥hyp.U))
    (K : Subgroup G) (hUK : hyp.U ≤ K) (R : Sylow r ↥K)
    (hR₀R : (R₀ : Subgroup ↥hyp.U).map (Subgroup.inclusion hUK) ≤ R)
    {x : G} (hxR₀ : x ∈ (R₀ : Subgroup ↥hyp.U).map hyp.U.subtype)
    (hx1 : x ≠ (1 : G))
    (hxP : hyp.P ⊓ Subgroup.centralizer ({x} : Set G) ≠ ⊥) :
    (Subgroup.center ↥((R : Subgroup ↥K).map K.subtype)).map
        ((R : Subgroup ↥K).map K.subtype).subtype ≤
      (R₀ : Subgroup ↥hyp.U).map hyp.U.subtype := 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_CaseASylowCenter.lean#L69-L170

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