Order of Elements

Abstract Algebra · Axiom Academy

Discover how elements cycle through powers, when they return to identity, and how this creates the fundamental building blocks of group theory. In other words, the order tells us how many times we must compose an element with itself before returning to the identity. Let's visualize this cycling process: 2. Example: Finite Order in ℤ₆ Consider the element 2 in the group (ℤ₆, +). Let's compute its powers (multiples under addition): 2³ = 2 + 2 + 2 = 6 ≡ 0 (mod 6) Since 2³ = 0 (the identity in ℤ₆), we have ord(2) = 3 . Notice how the element cycles through exactly 3 distinct values before returning to the identity. This cycling pattern is characteristic of finite order elements. Not all elements have finite order. The behavior depends on both the element and the group structure: - 4¹ = 4 - 4² = 8 ≡ 0 (mod 8) - ord(4) = 2 - Eventually returns to identity - 2¹ = 2 - 2² = 4 - 2³ = 6, 2⁴ = 8, ... - Never returns to 0 4. Connection to Cyclic Subgroups When we take all powers of an element a , we generate a subgroup called the cyclic subgroup generated by a , denoted ⟨ a ⟩: This is the smallest subgroup containing a , consisting of all possible powers of a . Watch how repeatedly applying the element builds up the entire cyclic subgroup, with each power adding a new element until we cycle back. This profound connection means that counting how many steps until we return to identity is the same as counting the number of distinct elements in the subgroup generated by a .

This is the written version of the interactive lesson above. See the full Abstract Algebra course.