<?xml version="1.0" encoding="UTF-8"?>

<record version="7" id="1040">
 <title>symmetric group</title>
 <name>SymmetricGroup</name>
 <created>2001-11-25 15:52:49</created>
 <modified>2004-12-12 17:01:32</modified>
 <type>Definition</type>
 <creator id="988" name="bwebste"/>
 <author id="988" name="bwebste"/>
 <author id="11" name="antizeus"/>
 <classification>
	<category scheme="msc" code="20B30"/>
 </classification>
 <related>
	<object name="Group"/>
	<object name="Cycle2"/>
	<object name="CayleyGraphOfS_3"/>
	<object name="Symmetry2"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}</preamble>
 <content>Let $X$ be a set.  
Let ${\rm Sym}(X)$ be the set of permutations of $X$ 
(i.e. the set of bijective functions from $X$ to itself).  
Then the act of taking the composition of two permutations 
induces a group structure on ${\rm Sym}(X)$.  
We call this group the {\it symmetric group}.

The group ${\rm Sym}(\{1,2,\ldots, n\})$ is often denoted $S_n$ or $\mathfrak{S}_n$.

$S_n$ is generated by the transpositions $\{(1,2),(2,3),\ldots,(n-1,n)\}$,
and by any pair of a 2-cycle and $n$-cycle.

$S_n$ is the Weyl group of the $A_{n-1}$ root system (and hence of the special linear group $SL_{n-1}$).</content>
</record>
