Motivation
A homomorphism must preserve an operation, so one cannot choose its values independently at every element. For a cyclic group, choosing the image of one generator determines the whole map. The choice is still constrained: the generator's defining relation must remain true after the map is applied. This tension between freedom and a relation gives a concrete way to calculate maps and their kernels.
We use additive notation and put for . A bar indicates a residue class; subscripts distinguish the domain and codomain when needed.
Definitions
Definition 1.4.1
(Homomorphism, kernel, image and automorphism)
A group homomorphism satisfies . It follows that and for every integer , including negative . Its kernel is the subgroup mapped to zero and its image is the subgroup of attained values. An automorphism is a bijective homomorphism from a group to itself.
Definition 1.4.2
(Order of an element)
If belongs to a group, its order is the least positive integer such that , when such an integer exists. For , its order is
Indeed exactly when . Writing gives . As , Euclid’s lemma makes this equivalent to . This proof also covers , whose order is one.
Theorems
Theorem 1.4.3
(Maps from a cyclic group)
Let . A choice defines a homomorphism with if and only if . When it exists, the map is unique and satisfies . There are exactly such maps; under pointwise addition they form a cyclic group isomorphic to , where means the trivial group.
Concept lensStructural
Maps out of a cyclic group as elements killed by m
Nothing in the existence and uniqueness argument uses that the codomain is cyclic. For any abelian group , written additively, evaluation at is a bijection from the homomorphisms onto
and it turns pointwise addition of maps into addition in . Read this way, the theorem is a statement about the codomain: counting maps is the same as counting elements of whose order divides . Equivalently, a homomorphism out of is a homomorphism out of , which may send anywhere, that happens to vanish on . In the subgroup is generated by and has order ; for instance has six elements.
Proof sketch or proof idea
Proof
(Evaluation at the generator)
If is a homomorphism, , and is forced. Conversely, suppose and define . If , then is a multiple of , so . Thus the value does not depend on the representative. The formula also gives , proving existence and uniqueness.
To count the choices, write , with . The condition is , equivalent to . Thus the possible images of the generator are
They are distinct and form a cyclic subgroup of generated by , of order . Evaluation at is a bijection from the homomorphisms to this subgroup and preserves pointwise addition. It is therefore a group isomorphism. Pointwise addition works here because the codomain is abelian; the analogous assertion for an arbitrary nonabelian codomain requires care.
Proof X-ray
Where the relation my = 0 enters
The proof has three separate jobs, and the relation does different work in each. Necessity is one line: apply to the relation . In the converse, the formula is written through a representative , so the real task is well-definedness. Representatives differ by multiples of , and is exactly what makes those multiples invisible; additivity then costs nothing, since . The count is a divisibility computation: after canceling , the condition becomes , and only the coprimality lets Euclid’s lemma remove . The final step uses ; a pointwise sum of homomorphisms is again a homomorphism only because is abelian.
Theorem 1.4.4
(Kernel, image and automorphisms)
For of order , the image is of order , and the kernel is the subgroup of multiples of , of order . In particular is injective exactly when and surjective exactly when .
Every automorphism of is for a unique unit modulo . Composition corresponds to multiplication of units, so .
Proof
(Orders, kernels and units)
Because , the division argument in “Why the order controls every fiber” gives . Every value of is a multiple of , and every multiple occurs, proving the image claim. Also exactly when . These are precisely , which are distinct. The kernel is trivial exactly when . The image is all of exactly when its order is .
For an endomorphism of , every is a permitted image of because . The map is bijective precisely when has order , equivalently , equivalently is a unit. The endomorphism with parameter followed by that with parameter has parameter . Evaluation is therefore a bijection respecting composition and multiplication, giving the claimed group isomorphism.
Consequently an injective map exists exactly when : necessity follows from the order of the image, and sufficiency from sending to . A surjective map exists exactly when : necessity follows because the order of must be and divide ; when it holds, send to .
Worked examples
Worked example 1.4.5
(All maps from to )
Here and . The six maps send the generator to modulo eighteen. Choose the map with . Since has order three, its image is and its kernel is modulo twelve. Thus by the first isomorphism theorem. Neither an injection nor a surjection from to exists: neither order divides the other in the required direction.
Worked example 1.4.6
(Automorphisms of )
The units modulo eight are . They define all four automorphisms. Each of the three nonidentity units squares to one modulo eight, so every nonidentity automorphism has order two. Therefore this automorphism group is the Klein four group, not a cyclic group of order four. Knowing the number of maps alone does not determine their composition law.
Worked example 1.4.7
(The order of a map versus the order of its value)
An automorphism is itself a group element, but the operation in its group is composition. Its order measures how many applications return every input to itself. This differs from the additive order of a value in the original cyclic group. Write with . Induction gives . Thus its order is the smallest positive for which : this congruence makes the iterate fix every element, and conversely the identity map must fix the generator.
For example, take multiplication by two on . Its successive multipliers are modulo seven, so the third iterate is the identity. Neither earlier iterate is the identity, since each moves the generator. The automorphism therefore has order three. Its inverse is multiplication by four, because applying these two maps successively multiplies by eight, which is one modulo seven.
In contrast, the image has additive order seven, as it generates . Even the identity automorphism has a generator image of additive order seven, although the map itself has order one. The distinction is between adding an element repeatedly and applying a function repeatedly; both operations occur here, but in different groups.
Worked example 1.4.8
(A surjection with nontrivial kernel)
The map defined by is well defined because . Its image is all of , while the kernel consists of modulo twelve. Thus a surjective homomorphism need not be injective. The order of the image of a generator, rather than the visual size of the chosen representative, controls the kernel.
Counting injective and surjective maps
The divisibility conditions say when a map of the requested kind exists. Counting requires one more step: identify which possible images have exactly the required order. If , the elements annihilated by form the unique subgroup of of order . It is generated by , and it has generators, where counts the residue classes coprime to . These and only these choices give injections. If , there are none.
Similarly, a map is surjective exactly when its generator image generates . There are such choices, but all are permitted only if . Otherwise there is no surjection. Thus the number of all homomorphisms, , should not be confused with the numbers of injections or surjections. For , there are four homomorphisms but only two surjections, corresponding to generator images and .
Worked example 1.4.9
(The Chinese remainder theorem and automorphisms of )
The units modulo twelve are , giving four automorphisms of . The Chinese remainder ring isomorphism restricts to an isomorphism of unit groups: a pair is invertible exactly when both coordinates are invertible. The coordinate unit groups each have two elements, so the automorphism group is .
For example, multiplication by five corresponds to multiplication by in the two coordinates; it fixes the coordinate and negates the coordinate. Multiplication by seven corresponds to , and multiplication by eleven to . This computation explains the composition law as coordinatewise multiplication. The group itself is cyclic, but its automorphism group need not be.
Why the order controls every fiber
The statement that whenever deserves a proof: it is stronger than merely saying that is the smallest positive integer that kills . Divide by to write with , even when is negative. If , then . The minimality of forces . The converse is immediate. In particular, ensures , so the list of kernel elements above really is a list of distinct residue classes modulo .
The kernel also describes what happens away from zero. For any ,
Thus, if is in the image and , its entire fiber is the coset . No other elements occur in that fiber. If is outside the image its fiber is empty. All nonempty fibers consequently have elements; there are of them. This is a concrete form of the first isomorphism theorem: the rule is well defined and is a bijective homomorphism from onto . It does not identify the quotient with the entire codomain unless the map is surjective.
Worked example 1.4.10
(Reading fibers and distinguishing maps)
Let send to and respectively. Both choices satisfy the domain relation: twelve times either image is zero modulo eighteen. Both images have order three, so both kernels are , and both images are . Nevertheless because they differ at the generator.
For , the three cosets , , and map respectively to , , and . Hence the solutions of are modulo twelve. Under , that same coset maps to instead. The kernel determines which inputs are identified, but a further choice identifies the quotient with a particular subgroup of the codomain. Even the kernel and image together do not necessarily determine the map.
Changing the domain generator
The coordinates in the classification depend on a chosen generator. Suppose is coprime to and set . Then generates , and if , necessarily . Conversely, choose an integer with . Since , the value at the original generator can be recovered from the new coordinate as . A different choice of gives the same result because two such choices differ by a multiple of . For example, in the preceding map , the generator maps to ; this is the same map, not the map , because sends to .
Common mistakes
Common mistake
(A generator need not map to a generator)
The image of a generator of the domain generates the image of the map, not necessarily the codomain. It may generate a proper subgroup, or be zero: the zero map is a homomorphism for all , and in the first worked example the generator of goes to , which generates a subgroup of order three.
The opposite error is to treat the generator image as completely free.
Counterexample mode
An arbitrary generator image is not allowed
Claim: because generates , any may be chosen as . Take , and . The only candidate is . But , while the formula gives for the representative and for the representative . One input receives two values, so no function, let alone a homomorphism, has been defined. Equivalently, the relation would require , yet . The repaired statement is the theorem: is allowed exactly when . Here the allowed images are and , giving maps.
Common mistake
(Units, not residues, form the automorphism group)
The formula concerns the multiplicative group of units, not the additive group of the residue ring. For the automorphism group has elements rather than eight, and it is the Klein four group rather than . Also, replacing the chosen generator of the domain changes the coordinate describing a map, although it does not change the map, its kernel or its image.
Homomorphisms between finite direct products split into coordinate maps, so the gcd count extends to every such pair of groups.
A path to generalization
Maps between products of cyclic groups
Homomorphisms between finite direct products split into coordinate maps, so the gcd count extends to every such pair of groups.
For abelian groups, a homomorphism is the same as an array of homomorphisms : restrict to each domain factor and project to each codomain factor. Pointwise addition acts entrywise, so the group of all such maps is isomorphic to . For instance, there are homomorphisms . Composition of maps becomes multiplication of the arrays.
Summary
Choose the image of a generator, check its order divides the domain order, and compute its order to obtain both kernel and image. For automorphisms, the permitted images are exactly the generators, equivalently the units modulo the group order.
Exercises
Quick check
(List the homomorphisms by their generator images. Find the kernel and image of each nonzero map.)
Solution · Answer
The gcd is three, so the possible generator images are modulo fifteen. Each nonzero image has order three, giving image and kernel modulo six.
Quick check
(Determine whether injective and surjective maps exist, giving a map whenever possible.)
Solution · Answer
Since , sending to is injective: has order eight. A surjection is impossible because .
Quick check
(Find and exhibit an element generating it.)
Solution · Answer
The units modulo five are . Powers of are , so the automorphism generates a cyclic group of order four.
Quick check
(For , prove that the number of injective maps is when and zero otherwise, where counts the units modulo .)
Solution · Answer
If , no injection exists by the theorem. If , the unique subgroup of order in is generated by : the solutions of form a subgroup with exactly elements. Every subgroup of order is contained in it: by Lagrange’s theorem the order of each element of divides . Equal cardinalities then give equality. An injection must send the generator to one of that subgroup's generators. Those generators are its multiples by integers coprime to , exactly choices.