[Math] centralizer of the symmetric group

gr.group-theory

If $H$ and $D$ are subgroups of $S_n$, the symmetric group on $n$ letter, such that $H\cong S_k$ and $D\cong S_{n-k}$, where $n>k>1$, $n>15$ and $H=C_{S_n}(D)$ and $D=C_{S_n}(H)$,
Is it true that $H=Stab_{S_n}(X)$ and $D=Stab_{S_n}(X^c)$, where $X$ is a subset of $\{1,2,\dots,n\}$ such that $|X|=n-k$?

Best Answer

Yes. One way to see this is to use the fact that the smallest degree faithful permutation representations of $S_n$ for $n \ge 6$ have degrees $n$ (natural action), $2n$ (imprimitive action on cosets of $A_{n-1}$), and $n(n-1)/2$ (action on unordered pairs). I think this was probably proved before the classification of finite simple groups, but I am not sure. A general reference for maximal subgroups of $A_n$ and $S_n$ is

Liebeck, Martin W.; Praeger, Cheryl E.; Saxl, Jan. A classification of the maximal subgroups of the finite alternating and symmetric groups. J. Algebra 111 (1987), no. 2, 365–383.

Let's assume $n \ge 11$ (although I think your result is true for $n \ge 7$) and $k \ge n-k$, so $k \ge 6$. So the only faithful permutation representations of $S_k$ of degree at most $n$ have degree $k$, or $2k$ when $n=2k$.

The imprimitive transitive representation of $S_k$ of degree $2k$ has centralizer of order 2 in $S_{2k}$ (the order of the centralizer in the symmetric group of a transitive permutation group is equal to the number of fixed points of its point-stabilizer), so that cannot arise as your subgroup $H \cong S_k$.

Hence $H$ must have an orbit of length $k$ and act naturally on that orbit. If it had two orbits of length $k$ (with $n=2k$), then its centralizer in $S_n$ would have order 2, so it has a unique such orbit. So your subgroup $D$ isomorphic to $S_{n-k}$, which centralizes $H$, must fix that orbit, and hence fix it pointwise, and so $D$ must act naturally on the remaining points. Hence $H$ fixes all remaining points, and the result follows.