Processing math: 100%

Problem Set 06

Math 299, Fall 2024.

Read

The overarching goal is to learn about the groups PSLn(F) with a focus on PSL2(F) for F a finite field and its simplicity (usually).

  1. Skim pages 1–5 of Conrad’s notes on the Simplicity of PSLn(F). It begins by introducing some important permutation group-theoretic ideas like double-transitivity and a version of Iwasawa’s Lemma. As a first application of Iwasawa’s Lemma, Conrad gives a quick proof of the simplicity of Alt(5) in Example 2.11. Then Conrad works towards a proof that PSL2(F) is simple, which is achieved in Theorem 3.5.
  2. If you want to take a deeper dive into projective groups and projective geometries, take a look at Sections 1.4–2.5 of Cameron’s Notes on Classical Groups.

To Work On

  1. Write up—in your own words—a proof (or outline) of the simplicity of PSL2(F) when |F|4.

  2. For Fq a field of order q, work out a formula in terms of q for the order of PSL2(Fq), and use this to show that |PSL2(F7)|=168.

  3. More to come…