6. Abstract Algebra

Cyclic group

A cyclic group is a group that can be generated by a single element, meaning every element in the group is an integral power of that specific generator.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade

📖 Topic progress

○ Mark as complete

Definition and statement

Fundamental Structure Theorem for Cyclic Groups

A group $G$ is called a cyclic group if there exists an element $a \in G$ such that $G = \langle a \rangle = \{a^n \mid n \in \mathbb{Z}\}$. Furthermore, every cyclic group is isomorphic either to the additive group of integers $(\mathbb{Z}, +)$ (if infinite) or to the additive group of integers modulo $n$ $(\mathbb{Z}_n, +_n)$ (if finite of order $n$).

📐 Geometric Interpretation

Geometrically, a finite cyclic group of order $n$ represents the rotational symmetries of a regular $n$-sided polygon centered at the origin in the Euclidean plane $\mathbb{R}^2$.

⚙️ Algebraic & Structural Meaning

Cyclic groups are the simplest and most completely understood algebraic structures in group theory. Every cyclic group is abelian, and all its subgroups are also cyclic.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition	Domain / Interval	Necessity	What Fails If Condition Dropped
Single Generator Existence	`Entire group $G$`	Strictly Mandatory	If no single element generates the entire group, the group is non-cyclic (e.g., the Klein 4-group $V_4$).fails to satisfy cyclic criteria.
Closure and Associativity under group operation	`Binary operation on $G$`	Strictly Mandatory	Fails to form a valid group structure, making the concept of a cyclic group inapplicable.
Finiteness vs. Infiniteness distinction	`Order of the group $\|G\|`	Essential for isomorphism classification	Confusing finite cyclic groups with infinite ones leads to incorrect deductions about element orders and subgroup counts.

Useful results and shortcuts

Use these identities and results when their conditions apply:

Number of Generators of a Finite Cyclic Group

$$ \text{Number of generators of } \mathbb{Z}_n \text{ or } G \text{ of order } n = \phi(n) $$

Rule: To find how many generators a cyclic group of order $n$ has, simply compute Euler's totient function $\phi(n)$.

Number of Elements of Order $d$ in $\mathbb{Z}_n$

$$ \text{Number of elements of order } d \text{ in a cyclic group of order } n \text{ (where } d \mid n \text{)} = \phi(d) $$

Rule: If $d$ divides $n$, a cyclic group of order $n$ has exactly $\phi(d)$ elements of order $d$. If $d$ does not divide $n$, there are 0 elements of order $d$.

Application: Frequent in DSSSB and PGT Mathematics for finding exact counts of specific order elements.

Number of Subgroups of a Cyclic Group

$$ \text{Total number of subgroups of } \mathbb{Z}_n = \tau(n) \text{ (the number of positive divisors of } n\text{)} $$

Rule: For every positive divisor $d$ of $n$, a cyclic group of order $n$ has a unique subgroup of order $d$.

Generator Condition for $\mathbb{Z}_n$

$$ \gcd(k, n) = 1 \implies \langle \bar{k} \rangle = \mathbb{Z}_n $$

Rule: An element $\bar{k}$ generates $\mathbb{Z}_n$ if and only if $k$ is coprime to $n$.

Application: Used for rapid identification of generators among given options.

Order of $a^k$ in a Cyclic Group

$$ o(a^k) = \frac{n}{\gcd(k, n)} \text{ where } o(a) = n $$

Rule: To find the order of a power of an element in a cyclic group, divide the group order by the greatest common divisor of the exponent and the group order.

Rapid Elimination via Subgroup Structure

$$ \text{Every subgroup of a cyclic group is cyclic.} $$

Rule: Instantly eliminate any multiple-choice option claiming a cyclic group contains a non-cyclic subgroup.

Common errors and counterexamples

These examples show how a conclusion can fail when a condition is missing:

⚠️ COMMON ERROR #01

Abelian vs. Cyclic Confusion

Common Pitfall: Assuming every abelian group is cyclic because every cyclic group is abelian.

Counterexample: Klein 4-group $V_4$ or direct product $\mathbb{Z}_2 \times \mathbb{Z}_2$

Why it fails: $V_4$ is abelian (every element commutes), but its non-identity elements all have order 2, so no single element generates the group of order 4.

🛡️ Exam Defense: Remember: Cyclic $\implies$ Abelian, but Abelian $\not\implies$ Cyclic.

⚠️ COMMON ERROR #02

Misinterpreting Subgroup Uniqueness

Common Pitfall: Believing that non-cyclic groups cannot have cyclic subgroups, or that cyclic groups have multiple subgroups of the same order.

Counterexample: In $\mathbb{Z}_6$, subgroups of order 2 ($=\langle 3 \srangle$) and order 3 ($=\langle 2 \srangle$) are unique.

Why it fails: A cyclic group of order $n$ has a *unique* subgroup for each divisor $d$ of $n$, unlike non-cyclic groups which may have multiple subgroups of the same order (e.g., Sylow subgroups).

🛡️ Exam Defense: For cyclic groups, divisor $\implies$ unique subgroup.

Comparison

Concept / Theorem	Hypotheses / Assumptions	Key Formula / Outcome	Geometric Meaning	Exam Identification Clue
Infinite Cyclic Group	Isomorphic to $(\mathbb{Z}, +)$	Infinitely many elements, 2 generators ($\pm 1$)	Translations along a discrete line	Mentions integers under addition
Finite Cyclic Group	Isomorphic to $(\mathbb{Z}_n, +_n)$	Order $n$, $\phi(n)$ generators	Rotational symmetry of regular $n$-gon	Mentions modulo $n$ arithmetic
Subgroups of $\mathbb{Z}_n$	$d$ divides $n$ ($d \mid n$)	Unique subgroup of order $d$, $\tau(n)$ total subgroups	Periodic sub-grids in symmetry	Asks for total subgroups or specific order subgroups
Element Order in $\mathbb{Z}_n$	Element $\bar{k} \in \mathbb{Z}_n$	Order $o(\bar{k}) = \frac{n}{\gcd(k, n)}$	Minimal return step in rotation	Asks for order of specific element modulo $n$

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

Find the number of generators of a cyclic group of order 60.

(A) 12(B) 16(C) 24(D) 30

📚 Method A: Formal Textbook Derivation

Step 1: Recognize the formula for the number of generators of a cyclic group of order $n$ is $\phi(n)$. Step 2: Compute $\phi(60)$. Prime factorization of $60 = 2^2 \times 3^1 \times 5^1$. Step 3: $\phi(60) = 60 \times (1 - 1/2) \times (1 - 1/3) \times (1 - 1/5) = 60 \times \frac{1}{2} \times \frac{2}{3} \times \frac{4}{5} = 16$.

⚡ Method B: 25-Second Exam Shortcut

Apply Euler's totient formula directly: $\phi(60) = \phi(4) \phi(3) \phi(5) = 2 \times 2 \times 4 = 16$.

💡 Tip: Keep prime factorization and totient values up to 100 memorized for 10-second answers.

CANONICAL PROBLEM 02 Dual-Method Breakdown

What is the order of the element $\bar{9}$ in the cyclic group $\mathbb{Z}_{24}$ under addition modulo 24?

(A) 3(B) 8(C) 24(D) 12

📚 Method A: Formal Textbook Derivation

Step 1: Use the formula $o(a^k) = \frac{n}{\gcd(k, n)}$. Here $n = 24$ and $k = 9$. Step 2: Calculate $\gcd(9, 24) = 3$. Step 3: Order = $\frac{24}{3} = 8$.

⚡ Method B: 25-Second Exam Shortcut

Quickly compute multiples of 9 mod 24: $9 \times 8 = 72 \equiv 0 \pmod{24}$, and 8 is the smallest positive integer satisfying this.

💡 Tip: Do not manually compute up to 24 powers; always use the GCD formula for speed.

Practice questions

Choose an answer to check it and see the solution:

MCQ 1: Every cyclic group is necessarily:

A Non-abelian

B Abelian

C Finite

D Infinite

Derivation & Analysis:

If $a^r, a^s \in \langle a \rangle$, then $a^r a^s = a^{r+s} = a^{s+r} = a^s a^r$, so every cyclic group is abelian.

MCQ 2: The number of generators of the cyclic group $\mathbb{Z}_{10}$ is:

A 2

B 3

C 4

D 5

Derivation & Analysis:

The number of generators of $\mathbb{Z}_{10}$ is $\phi(10) = \phi(2) \phi(5) = 1 \times 4 = 4$.

MCQ 3: How many subgroups does the cyclic group $\mathbb{Z}_{12}$ have?

A 4

B 5

C 6

D 12

Derivation & Analysis:

The number of subgroups of $\mathbb{Z}_{12}$ equals the number of positive divisors of 12. Divisors of 12 are 1, 2, 3, 4, 6, 12, so there are 6 subgroups.

MCQ 4: The order of the element $\bar{4}$ in $\mathbb{Z}_{18}$ is:

A 9

B 18

C 6

D 9

Derivation & Analysis:

Order = $\frac{18}{\gcd(4, 18)} = \frac{18}{2} = 9$.

MCQ 5: Which of the following groups is cyclic?

A The Klein 4-group $V_4$

B The multiplicative group $\mathbb{Q}^*$ of rational numbers

C The additive group $\mathbb{Z}_5$

D The symmetric group $S_3$

Derivation & Analysis:

$\mathbb{Z}_5$ is prime-order group, hence cyclic (generated by 1 or any non-zero element). $V_4$ and $S_3$ are non-cyclic, and $\mathbb{Q}^*$ is not finitely generated.

MCQ 6: If $G$ is a cyclic group of order $n$, then the equation $x^k = e$ has how many solutions in $G$, where $k$ divides $n$?

A 1

B $k$

C $n$

D 0

Derivation & Analysis:

In a cyclic group of order $n$, if $k$ divides $n$, the subgroup of elements satisfying $x^k = e$ is the unique subgroup of order $k$, which is cyclic of order $k$, hence contains exactly $k$ elements satisfying the equation.

MCQ 7: Which of the following is NOT true for cyclic groups?

A Every subgroup of a cyclic group is cyclic

B Every group of prime order is cyclic

C The direct product of two cyclic groups is always cyclic

D Every infinite cyclic group is isomorphic to $(\mathbb{Z}, +)$

Derivation & Analysis:

The direct product $\mathbb{Z}_2 \times \mathbb{Z}_2$ is not cyclic, even though both factor groups are cyclic. Thus, the statement 'always cyclic' is false.

MCQ 8: The number of elements of order 5 in $\mathbb{Z}_{20}$ is:

A 1

B 2

C 4

D 5

Derivation & Analysis:

Since 5 divides 20, the number of elements of order 5 in $\mathbb{Z}_{20}$ is $\phi(5) = 4$.

MCQ 9: If a group $G$ has no proper non-trivial subgroups, then $G$ must be:

A Infinite cyclic

B Finite cyclic of prime order

C Non-abelian

D An infinite non-cyclic group

Derivation & Analysis:

A group with no proper non-trivial subgroups is simple and must be cyclic of prime order by Lagrange's theorem.

Q10

MCQ 10: If $a$ is a generator of a finite cyclic group $G$ of order $n$, then $a^k$ is a generator of $G$ if and only if:

A $k$ is a divisor of $n$

B $\gcd(k, n) = 1$

C $k = n$

D $k$ is prime

Derivation & Analysis:

An element $a^k$ generates $G$ if and only if its order is $n$, which occurs precisely when $\gcd(k, n) = 1$.

Common questions

Yes, every cyclic group is abelian. However, the converse is false: not every abelian group is cyclic. A classic counterexample is the Klein 4-group $V_4$ or $\mathbb{Z}_2 \times \mathbb{Z}_2$, which are abelian but not cyclic.

Candidates often confuse the number of *generators* of $\mathbb{Z}_n$ (which is $\phi(n)$) with the number of *subgroups* of $\mathbb{Z}_n$ (which is $\tau(n)$, the number of divisors of $n$). Memorizing this distinction is crucial.

Directly memorize and apply the formula $o(a^k) = \frac{n}{\gcd(k, n)}$ for finite cyclic groups, and utilize Euler's totient function properties for generator counts.