{
  "id": "cayleys-theorem",
  "title": "Cayley's Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "Cayley's theorem states that every group is isomorphic to a subgroup of a symmetric group, with a canonical construction given by left multiplication.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Cayley's group theorem"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/cayleys-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/cayleys-theorem/",
      "json": "https://aiwiki.page/zh/cayleys-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Cayley's theorem is a foundational result in group theory stating that every group is isomorphic to a subgroup of a symmetric group. More precisely, a group \\(G\\) acts on its own underlying set by left multiplication, and this action identifies \\(G\\) with a group of permutations of that set. Consequently, every finite group of order \\(n\\) can be represented as a subgroup of \\(S_n\\), the symmetric group on \\(n\\) symbols. The theorem connects the abstract definition of a group with the concrete study of permutations."
    },
    {
      "heading": "Statement",
      "text": "Let \\(G\\) be a group, with identity element \\(e\\), and let \\(\\operatorname{Sym}(G)\\) denote the group of all bijections from the underlying set of \\(G\\) to itself, with composition as its operation. Cayley's theorem states that there is an injective group homomorphism\n\n\\[\\lambda:G\\longrightarrow \\operatorname{Sym}(G).\\]\n\nThus,\n\n\\[G\\cong\\lambda(G)\\leq \\operatorname{Sym}(G).\\]\n\nHere \\(\\lambda(G)\\) is the image of \\(G\\), a subgroup of the symmetric group. The map is an embedding: it preserves the group operation and distinguishes every pair of distinct group elements.\n\nFor a finite group with \\(|G|=n\\), choosing a labeling of its elements by \\(1,\\ldots,n\\) identifies \\(\\operatorname{Sym}(G)\\) with \\(S_n\\). The theorem then gives\n\n\\[G\\hookrightarrow S_n.\\]\n\nThe general statement also applies to infinite groups. In that case, \\(\\operatorname{Sym}(G)\\) means the full symmetric group of the possibly infinite underlying set, not merely the permutations that move finitely many elements."
    },
    {
      "heading": "Proof by left multiplication",
      "text": "For each \\(g\\in G\\), define the left multiplication map\n\n\\[L_g:G\\longrightarrow G,\\qquad L_g(x)=gx.\\]\n\nThe proof consists of three observations.\n\nEach left multiplication map is a permutation\n\nThe inverse of \\(L_g\\) is \\(L_{g^{-1}}\\), since\n\n\\[g^{-1}(gx)=x \\quad\\text{and}\\quad g(g^{-1}x)=x.\\]\n\nTherefore \\(L_g\\) is a permutation of the set \\(G\\).\n\nLeft multiplication preserves the group operation\n\nUsing the convention that the rightmost function is applied first,\n\n\\[(L_g\\circ L_h)(x)=g(hx)=(gh)x=L_{gh}(x).\\]\n\nHence the map\n\n\\[\\lambda(g)=L_g\\]\n\nis a group homomorphism.\n\nThe homomorphism is injective\n\nIf \\(L_g=L_h\\), evaluating both functions at the identity gives\n\n\\[g=L_g(e)=L_h(e)=h.\\]\n\nThus \\(\\lambda\\) is an injective function, and it is an isomorphism from \\(G\\) onto its image.\n\nThe proof is constructive: a group's multiplication table directly determines a corresponding collection of permutations. Each row of a finite multiplication table lists the images under one left multiplication map."
    },
    {
      "heading": "The regular action",
      "text": "The action\n\n\\[g\\cdot x=gx\\]\n\nis called the left regular action of \\(G\\). In the language of group actions, it has three important properties:\n\n- Faithfulness: only the identity acts as the identity permutation.\n- Transitivity: any element of the underlying set can be carried to any other.\n- Freeness: if \\(gx=x\\), then \\(g=e\\).\n\nThe last two properties together imply that for any \\(x,y\\in G\\), exactly one element sends \\(x\\) to \\(y\\), namely \\(yx^{-1}\\). Such an action is also called regular or sharply transitive.\n\nFaithfulness is the property that makes the action an embedding. A general group action need not be faithful: different group elements may induce the same permutation.\n\nRight multiplication requires care with composition order. If \\(R_g(x)=xg\\), then\n\n\\[R_g\\circ R_h=R_{hg},\\]\n\nso \\(g\\mapsto R_g\\) reverses multiplication. A right regular embedding compatible with the usual composition convention is instead\n\n\\[g\\longmapsto \\rho_g,\\qquad \\rho_g(x)=xg^{-1}.\\]"
    },
    {
      "heading": "Examples",
      "text": "Addition modulo three\n\nConsider the group \\(\\mathbb Z/3\\mathbb Z\\), whose operation is addition in arithmetic modulo three. Its elements are \\(0,1,2\\).\n\nTranslation by \\(1\\) produces the permutation\n\n\\[0\\mapsto1,\\qquad 1\\mapsto2,\\qquad 2\\mapsto0,\\]\n\nwritten in cycle notation as \\((0\\ 1\\ 2)\\). Translation by \\(2\\) gives \\((0\\ 2\\ 1)\\). Thus the regular embedding has image\n\n\\[\\{\\mathrm{id},(0\\ 1\\ 2),(0\\ 2\\ 1)\\}\\leq S_3.\\]\n\nAddition of group elements corresponds exactly to composition of these translations.\n\nThe Klein four-group\n\nLet\n\n\\[G=\\{e,a,b,c\\},\\]\n\nwhere each nonidentity element squares to \\(e\\), and \\(ab=ba=c\\). Its left regular embedding sends\n\n\\[\\begin{aligned} e&\\longmapsto\\mathrm{id},\\\\ a&\\longmapsto(e\\ a)(b\\ c),\\\\ b&\\longmapsto(e\\ b)(a\\ c),\\\\ c&\\longmapsto(e\\ c)(a\\ b). \\end{aligned}\\]\n\nThese permutations form a subgroup of \\(S_4\\) isomorphic to the original group. Although the original group is an abelian group, its containing symmetric group is not; the embedding preserves the group's own operation without requiring the ambient group to share all its properties.\n\nAn infinite group\n\nThe additive group of integers embeds into \\(\\operatorname{Sym}(\\mathbb Z)\\) by translations:\n\n\\[k\\longmapsto T_k,\\qquad T_k(m)=k+m.\\]\n\nFor \\(k\\neq0\\), the permutation \\(T_k\\) moves every integer. This illustrates why the infinite version uses all permutations, including those with infinite support."
    },
    {
      "heading": "Actions on cosets and smaller embeddings",
      "text": "The regular representation is not necessarily the most economical permutation representation. A broader construction uses the set of left cosets of a subgroup \\(H\\leq G\\).\n\nThe rule\n\n\\[g\\cdot(xH)=(gx)H\\]\n\ndefines an action on \\(G/H\\), the set of left cosets. Here \\(G/H\\) is a set and need not be a quotient group; it is a quotient group only when \\(H\\) is normal.\n\nIf \\(H\\) has finite index \\(m=[G:H]\\), the action gives a homomorphism\n\n\\[\\varphi:G\\longrightarrow S_m.\\]\n\nIts kernel is\n\n\\[\\ker\\varphi=\\bigcap_{x\\in G}xHx^{-1},\\]\n\ncalled the core of \\(H\\) in \\(G\\). It is the largest normal subgroup of \\(G\\) contained in \\(H\\). The action is faithful precisely when this intersection is \\(\\{e\\}\\).\n\nTaking \\(H=\\{e\\}\\) recovers Cayley's regular embedding. A larger subgroup with trivial core may produce an embedding on fewer points.\n\nFor example, \\(S_3\\) has six elements, so Cayley's construction embeds it in \\(S_6\\). Its usual action on three symbols already gives a faithful representation in \\(S_3\\).\n\nFor a finite group \\(G\\), the least size of a finite set admitting a faithful action of \\(G\\) is called its minimal faithful permutation degree, often denoted \\(\\mu(G)\\). Cayley's theorem provides the bound\n\n\\[\\mu(G)\\leq |G|,\\]\n\nbut does not generally determine the minimum."
    },
    {
      "heading": "Significance and applications",
      "text": "Cayley's theorem establishes that permutation groups are universal models for abstract groups. This does not mean every group is itself a full symmetric group: it is isomorphic to a subgroup of one.\n\nThe theorem supports several important constructions:\n\n- Concrete descriptions of groups. Abstract elements can be replaced by explicit permutations while preserving multiplication.\n- Computational group theory. Finite groups represented by permutation generators can be studied through algorithms for orbits, stabilizers, and subgroup membership. The regular embedding guarantees a representation, although a smaller faithful action may be computationally preferable.\n- Linear representations. A permutation of \\(n\\) points determines a permutation matrix. Combining this construction with Cayley's theorem gives a faithful representation of every finite group of order \\(n\\) by invertible \\(n\\times n\\) matrices over any field.\n- Regular representations. In representation theory, left multiplication permutes a basis indexed by the group elements. This yields the linear regular representation, which is closely related to, but distinct from, the permutation action itself.\n\nThe theorem is a representation result rather than a classification theorem. It provides a common setting for all groups, but does not by itself classify finite groups, identify the smallest possible permutation representation, or make every question about a group computationally simple."
    },
    {
      "heading": "Historical context and terminology",
      "text": "The theorem is named after Arthur Cayley, who presented the essential result in an 1854 paper on the theory of groups. It helped connect the emerging abstract conception of a group with the earlier study of groups of substitutions, now called permutation groups.\n\nThe name should be distinguished from Cayley's formula in graph theory, which counts labeled trees, and from the Cayley–Hamilton theorem in linear algebra, which states that a square matrix satisfies its own characteristic polynomial."
    }
  ],
  "links": [
    "group-theory",
    "isomorphism",
    "symmetric-group",
    "bijective-function",
    "function-composition",
    "permutation",
    "homomorphism",
    "injective-function",
    "group-action",
    "modular-arithmetic",
    "abelian-group",
    "integer",
    "coset",
    "normal-subgroup",
    "matrix",
    "representation-theory",
    "graph-theory",
    "linear-algebra"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}