4

I am a new poster but I don't think this question has been asked before. Pardon me if it is.

Singhal
  • 960

1 Answers1

7

As I said in my comment, ${\rm PSL}(n.K)$ is simple for all $n \ge 2$ and all fields $K$, except for $n=2$, $|K| \le 3$.

The proof is not exactly easy, but it is not impossibly difficult either. The field $K$ plays virtually no role, except in one place where we need at least $4$ distinct elements in $K$ when $n=2$.

It is in various books, such as Huppert's "Endliche Gruppen I", which is unfortunately in German. I have extracted the proof from some lecture notes of mine, which I took from Huppert's book. The proof assumes some results in group theory, such as a normal subgroup of a primitive permutation group being transitive.

Anyway, I hope this helps. You can find it here.

Derek Holt
  • 96,726
  • Do you know what happens for $G = {\rm PSL}(n, R)$ where $R$ is a commutative ring? I've seen that for $R=\Bbb Z$ the commutator subgroup $[G,G]$ has index $12$ in $G$, so $G$ is not simple. What about other rings? For instance, are there some ring of integers $\mathcal O_K$ (where $K$ is a number field) such that ${\rm PSL}(n, \mathcal O_K)$ is simple? – Watson May 30 '17 at 15:53
  • @Watson You should ask this as a new question. – Derek Holt May 30 '17 at 16:04