Canonical: https://knowlpedia.com/algebra-groups/permutation-representation/

# Permutation Representation

A homomorphism from a group into bijections of a set

A **permutation representation** of a [group](https://knowlpedia.com/algebra-groups/group/) \(G\) on a set \(X\) is a [group homomorphism](https://knowlpedia.com/algebra-groups/group-homomorphism/)
\[
\rho: G \to \mathrm{Sym}(X),
\]

where \(\mathrm{Sym}(X)\) denotes the group of all [bijective](https://knowlpedia.com/shared-foundations/bijective-function/) maps \(X\to X\) under composition. Giving such a homomorphism is equivalent to giving a [group action](https://knowlpedia.com/algebra-groups/group-action/) via \(g\cdot x := \rho(g)(x)\).

## Examples

- (Left regular representation) \(\rho(g)\) is the permutation \(x\mapsto gx\) of the underlying set of \(G\).
- (Action on cosets) For \(H\le G\), the action on \(G/H\) gives a homomorphism \(G\to \mathrm{Sym}(G/H)\).
- (Conjugation) The conjugation action gives a homomorphism \(G\to \mathrm{Sym}(G)\).

## Remarks

The kernel of \(\rho\) is exactly the [kernel of the action](https://knowlpedia.com/algebra-groups/kernel-of-action/). In particular, \(\rho\) is injective iff the action is [faithful](https://knowlpedia.com/algebra-groups/faithful-action/), and [Cayley's theorem](https://knowlpedia.com/algebra-groups/cayleys-theorem/) says every group has a faithful permutation representation (on itself by left multiplication).
