Group Theory Essentials

Concise answer

Almost every exam-level group theory question is answered by two facts and one habit: Lagrange's theorem constrains every subgroup and element order to divide the group order, the order of a power in a cyclic group is $n/\gcd(k,n)$ , and the habit is to write the group order down before touching an element. Counting arguments — how many elements of a given order, how many subgroups, whether two groups of equal order are isomorphic — then become short arithmetic.

Definitions

Group: A set $G$ with an associative operation that has an identity $e$ and in which every $a \in G$ has an inverse $a^{-1}$ . Commutativity is not required; a group that has it is called abelian.
Order of an element: The least positive integer $k$ with $a^k = e$ , written $|a|$ . If no such $k$ exists the element has infinite order.
Cyclic group: A group $\langle g \rangle = \{g^k\}$ generated by a single element. Every cyclic group of order $n$ is isomorphic to $\mathbb{Z}_n$ .
Coset: For $H \le G$ and $a \in G$ , the set $aH = \{ah : h \in H\}$ . Distinct left cosets are disjoint and all have $|H|$ elements, which is why $|H|$ divides $|G|$ .
Index: The number $[G : H]$ of distinct left cosets of $H$ in $G$ , so that $|G| = [G:H]\,|H|$ for a finite group.
Isomorphism: A bijection $\varphi : G \to H$ with $\varphi(ab) = \varphi(a)\varphi(b)$ . Isomorphic groups have identical order statistics, so a single mismatched element count disproves isomorphism.

Intuition

Lagrange's theorem is a counting statement, not an abstract one. The left cosets of a subgroup $H$ tile the group into disjoint blocks that all have exactly $|H|$ elements, so $|G|$ has to be a multiple of $|H|$ . Every corollary you use on the exam — element orders divide the group order, groups of prime order are cyclic, $a^{|G|} = e$ — is that tiling picture read a different way.

Two groups of the same order can still be different because order statistics are an invariant: an isomorphism sends an element of order $k$ to an element of order $k$ . So the fastest way to prove $\mathbb{Z}_4 \times \mathbb{Z}_2 \not\cong \mathbb{Z}_8$ is not to hunt for a failed map but to observe that $\mathbb{Z}_8$ has an element of order 8 and the product has none.

Concept walkthrough

A group is a set with one associative operation, an identity, and inverses. Most exam items never verify the axioms directly; they hand you a familiar group — $\mathbb{Z}_n$ under addition, the units $\mathbb{Z}_n^{\times}$ under multiplication, the symmetric group $S_n$ , the dihedral group $D_n$ , or a matrix group — and ask a structural question. The subgroup test is worth memorising in its short form: a nonempty subset that is closed under the operation and under inverses is a subgroup, and for a finite subset closure alone suffices because inverses appear as repeated powers.

Order is the single most useful number attached to an element. In the cyclic group $\mathbb{Z}_n$ written additively, the element $k$ has order $n/\gcd(k,n)$ ; the generators are exactly the $k$ coprime to $n$ , so there are $\varphi(n)$ of them. Because a cyclic group of order $n$ has exactly one subgroup for each divisor $d$ of $n$ , and that subgroup is itself cyclic of order $d$ , the number of elements of order $d$ is $\varphi(d)$ . In a direct product the order of $(a,b)$ is $\operatorname{lcm}(|a|,|b|)$ — an lcm, never a product — which is exactly why $\mathbb{Z}_m \times \mathbb{Z}_n$ is cyclic only when $\gcd(m,n) = 1$ . In $S_n$ , the order of a permutation is the lcm of its disjoint cycle lengths.

Lagrange's theorem then does the pruning. If $|G| = 20$ , no element can have order 3, no subgroup can have order 8, and any element $a$ satisfies $a^{20} = e$ . Two corollaries are heavily tested: a group of prime order has no proper nontrivial subgroups, so it is cyclic and generated by any non-identity element; and $a^{|G|} = e$ for every $a$ , which specialises to Fermat's little theorem in $\mathbb{Z}_p^{\times}$ . The converse of Lagrange is false and is a favourite trap — the alternating group $A_4$ has order 12 but no subgroup of order 6 — so a divisor of $|G|$ tells you what is possible, never what exists.

After this page, you should be able to

Verify the group and subgroup axioms quickly, and name which axiom a proposed structure fails.
Compute the order of an element in $\mathbb{Z}_n$ , in a direct product, and in a permutation group.
Use Lagrange's theorem and its corollaries to rule out impossible subgroup and element orders.
Count the elements of a given order in a cyclic group using $\varphi(d)$ , and count subgroups using divisors.
Distinguish two groups of the same order by comparing their order statistics rather than by searching for a map.

Formulas and assumptions

Lagrange's theorem

|G| = [G : H] \, |H|

Variables

G: a finite group
H: a subgroup of G
[G : H]: the number of distinct left cosets of H in G

Assumptions

G is finite.
The converse fails: a divisor of |G| need not be the order of any subgroup.

Order of a power in a cyclic group

\left| g^{k} \right| = \frac{n}{\gcd(k, n)}

Variables

g: a generator of a cyclic group of order n
k: the exponent
gcd: greatest common divisor

Assumptions

g has finite order n.
Written additively in Z_n, the element k has order n/gcd(k, n).

Order in a direct product

\left| (a, b) \right| = \operatorname{lcm}\left( |a|, |b| \right)

Variables

a: an element of the first factor
b: an element of the second factor

Assumptions

Both a and b have finite order.
The result is a least common multiple, not a product.

Elements of a given order in a cyclic group

\#\{x : |x| = d\} = \varphi(d), \qquad d \mid n

Variables

n: the order of the cyclic group
d: a divisor of n
phi: Euler's totient function

Assumptions

The group is cyclic of order n.
d must divide n; otherwise no element has order d.

Worked example

Counting elements of order 4 in a direct product

How many elements of order $4$ does $\mathbb{Z}_4 \times \mathbb{Z}_2$ contain, and is the group cyclic?

1The group has $|\mathbb{Z}_4 \times \mathbb{Z}_2| = 4 \cdot 2 = 8$ elements, so by Lagrange every element order divides $8$ : the only candidates are $1, 2, 4, 8$ .
2The order of a pair is $|(a,b)| = \operatorname{lcm}(|a|, |b|)$ , so the question reduces to the orders available in each factor.
3In $\mathbb{Z}_4$ : $|0| = 1$ , $|2| = 4/\gcd(2,4) = 2$ , and $|1| = |3| = 4$ . In $\mathbb{Z}_2$ : $|0| = 1$ and $|1| = 2$ .
4Since $|b| \in \{1, 2\}$ , the lcm equals $4$ only when $|a| = 4$ . That forces $a \in \{1, 3\}$ (two choices) while $b$ is unrestricted (two choices), giving $2 \cdot 2 = 4$ elements of order $4$ .
5The largest possible order is $\operatorname{lcm}(4, 2) = 4 < 8$ , so no element generates the whole group: it is not cyclic, and therefore $\mathbb{Z}_4 \times \mathbb{Z}_2 \not\cong \mathbb{Z}_8$ even though both have order $8$ .

Exactly $4$ elements have order $4$ , and $\mathbb{Z}_4 \times \mathbb{Z}_2$ is not cyclic because its maximum element order is $\operatorname{lcm}(4,2) = 4$ , not $8$ .

Common traps

Using the converse of Lagrange: $d \mid |G|$ does not produce a subgroup of order $d$ — $A_4$ has order $12$ and no subgroup of order $6$ .
Multiplying orders in a direct product instead of taking the least common multiple, which turns $\mathbb{Z}_4 \times \mathbb{Z}_2$ into a phantom cyclic group of order $8$ .
Confusing the order of an element with the order of the group, or with the order of the subgroup it generates (those last two are the same number, the first is not).
Assuming groups of equal order are isomorphic; compare order statistics first, since an isomorphism preserves the order of every element.
Treating every subgroup as normal. Subgroups of abelian groups and subgroups of index $2$ are normal, but a general subgroup — such as $\langle (12) \rangle \le S_3$ — is not.

Counting Elements of a Given Order GRE Mathematics overview Eigenvalues and Determinants Series Convergence Tests Sign in for current practice

Question depth and domain coverage vary by exam. Practice answers are checked after submission.

Sources

GRE Subject Test Content and Structure — ETS. Accessed 2026-07-06. Use as a cited source for exam facts; do not imply affiliation or reproduce protected test material.
Abstract Algebra: Theory and Applications (Judson), Section 3.8: Definitions and Examples — LibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.
Abstract Algebra: Theory and Applications (Judson), Section 3.9: Subgroups — LibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.
Abstract Algebra: Theory and Applications (Judson), Section 4.1: Cyclic Subgroups — LibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.
Abstract Algebra: Theory and Applications (Judson), Section 6.2: Lagrange's Theorem — LibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.
Abstract Algebra: Theory and Applications (Judson), Section 9.1: Definition and Examples (Isomorphisms) — LibreTexts Mathematics. Accessed 2026-08-15. Judson's Abstract Algebra on LibreTexts is released under the GNU Free Documentation License 1.3; attribute the author and platform and avoid verbatim reuse beyond short cited references.

Sources and corrections

Sources last checked 2026-08-15

Every source cited on this page was checked on the date shown, and we update the page when a source changes. If something looks wrong, tell us and we'll recheck it.

Report an issue with this page

Group Theory Essentials

Concise answer

Definitions

Intuition

Concept walkthrough

After this page, you should be able to

Formulas and assumptions

Lagrange's theorem

Order of a power in a cyclic group

Order in a direct product

Elements of a given order in a cyclic group

Worked example

Counting elements of order 4 in a direct product

Common traps

Related pages and practice

Sources

Sources and corrections