{
  "id": "sylow-theorems",
  "title": "Sylow Theorems",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Sylow theorems describe the existence, conjugacy, and number of maximal prime-power subgroups of a finite group.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Sylow’s theorems"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/sylow-theorems/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/sylow-theorems/",
      "json": "https://aiwiki.page/zh/sylow-theorems.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Sylow theorems are fundamental results in group theory describing the subgroups of a finite group whose orders are powers of a given prime. They guarantee the existence of subgroups containing the largest prime-power factor of the group’s order, show that all such subgroups are conjugate, and constrain how many there can be. Named after the Norwegian mathematician Ludwig Sylow, who published them in 1872, the theorems are central tools for analyzing the structure of finite groups."
    },
    {
      "heading": "Definitions and notation",
      "text": "Let \\(G\\) be a finite group with order\n\n\\[|G|=p^a m, \\qquad p\\nmid m,\\]\n\nwhere \\(p\\) is prime and \\(a\\geq 0\\). The order of a finite group is its number of elements.\n\nA \\(p\\)-subgroup of \\(G\\) is a subgroup whose order is a power of \\(p\\). A Sylow \\(p\\)-subgroup is a subgroup of order \\(p^a\\), where \\(p^a\\) is the largest power of \\(p\\) dividing \\(|G|\\).\n\nBy Lagrange’s theorem, every subgroup order divides \\(|G|\\), so no \\(p\\)-subgroup can have order larger than \\(p^a\\). The Sylow theorems additionally imply that a \\(p\\)-subgroup maximal under inclusion is a Sylow \\(p\\)-subgroup: “maximal” here means that it is not properly contained in another \\(p\\)-subgroup, not necessarily that it is a maximal subgroup of \\(G\\).\n\nThe set of Sylow \\(p\\)-subgroups is commonly written\n\n\\[\\operatorname{Syl}_p(G),\\]\n\nand its size is denoted by \\(n_p\\). If \\(p\\) does not divide \\(|G|\\), then \\(a=0\\), and the trivial subgroup is the unique Sylow \\(p\\)-subgroup."
    },
    {
      "heading": "Statements of the theorems",
      "text": "The numbering varies between textbooks, but the standard results comprise existence, containment and conjugacy, and counting.\n\nFirst theorem: existence\n\nFor every prime \\(p\\) dividing \\(|G|\\), the group \\(G\\) has a subgroup of order \\(p^a\\).\n\nA standard strengthening states that \\(G\\) has a subgroup of order \\(p^k\\) for every integer \\(k\\) with \\(0\\leq k\\leq a\\). This also uses the fact that a finite group of prime-power order has subgroups of every order dividing its order.\n\nSecond theorem: containment and conjugacy\n\nEvery \\(p\\)-subgroup \\(H\\) of \\(G\\) is contained in some Sylow \\(p\\)-subgroup.\n\nMoreover, any two Sylow \\(p\\)-subgroups \\(P\\) and \\(Q\\) are conjugate: there exists \\(g\\in G\\) such that\n\n\\[Q=gPg^{-1}.\\]\n\nThus all Sylow \\(p\\)-subgroups are isomorphic, although they need not be equal. Conjugacy is stronger than abstract isomorphism because it relates the subgroups through an operation within the ambient group.\n\nThird theorem: counting\n\nThe number \\(n_p\\) satisfies\n\n\\[n_p\\equiv 1\\pmod p, \\qquad n_p\\mid m.\\]\n\nThere is also an exact formula:\n\n\\[n_p=[G:N_G(P)],\\]\n\nwhere\n\n\\[N_G(P)=\\{g\\in G:gPg^{-1}=P\\}\\]\n\nis the normalizer of any Sylow \\(p\\)-subgroup \\(P\\), and brackets denote subgroup index.\n\nThe congruence and divisibility conditions sharply restrict the possibilities for \\(n_p\\), but they do not always determine it uniquely."
    },
    {
      "heading": "Proof through group actions",
      "text": "Group actions provide a unified approach to the theorems. Two basic facts are used repeatedly:\n\n- The size of an orbit equals the index of the stabilizer of a point.\n- If a finite \\(p\\)-group acts on a finite set \\(X\\), every orbit has prime-power size. Consequently,\n\n\\[|X|\\equiv |X^P|\\pmod p,\\]\n\nwhere \\(X^P\\) is the set of points fixed by every element of the acting group \\(P\\).\n\nExistence\n\nLet \\(X\\) be the set of subsets of \\(G\\) having exactly \\(p^a\\) elements. Then\n\n\\[|X|=\\binom{p^a m}{p^a}.\\]\n\nThis number is not divisible by \\(p\\). One way to see this is to compare coefficients in the polynomial congruence\n\n\\[(1+x)^{p^a m}\\equiv (1+x^{p^a})^m\\pmod p,\\]\n\nwhich gives\n\n\\[\\binom{p^a m}{p^a}\\equiv m\\not\\equiv 0\\pmod p.\\]\n\nLet \\(G\\) act on \\(X\\) by left multiplication. Since \\(|X|\\) is not divisible by \\(p\\), at least one orbit has size not divisible by \\(p\\). Choose a subset \\(A\\) in such an orbit and let \\(H\\) be its stabilizer.\n\nThe orbit–stabilizer formula implies that \\([G:H]\\) is not divisible by \\(p\\), so \\(p^a\\) divides \\(|H|\\). On the other hand, left multiplication by \\(H\\) acts freely on the elements of \\(A\\): if \\(ha=a\\), then \\(h\\) is the identity. Therefore \\(A\\) is a union of \\(H\\)-orbits of size \\(|H|\\), so \\(|H|\\) divides \\(|A|=p^a\\).\n\nThese two divisibility statements force\n\n\\[|H|=p^a.\\]\n\nContainment and conjugacy\n\nFix a Sylow \\(p\\)-subgroup \\(P\\), and let \\(H\\) be any \\(p\\)-subgroup. Let \\(H\\) act by left multiplication on the set of left cosets \\(G/P\\).\n\nThere are \\(m\\) such cosets, and \\(p\\nmid m\\). Since every orbit has prime-power size, at least one orbit has size one. Thus some coset \\(gP\\) is fixed by all of \\(H\\), meaning\n\n\\[hgP=gP \\quad\\text{for every }h\\in H.\\]\n\nEquivalently,\n\n\\[g^{-1}Hg\\subseteq P,\\]\n\nso \\(H\\subseteq gPg^{-1}\\).\n\nIf \\(H\\) itself has order \\(p^a\\), this containment is equality, proving conjugacy.\n\nCounting\n\nConjugation gives a transitive action of \\(G\\) on \\(\\operatorname{Syl}_p(G)\\). The stabilizer of \\(P\\) is \\(N_G(P)\\), so\n\n\\[n_p=[G:N_G(P)].\\]\n\nSince \\(P\\subseteq N_G(P)\\),\n\n\\[[G:P]=[G:N_G(P)]\\,[N_G(P):P],\\]\n\nand hence \\(n_p\\mid m\\).\n\nTo prove the congruence, let \\(P\\) itself act by conjugation on \\(\\operatorname{Syl}_p(G)\\). Its only fixed point is \\(P\\). Indeed, if \\(P\\) normalizes a Sylow subgroup \\(Q\\), then \\(PQ\\) is a subgroup with order\n\n\\[|PQ|=\\frac{|P||Q|}{|P\\cap Q|},\\]\n\na power of \\(p\\). Since no \\(p\\)-subgroup can have order greater than \\(p^a\\), this forces \\(P=Q\\).\n\nEvery other orbit has size divisible by \\(p\\), so\n\n\\[n_p\\equiv 1\\pmod p.\\]"
    },
    {
      "heading": "Structural consequences",
      "text": "Uniqueness and normality\n\nA Sylow \\(p\\)-subgroup \\(P\\) is a normal subgroup if and only if it is the unique Sylow \\(p\\)-subgroup:\n\n\\[P\\trianglelefteq G \\quad\\Longleftrightarrow\\quad n_p=1.\\]\n\nIf \\(P\\) is normal, all its conjugates equal \\(P\\), and conjugacy accounts for every Sylow \\(p\\)-subgroup. Conversely, uniqueness forces every conjugate of \\(P\\) to equal \\(P\\).\n\nThis criterion is one of the most frequent applications of the theorems: arithmetic restrictions on \\(n_p\\) can establish normality without an explicit description of the subgroup.\n\nCauchy’s theorem and the limits of a converse to Lagrange\n\nThe existence theorem implies Cauchy’s theorem: if \\(p\\mid |G|\\), then \\(G\\) contains an element of order \\(p\\).\n\nThe Sylow theorems give a partial converse to Lagrange’s theorem, but not a full one. A finite group need not have a subgroup of every order dividing its order. For example, the alternating group \\(A_4\\), of order \\(12\\), has no subgroup of order \\(6\\), although it has subgroups of orders \\(2\\), \\(3\\), and \\(4\\).\n\nGroups with all Sylow subgroups normal\n\nIf every Sylow subgroup of a finite group is normal, then the group is the internal direct product of its Sylow subgroups.\n\nFor distinct primes \\(p\\) and \\(q\\), normal Sylow subgroups \\(P\\) and \\(Q\\) have trivial intersection. For \\(x\\in P\\) and \\(y\\in Q\\), the element \\(xyx^{-1}y^{-1}\\) belongs to both subgroups, so it is the identity. Thus distinct Sylow subgroups commute elementwise.\n\nThis does not force the whole group to be abelian, because individual Sylow subgroups may themselves be nonabelian."
    },
    {
      "heading": "Examples",
      "text": "The symmetric group on three letters\n\nThe symmetric group \\(S_3\\) has order \\(6=2\\cdot3\\).\n\nFor \\(p=3\\),\n\n\\[n_3\\mid2, \\qquad n_3\\equiv1\\pmod3,\\]\n\nso \\(n_3=1\\). Its unique Sylow \\(3\\)-subgroup is\n\n\\[\\{e,(123),(132)\\}.\\]\n\nFor \\(p=2\\),\n\n\\[n_2\\mid3, \\qquad n_2\\equiv1\\pmod2,\\]\n\nso the arithmetic permits \\(n_2=1\\) or \\(3\\). In \\(S_3\\), the three transpositions generate three distinct subgroups of order \\(2\\), giving \\(n_2=3\\). They are conjugate but not normal.\n\nA group of order fifteen\n\nSuppose \\(|G|=15\\). Then\n\n\\[n_5\\mid3,\\qquad n_5\\equiv1\\pmod5,\\]\n\nwhich forces \\(n_5=1\\). Similarly,\n\n\\[n_3\\mid5,\\qquad n_3\\equiv1\\pmod3,\\]\n\nwhich forces \\(n_3=1\\).\n\nBoth Sylow subgroups are normal, so\n\n\\[G\\cong C_3\\times C_5\\cong C_{15},\\]\n\nwhere \\(C_n\\) denotes a cyclic group of order \\(n\\). Thus every group of order \\(15\\) is cyclic.\n\nA group of order forty-five\n\nIf \\(|G|=45=3^2\\cdot5\\), then\n\n\\[n_3\\mid5, \\qquad n_3\\equiv1\\pmod3.\\]\n\nOnly \\(n_3=1\\) is possible. Every group of order \\(45\\) therefore has a normal subgroup of order \\(9\\)."
    },
    {
      "heading": "Applications and limitations",
      "text": "The Sylow theorems are basic tools in the classification of groups of small order. They help locate normal subgroups, restrict possible subgroup configurations, and rule out simplicity. A simple group has no nontrivial proper normal subgroup, so a forced unique Sylow subgroup can immediately exclude simplicity.\n\nWhen uniqueness does not follow directly, counting elements in different Sylow subgroups or examining the action on their set can yield further restrictions. Conjugation on \\(\\operatorname{Syl}_p(G)\\), for example, defines a homomorphism\n\n\\[G\\longrightarrow S_{n_p},\\]\n\nconnecting subgroup counts with permutation representations.\n\nThe theorems do not determine the internal structure of a Sylow subgroup or specify completely how Sylow subgroups interact. Nor are the two numerical conditions on \\(n_p\\) a general existence criterion for a group with a proposed subgroup count. They are necessary restrictions for a given finite group, rather than a complete classification procedure."
    }
  ],
  "links": [
    "group-theory",
    "prime-number",
    "lagranges-theorem",
    "isomorphism",
    "group-action",
    "polynomial",
    "coset",
    "normal-subgroup",
    "abelian-group",
    "symmetric-group",
    "cyclic-group",
    "simple-group",
    "homomorphism"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}