TITLE: *-homomorphisms $M_m(\mathbb{C})\rightarrow M_n(\mathbb{C})$
QUESTION [9 upvotes]: I've heard that every *-homomorphism $\phi:M_m(\mathbb{C})\rightarrow M_n(\mathbb{C})$ is unitarily equivalent to some *-homomorphism of the form
$A\in M_m(\mathbb{C})\mapsto\left(\oplus_{k}A\right)\oplus0_{n-km}\in M_n(\mathbb{C})$ for some $k$, that is, the matrix $A$ is copied $k$ times in the diagonal as below:
$$A\in M_m(\mathbb{C})\mapsto\left[\begin{array}{}
A\\
&\ddots\\
&&A\\
&&&0_{n-km}
\end{array}\right]\in M_n(\mathbb{C})$$
Do someone have a (maybe not so) simple proof of this fact?

REPLY [3 votes]: Let $\{e_{ij}\}$ be the matrix units in $M_m(\mathbb C)$. 
First note that if $\phi$ is nonzero, then $\phi(e_{ij})\ne0$ for all $i,j$. This follows from the fact that $M_m(\mathbb C)$ is simple; but to see more explicitly that it is the case, consider for example that $\phi(e_{12})=0$. Then 
$$
\phi(e_{11})=\phi(e_{12}e_{21})=\phi(e_{12})\phi(e_{21})=0.
$$
Then $\phi(e_{1j})=\phi(e_{11}e_{1j})=\phi(e_{11})\phi(e_{1j})=0$ for any $j$. And then
$$
\phi(e_{ij})=\phi(e_{i1}e_{1j})=\phi(e_{i1})\phi(e_{1j})=0.
$$
So all matrix units would map to zero, and so $\phi$ would be zero. 
This can be done for any other choice than 1,2 with minimal notation changes.
So $\phi(e_{11}),\ldots,\phi(e_{mm})$ are pairwise orthogonal projections with equal trace. Indeed,
$$
\mbox{tr}(\phi(e_{11})=\mbox{tr}(\phi(e_{1j}e_{j1})=\mbox{tr}(\phi(e_{1j})\phi(e_{j1})=\mbox{tr}(\phi(e_{j1})\phi(e_{1j}))=\mbox{tr}(\phi(e_{j1}e_{1j}))=\mbox{tr}(\phi(e_{jj}).
$$ Let $k$ denote this trace (this is the "multiplicity"). Note that the argument above shows that no homomorphism exists if $m>n$.
Now construct matrix units (i.e. choose an appropriate orthonormal basis) $\{f_{gh}\}$ for $M_n(\mathbb C)$ such that
$$
\phi(e_{jj})=\sum_{l=1}^kf_{k(j-1)+l,k(j-1)+l},\ \ \ \ j=1,\ldots,m
$$
If we now reorder the basis (which in terms of matrices means conjugating by a unitary) according to the permutation
$$
1,2,3,\ldots,n\mapsto 1,k+1,\ldots,k(m-1)+1, 2,k+2,\ldots,k(m-1)+2,\ldots,\ldots,k,k+k,\ldots,k(m-1)+k
$$
we get the desired representation (what is happening with the reordering is that each projection $\phi(e_{jj})$ contains $k$ copies of each matrix unit; then we take all the "first" matrix unit in each $\phi(e_{jj})$ to get the first copy of $A$; then the second, etc.).