Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi Section 11, case B: members of X(H0C′)\mathcal X(H_0C')X(H0​C′) are induced from hcPsiPair\mathrm{hcPsiPair}hcPsiPair characters

Proved
OddOrder.Peterfalvi.S11.caseB_xiOf_H0Cprime_eq_induce_hcPsiPair

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group and M≤GM\le GM≤G a subgroup, with the Peterfalvi Types I--V setup data : TypesIIIIIIVSetup M (with subgroup HHH and parameter q=q=q= data.q), a chief-factor datum chief : ChiefFactorData data (with p=p=p= chief.p prime, NNN, H0H_0H0​), and the Section 11 character data chars. Suppose the data are in Clifford case B (caseB), with the instances on the group HUHUHU and the subgroup HCHCHC as in the statement (finite, normality, Invertible (Nat.card ·: ℂ)). Let ζ\zetaζ be an irreducible character of HUHUHU (huSub data) lying in the set X(H0C′)\mathcal X(H_0C')X(H0​C′) (xiOf data (chief.H0 ⊔ cprimeSub data chief)). Then there exist a nontrivial homomorphism θˉ:H/N→C×\bar\theta:H/N\to\mathbb C^\timesθˉ:H/N→C× and a homomorphism λ:C→C×\lambda:C\to\mathbb C^\timesλ:C→C× (on cInHu data chief) that is trivial on C′C'C′, such that

ζ=IndHCHU hcPsiPair(θˉ,λ).\zeta=\mathrm{Ind}_{HC}^{HU}\ \texttt{hcPsiPair}(\bar\theta,\lambda).ζ=IndHCHU​ hcPsiPair(θˉ,λ).

This is the case-B pair exhaustion for X(H0C′)\mathcal X(H_0C')X(H0​C′) in Peterfalvi Section 11, the C′C'C′-kernel analogue of the H0CH_0CH0​C statement.

Formalization Note. hcPsiPair chief θbar lam is the linear character of HCHCHC built from θˉ\bar\thetaθˉ and λ\lambdaλ; ClassFunction.induce is induction from the displayed subgroup of huSub data.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_CaseBXi
import Definitions.Def_OddOrder_Peterfalvi_S11_MaximalII_III_IV_InnerCompHomBasic
Formal statement
namespace OddOrder.Peterfalvi.S11

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

open scoped Pointwise

variable {G : Type*} [Group G]

open OddOrder.Isaacs.Ch03 (IsAInvariant isAInvariant_iff_smul_mem)

open OddOrder.Isaacs.Ch03.IsAInvariant (quotientMulAutHom)

variable {M : Subgroup G}

set_option maxHeartbeats 1600000 in
-- raised heartbeat budget for the heavy elaboration below

theorem caseB_xiOf_H0Cprime_eq_induce_hcPsiPair [Finite G] {M : Subgroup G}
    {data : TypesIIIIIIVSetup M} {chief : ChiefFactorData data}
    {chars : Section11CharacterData data chief} (caseB : CliffordCaseBData chars)
    [Fintype ↥(huSub data)]
    [Finite ↥(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data))]
    [Invertible (Nat.card ↥(huSub data) : ℂ)]
    [Invertible (Nat.card ↥(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf
      (huSub data)) : ℂ)]
    [(hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data)).Normal]
    {ζ : IrreducibleCharacter ↥(huSub data)}
    (hζ : ζ ∈ xiOf data (chief.H0 ⊔ cprimeSub data chief)) :
    ∃ (θbar : (↥data.H ⧸ chief.N) →* ℂˣ) (lam : ↥(cInHu data chief) →* ℂˣ), θbar ≠ 1 ∧
      (∀ c : ↥(cInHu data chief),
        (c : ↥(huSub data)) ∈ ((cprimeSub data chief).subgroupOf M).subgroupOf (huSub data) →
        lam c = 1) ∧
      (ζ : ClassFunction ↥(huSub data) ℂ)
        = ClassFunction.induce
            (hInHu data ⊔ ((chief.H0 ⊔ cSub data chief).subgroupOf M).subgroupOf (huSub data))
            (hcPsiPair chief θbar lam).toClassFunction := by sorry

end OddOrder.Peterfalvi.S11
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/S11_MaximalII_III_IV/InnerCompHomBasic.lean#L164-L386

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