This sheet introduces the fundamental objects of abstract algebra: sets equipped with operations. We begin with binary operations and build toward the definition of a group.

Commentary. The concept of a group abstracts the idea of symmetry. Just as the symmetries of a geometric object can be composed and inverted, the elements of a group can be combined and inverted. Groups appear throughout mathematics—in geometry, number theory, physics, and beyond. The definition is intentionally minimal: only three axioms are needed to capture this rich structure.


Binary Operations#

Definition 1.1. Let SS be a nonempty set. A binary operation on SS is a function∗:S×S→S.*: S \times S \to S.For a,b∈Sa, b \in S, we write a∗ba * b for the image of (a,b)(a, b).

We call SS is closed under the operation ∗* when ab∈Sab \in S for all a,b∈Sa, b \in S

Definition 1.2. A binary operation ∗* on SS is associative if for all a,b,c∈Sa, b, c \in S:(a∗b)∗c=a∗(b∗c).(a * b) * c = a * (b * c).

Definition 1.3. A binary operation ∗* on SS is commutative if for all a,b∈Sa, b \in S:a∗b=b∗a.a * b = b * a.

Definition 1.4. An identity element for a binary operation ∗* on SS is an element e∈Se \in S such that for all a∈Sa \in S:a∗e=aande∗a=a.a * e = a \quad \text{and} \quad e * a = a.

Theorem 1.5. If a binary operation has an identity element, it is unique.

Definition 1.6. If ∗* on SS has identity ee, then for a∈Sa \in S, an inverse of aa is an element b∈Sb \in S such that:a∗b=eandb∗a=e.a * b = e \quad \text{and} \quad b * a = e.

Theorem 1.7. If a binary operation is associative and an element has an inverse, that inverse is unique.

Example 1.8. Addition ++ on Z\mathbb{Z} is associative, commutative, has identity 00, and every n∈Zn \in \mathbb{Z} has inverse −n-n.

Example 1.9. Multiplication ⋅\cdot on Q∗\mathbb{Q}^* (nonzero rationals) is associative, commutative, has identity 11, and every qq has inverse 1/q1/q.

Example 1.10. Subtraction on Z\mathbb{Z} is neither associative nor commutative.

Exercise 1.11. Determine whether each operation is associative and/or commutative:

(a) Addition on N\mathbb{N}.

(b) Multiplication on Z\mathbb{Z}.

(c) Division on Q∗\mathbb{Q}^*.

(d) max⁡(a,b)\max(a, b) on Z\mathbb{Z}.

Exercise 1.12. Let S={a,b}S = \{a, b\}. How many binary operations can be defined on SS?


Groups#

Definition 1.13. A group is a set GG together with a binary operation ∗* satisfying:

  1. (Associativity) (a∗b)∗c=a∗(b∗c)(a * b) * c = a * (b * c) for all a,b,c∈Ga, b, c \in G.

  2. (Identity) There exists e∈Ge \in G such that a∗e=e∗a=aa * e = e * a = a for all a∈Ga \in G.

  3. (Inverses) For every a∈Ga \in G, there exists a−1∈Ga^{-1} \in G such that a∗a−1=a−1∗a=ea * a^{-1} = a^{-1} * a = e.

Definition 1.14. A group is abelian (or commutative) if a∗b=b∗aa * b = b * a for all a,b∈Ga, b \in G.

Theorem 1.15. In any group GG:

  1. The identity element is unique.
  2. The inverse of each element is unique.
  3. (a−1)−1=a(a^{-1})^{-1} = a for all a∈Ga \in G.
  4. (a∗b)−1=b−1∗a−1(a * b)^{-1} = b^{-1} * a^{-1} for all a,b∈Ga, b \in G.

Theorem 1.16 (Cancellation Laws). In any group GG, if a∗b=a∗ca * b = a * c, then b=cb = c. Similarly, if b∗a=c∗ab * a = c * a, then b=cb = c.

Theorem 1.17. In any group GG, the equation a∗x=ba * x = b has a unique solution for x∈Gx \in G for any a,b∈Ga, b \in G.

Definition 1.17.1. Let nn be a positive integer. For a∈Ga \in G, define:an=a∗a∗⋯∗a⏟n times,a−n=(a−1)n,a0=e.a^n = \underbrace{a * a * \cdots * a}_{n \text{ times}}, \qquad a^{-n} = (a^{-1})^n, \qquad a^0 = e.

Theorem 1.17.2 (Laws of Exponents). For any a∈Ga \in G and m,n∈Zm, n \in \mathbb{Z}:aman=am+n,(am)n=amn.a^m a^n = a^{m+n}, \qquad (a^m)^n = a^{mn}.

Example 1.18. (Z,+)(\mathbb{Z}, +) is an abelian group.

Example 1.19. (Q∗,⋅)(\mathbb{Q}^*, \cdot) is an abelian group.

Example 1.20. (Zn,+n)(\mathbb{Z}_n, +_n) is an abelian group.

Example 1.21. The set of all bijections from a set XX to itself, with composition, forms a group denoted Sym⁡(X)\operatorname{Sym}(X). When X={1,2,…,n}X = \{1, 2, \ldots, n\}, this is SnS_n, the symmetric group on nn elements.

Definition (Symmetric Group). Let nn be a positive integer. The symmetric group SnS_n is the set of all bijections (permutations) from the set {1,2,…,n}\{1, 2, \ldots, n\} to itself, with the operation of composition of functions. Its order is ∣Sn∣=n!|S_n| = n!.

Example 1.22. The set of invertible n×nn \times n matrices over R\mathbb{R}, with matrix multiplication, forms the general linear group GLn(R)\mathrm{GL}_n(\mathbb{R}).

Example 1.23. The dihedral group DnD_n is the group of symmetries of a regular nn-gon. It has 2n2n elements: nn rotations and nn reflections.

Exercise 1.24. Show that (Z,⋅)(\mathbb{Z}, \cdot) is not a group.

Exercise 1.25. Show that the set {1,−1}\{1, -1\} with multiplication is a group.

Exercise 1.26.

Exercise 1.27. Prove that if GG has exactly two elements, it is abelian.

Exercise 1.28. Let GG be a group such that a2=ea^2 = e for all a∈Ga \in G. Prove that GG is abelian.


Cayley Tables#

Definition 1.29. A Cayley table (or group table) for a finite group (G,∗)(G, *) is a table whose rows and columns are labeled by elements of GG, and whose entry in row aa and column bb is a∗ba * b.

Theorem 1.30. In any Cayley table for a group, each element appears exactly once in each row and exactly once in each column.
answer.

Summary#

We have introduced:

  • Binary operations: associativity, commutativity, identity, inverses
  • The definition of a group
  • Abelian groups
  • Elementary properties: uniqueness of identity and inverses, cancellation laws, unique solutions to equations
  • Cayley tables for finite groups
  • Laws of exponents
  • Examples: Z\mathbb{Z}, Q∗\mathbb{Q}^*, Zn\mathbb{Z}_n, SnS_n, GLn(R)\mathrm{GL}_n(\mathbb{R}), DnD_n