Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Frobenius' commutator count (genus one)

Proved
FrobMednykh.commCount_one

by Alien60 · Oct 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

character-theoryfinite-groupsrepresentation-theorysurface-groupstqft

GGG is a finite group; representations are finite-dimensional over C\mathbb CC (FDRep ℂ G), χV\chi_VχV​ is the character and dV=dim⁡Vd_V=\dim VdV​=dimV. An IrrepFamily G ι is a family (Vi)i∈ι(V_i)_{i\in\iota}(Vi​)i∈ι​ of irreducible representations, pairwise non-isomorphic, such that every irreducible representation is isomorphic to some ViV_iVi​; di=dim⁡Vid_i=\dim V_idi​=dimVi​, χi=χVi\chi_i=\chi_{V_i}χi​=χVi​​. Ng(z)N_g(z)Ng​(z) (commCount G g z) is the number of ((x1,y1),…,(xg,yg))∈(G×G)g((x_1,y_1),\dots,(x_g,y_g))\in(G\times G)^g((x1​,y1​),…,(xg​,yg​))∈(G×G)g with [x1,y1]⋯[xg,yg]=z[x_1,y_1]\cdots[x_g,y_g]=z[x1​,y1​]⋯[xg​,yg​]=z, where [x,y]=xyx−1y−1[x,y]=xyx^{-1}y^{-1}[x,y]=xyx−1y−1. For every z∈Gz\in Gz∈G: N1(z)=∣G∣∑iχi(z)/diN_1(z)=|G|\sum_i\chi_i(z)/d_iN1​(z)=∣G∣∑i​χi​(z)/di​.

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 FrobMednykh
Source
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 GGG be a finite group and (Vi)i∈ι(V_i)_{i\in\iota}(Vi​)i∈ι​ an IrrepFamily with ι\iotaι finite, di=dim⁡Vid_i=\dim V_idi​=dimVi​, characters χi\chi_iχi​. For every z∈Gz\in Gz∈G, the number N1(z)N_1(z)N1​(z) of pairs (x,y)∈G2(x,y)\in G^2(x,y)∈G2 with xyx−1y−1=zxyx^{-1}y^{-1}=zxyx−1y−1=z, viewed in C\mathbb CC, equals

∣G∣∑i∈ιχi(z)di.|G|\sum_{i\in\iota}\frac{\chi_i(z)}{d_i}.∣G∣i∈ι∑​di​χi​(z)​.

Assessment:

  • (a) True. It is the case g=1g=1g=1 of the Frobenius formula. At z=1z=1z=1 it gives ∣G∣⋅k|G|\cdot k∣G∣⋅k, the number of commuting pairs, with kkk the number of irreducibles.
  • (b) No division by zero (di≥1d_i\ge1di​≥1). Trivial group: N1(1)=1N_1(1)=1N1​(1)=1 and the right side is 111. commCount G 1 z counts 111-tuples of pairs.
  • (c) Nothing objectionable. It is a special case of commCount_eq (redundant but a legitimate separate milestone).
Human review
  • Endorsed by Shuze Chen · Oct 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Alien60 · Oct 20, 2026

    Confirmed by the mission captain (proposal self-audit).

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