Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

This is an exercise from the book "Groups and Representations" by Alperin & Bell. This quantity is well defined upto a sign. By column orthogonality relations, its squared norm is $\displaystyle\prod_{\substack{g}} |C_G(g)|$, where g runs over the representatives of the conjugacy classes. If the group is cyclic, the determinant is just a Vandermonde determinant.

I wonder if there is a nice explanation for an arbitrary group.

share|improve this question
Are you asking for a proof or for a reinterpretation such as the Vandermonde in the cyclic case? The former should come out a study of $A^HA$ and column orthogonality, but it sounds like you know that. – Jyrki Lahtonen Jun 9 '12 at 16:57
A nice explanation of what? – Qiaochu Yuan Jun 9 '12 at 17:01
I am just looking for a solution of the exercise. – Serkan Jun 9 '12 at 17:23

1 Answer

up vote 2 down vote accepted

Let $A$ be the character table as a square matrix. In other words $A_{ij}=\chi_i(g_j)$, where $\chi_i$ the distinct irreducible characters, and $g_j$ are representatives of conjugacy classes. Let $A^H$ be the conjugate transpose. Let us compute the matrix product $B:=A^HA$. At position $(i,j)$ we get $$ B_{ij}=\sum_k A^H_{ik}A_{kj}=\sum_k \overline{A_{ki}}A_{kj}=\sum_k\overline{\chi_k(g_i)}\chi_k(g_j)=|C_G(g_j)|\delta_{ij} $$ by the second orthogonality relation. Therefore $B$ is diagonal, and $$ \det B=\prod_j|C_G(g_j)|. $$ So by the multiplicativity of determinant we also have $$ \det(A^H)\det(A)=\det B=\prod_j|C_G(g_j)|. $$ Let us study the relation of $A^H$ and the transpose $A^T$. Let us define a permutation $s$ of the conjugacy classes by the mapping $[g]\mapsto [g^{-1}]$. It is obvious a product of disjoint 2-cycles, and its fixed points are exactly the conjugcay classes stable under taking the inverse element. Let us denote by $\ell$ the number of orbits of size two. If we denote by $\tilde{A}$ the matrix that we get from $A$ by permuting the columns according to $s$, then the general fact $\chi(g^{-1})=\overline{\chi(g)}$ allows us to identify $A^H$ as $\tilde{A}^T$. Clearly $$ \det\tilde{A}=(-1)^{\ell}\det A,$$ so we get the equation $$ (-1)^{\ell}(\det A)^2=\det B=\prod_j|C_G(g_j)|. $$ The sign of $\det A$ will always remain ambiguous, because we have no natural ordering neither for the conjugacy classes nor for the characters, so all we can say is that $$ \det A=\pm i^{\ell}\sqrt{\prod_j|C_G(g_j)|}. $$

share|improve this answer
Thank you for the answer but the exercise asks $det(A)$ as I wrote in the title of the question. In the text I summarized what I obtained so far. I am sorry if what I wrote misled you. – Serkan Jun 9 '12 at 18:41
@Serkan, ok. I would have been surprised, if you had not figure out this much:-). Thinking... – Jyrki Lahtonen Jun 9 '12 at 18:43
@Serkan, I think I solved it. – Jyrki Lahtonen Jun 9 '12 at 19:07
I think this is a really nice solution, thank you :) – Serkan Jun 9 '12 at 21:36

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.