Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.2.e)/(7.2): the (S,H#)(S,H^\#)(S,H#) Dade isometry equals IndSG\mathrm{Ind}_S^GIndSG​

Proved
OddOrder.Peterfalvi.S15.H_sharp_tau_eq_induce

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a minimal simple group of odd order (IsMinimalSimpleOdd G), and let hyp : Hypothesis be the Peterfalvi (13.1) configuration for GGG: two maximal subgroups S,TS,TS,T with W=S∩T=W1W2W=S\cap T=W_1W_2W=S∩T=W1​W2​ cyclic, ∣W1∣=q|W_1|=q∣W1​∣=q, ∣W2∣=p|W_2|=p∣W2​∣=p (p,qp,qp,q odd primes), P=SFP=S_FP=SF​ and Q=TFQ=T_FQ=TF​ the maximal nilpotent normal Hall subgroups, complements U,VU,VU,V with S′=PUS'=PUS′=PU, T′=QVT'=QVT′=QV, C=CU(P)C=C_U(P)C=CU​(P), D=CV(Q)D=C_V(Q)D=CV​(Q), ∣U∣=uc|U|=uc∣U∣=uc, ∣V∣=vd|V|=vd∣V∣=vd, together with the associated character grids ηij\eta_{ij}ηij​, μij\mu_{ij}μij​, νij\nu_{ij}νij​ (i<qi<qi<q, j<pj<pj<p). Let GGG be finite (Fintype G, ∣G∣|G|∣G∣ invertible in C\mathbb CC). Let α\alphaα be a class function on SSS supported on H#=H∖{1}H^\#=H\setminus\{1\}H#=H∖{1} (an element of SupportedClassFunctions ℂ (sharp H) S), and let τ\tauτ be the Dade isometry of the (7.1) hypothesis H_sharp_hypothesis71 hG hyp. Then

τ(α)=IndSG α.\tau(\alpha)=\mathrm{Ind}_S^G\,\alpha .τ(α)=IndSG​α.

This is the clause of (13.2.e) that τ\tauτ coincides with induction; it links the (7.7.a) coefficients with the τ1\tau_1τ1​-extension.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_HypothesisBasics
import Definitions.Def_OddOrder_Peterfalvi_S15_SAndT_Setup_Machinery135
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 H_sharp_tau_eq_induce [Fintype G] [Invertible (Nat.card G : ℂ)]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G) (hyp : Hypothesis (G := G))
    (α : OddOrder.Peterfalvi.S04.SupportedClassFunctions ℂ
      (OddOrder.Peterfalvi.S04.sharp (hyp.H : Set G)) hyp.S) :
    (H_sharp_hypothesis71 hG hyp).τ α
      = ClassFunction.induce hyp.S (α : ClassFunction ↥hyp.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_SAndT_Setup/Machinery135.lean#L1122-L1177

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