Rationality conjecture for the branching generating function of finite subgroups of SLnC\mathbf{SL}_n\mathbb{C}

About 23 years old · traced to

Let n≥2n\geq 2 and let Γ\Gamma be a subgroup of SLnC\mathbf{SL}_n\mathbb{C}. Let {γ0,…,γl}\{\gamma_0,\ldots,\gamma_l\} be the equivalence classes of irreducible finite-dimensional complex representations of Γ\Gamma, with γ0\gamma_0 trivial. For the irreducible slnC\mathfrak{sl}_n\mathbb{C}-module of highest weight p1ϖ1+⋯+pn−1ϖn−1p_1\varpi_1+\cdots+p_{n-1}\varpi_{n-1}, write its restriction to Γ\Gamma as

πp∣Γ=⨁i=0lmi(p)γi,\left.\pi_{\mathbf p}\right|_{\Gamma}=\bigoplus_{i=0}^l m_i(\mathbf p)\gamma_i,

where p=(p1,…,pn−1)∈Nn−1\mathbf p=(p_1,\ldots,p_{n-1})\in\mathbb N^{n-1}. Set tp=t1p1⋯tn−1pn−1\mathbf t^{\mathbf p}=t_1^{p_1}\cdots t_{n-1}^{p_{n-1}}, let E=(e0,…,el)\mathcal E=(e_0,\ldots,e_l) be the canonical basis of Cl+1\mathbb C^{l+1}, and define

vp:=∑i=0lmi(p)ei,PΓ(t):=∑p∈Nn−1vptp.v_{\mathbf p}:=\sum_{i=0}^l m_i(\mathbf p)e_i,\qquad P_\Gamma(\mathbf t):=\sum_{\mathbf p\in\mathbb N^{n-1}}v_{\mathbf p}\mathbf t^{\mathbf p}.

Write PΓ(t)iP_\Gamma(\mathbf t)_i for the ii-th coordinate. Rationality conjecture. The coefficients of the vector PΓ(t)P_\Gamma(\mathbf t) are rational functions in t\mathbf t: for every i∈{0,…,l}i\in\{0,\ldots,l\}, there are polynomials NΓ(t)i,DΓ(t)∈Q[t]N_\Gamma(\mathbf t)_i,D_\Gamma(\mathbf t)\in\mathbb Q[\mathbf t] such that

PΓ(t)i=NΓ(t)iDΓ(t).P_\Gamma(\mathbf t)_i=\frac{N_\Gamma(\mathbf t)_i}{D_\Gamma(\mathbf t)}.

This conjecture generalizes the known results of Kostant for SL2C\mathbf{SL}_2\mathbb C and the authors' results for SL3C\mathbf{SL}_3\mathbb C; it asserts rationality of the multivariable branching generating functions for the restrictions of irreducible representations to Γ\Gamma.

References

Primary source

Frédéric Butin, “Branching Law for the Finite Subgroups of SL(4,C)”, arXiv:1307.2557 (2013).

Additional references

2 papers in this index state this conjecture (2003–2013). The statement above is taken from the most recent of them; the others are arXiv:math/0309440.

Progress summary

Refreshed
Open

A reader-submitted argument claims to prove the conjecture for finite groups, but no independent verification or published resolution was found.

The conjecture asserts rationality of all multivariable branching generating functions for restrictions of irreducible representations of finite subgroups of SLn(C)\mathbf{SL}_n(\mathbb{C}). The catalogued literature records the cases of SL2(C)\mathbf{SL}_2(\mathbb{C}) and SL3(C)\mathbf{SL}_3(\mathbb{C}), but no general resolution.

Known results

  • Kostant established the SL2(C)\mathbf{SL}_2(\mathbb{C}) case.
  • The authors of the later catalogued paper established the SL3(C)\mathbf{SL}_3(\mathbb{C}) case.

Community submission (unverified), September 5, 2026

A submitted proof argues that, for finite Γ\Gamma with exponent ee, every branching series has a common denominator ∏j=1n−1(1−tje)(nj)\prod_{j=1}^{n-1}(1-t_j^e)^{\binom{n}{j}}. It uses Schur-polynomial character generation, alternation, and evaluation on finite-group eigenvalues; the argument is unverified.

Current status (as of September 2026): The SL2(C)\mathbf{SL}_2(\mathbb{C}) and SL3(C)\mathbf{SL}_3(\mathbb{C}) cases are recorded, while the general conjecture remains open on the retrieved evidence and the September 5, 2026 submission is unverified.

Sources

Solutions 1

ProofAn AI-assisted derivation of Butin’s rationality conjecture from classical character-generating-function theory, with an explicit common integer denominator.See full solutionHide full solution

Conjecture 7 follows from the classical character-generating-function method of Patera and Sharp, reviewed by N. Okeke and M. A. Walton, On character generators for simple Lie algebras (2007), §2, equations (11)–(12) and (22). Here is a self-contained specialization to finite subgroups, including the case of repeated eigenvalues.

Let Γ⊂SLn(C)\Gamma\subset SL_n(\mathbb C) be finite and let ee be its exponent. Write χi\chi_i for an irreducible character of Γ\Gamma. We prove that the denominator

Q(t)=∏j=1n−1(1−tje)(nj)Q(t)=\prod_{j=1}^{n-1}(1-t_j^e)^{\binom nj}

works simultaneously for all the branching series Pi(t)P_i(t), with integer polynomial numerators.

For independent variables z1,…,znz_1,\ldots,z_n, put

D(z,t)=∏j=1n−1∏S⊆{1,…,n}∣S∣=j(1−tj∏a∈Sza).D(z,t)=\prod_{j=1}^{n-1}\prod_{\substack{S\subseteq\{1,\ldots,n\}\\|S|=j}} \left(1-t_j\prod_{a\in S}z_a\right).

For p∈N0n−1p\in\mathbb N_0^{n-1}, set λb(p)=∑j=bn−1pj\lambda_b(p)=\sum_{j=b}^{n-1}p_j for b<nb<n, and λn(p)=0\lambda_n(p)=0. The character of the SLnSL_n-representation of highest weight ∑jpjωj\sum_jp_j\omega_j is the Schur polynomial sλ(p)(z)s_{\lambda(p)}(z) on determinant-one diagonal matrices.

Let Δ(z)=det⁡(zan−b)a,b=1n=∏a<b(za−zb)\Delta(z)=\det(z_a^{n-b})_{a,b=1}^n=\prod_{a<b}(z_a-z_b). Expanding the bialternant formula and summing the geometric series in the pjp_j gives

F(z,t):=∑psλ(p)(z)tp=1Δ(z)∑σ∈Snsgn⁡(σ)∏b=1nzσ(b)n−b∏j=1n−1(1−tj∏b=1jzσ(b)).F(z,t):=\sum_p s_{\lambda(p)}(z)t^p =\frac1{\Delta(z)}\sum_{\sigma\in S_n}\operatorname{sgn}(\sigma) \frac{\prod_{b=1}^n z_{\sigma(b)}^{n-b}} {\prod_{j=1}^{n-1}\left(1-t_j\prod_{b=1}^jz_{\sigma(b)}\right)}.

Every denominator in this finite sum divides DD, so multiplying its alternating numerator sum by DD gives a polynomial B∈Z[z,t]B\in\mathbb Z[z,t]. Since DD is symmetric in zz, BB is alternating. Consequently every za−zbz_a-z_b divides BB; these are distinct prime factors in Z[z,t]\mathbb Z[z,t], so their product Δ\Delta divides BB. Hence A:=B/ΔA:=B/\Delta is an integer polynomial and

F(z,t)=A(z,t)D(z,t).F(z,t)=\frac{A(z,t)}{D(z,t)}.

Because D(z,0)=1D(z,0)=1, this is an identity in Z[z][[t]]\mathbb Z[z][[t]]. It can therefore be evaluated at any complex zz, including coincident eigenvalues.

For g∈Γg\in\Gamma, let z1,…,znz_1,\ldots,z_n be its eigenvalues. The matrix gg is diagonalizable and zae=1z_a^e=1 for every aa. For each jj, every factor of D(z,t)D(z,t) is 1−ζtj1-\zeta t_j for an ee-th root of unity ζ\zeta, and there are (nj)\binom nj factors counting multiplicity. Since 1−tje=∏ζe=1(1−ζtj)1-t_j^e=\prod_{\zeta^e=1}(1-\zeta t_j), the specialized D(z,t)D(z,t) divides Q(t)Q(t) in C[t]\mathbb C[t]. Therefore Q(t)Fg(t)Q(t)F_g(t) is a polynomial, where

Fg(t)=∑pχλ(p)(g)tp.F_g(t)=\sum_p\chi_{\lambda(p)}(g)t^p.

Finite-group character orthogonality now yields

Pi(t)=1∣Γ∣∑g∈Γχi(g)‾Fg(t).P_i(t)=\frac1{|\Gamma|}\sum_{g\in\Gamma}\overline{\chi_i(g)}F_g(t).

It follows that Q(t)Pi(t)∈C[t]Q(t)P_i(t)\in\mathbb C[t]. But Pi(t)P_i(t) has integer coefficients and Q(t)∈Z[t]Q(t)\in\mathbb Z[t], so this polynomial actually lies in Z[t]\mathbb Z[t]. Thus Pi=Ni/QP_i=N_i/Q with Ni,Q∈Z[t]N_i,Q\in\mathbb Z[t], proving Butin's Conjecture 7, §3.3. □\square

Developed with OpenAI Codex and reviewed by Claude Opus 5.