Group theory studies sets with one operation that follows a few strict rules. This cheat sheet helps students recognize when a structure is a group and use the most important results efficiently. It is useful for organizing examples such as integers under addition, nonzero real numbers under multiplication, and symmetry operations.
These ideas build the foundation for higher algebra, number theory, and modern mathematics.
The core definition requires closure, associativity, an identity element, and inverses. Important tools include subgroup tests, cyclic group notation, element order, cosets, and Lagrange’s theorem. Many problems come down to checking whether an operation is well defined and whether the group axioms hold.
Once a group is known, formulas such as give powerful shortcuts.
Key Facts
- A group is a set with an operation that satisfies closure, associativity, identity, and inverses.
- Closure means that for all , the result .
- Associativity means that for all , .
- An identity element satisfies for every .
- An inverse of is an element such that .
- A group is abelian if for all .
- The order of an element is the smallest positive integer such that , if such an exists.
- Lagrange’s theorem says that if and is finite, then divides and .
Vocabulary
- Group
- A group is a set with one binary operation that satisfies closure, associativity, an identity element, and inverses.
- Abelian Group
- An abelian group is a group whose operation is commutative, so for all elements.
- Subgroup
- A subgroup is a subset of a group that is itself a group under the same operation, written .
- Cyclic Group
- A cyclic group is a group generated by one element , meaning every element can be written as for some integer .
- Coset
- A left coset of in has the form for some .
- Order
- The order of a finite group is its number of elements, and the order of an element is the least positive with .
Common Mistakes to Avoid
- Forgetting to check closure is wrong because an operation can look valid but produce results outside the set, so it cannot form a group.
- Assuming commutativity is automatic is wrong because groups only require associativity, and many important groups have .
- Using the wrong identity element is wrong because the identity must satisfy both and for every element in the set.
- Confusing element order with group order is wrong because counts all elements in the group, while counts powers of one element until appears.
- Applying Lagrange’s theorem backward is wrong because does not guarantee that a subgroup of order exists.
Practice Questions
- 1 Determine whether is a group, and identify its identity element and the inverse of .
- 2 In the group under addition modulo , find the order of the element .
- 3 If is a finite group with and with , find the index .
- 4 Explain why the set of nonzero integers under multiplication is not a group, even though multiplication is associative.