statement theorem
Automorphism group of a cyclic group
Statement
Let be a positive integer and let be a cyclic group of order . For each integer with , the map is an automorphism of . The map is an isomorphism from the group of units to .
Remarks
An automorphism of is determined by the image of , and this image must be a generator with . Thus , where is Euler's totient function. For the infinite cyclic group, .
Explanations
L1 human
An automorphism of a cyclic group must send a generator to a generator. Each choice of a generator gives exactly one automorphism. For , the generators are , so there are four automorphisms, given by multiplication by .
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 19 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Binary operation definition
- Group concept
- Associativity definition
- Identity element definition
- Group homomorphism definition
- Laws of exponents in a group statement
- Subgroup definition
- Semigroup definition
- Inverse element definition
- Group isomorphism definition
- Order of an element definition
- Cyclic subgroup generated by an element definition
- Monoid definition
- Automorphism group definition
- g to the n equals 1 iff the order divides n statement
- Cyclic group definition
- Group of units of a monoid definition
- Order of a power statement
- Automorphism group of a cyclic group statement
Sources
What links here
No node links to this node yet.