Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every member of the type I family is an enumerated ζk\zeta_kζk​ with k≠k\nek= `ind1H`

Proved
OddOrder.Peterfalvi.S15.exists_zeta_index_of_mem_Sset

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group with IsMinimalSimpleOdd G, let L≤GL\le GL≤G carry dataL : TypeICoherent78Data L, with enumerated characters ζ0,…,ζn\zeta_0,\dots,\zeta_nζ0​,…,ζn​ (dataL.zeta, n=n=n= dataL.n) and distinguished index dataL.ind1H, and let φ\varphiφ be a class function on LLL lying in dataL.typeIHyp.Sset. Then there is an index k∈{0,…,n}k\in\{0,\dots,n\}k∈{0,…,n} with k≠k\nek= dataL.ind1H and

ζk=φ.\zeta_k=\varphi .ζk​=φ.

This is the converse of TypeICoherent78Data.zeta_mem_Sset; the exclusion of ind1H uses that Ind 1H\mathrm{Ind}\,1_HInd1H​ is real while a nontrivial induced irreducible is not, by oddness of the order.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_BridgeCharacter
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
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 OddOrder.Peterfalvi.S12.FiniteInduce in

theorem exists_zeta_index_of_mem_Sset [Finite G]
    (_hG : OddOrder.BG.IsMinimalSimpleOdd G) {L : Subgroup G}
    (dataL : OddOrder.Peterfalvi.S16.TypeICoherent78Data L)
    {φ : ClassFunction ↥L ℂ} (hφ : φ ∈ dataL.typeIHyp.Sset) :
    ∃ k : Fin (dataL.n + 1), k ≠ dataL.ind1H ∧ dataL.zeta k = φ := 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_SAndTGrid.lean#L605-L664

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