Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (9.8)/(9.11): a reducible member of the kernel-filter family on S′S'S′ is a μ\muμ-column sum

Proved
OddOrder.Section16CharacterData.muS_reducible_dichotomy

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

In the Section 16 setting, let GGG be a finite group which is a minimal simple group of odd order (hG : IsMinimalSimpleOdd G), let mp : Section16MaximalPair G be a pair of maximal subgroups with S=S=S= mp.S, and let tp : Section16TypePStructure mp be a type P structure with primes p=p=p= tp.p, q=q=q= tp.q (the relevant W1W_1W1​ group having nonzero order). Let X≤SX\le SX≤S be a subgroup and ψ\psiψ a class function on SSS in the kernel-filter family inducedKernelFamily (S'.subgroupOf S) X over S′S'S′ (the derived subgroup of SSS). If ψ\psiψ is not an irreducible character, then there is j∈Fin pj\in\mathrm{Fin}\,pj∈Finp with j≠0j\ne0j=0 such that

ψ=∑i∈Fin qμij,\psi=\sum_{i\in\mathrm{Fin}\,q}\mu_{ij},ψ=i∈Finq∑​μij​,

where μij=\mu_{ij}=μij​= muS hG mp tp i j.

That is, every reducible member is a nonzero μ\muμ-column sum. This is the SSS-instance of the reverse dichotomy of Peterfalvi (9.8)/(9.11).

Formalization Note inducedKernelFamily, muS, and the Section 16 structures are project-specific.

Preamble
import Definitions.Def_OddOrder_FeitThompsonSection16Core
import Definitions.Def_OddOrder_FeitThompsonSetup
Formal statement
namespace OddOrder

open OddOrder.BG

open OddOrder.GroupTheory

open OddOrder.Isaacs

open OddOrder.RepresentationTheory

open scoped Pointwise

universe u

section

open scoped OddOrder.Peterfalvi.S15.FiniteInduce

namespace Section16CharacterData

variable {G : Type*} [Group G] [Finite G] (hG : IsMinimalSimpleOdd G) (mp : Section16MaximalPair G)

variable (tp : Section16TypePStructure mp)

variable [NeZero (Nat.card ↥(mp.certainTypeS hG).W1)]

set_option backward.isDefEq.respectTransparency false in

theorem muS_reducible_dichotomy {X : Subgroup ↥mp.S} {ψ : ClassFunction ↥mp.S ℂ}
    (hψ : ψ ∈ OddOrder.Peterfalvi.S08.inducedKernelFamily
      ((derivedInG mp.S).subgroupOf mp.S) X)
    (hred : ¬ OddOrder.RepresentationTheory.IsIrreducibleCharacter ψ) :
    ∃ j : Fin tp.p, j ≠ ⟨0, tp.p_prime.pos⟩ ∧ ψ = ∑ i : Fin tp.q, muS hG mp tp i j := by sorry

end Section16CharacterData

end

end OddOrder
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/FeitThompsonSetup.lean#L303-L351

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