{"id":1537,"date":"2020-09-28T22:25:02","date_gmt":"2020-09-28T16:55:02","guid":{"rendered":"https:\/\/soulofmathematics.com\/?page_id=1537"},"modified":"2020-10-11T11:38:23","modified_gmt":"2020-10-11T06:08:23","slug":"sylows-theorem","status":"publish","type":"page","link":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/","title":{"rendered":"SYLOW&#8217;S THEOREM"},"content":{"rendered":"\n<p class=\"has-drop-cap\"><strong>Sylow theorems<\/strong>&nbsp;are a collection of&nbsp;theorems&nbsp;named after the&nbsp;Norwegian&nbsp;mathematician&nbsp;Peter Ludwig Sylow&nbsp;(1872) that give detailed information about the number of&nbsp;subgroups&nbsp;of fixed&nbsp;order&nbsp;that a given&nbsp;finite group&nbsp;contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the&nbsp;classification of finite simple groups.<\/p>\n\n\n\n<h2 class=\"has-text-align-center wp-block-heading\">Sylow\u2019s theorems and their proofs.<\/h2>\n\n\n\n<p><strong>Definitions.<\/strong> Let G be a group, and let p be a prime number.<\/p>\n\n\n\n<p>\u2022 A group of order p<sup>k<\/sup> for some k \u2265 1 is called a <strong>p-group<\/strong>. A subgroup of order p<sup>k<\/sup> for some k \u2265 1 is called a <strong>p-subgroup<\/strong>.<br>\u2022 If |G| = p<sup>\u03b1<\/sup> m where p does not divide m, then a <strong>subgroup<\/strong> of order p<sup>\u03b1<\/sup> is called a <strong>Sylow p-subgroup<\/strong> of G.<\/p>\n\n\n\n<p><strong>Notation.<\/strong> <em>S<sub>y<\/sub>l<sub>p<\/sub>(G) = the set of <strong>Sylow p-subgroups<\/strong> of G<\/em>                                 <\/p>\n\n\n\n<p><em>n<sub>p<\/sub>(G) = the # of <strong>Sylow p-subgroups<\/strong> of G = |S<sub>y<\/sub>l<sub>p<\/sub>(G)|<\/em><\/p>\n\n\n\n<h3 class=\"has-text-align-center wp-block-heading\">Diving Into Details<\/h3>\n\n\n\n<div class=\"wp-block-cover has-background-dim\" style=\"background-image:url(https:\/\/soulofmathematics.com\/wp-content\/uploads\/2020\/08\/Three-body_Problem_Animation_with_COM.gif)\"><div class=\"wp-block-cover__inner-container is-layout-flow wp-block-cover-is-layout-flow\">\n<p>Let G be a group of order p<sup>\u03b1<\/sup> m, where p is a prime, m \u2265 1, and p does not divide m. Then:<\/p>\n\n\n\n<ol class=\"wp-block-list\"><li><em>S<sub>y<\/sub>l<sub>p<\/sub>(G) not equal to \u2205, i.e. Sylow p-subgroups exist<\/em>.<\/li><li><em>All Sylow p-subgroups are conjugate in G, i.e., if P<sub>1<\/sub> and P<sub>2<\/sub> are both Sylow p-subgroups, then there is some g \u2208 G such that P<sub>1<\/sub> = g P<sub>1<\/sub>g <sup>\u22121<\/sup>. In particular, n<sub>p<\/sub>(G) = (G : N<sub>G<\/sub>(P)).<\/em><\/li><li><em>Any p-subgroup of G is contained in a Sylow p-subgroup.<\/em><\/li><li><em>n<sub>p<\/sub>(G) \u2261 1 mod p.<\/em><\/li><\/ol>\n<\/div><\/div>\n\n\n\n<p><strong>First Sylow Theorem:<\/strong> There is a subgroup of G whose order is p<sup>e<\/sup>.<\/p>\n\n\n\n<p><em>Proof:<\/em> We let g be the set of all subsets of G of order p<sup>e<\/sup>. One of these subsets is the subgroup we are looking for, but instead of finding it directly we will show that one of these subsets has a stabilizer of order p<sup>e<\/sup>. The stabilizer will be the required subgroup.<\/p>\n\n\n\n<p><strong>Lemma.<\/strong> The number of subsets of order p<sup>e<\/sup> in a set of n = p<sup>e<\/sup>m elements<br>(p not dividing m) is the binomial coefficient<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img data-recalc-dims=\"1\" decoding=\"async\" src=\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-52.png?resize=400%2C50&#038;ssl=1\" alt=\"\" class=\"wp-image-1547\" width=\"400\" height=\"50\" srcset=\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-52.png?resize=1024%2C128&amp;ssl=1 1024w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-52.png?resize=300%2C38&amp;ssl=1 300w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-52.png?resize=768%2C96&amp;ssl=1 768w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-52.png?resize=1140%2C143&amp;ssl=1 1140w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-52.png?w=1349&amp;ssl=1 1349w\" sizes=\"(max-width: 400px) 100vw, 400px\" \/><\/figure>\n\n\n\n<p>Moreover N is not divisible by p.<\/p>\n\n\n\n<p>Proof. It is a standard fact that the number of subsets of order p<sup>e<\/sup>: is this binomial coefficient. To see that N is not divisible by p, note that every time p divides a term (n &#8211; k) in the numerator of N, it also divides the term (p<sup>e<\/sup> &#8211; k) of the denominator exactly the same number of times: If we write k in the form k = p<sup>i<\/sup> l, where p does not divide l, then i &lt; e. Therefore (n &#8211; k) and (p<sup>e<\/sup> &#8211; k) are both divisible by pi but not divisible by p<sup>1+i<\/sup>.<\/p>\n\n\n\n<p>We decompose g into orbits for the operation of left multiplication, obtaining the formula.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img data-recalc-dims=\"1\" decoding=\"async\" src=\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-53.png?resize=217%2C47&#038;ssl=1\" alt=\"\" class=\"wp-image-1548\" width=\"217\" height=\"47\" srcset=\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-53.png?w=580&amp;ssl=1 580w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-53.png?resize=300%2C65&amp;ssl=1 300w\" sizes=\"(max-width: 217px) 100vw, 217px\" \/><\/figure>\n\n\n\n<p>Since p does not divide N, some orbit has an order which is not divisible by p, say the orbit of the subset U.<\/p>\n\n\n\n<figure class=\"wp-block-image size-large is-resized\"><img data-recalc-dims=\"1\" decoding=\"async\" src=\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-55.png?resize=278%2C36&#038;ssl=1\" alt=\"\" class=\"wp-image-1550\" width=\"278\" height=\"36\" srcset=\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-55.png?w=870&amp;ssl=1 870w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-55.png?resize=300%2C39&amp;ssl=1 300w, https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/image-55.png?resize=768%2C101&amp;ssl=1 768w\" sizes=\"(max-width: 278px) 100vw, 278px\" \/><\/figure>\n\n\n\n<p><strong>Second Sylow Theorem:<\/strong> Let K be a subgroup of G whose order is divisible by p, and let H be a Sylow p-subgroup of G. There is a conjugate subgroup H&#8217; = gHg<sup>&#8211; 1<\/sup> such that K n H&#8217; is a Sylow subgroup of K.<\/p>\n\n\n\n<p><em>Proof:<\/em> We are given a subgroup K and a Sylow subgroup H of G, and we are to show that for some conjugate subgroup H I of H, the intersection K n H I is a Sylow subgroup of K. Let S denote the set of left cosets G\/H. The facts that we need about this set are that G operates transitively, that is, the set forms a single orbit, and that H is the stabilizer of one of its elements, namely of s = 1H. So the stabilizer of as is the conjugate subgroup aHa<sup>-1<\/sup>. We restrict the operation of G to K and decompose S into K-orbits. Since H is a Sylow subgroup, the order of S is prime to p. So there is some K-orbit O whose order is prime to p. Say that O is the K-orbit of the element as. Let H&#8217; denote the stabilizer aHa<sup>-1<\/sup> of as for the operation of G. Then the stabilizer of as for the restricted operation of K is obviously H&#8217; n K, and the index [K:H&#8217;nK] is |O|, which is prime to p. Also, since it is a conjugate of H, H&#8217; is ap-group. Therefore H&#8217; n K is a p -group. It follows that H&#8217; n K is a Sylow subgroup of K.<\/p>\n\n\n\n<p><strong>Third Sylow Theorem:<\/strong> Let |G| = n, and n = p<sup>e<\/sup>m. Let s be the number of Sylow p-subgroups. Then s divides m and is congruent 1 (modulo p): s|m, and s = ap + 1 for some integer a \u2265 O.<\/p>\n\n\n\n<p><em>Proof:<\/em> The Sylow subgroups of G are all conjugate to a given one, say to H. So the number of Sylow subgroups is s = [G:N], where N is the normalizer of H. Since H\u2282N, [G:N] divides [G:H] = m. To show s \u2261 1 (modulo p), we decompose the set {H1, \u2026 , Hs} of Sylow subgroups into orbits for the operation of conjugation by H = H1. An orbit consists of a single group Hi if and only if H is contained in the normalizer M of Hi. If so, then H and Hi are both Sylow subgroups of M, and Hi is normal in M. There is only one H orbit of order 1, namely {H}. The other orbits have orders divisible by p because their orders divide |H|, by the Counting Formula. This shows that s \u2261 1 (modulo p).<\/p>\n\n\n<p><iframe style=\"width:120px;height:240px;\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" frameborder=\"0\" src=\"\/\/ws-in.amazon-adsystem.com\/widgets\/q?ServiceVersion=20070822&amp;OneJS=1&amp;Operation=GetAdHtml&amp;MarketPlace=IN&amp;source=ss&amp;ref=as_ss_li_til&amp;ad_type=product_link&amp;tracking_id=soulofmathema-21&amp;language=en_IN&amp;marketplace=amazon&amp;region=IN&amp;placement=B07S694NTR&amp;asins=B07S694NTR&amp;linkId=b9d8b1f9af6cad47cb243c51fb9e33be&amp;show_border=true&amp;link_opens_in_new_window=true\"><\/iframe><\/p>","protected":false},"excerpt":{"rendered":"<p>Sylow theorems&nbsp;are a collection of&nbsp;theorems&nbsp;named after the&nbsp;Norwegian&nbsp;mathematician&nbsp;Peter Ludwig Sylow&nbsp;(1872) that give detailed information about the number of&nbsp;subgroups&nbsp;of fixed&nbsp;order&nbsp;that a given&nbsp;finite group&nbsp;contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the&nbsp;classification of finite simple groups. Sylow\u2019s theorems and their proofs. Definitions. Let G be a group, and let p be a prime number. \u2022 A group of order pk for some k \u2265 1 is called a p-group. A subgroup of order pk for some k \u2265 1 is called a p-subgroup.\u2022 If |G| = p\u03b1 m where p does not divide m, then a subgroup of order p\u03b1 is called a Sylow p-subgroup of G. Notation. Sylp(G) = the set of Sylow p-subgroups of G np(G) = the # of Sylow p-subgroups of G = |Sylp(G)| Diving Into Details First Sylow Theorem: There is a subgroup of G whose order is pe. Proof: We let g be the set of all subsets of G of order pe. One of these subsets is the subgroup we are looking for, but instead of finding it directly we will show that one of these subsets has a stabilizer of order pe. The stabilizer will be the required subgroup. Lemma. The number of subsets of order pe in a set of n = pem elements(p not dividing m) is the binomial coefficient Moreover N is not divisible by p. Proof. It is a standard fact that the number of subsets of order pe: is this binomial coefficient. To see that N is not divisible by p, note that every time p divides a term (n &#8211; k) in the numerator of N, it also divides the term (pe &#8211; k) of the denominator exactly the same number of times: If we write k in the form k = pi l, where p does not divide l, then i &lt; e. Therefore (n &#8211; k) and (pe &#8211; k) are both divisible by pi but not divisible by p1+i. We decompose g into orbits for the operation of left multiplication, obtaining the formula. Since p does not divide N, some orbit has an order which is not divisible by p, say the orbit of the subset U. Second Sylow Theorem: Let K be a subgroup of G whose order is divisible by p, and let H be a Sylow p-subgroup of G. There is a conjugate subgroup H&#8217; = gHg&#8211; 1 such that K n H&#8217; is a Sylow subgroup of K. Proof: We are given a subgroup K and a Sylow subgroup H of G, and we are to show that for some conjugate subgroup H I of H, the intersection K n H I is a Sylow subgroup of K. Let S denote the set of left cosets G\/H. The facts that we need about this set are that G operates transitively, that is, the set forms a single orbit, and that H is the stabilizer of one of its elements, namely of s = 1H. So the stabilizer of as is the conjugate subgroup aHa-1. We restrict the operation of G to K and decompose S into K-orbits. Since H is a Sylow subgroup, the order of S is prime to p. So there is some K-orbit O whose order is prime to p. Say that O is the K-orbit of the element as. Let H&#8217; denote the stabilizer aHa-1 of as for the operation of G. Then the stabilizer of as for the restricted operation of K is obviously H&#8217; n K, and the index [K:H&#8217;nK] is |O|, which is prime to p. Also, since it is a conjugate of H, H&#8217; is ap-group. Therefore H&#8217; n K is a p -group. It follows that H&#8217; n K is a Sylow subgroup of K. Third Sylow Theorem: Let |G| = n, and n = pem. Let s be the number of Sylow p-subgroups. Then s divides m and is congruent 1 (modulo p): s|m, and s = ap + 1 for some integer a \u2265 O. Proof: The Sylow subgroups of G are all conjugate to a given one, say to H. So the number of Sylow subgroups is s = [G:N], where N is the normalizer of H. Since H\u2282N, [G:N] divides [G:H] = m. To show s \u2261 1 (modulo p), we decompose the set {H1, \u2026 , Hs} of Sylow subgroups into orbits for the operation of conjugation by H = H1. An orbit consists of a single group Hi if and only if H is contained in the normalizer M of Hi. If so, then H and Hi are both Sylow subgroups of M, and Hi is normal in M. There is only one H orbit of order 1, namely {H}. The other orbits have orders divisible by p because their orders divide |H|, by the Counting Formula. This shows that s \u2261 1 (modulo p).<\/p>\n","protected":false},"author":1,"featured_media":1539,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"jetpack_post_was_ever_published":false,"footnotes":""},"class_list":["post-1537","page","type-page","status-publish","has-post-thumbnail","hentry"],"ams_acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v23.6 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>SYLOW&#039;S THEOREM - SOUL OF MATHEMATICS<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"SYLOW&#039;S THEOREM - SOUL OF MATHEMATICS\" \/>\n<meta property=\"og:description\" content=\"Sylow theorems&nbsp;are a collection of&nbsp;theorems&nbsp;named after the&nbsp;Norwegian&nbsp;mathematician&nbsp;Peter Ludwig Sylow&nbsp;(1872) that give detailed information about the number of&nbsp;subgroups&nbsp;of fixed&nbsp;order&nbsp;that a given&nbsp;finite group&nbsp;contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the&nbsp;classification of finite simple groups. Sylow\u2019s theorems and their proofs. Definitions. Let G be a group, and let p be a prime number. \u2022 A group of order pk for some k \u2265 1 is called a p-group. A subgroup of order pk for some k \u2265 1 is called a p-subgroup.\u2022 If |G| = p\u03b1 m where p does not divide m, then a subgroup of order p\u03b1 is called a Sylow p-subgroup of G. Notation. Sylp(G) = the set of Sylow p-subgroups of G np(G) = the # of Sylow p-subgroups of G = |Sylp(G)| Diving Into Details First Sylow Theorem: There is a subgroup of G whose order is pe. Proof: We let g be the set of all subsets of G of order pe. One of these subsets is the subgroup we are looking for, but instead of finding it directly we will show that one of these subsets has a stabilizer of order pe. The stabilizer will be the required subgroup. Lemma. The number of subsets of order pe in a set of n = pem elements(p not dividing m) is the binomial coefficient Moreover N is not divisible by p. Proof. It is a standard fact that the number of subsets of order pe: is this binomial coefficient. To see that N is not divisible by p, note that every time p divides a term (n &#8211; k) in the numerator of N, it also divides the term (pe &#8211; k) of the denominator exactly the same number of times: If we write k in the form k = pi l, where p does not divide l, then i &lt; e. Therefore (n &#8211; k) and (pe &#8211; k) are both divisible by pi but not divisible by p1+i. We decompose g into orbits for the operation of left multiplication, obtaining the formula. Since p does not divide N, some orbit has an order which is not divisible by p, say the orbit of the subset U. Second Sylow Theorem: Let K be a subgroup of G whose order is divisible by p, and let H be a Sylow p-subgroup of G. There is a conjugate subgroup H&#8217; = gHg&#8211; 1 such that K n H&#8217; is a Sylow subgroup of K. Proof: We are given a subgroup K and a Sylow subgroup H of G, and we are to show that for some conjugate subgroup H I of H, the intersection K n H I is a Sylow subgroup of K. Let S denote the set of left cosets G\/H. The facts that we need about this set are that G operates transitively, that is, the set forms a single orbit, and that H is the stabilizer of one of its elements, namely of s = 1H. So the stabilizer of as is the conjugate subgroup aHa-1. We restrict the operation of G to K and decompose S into K-orbits. Since H is a Sylow subgroup, the order of S is prime to p. So there is some K-orbit O whose order is prime to p. Say that O is the K-orbit of the element as. Let H&#8217; denote the stabilizer aHa-1 of as for the operation of G. Then the stabilizer of as for the restricted operation of K is obviously H&#8217; n K, and the index [K:H&#8217;nK] is |O|, which is prime to p. Also, since it is a conjugate of H, H&#8217; is ap-group. Therefore H&#8217; n K is a p -group. It follows that H&#8217; n K is a Sylow subgroup of K. Third Sylow Theorem: Let |G| = n, and n = pem. Let s be the number of Sylow p-subgroups. Then s divides m and is congruent 1 (modulo p): s|m, and s = ap + 1 for some integer a \u2265 O. Proof: The Sylow subgroups of G are all conjugate to a given one, say to H. So the number of Sylow subgroups is s = [G:N], where N is the normalizer of H. Since H\u2282N, [G:N] divides [G:H] = m. To show s \u2261 1 (modulo p), we decompose the set {H1, \u2026 , Hs} of Sylow subgroups into orbits for the operation of conjugation by H = H1. An orbit consists of a single group Hi if and only if H is contained in the normalizer M of Hi. If so, then H and Hi are both Sylow subgroups of M, and Hi is normal in M. There is only one H orbit of order 1, namely {H}. The other orbits have orders divisible by p because their orders divide |H|, by the Counting Formula. This shows that s \u2261 1 (modulo p).\" \/>\n<meta property=\"og:url\" content=\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/\" \/>\n<meta property=\"og:site_name\" content=\"SOUL OF MATHEMATICS\" \/>\n<meta property=\"article:modified_time\" content=\"2020-10-11T06:08:23+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/i1.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1\" \/>\n\t<meta property=\"og:image:width\" content=\"262\" \/>\n\t<meta property=\"og:image:height\" content=\"326\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/\",\"url\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/\",\"name\":\"SYLOW'S THEOREM - SOUL OF MATHEMATICS\",\"isPartOf\":{\"@id\":\"https:\/\/soulofmathematics.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1\",\"datePublished\":\"2020-09-28T16:55:02+00:00\",\"dateModified\":\"2020-10-11T06:08:23+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#primaryimage\",\"url\":\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1\",\"contentUrl\":\"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1\",\"width\":262,\"height\":326,\"caption\":\"sylow\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/soulofmathematics.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"SYLOW&#8217;S THEOREM\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/soulofmathematics.com\/#website\",\"url\":\"https:\/\/soulofmathematics.com\/\",\"name\":\"SOUL OF MATHEMATICS\",\"description\":\"\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/soulofmathematics.com\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"SYLOW'S THEOREM - SOUL OF MATHEMATICS","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/","og_locale":"en_US","og_type":"article","og_title":"SYLOW'S THEOREM - SOUL OF MATHEMATICS","og_description":"Sylow theorems&nbsp;are a collection of&nbsp;theorems&nbsp;named after the&nbsp;Norwegian&nbsp;mathematician&nbsp;Peter Ludwig Sylow&nbsp;(1872) that give detailed information about the number of&nbsp;subgroups&nbsp;of fixed&nbsp;order&nbsp;that a given&nbsp;finite group&nbsp;contains. The Sylow theorems form a fundamental part of finite group theory and have very important applications in the&nbsp;classification of finite simple groups. Sylow\u2019s theorems and their proofs. Definitions. Let G be a group, and let p be a prime number. \u2022 A group of order pk for some k \u2265 1 is called a p-group. A subgroup of order pk for some k \u2265 1 is called a p-subgroup.\u2022 If |G| = p\u03b1 m where p does not divide m, then a subgroup of order p\u03b1 is called a Sylow p-subgroup of G. Notation. Sylp(G) = the set of Sylow p-subgroups of G np(G) = the # of Sylow p-subgroups of G = |Sylp(G)| Diving Into Details First Sylow Theorem: There is a subgroup of G whose order is pe. Proof: We let g be the set of all subsets of G of order pe. One of these subsets is the subgroup we are looking for, but instead of finding it directly we will show that one of these subsets has a stabilizer of order pe. The stabilizer will be the required subgroup. Lemma. The number of subsets of order pe in a set of n = pem elements(p not dividing m) is the binomial coefficient Moreover N is not divisible by p. Proof. It is a standard fact that the number of subsets of order pe: is this binomial coefficient. To see that N is not divisible by p, note that every time p divides a term (n &#8211; k) in the numerator of N, it also divides the term (pe &#8211; k) of the denominator exactly the same number of times: If we write k in the form k = pi l, where p does not divide l, then i &lt; e. Therefore (n &#8211; k) and (pe &#8211; k) are both divisible by pi but not divisible by p1+i. We decompose g into orbits for the operation of left multiplication, obtaining the formula. Since p does not divide N, some orbit has an order which is not divisible by p, say the orbit of the subset U. Second Sylow Theorem: Let K be a subgroup of G whose order is divisible by p, and let H be a Sylow p-subgroup of G. There is a conjugate subgroup H&#8217; = gHg&#8211; 1 such that K n H&#8217; is a Sylow subgroup of K. Proof: We are given a subgroup K and a Sylow subgroup H of G, and we are to show that for some conjugate subgroup H I of H, the intersection K n H I is a Sylow subgroup of K. Let S denote the set of left cosets G\/H. The facts that we need about this set are that G operates transitively, that is, the set forms a single orbit, and that H is the stabilizer of one of its elements, namely of s = 1H. So the stabilizer of as is the conjugate subgroup aHa-1. We restrict the operation of G to K and decompose S into K-orbits. Since H is a Sylow subgroup, the order of S is prime to p. So there is some K-orbit O whose order is prime to p. Say that O is the K-orbit of the element as. Let H&#8217; denote the stabilizer aHa-1 of as for the operation of G. Then the stabilizer of as for the restricted operation of K is obviously H&#8217; n K, and the index [K:H&#8217;nK] is |O|, which is prime to p. Also, since it is a conjugate of H, H&#8217; is ap-group. Therefore H&#8217; n K is a p -group. It follows that H&#8217; n K is a Sylow subgroup of K. Third Sylow Theorem: Let |G| = n, and n = pem. Let s be the number of Sylow p-subgroups. Then s divides m and is congruent 1 (modulo p): s|m, and s = ap + 1 for some integer a \u2265 O. Proof: The Sylow subgroups of G are all conjugate to a given one, say to H. So the number of Sylow subgroups is s = [G:N], where N is the normalizer of H. Since H\u2282N, [G:N] divides [G:H] = m. To show s \u2261 1 (modulo p), we decompose the set {H1, \u2026 , Hs} of Sylow subgroups into orbits for the operation of conjugation by H = H1. An orbit consists of a single group Hi if and only if H is contained in the normalizer M of Hi. If so, then H and Hi are both Sylow subgroups of M, and Hi is normal in M. There is only one H orbit of order 1, namely {H}. The other orbits have orders divisible by p because their orders divide |H|, by the Counting Formula. This shows that s \u2261 1 (modulo p).","og_url":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/","og_site_name":"SOUL OF MATHEMATICS","article_modified_time":"2020-10-11T06:08:23+00:00","og_image":[{"width":262,"height":326,"url":"https:\/\/i1.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/","url":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/","name":"SYLOW'S THEOREM - SOUL OF MATHEMATICS","isPartOf":{"@id":"https:\/\/soulofmathematics.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#primaryimage"},"image":{"@id":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#primaryimage"},"thumbnailUrl":"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1","datePublished":"2020-09-28T16:55:02+00:00","dateModified":"2020-10-11T06:08:23+00:00","breadcrumb":{"@id":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#primaryimage","url":"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1","contentUrl":"https:\/\/i0.wp.com\/soulofmathematics.com\/wp-content\/uploads\/2020\/09\/Sylow_2.jpeg?fit=262%2C326&ssl=1","width":262,"height":326,"caption":"sylow"},{"@type":"BreadcrumbList","@id":"https:\/\/soulofmathematics.com\/index.php\/sylows-theorem\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/soulofmathematics.com\/"},{"@type":"ListItem","position":2,"name":"SYLOW&#8217;S THEOREM"}]},{"@type":"WebSite","@id":"https:\/\/soulofmathematics.com\/#website","url":"https:\/\/soulofmathematics.com\/","name":"SOUL OF MATHEMATICS","description":"","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/soulofmathematics.com\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"jetpack_sharing_enabled":true,"jetpack-related-posts":[],"jetpack_shortlink":"https:\/\/wp.me\/Pcfs4y-oN","_links":{"self":[{"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/pages\/1537","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/comments?post=1537"}],"version-history":[{"count":7,"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/pages\/1537\/revisions"}],"predecessor-version":[{"id":1650,"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/pages\/1537\/revisions\/1650"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/media\/1539"}],"wp:attachment":[{"href":"https:\/\/soulofmathematics.com\/index.php\/wp-json\/wp\/v2\/media?parent=1537"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}