Let SX denote the group of
permutations of the set X. If ℵα is an infinite cardinal, the set of permutations
having support with cardinality less than or equal to ℵα is a normal subgroup of SX.
The principal result of this paper is a constructive proof that SX is generated by its
cycles, if X is countably infinite. Of particular interest is the corollary that for any
set X, the cycles of SX generate the subgroup of permutations with countable
support.