Definition:Odd Permutation

From ProofWiki
Jump to navigation Jump to search

Definition

Let $n \in \N$ be a natural number.

Let $S_n$ denote the symmetric group on $n$ letters.

Let $\rho \in S_n$ be a permutation in $S_n$.


Then $\rho$ is an odd permutation if and only if:

$\map \sgn \rho = -1$

where $\sgn $ denotes the sign function.


Also see


Sources