B2.1 The Group Axioms
Groups are the central object of abstract algebra, capturing the essence of symmetry and invertible operations. The definition is deceptively simple—three axioms—yet groups appear everywhere: in geometry (symmetries), number theory (modular arithmetic), topology (fundamental groups), physics (gauge theories), and even chemistry (molecular symmetries). This chapter lays the foundations: the axioms and their first consequences, the fundamental examples, subgroups, homomorphisms, and the order of an element.
Definition 2.1.1 (Groups). A group is a set
- Associativity:
. - Identity:
such that for all . - Inverses:
such that .
We write
The axioms have immediate but important consequences, which we now prove carefully.
Proposition 2.1.2 (Uniqueness of identity). The identity element
Proof. Suppose
Proposition 2.1.3 (Uniqueness of inverses). For each
Proof. Suppose
Proposition 2.1.4 (Cancellation laws). In a group
- Left cancellation:
. - Right cancellation:
.
Proof. For left cancellation: if
Proposition 2.1.5 (Inverse of products). For all
Proof. We verify
Proposition 2.1.6 (Inverse of inverse). For all
Proof. By definition,
By associativity, a product
Definition 2.1.7 (Powers). For
The usual laws of exponents hold:
2.1.1 Group Variants and Related Structures
Groups sit in a hierarchy of algebraic structures with fewer or more axioms.
Definition 2.1.8 (Abelian groups). A group
Note. It is customary to use additive notation (
Definition 2.1.9 (Monoids). A monoid is a set with an associative binary operation and an identity element; inverses are not required. Examples:
Definition 2.1.10 (Semigroups). A semigroup is a set with an associative binary operation; neither an identity nor inverses are required. Example:
Note. There is a pattern here: group = monoid + inverses = semigroup + identity + inverses. Category theory (Definition 8.1.1) provides a unifying framework: a monoid is a category with one object, and a group is a category with one object in which every morphism is invertible.