{
  "id": "lagranges-theorem-group-theory",
  "title": "Lagrange's theorem (group theory)",
  "lang": "en",
  "source_lang": "en",
  "summary": "Lagrange’s theorem states that the order of a subgroup of a finite group divides the order of the group, with the quotient equal to its index.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Lagrange’s group theorem"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/lagranges-theorem-group-theory/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/lagranges-theorem-group-theory/",
      "json": "https://aiwiki.page/zh/lagranges-theorem-group-theory.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Lagrange’s theorem is a fundamental result in group theory stating that, for a finite group \\(G\\) and a subgroup \\(H\\), the number of elements of \\(H\\) divides the number of elements of \\(G\\). More precisely,\n\n\\[|G|=[G:H]\\,|H|,\\]\n\nwhere \\([G:H]\\) is the number of distinct left cosets of \\(H\\) in \\(G\\), called the index of \\(H\\). The theorem follows by partitioning the group into equally sized cosets. It constrains possible subgroup sizes, determines basic properties of element orders, and underlies many counting arguments in finite group theory."
    },
    {
      "heading": "Statement and terminology",
      "text": "The order of a finite group is its number of elements, denoted \\(|G|\\). A subgroup \\(H\\leq G\\) is a subset that is itself a group under the operation inherited from \\(G\\).\n\nFor \\(g\\in G\\), the left coset of \\(H\\) represented by \\(g\\) is\n\n\\[gH=\\{gh:h\\in H\\}.\\]\n\nThe index \\([G:H]\\) counts the distinct left cosets. The number of right cosets is the same.\n\nLagrange’s theorem can therefore be stated in either of two equivalent forms:\n\n- If \\(G\\) is finite and \\(H\\leq G\\), then \\(|H|\\mid |G|\\).\n- The order of a finite group equals the order of a subgroup multiplied by its index.\n\nNo commutativity assumption is required, and \\(H\\) need not be a normal subgroup. Normality is needed to give the coset set a quotient-group operation, not to count its elements."
    },
    {
      "heading": "Proof by cosets",
      "text": "The standard proof uses two facts: every coset has as many elements as \\(H\\), and distinct cosets are disjoint.\n\nFor any \\(g\\in G\\), the map\n\n\\[H\\longrightarrow gH,\\qquad h\\longmapsto gh\\]\n\nis a bijection. It is surjective by the definition of \\(gH\\), and injective because cancellation gives\n\n\\[gh_1=gh_2\\implies h_1=h_2.\\]\n\nThus \\(|gH|=|H|\\).\n\nNext, suppose \\(aH\\) and \\(bH\\) intersect. There are \\(h_1,h_2\\in H\\) such that\n\n\\[ah_1=bh_2.\\]\n\nIt follows that\n\n\\[b^{-1}a=h_2h_1^{-1}\\in H,\\]\n\nwhich implies \\(aH=bH\\). Consequently, two left cosets are either equal or disjoint.\n\nEvery \\(g\\in G\\) belongs to \\(gH\\), since the identity element belongs to \\(H\\). Hence the distinct left cosets form a partition of \\(G\\). If there are \\(k=[G:H]\\) of them, then\n\n\\[|G|=\\underbrace{|H|+\\cdots+|H|}_{k\\text{ terms}} =k|H|.\\]\n\nEquivalently, cosets are the equivalence classes of the relation\n\n\\[x\\sim y\\quad\\Longleftrightarrow\\quad x^{-1}y\\in H.\\]\n\nThe theorem is therefore an instance of counting a finite set by equally sized equivalence classes."
    },
    {
      "heading": "Examples",
      "text": "An additive group of residues\n\nIn the additive group \\(\\mathbb Z/12\\mathbb Z\\), a standard object in modular arithmetic, consider\n\n\\[H=\\{0,4,8\\}.\\]\n\nIts distinct cosets are\n\n\\[\\begin{aligned} H&=\\{0,4,8\\},\\\\ 1+H&=\\{1,5,9\\},\\\\ 2+H&=\\{2,6,10\\},\\\\ 3+H&=\\{3,7,11\\}. \\end{aligned}\\]\n\nThere are four cosets, each with three elements, so\n\n\\[12=4\\cdot3.\\]\n\nA nonnormal subgroup\n\nThe symmetric group \\(S_3\\), consisting of the permutations of three objects, has order \\(6\\). Its subgroup\n\n\\[H=\\{e,(12)\\}\\]\n\nhas order \\(2\\), and hence index \\(3\\).\n\nThis subgroup is not normal: conjugation by a suitable permutation sends \\((12)\\) to another transposition. Nevertheless, its three left cosets partition \\(S_3\\) into sets of size \\(2\\). This illustrates why normality is unnecessary for Lagrange’s theorem."
    },
    {
      "heading": "Consequences for element orders",
      "text": "The order of an element \\(g\\), written \\(\\operatorname{ord}(g)\\), is the smallest positive integer \\(m\\) such that \\(g^m=e\\), when such an integer exists. The subgroup generated by \\(g\\),\n\n\\[\\langle g\\rangle=\\{g^k:k\\in\\mathbb Z\\},\\]\n\nis a cyclic group and has exactly \\(\\operatorname{ord}(g)\\) elements.\n\nApplying Lagrange’s theorem gives\n\n\\[\\operatorname{ord}(g)\\mid |G|\\]\n\nfor every element of a finite group. In particular,\n\n\\[g^{|G|}=e.\\]\n\nThis restricts possible element orders but does not guarantee their existence. For example, a group of order \\(12\\) can have elements only of orders \\(1,2,3,4,6,\\) or \\(12\\), but it need not have elements of all these orders.\n\nGroups of prime order\n\nIf \\(|G|=p\\), where \\(p\\) is a prime number, choose any \\(g\\neq e\\). Its order divides \\(p\\) and is greater than \\(1\\), so it must equal \\(p\\). Therefore\n\n\\[G=\\langle g\\rangle.\\]\n\nThus every group of prime order is cyclic. In particular, every such group is an abelian group, and any two groups of the same prime order are isomorphic.\n\nApplications to number theory\n\nFor a prime \\(p\\), the nonzero residue classes modulo \\(p\\) form a multiplicative group of order \\(p-1\\). Therefore, if \\(p\\nmid a\\),\n\n\\[a^{p-1}\\equiv1\\pmod p.\\]\n\nThis is the multiplicative form of Fermat’s little theorem.\n\nMore generally, the invertible residue classes modulo a positive integer \\(n\\) form a group of order \\(\\varphi(n)\\), where \\(\\varphi\\) is Euler’s totient function. Lagrange’s theorem yields Euler’s theorem:\n\n\\[a^{\\varphi(n)}\\equiv1\\pmod n \\qquad\\text{when }\\gcd(a,n)=1.\\]"
    },
    {
      "heading": "Why the converse fails",
      "text": "Lagrange’s theorem gives a necessary condition for a subgroup’s order, not a sufficient condition. If \\(d\\mid |G|\\), there need not be a subgroup of order \\(d\\).\n\nA standard counterexample is the alternating group \\(A_4\\), the group of even permutations of four objects. It has order \\(12\\) but no subgroup of order \\(6\\).\n\nTo see this, suppose \\(H\\leq A_4\\) had order \\(6\\). Its index would be \\(2\\). Every subgroup of index \\(2\\) is normal, so there would be a quotient homomorphism\n\n\\[A_4\\longrightarrow A_4/H\\]\n\nonto a group of order \\(2\\).\n\nEvery \\(3\\)-cycle must map to the identity: its image has cube equal to the identity, whereas the nonidentity element of a group of order \\(2\\) does not. But the \\(3\\)-cycles generate \\(A_4\\), so the homomorphism would be trivial, contradicting surjectivity.\n\nThere are important cases in which partial converses hold:\n\n- Cyclic groups: A cyclic group of order \\(n\\) has exactly one subgroup of order \\(d\\) for every positive divisor \\(d\\) of \\(n\\).\n- Finite abelian groups: A finite abelian group has a subgroup of every order dividing its order, though that subgroup need not be unique.\n- Prime divisors: Cauchy’s theorem guarantees an element, and therefore a cyclic subgroup, of order \\(p\\) whenever the prime \\(p\\) divides \\(|G|\\).\n- Prime-power divisors: The Sylow theorems guarantee subgroups whose order is the largest power of a given prime dividing \\(|G|\\).\n\nThese existence statements require additional arguments; they do not follow merely by reversing Lagrange’s divisibility assertion."
    },
    {
      "heading": "Index, quotient groups, and group actions",
      "text": "Multiplicativity of index\n\nFor subgroups \\(K\\leq H\\leq G\\) of a finite group,\n\n\\[[G:K]=[G:H]\\,[H:K].\\]\n\nThis follows from\n\n\\[\\frac{|G|}{|K|} = \\frac{|G|}{|H|}\\frac{|H|}{|K|}.\\]\n\nIt can also be proved directly by choosing coset representatives, and the corresponding counting identity extends to infinite indices.\n\nQuotient groups\n\nIf \\(N\\) is normal in a finite group \\(G\\), its cosets form the quotient group \\(G/N\\). Lagrange’s formula becomes\n\n\\[|G/N|=\\frac{|G|}{|N|}.\\]\n\nWithout normality, the cosets still form a set of this size, but multiplication of cosets need not be well defined.\n\nThe orbit–stabilizer theorem\n\nSuppose \\(G\\) acts on a set \\(X\\). For \\(x\\in X\\), its stabilizer is\n\n\\[G_x=\\{g\\in G:g\\cdot x=x\\}.\\]\n\nThe orbit of \\(x\\) is in bijection with the left cosets of \\(G_x\\), through\n\n\\[gG_x\\longmapsto g\\cdot x.\\]\n\nThus the orbit–stabilizer theorem gives, for finite \\(G\\),\n\n\\[|G\\cdot x|=[G:G_x] =\\frac{|G|}{|G_x|}.\\]\n\nLagrange’s theorem and orbit–stabilizer express the same underlying coset-counting principle. This connection makes the theorem useful in the study of group actions, symmetry, and permutation groups."
    },
    {
      "heading": "Infinite groups",
      "text": "For an infinite group, ordinary divisibility of finite orders is no longer the appropriate statement. The coset partition remains valid, however.\n\nIn the usual framework of set theory with the axiom of choice, choosing one representative from each left coset gives a bijection between \\(G\\) and the Cartesian product of \\(H\\) with the coset set. Consequently,\n\n\\[|G|=[G:H]\\cdot |H|\\]\n\nholds as an identity of cardinalities.\n\nThis identity has weaker numerical consequences than in the finite case because infinite cardinal multiplication does not permit ordinary cancellation. For example, the additive group \\(\\mathbb Z\\) and its subgroup \\(2\\mathbb Z\\) are both countably infinite, but\n\n\\[[\\mathbb Z:2\\mathbb Z]=2.\\]\n\nIndex therefore retains information that the cardinalities of the two groups alone do not determine."
    },
    {
      "heading": "Historical background",
      "text": "The theorem is named after Joseph-Louis Lagrange, whose work of 1770–1771 on algebraic equations examined how permutations of roots affect the values of expressions formed from them. His counting arguments anticipated the divisibility ideas later expressed in group-theoretic language.\n\nLagrange did not state the theorem in the modern language of arbitrary groups and subgroups. That formulation emerged with the nineteenth-century development of permutation groups, abstract algebra, and Galois theory."
    }
  ],
  "links": [
    "group-theory",
    "coset",
    "normal-subgroup",
    "mathematical-proof",
    "bijective-function",
    "set-partition",
    "equivalence-class",
    "modular-arithmetic",
    "symmetric-group",
    "cyclic-group",
    "prime-number",
    "abelian-group",
    "fermats-little-theorem",
    "eulers-theorem-number-theory",
    "homomorphism",
    "sylow-theorems",
    "group-action",
    "axiom-of-choice",
    "cardinality",
    "abstract-algebra",
    "galois-theory"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}