Degree-square sum of a Frobenius induced family:
ProvedOddOrder.RepresentationTheory.card_index_mul_sum_induced_family_degree_sqfeit-thompsonfinite-groupsgroup-theoryishida-odd-order
Let be a finite group which is a Frobenius group with kernel and complement (Ch06.IsFrobeniusGroup G H C; in particular ), with the cardinalities of and invertible in . Let and let be an enumeration of irreducible characters of , with a distinguished index such that is the trivial character. Suppose that
- the induced characters are pairwise distinct (the map is injective), and
- every , for , is of the form for some .
Then, in ,
This is Peterfalvi's , multiplied out: the Frobenius structure forces every fibre of over the nontrivial irreducible characters to have size with constant degree, so the Burnside sum 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.RepresentationTheorySource
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