A cyclic group is what remains when an entire group can be recovered from repeatedly applying one operation to one element. This is the first place where the abstract group axioms become computational: instead of tracking arbitrary products of many elements, every element has the form $g^n$ for a single fixed $g$ and some $n \in \mathbb{Z}$. The theory asks how much structure is forced by that compression. The motivating failure is simple. A group may have many elements, but a chosen element may only move through a small part of it. In the symmetry group of a square, rotating by $90^\circ$ visits the four rotations, while a reflection visits only two symmetries. The question is not merely whether powers exist; the question is when powers of one element account for the whole group. [example: Rotations and Reflections of a Square] Let $D_8$ be the eight-element symmetry group of a square, with $r$ the rotation by $90^\circ$ and $s$ a reflection. The subscript records the order of the group; some texts write $D_4$ for this same group and reserve $D_8$ for the symmetry group of an octagon. Since four successive $90^\circ$ rotations make one full turn, the powers of $r$ are \begin{align*} r^0=e,\quad r^1=r,\quad r^2=\text{rotation by }180^\circ,\quad r^3=\text{rotation by }270^\circ,\quad r^4=e. \end{align*} Multiplying by further powers of $r$ only repeats this list, because \begin{align*} r^{k+4}=r^k r^4=r^k e=r^k \end{align*} for every $k \in \mathbb{Z}$. Hence \begin{align*} \langle r\rangle=\{e,r,r^2,r^3\}, \end{align*} so $r$ generates exactly the four rotations of the square. A reflection $s$ satisfies $s^2=e$, because applying the same reflection twice restores every point of the square to its original position. Therefore \begin{align*} s^0=e,\quad s^1=s,\quad s^2=e,\quad s^3=s^2s=es=s, \end{align*} and the powers of $s$ are only $e$ and $s$. More generally, every symmetry of a square is either a rotation $r^i$ or a reflection $r^i s$ with $i \in \{0,1,2,3\}$. The rotations have at most four distinct powers, and each reflection has exactly two distinct powers. Thus no element of $D_8$ has eight distinct powers, so no single element generates all of $D_8$. [/example] This example shows the central theme of the chapter. Cyclic groups are groups whose global structure is governed by one element, and cyclic subgroups measure the part of a larger group seen by repeatedly using one element. The resulting theory connects [groups](/page/Cambridge%20IA%20Groups), modular arithmetic, quotient groups, and the structure of finitely generated abelian groups. ## Definition The most efficient way to say that a group is controlled by one element is to require every group element to be an integral power of that element. Negative exponents are needed because groups contain inverses, and the exponent $0$ accounts for the identity. [definition: Cyclic Group] Let $(G, \cdot)$ be a group. The group $G$ is cyclic if there exists an element $g \in G$ such that \begin{align*} G = \{g^n : n \in \mathbb{Z}\}. \end{align*} [/definition] The definition asserts the existence of a special element, but calculations require us to name that element and compare different possible choices. This motivates a separate definition for the element that performs the generation, because the same cyclic group may have several such elements and many non-generating elements. [definition: Generator] Let $G$ be a group and let $g \in G$. The element $g$ is a generator of $G$ if \begin{align*} G = \{g^n : n \in \mathbb{Z}\}. \end{align*} [/definition] If $g$ is a generator, we write $G = \langle g \rangle$ in multiplicative notation. In additive groups, the same idea is written \begin{align*} G = \langle a \rangle = \{na : n \in \mathbb{Z}\}. \end{align*} The next issue is what to do when an element does not generate the whole group: its powers still form a meaningful smaller object, and we need a name for that object. [definition: Cyclic Subgroup] Let $G$ be a group and let $g \in G$. The cyclic subgroup generated by $g$ is \begin{align*} \langle g \rangle = \{g^n : n \in \mathbb{Z}\}. \end{align*} [/definition] The notation $\langle g \rangle$ would be misleading if the set of powers were not actually a subgroup: closure under multiplication and inverses is not automatic from the definition alone. There is also a minimality issue to settle, because any subgroup containing $g$ must contain every positive and negative power of $g$. These two concerns lead to the basic structural question behind the notation: does the power-set construction always produce the smallest subgroup that contains the chosen element? The next result supplies that justification, so that $\langle g \rangle$ can be used as a genuine subgroup rather than only as a suggestive set of powers. [quotetheorem:8235] The theorem explains why cyclic subgroups are unavoidable in group theory: every element carries a canonical subgroup with it. To understand the size and shape of that subgroup, the next question is when the sequence of powers $e,g,g^2,g^3,\ldots$ first returns to the identity. [definition: Order of an Element] Let $G$ be a group and let $g \in G$. The order of $g$, denoted $\operatorname{ord}(g)$, is the least positive integer $n \in \mathbb{N}$ such that $g^n=e$, if such an integer exists. If no such integer exists, then $\operatorname{ord}(g)=\infty$. [/definition] At this point there are two measurements that look related but have not yet been connected: the period of the sequence $e,g,g^2,\ldots$, and the number of elements actually reached by that sequence. Without a theorem identifying them, the notation $\operatorname{ord}(g)$ would describe only a return time, not the size of the subgroup $\langle g \rangle$. The next result is the bridge that lets element orders detect subgroup sizes inside an arbitrary group. [quotetheorem:8236] This theorem turns the periodicity of powers into a subgroup invariant. With that connection in place, cyclic behaviour separates into finite and infinite cases. We need a name for cyclic groups whose cycle closes after finitely many steps, because those are the groups governed by modular arithmetic and divisor counting. [definition: Finite Cyclic Group] A cyclic group $G$ is finite cyclic if $G$ is a finite set. [/definition] The finite definition covers clock-like behaviour, but it excludes the other fundamental model: a generator that never returns to the identity. We need a separate term for this non-periodic case because its arithmetic is ordinary integer arithmetic rather than modular arithmetic. [definition: Infinite Cyclic Group] A cyclic group $G$ is infinite cyclic if $G$ is an infinite set. [/definition] Infinite cyclic groups behave like walking along the integer line. This comparison is not only an analogy; it becomes an isomorphism theorem after we examine the basic example. [example: The Additive Group of Integers] The additive group $(\mathbb{Z},+)$ is cyclic because $1$ generates every integer by repeated addition: for each $m \in \mathbb{Z}$, \begin{align*} m=m\cdot 1. \end{align*} Thus $\mathbb{Z}=\langle 1\rangle$. The element $-1$ also generates $\mathbb{Z}$, since for every $m \in \mathbb{Z}$, \begin{align*} m=(-m)(-1), \end{align*} and $-m \in \mathbb{Z}$. No other integer generates $\mathbb{Z}$. If $a=0$, then every multiple of $a$ is zero: \begin{align*} n a=n\cdot 0=0 \end{align*} for all $n \in \mathbb{Z}$, so $\langle 0\rangle=\{0\} \ne \mathbb{Z}$. If $|a|\ge 2$, then every element of $\langle a\rangle$ has the form $na$ with $n \in \mathbb{Z}$, so it is divisible by $a$. If $1 \in \langle a\rangle$, then $1=na$ for some $n \in \mathbb{Z}$, which would imply $a \mid 1$. The only integer divisors of $1$ are $1$ and $-1$, contradicting $|a|\ge 2$. Hence the only generators of $(\mathbb{Z},+)$ are $1$ and $-1$. [/example] The example suggests that an infinite cyclic group has no structure beyond the choice of a forward direction and a backward direction. The point that still needs proof is that distinct exponents really give distinct group elements; otherwise the exponent map from $\mathbb{Z}$ would collapse information and the group would be finite instead. [quotetheorem:8237] The finite case needs a different model because exponents repeat. Modular arithmetic provides exactly the language for remembering an exponent only up to a fixed period. [example: The Additive Group $\mathbb{Z}/n\mathbb{Z}$] Let $n \in \mathbb{N}$ with $n \ge 1$. In the additive group $\mathbb{Z}/n\mathbb{Z}$, we show that $\bar{1}$ generates the whole group. Every residue class modulo $n$ has a representative in $\{0,1,\ldots,n-1\}$, so the elements are \begin{align*} \bar{0},\bar{1},\bar{2},\ldots,\overline{n-1}. \end{align*} For each $j \in \{0,1,\ldots,n-1\}$, repeated addition of $\bar{1}$ gives \begin{align*} j\bar{1}=\underbrace{\bar{1}+\bar{1}+\cdots+\bar{1}}_{j\text{ terms}}=\overline{1+1+\cdots+1}=\bar{j}. \end{align*} Thus every element of $\mathbb{Z}/n\mathbb{Z}$ lies in $\langle \bar{1}\rangle$, and the reverse inclusion is automatic because $\langle \bar{1}\rangle$ consists of elements of $\mathbb{Z}/n\mathbb{Z}$. Hence \begin{align*} \mathbb{Z}/n\mathbb{Z}=\langle \bar{1}\rangle. \end{align*} The return to the identity occurs after $n$ additions because \begin{align*} n\bar{1}=\overline{n}=\bar{0}, \end{align*} since $n \equiv 0 \pmod n$. Therefore $\mathbb{Z}/n\mathbb{Z}$ is a finite cyclic group whose generator $\bar{1}$ moves one residue class forward at each step. [/example] This example raises the finite classification problem: if a generator returns to the identity after $n$ steps, is the group always just modular arithmetic modulo $n$ in disguise? The answer is yes. If $G=\langle g\rangle$ and $|G|=n$, define a map $\psi:\mathbb{Z}/n\mathbb{Z}\to G$ by \begin{align*} \psi(\bar{k})=g^k. \end{align*} The relation $g^n=e$ makes this map well defined, the exponent law makes it a homomorphism, and the fact that $g$ generates $G$ makes it surjective. Since both groups have $n$ elements, $\psi$ is an isomorphism. Thus every finite cyclic group of order $n$ is a finite clock, just as every infinite cyclic group is the integer line. ## Powers, Orders, and Periods ### Equality of Powers Once a group is generated by one element, most questions become questions about exponents. Which powers are equal? Which powers generate the same group? How large is the subgroup generated by a power? The order of the generator translates these into arithmetic. The first conversion is between equality of powers and divisibility. In an infinite cyclic group, equal powers have equal exponents. In a finite cyclic group, equal powers have exponents congruent modulo the order. [quotetheorem:8238] This theorem is the computational engine behind cyclic groups. It lets us replace group equations by arithmetic equations in $\mathbb{Z}$ or $\mathbb{Z}/n\mathbb{Z}$. The next natural calculation asks what happens when we use $g^k$ as the step instead of $g$ itself. ### Orders of Powers A generator moves around the cycle one step at a time, while $g^k$ moves in jumps of size $k$. If those jumps share a common divisor with the cycle length, the motion returns to the identity sooner, so we need an exact formula for the shortened period. [quotetheorem:8239] The formula explains why not every power of a generator is itself a generator. A step size sharing a common divisor with $n$ skips part of the cycle, while a coprime step eventually visits every position. [example: Powers in $\mathbb{Z}/12\mathbb{Z}$] In the additive cyclic group $\mathbb{Z}/12\mathbb{Z}$, the element $\bar{1}$ generates the whole group because each residue class is an integer multiple of $\bar{1}$: \begin{align*} j\bar{1}=\bar{j} \end{align*} for $j \in \{0,1,\ldots,11\}$. For $\bar{4}$, the successive multiples are \begin{align*} 0\bar{4}=\bar{0},\quad 1\bar{4}=\bar{4},\quad 2\bar{4}=\bar{8},\quad 3\bar{4}=\overline{12}=\bar{0}. \end{align*} After this the list repeats, since adding another $\bar{4}$ cycles through the same residues: \begin{align*} 4\bar{4}=\bar{0}+\bar{4}=\bar{4},\quad 5\bar{4}=\bar{4}+\bar{4}=\bar{8}. \end{align*} Hence \begin{align*} \langle \bar{4} \rangle=\{\bar{0},\bar{4},\bar{8}\}. \end{align*} This subgroup has $3$ elements, and the order formula gives the same value because \begin{align*} \gcd(12,4)=4 \end{align*} and \begin{align*} \frac{12}{\gcd(12,4)}=\frac{12}{4}=3. \end{align*} For $\bar{5}$, the multiples are \begin{align*} 0\bar{5}=\bar{0},\quad 1\bar{5}=\bar{5},\quad 2\bar{5}=\overline{10},\quad 3\bar{5}=\overline{15}=\bar{3},\quad 4\bar{5}=\overline{20}=\bar{8},\quad 5\bar{5}=\overline{25}=\bar{1}. \end{align*} Continuing, \begin{align*} 6\bar{5}=\overline{30}=\bar{6},\quad 7\bar{5}=\overline{35}=\overline{11},\quad 8\bar{5}=\overline{40}=\bar{4},\quad 9\bar{5}=\overline{45}=\bar{9},\quad 10\bar{5}=\overline{50}=\bar{2},\quad 11\bar{5}=\overline{55}=\bar{7}. \end{align*} These are all twelve residue classes modulo $12$, so \begin{align*} \langle \bar{5}\rangle=\mathbb{Z}/12\mathbb{Z}. \end{align*} This agrees with the generator criterion, since $\gcd(12,5)=1$: a step of size $5$ visits every residue class before returning to $\bar{0}$. [/example] The example shows the exact obstruction to being a generator: the step size must not share a factor with the cycle length. If a common divisor is present, repeated steps remain trapped in a smaller congruence pattern; if no common divisor is present, Bezout's identity lets those steps recover a single-step generator. [quotetheorem:8240] Counting generators now becomes a number-theoretic problem. The number of possible step sizes modulo $n$ that are coprime to $n$ is Euler's totient $\varphi(n)$, so the generator criterion immediately gives a counting theorem. [quotetheorem:1701] This count is often the fastest way to detect whether a proposed list of generators is plausible. The prime-order case is especially important because the coprimality condition becomes automatic for every nonzero exponent. [example: Prime Order Cycles] Let $p$ be prime and let $G=\langle g\rangle$ have order $p$. We show that every $h \in G$ with $h\ne e$ generates $G$. Since $G=\langle g\rangle$, there is some $m \in \mathbb{Z}$ such that $h=g^m$. Write $m=qp+k$ with $q \in \mathbb{Z}$ and $k \in \{0,1,\ldots,p-1\}$. Since $g$ has order $p$, we have $g^p=e$, so \begin{align*} h=g^m=g^{qp+k}=g^{qp}g^k=(g^p)^qg^k=e^qg^k=g^k. \end{align*} If $k=0$, then $h=g^0=e$, contradicting $h\ne e$. Hence $k \in \{1,\ldots,p-1\}$. Now $\gcd(k,p)=1$: any common divisor of $k$ and $p$ must divide the prime $p$, so it is either $1$ or $p$, but $p \nmid k$ because $1\le k\le p-1$. By the generator criterion for finite cyclic groups, stated in *[Generators of a Finite Cyclic Group](/theorems/8240)*, the element $g^k$ is a generator of $G$. Since $h=g^k$, the element $h$ generates $G$. Thus in a cyclic group of prime order, every non-identity element is a generator. [/example] The example used cyclicity as a hypothesis: once a group is already known to be a $p$-cycle, every non-identity element generates it. The more useful question is whether the hypothesis is needed at all. For a group with prime order, any non-identity element generates a cyclic subgroup whose size is both greater than $1$ and a divisor of $p$; there is no intermediate size available. This turns the numerical condition $|G|=p$ into a structural conclusion. [quotetheorem:784] This special case is one reason cyclic groups are unavoidable in finite group theory. Any element of prime order produces a cyclic subgroup with no intermediate subgroup structure. ## Subgroups of Cyclic Groups ### Divisors and Subgroup Sizes Subgroups of arbitrary groups can be complicated. Subgroups of cyclic groups are rigid: they are cyclic, and in the finite case they are controlled by divisors. This is the first structural theorem that makes cyclic groups more than examples. To state the finite classification cleanly, we isolate the standard subgroup attached to a divisor. If a cycle has length $n$, then stepping by $n/d$ should produce exactly $d$ positions, so the divisor records the intended subgroup size. [definition: Divisor Subgroup of a Finite Cyclic Group] Let $G=\langle g \rangle$ be a cyclic group of order $n$, and let $d \in \mathbb{N}$ satisfy $d \ge 1$ and $d \mid n$. The divisor subgroup associated to $d$ is \begin{align*} G_d = \langle g^{n/d} \rangle. \end{align*} [/definition] The definition supplies candidates for all finite subgroups of a cyclic group, but it does not yet say there are no others. A subgroup might appear to contain many unrelated powers of $g$; the key obstruction is whether its smallest positive exponent already forces every other exponent that occurs in the subgroup. [quotetheorem:8241] The theorem rules out complicated subgroup behaviour before any case analysis begins. In the finite case we can ask a sharper question: for each possible subgroup order, how many subgroups have that order, and which one is it? [quotetheorem:8242] This uniqueness is special. A non-cyclic group may have many different subgroups of the same order; in a cyclic group, the order determines the subgroup. The cleanest way to see the whole pattern is to compute a concrete subgroup lattice. [example: The Subgroup Lattice of $\mathbb{Z}/12\mathbb{Z}$] In $\mathbb{Z}/12\mathbb{Z}$, the divisor $d$ corresponds to the subgroup generated by $\overline{12/d}$. The divisors of $12$ are $1,2,3,4,6,12$, so the six candidates are \begin{align*}\langle \overline{12}\rangle,\quad \langle \bar{6}\rangle,\quad \langle \bar{4}\rangle,\quad \langle \bar{3}\rangle,\quad \langle \bar{2}\rangle,\quad \langle \bar{1}\rangle.\end{align*} Since $\overline{12}=\bar{0}$, the first subgroup is \begin{align*}\langle \overline{12}\rangle=\langle \bar{0}\rangle=\{\bar{0}\}.\end{align*} For the others, list successive multiples until the first return to $\bar{0}$: \begin{align*}\langle \bar{6}\rangle=\{\bar{0},\bar{6}\},\quad 2\bar{6}=\overline{12}=\bar{0}.\end{align*} \begin{align*}\langle \bar{4}\rangle=\{\bar{0},\bar{4},\bar{8}\},\quad 3\bar{4}=\overline{12}=\bar{0}.\end{align*} \begin{align*}\langle \bar{3}\rangle=\{\bar{0},\bar{3},\bar{6},\bar{9}\},\quad 4\bar{3}=\overline{12}=\bar{0}.\end{align*} \begin{align*}\langle \bar{2}\rangle=\{\bar{0},\bar{2},\bar{4},\bar{6},\bar{8},\overline{10}\},\quad 6\bar{2}=\overline{12}=\bar{0}.\end{align*} \begin{align*}\langle \bar{1}\rangle=\{\bar{0},\bar{1},\bar{2},\bar{3},\bar{4},\bar{5},\bar{6},\bar{7},\bar{8},\bar{9},\overline{10},\overline{11}\}=\mathbb{Z}/12\mathbb{Z}.\end{align*} Thus the subgroup orders are respectively $1,2,3,4,6,12$. The inclusion relation follows from these explicit lists. For instance, \begin{align*}\langle \bar{4}\rangle=\{\bar{0},\bar{4},\bar{8}\}\subseteq \{\bar{0},\bar{2},\bar{4},\bar{6},\bar{8},\overline{10}\}=\langle \bar{2}\rangle,\end{align*} matching $3\mid 6$. In general, if $d\mid e$ and $e=td$, then \begin{align*}\overline{12/d}=\overline{t(12/e)}=t\,\overline{12/e},\end{align*} so every multiple of $\overline{12/d}$ is also a multiple of $\overline{12/e}$. Hence the subgroup of order $d$ is contained in the subgroup of order $e$ whenever $d\mid e$. Conversely, if a subgroup of order $d$ is contained in a subgroup of order $e$, its cosets inside the larger subgroup all have $d$ elements and partition the larger subgroup, so $d\mid e$. Thus the subgroup lattice follows exactly the divisibility lattice of $1,2,3,4,6,12$. [/example] The infinite cyclic case has no finite cycle length, so divisors of $n$ are replaced by positive step sizes along the integer line. The next theorem is the group-theoretic version of the fact that every subgroup of $\mathbb{Z}$ is $m\mathbb{Z}$. ### Infinite Cyclic Subgroups In an infinite cyclic group, a non-identity subgroup cannot close up after finitely many steps. The only remaining invariant is the smallest positive exponent that appears in the subgroup. [quotetheorem:766] This theorem is one of the cleanest examples of how isomorphism turns an algebraic question into arithmetic. It also prepares the quotient computations, where imposing $g^m=e$ turns an infinite cyclic group into a finite one. ## Quotients and Homomorphisms ### Abelian Structure Cyclic groups are stable under the basic constructions that identify elements or transport structure. If a group is generated by one element, then any homomorphic image is generated by the image of that element. Quotients are therefore cyclic, and this makes cyclic groups a natural testing ground for the [first isomorphism theorem](/theorems/791). Before studying quotients, we need one structural fact that makes quotients of cyclic groups especially simple. Powers of the same element commute, so a cyclic group cannot contain non-commuting behaviour. [quotetheorem:8243] This theorem is the first warning about the limits of cyclicity. Any non-abelian group, such as a non-abelian dihedral group, cannot be cyclic. The next question is whether cyclicity survives when a homomorphism sends the group into a new group. ### Images and Quotients A homomorphism is determined by where it sends a generator, provided the source is cyclic. The generator may collapse to the identity, but the image still has no elements beyond powers of that image. [quotetheorem:8244] Quotients are a special case of homomorphic images, but the finite cyclic case has a precise numerical form. If a subgroup of size $d$ is collapsed to the identity inside a cycle of size $n$, the quotient should have \begin{align*} \frac{n}{d} \end{align*} cosets; the next theorem records the generator and the order. [quotetheorem:8245] The quotient theorem says that cyclic structure survives collapsing a regularly spaced subgroup. In modular arithmetic, this is the familiar passage from congruence modulo $n$ to a coarser congruence, and the following example shows the cosets explicitly. [example: A Quotient of $\mathbb{Z}/12\mathbb{Z}$] Let $G=\mathbb{Z}/12\mathbb{Z}$ and let $H=\langle \bar{4}\rangle$. The multiples of $\bar{4}$ are \begin{align*}0\bar{4}=\bar{0},\quad 1\bar{4}=\bar{4},\quad 2\bar{4}=\bar{8},\quad 3\bar{4}=\overline{12}=\bar{0}.\end{align*} After this the list repeats because $(k+3)\bar{4}=k\bar{4}+3\bar{4}=k\bar{4}+\bar{0}=k\bar{4}$. Hence \begin{align*}H=\{\bar{0},\bar{4},\bar{8}\},\end{align*} and these three elements are distinct modulo $12$, since none of $4$, $8$, or $8-4=4$ is divisible by $12$. Thus $|H|=3$. The cosets represented by $\bar{0},\bar{1},\bar{2},\bar{3}$ are \begin{align*}H=\{\bar{0},\bar{4},\bar{8}\},\quad \bar{1}+H=\{\bar{1},\bar{5},\bar{9}\},\quad \bar{2}+H=\{\bar{2},\bar{6},\overline{10}\},\quad \bar{3}+H=\{\bar{3},\bar{7},\overline{11}\}.\end{align*} Together these four sets contain all twelve residue classes modulo $12$, and no residue class appears in two of them. Therefore the quotient $G/H$ has exactly the four elements \begin{align*}H,\quad \bar{1}+H,\quad \bar{2}+H,\quad \bar{3}+H.\end{align*} Now compute the multiples of $\bar{1}+H$ in the quotient: \begin{align*}0(\bar{1}+H)=H,\quad 1(\bar{1}+H)=\bar{1}+H,\quad 2(\bar{1}+H)=\bar{2}+H,\quad 3(\bar{1}+H)=\bar{3}+H.\end{align*} Also, \begin{align*}4(\bar{1}+H)=\bar{4}+H=H,\end{align*} because $\bar{4}\in H$. Thus $\bar{1}+H$ visits every coset before returning to the identity coset $H$, so $G/H$ is cyclic of order $4$ generated by $\bar{1}+H$. [/example] The finite quotient computation prompts the corresponding infinite question: what happens when the infinite cyclic group is forced to identify $g^m$ with the identity? The quotient must collapse exponents that differ by multiples of $m$, but it should not identify any further powers if the quotient is to model arithmetic modulo $m$ exactly. [quotetheorem:8246] This result is the algebraic origin of modular arithmetic: start with the infinite counter $\mathbb{Z}$ and declare that $m$ steps return to zero. ## Products and Failure Modes ### Products of Cycles Cyclic groups are simple, but products of cyclic groups need not be cyclic. This is a useful failure mode because it shows that having cyclic factors is not enough; the periods must interact correctly. The product of two cyclic groups is generated by a pair only when the two cycles return to the identity at compatible times. The key condition is coprimality of the two orders: coprime clocks combine into one longer clock, while non-coprime clocks synchronize too soon. [quotetheorem:8247] This theorem explains both the success and the failure of product constructions. The contrast is sharpest in small examples, where the presence or absence of an element of full order decides cyclicity. [example: A Product That Is Cyclic and One That Is Not] In the additive product $\mathbb{Z}/3\mathbb{Z} \times \mathbb{Z}/4\mathbb{Z}$, compute the multiples of $(\bar{1},\bar{1})$: \begin{align*} 0(\bar{1},\bar{1})=(\bar{0},\bar{0}),\quad 1(\bar{1},\bar{1})=(\bar{1},\bar{1}),\quad 2(\bar{1},\bar{1})=(\bar{2},\bar{2}),\quad 3(\bar{1},\bar{1})=(\bar{0},\bar{3}),\quad 4(\bar{1},\bar{1})=(\bar{1},\bar{0}),\quad 5(\bar{1},\bar{1})=(\bar{2},\bar{1}) \end{align*} and \begin{align*} 6(\bar{1},\bar{1})=(\bar{0},\bar{2}),\quad 7(\bar{1},\bar{1})=(\bar{1},\bar{3}),\quad 8(\bar{1},\bar{1})=(\bar{2},\bar{0}),\quad 9(\bar{1},\bar{1})=(\bar{0},\bar{1}),\quad 10(\bar{1},\bar{1})=(\bar{1},\bar{2}),\quad 11(\bar{1},\bar{1})=(\bar{2},\bar{3}). \end{align*} If $m(\bar{1},\bar{1})=n(\bar{1},\bar{1})$, then $m\equiv n \pmod 3$ and $m\equiv n \pmod 4$. Since $\gcd(3,4)=1$, this gives $m\equiv n \pmod {12}$. Thus the twelve multiples listed above are distinct for $0\le m\le 11$. Also \begin{align*} 12(\bar{1},\bar{1})=(\overline{12},\overline{12})=(\bar{0},\bar{0}), \end{align*} so $(\bar{1},\bar{1})$ has order $12$. The product has $3\cdot 4=12$ elements, so these twelve multiples are all of $\mathbb{Z}/3\mathbb{Z} \times \mathbb{Z}/4\mathbb{Z}$. Hence the product is cyclic, generated by $(\bar{1},\bar{1})$. By contrast, the elements of $\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}$ are \begin{align*} (\bar{0},\bar{0}),\quad (\bar{1},\bar{0}),\quad (\bar{0},\bar{1}),\quad (\bar{1},\bar{1}). \end{align*} The non-identity elements all return to the identity after two additions: \begin{align*} 2(\bar{1},\bar{0})=(\bar{2},\bar{0})=(\bar{0},\bar{0}),\quad 2(\bar{0},\bar{1})=(\bar{0},\bar{2})=(\bar{0},\bar{0}),\quad 2(\bar{1},\bar{1})=(\bar{2},\bar{2})=(\bar{0},\bar{0}). \end{align*} None of them is the identity after one addition, so each non-identity element has order $2$. If this group were cyclic of order $4$, some element would have to produce four distinct multiples before returning to the identity, hence would have order $4$. No such element exists, so $\mathbb{Z}/2\mathbb{Z} \times \mathbb{Z}/2\mathbb{Z}$ is not cyclic. [/example] A second failure mode comes from divisibility. Some abelian groups have many cyclic subgroups but no single element can generate the whole group, so cyclicity is much stronger than commutativity. ### Beyond One Generator The additive group of rational numbers is a useful test case because every element generates an infinite cyclic subgroup unless it is zero, but denominators can always be divided further. This prevents any one rational number from generating all of $\mathbb{Q}$. [example: The Additive Group of Rational Numbers Is Not Cyclic] The group $(\mathbb{Q},+)$ is not cyclic. Suppose first that $a=0$. Then every integer multiple of $a$ is zero: \begin{align*} na=n\cdot 0=0 \end{align*} for every $n \in \mathbb{Z}$, so $\langle 0\rangle=\{0\}\ne \mathbb{Q}$. Now let $a\in \mathbb{Q}$ with $a\ne 0$, and write $a=p/q$ with $p,q\in \mathbb{Z}$, $q\ne 0$, and $p\ne 0$. The rational number $a/2$ belongs to $\mathbb{Q}$. If $a/2$ were in $\langle a\rangle$, then there would be some $n\in \mathbb{Z}$ such that \begin{align*} \frac{a}{2}=na. \end{align*} Multiplying both sides by $2$ gives \begin{align*} a=2na. \end{align*} Subtracting $a$ from both sides gives \begin{align*} 0=2na-a=(2n-1)a. \end{align*} Substituting $a=p/q$ gives \begin{align*} 0=(2n-1)\frac{p}{q}. \end{align*} Multiplying by $q$ gives \begin{align*} 0=(2n-1)p. \end{align*} Since $p\ne 0$, this forces $2n-1=0$, hence $n=1/2$, which is impossible for $n\in \mathbb{Z}$. Thus $a/2\notin \langle a\rangle$ whenever $a\ne 0$. Every possible generator $a\in\mathbb{Q}$ is therefore excluded: $a=0$ generates only $\{0\}$, while $a\ne 0$ fails to generate the rational number $a/2$. Hence $(\mathbb{Q},+)$ is not cyclic. [/example] This example separates being abelian from being cyclic. To describe the first step beyond cyclic groups, we need a term for groups built from finitely many generators rather than one generator. [definition: Finitely Generated Group] Let $G$ be a group. The group $G$ is finitely generated if there exist elements $g_1,\ldots,g_r \in G$ such that every element of $G$ can be written as a finite product of elements from \begin{align*} \{g_1,\ldots,g_r,g_1^{-1},\ldots,g_r^{-1}\}. \end{align*} [/definition] This definition gives a hierarchy. Cyclic groups are generated by one element; finitely generated groups are generated by finitely many elements; arbitrary groups may require infinitely many generators. The first non-cyclic examples often appear just one step up this hierarchy. [remark: Cyclic Versus Finitely Generated] Every cyclic group is finitely generated, but the converse fails. The group $\mathbb{Z} \times \mathbb{Z}$ is generated by $(1,0)$ and $(0,1)$ under addition, but it is not cyclic because every cyclic subgroup lies on an integer line through one vector. [/remark] The failure of $\mathbb{Z} \times \mathbb{Z}$ to be cyclic foreshadows the structure theorem for finitely generated abelian groups, where cyclic groups become the building blocks rather than the whole object. ## Cyclic Groups in Group Actions Cyclic groups often enter mathematics through iteration. Applying the same symmetry, map, or operation repeatedly is exactly an action of a cyclic group. Finite cyclic groups model periodic behaviour; infinite cyclic groups model reversible discrete time. To make this precise, we isolate the orbit produced by repeatedly applying one group element. This is the action-theoretic version of a cyclic subgroup, and it records the part of the set visible from a starting point under repeated motion. [definition: Orbit of an Element Under a Cyclic Action] Let $G$ act on a set $X$, let $g \in G$, and let $x \in X$. The orbit of $x$ under the cyclic subgroup generated by $g$ is \begin{align*} \langle g \rangle \cdot x = \{g^n \cdot x : n \in \mathbb{Z}\}. \end{align*} [/definition] This orbit records everything that can happen to $x$ under repeated application of one symmetry. If $g$ has finite order, repeated motion in the group returns after that many steps, but a particular point may return earlier because some nontrivial power of $g$ fixes it. The unresolved question is how the orbit length is constrained by the order of the acting element. [quotetheorem:8248] The theorem explains why finite cyclic actions decompose a set into cycles whose lengths divide the group order. This is the algebra behind periodic rotations, necklaces, and many counting arguments. [example: A Rotation Acting on Vertices] Label the vertices of the square $v_0,v_1,v_2,v_3$ in cyclic order, so that the $90^\circ$ rotation $r$ sends $v_i$ to $v_{i+1}$, with indices taken modulo $4$. Then \begin{align*} r^0\cdot v_0=v_0,\quad r^1\cdot v_0=v_1,\quad r^2\cdot v_0=v_2,\quad r^3\cdot v_0=v_3,\quad r^4\cdot v_0=v_0. \end{align*} The four vertices $v_0,v_1,v_2,v_3$ are distinct, so \begin{align*} \langle r\rangle\cdot v_0=\{v_0,v_1,v_2,v_3\}. \end{align*} The same calculation with $v_i$ in place of $v_0$ just starts the list at a different vertex, so the orbit of every vertex has size $4$. Now let $D_0=\{v_0,v_2\}$ and $D_1=\{v_1,v_3\}$ be the two diagonals of the square. The rotation $r$ sends endpoints to endpoints, so \begin{align*} r\cdot D_0=\{r\cdot v_0,r\cdot v_2\}=\{v_1,v_3\}=D_1. \end{align*} Applying $r$ again gives \begin{align*} r^2\cdot D_0=r\cdot D_1=\{r\cdot v_1,r\cdot v_3\}=\{v_2,v_0\}=D_0. \end{align*} Hence \begin{align*} \langle r\rangle\cdot D_0=\{D_0,D_1\}, \end{align*} and the orbit of each diagonal has size $2$. Thus the same cyclic [group action](/page/Group%20Action) has vertex-orbits of size $4$ and diagonal-orbits of size $2$, with both orbit sizes dividing the order $4$ of the rotation group. [/example] Cyclic actions are therefore a bridge between algebra and combinatorics. They translate repeated motion into subgroup and quotient data. ## Beyond and Connected Topics Cyclic groups are the first structural class of groups, but their main role is as a building block. In finite group theory, every element generates a cyclic subgroup, and many arguments begin by studying possible element orders. The class equation, [Cauchy's theorem](/theorems/797), and Sylow theory all use cyclic subgroups to detect prime divisors of group orders. In abelian group theory, cyclic groups become components in decompositions. The structure theorem for finitely generated abelian groups says that every finitely generated abelian group is assembled from copies of $\mathbb{Z}$ and finite cyclic groups. This is the natural continuation after learning that $\mathbb{Z} \times \mathbb{Z}$ is finitely generated but not cyclic. In ring and module theory, cyclic modules generalize cyclic groups. An $R$-module generated by one element is a quotient of $R$, just as a cyclic group is a quotient of $\mathbb{Z}$. This viewpoint is developed further in [Cambridge IB Groups, Rings and Modules](/page/Cambridge%20IB%20Groups%2C%20Rings%20and%20Modules) and connects naturally to presentations, ideals, and quotient modules. In homological algebra, cyclic objects often appear as the simplest test modules or quotient modules. Resolutions of cyclic modules over rings are a first source of computable examples for $\operatorname{Tor}$ and $\operatorname{Ext}$, linking this chapter to [Homological Algebra I: Complexes and Resolutions](/page/Homological%20Algebra%20I%3A%20Complexes%20and%20Resolutions). ## References Androma, [Cambridge IA Groups](/page/Cambridge%20IA%20Groups). Androma, [Cambridge IB Groups, Rings and Modules](/page/Cambridge%20IB%20Groups%2C%20Rings%20and%20Modules). Androma, [Cambridge IB Linear Algebra](/page/Cambridge%20IB%20Linear%20Algebra). Androma, [Homological Algebra I: Complexes and Resolutions](/page/Homological%20Algebra%20I%3A%20Complexes%20and%20Resolutions). Dummit and Foote, *Abstract Algebra* (2004). Fraleigh, *A First Course in Abstract Algebra* (2003). Lang, *Algebra* (2002).