A homomorphism from a cyclic group is determined by the image of a generator. But that image cannot be chosen freely: it must respect the relation that makes the generator return to zero. This section turns that observation into a complete classification of maps between finite cyclic groups and uses kernels and images to check the answer. We use additive notation and write for the class of the integer modulo .
The one relation that controls the map
Proposition 6.1.1
(Homomorphisms out of a cyclic group)
Let . For every with there is exactly one group homomorphism with , namely . Every homomorphism arises this way, and is necessary.
Proof
(Additivity forces the formula; the relation makes it well defined)
Suppose is a homomorphism and set . Additivity forces
Since , necessarily in . Conversely, if , the displayed formula defines a homomorphism: when , their difference is for some integer , so . Thus the formula is independent of the chosen representative, and it preserves addition. Every allowable gives exactly one map.
Proof X-ray
Where the relation is used
The proof has two halves with different jobs. Necessity of comes from applying to the single identity . Sufficiency is the well-definedness check: a class has many representatives , and the formula gives them the same value exactly when . Additivity of in is automatic, so well-definedness is the only place where a hypothesis on enters.
This argument works for a target group written multiplicatively as well: a homomorphism from is determined by , and it exists exactly when . The element need not have order equal to ; its order only has to divide . The trivial map is a simple example.
Counterexample mode
A generator image that breaks the relation
Claim: sending to extends to a homomorphism . It does not. The classes and are equal, but the formula gives and , which differ. Equivalently , so the relation fails. The correct statement allows only with in , that is .
Common mistake
(The image of the generator must have order m)
It is tempting to require to have order exactly , as if it had to generate an isomorphic copy. The condition is only , that is, the order of divides . For example has order 2, and is a homomorphism with kernel . Order exactly is the condition for an injective map.
Counting all maps
Proposition 6.1.2
(Number of homomorphisms between cyclic groups)
Let and . The homomorphisms are exactly the maps with for , so there are of them. If , then has order and , which has elements.
Proof
(Solving , then reading off order and kernel)
Write and with . If , the condition is , or equivalently . By Euclid's lemma this is equivalent to . Hence the permitted images are precisely
They are distinct modulo : equality of the th and th entries implies , which with gives . Therefore there are exactly homomorphisms. This counts maps, not necessarily distinct kernels or images.
If , the image is the cyclic subgroup . Its order is
including , where . To see the formula, the smallest positive for which is a multiple of is after canceling the gcd. Consequently
The divisibility condition is independent of the representative because , a consequence of . There are kernel elements, and . This agrees with the first isomorphism theorem, but also gives an explicit way to list the classes.
Worked examples
Worked example 6.1.3
(Six maps from to with fewer images)
Classify maps . Since , the possible images of are modulo 18. Their image orders are, respectively, . For example, if , then and neither nor is zero. The kernel consists of the four classes
and the image is . The map with has the same kernel and image but is a different homomorphism, since it sends to a different element. Thus a kernel and image alone need not determine a map.
The explorer below tests a candidate image of the generator for any and up to 30: it shows the relation , the kernel and image when the candidate is allowed, and the clash when it is not.
A map onto exists exactly when : if it is onto, the image of the generator must have order , which must divide ; conversely has order and satisfies when . Hence none of the maps in the first example is onto. An injective map exists exactly when : its generator image must have order , and if , the element has order and defines such a map.
Worked example 6.1.4
(All homomorphisms from to )
Here and . The four possible generator images are modulo 12; each defines for its chosen representative . Take . The element has order . Hence the kernel consists of with , namely , and the image is . The sizes satisfy , as they must. The other generator images give kernel and image sizes , and for respectively, and again has image of order 4.
Worked example 6.1.5
(Edge cases: coprime orders and divisibility)
For , we have , so the only homomorphism is the zero map: forces because 5 is invertible modulo 7. For , we have and , so every is allowed. The two nonzero choices are onto and have kernel , in agreement with . For , we have and allowed images ; the two nonzero choices have trivial kernel, so they are injective, as predicts.
Practice
Quick check
(How many homomorphisms are there, and what are the possible images of ?)
Compute and .
Solution · Answer
and , so there are five homomorphisms, with in . Each nonzero choice has image of order , since .
Quick check
(Is there a homomorphism sending to ?)
Test the relation .
Solution · Answer
No. Here and , so . The only allowed images are and , since and .
Exercise 6.1.6
(Among all homomorphisms , find those whose image has exactly six elements. Give their common kernel and decide whether either is injective or surjective.)
Core
Solution(4)
- 1
Find the allowed generator images
The allowed images are modulo 12.
Because: and .
- 2
Select those whose image has order six
Key step
The orders are , so exactly and qualify. The maps are and .
Because: The image of has order .
- 3
Compute the kernel
Both maps have kernel .
Because: The kernel is with .
- 4
Decide injectivity and surjectivity
The kernel has three elements, so neither map is injective. The image has six elements, fewer than 12, so neither is surjective. The two maps are still distinct, since their values on are and .
Because: A nonzero kernel prevents injectivity; an image of size 6 inside a group of 12 prevents surjectivity.