Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.8) for TTT: a distinguished index with ⟨τψi1,η10⟩=±1\langle\tau\psi_{i_1},\eta_{10}\rangle=\pm1⟨τψi1​​,η10​⟩=±1 over a chosen base

Proved
OddOrder.Peterfalvi.S15.Hypothesis.exists_muT_index_core_of_base_condition

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). Assume moreover: no maximal subgroup of GGG is of type V (hnoV); pins : NuGridSupplyData hyp; vd≠1vd\ne1vd=1; TTT is of type P (IsTypeP hyp.T) with Tdata : TypePData hyp.T satisfying Tdata.U = V, Tdata.W1 = W₂, Tdata.W2 = W₁; chief : ChiefFactorData for the type-I/II/III/V setup of TTT; D=1D=1D=1; QQQ is commutative. Let φ0\varphi_0φ0​ be an irreducible character of QQQ (as a subgroup of TTT) with Q⊈ker⁡φ0Q\not\subseteq\ker\varphi_0Q⊆kerφ0​, such that either IndQTφ0\mathrm{Ind}_Q^T\varphi_0IndQT​φ0​ is irreducible or ⟨(IndQTφ0)τ1,η10⟩=0\langle(\mathrm{Ind}_Q^T\varphi_0)^{\tau_1},\eta_{10}\rangle=0⟨(IndQT​φ0​)τ1​,η10​⟩=0 (with τ1\tau_1τ1​ the honest TTT-side extension tau1T_ofHonest). Let ζ0,…,ζn\zeta_0,\dots,\zeta_nζ0​,…,ζn​ be the (7.6) family Q_sharp_hypothesis76_base of characters of TTT based at IndQTφ0\mathrm{Ind}_Q^T\varphi_0IndQT​φ0​ with (7.7.a) coefficients ci(⋅)=c_i(\cdot)=ci​(⋅)= cCoeff · i. Then there exist an index i1>0i_1>0i1​>0 and an integer δ\deltaδ such that:

  • Q⊈ker⁡ζi1Q\not\subseteq\ker\zeta_{i_1}Q⊆kerζi1​​ and δ2=1\delta^2=1δ2=1;
  • ci1(η10)=δc_{i_1}(\eta_{10})=\deltaci1​​(η10​)=δ;
  • ci(η10)=0c_i(\eta_{10})=0ci​(η10​)=0 for every i>0i>0i>0, i≠i1i\ne i_1i=i1​ with Q⊈ker⁡ζiQ\not\subseteq\ker\zeta_iQ⊆kerζi​;
  • ∥ζi1∥2=p\|\zeta_{i_1}\|^2=p∥ζi1​​∥2=p (zetaNormSq) and ζi1(1)=pv\zeta_{i_1}(1)=pvζi1​​(1)=pv.

This supplies, on the TTT-side, the distinguished ν\nuν-row index needed in the character-degree argument of Peterfalvi Section 13.

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEnginesSSide
import Definitions.Def_OddOrder_Peterfalvi_S15_CharacterDegreeEngines
Formal statement
namespace OddOrder.Peterfalvi.S15

open OddOrder.GroupTheory

open OddOrder.RepresentationTheory

open OddOrder.Isaacs

variable {G : Type*} [Group G]

set_option maxHeartbeats 1600000 in
-- The (7.6)-family bookkeeping (constituent expansion + per-index coefficient computation)
-- elaborates as a single large proof term; the default budget covers only part of it.
open OddOrder.Peterfalvi.S11 in
open scoped Classical in
open scoped FiniteInduce in

theorem Hypothesis.exists_muT_index_core_of_base_condition [Finite G]
    (hG : OddOrder.BG.IsMinimalSimpleOdd G)
    (hnoV : ¬ ∃ M : Subgroup G, M ∈ maximalSubgroups G ∧ OddOrder.GroupTheory.IsTypeV M)
    (hyp : Hypothesis (G := G)) (pins : NuGridSupplyData hyp)
    (hvd : hyp.v * hyp.d ≠ 1)
    (hTP : OddOrder.BG.Ch4.S14.IsTypeP hyp.T)
    (Tdata : TypePData hyp.T) (hU : Tdata.U = hyp.V)
    (hW1 : Tdata.W1 = hyp.W2) (hW2 : Tdata.W2 = hyp.W1)
    (chief : ChiefFactorData (hyp.toTypesIIIIIIVSetupT hG hvd))
    (hD : hyp.D = ⊥)
    (hQcomm : IsMulCommutative ↥hyp.Q)
    (φ₀ : OddOrder.RepresentationTheory.IrreducibleCharacter ↥(hyp.Q.subgroupOf hyp.T))
    (hφ₀Q : ¬ (((hyp.Q.subgroupOf hyp.T).subgroupOf (hyp.Q.subgroupOf hyp.T) :
        Set ↥(hyp.Q.subgroupOf hyp.T)) ⊆
      OddOrder.Peterfalvi.S03.characterKernel
        (φ₀ : ClassFunction ↥(hyp.Q.subgroupOf hyp.T) ℂ)))
    (hφ₀base :
      OddOrder.RepresentationTheory.IsIrreducibleCharacter
          (ClassFunction.induce (hyp.Q.subgroupOf hyp.T)
            (φ₀ : ClassFunction ↥(hyp.Q.subgroupOf hyp.T) ℂ)) ∨
        ClassFunction.inner
          (hyp.tau1T_ofHonest hG hnoV pins hvd hTP Tdata hU hW1 hW2 chief
            (ClassFunction.induce (hyp.Q.subgroupOf hyp.T)
              (φ₀ : ClassFunction ↥(hyp.Q.subgroupOf hyp.T) ℂ))) hyp.eta10 = 0) :
    ∃ (i₁ : Fin ((Q_sharp_hypothesis76_base hG hyp hvd φ₀).n + 1)) (δ : ℤ), 0 < i₁ ∧
      ¬ ((hyp.Q.subgroupOf hyp.T : Set ↥hyp.T) ⊆
        OddOrder.Peterfalvi.S03.characterKernel
          ((Q_sharp_hypothesis76_base hG hyp hvd φ₀).zeta i₁)) ∧
      δ ^ 2 = 1 ∧
      (Q_sharp_hypothesis76_base hG hyp hvd φ₀).cCoeff hyp.eta10 i₁ = (δ : ℂ) ∧
      (∀ i : Fin ((Q_sharp_hypothesis76_base hG hyp hvd φ₀).n + 1), 0 < i → i ≠ i₁ →
        ¬ ((hyp.Q.subgroupOf hyp.T : Set ↥hyp.T) ⊆
          OddOrder.Peterfalvi.S03.characterKernel
            ((Q_sharp_hypothesis76_base hG hyp hvd φ₀).zeta i)) →
        (Q_sharp_hypothesis76_base hG hyp hvd φ₀).cCoeff hyp.eta10 i = 0) ∧
      (Q_sharp_hypothesis76_base hG hyp hvd φ₀).zetaNormSq i₁ = (hyp.p : ℂ) ∧
      (Q_sharp_hypothesis76_base hG hyp hvd φ₀).zeta i₁ 1 = ((hyp.p * hyp.v : ℕ) : ℂ) := 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_CharacterDegreeEngines.lean#L64-L631

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