{
  "id": "cyclic-group",
  "title": "Cyclic Group",
  "lang": "en",
  "source_lang": "en",
  "summary": "A cyclic group is a group generated by one element; every such group is isomorphic either to the additive integers or to the integers modulo a positive integer.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Monogenic group"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/cyclic-group/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/cyclic-group/",
      "json": "https://aiwiki.page/zh/cyclic-group.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A cyclic group is a group in which every element is an integer power of a single element, called a generator. In multiplicative notation, a group \\(G\\) is cyclic if there exists \\(g\\in G\\) such that\n\n\\[G=\\langle g\\rangle=\\{g^k:k\\in\\mathbb Z\\}.\\]\n\nIn additive notation, the same condition is written \\(G=\\{kg:k\\in\\mathbb Z\\}\\). Cyclic groups are among the basic objects of group theory: their structure is completely determined, up to isomorphism, by their number of elements, and they describe modular addition, repeated rotations, and many periodic processes."
    },
    {
      "heading": "Definition and notation",
      "text": "For any element \\(g\\) of a group, the set \\(\\langle g\\rangle\\) of all integer powers of \\(g\\) is a subgroup, called the cyclic subgroup generated by \\(g\\). Here \\(g^0=e\\), where \\(e\\) is the identity element, and negative powers are defined using the inverse of \\(g\\). The ambient group need not itself be cyclic.\n\nThe order of an element \\(g\\) is the least positive integer \\(n\\) satisfying \\(g^n=e\\), if such an integer exists; otherwise, \\(g\\) has infinite order. Consequently:\n\n- If \\(g\\) has finite order \\(n\\), then \\(\\langle g\\rangle\\) has exactly \\(n\\) elements.\n- If \\(g\\) has infinite order, all powers \\(g^k\\), for \\(k\\in\\mathbb Z\\), are distinct.\n\nA finite cyclic group of order \\(n\\) is commonly denoted \\(C_n\\). The infinite cyclic group is sometimes denoted \\(C_\\infty\\), although \\(\\mathbb Z\\), viewed as an additive group, is more usual. The trivial group, containing only its identity element, is cyclic and is denoted \\(C_1\\).\n\nEvery cyclic group is an abelian group, because\n\n\\[g^a g^b=g^{a+b}=g^{b+a}=g^b g^a.\\]\n\nThe converse is false: an abelian group need not have a single generator."
    },
    {
      "heading": "Classification",
      "text": "There is exactly one cyclic group of each positive finite order, and exactly one infinite cyclic group, up to isomorphism.\n\nInfinite cyclic groups\n\nEvery infinite cyclic group is isomorphic to the additive group of integers:\n\n\\[G\\cong(\\mathbb Z,+).\\]\n\nIf \\(G=\\langle g\\rangle\\), the isomorphism sends \\(k\\) to \\(g^k\\). Multiplication of powers corresponds to addition of exponents.\n\nThe infinite cyclic group has precisely two generators: \\(g\\) and \\(g^{-1}\\). In \\((\\mathbb Z,+)\\), these are \\(1\\) and \\(-1\\).\n\nFinite cyclic groups\n\nEvery cyclic group of order \\(n\\) is isomorphic to\n\n\\[(\\mathbb Z/n\\mathbb Z,+),\\]\n\nthe group of residue classes modulo \\(n\\) under addition. This is the basic group underlying additive modular arithmetic.\n\nFor example, \\(C_6\\) can be represented by\n\n\\[\\{0,1,2,3,4,5\\},\\]\n\nwith addition performed modulo \\(6\\). The element \\(1\\) generates all six residues, as does \\(5\\), but \\(2\\) generates only \\(\\{0,2,4\\}\\).\n\nThe classification follows from the homomorphism\n\n\\[\\pi:\\mathbb Z\\longrightarrow G,\\qquad \\pi(k)=g^k.\\]\n\nThis map is surjective. Its kernel is either \\(\\{0\\}\\), giving the infinite case, or \\(n\\mathbb Z\\) for a unique positive integer \\(n\\), giving the finite case."
    },
    {
      "heading": "Examples",
      "text": "Rotations of a regular polygon\n\nFor \\(n\\geq 3\\), the rotations carrying a regular polygon to itself form a cyclic group of order \\(n\\), generated by rotation through \\(2\\pi/n\\) radians.\n\nThis is the rotation group, not the full symmetry group of the polygon. The full symmetry group also contains reflections and is a dihedral group.\n\nRoots of unity\n\nThe complex \\(n\\)th roots of unity form a cyclic group under multiplication:\n\n\\[\\mu_n= \\left\\{ e^{2\\pi i k/n}:k=0,\\ldots,n-1 \\right\\}.\\]\n\nA generator is \\(e^{2\\pi i/n}\\). Thus the same abstract group \\(C_n\\) can appear either as addition of residues or as multiplication of particular complex numbers.\n\nA single permutation\n\nAny permutation generates a cyclic subgroup of a symmetric group. For instance, the cycle \\((1\\,2\\,3\\,4)\\) generates a cyclic group of order \\(4\\).\n\nA permutation need not consist of one cycle to generate a cyclic subgroup. Every group element generates one, regardless of how that element is represented."
    },
    {
      "heading": "Generators and element orders",
      "text": "Let \\(G=\\langle g\\rangle\\) have finite order \\(n\\). For any integer \\(k\\),\n\n\\[\\operatorname{ord}(g^k)=\\frac{n}{\\gcd(n,k)},\\]\n\nwhere \\(\\gcd\\) denotes the greatest common divisor.\n\nTo see this, \\((g^k)^m=e\\) holds exactly when \\(n\\) divides \\(km\\). The smallest positive such \\(m\\) is \\(n/\\gcd(n,k)\\).\n\nIt follows that \\(g^k\\) generates \\(G\\) if and only if\n\n\\[\\gcd(n,k)=1.\\]\n\nThe number of generators of \\(C_n\\) is therefore \\(\\varphi(n)\\), where \\(\\varphi\\) is Euler’s totient function.\n\nMore generally, for each positive divisor \\(d\\) of \\(n\\), a cyclic group of order \\(n\\) contains exactly \\(\\varphi(d)\\) elements of order \\(d\\). Counting all elements by their orders gives the identity\n\n\\[\\sum_{d\\mid n}\\varphi(d)=n.\\]\n\nFor example, in \\(C_{12}=\\langle g\\rangle\\):\n\n- \\(g,g^5,g^7,g^{11}\\) are the four generators.\n- \\(g^3\\) and \\(g^9\\) have order \\(4\\).\n- \\(g^6\\) has order \\(2\\).\n- The identity has order \\(1\\)."
    },
    {
      "heading": "Subgroups and quotient groups",
      "text": "Every subgroup of a cyclic group is cyclic.\n\nFor an infinite cyclic group \\(\\langle g\\rangle\\), every nontrivial subgroup has the form\n\n\\[\\langle g^m\\rangle\\]\n\nfor a unique positive integer \\(m\\). In additive notation, the subgroups of \\(\\mathbb Z\\) are precisely \\(m\\mathbb Z\\), with \\(m\\geq 0\\), where \\(0\\mathbb Z=\\{0\\}\\).\n\nA standard proof chooses the least positive exponent \\(m\\) for which \\(g^m\\) lies in the subgroup. Division with remainder then shows that every exponent occurring in the subgroup is a multiple of \\(m\\).\n\nIf \\(G=\\langle g\\rangle\\) has finite order \\(n\\), then for each divisor \\(d\\) of \\(n\\), it has exactly one subgroup of order \\(d\\):\n\n\\[H_d=\\langle g^{n/d}\\rangle.\\]\n\nThere are no other subgroups. Their inclusion relations correspond exactly to divisibility:\n\n\\[H_a\\subseteq H_b \\quad\\Longleftrightarrow\\quad a\\mid b.\\]\n\nBecause cyclic groups are abelian, every subgroup is a normal subgroup, so every subgroup defines a quotient group. Every quotient of a cyclic group is cyclic, generated by the coset of a generator. In the finite case,\n\n\\[G/H_d\\cong C_{n/d}.\\]\n\nIn particular, if \\(p\\) is a prime number, \\(C_p\\) has no proper nontrivial subgroups. Conversely, every group of prime order is cyclic."
    },
    {
      "heading": "Homomorphisms and automorphisms",
      "text": "A homomorphism from a cyclic group is completely determined by the image of a generator.\n\nFor the infinite cyclic group, any choice of an element \\(h\\) in a target group defines a unique homomorphism\n\n\\[\\mathbb Z\\longrightarrow H,\\qquad k\\longmapsto h^k.\\]\n\nFor \\(C_n=\\langle g\\rangle\\), an assignment \\(g\\mapsto h\\) defines a homomorphism precisely when\n\n\\[h^n=e.\\]\n\nThus, for positive integers \\(m,n\\), the number of homomorphisms from \\(C_m\\) to \\(C_n\\) is\n\n\\[\\gcd(m,n).\\]\n\nAn automorphism is an isomorphism from a group to itself. An automorphism of \\(C_n\\) must send a generator to another generator, so it has the form\n\n\\[g\\longmapsto g^k,\\qquad \\gcd(k,n)=1.\\]\n\nUnder composition, these automorphisms correspond to multiplication of invertible residue classes:\n\n\\[\\operatorname{Aut}(C_n)\\cong(\\mathbb Z/n\\mathbb Z)^\\times.\\]\n\nThere are therefore \\(\\varphi(n)\\) automorphisms of \\(C_n\\).\n\nThe infinite cyclic group has exactly two automorphisms, corresponding in additive notation to \\(k\\mapsto k\\) and \\(k\\mapsto-k\\)."
    },
    {
      "heading": "Products and finite abelian groups",
      "text": "The direct product \\(C_m\\times C_n\\), whose elements are pairs with componentwise operations, is cyclic if and only if\n\n\\[\\gcd(m,n)=1.\\]\n\nIndeed, the order of a pair of generators is the least common multiple of \\(m\\) and \\(n\\). This equals the total group order \\(mn\\) exactly when \\(m\\) and \\(n\\) are relatively prime.\n\nThis gives the group-theoretic form of the Chinese remainder theorem:\n\n\\[C_{mn}\\cong C_m\\times C_n \\qquad\\text{when }\\gcd(m,n)=1.\\]\n\nFor example, \\(C_2\\times C_3\\cong C_6\\), whereas \\(C_2\\times C_2\\) is not cyclic: each nonidentity element has order \\(2\\), so none generates all four elements.\n\nCyclic groups are also the components in the structure theorem for finite abelian groups. Every finite abelian group can be expressed as a direct product of cyclic groups of prime-power order. Such a product need not itself be cyclic."
    },
    {
      "heading": "Applications and distinctions",
      "text": "Number theory and finite fields\n\nThe multiplicative group of nonzero elements of a finite field is cyclic. A field with \\(q\\) elements therefore has a multiplicative generator of order \\(q-1\\).\n\nFor a prime \\(p\\), this means that the nonzero residues modulo \\(p\\), under multiplication, form a cyclic group of order \\(p-1\\). A generator is called a primitive root modulo \\(p\\).\n\nBy contrast, the invertible residues modulo a composite integer need not form a cyclic group. Additive and multiplicative groups modulo the same integer are different constructions.\n\nCryptography\n\nMany cryptographic constructions use finite cyclic groups in which exponentiation is efficient but the discrete logarithm problem is believed to be difficult for suitably chosen parameters. Given \\(g\\) and \\(h=g^k\\), this problem asks for \\(k\\) modulo the order of \\(g\\).\n\nThe abstract classification of cyclic groups does not provide an efficient algorithm for finding this exponent in every representation. Computational difficulty depends on the representation and parameters, not merely on the abstract group order. Common settings include subgroups of finite-field multiplicative groups and cyclic subgroups of elliptic curve groups.\n\nFourier analysis\n\nThe discrete Fourier transform can be viewed as Fourier analysis on \\(C_n\\). Its basic functions are the complex-valued group homomorphisms\n\n\\[\\chi_j(k)=e^{2\\pi i jk/n}, \\qquad j=0,\\ldots,n-1.\\]\n\nThese encode the periodic structure of data indexed modulo \\(n\\).\n\nAlgebraic versus topological generation\n\nIn a topological setting, a distinction is necessary between being cyclic and having a dense cyclic subgroup.\n\nThe unit circle under complex multiplication is not cyclic as an abstract group: a cyclic group is at most countable, whereas the circle is uncountable. Nevertheless, if \\(\\alpha\\) is irrational, the powers of \\(e^{2\\pi i\\alpha}\\) form a dense subset of the circle.\n\nThus, a group can be topologically generated by one element without every element being an integer power of that element. The unqualified term “cyclic group” refers to exact algebraic generation."
    }
  ],
  "links": [
    "group-theory",
    "abelian-group",
    "isomorphism",
    "integer",
    "modular-arithmetic",
    "homomorphism",
    "polygon",
    "roots-of-unity",
    "complex-number",
    "permutation",
    "symmetric-group",
    "greatest-common-divisor",
    "eulers-totient-function",
    "normal-subgroup",
    "prime-number",
    "chinese-remainder-theorem",
    "finite-field",
    "elliptic-curve",
    "discrete-fourier-transform",
    "topological-space",
    "dense-set"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}