Number of genus-g commutator tuples with prescribed product
ProvedFrobMednykh.commCount_eqcharacter-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 all and : (integer powers in ).
Preamble
import Definitions.Def_FrobMednykh_defs open CategoryTheory
Formal statement
namespace FrobMednykh
theorem commCount_eq {G ι : Type} [Group G] [Fintype G] [Fintype ι]
(B : IrrepFamily G ι) (g : ℕ) (z : G) :
(commCount G g z : ℂ) =
(Fintype.card G : ℂ) ^ (2 * (g : ℤ) - 1) *
∑ i, (B.V i).character z * (B.dim i : ℂ) ^ (1 - 2 * (g : ℤ)) := 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 Theorem 4.1, eq. (4.4) (stated for g ≥ 1; g = 0 included here)
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 and , in ,
where is the number of -tuples of pairs with ordered product of commutators equal to . Exponents are integer powers in (the exponent equals when ).
Assessment:
- (a) True, this is Frobenius' formula.
- (b) : the right side is by
sum_dim_mul_character, and . Consistent. Since and , no zero base is raised to a negative power. Trivial group: both sides are . - (c) Nothing objectionable. Integer powers are used correctly, with the cast to before the subtraction, so there is no natural-number truncation.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.