Metric Spaces
Comprehensive module covering 5 sections in Functional Analysis.
REPOSITORY
BMLABS MATHEMATICS REPOSITORY
mathematics.bmlabs.co.in
Author
Dr. Bivash Majumder
Assistant Professor in Mathematics
Prabhat Kumar College, Contai
Abstract Algebra · Subgroups and Normal Subgroups
Learn Order of an Element in a Finite Group in Subgroups and Normal Subgroups.
Understand the central mathematical ideas of Order of an Element in a Finite Group.
Use the key definitions and notation accurately.
Interpret the principal results and their mathematical conditions.
Follow and justify the main proof strategy step by step.
Learning studio
1 concepts
4 guided steps
6 worked items
Learning path
Learning command centre
Progress is stored only in this browser. Academic content remains complete and printable.
1
Definitions
1
Theorems
0
Lemmas
1
Corollaries
2
Proofs
4
Examples
1
Exercises
2
Visual tools
Local progress
Lesson profile
definition
theorem
corollary
Let be a finite group and let . Then is one of the positive divisors of .
introductory
Concepts: Exercises
Go to exerciseInteractive concept atlas
20 concepts · 26 relationships · auto mode
Concept map ready to load
The graph engine loads only when this learning map approaches the viewport.
Order of an Element in a Finite Group Concept Map. 20 concepts.
1
Definitions
4
Results
6
Applications
2
Practice
2 practice items
Lagrange's theorem restricts the orders of subgroups. Since every element of a group generates a cyclic subgroup , it also restricts the order of every element. This is one of the most useful consequences of Lagrange's theorem. Instead of studying alone, we study the subgroup generated by . The size of this subgroup is exactly the order of the element, so it must divide the order of the whole group.
Let be a group with identity element , and let . If there exists a least positive integer such that
then is said to have and the order of is
If no such positive integer exists, then is said to have infinite order.
The order of an element is the length of the cycle created by repeatedly applying that element. In under addition, this means repeatedly adding the chosen element until the cycle returns to . Change and the element to see the generated subgroup . Notice that the cycle length always divides in this finite cyclic example.
Visual laboratory
Dynamic Sandbox
The generated subgroup packages all repeated powers or repeated additions of one element. Its size is the order of the element, so Lagrange's theorem applies immediately.
Let be a finite group. If , then
Given that is a finite group and . To prove that . Since is finite, the cyclic subgroup is finite. Also, is a subgroup of . By Lagrange's theorem,
Since the order of the cyclic subgroup generated by equals the order of , we have
Therefore
Hence, .
Let be a finite group and let . Then is one of the positive divisors of .
Given that is a finite group and . To prove that is one of the positive divisors of . By the previous theorem,
Since is a positive integer, it is a positive divisor of . Hence, is one of the positive divisors of .
This result is often the fastest way to rule out impossible element orders. If , then no element of can have order , because does not divide . However, if divides , Lagrange's theorem alone does not guarantee an element of order .
This calculator computes element order in under addition. Enter a modulus and an element, and it will list the generated subgroup and its size. The formula is specific to this modular additive example. The divisibility conclusion illustrates the general theorem that element orders divide finite group orders.
Interactive calculator
Let be a finite group with . If , then
Therefore the possible orders of elements are among
An element of order cannot occur in such a group.
Let under addition modulo . The element generates
Thus
Since , we have
This agrees with Lagrange's theorem.
Let be a finite group with . Prove that no element of has order .
Let be a finite group with . If , then by Lagrange's theorem applied to ,
But
Therefore no element of can have order .
Let be a finite group with . List all possible element orders allowed by Lagrange's theorem.
Let be a finite group with . By Lagrange's theorem applied to cyclic subgroups, the order of every element divides . The positive divisors of are
Therefore the possible element orders allowed by Lagrange's theorem are
there is no element of order in . 3. Since , we get
Questions to consolidate
Continue learning
Continue with the special case where the order of the whole group is prime.