I am preparing for an exam and there is an excercise which I have to solve but I got stuck. The excercise states:
Let $V=\mathbb{C}^3$ be the permutation representation of the symmetric group $S_3$. Show that any map of representations (intertwiner) $I: V \rightarrow V$ has the form: $ \begin{pmatrix} \lambda & \mu & \mu \\ \mu & \lambda & \mu \\ \mu & \mu & \lambda \end{pmatrix} $ w.r.t the standard basis of $\mathbb{C}^3$ for some $\lambda, \mu \in \mathbb{C}$
What I did: We got a representation $\rho: \rightarrow GL_n(V)$ and another representation $\sigma:G \rightarrow GL_n(V)$ and an intertwiner $I: \rho \rightarrow \sigma$ which is defined by the linear map $I: V \rightarrow V$ which has to satisfy: $[\sigma(g)](I(v))=I([\rho(g)] (v))$ for all $v \in V$.
So our linear map is defined by the condition: $[\sigma(\pi)] \begin{pmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{pmatrix} \ \vec{v} = \begin{pmatrix} a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33} \end{pmatrix} ([\rho(\pi)] (\vec{v})) \\ $
My first intention now was to simply plug in the standard basis for v and see what conditions it generates for the matrix elements.This works just fine for two concrete representations but I'm not sure how to show this for every representation i.e for every map. I'm not an expert in representation theory since I'm a physics undergraduate and only now the basics. Maybe the whole idea is wrong but I definitely need a hint here. Thanks in advance.
Fix the standard ordered basis $\{e_1,e_2,e_3\}$. A matrix $A$ intertwines with the standard permutation representation iff it is invariant under conjugation by permutation matrices. Conjugating $A$ by a permutation matrix is equivalent to rewriting it according to a different ordered basis with the same basis vectors. For example, the permutation $1\leftrightarrow 2$ yields
$$\begin{pmatrix}a&b&c\\d&e&f\\g&h&i\end{pmatrix}\longleftrightarrow \begin{pmatrix}e & d & f \\ b & a & c \\ h & g & i\end{pmatrix}$$
(the $1$st/$2$nd rows and columns were switched). Stare at a $3\times3$ array long enough to convince yourself that any two off-diagonal entries can be swapped, and any two diagonal entries can be swapped, but no diagonal entry may be swapped with a off-diagonal entry. (Prove this rigorously with transpositions if need be.) Thus all off-diagonals and diagonal entries respectively are equal.