Let n be a natural number, let [n] be the initial segment determined by n, that is, the set {1,…,n}, and let Sn be the set of permutations of [n], that is, the set of bijections from [n] to [n]. For maps σ,τ:[n]→[n] let σ∘τ be the map with (σ∘τ)(k)=σ(τ(k)), and let id be the map with id(k)=k.
Then the following hold.
1. (Identity) id∈Sn, and σ∘id=id∘σ=σ for every σ∈Sn.
2. (Composition) If σ,τ∈Sn then σ∘τ∈Sn; and (ρ∘σ)∘τ=ρ∘(σ∘τ) for all ρ,σ,τ∈Sn.
3. (Inverses) For every σ∈Sn there is exactly one map σ−1:[n]→[n] with σ−1∘σ=σ∘σ−1=id; it belongs to Sn, and (σ−1)−1=σ.
4. (Translation and inversion) Let τ∈Sn. The map Rτ:Sn→Sn with Rτ(σ)=σ∘τ is a bijection from Sn onto Sn, and so is the map σ↦σ−1.