Endomorphism of a finite cyclic group 2026-10-14
Every endomorphism of the additive finite cyclic group , for a positive integer , has the form , determined by . This is the self-map case of homomorphism from a finite cyclic group: repeated addition forces the value at every element. Conversely, each choice of respects addition and gives a well-defined map on congruence classes.
Let , the greatest common divisor. The image of a group homomorphism is the cyclic subgroup generated by , with size by order of an element of a finite cyclic group. The kernel of a group homomorphism isIndeed, is equivalent to dividing , after cancelling and using coprimality. Consequently is a group automorphism exactly when and are coprime. In that case a modular inverse of gives . This connects reversible self-maps directly to the generators of a finite cyclic group.[ref]
Past exam of the mathematics course of the University of Cambridge 2013 ia Paper 3 2D Solution Created 2026-09-24 Updated 2026-10-07
A cyclic group has one generator of a group: . An abelian group has for every pair of elements. Powers of one element commute because , so every cyclic group is Abelian. The Klein four-group is Abelian but is not a cyclic group: every nonidentity element has order two, whereas a generator of a group for a four-element cyclic group would have order four.
Fix a generator of a group of . A group homomorphism is determined by because , and the relation forces . Conversely, such a defines : exponents differing by a multiple of give the same value, and addition of exponents verifies the group homomorphism law. Thus the homomorphism from a finite cyclic group correspondence isFor , the order of a permutation is the least common multiple of its disjoint cycle lengths. The condition allows identity, transpositions, two disjoint transpositions, and four-cycles. The sixteen homomorphisms are , with the full list of possible generator imagesThe remaining eight elements of the symmetric group are three-cycles and do not qualify.