This chapter establishes the central idea of abstract algebra: the study of sets equipped with operations, and the structure-preserving maps between them. The goal is not to memorize vocabulary but to absorb the habit of treating the operation as part of the object.
§1.1 What algebra is about
Remark 1.1 (The core idea)
Abstract algebra studies sets with operations and the structure-preserving maps (homomorphisms, isomorphisms) between them. The key insight: the same underlying set can carry different algebraic structures depending on which operation is imposed.
Example: The set under addition is a group, but under multiplication is not (most elements lack multiplicative inverses). Same set, different structures, fundamentally different behavior.
Figure: the same underlying set can support different algebraic structures.
The point of the figure is that the operation is part of the data; changing the operation changes the object.
Remark 1.2 (Why abstraction matters)
Abstraction is not generalization for its own sake. It serves three purposes:
- Unification. Seemingly unrelated objects (rotations of a square, residue classes mod , permutations of a set) turn out to satisfy the same axioms, so one proof covers all cases.
- Structural invariants. Instead of computing with specific elements, one reasons about properties (like element orders or subgroup lattices) that are preserved under isomorphism.
- Transfer of problems. An isomorphism via allows one to turn additive problems into multiplicative ones and vice versa.
§1.2 Symmetries as motivation
Definition 1.3 (Symmetry of a geometric object)
A symmetry of a geometric figure is a rigid motion (distance-preserving transformation) of the plane that maps the figure onto itself. The set of all symmetries, under composition, forms a group.
Example 1.4 (Symmetries of an equilateral triangle)
An equilateral triangle has symmetries:
- rotations: by , , and about the center.
- reflections: across each altitude.
These form the dihedral group (also called , the symmetric group on elements), of order . This is the simplest nonabelian group one encounters naturally.
§1.3 The dihedral group : symmetries of the square
Definition 1.5 (Dihedral group )
The dihedral group of the square, denoted , is the group of all symmetries of a square. It has elements.
Label the vertices of the square (clockwise). The elements are:
| Element | Description | Effect on vertices |
|---|---|---|
| identity | ||
| rotation by | ||
| rotation by | ||
| rotation by | ||
| reflection across vertical axis | ||
| reflection across diagonal - | ||
| reflection across horizontal axis | ||
| reflection across diagonal - |
Group structure: The group is generated by (rotation by ) and (one reflection), subject to:
The relation says that conjugating a rotation by a reflection reverses the direction of rotation. This is the defining feature of dihedral groups.
Remark 1.6 ( is not abelian)
Since (in fact ), the group is nonabelian. This is visible from the geometry: rotating then reflecting is not the same as reflecting then rotating.
Example 1.7 (A computation in )
Compute in .
Using the relation :
So . In terms of the table above, the composition of a rotation with the diagonal reflection gives the other diagonal reflection.
§1.4 Modular arithmetic as a preview
Definition 1.8 (Integers modulo )
For a positive integer , define the set
with addition modulo : .
Example 1.9 ( addition table, partial)
In : (since ).
Key observations:
- Identity: .
- Inverses: The inverse of is . For instance, in , the inverse of is .
- Cyclic: generates all of by repeated addition.
Remark 1.10 (Why modular arithmetic matters in algebra)
is the simplest family of finite groups. It provides test cases for every definition and theorem in the course: subgroups, cyclic groups, homomorphisms, quotients, and direct products all have clean concrete manifestations in .
§1.5 The same set, different structures
Example 1.11 (A non-standard operation on )
On , define . Then is a group:
- Closure: for .
- Associativity: .
- Identity: , since and .
- Inverses: The inverse of is , since .
Moreover, defined by is an isomorphism:
So is just the usual additive integers in disguise. This illustrates why algebra studies structures up to isomorphism, not specific element names.
§1.6 Axiom-failure diagnosis
Remark 1.12 (Name the first failure)
When a proposed algebraic structure fails to satisfy the axioms, one should identify the first failing axiom in the logical order: (1) closure, (2) associativity, (3) identity, (4) inverses.
| Proposed structure | First failure |
|---|---|
| Division on | Not a binary operation (closure: ) |
| Identity () | |
| Inverses () | |
| Inverses (singular matrices) | |
| Associativity ( generally) |
Mastery Checklist
- Explain what extra data distinguishes an algebraic structure from a bare set.
- List all elements of and perform computations using and .
- Describe the symmetries of a regular -gon and why they form a group.
- Compute in (addition, inverses, orders of elements).
- Give an example of two different group structures on the same underlying set.
- Diagnose precisely why a proposed structure fails to be a group (name the first failing axiom).