Sign up ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Let $U(n)$ be the group of unitary $n\times n$ matrices over $\mathbb{C}$. Is there a classification of the continuous, injective group homomorphisms $U(m)\to U(n)$? If so, is there a modern account of the proof?

share|cite|improve this question
You are looking at (faithful) finite dimensional rep. of a compact Lie groups, they are well studied. I guess this material is covered at Knapp's book or Fulton-Harris. (I happen to have Weyl's book in front of me here, but it is more physics-oriented). I suggest to close the topic as this is not a research level question. – Asaf Dec 16 '12 at 18:15
This is asking about direct sums of irreducible unitary repns of $U(m)$ with total dimension at most $n$. The classification of irreducibles (they are all unitary) of $U(m)$ is by highest weights, and is well-known, well-studied, and visible in many textbooks. The question of the dimensions of the irreducibles for $U(m)$ with $m\ge 3$ is more complicated than the highest-weight classification, but Kostant's weight multiplicity formula tells the dimensions of the weight spaces, giving finer information. – paul garrett Dec 16 '12 at 18:31
One can find a table of dimensions of certain irreducible representations of $U(m)$ (or, which is the same, of ${\rm SL}(m)$)and also the classification by highest weights, in the book by Onishchik and Vinberg "Lie Groups and Algebraic Groups" – Mikhail Borovoi Dec 16 '12 at 18:59
Thanks to all for your help! – Paul McKenney Dec 16 '12 at 21:00
A couple of comments: continuous homomorphisms between compact Lie groups are analytic, so may be studied via representation theory as others have indicated. Secondly, the kernel of a non-abelian representation of $U(m), m>1$ will be a subroup of $Z(U(m))\cong U(1)$. Thus, sorting through the faithful representation might be a bit involved, but should reduce to some combinatorics. – Ian Agol Dec 16 '12 at 23:15

Your Answer


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

Browse other questions tagged or ask your own question.