Permutation matrix: Difference between revisions
(Created page with "==Definition== The '''permutation matrix''' of a permutation <math>\sigma \in S_n</math> is the <math>n \times n</math> matrix <math>A</math> such that <math>A_{ij} = 1</...") |
No edit summary |
||
| Line 10: | Line 10: | ||
0 & 0 & 1 | 0 & 0 & 1 | ||
\end{pmatrix}</math>. | \end{pmatrix}</math>. | ||
==The standard representation of the symmetric group== | |||
{{further|[[standard representation of the symmetric group]]}} | |||
The [[standard representation of the symmetric group]] is the [[linear representation]] sending each element of the symmetric group to its corresponding permutation matrix. | |||
Latest revision as of 15:39, 4 November 2023
Definition
The permutation matrix of a permutation is the matrix such that for , elsewhere. (Here, is the symmetric group on letters.)
Example
The permuation has permutation matrix .
The standard representation of the symmetric group
Further information: standard representation of the symmetric group
The standard representation of the symmetric group is the linear representation sending each element of the symmetric group to its corresponding permutation matrix.