R-module homomorphisms isomorphic to codomain

  • Thread starter Thread starter Kreizhn
  • Start date Start date
  • Tags Tags
    Homomorphisms
Kreizhn
Messages
714
Reaction score
1

Homework Statement


Let R be a commutative ring, and M be an R-module. Show that
\text{Hom}_{\text{R-mod}}(R,M) \cong M
as R-modules, where the homomorphisms are R-module homomorphisms.

The Attempt at a Solution



This should hopefully be quick and easy. The most natural mapping to consider is
\phi: \text{Hom}_{\text{R-mod}}(R,M) \to M sending f \to f(1_R). It is simple to show that this is a R-mod homomorphism, and that it is injective. Where I am stuck is surjectivity.

The first thing that comes to mind is that I want to use constant maps; however, these are not R-mod homs. Secondly, I've realized that I have not yet used the fact that the ring is commutative. I'm wondering if somehow f(rs) = rf(s) = sf(r) comes into play.
 
Physics news on Phys.org
Hi Kreizhn! :smile:

To prove surjectivity, you must prove that every m in M is in the image of the isomorphism. So you need to find a function f such that f(1_R)=m. Can you extend this equation to fully define f? (hint: f(r)=f(r.1_R).
 
Ah, I think I see what you're saying. We can just define the function in such a way that it forces it to be an R-module homomorphism by demanding that
f(r) = rf(1) = rm
Then the function is a homomorphism since M is an R-module.
 
Kreizhn said:
Ah, I think I see what you're saying. We can just define the function in such a way that it forces it to be an R-module homomorphism by demanding that
f(r) = rf(1) = rm
Then the function is a homomorphism since M is an R-module.

Yes, that's it!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
3
Views
429
Replies
5
Views
1K
Replies
7
Views
3K
Replies
5
Views
1K
Replies
14
Views
2K
Replies
3
Views
2K
Back
Top