Structure of the full symmetric group on a countably infinite set Trying to get a handle on the full symmetric group $S$ of permutations on a countable set $X$. I had never really thought much about this group, but now I look at it for the first time it appears a more complex idea than I had naively assumed. I will confine my expression of puzzlement to one fairly straightforward question, but any further input on this group would be much appreciated.
For any element $g \in S$ we have a disjoint decomposition:
$$
X= \sigma_g \cup \tau_g
$$
with
$$
\sigma_g \cap \tau_g = \emptyset
$$
where $\sigma_g$ is the set of points fixed by $g$ 
If $S_* = \{g \in S \mid \text{card}(\tau_g) \lt \aleph_0 \} $ then it seems that $S_*$ must be a normal subgroup of $S$.
(I have just noticed a comment by  @ArturoMagidin which makes me more confident to make this claim. However the discussion in that location does not single out countably infinite groups in particular, and is heavily dependent on some literature references that are quite obscure. I would just like a simple, commonsense explanation, if that is feasible.)
Can anyone help me improve my rather hazy conception of the factor group ${S}/{S_*}$ and its relation to $S^* =\{g \in S \mid \text{card}(\sigma_g) \lt \aleph_0 \} $?

Check out this paper by Alperin/Covington/Macpherson and references there in (seems to be free from citeseer). They analyze the automorophism group of your mystery quotient, which should tell you a fair bit about the structure.
