Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree-square sum of a Frobenius induced family: [G:H]∑i≠1θi(1)2=∣H∣−1[G:H]\sum_{i\ne1}\theta_i(1)^2=|H|-1[G:H]∑i=1​θi​(1)2=∣H∣−1

Proved
OddOrder.RepresentationTheory.card_index_mul_sum_induced_family_degree_sq

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

feit-thompsonfinite-groupsgroup-theoryishida-odd-order

Let GGG be a finite group which is a Frobenius group with kernel HHH and complement CCC (Ch06.IsFrobeniusGroup G H C; in particular H⊴GH\trianglelefteq GH⊴G), with the cardinalities of GGG and HHH invertible in C\mathbb{C}C. Let n∈Nn\in\mathbb{N}n∈N and let θ:Fin(n+1)→Irr(H)\theta:\mathrm{Fin}(n+1)\to\mathrm{Irr}(H)θ:Fin(n+1)→Irr(H) be an enumeration of irreducible characters of HHH, with a distinguished index i1i_1i1​ such that θi1\theta_{i_1}θi1​​ is the trivial character. Suppose that

  • the induced characters IndHGθi\mathrm{Ind}_H^G\theta_iIndHG​θi​ are pairwise distinct (the map i↦IndHGθii\mapsto\mathrm{Ind}_H^G\theta_ii↦IndHG​θi​ is injective), and
  • every IndHGφ\mathrm{Ind}_H^G\varphiIndHG​φ, for φ∈Irr(H)\varphi\in\mathrm{Irr}(H)φ∈Irr(H), is of the form IndHGθi\mathrm{Ind}_H^G\theta_iIndHG​θi​ for some iii.

Then, in C\mathbb{C}C,

[G:H]∑i≠i1θi(1)2=∣H∣−1.[G:H]\sum_{i\ne i_1}\theta_i(1)^2=|H|-1.[G:H]i=i1​∑​θi​(1)2=∣H∣−1.

This is Peterfalvi's ∑ai2=(h−1)/e\sum a_i^2=(h-1)/e∑ai2​=(h−1)/e, multiplied out: the Frobenius structure forces every fibre of θ↦Ind θ\theta\mapsto\mathrm{Ind}\,\thetaθ↦Indθ over the nontrivial irreducible characters to have size e=[G:H]e=[G:H]e=[G:H] with constant degree, so the Burnside sum ∑φ≠1φ(1)2=∣H∣−1\sum_{\varphi\ne1}\varphi(1)^2=|H|-1∑φ=1​φ(1)2=∣H∣−1 collapses.

Formalization Note Characters are IrreducibleCharacter ↥H, regarded as class functions ClassFunction ↥H ℂ; induction is induce H; Fintype G, Fintype ↥H and the Invertible cardinality instances are part of the hypotheses.

Preamble
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_InducedIrreducible
import Definitions.Def_OddOrder_GroupTheory_RepresentationTheory_ColumnOrthogonality
Formal statement
set_option linter.unusedFintypeInType false

namespace OddOrder.RepresentationTheory

open ClassFunction

variable {G : Type*} [Group G] {H : Subgroup G} [hH : H.Normal]

variable [Fintype G] [Fintype ↥H]

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

section Frobenius

variable {C : Subgroup G}

theorem card_index_mul_sum_induced_family_degree_sq
    (hF : OddOrder.Isaacs.Ch06.IsFrobeniusGroup G H C)
    {n : ℕ} (θ : Fin (n + 1) → IrreducibleCharacter ↥H) (ind1H : Fin (n + 1))
    (htriv : θ ind1H = trivialIrreducibleCharacter ↥H)
    (hinj : Function.Injective
      (fun i => induce H (θ i : ClassFunction ↥H ℂ)))
    (hcover : ∀ φ : IrreducibleCharacter ↥H,
      induce H (φ : ClassFunction ↥H ℂ) ∈
        Set.range (fun i => induce H (θ i : ClassFunction ↥H ℂ))) :
    (H.index : ℂ) * ∑ i ∈ Finset.univ.erase ind1H,
        ((θ i : ClassFunction ↥H ℂ) 1) ^ 2
      = (Nat.card ↥H : ℂ) - 1 := by sorry

end Frobenius

end OddOrder.RepresentationTheory
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/GroupTheory/RepresentationTheory/InducedDegreeSum.lean#L180-L295

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