Executive summary
Group theory begins by asking a modest question: when two objects are combined, does the result remain in the same system, and which rules survive repeated combinations? The source develops the idea through arithmetic and geometric transformations before stripping away the geometry and defining an abstract group. This route is valuable because it shows that a group is not a collection of special objects; it is a set equipped with one binary operation satisfying closure, associativity, an identity rule and an inverse rule. Transformation groups provide the first concrete model. They also explain why multiplication need not commute: doing one transformation and then another can differ from reversing the order.
What this handbook page teaches
- Recognise when a proposed rule is a binary operation on a specified set.
- Build a transformation group from bijections and composition.
- Apply the group axioms without assuming commutativity.
- Use identity, inverse and cancellation properties to solve simple group equations.
- Separate the nature of elements from the algebraic structure of their operation.
Core concepts
The recurring method is to replace the physical meaning of the objects by the rules governing how they combine.
Binary operations and closure
A binary operation on a set assigns an element of the same set to every ordered pair of elements. The phrase 'of the same set' is the closure requirement. Addition is a binary operation on the integers, but subtraction is not a binary operation on the natural numbers if negative results are excluded. The ordered-pair viewpoint also warns that the first and second inputs can play different roles.
Closure must be checked against the exact set named in the problem. For example, multiplying two odd integers stays odd, but adding two odd integers produces an even integer. A familiar arithmetic operation may therefore be a valid binary operation on one subset and invalid on another.
Transformations as a model
A transformation is a bijection of a set onto itself. Two transformations can be composed by applying one and then the other. Composition stays within the set of transformations, each transformation has an inverse, and the identity transformation does nothing. These facts make suitable collections of transformations natural groups.
Geometric symmetries are especially useful because the operation can be inspected by following labelled vertices. Rotations of a regular triangle form a three-element cyclic group. Adding reflections produces a six-element non-commutative group, demonstrating that order of composition matters.
The abstract group axioms
An abstract group keeps only the operation and its rules. Associativity means (ab)c = a(bc). There is one identity element e with ea = ae = a. Every element a has an inverse a^-1 satisfying aa^-1 = a^-1a = e. Closure is built into the statement that the operation is defined on the set.
Commutativity, ab = ba, is an additional property, not part of the group definition. This distinction is essential later because the degree of non-commutativity ultimately separates groups compatible with radical constructions from groups that obstruct them.
Working method
Use the following sequence as a repeatable analysis workflow. The steps are ordered to separate definitions and admissibility checks from structural conclusions, so a result can be audited without relying on intuition or an unverified diagram.
- State the set and operation precisely. Never test group properties before fixing both.
- Check closure first: every product of two admissible elements must remain admissible.
- Verify associativity from a known associative operation or by direct argument. A multiplication table alone can make this laborious, so use structural reasoning where possible.
- Identify the identity and verify it works on both sides. Then find an inverse for every element.
- Only after the group axioms hold, classify further properties such as finite order, commutativity, cyclic generation or subgroup structure.
- When solving equations such as
ax=b, multiply on the correct side by the inverse; in a non-commutative group left and right operations cannot be interchanged casually.
Working with a small symmetry group
Take the rotations of a regular triangle: rotation by zero, by one third of a full turn, and by two thirds of a full turn. Composing two rotations adds their angles modulo one full turn. The zero rotation is the identity, and the two non-trivial rotations are inverses of each other. The operation is associative because composition of mappings is associative.
Now include the three reflections. Closure and inverses remain valid, but commutativity fails. A reflection followed by a rotation may move a labelled vertex differently from the rotation followed by the reflection. This gives a concrete check that a group can satisfy every axiom while still having ab ≠ ba.
The practical lesson is to compute transformations by their action on a small set of reference points. If two transformations send every reference point to the same image, they are equal. This technique is faster and less error-prone than relying on visual intuition alone.
Technical reasoning and deeper connections
Associativity deserves particular care because it is not the same as commutativity. Associativity changes brackets while preserving order; commutativity changes order. In a group, a long product can be written without brackets because all bracketings give the same result, but the factors generally cannot be rearranged.
The identity and inverse are unique. If two elements both act as identities, multiplying them shows they coincide. If two elements are both inverses of the same element, associativity and the identity rule show they coincide. These uniqueness facts make notation such as e and a^-1 unambiguous.
Cancellation follows from inverses. From ab = ac, multiply on the left by a^-1 to obtain b=c. From ba = ca, multiply on the right. This gives uniqueness of solutions to simple group equations and replaces division in settings where no numerical division exists.
The source moves quickly from geometric examples to abstraction because later arguments depend only on structure. Two visually unrelated systems can therefore be treated identically when their multiplication rules are equivalent. That transition motivates the later notion of isomorphism.
Quick-reference matrix
| Test | Question to ask | Typical failure |
|---|---|---|
| Closure | Is every result still in the set? | Subtraction on natural numbers. |
| Associativity | Can brackets move without changing value? | A custom operation may fail even if it looks arithmetic. |
| Identity | Is there one element neutral on both sides? | One-sided neutrality is insufficient. |
| Inverse | Does every element undo on both sides? | Zero under multiplication has no inverse. |
| Commutativity | Can factor order be reversed? | Symmetry groups with reflections usually show failure. |
Common mistakes
- Checking only a few products and assuming closure for all pairs.
- Confusing an inverse transformation with a reciprocal number.
- Reversing the order of composition. Fix a convention and use it consistently.
- Assuming any multiplication table defines an associative operation.
- Treating commutativity as a required group axiom.
- Using left cancellation to justify a right-sided manipulation in a non-commutative group.
Verification checklist
Before accepting a solution or proof, confirm each item below. These checks are intentionally practical: they catch the most common category errors, missing hypotheses and structure mismatches.
- The set and operation are stated before calculations.
- Closure is proved for arbitrary elements, not just examples.
- Identity and inverses are checked on both sides.
- Composition order is explicit.
- Associativity is justified independently of commutativity.
- Any claim of commutativity is tested with arbitrary elements or a decisive counterexample.
Frequently asked questions
Can an infinite set form a group?
Yes. Finiteness is not part of the definition. The integers under addition are a standard infinite example.
Can a set be a group under one operation but not another?
Yes. The operation is part of the structure. The non-zero real numbers form a group under multiplication, while all real numbers do not because zero lacks a multiplicative inverse.
Why start with transformations?
They make identity, inverse and composition tangible and provide non-commutative examples early.
Why are groups important to polynomial solvability?
Later, permutations of branches produced by continuation form groups. Their structural properties determine whether radical representation is possible.
Source basis: this page is a handbook-style synthesis of the uploaded mathematics source, principally sections 1.1, 1.2, 1.3. It paraphrases the supplied material and does not reproduce source artwork or long source passages. Historical names, publisher details and personal details have been intentionally omitted.