Proof of Cauchy's Theorem in group Theory
Theorem 1
For a finite group , if a prime number is a divisor of , then there exists a subgroup satisfying .
Explanation
When people usually refer to Cauchy’s theorem, they don’t typically mean this theorem. Another Cauchy’s theorem, which is fundamental to complex analysis, is much more significant and often mentioned. More so because this theorem is generally superseded by the First Sylow theorem, making it quite rare to specifically use Cauchy’s theorem.
While it might not necessarily be useful to know, the method of proof is very unique, starting from its setup. It is recommended to try to prove it at least once, even if just for interest.
Proof
Consider where and let the identity of be . Consider the set and the symmetric group .
acts as a permuting permutation that shifts each tuple of by one place, in such action. Defined as , therefore and since is a divisor of , is also a divisor of .
Properties of -group: If finite group is a -group and is a -set, then
Hence , and also divides . This means that there are at least as many tuples in with all elements being the same, regardless of whether it becomes or , as multiples of . However, the very presence of these elements in signifies . Therefore, one can confirm that at least satisfying will be a subgroup of .
■
See Also
Fraleigh. (2003). A first course in abstract algebra(7th Edition): p322. ↩︎