en>MZMcBride: -:Category:Article Feedback 5

2012-12-24T10:20:35Z

← Older revision		Revision as of 12:20, 24 December 2012
Line 1:		Line 1:
	~~Hello and welcome~~. ~~My title~~ is ~~Irwin~~ and ~~I totally dig that name. One~~ of the ~~very very best issues~~ in the ~~world std testing at home for me~~ is to ~~do aerobics and I~~'~~ve been performing it~~ [~~http://www~~.~~gaysphere~~.~~net~~/~~blog~~/~~212030 over~~ the ~~counter std test~~] for ~~fairly~~ a ~~while~~. ~~California~~ is ~~where I~~'~~ve usually been residing~~ and ~~I adore every working day at home std testing residing here~~. ~~For years he~~'~~s been operating as~~ a ~~meter reader~~ and it'~~s some thing he really enjoy.~~<br><br>~~Visit my web site; over~~ the ~~counter~~ [~~http~~://~~btcsoc.com~~/~~index.php?do~~=/~~profile~~-~~4621~~/~~info~~/ ~~home std test~~] ~~std~~ [~~http~~://my.~~Clevelandclinic~~.~~org~~/~~disorders~~/~~venereal_diseases~~/~~hic_genital_warts~~.~~aspx test std~~] ~~home test~~ - [~~http:~~//~~riddlesandpoetry~~.~~com/?q~~=~~node/19209 simply click the following post~~] -		{{ For\|other theorems attributed to [[Augustin Louis Cauchy\|Cauchy]]\|Cauchy theorem (disambiguation)}}
			'''Cauchy's theorem''' is a theorem in the mathematics of [[group theory]], named after [[Augustin Louis Cauchy]]. It states that if ''G'' is a [[finite group]] and ''p'' is a [[prime number]] dividing the [[Order (group theory)\|order]] of ''G'' (the number of elements in ''G''), then ''G'' contains an element of order ''p''. That is, there is ''x'' in ''G'' so that ''p'' is the lowest non-zero number with ''x''<sup>''p''</sup> = ''e'', where ''e'' is the [[identity element]].

			The theorem is related to [[Lagrange's theorem (group theory)\|Lagrange's theorem]], which states that the order of any [[subgroup]] of a finite group ''G'' divides the order of ''G''. Cauchy's theorem implies that for any prime divisor ''p'' of the order of ''G'', there is a subgroup of ''G'' whose order is ''p''—the [[cyclic group]] generated by the element in Cauchy's theorem.

			Cauchy's theorem is generalised by [[Sylow theorems\|Sylow's first theorem]], which implies that if ''p''<sup>''n''</sup> is any prime power dividing the order of ''G'', then G has a subgroup of order ''p''<sup>''n''</sup>.

			==Statement and proof==
			Many texts appear to 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]]s for the proof.

			'''Theorem:''' Let ''G'' be a [[finite group]] and ''p'' be a [[prime number\|prime]]. If ''p'' divides the [[order (group theory)\|order]] of ''G'', then ''G'' has an element of order ''p''.

			===Proof 1===

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

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

			===Proof 2===

			This proof uses the fact that for any [[group action\|action]] of a (cyclic) group of prime order ''p'', the only possible orbit sizes are 1 and ''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,\cdots,x_p) \in G^p : x_1x_2...x_p = e\, \} </math> of ''p''-tuples of elements of ''G'' whose product (in order) gives the identity. Such a ''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\|''p'' − 1}} elements can be chosen freely, so ''X'' has \|''G''\|<sup>''p''−1</sup> elements, which is divisible by ''p''.

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

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

			==Uses==
			A practically immediate consequence of Cauchy's Theorem is a useful characterization of finite [[p-group\|''p''-groups]], where ''p'' is a prime. In particular, a finite group ''G'' is a ''p''-group (i.e. all of its elements have order ''p''<sup>''k''</sup> for some [[natural number]] ''k'') if and only if ''G'' has order ''p''<sup>''n''</sup> for some natural number ''n''. One may use the abelian case of Cauchy's Theorem in an inductive proof<ref>N. Jacobson, Basic Algebra I, p.80</ref> of first of Sylow's Theorems, similar to the first proof above, although there also exist proofs that avoid doing this special case separately.

			==References==
			{{reflist}}
			* James McKay. ''Another proof of Cauchy's group theorem'', [[American Mathematical Monthly\|American Math. Monthly]], '''66''' (1959), p. 119.

			==External links==
			* {{planetmath reference\|id=1569\|title=Cauchy's theorem}}
			* {{planetmath reference\|id=2186\|title=Proof of Cauchy's theorem}}

			[[Category:Theorems in group theory]]
			[[Category:Finite groups]]
			[[Category:Articles containing proofs]]

en>Reedy Bot: Tagging for AFT v5

2011-12-14T19:14:19Z

Tagging for AFT v5

New page

Hello and welcome. My title is Irwin and I totally dig that name. One of the very very best issues in the world std testing at home for me is to do aerobics and I've been performing it [http://www.gaysphere.net/blog/212030 over the counter std test] for fairly a while. California is where I've usually been residing and I adore every working day at home std testing residing here. For years he's been operating as a meter reader and it's some thing he really enjoy.<br><br>Visit my web site; over the counter [http://btcsoc.com/index.php?do=/profile-4621/info/ home std test] std [http://my.Clevelandclinic.org/disorders/venereal_diseases/hic_genital_warts.aspx test std] home test - [http://riddlesandpoetry.com/?q=node/19209 simply click the following post] -

COSYSMO - Revision history

en>MZMcBride: -:Category:Article Feedback 5

en>Reedy Bot: Tagging for AFT v5