{
  "id": "lagranges-theorem",
  "title": "Lagrange's Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "Lagrange’s theorem states that the order of every subgroup of a finite group divides the order of the group.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Lagrange’s group theorem",
    "Lagrange’s subgroup theorem"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/lagranges-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/lagranges-theorem/",
      "json": "https://aiwiki.page/zh/lagranges-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Lagrange’s theorem is a fundamental result in group theory stating that, for a finite group \\(G\\), the number of elements in any subgroup \\(H\\) divides the number of elements in \\(G\\). More precisely,\n\n\\[|G|=[G:H]\\,|H|,\\]\n\nwhere \\(|G|\\) and \\(|H|\\) are the orders of the group and subgroup, and \\([G:H]\\) is the number of distinct left cosets of \\(H\\) in \\(G\\). The theorem connects a group’s algebraic structure with the arithmetic of its order. It restricts possible subgroups and element orders, underlies several results in number theory, and provides a basic example of counting by partitioning a set into equally sized pieces."
    },
    {
      "heading": "Statement and terminology",
      "text": "The order of a finite group is its number of elements. A subgroup \\(H\\leq G\\) is a subset that is itself a group under the operation inherited from \\(G\\).\n\nFor an element \\(g\\in G\\), the left coset of \\(H\\) represented by \\(g\\) is\n\n\\[gH=\\{gh:h\\in H\\}.\\]\n\nThe index \\([G:H]\\) is the number of distinct left cosets. Right cosets, defined by \\(Hg=\\{hg:h\\in H\\}\\), give the same index.\n\nLagrange’s theorem states that if \\(G\\) is finite and \\(H\\leq G\\), then\n\n\\[|G|=[G:H]|H|.\\]\n\nIn particular,\n\n\\[|H|\\mid |G|.\\]\n\nNo commutativity assumption is needed: the theorem applies to both abelian and nonabelian finite groups. Nor must \\(H\\) be a normal subgroup.\n\nThe subgroup hypothesis is essential. An arbitrary subset need not have a size dividing the group order."
    },
    {
      "heading": "Proof by cosets",
      "text": "The standard proof rests on two facts: the left cosets partition \\(G\\), and every coset has the same size as \\(H\\).\n\nCosets partition the group\n\nEvery element \\(g\\in G\\) belongs to some left coset, since \\(g=ge\\in gH\\), where \\(e\\) is the identity element.\n\nIf two left cosets \\(aH\\) and \\(bH\\) intersect, there are elements \\(h_1,h_2\\in H\\) such that\n\n\\[ah_1=bh_2.\\]\n\nConsequently,\n\n\\[a=bh_2h_1^{-1}\\in bH,\\]\n\nwhich implies \\(aH\\subseteq bH\\). Interchanging \\(a\\) and \\(b\\) gives the reverse inclusion. Thus two left cosets are either identical or disjoint.\n\nThe distinct left cosets therefore form a partition of \\(G\\).\n\nEvery coset has the same size\n\nFor each \\(g\\in G\\), the map\n\n\\[H\\longrightarrow gH,\\qquad h\\longmapsto gh\\]\n\nis a bijection. Its inverse sends \\(x\\in gH\\) to \\(g^{-1}x\\). Hence\n\n\\[|gH|=|H|.\\]\n\nIf there are \\(k=[G:H]\\) distinct cosets, then \\(G\\) is a disjoint union of \\(k\\) sets, each containing \\(|H|\\) elements. Therefore\n\n\\[|G|=k|H|,\\]\n\nwhich proves the theorem.\n\nEquivalently, the cosets are the classes of the equivalence relation\n\n\\[a\\sim b\\quad\\Longleftrightarrow\\quad a^{-1}b\\in H.\\]\n\nLagrange’s theorem counts these equally sized classes."
    },
    {
      "heading": "Examples",
      "text": "Integers modulo 12\n\nConsider the additive group \\(\\mathbb Z/12\\mathbb Z\\), familiar from modular arithmetic. The subgroup generated by \\(4\\) is\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\nThe symmetric group on three letters\n\nThe symmetric group \\(S_3\\) consists of the six permutations of three objects. The subgroup\n\n\\[H=\\{e,(12)\\}\\]\n\nhas order \\(2\\), so its index is \\(3\\).\n\nThis example also shows why normality is unnecessary. The subgroup \\(H\\) is not normal in \\(S_3\\), but its cosets still partition \\(S_3\\) into three sets of size \\(2\\). Normality is required to define a quotient group using coset multiplication, not to establish Lagrange’s theorem."
    },
    {
      "heading": "Consequences for elements and groups",
      "text": "Element orders divide the group order\n\nThe order of an element \\(g\\), denoted \\(\\operatorname{ord}(g)\\), is the least positive integer \\(m\\) such that \\(g^m=e\\), when such an integer exists.\n\nIn a finite group, \\(g\\) generates a cyclic subgroup\n\n\\[\\langle g\\rangle=\\{e,g,g^2,\\ldots,g^{m-1}\\}\\]\n\nof order \\(m\\). Applying Lagrange’s theorem gives\n\n\\[\\operatorname{ord}(g)\\mid |G|.\\]\n\nIt follows that\n\n\\[g^{|G|}=e\\]\n\nfor every \\(g\\in G\\).\n\nThis is a restriction on possible element orders, not a guarantee that every divisor of \\(|G|\\) occurs as an element order. For example, the group\n\n\\[\\mathbb Z/2\\mathbb Z\\times\\mathbb Z/2\\mathbb Z\\]\n\nhas order \\(4\\), but every nonidentity element has order \\(2\\).\n\nEvery group of prime order is cyclic\n\nSuppose \\(|G|=p\\), where \\(p\\) is a prime number. If \\(g\\neq e\\), then \\(\\operatorname{ord}(g)>1\\) and \\(\\operatorname{ord}(g)\\mid p\\). Thus\n\n\\[\\operatorname{ord}(g)=p,\\]\n\nso \\(g\\) generates all of \\(G\\).\n\nConsequently, every group of prime order is cyclic and is isomorphic to the additive group \\(\\mathbb Z/p\\mathbb Z\\). Its only subgroups are the identity subgroup and the whole group.\n\nOrders of images and kernels\n\nFor a group homomorphism\n\n\\[\\varphi:G\\to K\\]\n\nwith \\(G\\) finite, two elements have the same image precisely when they lie in the same coset of the kernel. Hence\n\n\\[|G|=|\\ker\\varphi|\\,|\\operatorname{im}\\varphi|.\\]\n\nIn particular, the order of the image divides \\(|G|\\).\n\nThis is the counting aspect of the first isomorphism theorem: the image is isomorphic to the quotient of \\(G\\) by the kernel."
    },
    {
      "heading": "Applications in number theory",
      "text": "Lagrange’s theorem supplies a group-theoretic explanation for important congruences in number theory.\n\nFermat’s little theorem\n\nFor a prime \\(p\\), the nonzero residue classes modulo \\(p\\) form a multiplicative group of order \\(p-1\\). Therefore, if \\(p\\) does not divide \\(a\\),\n\n\\[a^{p-1}\\equiv1\\pmod p.\\]\n\nThis is the multiplicative form of Fermat’s little theorem. It implies the equivalent statement\n\n\\[a^p\\equiv a\\pmod p\\]\n\nfor every integer \\(a\\), including multiples of \\(p\\).\n\nEuler’s theorem\n\nMore generally, the invertible residue classes modulo an integer \\(n\\geq2\\) form a group of order \\(\\varphi(n)\\), where \\(\\varphi(n)\\) counts the residue classes relatively prime to \\(n\\).\n\nLagrange’s theorem therefore yields Euler’s theorem:\n\n\\[a^{\\varphi(n)}\\equiv1\\pmod n \\qquad\\text{if }\\gcd(a,n)=1.\\]\n\nThe relative-primality condition ensures that \\(a\\) belongs to the multiplicative group of invertible classes. Without it, the congruence need not hold."
    },
    {
      "heading": "Limits of the converse",
      "text": "Lagrange’s theorem gives a necessary condition for a subgroup to exist, but not a sufficient one. 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 why, suppose such a subgroup \\(H\\) existed. Its index would be \\(2\\), making it normal, with quotient group of order \\(2\\). Every 3-cycle in \\(A_4\\) would map to the identity in that quotient: its image has cube equal to the identity, whereas the only nonidentity element of a group of order \\(2\\) does not. Thus \\(H\\) would contain all eight 3-cycles, as well as the identity, contradicting \\(|H|=6\\).\n\nThere are important partial converses:\n\n- Cauchy’s theorem: if a prime \\(p\\) divides \\(|G|\\), then \\(G\\) contains an element, and therefore a subgroup, of order \\(p\\).\n- Sylow’s theorems: if \\(p^a\\) is the largest power of \\(p\\) dividing \\(|G|\\), then \\(G\\) has subgroups of order \\(p^a\\), with additional constraints on their conjugacy and number.\n- Finite cyclic groups: for every positive divisor \\(d\\) of the group order, there is exactly one subgroup of order \\(d\\).\n\nThese results require arguments beyond Lagrange’s theorem itself."
    },
    {
      "heading": "Infinite groups and related counting formulas",
      "text": "The coset argument remains valid for infinite groups, although ordinary integer divisibility no longer expresses the conclusion. In the usual set-theoretic framework with the axiom of choice, it gives an identity of cardinalities:\n\n\\[|G|=[G:H]\\cdot|H|.\\]\n\nFor example, \\(n\\mathbb Z\\) has index \\(n\\) in the additive group \\(\\mathbb Z\\), although both groups are countably infinite. Thus equal infinite cardinalities do not determine the index.\n\nA related formula concerns a chain of subgroups \\(K\\leq H\\leq G\\):\n\n\\[[G:K]=[G:H]\\,[H:K].\\]\n\nWhen the indices are finite, this is an identity of positive integers.\n\nLagrange’s theorem is also closely related to counting orbits under a group action. If a finite group \\(G\\) acts on a set and \\(G_x\\) is the stabilizer of an element \\(x\\), then\n\n\\[|\\operatorname{Orb}(x)|=[G:G_x] =\\frac{|G|}{|G_x|}.\\]\n\nThe orbit size therefore divides the group order."
    },
    {
      "heading": "Historical background and naming",
      "text": "The theorem is named after Joseph-Louis Lagrange. His work on algebraic equations in 1770–1771 studied how expressions in the roots of a polynomial change under permutations. These investigations produced counting results that anticipated the modern theorem.\n\nLagrange did not formulate the result in the later language of abstract groups, subgroups, and cosets. Its familiar form belongs to the subsequent development of permutation groups and abstract algebra.\n\nThe name “Lagrange’s theorem” is also used in some mathematical traditions for the mean value theorem in calculus. That result concerns derivatives and is distinct from the subgroup-order theorem."
    }
  ],
  "links": [
    "group-theory",
    "group-mathematics",
    "coset",
    "abelian-group",
    "normal-subgroup",
    "mathematical-proof",
    "set-partition",
    "bijective-function",
    "equivalence-relation",
    "modular-arithmetic",
    "symmetric-group",
    "cyclic-group",
    "prime-number",
    "isomorphism",
    "homomorphism",
    "number-theory",
    "fermats-little-theorem",
    "eulers-theorem-number-theory",
    "sylow-theorems",
    "cardinality",
    "group-action",
    "abstract-algebra",
    "mean-value-theorem"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}