In mathematics, specifically group theory, Frobenius's theorem states that if divides the order of a finite group , then the number of solutions of in is a multiple of . It was introduced by Frobenius ( 1903 ).
A more general version of Frobenius's theorem states that if is a conjugacy class with elements of a finite group with elements and is a positive integer, then the number of elements such that is in is a multiple of the greatest common divisor ( Hall 1959 , theorem 9.1.1).
One application of Frobenius's theorem is to show that the coefficients of the Artin–Hasse exponential are -integral, by interpreting them in terms of the number of elements of order a power of in the symmetric group .
Frobenius conjectured that if, in addition, the number of solutions to is exactly , where divides the order of , then these solutions form a normal subgroup. This was proved by Iiyori and Yamaki [1] as a consequence of the classification of finite simple groups.
The symmetric group has exactly solutions to but these do not form a normal subgroup; this is not a counterexample to the conjecture as does not divide the order of , which is .