5.1Algebraic structures and the group axioms
The idea
A group is a set with one operation that is closed, associative, has an identity, and gives every element an inverse. Weaker structures drop some of these: a monoid has no inverses, a semigroup has no identity either.
Think of it like this: A clock: hours with addition mod 12. Doing nothing (0) is the identity, and every move can be undone.
Why it exists
GATE often gives a set and an operation and asks whether it is a group, or which axiom fails.
How it works
- Check closure (the result stays in the set), associativity, identity, then inverses.
- Group = monoid + inverses. Abelian = also commutative.
- (ℤ, +) and (ℤₙ, +ₙ) are groups; (ℤₚ*, ×ₚ) is a group for prime p; Sₙ is non-abelian for n ≥ 3.
- (ℤ, ×) and (ℤₙ, × mod n) are only monoids: 0 has no inverse.
Worked example: Is (ℤ₆, × mod 6) a group?
It is closed, associative, and has identity 1, but 0, 2, 3 and 4 have no inverse. Not a group; in the lab their rows contain no green identity cell.
Now play with it
- →Load "(ℤ₆, × mod 6)" and see that rows 0, 2, 3, 4 have no green identity cell.
- →Load "(ℤ₅, − mod 5)" to see associativity fail.
| ∘ | 0 | 1 | 2 | 3 | 4 | 5 |
|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | 2 | 3 | 4 | 5 |
| 2 | 0 | 2 | 4 | 0 | 2 | 4 |
| 3 | 0 | 3 | 0 | 3 | 0 | 3 |
| 4 | 0 | 4 | 2 | 0 | 4 | 2 |
| 5 | 0 | 5 | 4 | 3 | 2 | 1 |
Green cells are the identity. In a group every row and every column contains each element exactly once (Latin square).
Check in this order: closure, associativity, identity, inverses. Semigroup = closed + associative. Monoid = semigroup + identity. Group = monoid + inverses.
| Structure | Closed | Assoc. | Identity | Inverses | Name |
|---|---|---|---|---|---|
| (ℤ, +) | ✓ | ✓ | ✓ | ✓ | abelian group |
| (ℕ, +) | ✓ | ✓ | 0 (if ℕ has 0) | ✗ | monoid |
| (ℤ, ×) | ✓ | ✓ | ✓ | ✗ | monoid |
| (ℤ, −) | ✓ | ✗ | ✗ | ✗ | neither |
| (ℤ₆, × mod 6) | ✓ | ✓ | ✓ | ✗ | monoid (0, 2, 3, 4 have no inverse) |
| (ℤ₇*, × mod 7) | ✓ | ✓ | ✓ | ✓ | cyclic group of order 6 |
| (2×2 invertible real matrices, ×) | ✓ | ✓ | ✓ | ✓ | non-abelian group |
| (P(A), ∪) | ✓ | ✓ | ∅ | ✗ | monoid |
Look for the failing axiom before testing the rest.
Check yourself
Which is a group?
Exam notes (the dense version)
A structure (S, ∘) is a group if it is closed, associative, has an identity, and every element has an inverse. Without inverses it is a monoid; without identity too, a semigroup. Abelian = commutative. The identity and the inverse of each element are unique. In a group (ab)⁻¹ = b⁻¹a⁻¹ and cancellation holds. Examples: (ℤ, +), (ℤₙ, +ₙ), (ℤₚ*, ×ₚ) for prime p, Sₙ under composition (non-abelian for n ≥ 3). (ℤ, ×) and (ℕ, +) are not groups.
Previous year questions: Groups & Algebraic Structures (13)
PYQs are grouped by topic, so this is the full set for Groups & Algebraic Structures; try the ones that match this subtopic. Open all 13 on the topic page.