Canonical: https://knowlpedia.com/shared-foundations/finite-permutation/

# Finite permutation

A bijection from a finite initial segment of the natural numbers to itself.

For \(n\in\mathbb N\), write \([n]=\{1,\ldots,n\}\) (with \([0]=\varnothing\)). A **finite permutation of size \(n\)** is a [bijective function](https://knowlpedia.com/shared-foundations/bijective-function/) \(\sigma:[n]\to[n]\). The set of all such permutations is denoted \(S_n\).

## Notation

In one-line notation, \(\sigma\) is recorded as \((\sigma(1),\ldots,\sigma(n))\), which contains each element of \([n]\) exactly once.

## Reference

[Konarovskyi, Mathematics 2, §6.1](https://www.math.uni-leipzig.de/~konarovskyi/teaching/2019/Math2/pdf/notes/notes.pdf).
