Introduction

A group is one of the simplest mathematical structures that can express one of the deepest ideas in mathematics: symmetry. Before we define it formally, think of a square lying on a table. You may rotate it by a quarter-turn, a half-turn, a three-quarter-turn, or a full turn. You may also reflect it across certain lines. Some motions change the position of the corners, but every allowed motion leaves the square looking like the same square. If you perform one such motion and then another, the result is again an allowed motion. There is a motion that does nothing. Every motion can be undone. These four observations—closure, composition, identity, and inverse—are the first shadow of the group concept.

Group theory begins when we stop thinking only about the square and begin thinking about the pattern of operations itself. The same pattern appears in permutations of a finite set, addition of integers, invertible matrices, symmetries of differential equations, field automorphisms in Galois theory, loops in a topological space, and continuous transformations in geometry and physics. This is why group theory is not merely a subject about one kind of object. It is a language for recognizing structure wherever reversible composition appears. Standard graduate treatments such as Dummit and Foote’s Abstract Algebra and Rotman’s An Introduction to the Theory of Groups develop this point by showing how the same axioms govern examples from arithmetic, geometry, algebra, and combinatorics (Dummit and Foote, 2004; Rotman, 1995).

At graduate level, the goal is not only to know the definition of a group. The goal is to learn how groups are built, how they act, how they are represented, how they are classified in important cases, and how modern research continues to extend the subject. This book follows that path from the axioms to contemporary frontiers.

The first idea: composition with structure

A binary operation on a set is a rule that takes two elements of the set and produces another element of the same set. For example, addition is a binary operation on the integers because any two integers \(a\) and \(b\) determine another integer \(a+b\). Multiplication is a binary operation on the nonzero real numbers because if \(x\neq 0\) and \(y\neq 0\), then \(xy\neq 0\).

A group is a set \(G\) together with a binary operation, often written multiplicatively as \(ab\), satisfying four axioms:

1. Closure: if \(a,b\in G\), then \(ab\in G\).
2. Associativity: if \(a,b,c\in G\), then \((ab)c=a(bc)\).
3. Identity: there is an element \(e\in G\) such that \(eg=ge=g\) for every \(g\in G\).
4. Inverses: for every \(g\in G\), there is an element \(g^{-1}\in G\) such that \(gg^{-1}=g^{-1}g=e\).

These axioms are intentionally sparse. They do not say that the operation must be addition, multiplication, function composition, matrix multiplication, or geometric motion. They only specify the structural behavior that these operations share in suitable settings.

For example, the integers \(\mathbb{Z}\) form a group under addition. The identity is \(0\), the inverse of \(n\) is \(-n\), and associativity is the usual associativity of addition. But the integers do not form a group under multiplication, because most integers do not have multiplicative inverses inside \(\mathbb{Z}\). For instance, there is no integer \(m\) such that \(2m=1\).

As a second example, the set of all invertible \(n\times n\) matrices over a field \(F\), denoted \(\mathrm{GL}_n(F)\), forms a group under matrix multiplication. The identity element is the identity matrix \(I_n\), and the inverse of a matrix is its usual matrix inverse. This example is one of the gateways from abstract group theory into linear algebra, geometry, representation theory, and Lie theory.

As a third example, the set of all permutations of \(\{1,2,\dots,n\}\) forms the symmetric group \(S_n\). A permutation is a bijection from the set to itself. The operation is composition of functions: do one rearrangement, then another. Symmetric groups are fundamental because they show that group theory is also the study of possible rearrangements. Much of finite group theory can be viewed through this lens, and permutation groups remain a central object of modern algebra and computational group theory (Dixon and Mortimer, 1996).

Why abstraction is useful

At first, abstraction may feel like information has been removed. A square, a matrix, and a field automorphism seem very different, so why place them under one definition? The answer is that abstraction removes accidental features and preserves reusable structure.

Suppose we prove that in every group the identity element is unique. The proof does not depend on whether the group consists of numbers, matrices, symmetries, or functions. If \(e\) and \(e'\) are both identities, then because \(e\) is an identity we have \(ee'=e'\), while because \(e'\) is an identity we have \(ee'=e\). Hence \(e=e'\). A single argument now works in every group.

The same phenomenon occurs at a much deeper level. Theorems about quotient groups, group actions, Sylow subgroups, representations, and composition factors apply simultaneously to many mathematical situations. This is the power of the algebraic viewpoint: once the structure is isolated, theorems can travel.

Graduate mathematics often advances by discovering that two problems, apparently unrelated, share the same structural core. Group theory is one of the most successful examples of this method. It provides a common grammar for symmetry in algebra, topology, geometry, number theory, combinatorics, and mathematical physics.

From elements to structure

A beginner may first see a group as a collection of elements with a rule for multiplying them. That is correct, but it is not yet the full point. Group theory becomes powerful when we study how a group is organized.

A subgroup is a smaller group sitting inside a larger group. For example, the even integers \(2\mathbb{Z}\) form a subgroup of \(\mathbb{Z}\) under addition. A homomorphism is a map between groups that preserves the operation. For instance, the map \[ \varphi:\mathbb{Z}\to \mathbb{Z}/n\mathbb{Z} \] sending an integer to its residue class modulo \(n\) preserves addition. A normal subgroup is a subgroup that can be collapsed in a well-behaved way to form a quotient group. These ideas lead to the isomorphism theorems, exact sequences, extensions, and the structural decomposition of groups.

One of the central shifts in this book is from asking “What are the elements?” to asking “How is the group assembled?” This shift is similar to moving from a list of atoms to a theory of chemical bonding. The elements matter, but the relations among them matter more.

For example, the cyclic group of order \(6\) and the symmetric group \(S_3\) both have six elements, but they are not the same group. The cyclic group of order \(6\) is abelian, meaning all elements commute: \(ab=ba\). The group \(S_3\) is nonabelian: some permutations do not commute. Thus size alone does not determine structure. We need invariants, maps, actions, decompositions, and representations.

Groups as actions

A group is often best understood by what it does. A group action is a rule that lets elements of a group move points of a set in a way compatible with the group operation. If a group \(G\) acts on a set \(X\), each \(g\in G\) gives a transformation of \(X\), and applying \(g\) then \(h\) corresponds to applying the product \(hg\), depending on the convention chosen.

For example, the rotation group of a square acts on the four vertices of the square. The group \(\mathrm{GL}_n(F)\) acts on the vector space \(F^n\) by matrix multiplication. The symmetric group \(S_n\) acts on \(\{1,\dots,n\}\) by permuting the elements.

Group actions are one of the central bridges of the subject. They connect abstract groups to concrete sets, spaces, vector spaces, graphs, fields, and manifolds. The orbit-stabilizer principle, Burnside’s lemma, conjugation, Sylow theory, and permutation representations all arise naturally from actions. In later chapters, actions will also lead us into topology, geometry, Galois theory, and representation theory.

Representations: making groups linear

A representation of a group is a way to realize its elements as linear transformations of a vector space. More precisely, a representation of a group \(G\) on a vector space \(V\) over a field \(F\) is a homomorphism \[ \rho:G\to \mathrm{GL}(V), \] where \(\mathrm{GL}(V)\) is the group of invertible linear maps from \(V\) to itself.

The idea is simple but profound: to study an abstract group, let it act by matrices. Matrices can be added, multiplied, diagonalized in favorable situations, traced, decomposed, and studied with linear algebra. Representation theory therefore translates group-theoretic questions into linear-algebraic ones.

For finite groups over fields of characteristic not dividing the group order, Maschke’s theorem says that finite-dimensional representations decompose into irreducible pieces; this is a foundational result of finite group representation theory (Serre, 1977). Characters, which record traces of representing matrices, compress representation-theoretic information into functions on the group and become powerful tools for understanding finite groups. Representation theory also forms a major pathway to Lie groups, harmonic analysis, number theory, and mathematical physics (Fulton and Harris, 1991).

A simple example is the sign representation of \(S_n\). Each permutation is either even or odd. The sign map \[ \operatorname{sgn}:S_n\to \{1,-1\} \] is a one-dimensional representation, because \(\{1,-1\}\) can be viewed as invertible \(1\times 1\) real matrices. Even this small representation detects an important normal subgroup: the alternating group \(A_n\), consisting of all even permutations.

Finite, infinite, discrete, and continuous groups

Some groups have finitely many elements. These are finite groups. Examples include \(S_n\), cyclic groups of order \(n\), and symmetry groups of regular polygons. Finite groups are central in algebra because their structure can often be constrained by counting, divisibility, and actions.

Some groups are infinite but still discrete, meaning they are studied without a topology unless one is added. The integers \(\mathbb{Z}\), free groups, and many groups given by generators and relations fall into this category. These groups are especially important in combinatorial and geometric group theory, where one studies groups through words, Cayley graphs, metrics, and large-scale geometry. Modern geometric group theory uses ideas such as quasi-isometry and hyperbolicity to study finitely generated groups as geometric objects (de la Harpe, 2000).

Other groups are continuous. A Lie group is, roughly speaking, a group that is also a smooth manifold, with multiplication and inversion given by smooth maps. Examples include \(\mathrm{GL}_n(\mathbb{R})\), the circle group \(S^1\), and the rotation group \(\mathrm{SO}(3)\). Lie groups connect group theory to differential geometry, analysis, and physics. Their infinitesimal structure is captured by Lie algebras, which are vector spaces equipped with a bracket operation measuring infinitesimal noncommutativity (Hall, 2015).

There are also topological groups, profinite groups, locally compact groups, algebraic groups, arithmetic groups, and many other variants. Each adds extra structure—topology, algebraic geometry, measure, field arithmetic, or geometry—to the group axioms. This book gradually introduces these enrichments after the core algebraic theory is in place.

Classification and its limits

A recurring theme in mathematics is classification: describe all objects of a certain type up to isomorphism. An isomorphism is a structure-preserving bijection. Two groups are isomorphic if they have the same group structure, even if their elements are named differently.

Some classification problems are beautifully complete. Finitely generated abelian groups have a precise classification into cyclic building blocks. Finite simple groups have also been classified, but the result is vastly deeper. A simple group is a nontrivial group whose only normal subgroups are the trivial subgroup and the whole group. Simple groups serve as basic building blocks for finite groups in a way analogous to prime numbers for integers, though the analogy is not perfect because extensions between composition factors can be subtle.

The classification of finite simple groups states that every finite simple group belongs to one of several families: cyclic groups of prime order, alternating groups of degree at least five, groups of Lie type, or one of the 26 sporadic groups. This theorem is one of the largest collaborative achievements in twentieth-century mathematics, and modern accounts emphasize both its structural consequences and the complexity of its proof (Wilson, 2009).

But classification is not always possible in a simple form. Infinite groups, finitely presented groups, and groups with additional geometric or arithmetic structure often exhibit wild behavior. Research therefore alternates between classification, construction, rigidity, invariants, algorithms, and examples.

What this book will build

The book begins with the axioms and basic examples because every later idea depends on them. Chapters 1–5 develop the foundational algebraic language: groups, subgroups, cosets, homomorphisms, quotient groups, normal subgroups, exact sequences, and extensions. These chapters teach the grammar of the subject.

Chapters 6–8 develop group actions and finite group structure. The orbit-stabilizer theorem, Burnside’s lemma, conjugacy, centralizers, normalizers, and Sylow theory show how group actions convert symmetry into counting and structure. This is where many first serious classification arguments become possible.

Chapters 9–12 focus on decomposition. Abelian groups, free groups, presentations, commutators, solvable groups, nilpotent groups, composition series, and the Jordan-Hölder theorem give tools for measuring how a group is assembled and how far it is from being commutative or simple.

Chapters 13–16 enter permutation groups and representation theory. Symmetric and alternating groups provide essential finite examples. Linear representations and character theory then reveal how groups can be studied through vector spaces and traces.

Chapters 17–20 broaden the setting to Lie groups, compact Lie groups, algebraic groups, topological groups, profinite groups, and locally compact groups. These chapters show how group theory interacts with geometry, topology, algebraic geometry, number theory, and analysis.

Chapters 21–24 move toward geometric, arithmetic, physical, and computational applications. Groups appear as symmetries of spaces, automorphism groups of fields, fundamental groups of topological spaces, gauge groups in physics, and objects of algorithmic computation.

Chapters 25–26 look outward. The classification of finite simple groups gives one of the great structural achievements of the field. Current research frontiers then show that group theory remains active, diverse, and deeply connected to other areas: random groups, rigidity, expansion, property \((T)\), representation growth, profinite methods, higher-rank lattices, computational classification, categorification, quantum information, and mathematical physics.

How to think while reading

Do not read group theory as a list of definitions. Read it as a sequence of increasingly powerful viewpoints.

When you meet a definition, ask for examples and nonexamples. If the definition is “normal subgroup,” test it in abelian groups, in \(S_3\), and in matrix groups. If the definition is “homomorphism,” ask what it preserves and what information its kernel loses. If the definition is “group action,” ask what set is being acted on, what the orbits are, and what stabilizers measure.

When you meet a theorem, ask what problem it solves. Lagrange’s theorem tells us that subgroup sizes divide group sizes. The orbit-stabilizer theorem turns an action into an equation. Sylow’s theorems detect large prime-power subgroups inside finite groups. Maschke’s theorem explains why many finite group representations decompose cleanly. The Jordan-Hölder theorem says that composition factors are well defined up to order and isomorphism.

When you meet an example, compute. Abstract algebra becomes real through calculation. Write down multiplication tables for small groups. Decompose permutations into cycles. Find all subgroups of small groups. Compute kernels and images. Build quotient groups. Draw Cayley graphs. Work out character tables in small cases. The conceptual theory becomes durable only when it is supported by concrete practice.

The central promise

Group theory begins with four axioms, but those axioms open into a large mathematical landscape. They explain why symmetry can be studied independently of the objects that possess it. They allow finite structures to be counted, infinite structures to be organized, continuous symmetries to be differentiated, arithmetic symmetries to be represented, and geometric spaces to be compared through their transformation groups.

This book is written with one guiding promise: every advanced idea will be connected back to first principles. The path will become sophisticated, but it will not become mysterious. We will build the language carefully, use examples at each stage, and return often to the central question:

What does the group structure reveal that was hidden before?

References

de la Harpe, Pierre. Topics in Geometric Group Theory. University of Chicago Press, 2000.

Dixon, John D., and Brian Mortimer. Permutation Groups. Springer, 1996.

Dummit, David S., and Richard M. Foote. Abstract Algebra. 3rd ed., Wiley, 2004.

Fulton, William, and Joe Harris. Representation Theory: A First Course. Springer, 1991.

Hall, Brian C. Lie Groups, Lie Algebras, and Representations: An Elementary Introduction. 2nd ed., Springer, 2015.

Rotman, Joseph J. An Introduction to the Theory of Groups. 4th ed., Springer, 1995.

Serre, Jean-Pierre. Linear Representations of Finite Groups. Springer, 1977.

Wilson, Robert A. The Finite Simple Groups. Springer, 2009.