5
$\begingroup$

Okay, one last question this semester--pretty stressed out, and can't really figure it out.

We need to show that if $G$ is a doubly transitive subgroup of $S_n$ (that is, for $(x,y)$ distinct, $(u,v)$ distinct, there is some $g$ such that $g(x) = u$ and $g(y) = v$) and if $G$ contains a 3-cycle, then $G = A_n$ or $G = S_n$.

Really I'm just looking for hints in the right direction. Right now I have the intuition that I can pick any two elements and map them anywhere by the doubly-transitive property. And I think we can use that to produce all the 3-cycles, given that the group contains a 3-cycle. And that means we have at least $A_n$. This seems to be a bit of an ad-hoc way of doing it.

  • 3
    Nothing inherently wrong with being ad hoc, so long as it works. The proof that $A_n$ is generated by 3-cycles (or that $A_n$ is simple for $n\geq 5$) is pretty ad hoc itself...2011-12-13
  • 0
    Yeah, I guess I am okay with what I've got. I need to show that if we have more than $A_n$ (so at least one odd permutation) then we have $S_n$2011-12-13
  • 0
    The problem asks you to show that the group will be either $A_n$ or $S_n$. If you can show that the group will contain all $3$ cycles, then you are done: it must contain $A_n$, and since $A_n$ is maximal in $S_n$ with $A_n\subseteq G\subseteq S_n$, you know $A_n=G$ or $G=S_n$.2011-12-13
  • 0
    @flury That second part should be clear, no? If you have an odd $\sigma$ and you have all of $A_n$, then you get the coset $\sigma A_n$ and that's everything. So maybe try to write up a proof that at least $A_n$ is in $G$?2011-12-13
  • 0
    Okay, I think I got it. Just stressing out, so I didn't see the obvious. Thanks for your help, guys.2011-12-13
  • 2
    How are you showing it contains all 3 cycles?2011-12-14
  • 0
    @flury: Perhaps you can post your solution (as an answer) that the group contains all 3-cycles; then it can be checked for you, *and* the question won't go without an answer.2011-12-14

1 Answers 1