Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (13.8): a Q#Q^\#Q# base orthogonal to η10\eta_{10}η10​ (coefficient-zero choice)

Proved
OddOrder.Peterfalvi.S15.Hypothesis.exists_qSharpBase_orthogonal_eta10_core

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite minimal simple group of odd order with no maximal subgroup of type V, and hyp : Hypothesis (G := G) the Peterfalvi Section 13 hypothesis package with subgroups Q≤TQ\le TQ≤T and pins : NuGridSupplyData hyp. Assume vd≠1vd\neq1vd=1, that TTT is of type P (IsTypeP hyp.T) with data Tdata satisfying U=VU=VU=V (Tdata.U = hyp.V), W1=W2′W_1=W_2'W1​=W2′​ and W2=W1′W_2=W_1'W2​=W1′​ (Tdata.W1 = hyp.W2, Tdata.W2 = hyp.W1), let chief be a chief-factor datum for the Types I--V setup of TTT, and assume D=1D=1D=1. Then there is an irreducible character φ0\varphi_0φ0​ of QQQ (as a subgroup of TTT) such that Q⊈ker⁡φ0Q\not\subseteq\ker\varphi_0Q⊆kerφ0​ and

⟨τ1T(IndQTφ0), η10⟩=0,\big\langle\tau_{1T}\big(\mathrm{Ind}_Q^T\varphi_0\big),\ \eta_{10}\big\rangle=0 ,⟨τ1T​(IndQT​φ0​), η10​⟩=0,

where τ1T\tau_{1T}τ1T​ is hyp.tau1T_ofHonest ….

This is the coefficient-zero chosen Q#Q^\#Q# base of Peterfalvi (13.8); it replaces the unavailable assumption that IndQTφ0\mathrm{Ind}_Q^T\varphi_0IndQT​φ0​ is irreducible in case B.

Formalization Note. The statement is for the scoped FiniteInduce and classical instances. The non-containment appears as ¬ (Q ⊆ characterKernel φ₀) with QQQ viewed in itself.

Preamble
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]

section

open OddOrder.Peterfalvi.S11 in
open scoped Classical in
open scoped FiniteInduce in

theorem Hypothesis.exists_qSharpBase_orthogonal_eta10_core [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 = ⊥) :
    ∃ φ₀ : OddOrder.RepresentationTheory.IrreducibleCharacter
        ↥(hyp.Q.subgroupOf hyp.T),
      ¬ (((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) ℂ)) ∧
      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 := by sorry

end

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_CaseBEndgameSupply/Eta10Correction.lean#L27-L153

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