Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Mednykh's formula for closed orientable surfaces

Proved
FrobMednykh.mednykh

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​​. Γg\Gamma_gΓg​ (SurfaceGroup g) is the presented group ⟨a1,b1,…,ag,bg∣[a1,b1]⋯[ag,bg]⟩\langle a_1,b_1,\dots,a_g,b_g\mid [a_1,b_1]\cdots[a_g,b_g]\rangle⟨a1​,b1​,…,ag​,bg​∣[a1​,b1​]⋯[ag​,bg​]⟩, the standard presentation of π1\pi_1π1​ of the closed orientable genus-ggg surface. For every g≥0g\ge0g≥0: ∑idi 2−2g=∣G∣ 1−2g #Hom(Γg,G)\sum_i d_i^{\,2-2g}=|G|^{\,1-2g}\,\#\mathrm{Hom}(\Gamma_g,G)∑i​di2−2g​=∣G∣1−2g#Hom(Γg​,G), i.e. ∑V∈G^d(V)χ(Σg)=∣G∣χ(Σg)−1#Hom(π1Σg,G)\sum_{V\in\hat G}d(V)^{\chi(\Sigma_g)}=|G|^{\chi(\Sigma_g)-1}\#\mathrm{Hom}(\pi_1\Sigma_g,G)∑V∈G^​d(V)χ(Σg​)=∣G∣χ(Σg​)−1#Hom(π1​Σg​,G).

Preamble
import Definitions.Def_FrobMednykh_defs

open CategoryTheory
Formal statement
namespace FrobMednykh

theorem mednykh {G ι : Type} [Group G] [Fintype G] [Fintype ι]
    (B : IrrepFamily G ι) (g : ℕ) :
    ∑ i, (B.dim i : ℂ) ^ (2 - 2 * (g : ℤ)) =
      (Fintype.card G : ℂ) ^ (1 - 2 * (g : ℤ)) * Nat.card (SurfaceGroup g →* G) := 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, Theorem 1.1, eq. (1.1); N. Snyder, Mednykh's formula via lattice topological quantum field theories, arXiv:math/0703073 (2007), https://arxiv.org/abs/math/0703073, eq. (1); A. D. Mednykh, Dokl. Akad. Nauk SSSR 239 (1978)
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​. For every g∈Ng\in\mathbb Ng∈N, in C\mathbb CC,

∑i∈ιdi 2−2g=∣G∣ 1−2g⋅#Hom(πg,G),\sum_{i\in\iota}d_i^{\,2-2g}=|G|^{\,1-2g}\cdot\#\mathrm{Hom}(\pi_g,G),i∈ι∑​di2−2g​=∣G∣1−2g⋅#Hom(πg​,G),

where πg=⟨aj,bj (j<g)∣∏j[aj,bj]⟩\pi_g=\langle a_j,b_j\ (j<g)\mid \prod_{j}[a_j,b_j]\rangleπg​=⟨aj​,bj​ (j<g)∣∏j​[aj​,bj​]⟩ and #Hom(πg,G)\#\mathrm{Hom}(\pi_g,G)#Hom(πg​,G) is the number of group homomorphisms πg→G\pi_g\to Gπg​→G (a natural number, cast to C\mathbb CC). Exponents are integer powers in C\mathbb CC.

Assessment:

  • (a) True, this is Mednykh's formula, equivalent to #Hom(πg,G)=∣G∣2g−1∑idi2−2g\#\mathrm{Hom}(\pi_g,G)=|G|^{2g-1}\sum_i d_i^{2-2g}#Hom(πg​,G)=∣G∣2g−1∑i​di2−2g​. It follows from card_hom_surfaceGroup and commCount_eq at z=1z=1z=1.
  • (b) g=0g=0g=0: ∑idi2=∣G∣\sum_i d_i^2=|G|∑i​di2​=∣G∣, true. g=1g=1g=1: k=∣G∣−1⋅#{commuting pairs}k=|G|^{-1}\cdot\#\{\text{commuting pairs}\}k=∣G∣−1⋅#{commuting pairs}, true. Trivial group: both sides are 111. No division by zero (di≥1d_i\ge1di​≥1, ∣G∣≥1|G|\ge1∣G∣≥1).
  • (c) Nothing objectionable.
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