I came across the following strategy that is supposed to help finding subgroups of $S_n$ (the symmetric group of degree $n$.)
- Let $A$ be any subset of $S = \{1, ..., n \}$.
- Let $G$ be the subset of the symmetric group $S_n$ that consists of all permutations that map each element of $A$ to another element of $A$.
- It can be shown that $G$ is a subgroup of $S_n$.
I went through the proof that $G$ is indeed a subgroup of $S_n$, and I get the technicalities of it. However I can't really picture in my head what is actually happening.
Can someone explain more intuitively why it makes sense to use a subset of $S = \{1, ..., n \}$ as a vehicle to find subgroups of $S_n$? I worked it out on paper for $S_3$ and of course it works, but I just can't get the intuition of why this makes sense.