statement theorem
Cyclic groups of the same order are isomorphic
Statement
Let and be cyclic groups of the same order, finite or infinite. Then and are isomorphic: there is a bijection with for all .
Remarks
If generates and generates , an isomorphism is for . This map is well defined because exactly when , by the order of a cyclic subgroup. Thus each cyclic group of order is isomorphic to , and each infinite cyclic group is isomorphic to .
Explanations
L1 human
Up to the names of the elements, there is only one cyclic group of each size. To match two of them, send the generator of one to the generator of the other, and send each power to the same power. For example, the rotations of a hexagon and the integers modulo are the same group in two costumes.
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
- Order of a group definition
- 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 cyclic subgroup equals the order of its generator statement
- Cyclic groups of the same order are isomorphic statement
What depends on this
5 nodes use this node, directly or through other nodes.
Sources
- Web https://en.wikipedia.org/wiki/Cyclic_group, Definition and notation
- Web https://en.wikipedia.org/wiki/Cyclic_group, Integer and modular addition