Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Peterfalvi (7.9)/(7.10): coherent images from distinct Frobenius families are orthogonal

Proved
OddOrder.Peterfalvi.S09.FrobeniusFamily.hypothesis79_zeta_cross_eq_zero_at

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group of odd order, and let FFF be a Frobenius family in GGG (FrobeniusFamily G k): subgroups Lj,Hj≤GL_j,H_j\le GLj​,Hj​≤G (j<kj<kj<k, k≥2k\ge 2k≥2) with Hj≤LjH_j\le L_jHj​≤Lj​, each LjL_jLj​ a Frobenius group with kernel HjH_jHj​, Lj=NG(Hj)L_j=N_G(H_j)Lj​=NG​(Hj​), Hj#H_j^\#Hj#​ a TI-subset with normalizer LjL_jLj​, and the orders ∣Hj∣|H_j|∣Hj​∣ pairwise coprime. Let i≠ji\ne ji=j be two members of the Frobenius family; each satisfies the hypotheses of the local setup (kernel HiH_iHi​, HjH_jHj​ nilpotent, Frobenius complements Ci,CjC_i,C_jCi​,Cj​ with IsFrobeniusGroup), giving canonical (7.8) data Hi,Hj\mathcal H_i,\mathcal H_jHi​,Hj​.

Let rrr be an index of the iii-th family different from ind1H, and sss an index of the jjj-th family different from ind1H. Then

⟨νi(ζr(i)), νj(ζs(j))⟩=0,\big\langle \nu_i(\zeta^{(i)}_r),\ \nu_j(\zeta^{(j)}_s)\big\rangle=0 ,⟨νi​(ζr(i)​), νj​(ζs(j)​)⟩=0,

where ζt(m)=\zeta^{(m)}_t=ζt(m)​= hyp76.zeta t and νm=\nu_m=νm​= nu of Hm\mathcal H_mHm​.

This extends the pairwise orthogonality of Peterfalvi (7.9) from the distinguished characters to all non-principal members of two different families, as needed for the (7.10) Gamma decomposition.

Formalization Note. The ambient Fintype/Invertible (Nat.card · : ℂ) instances for GGG, LiL_iLi​ and the kernel, and the normality instance for the kernel in LiL_iLi​, are explicit hypotheses; they are automatic mathematically. Oddness of ∣G∣|G|∣G∣ is the hypothesis hodd : Odd (Nat.card G).

Preamble
import Definitions.Def_OddOrder_Peterfalvi_S09_FrobeniusConjIndex
Formal statement
namespace OddOrder.Peterfalvi.S09

open OddOrder.RepresentationTheory

namespace FrobeniusFamily

variable {G : Type*} [Group G] {k : ℕ}

section CrossFamily

variable [Fintype G] [Invertible (Nat.card G : ℂ)]

variable (F : FrobeniusFamily G k) {i j : Fin k}

variable (hodd : Odd (Nat.card G))

variable [Fintype ↥(F.L i)] [Invertible (Nat.card ↥(F.L i) : ℂ)]

variable [Invertible (Nat.card ↥((F.H i).subgroupOf (F.L i)) : ℂ)]

variable [((F.H i).subgroupOf (F.L i)).Normal]

variable (hnilp_i : Group.IsNilpotent ↥((F.H i).subgroupOf (F.L i)))

variable (C_i : Subgroup ↥(F.L i))

variable (hFrob_i : OddOrder.Isaacs.Ch06.IsFrobeniusGroup
  ↥(F.L i) ((F.H i).subgroupOf (F.L i)) C_i)

variable [Fintype ↥(F.L j)] [Invertible (Nat.card ↥(F.L j) : ℂ)]

variable [Invertible (Nat.card ↥((F.H j).subgroupOf (F.L j)) : ℂ)]

variable [((F.H j).subgroupOf (F.L j)).Normal]

variable (hnilp_j : Group.IsNilpotent ↥((F.H j).subgroupOf (F.L j)))

variable (C_j : Subgroup ↥(F.L j))

variable (hFrob_j : OddOrder.Isaacs.Ch06.IsFrobeniusGroup
  ↥(F.L j) ((F.H j).subgroupOf (F.L j)) C_j)

theorem hypothesis79_zeta_cross_eq_zero_at (hij : i ≠ j)
    {r : Fin ((F.hypothesis78 i hodd hnilp_i C_i hFrob_i).hyp76.n + 1)}
    (hr : r ≠ (F.hypothesis78 i hodd hnilp_i C_i hFrob_i).ind1H)
    {s : Fin ((F.hypothesis78 j hodd hnilp_j C_j hFrob_j).hyp76.n + 1)}
    (hs : s ≠ (F.hypothesis78 j hodd hnilp_j C_j hFrob_j).ind1H) :
    ClassFunction.inner
      ((F.hypothesis78 i hodd hnilp_i C_i hFrob_i).nu
        ((F.hypothesis78 i hodd hnilp_i C_i hFrob_i).hyp76.zeta r))
      ((F.hypothesis78 j hodd hnilp_j C_j hFrob_j).nu
        ((F.hypothesis78 j hodd hnilp_j C_j hFrob_j).hyp76.zeta s)) = 0 := by sorry

end CrossFamily

end FrobeniusFamily

end OddOrder.Peterfalvi.S09
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/S09_FrobeniusFamilyOrthogonality.lean#L324-L404

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