Commutator counts convolve: f_{g₁+g₂} = f_{g₁} ⋆ f_{g₂}
ProvedFrobMednykh.commCount_addcharacter-theoryfinite-groupsrepresentation-theorysurface-groupstqft
(commCount G g z) is the number of with , where . For finite , all and : .
Preamble
import Definitions.Def_FrobMednykh_defs open CategoryTheory
Formal statement
namespace FrobMednykh
theorem commCount_add (G : Type) [Group G] [Fintype G] (g₁ g₂ : ℕ) (w : G) :
commCount G (g₁ + g₂) w = ∑ σ : G, commCount G g₁ (w * σ⁻¹) * commCount G 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, proof of Theorem 4.1 (f_{g1+g2} = f_{g1} ⋆ f_{g2})
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Statement. Let be a finite group, and . Then, as natural numbers,
where is the number of -tuples of pairs with (left-to-right product).
Assessment:
- (a) True. The product over pairs factors as (product of the first ) times (product of the last ).
- (b) : the right side is , as it should be. : the right side is . The identity holds in , so there is no truncation issue.
- (c) Nothing objectionable. This is the identity with convolution .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.