Every finite cyclic subgroup of order has exactly generators, where is the Euler totient function: if has order , then generates precisely when . Each element generates exactly one cyclic subgroup. Thus counting cyclic subgroups by their generators amounts to counting elements by order of a group element and dividing by .
Use the cycle decomposition of a permutation in . A permutation with cycles of length occurs times: order the five letters, then divide by the cyclic choices of starting point and the orderings of equal-length cycles. Its order is the least common multiple of the cycle lengths. The resulting count is
The two subgroups and are both isomorphic to by a group isomorphism. They are not conjugate subgroups: conjugating their unique nonidentity elements would have to preserve cycle type, whereas a transposition and a product of two disjoint transpositions have different cycle types.
The Sylow theorems state that if a finite group has order with prime and , it has a subgroup of order , called a Sylow subgroup. Every p-group subgroup is contained in a Sylow subgroup, and all Sylow subgroups for the same prime are conjugate subgroups. Their number satisfies
More precisely for a Sylow subgroup , where is its normalizer.
The Mackey's theorem, or Mackey restriction formula, says that if , is a complex -representation, and is a set of representatives for the double cosets , then
Here is the representation of the conjugate subgroup defined by
For the proof, use the group-algebra model
The partition of into double cosets gives the direct-sum decomposition of -bimodules
Put . For each , define
If , then
so is well defined. It is visibly -equivariant and surjective, and choosing representatives for shows that both sides have dimension ; hence it is an isomorphism. Summing the proves the formula.
The Frobenius reciprocity theorem states that for an -representation and a -representation ,
For the corresponding character of a representation, this is