Three operations met earlier in the course can always be undone. Adding 5 to an integer is undone by adding $-5$. Multiplying by 2 in the units of $\mathbb{Z}_9$ is undone by multiplying by 5, because $2 \cdot 5 = 10 = 1$ in $\mathbb{Z}_9$. Turning a square card through a quarter turn is undone by turning it a quarter turn back. Each case has the same four ingredients:
- a set: the integers, the units modulo 9, the motions of a card;
- a way of combining two of its elements into a third;
- a "do nothing" element: 0, 1, the motion that leaves the card alone;
- for every element, another that cancels it.
What can be said about every system with these ingredients, whatever its elements are?
The ring axioms described a set with two operations tied together by the distributive laws. Most of the examples above have only one operation worth speaking of, and the motions of a card have no addition at all. A group is the structure that remains when one operation is kept and required to be undoable. The definition is short, and its examples are far more varied than those of rings. Besides the additive and multiplicative groups found inside rings, every collection of reversible transformations that is closed under composition is a group. That brings in the symmetries of geometric figures, the permutations of a finite set, and the moves of a Rubik's cube.
First we state the definition and its notations. Then we find groups in rings and in the bijections of a set. Next we check the axioms for a new operation and look at systems that fail them. Finally we meet Cayley tables, direct products and the order of an element.
This is the first article of Groups. It is the home of the definition of a group, of permutations and of the order of an element; later articles build on it. It covers the definition and examples of §7.1 of the course text (Hungerford, 2014), with Judson (2026, §§3.1 and 3.2) as a free companion. The dihedral, Rubik's cube and symmetric groups that §7.1 introduces each have an article of their own.
The definition
An operation on a set $G$ is a rule that assigns to each ordered pair $(a, b)$ of elements of $G$ exactly one result, written here $a * b$. The order matters: $a * b$ and $b * a$ may differ.
Definition. A group is a set $G$ with an operation $*$ that satisfies the following axioms.
- Closure. If $a$ and $b$ are in $G$, then $a * b$ is in $G$.
- Associativity. $(a * b) * c = a * (b * c)$ for all $a$, $b$, $c$ in $G$.
- Identity. There is an element $e$ in $G$ with $a * e = a = e * a$ for every $a$ in $G$.
- Inverses. For each $a$ in $G$ there is an element $d$ in $G$ with $a * d = e = d * a$.
The element $e$ is the identity of $G$, and an element $d$ as in axiom 4 is an inverse of $a$. A group is abelian if in addition $a * b = b * a$ for all $a$ and $b$ in $G$, and nonabelian otherwise. The word honors the Norwegian mathematician Niels Henrik Abel (1802 to 1829). Several features of the definition deserve comment.
- Closure is listed as an axiom, as in the course text, so that the axioms can be checked one at a time on a candidate set. Many books build it into the word "operation", which by definition has its results in $G$.
- Commutativity is not required. The most important groups in this unit are nonabelian, and the definition was written to include them.
- Axioms 3 and 4 ask for two-sided identities and inverses. In a nonabelian group $a * e = a$ does not by itself give $e * a = a$, so both equations are stated.
- Axiom 3 makes a group nonempty, since it contains $e$.
A group has only one identity. The idea is to combine two candidate identities with each other: each must leave the other unchanged. Suppose $e$ and $e'$ both satisfy axiom 3. Then $e = e * e'$ because $e'$ is an identity, and $e * e' = e'$ because $e$ is an identity, so $e = e'$.
Each element also has only one inverse, by the argument used for units in a ring. It is proved for groups, with the other first consequences of the axioms, in Basic Properties of Groups. So it is safe to speak of the identity and the inverse of $a$, written $a^{-1}$.
The number of elements of a finite group $G$ is its order, written $\lvert G \rvert$. A group with infinitely many elements has infinite order.
Notation
Writing $a * b$ every time is clumsy, and two shorter notations are standard.
| Multiplicative notation | Additive notation | |
|---|---|---|
| operation | $ab$ or $a \cdot b$ | $a + b$ |
| identity | $e$ or $1$ | $0$ |
| inverse of $a$ | $a^{-1}$ | $-a$ |
| $a$ combined with itself $n$ times | $a^n$ | $na$ |
| used for | any group | abelian groups only |
Multiplicative notation is the default for an abstract group, even when the operation is composition of functions or something else that is not multiplication of numbers. Additive notation is reserved for abelian groups, so a plus sign signals commutativity. In the groups that come from rings, the notation is the ring's own. A group of numbers under addition is written additively, and a group of units under multiplication is written multiplicatively.
Groups inside rings
Where do groups come from? The first source is the rings already studied, because the first ring axioms were exactly axioms about addition, and they are the group axioms.
Proposition. Every ring $R$ is an abelian group under its addition, with identity $0_R$ and with $-a$ as the inverse of $a$.
The idea: the ring axioms already contain the group axioms for addition, stated on one side only, and commutativity of addition supplies the other side.
Proof. The ring axioms for addition say that $R$ is closed under addition, that addition is associative and commutative, that $a + 0_R = a$ for every $a$, and that every $a$ has an element $x$ with $a + x = 0_R$. Commutativity gives $0_R + a = a$ and $x + a = 0_R$ as well, so these are axioms 1 to 4 for the operation $+$, together with commutativity. $\blacksquare$
So $\mathbb{Z}$, $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$, the Gaussian integers $\mathbb{Z}[i]$, every polynomial ring and every ring of matrices is an abelian group under addition. So is $\mathbb{Z}_n$ for every $n$. The group $\mathbb{Z}_n$ under addition is the arithmetic of a clock with $n$ hours: in $\mathbb{Z}_8$, $5 + 6 = 3$ and the inverse of 3 is 5. When a ring is called a group with no operation named, the operation is addition.
Multiplication is different. A ring with identity in which $0_R \neq 1_R$ is never a group under multiplication. The reason is that $0_R \cdot x = 0_R$ for every $x$ (Basic Properties of Rings), so $0_R$ has no inverse. The one exception is the zero ring $\{0\}$, which is a group of order 1 under either operation. Removing zero is not always enough: the nonzero elements of $\mathbb{Z}_{12}$ are not closed under multiplication, since $3 \cdot 4 = 0$. What works is to keep exactly the invertible elements.
Proposition. Let $R$ be a ring with identity. Its units form a group $R^\times$ under multiplication, with identity $1_R$. If $R$ is commutative, $R^\times$ is abelian.
The idea: a product of units is a unit, so the units are closed, and the axioms other than closure are inherited from $R$. For $\mathbb{Z}_n$ this was shown in the group of units; the proof here works in any ring with identity.
Proof. The product of two units $a$ and $b$ is a unit with inverse $b^{-1}a^{-1}$ (Basic Properties of Rings), so $R^\times$ is closed under multiplication. Multiplication in $R$ is associative, so it is associative on the subset $R^\times$. The identity $1_R$ is a unit, being its own inverse, and $a \cdot 1_R = a = 1_R \cdot a$. If $a$ is a unit, its inverse $a^{-1}$ is a unit too: the equations $a^{-1}a = 1_R = aa^{-1}$ show that $a$ is an inverse of $a^{-1}$. So axiom 4 holds inside $R^\times$. Commutativity of $R^\times$ follows from commutativity of $R$. $\blacksquare$
The groups of units of the rings met so far:
| Ring | Group of units | Order |
|---|---|---|
| $\mathbb{Z}$ | $\{1, -1\}$ | 2 |
| $\mathbb{Z}[i]$ | $\{1, i, -1, -i\}$ | 4 |
| $\mathbb{Q}$, $\mathbb{R}$, $\mathbb{C}$ | the nonzero elements, $\mathbb{Q}^\times$, $\mathbb{R}^\times$, $\mathbb{C}^\times$ | infinite |
| a field $F$ | $F^\times = F \setminus \{0\}$ | $\lvert F \rvert - 1$ when $F$ is finite |
| $\mathbb{Z}_n$ | $U(n)$, the classes $[a]$ with $\gcd(a, n) = 1$ | $\varphi(n)$ |
| $M_2(\mathbb{R})$ | $GL_2(\mathbb{R})$, the matrices with nonzero determinant | infinite |
The units of $\mathbb{Z}[i]$ were found from the norm in Basic Properties of Rings. Their multiplication is the multiplication of the powers of $i$: $i^2 = -1$, $i^3 = -i$, $i^4 = 1$. The units of $\mathbb{Z}_n$ are the classes relatively prime to $n$ (Units and Zero Divisors in the Integers Modulo n), and their number is Euler's $\varphi(n)$. The notation $U(n)$ follows Judson (2026, §3.2); the course text writes $U_n$, and $\mathbb{Z}_n^\times$ is also common.
Check your understanding. The nonzero elements of $\mathbb{Z}_{12}$ do not form a group under multiplication. For which $n \ge 2$ do the nonzero elements of $\mathbb{Z}_n$ form one?
Exactly for $n$ prime. The nonzero elements form a group exactly when every one of them is a unit, so that they are the group $U(n)$. A class $[a]$ is a unit exactly when $\gcd(a, n) = 1$ (Units and Zero Divisors in the Integers Modulo n), and every $a$ from 1 to $n - 1$ is relatively prime to $n$ exactly when $n$ is prime.
The general linear group $GL_2(\mathbb{R})$ is the group of units of the ring of $2 \times 2$ real matrices. A matrix $A$ is invertible exactly when its determinant $\det A$ is nonzero, and then
$$\begin{pmatrix} a & b \\ c & d \end{pmatrix}^{-1} = \frac{1}{ad - bc} \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}.$$
It is nonabelian, and in a strong sense: Subgroups and Cyclic Groups proves that the only matrices in $GL_2(\mathbb{R})$ that commute with every other are the nonzero scalar multiples of the identity matrix.
A small group of units: $U(9)$
The integers from 1 to 8 that are relatively prime to 9 are 1, 2, 4, 5, 7 and 8, so $U(9)$ has order $\varphi(9) = 6$. Its multiplication, reduced modulo 9, is recorded in a table whose entry in row $a$ and column $b$ is $ab$:
| $\cdot$ | 1 | 2 | 4 | 5 | 7 | 8 |
|---|---|---|---|---|---|---|
| 1 | 1 | 2 | 4 | 5 | 7 | 8 |
| 2 | 2 | 4 | 8 | 1 | 5 | 7 |
| 4 | 4 | 8 | 7 | 2 | 1 | 5 |
| 5 | 5 | 1 | 2 | 7 | 8 | 4 |
| 7 | 7 | 5 | 1 | 8 | 4 | 2 |
| 8 | 8 | 7 | 5 | 4 | 2 | 1 |
The identity is 1, whose row and column repeat the headings. Each row contains 1 exactly once, and its position locates the inverses: $2^{-1} = 5$, $4^{-1} = 7$, and 1 and 8 are their own inverses ($8 = -1$ and $(-1)^2 = 1$). The table is symmetric about its main diagonal, as it must be for an abelian group. One more pattern stands out. The powers of 2 are
$$2^1 = 2, \quad 2^2 = 4, \quad 2^3 = 8, \quad 2^4 = 16 = 7, \quad 2^5 = 14 = 5, \quad 2^6 = 10 = 1,$$
so every element of $U(9)$ is a power of 2. Groups with this property are called cyclic, and they are the subject of Subgroups and Cyclic Groups.
Every group so far has been built from numbers. The quarter turn of the card is not a number at all, and needs a second source of groups.
Groups of transformations
The second great source of groups is composition of functions. If $f$ and $g$ are functions from a set $X$ to itself, their composite $f \circ g$ is the function $x \mapsto f(g(x))$: first $g$, then $f$. Composition is always associative, because both $(f \circ g) \circ h$ and $f \circ (g \circ h)$ send $x$ to $f(g(h(x)))$. The identity function $\iota(x) = x$ satisfies $f \circ \iota = f = \iota \circ f$. What can fail is axiom 4. A function has an inverse under composition exactly when it is a bijection (one-to-one and onto), and then its inverse is the inverse function, which undoes it.
Proposition. Let $X$ be a nonempty set. The bijections from $X$ to itself form a group $\mathrm{Sym}(X)$ under composition, with the identity function as identity and the inverse function as inverse.
The idea: one-to-one and onto both survive composition, and the inverse function of a bijection is again a bijection. The other axioms hold for all functions.
Proof. Closure: let $f$ and $g$ be bijections of $X$. If $f(g(x)) = f(g(y))$, then $g(x) = g(y)$ because $f$ is one-to-one, and then $x = y$ because $g$ is one-to-one; so $f \circ g$ is one-to-one. Given $z$ in $X$, there is $y$ with $f(y) = z$ because $f$ is onto, and $x$ with $g(x) = y$ because $g$ is onto; then $(f \circ g)(x) = z$, so $f \circ g$ is onto. Associativity and the identity were checked above, and $\iota$ is a bijection. Inverses: a bijection $f$ has an inverse function $f^{-1}$, defined by $f^{-1}(z) =$ the unique $x$ with $f(x) = z$. It satisfies $f \circ f^{-1} = \iota = f^{-1} \circ f$, and it is itself a bijection because $f$ is an inverse for it. $\blacksquare$
A bijection of $X$ to itself is called a permutation of $X$, and $\mathrm{Sym}(X)$ is the symmetric group on $X$. When $X = \{1, 2, \ldots, n\}$ it is written $S_n$. It has $n!$ elements and is nonabelian once $n \ge 3$, as Symmetric Groups and Permutations proves. That article also introduces the cycle notation that makes calculation in $S_n$ practical.
Check your understanding. The function $x \mapsto x + 1$ on the positive integers is one-to-one, and the function $g$ that sends 1 to 1 and every $x \ge 2$ to $x - 1$ satisfies $g(x + 1) = x$ for every $x$. Do the one-to-one functions from the positive integers to themselves form a group under composition?
They do not. The composite "$x \mapsto x + 1$, then $g$" is the identity, but in the other order 1 goes to 1 and then to 2. Axiom 4 asks for an inverse on both sides, and $x \mapsto x + 1$ has none, since nothing is sent to 1 by it. This is why the proposition needs bijections, and why axioms 3 and 4 state both equations.
Inside a symmetric group, any collection of permutations that contains the identity and is closed under composition and inverses is a group in its own right, with associativity inherited. This is how symmetry enters algebra. A symmetry of a figure in the plane is a distance-preserving map of the plane onto itself that carries the figure onto itself. The identity map is a symmetry, the composite of two symmetries is a symmetry, and the inverse of a symmetry is a symmetry. So the symmetries of any figure form a group.
- For a regular polygon with $n$ sides this is the dihedral group $D_n$ of order $2n$, studied in Dihedral Groups. The four rotations of the square card in the opening paragraph are half of $D_4$.
- For a solid cube cut into movable layers, the reachable rearrangements of its stickers form the Rubik's cube group.
In these groups the product $fg$ is a composite. Since $f \circ g$ and $g \circ f$ are usually different motions, the groups are nonabelian.
Rotations as numbers: roots of unity
Rotations of the plane about the origin can also be multiplied as complex numbers. Let $n \ge 1$ and $\omega = e^{2\pi i/n} = \cos(2\pi/n) + i \sin(2\pi/n)$. Multiplying a complex number by $\omega$ rotates it about 0 through the angle $2\pi/n$. The $n$th roots of unity are the $n$ numbers
$$\mu_n = \{1, \omega, \omega^2, \ldots, \omega^{n-1}\},$$
the solutions of $z^n = 1$, which sit at the vertices of a regular $n$-gon on the unit circle. Under multiplication they form an abelian group of order $n$. By the rule for multiplying powers, $\omega^a \omega^b = \omega^{a + b}$, and since $\omega^n = 1$ the exponent can be reduced modulo $n$. So $\mu_n$ is closed and the identity is $\omega^0 = 1$. The inverse of $\omega^a$ is $\omega^{n - a}$, which is also its complex conjugate because $\lvert \omega^a \rvert = 1$. Associativity is inherited from $\mathbb{C}$. For $n = 8$, $\omega = (1 + i)/\sqrt 2$, and the inverse of $\omega^3$ is $\omega^5$. The exponents add exactly as the elements of $\mathbb{Z}_8$ do, an observation made precise by the isomorphisms of Group Homomorphisms and Isomorphisms.
Checking the axioms for a new operation
What does it take to show that a new operation makes a group? The axioms are checked one at a time, and closure is the one most often forgotten. Let $G = (-1, 1)$ be the open interval of real numbers strictly between $-1$ and $1$, and define
$$x * y = \frac{x + y}{1 + xy}.$$
This is the rule for adding velocities in special relativity, with speeds measured as fractions of the speed of light. Two speeds below light speed combine to a speed below light speed. For example $\tfrac12 * \tfrac13 = \tfrac{5/6}{7/6} = \tfrac57$ and $\tfrac12 * \tfrac12 = \tfrac45$.
The plan: closure is the hard axiom, settled by writing $1 - (x * y)^2$ as a product of positive factors, and the others are direct computations. The key identity is
$$1 - (x * y)^2 = \frac{(1 + xy)^2 - (x + y)^2}{(1 + xy)^2} = \frac{(1 - x^2)(1 - y^2)}{(1 + xy)^2},$$
which follows by expanding both numerators: each equals $1 + x^2y^2 - x^2 - y^2$.
- Closure. If $x, y \in G$, then $\lvert xy \rvert < 1$, so $1 + xy > 0$ and the fraction is defined. Both factors $1 - x^2$ and $1 - y^2$ are positive. So the key identity gives $1 - (x * y)^2 > 0$, that is, $\lvert x * y \rvert < 1$. (For $\tfrac12$ and $\tfrac13$: $1 - \tfrac{25}{49} = \tfrac{24}{49}$, and $\tfrac34 \cdot \tfrac89 \big/ \tfrac{49}{36} = \tfrac{24}{49}$.) On the closed interval $[-1, 1]$ the formula breaks down: $1 * (-1)$ has denominator 0.
- Associativity. Multiplying numerator and denominator by $1 + xy$, $(x * y) * z = \dfrac{(x + y) + z(1 + xy)}{(1 + xy) + (x + y)z} = \dfrac{x + y + z + xyz}{1 + xy + xz + yz}$. The same computation gives the same expression for $x * (y * z)$, since the result is symmetric in $x$, $y$ and $z$.
- Identity. $0 * x = x/1 = x$ and $x * 0 = x$, so $0$ is the identity.
- Inverses. $x * (-x) = 0/(1 - x^2) = 0$, and $-x \in G$; so the inverse of $x$ is $-x$. The inverse of $\tfrac12$ is $-\tfrac12$.
So $(G, *)$ is an abelian group. The script for this article also checks associativity on a grid of rational triples. The formula is the addition rule for the hyperbolic tangent, $\tanh(a + b) = (\tanh a + \tanh b)/(1 + \tanh a \tanh b)$. So $\tanh$ turns ordinary addition of real numbers into $*$. The group $(G, *)$ is the additive group $\mathbb{R}$ with renamed elements, a fact that Group Homomorphisms and Isomorphisms expresses as an isomorphism.
Check your understanding. Light speed is 1 in these units. Suppose we tried to enlarge $G$ to include 1, leaving out only the pair $1 * (-1)$ where the formula breaks down. What is $1 * x$ for $x \neq -1$, and which axiom does that break?
The formula gives $1 * x = (1 + x)/(1 + x) = 1$: light speed combined with any other speed is still light speed. So $1 * x$ is never the identity 0, and 1 has no inverse. Axiom 4 fails, which is one reason $G$ is the open interval.
Systems that are not groups
Each failure below shows what one axiom contributes.
- The even integers under multiplication are closed and associative, but there is no identity: $2e = 2$ would require $e = 1$, which is odd.
- The integers under multiplication have the identity 1 but no inverses except for $\pm 1$: no integer $x$ satisfies $2x = 1$. The group of units $\{1, -1\}$ is what survives.
- The positive integers under exponentiation, $a * b = a^b$, are closed but not associative: $2^{(3^2)} = 2^9 = 512$, while $(2^3)^2 = 8^2 = 64$.
- The nonzero elements of $\mathbb{Z}_{12}$ under multiplication are not closed, since $3 \cdot 4 = 0$, as noted above.
- The integers under $a * b = \max(a, b)$ form an associative and commutative system. But no integer $e$ satisfies $\max(a, e) = a$ for every integer $a$, since $a = e - 1$ fails.
A tempting misreading is that associativity can be taken for granted, since every familiar operation has it. Exponentiation shows it cannot, and the interval above needed a computation to establish it.
Cayley tables
With the axioms settled, how can a whole finite group be seen at once? For a finite group the whole operation can be written as a table, called the Cayley table or operation table, after Arthur Cayley (Judson, 2026, §3.2). The table of $U(9)$ above is an example. Two features hold in every Cayley table.
- The row and column of the identity repeat the headings.
- Every element appears exactly once in each row and once in each column. The reason is that the equation $ax = b$ has exactly one solution $x = a^{-1}b$ in a group, a consequence of the cancellation laws proved in Basic Properties of Groups.
A table with the second property is called a Latin square.
The arrangement of a table depends on the order in which the elements are listed, and a good order can reveal structure. Listing $U(9)$ as the powers $1, 2, 4, 8, 7, 5$ of 2 makes each row a shift of the one above. That is exactly the pattern of the addition table of $\mathbb{Z}_6$.
Two groups whose tables match after the elements are renamed are isomorphic: they are the same group with different names for its elements. $U(9)$ and $\mathbb{Z}_6$ are isomorphic, through the renaming $2^k \leftrightarrow k$. Isomorphisms of groups are defined and studied in Group Homomorphisms and Isomorphisms. Cayley's theorem uses the rows of the Cayley table to show that every group is isomorphic to a group of permutations.
Direct products
Can two groups be combined into a larger one? Working in both at once does it, as with direct products of rings.
Proposition. Let $G$ and $H$ be groups. The set $G \times H$ of ordered pairs $(g, h)$ with $g \in G$ and $h \in H$ is a group under the componentwise operation
$$(g_1, h_1)(g_2, h_2) = (g_1 g_2, \; h_1 h_2),$$
in which the first coordinates are combined by the operation of $G$ and the second by that of $H$. Its identity is $(e_G, e_H)$ and the inverse of $(g, h)$ is $(g^{-1}, h^{-1})$. If $G$ and $H$ are abelian, so is $G \times H$, and if both are finite, $\lvert G \times H \rvert = \lvert G \rvert \, \lvert H \rvert$.
The idea: the two coordinates never interact, so each axiom for pairs is that axiom for $G$ in the first coordinate and for $H$ in the second.
Proof. Each axiom holds coordinate by coordinate. Closure: $g_1 g_2 \in G$ and $h_1 h_2 \in H$. Associativity: both $((g_1, h_1)(g_2, h_2))(g_3, h_3)$ and $(g_1, h_1)((g_2, h_2)(g_3, h_3))$ equal $(g_1 g_2 g_3, h_1 h_2 h_3)$, because each coordinate is computed in an associative group. Identity: $(g, h)(e_G, e_H) = (g e_G, h e_H) = (g, h)$, and similarly on the other side. Inverses: $(g, h)(g^{-1}, h^{-1}) = (e_G, e_H) = (g^{-1}, h^{-1})(g, h)$. If both groups are abelian, $(g_1 g_2, h_1 h_2) = (g_2 g_1, h_2 h_1)$. There are $\lvert G \rvert$ choices for the first coordinate and $\lvert H \rvert$ for the second. $\blacksquare$
The two factors need not use the same notation. In $\mathbb{Z}_5 \times U(9)$ the first coordinates are added modulo 5 and the second multiplied modulo 9:
$$(3, 2)(4, 4) = (3 + 4, \; 2 \cdot 4) = (2, 8).$$
Check your understanding. Before reading the next sentence, name the identity of $\mathbb{Z}_5 \times U(9)$. A natural guess is $(0, 0)$, or else $(1, 1)$.
Neither is right. Each coordinate takes the identity of its own group, so the identity is $(0, 1)$; and $(0, 0)$ is not even an element, since 0 is not a unit modulo 9. The inverse of $(3, 2)$ is $(2, 5)$, and the group is abelian of order $5 \cdot 6 = 30$. Direct products of many copies of a small group record several independent quantities at once. The Rubik's cube group uses $\mathbb{Z}_3 \times \cdots \times \mathbb{Z}_3$ (eight factors) to record how far each of the eight corner pieces is twisted.
The order of an element
If one element is repeated, does it ever return to the identity? Powers in a group are defined as for units in a ring. For an element $g$ of a group with identity $e$, set $g^0 = e$, $g^n = g g \cdots g$ ($n$ factors) for $n \ge 1$, and $g^{-n} = (g^{-1})^n$. In additive notation $g^n$ becomes the multiple $ng$.
Definition. The order of an element $g$, written $\lvert g \rvert$, is the smallest positive integer $n$ with $g^n = e$, if there is one. If no positive power of $g$ equals $e$, then $g$ has infinite order.
This extends the order of a unit of $\mathbb{Z}_n$ to every group. The word "order" thus has two meanings, the size of a group and the order of an element. They are connected by the fact that the order of $g$ is the size of the set of its powers, as Subgroups and Cyclic Groups shows. Some examples:
- In $U(9)$ the powers of 2 listed above reach 1 first at the sixth power, so $\lvert 2 \rvert = 6$. Also $\lvert 4 \rvert = 3$, because $4^2 = 7$ and $4^3 = 1$, and $\lvert 8 \rvert = 2$.
- In the additive group $\mathbb{Z}_8$ the order of 2 is the least $n$ with $2n \equiv 0 \pmod 8$, which is 4. The element 3 has order 8, since $3n$ is a multiple of 8 only when $n$ is.
- A rotation through 45 degrees has order 8, and a reflection has order 2.
- In $\mathbb{Q}^\times$, $2$ has infinite order because $2^n > 1$ for every $n \ge 1$.
- The identity is the only element of order 1.
Check your understanding. In the velocity group $(G, *)$ of the interval $(-1, 1)$, the powers of $\tfrac12$ are $\tfrac12$, $\tfrac12 * \tfrac12 = \tfrac45$ and $\tfrac45 * \tfrac12 = \tfrac{13}{14}$. Does $\tfrac12$ have finite order? Does any element other than 0?
No element other than 0 has finite order. Write $x = \tanh a$; since $\tanh$ turns addition into $*$, the $n$th power of $x$ under $*$ is $\tanh(na)$. If $x \neq 0$ then $a \neq 0$, so $\tanh(na) \neq 0$ for every $n \ge 1$, just as no nonzero real number has a positive multiple equal to 0.
The basic facts about orders are proved in Basic Properties of Groups. Among them, $g^k = e$ exactly when $\lvert g \rvert$ divides $k$, and every element of a finite group has finite order. Orders already give a quick way to tell groups apart. The dihedral group $D_8$ and the additive group $\mathbb{Z}_{16}$ both have order 16, but $\mathbb{Z}_{16}$ has an element of order 16 and, as Dihedral Groups shows, $D_8$ does not.
Where groups came from
Group theory began with permutations, not with an axiom list. Joseph-Louis Lagrange used permutations of the roots of polynomial equations in a memoir of 1770 to 1771. Évariste Galois (1811 to 1832) used groups of such permutations to decide which polynomial equations can be solved by formulas in their coefficients (Judson, 2026, §3.2.2). In 1872 Felix Klein proposed that geometries be classified by the groups of transformations that preserve them, which made symmetry groups central to geometry. A clear axiomatic definition of an abstract group came only in the late nineteenth century, by which time the examples were well established. This order of events explains why the most important examples, permutations and symmetries, are groups of transformations: the axioms were chosen to describe them.
Where it leads
- The first consequences of the axioms are proved in Basic Properties of Groups: uniqueness of inverses, cancellation, the reversed order in $(ab)^{-1} = b^{-1}a^{-1}$ and the laws of exponents.
- Symmetry groups of polygons are the Dihedral Groups, and the moves of a Rubik's cube form the The Rubik's Cube Group.
- Permutation groups, with cycle notation and the parity of a permutation, are the subject of Symmetric Groups and Permutations.
- Groups inside groups, such as the powers of a single element, are studied in Subgroups and Cyclic Groups.
- When two groups have the same Cayley table up to renaming, they are isomorphic. Maps that respect the operation are the subject of Group Homomorphisms and Isomorphisms.
What we have learned
A group is a set with one associative operation, an identity and inverses. Rings supply groups under addition and groups of units such as $U(n)$ and $GL_2(\mathbb{R})$. The bijections of any set form a group under composition, and symmetry groups are of this kind. A new operation, like the velocity rule, must be checked axiom by axiom. Cayley tables, direct products and orders of elements are the first tools for comparing groups.
How many symmetries does a regular polygon have, and how are they multiplied? The next article, Dihedral Groups, answers both by numbering the corners with $\mathbb{Z}_n$.
References
- Hungerford, T. W. (2014). Abstract Algebra: An Introduction (3rd ed.), §7.1. Brooks/Cole, Cengage Learning. The course text: the definition of a group, with closure listed as an axiom; abelian groups; the order of a group; permutation groups and symmetry groups as first examples; every ring is an abelian group under addition, the nonzero elements of a field and the units of a ring with identity form groups under multiplication; the groups $U_n$ and $GL(2, \mathbb{R})$; direct products of groups. record · 44 pages
- Judson, T. W. (2026). Abstract Algebra: Theory and Applications (annual edition, August 2026). Free online at judsonbooks.org. §3.1 (the integers modulo $n$ and symmetries); §3.2 (definition of a group, Cayley tables, the groups $U(n)$ and $GL_2(\mathbb{R})$, finite and infinite order; Proposition 3.2.10, uniqueness of the identity); §3.2.2, historical note (Lagrange, Galois, Klein). record · 44 pages