Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.5): induced characters of H=PCH=PCH=PC with P⊈ker⁡θP\not\subseteq\ker\thetaP⊆kerθ lie in Z[S]\mathbb Z[\mathcal S]Z[S]

Proved
OddOrder.Peterfalvi.S15.Hypothesis.induce_H_mem_zSpan_S

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 H,P≤S≤GH,P\le S\le GH,P≤S≤G, and let chief be a chief-factor datum for the associated Types I--V setup of SSS. Let θ\thetaθ be an irreducible character of HHH (as a subgroup of SSS) such that PPP is not contained in the kernel of θ\thetaθ. Then

IndHSθ ∈ Z[S],\mathrm{Ind}_H^{S}\theta\ \in\ \mathbb Z[\mathcal S],IndHS​θ ∈ Z[S],

the Z\mathbb ZZ-span (zSpan) of the family S\mathcal SS of Section 9 (taken from mkSection11CharacterDataS_honest).

This is the family membership underlying the Peterfalvi (13.5) preamble, used throughout the Section 13 character computations.

Formalization Note. The subgroups H,PH,PH,P are viewed inside ↥S via subgroupOf; the statement is formulated for the scoped FiniteInduce instances.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_NineElevenSevenEight
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_MuColumnPin
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_DegreesFirstSplit
import Definitions.Def_OddOrder_Peterfalvi_S15_CaseACoherence
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

open scoped FiniteInduce in

theorem Hypothesis.induce_H_mem_zSpan_S [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
    (chief : OddOrder.Peterfalvi.S11.ChiefFactorData (hyp.toTypesIIIIIIVSetupS hG))
    (θ : ClassFunction ↥(hyp.H.subgroupOf hyp.S) ℂ)
    (hθ : OddOrder.RepresentationTheory.IsIrreducibleCharacter θ)
    (hθP : ¬ (((hyp.P.subgroupOf hyp.S).subgroupOf (hyp.H.subgroupOf hyp.S) :
        Set ↥(hyp.H.subgroupOf hyp.S)) ⊆
      OddOrder.Peterfalvi.S03.characterKernel θ)) :
    ClassFunction.induce (hyp.H.subgroupOf hyp.S) θ ∈
      OddOrder.Peterfalvi.S07.zSpan (hyp.mkSection11CharacterDataS_honest hG chief).S := 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_CaseACoherence.lean#L1024-L1156

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