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 be a nonempty set. A binary operation on is a functionFor , we write for the image of .
We call is closed under the operation when for all
Definition 1.2. A binary operation on is associative if for all :
Definition 1.3. A binary operation on is commutative if for all :
Definition 1.4. An identity element for a binary operation on is an element such that for all :
Theorem 1.5. If a binary operation has an identity element, it is unique.
Definition 1.6. If on has identity , then for , an inverse of is an element such that:
Theorem 1.7. If a binary operation is associative and an element has an inverse, that inverse is unique.
Example 1.8. Addition on is associative, commutative, has identity , and every has inverse .
Example 1.9. Multiplication on (nonzero rationals) is associative, commutative, has identity , and every has inverse .
Example 1.10. Subtraction on is neither associative nor commutative.
Exercise 1.11. Determine whether each operation is associative and/or commutative:
(a) Addition on .
(b) Multiplication on .
(c) Division on .
(d) on .
Exercise 1.12. Let . How many binary operations can be defined on ?
Groups#
Definition 1.13. A group is a set together with a binary operation satisfying:
-
(Associativity) for all .
-
(Identity) There exists such that for all .
-
(Inverses) For every , there exists such that .
Definition 1.14. A group is abelian (or commutative) if for all .
Theorem 1.15. In any group :
- The identity element is unique.
- The inverse of each element is unique.
- for all .
- for all .
Theorem 1.16 (Cancellation Laws). In any group , if , then . Similarly, if , then .
Theorem 1.17. In any group , the equation has a unique solution for for any .
Definition 1.17.1. Let be a positive integer. For , define:
Theorem 1.17.2 (Laws of Exponents). For any and :
Example 1.18. is an abelian group.
Example 1.19. is an abelian group.
Example 1.20. is an abelian group.
Example 1.21. The set of all bijections from a set to itself, with composition, forms a group denoted . When , this is , the symmetric group on elements.
Definition (Symmetric Group). Let be a positive integer. The symmetric group is the set of all bijections (permutations) from the set to itself, with the operation of composition of functions. Its order is .
Example 1.22. The set of invertible matrices over , with matrix multiplication, forms the general linear group .
Example 1.23. The dihedral group is the group of symmetries of a regular -gon. It has elements: rotations and reflections.
Exercise 1.24. Show that is not a group.
Exercise 1.25. Show that the set with multiplication is a group.
Exercise 1.27. Prove that if has exactly two elements, it is abelian.
Exercise 1.28. Let be a group such that for all . Prove that is abelian.
Cayley Tables#
Definition 1.29. A Cayley table (or group table) for a finite group is a table whose rows and columns are labeled by elements of , and whose entry in row and column is .
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: , , , , ,