Let M be a [[Exercise A0.III.6.16#definition-cyclic-module|cyclic]] R-module, with M≅R/I for an ideal I (6.16.C2), and let N be another R-module. Let Q be a submodule of N given by
Q:={n∈N∣(∀a∈I):an=0}.
Then
HomR-Mod(M,N)≅Q.
Proof
Let π:R→R/I be the quotient map and let a∈I. If φ:M→N is a homomorphism, then
aφ(π(1))=φ(aπ(1))=φ(π(a))=0.
Now, consider the map v:HomR-Mod(M,N)→Q given by ψ↦ψ(π(1)). It is immediate that it is a module homomorphism. It is injective, since each element of HomR-Mod(M,N) is determined uniquely by its value on π(1) due to M being cyclic.
It is surjective. By the universal property of a quotient, whenever a map τ:R→N sends I to 0, it must factor uniquely through the quotient M, giving a homomorphism φn:M→N,π(1)↦n for every value n∈N such that for all a∈I,an=0.
So v is an isomorphism.
■
NOTE
The same proof shape works without assuming commutativity of R, giving an isomorphism of abelian groupsHomR-Mod(M,N)≅Q.
Proposition (H2)
For all a,b∈Z>0 we have HomAb(Z/aZ,Z/bZ)≅Z/gcd(a,b)Z.
Proof
DANGER
This proof is trash but I don’t know any better way. Trying to use H1 leads to even more number chasing.
A homomorphism f:Z/aZ→Z/bZ is defined by its action on [1]a.
Suppose the order of [k]b divides a and f([1]a)=[k]b. Then the map q:Z→Z/bZ given by q(1)=[k]b (well-defined by the universal property of Z) has the property q(an)=[ank]b=[0]b. So aZ⊆ker(q) and hence it factors uniquely (via the universal property of quotients) through Z/aZ.
This shows that HomAb(Z/aZ,Z/bZ) contains all homomorphisms sending [1]a to an element of order dividing a, and only those homomorphisms (since for any homomorphism g, ∣g(x)∣ divides ∣x∣).
Recall that every subgroup of Z/bZ is cyclic and has order that is a factor of b. Recall also that for two subgroups A,B≤Z/bZ the subgroup A+B is the smallest subgroup containing both A and B.
Now take the sum of all subgroups of Z/bZ whose order divides a. The order of this sum would be the product of the multiset of prime factors of b contained within the multiset of prime factors of a. But this is, by definition, gcd(a,b).
So there are exactly gcd(a,b) suitable elements of Z/bZ. Let [m]b∈Z/bZ be an element of order gcd(a,b) (in Ab, every factor of a finite group’s order corresponds to a subgroup). By definition, [m]b generates the cyclic group Z/gcd(a,b)Z.
Take f∈HomAb(Z/aZ,Z/bZ) defined by f([1]a)=[m]b. Note that nf sends [1]a to n[m]b. Take any element [u]b of Z/gcd(a,b)Z. Since [m]b generates Z/gcd(a,b)Z,[u]b=k[m]b for some k∈Z. So kf gives the unique homomorphism sending [1]a to [u]b. Thus, f generates the whole group.
Any two cyclic group of identical order are isomorphic.