permutation

permutations: How many ways are there to arrange all elements of $A$?

$\pi :A\to A$, bijective permutation function
$f:x_1,x_2,\dots x_n\mapsto (x_1,\dots ,x_n),x_i=\pi (a_i)$
$f:S_A\to \{x\in A^n:\forall i\ne j:x_{i\ne x_j}\}$
$|S_A|=\#(x_1,\dots ,x_n):\forall i\ne j:x_i\ne x_j$ (exactly what we had in (ii) above)
$=n!\left(\genfrac{}{}{0ex}{}{n}{n}\right)=n!$
→ $|A!|=n!$

Link to original

Permutation notation

$M=\{1,2,3\}$

We can denote the permutation in three ways:
(1) Two rows – the first row is the original order, the second row is the new order:
$\left(\begin{array}{ccc}1& 2& 3\\ \pi (1)& \pi (2)& \pi (3)\end{array}\right)$, e.g.: $\left(\begin{array}{ccc}1& 2& 3\\ 2& 1& 3\end{array}\right)⟺1\to 2,2\to 1,3\to 3$
(2) or we just take the second row: $213$,
(3) or we take the cycle notation: $(12)(3)$, i.e. $(1\to 2\to 1)(3\to 3)$.
Each group is its own cycle – no duplicates / loops (else it wouldn’t be bijective which is a requirement for a permutation).

Permutation composition