Frobenius' commutator count (genus one)
ProvedFrobMednykh.commCount_onecharacter-theoryfinite-groupsrepresentation-theorysurface-groupstqft
is a finite group; representations are finite-dimensional over (FDRep ℂ G), is the character and . An IrrepFamily G ι is a family of irreducible representations, pairwise non-isomorphic, such that every irreducible representation is isomorphic to some ; , . (commCount G g z) is the number of with , where . For every : .
Preamble
import Definitions.Def_FrobMednykh_defs open CategoryTheory
Formal statement
namespace FrobMednykh
theorem commCount_one {G ι : Type} [Group G] [Fintype G] [Fintype ι]
(B : IrrepFamily G ι) (z : G) :
(commCount G 1 z : ℂ) = Fintype.card G * ∑ i, (B.V i).character z / B.dim i := by sorry
end FrobMednykhSource
M. Mulase, J. T. Yu, A generating function of the number of homomorphisms from a surface group into a finite group, arXiv:math/0209008 (2002), https://arxiv.org/abs/math/0209008, §4, the formula for f_1 used in the proof of Thm. 4.1 (cited there to Stanley); G. Frobenius, Über Gruppencharaktere (1896)
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. Let be a finite group and an IrrepFamily with finite, , characters . For every , the number of pairs with , viewed in , equals
Assessment:
- (a) True. It is the case of the Frobenius formula. At it gives , the number of commuting pairs, with the number of irreducibles.
- (b) No division by zero (). Trivial group: and the right side is .
commCount G 1 zcounts -tuples of pairs. - (c) Nothing objectionable. It is a special case of
commCount_eq(redundant but a legitimate separate milestone).
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.