View source for Cauchy's theorem (group theory)

{{short description|Existence of group elements of prime order}}
{{For|other theorems attributed to Augustin-Louis Cauchy|Cauchy theorem (disambiguation)}}
{{Group theory sidebar |Finite}}
In [[mathematics]], specifically [[group theory]], '''Cauchy's theorem''' states that if {{Mvar|G}} is a [[finite group]] and {{Mvar|p}} is a [[prime number]] dividing the [[Order (group theory)|order]] of {{Mvar|G}} (the number of elements in {{Mvar|G}}), then {{Mvar|G}} contains an element of order {{Mvar|p}}. That is, there is {{Mvar|x}} in {{Mvar|G}} such that {{Mvar|p}} is the smallest positive [[integer]] with {{Mvar|x}}<sup>{{Mvar|p}}</sup> = {{Mvar|e}}, where {{Mvar|e}} is the [[identity element]] of {{Mvar|G}}. It is named after [[Augustin-Louis Cauchy]], who discovered it in 1845.{{Sfn|Cauchy|1845}}{{Sfn|Cauchy|1932}}

The theorem is a partial converse to [[Lagrange's theorem (group theory)|Lagrange's theorem]], which states that the order of any [[subgroup]] of a finite group {{Mvar|G}} divides the order of {{Mvar|G}}. In general, not every divisor of <math>|G|</math> arises as the order of a subgroup of <math>G</math>.<ref>{{Cite journal |last=Bray |first=Henry G. |date=1968 |title=A Note on CLT Groups |url=https://projecteuclid.org/journals/pacific-journal-of-mathematics/volume-27/issue-2/A-note-on-rm-CLT-groups/pjm/1102983900.pdf |journal=[[Pacific Journal of Mathematics]] |volume=27 |issue=2 |pages=229 |via=Project Euclid}}</ref> Cauchy's theorem states that for any ''prime'' divisor {{Mvar|p}} of the order of {{Mvar|G}}, there is a subgroup of {{Mvar|G}} whose order is {{Mvar|p}}—the [[cyclic group]] [[Generator (mathematics)|generated]] by the element in Cauchy's theorem.

Cauchy's theorem is generalized by [[Sylow theorems|Sylow's first theorem]], which implies that if {{Mvar|p}}<sup>{{Mvar|n}}</sup> is the maximal power of {{Mvar|p}} dividing the order of {{Mvar|G}}, then {{Mvar|G}} has a subgroup of order {{Mvar|p}}<sup>{{Mvar|n}}</sup> (and using the fact that a {{Mvar|p}}-group is [[Solvable group|solvable]], one can show that {{Mvar|G}} has subgroups of order {{Mvar|p}}<sup>{{Mvar|r}}</sup> for any {{Mvar|r}} less than or equal to {{Mvar|n}}).

==Statement and proof==
Many texts prove the theorem with the use of [[strong induction]] and the [[Conjugacy class#Conjugacy class equation|class equation]], though considerably less machinery is required to prove the theorem in the [[abelian group|abelian]] case. One can also invoke [[Group action (mathematics)|group action]]s for the proof.{{Sfn|McKay|1959}}

{{Math theorem|Cauchy's theorem|Let {{Mvar|G}} be a [[finite group]] and {{Mvar|p}} be a [[prime number|prime]]. If {{Mvar|p}} divides the [[order (group theory)|order]] of {{Mvar|G}}, then {{Mvar|G}} has an element of order {{Mvar|p}}.}}

===Proof 1===

We first prove the special case that where {{Mvar|G}} is [[abelian group|abelian]], and then the general case; both proofs are by induction on {{Mvar|n}}&nbsp;=&nbsp;|{{Mvar|G}}|, and have as starting case {{Mvar|n}}&nbsp;=&nbsp;{{Mvar|p}} which is trivial because any non-identity element now has order {{Mvar|p}}. Suppose first that {{Mvar|G}} is abelian. Take any non-identity element {{Mvar|a}}, and let {{Mvar|H}} be the [[cyclic group]] it generates. If {{Mvar|p}} divides |{{Mvar|H}}|, then {{Mvar|a}}<sup>|{{Mvar|H}}|/{{Mvar|p}}</sup> is an element of order {{Mvar|p}}. If {{Mvar|p}} does not divide |{{Mvar|H}}|, then it divides the order [{{Mvar|G}}:{{Mvar|H}}] of the [[quotient group]] {{Mvar|G}}/{{Mvar|H}}, which therefore contains an element of order {{Mvar|p}} by the inductive hypothesis. That element is a class {{Mvar|xH}} for some {{Mvar|x}} in {{Mvar|G}}, and if {{Mvar|m}} is the order of {{Mvar|x}} in {{Mvar|G}}, then {{Mvar|x}}<sup>{{Mvar|m}}</sup>&nbsp;=&nbsp;{{Mvar|e}} in {{Mvar|G}} gives ({{Mvar|xH}})<sup>{{Mvar|m}}</sup>&nbsp;=&nbsp;{{Mvar|eH}} in {{Mvar|G}}/{{Mvar|H}}, so {{Mvar|p}} divides {{Mvar|m}}; as before {{Mvar|x}}<sup>{{Mvar|m}}/{{Mvar|p}}</sup> is now an element of order {{Mvar|p}} in {{Mvar|G}}, completing the proof for the abelian case.

In the general case, let {{Mvar|Z}} be the [[center (group theory)|center]] of {{Mvar|G}}, which is an abelian subgroup. If {{Mvar|p}} divides |{{Mvar|Z}}|, then {{Mvar|Z}} contains an element of order {{Mvar|p}} by the case of abelian groups, and this element works for {{Mvar|G}} as well. So we may assume that {{Mvar|p}} does not divide the order of {{Mvar|Z}}. Since {{Mvar|p}} does divide |{{Mvar|G}}|, and {{Mvar|G}} is the disjoint union of {{Mvar|Z}} and of the [[Conjugacy class|conjugacy classes]] of non-central elements, there exists a conjugacy class of a non-central element {{Mvar|a}} whose size is not divisible by {{Mvar|p}}. But the [[Conjugacy class#Conjugacy class equation|class equation]] shows that size is [{{Mvar|G}} : {{Mvar|C}}<sub>{{Mvar|G}}</sub>({{Mvar|a}})], so {{Mvar|p}} divides the order of the [[centralizer]] {{Mvar|C}}<sub>{{Mvar|G}}</sub>({{Mvar|a}}) of {{Mvar|a}} in {{Mvar|G}}, which is a proper subgroup because {{Mvar|a}} is not central. This subgroup contains an element of order {{Mvar|p}} by the inductive hypothesis, and we are done.

===Proof 2===

This proof uses the fact that for any [[Group action (mathematics)|action]] of a (cyclic) group of prime order {{Mvar|p}}, the only possible orbit sizes are 1 and {{Mvar|p}}, which is immediate from the [[orbit stabilizer theorem]].

The set that our cyclic group shall act on is the set 
:<math> X = \{\,(x_1,\ldots,x_p) \in G^p : x_1x_2\cdots x_p = e\, \} </math> 
of {{Mvar|p}}-tuples of elements of {{Mvar|G}} whose product (in order) gives the identity. Such a {{Mvar|p}}-tuple is uniquely determined by all its components except the last one, as the last element must be the inverse of the product of those preceding elements. One also sees that those {{nobreak|{{Mvar|p}} − 1}} elements can be chosen freely, so {{Mvar|X}} has |{{Mvar|G}}|<sup>{{Mvar|p}}−1</sup> elements, which is divisible by {{Mvar|p}}.

Now from the fact that in a group if {{Mvar|ab}} = {{Mvar|e}} then {{Mvar|ba}} = {{Mvar|e}}, it follows that any [[cyclic permutation]] of the components of an element of {{Mvar|X}} again gives an element of {{Mvar|X}}. Therefore one can define an action of the cyclic group {{Mvar|C}}<sub>{{Mvar|p}} </sub> of order {{Mvar|p}} on {{Mvar|X}} by cyclic permutations of components, in other words in which a chosen generator of {{Mvar|C}}<sub>{{Mvar|p}}</sub> sends 
:<math>(x_1,x_2,\ldots,x_p)\mapsto(x_2,\ldots,x_p,x_1)</math>.

As remarked, orbits in {{Mvar|X}} under this action either have size 1 or size {{Mvar|p}}. The former happens precisely for those tuples <math>(x,x,\ldots,x)</math> for which <math>x^p=e</math>. Counting the elements of {{Mvar|X}} by orbits, and dividing by {{Mvar|p}}, one sees that the number of elements satisfying <math>x^p=e</math> is divisible by {{Mvar|p}}. But {{Mvar|x}} = {{Mvar|e}} is one such element, so there must be at least {{nobreak|{{Mvar|p}} − 1}} other solutions for {{Mvar|x}}, and these solutions are elements of order {{Mvar|p}}. This completes the proof.

==Applications==
Cauchy's theorem implies a rough classification of all [[Elementary abelian group|elementary abelian groups]] (groups whose non-identity elements all have equal, finite order). If <math>G</math> is such a group, and <math>x \in G</math> has order <math>p</math>, then <math>p</math> must be prime, since otherwise Cauchy's theorem applied to the (finite) subgroup generated by <math>x</math> produces an element of order less than <math>p</math>. Moreover, every finite subgroup of <math>G</math> has order a power of <math>p</math> (including <math>G</math> itself, if it is finite). This argument applies equally to [[p-group|{{Mvar|p}}-groups]], where every element's order is a power of <math>p</math> (but not necessarily every order is the same).

One may use the abelian case of Cauchy's Theorem in an inductive proof{{Sfn|Jacobson|2009|p=80}} of the first of Sylow's theorems, similar to the first proof above, although there are also proofs that avoid doing this special case separately.

== Notes ==
{{Reflist|2}}

== References ==
*{{Citation
|last=Cauchy
|first=Augustin-Louis
|author-link=Augustin-Louis Cauchy
|year=1845
|title=Mémoire sur les arrangements que l'on peut former avec des lettres données, et sur les permutations ou substitutions à l'aide desquelles on passe d'un arrangement à un autre
|journal=Exercises d'analyse et de physique mathématique
|location=Paris
|volume=3
|pages=151–252
|url=https://gallica.bnf.fr/ark:/12148/bpt6k96417945/f157.image
}}
*{{Citation
|last=Cauchy
|first=Augustin-Louis
|year=1932
|title=Oeuvres complètes
|journal=Lilliad - Université de Lille - Sciences et Technologies
|publisher=Gauthier-Villars
|location=Paris
|edition=reprinted
|series=second series
|volume=13
|pages=171–282
|url=https://iris.univ-lille.fr/handle/1908/4035
|format=PDF
}}
*{{Citation
|last=Jacobson
|first=Nathan
|author-link=Nathan Jacobson
|orig-year=1985
|year=2009
|title=Basic Algebra
|publisher=[[Dover Publications]]
|edition=Second
|series=Dover Books on Mathematics
|volume=I
|pages=80
|isbn=978-0-486-47189-1
}}
* {{citation
|last1      = McKay
|first1     = James H.
|year       = 1959
|title      = Another proof of Cauchy's group theorem
|journal    = [[American Mathematical Monthly]]
|pages      = 119
|volume     = 66
|issue = 2
|mr         = 0098777
|zbl        = 0082.02601
|doi        = 10.2307/2310010
|jstor = 2310010
|citeseerx= 10.1.1.434.3544
}}
* {{citation
|last1      = Meo
|first1     = M.
|year       = 2004
|title      = The mathematical life of Cauchy's group theorem
|journal    = [[Historia Mathematica]]
|pages      = 196-221
|volume     = 31
|issue = 2
|doi        = 10.1016/S0315-0860(03)00003-X
|url = https://www.sciencedirect.com/science/article/pii/S031508600300003X
|doi-access= free
}}

==External links==
* {{planetmath reference|urlname=CauchysTheorem|title=Cauchy's theorem}}
* {{planetmath reference|urlname=ProofOfCauchysTheorem|title=Proof of Cauchy's theorem}}

[[Category:Articles containing proofs]]
[[Category:Augustin-Louis Cauchy]]
[[Category:Theorems about finite groups]]