statement theorem
Subgroups of a finite cyclic group correspond to divisors of its order
Statement
Let be a cyclic group of finite order , generated by . For each positive divisor of , has exactly one subgroup of order , namely . Each subgroup of has this form for some positive divisor of .
Remarks
Thus the number of subgroups of is the number of positive divisors of . For dividing , the subgroup of order is contained in the subgroup of order exactly when divides . For example, has six subgroups, of the orders .
Explanations
L1 human
In a cyclic group, the subgroups are as simple as possible: there is one for each divisor of the order. In the clock group , the subgroup of order is , generated by . The order of each subgroup divides , as Lagrange's theorem says, and here every divisor occurs.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 10 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Group concept
- Laws of exponents in a group statement
- Subgroup definition
- Order of an element definition
- Cyclic subgroup generated by an element definition
- g to the n equals 1 iff the order divides n statement
- Cyclic group definition
- Order of a power statement
- Subgroups of cyclic groups are cyclic statement
- Subgroups of a finite cyclic group correspond to divisors of its order statement
What depends on this
1 node uses this node, directly or through other nodes.