TheoremBase

Permutations of an Initial Segment Form a Group under Composition

Statement

Let nn be a natural number, let [n][n] be the initial segment determined by nn, that is, the set {1,…,n}\{1,\dots,n\}, and let SnS_{n} be the set of permutations of [n][n], that is, the set of bijections from [n][n] to [n][n]. For maps σ,τ:[n]→[n]\sigma,\tau:[n]\to[n] let σ∘τ\sigma\circ\tau be the map with (σ∘τ)(k)=σ(τ(k))(\sigma\circ\tau)(k)=\sigma(\tau(k)), and let id\mathrm{id} be the map with id(k)=k\mathrm{id}(k)=k.

Then the following hold.

1. (Identity) id∈Sn\mathrm{id}\in S_{n}, and σ∘id=id∘σ=σ\sigma\circ\mathrm{id}=\mathrm{id}\circ\sigma=\sigma for every σ∈Sn\sigma\in S_{n}.

2. (Composition) If σ,τ∈Sn\sigma,\tau\in S_{n} then σ∘τ∈Sn\sigma\circ\tau\in S_{n}; and (ρ∘σ)∘τ=ρ∘(σ∘τ)(\rho\circ\sigma)\circ\tau=\rho\circ(\sigma\circ\tau) for all ρ,σ,τ∈Sn\rho,\sigma,\tau\in S_{n}.

3. (Inverses) For every σ∈Sn\sigma\in S_{n} there is exactly one map σ−1:[n]→[n]\sigma^{-1}:[n]\to[n] with σ−1∘σ=σ∘σ−1=id\sigma^{-1}\circ\sigma=\sigma\circ\sigma^{-1}=\mathrm{id}; it belongs to SnS_{n}, and (σ−1)−1=σ(\sigma^{-1})^{-1}=\sigma.

4. (Translation and inversion) Let τ∈Sn\tau\in S_{n}. The map Rτ:Sn→SnR_{\tau}:S_{n}\to S_{n} with Rτ(σ)=σ∘τR_{\tau}(\sigma)=\sigma\circ\tau is a bijection from SnS_{n} onto SnS_{n}, and so is the map σ↦σ−1\sigma\mapsto\sigma^{-1}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…