Burnside lemma says that the number of orbits of a finite group on a finite set isIndeed, double-count the set . Counting first by gives the numerator. Counting first by gives ; each orbit contributes by the orbit-stabilizer theorem, proving the formula.
Let be the character of the permutation representation. Thenis, by Burnside's lemma, the number of orbits on . A two-transitive group action has exactly two such orbits: the diagonal and the ordered pairs of distinct points. Hence . Transitivity also gives . If is its irreducible character decomposition, then , so exactly one nontrivial irreducible character occurs, with multiplicity one. Thus the permutation character has precisely two distinct irreducible summands.
Every element of is conjugate to exactly one representative of one of these types, with the indicated parameter identifications:
- , where ;
- , where ;
- , where , , and is unordered;
- , where is identified with .
The projective line has points. A line is fixed exactly when it is an eigenline over , so the permutation character takes respectively the valuesThe action is two-transitive. Part (a) therefore giveswhere the nontrivial constituent is irreducible of degree , the Steinberg representation of GL2 over a finite field. Its values on the four types are
Articles by others on the same topic
There are currently no matching articles.