FP2 1.3 - Orders of elements and subgroups
Find the order of a group and of an element, and recognise subgroups (FP2 1.3). You will locate the first return to the identity, test a subset using the original operation and construct the subgroup generated by one element.
Count the group and find an element's first return
How can a matrix have order while belonging to a group of order ? The word “order” is doing three different jobs. Matrix dimensions, group size and repeated action must be kept separate.
You already know
A group has an identity and an inverse for every element. A Cayley table records the stated operation. Powers mean repeated group operation: for additive groups, use repeated addition. A generator reaches every group element by its powers.
For example, , under multiplication modulo , has six elements. Multiplying a particular member repeatedly can return to sooner than six steps.
Group order and element order
The order of a finite group is its number of elements, written .
The order of an element is the least positive integer with
We write . If no such positive integer exists, has infinite order. In an additive group, find the least positive for which under its addition.
Minimality matters: finding one power equal to the identity is not enough if an earlier positive power does the same. The identity itself has order , because ; exponent zero is not a positive candidate.
Worked example 1: a return after three factors
Question. In the multiplicative group , determine and the order of .
Plan. Count the allowed elements, then list powers of until the identity first appears.
Why this step? The first return, rather than the group's number of members, determines this element's order.
Answer. and .
Check. too, but is not the least positive exponent.
Change only the element from to , keeping the group and operation fixed.
Worked example 2: an element that reaches the whole group
Question. Determine the order of in .
Plan. Multiply by repeatedly and check all earlier powers before claiming an order.
Why this step? None of the preceding five powers is , so the return at six is minimal.
Answer. . Its powers include every member, so generates .
Check. The six residues are distinct.
An element and its inverse have the same order: reversing a return cycle gives a cycle of the same least length. The order definitions and this consequence are not in the formula booklet.
Watch out
“, therefore has order ” misses minimality. Since , its actual order is . Always check the first positive return.
Keep the ambient group fixed and try another element.
Test a subset under the same operation
A subgroup is a smaller group living inside a known one. You keep the original operation; you do not invent a new operation to make a chosen subset work.
Subgroup
A nonempty subset is a subgroup if it forms a group under the operation inherited from .
Associativity is inherited. Check that products stay in , that the original identity is in , and that the inverse of every member is in .
The sets and are always subgroups. A proper subgroup differs from ; the empty set is never a subgroup.
Why must the identity be the original one? Writing the operation multiplicatively, if and were its subgroup identity, then ; cancelling in the ambient group gives . The inherited identity and inverses are not optional choices.
Worked example 3: a subgroup of modular addition
Question. In under addition modulo , show that is a subgroup. State its order.
Plan. Use a small table for closure, then check identity and inverses; associativity comes from .
Why this step? The full table checks every ordered pair in this finite subset, rather than just a few selected pairs.
Answer. The table proves closure; is the identity, is its own inverse and are inverses. Associativity is inherited. Thus is a subgroup with .
Check. Repeatedly adding gives , exactly the three elements.
Change only the subset by removing , leaving .
Worked example 4: identity membership is not enough
Question. Is a subgroup of the same group ?
Plan. Test closure with the remaining nonidentity element.
Why this step? Containing the identity cannot repair a product that leaves the proposed subgroup.
Answer. No. is not a subgroup.
Check. Its element also lacks its required inverse inside .
Continue this lesson.
You’re previewing NovaLearn without an account. Create a free account to read the rest.
Create free account