S. D. V. Stephens

notes / Studies in Algebra and Group Theory / chapter 1: Sets and Groups / From my book

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 together with a map called a law of composition (also binary operation). Writing for , the law of composition must satisfy three axioms:

  1. Associativity: .
  2. Identity: such that for all .
  3. Inverses: such that .

We write or simply for the group, and call its cardinality (Section 1.7) the order of . The group is finite or infinite according as the set is.

The axioms have immediate but important consequences, which we now prove carefully.

Proposition 2.1.2 (Uniqueness of identity). The identity element is unique.

Proof. Suppose and are both identities. Then (since is an identity) and (since is an identity). Thus . ∎

Proposition 2.1.3 (Uniqueness of inverses). For each , the inverse is unique. We denote it (or in additive notation).

Proof. Suppose and are both inverses of , so and . Then ∎

Proposition 2.1.4 (Cancellation laws). In a group :

  1. Left cancellation: .
  2. Right cancellation: .

Proof. For left cancellation: if , multiply both sides on the left by : , so , giving , i.e., . Right cancellation is similar, multiplying on the right by . ∎

Proposition 2.1.5 (Inverse of products). For all : . Note the reversal of order!

Proof. We verify : . Similarly, . By uniqueness of inverses, . ∎

Proposition 2.1.6 (Inverse of inverse). For all : .

Proof. By definition, satisfies . This says that is an inverse of , so by uniqueness, . ∎

By associativity, a product of any number of elements has the same value however we insert parentheses (an induction on proves this), so we omit them. In particular, powers of an element make sense.

Definition 2.1.7 (Powers). For and , set ; for , let , the product of copies of ; and for , let .

The usual laws of exponents hold: and for all , and in particular . For these follow by induction on , and the remaining cases reduce to these by writing negative powers of as positive powers of ; we omit the routine verification. If , then also .

Groups sit in a hierarchy of algebraic structures with fewer or more axioms.

Definition 2.1.8 (Abelian groups). A group is abelian (or commutative) if for all .

Note. It is customary to use additive notation (, , , and for the th power) for abelian groups, and multiplicative notation (, or , ) in general. Multiplicative notation does not imply that the group is non-abelian!

Definition 2.1.9 (Monoids). A monoid is a set with an associative binary operation and an identity element; inverses are not required. Examples: with identity , and with identity .

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.