This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
definition:symmetric_group [2013/08/20 09:23] bmwoodruff [External links] |
definition:symmetric_group [2013/08/22 16:47] (current) bmwoodruff |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== Symmetric Group ====== | ====== Symmetric Group ====== | ||
====Definition==== | ====Definition==== | ||
- | Let $X$ be any set. The $\textdef{symmetric group}$ on $X$, denoted $\sym(X)$, | + | Let $X$ be any set. The $\textdef{symmetric group}$ on $X$, denoted $\sym(X)$, is the set of all [[permutation]]s of $X$. We denote by $S_n$ the symmetric group on $X = \{1, |
Line 14: | Line 14: | ||
%%%%% | %%%%% | ||
% DEPENDENCIES | % DEPENDENCIES | ||
- | % RequiredMacros: | + | % RequiredMacros: |
%%%%% | %%%%% | ||
\begin{definition} | \begin{definition} | ||
- | Let $X$ be any set. The \textdef{symmetric group} on $X$, denoted $\sym(X)$, is the set of all permutations of $X$; that is, $\sym(X)$ is the set of all bijections from $X$ to $X$. We denote by $S_n$ the symmetric group on $X = \{1, | + | Let $X$ be any set. The \textdef{symmetric group} on $X$, denoted $\sym(X)$, is the set of all permutations of $X$. We denote by $S_n$ the symmetric group on $X = \{1, |
\end{definition} | \end{definition} | ||
</ | </ | ||
Line 26: | Line 26: | ||
- | {{tag> | + | {{tag> |