Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Tensor product of modules

  1. May 8, 2012 #1
    I'm reading about tensor product of modules, there's a theorem in the book that leaves parts of the proof to the reader. I've attached the file, I didn't put this in HW section because first of all I thought this question was more advanced to be posted in there and also because I want to discuss something else with people on this forum.

    I'm thinking what happens when a simple tensor becomes zero? I mean suppose that we have [itex]x\otimes y = 0[/itex]. Does it mean that x or y must be zero? or it's possible that one of them nonzero but still their tensor product turns out to be zero?
    If possible, please check my proof in the file as well.

    I know I'm asking too much, but please help me as quickly as possible because tomorrow I'll have a conference about tensors, the professor is also the head of the math. department of our university and I'm the only under-graduate student in his class. so I'm very determined to have a successful conference tomorrow in the class and I need your help very much guys.
     

    Attached Files:

  2. jcsd
  3. May 8, 2012 #2

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    Your proof seems correct.

    The answer to your other question is no. Consider the [itex]\mathbb{Z}[/itex]-module [itex]\mathbb{Z}\otimes \mathbb{Z}_2[/itex], then

    [tex]2\otimes 1= 2(1\otimes 1)=1\otimes 2=1\otimes 0=0,[/tex]

    but neither 2 or 1 are zero.

    In general, in the R-module [itex]M\otimes N[/itex] it holds that [itex]m\otimes n=0[/itex] if and only if there exists elements [itex]m^\prime_j\in M[/itex] and [itex]a_j\in R[/itex] such that

    [tex]\sum_j a_jm_j^\prime = m[/tex]

    and

    [tex]a_jn=0[/tex]

    for all j.
     
  4. May 8, 2012 #3
    I see. Thanks.
    Then why my proof stands correct? Because at one point I've said that y or (r+I) must be zero. Isn't that false? I don't get it.
     
  5. May 8, 2012 #4

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    Oh right, that part is incorrect of course.

    Can you prove the following equalities:

    [tex]Im(\phi(j\otimes 1))=\phi(Im(j\otimes 1))=\phi(Ker(\pi\otimes 1))=Ker((\pi\otimes 1)\phi^{-1})[/tex]
     
  6. May 8, 2012 #5
    Actually I've proved the theorem in another way, this time it's tedious and quite unusual.
    I hope you enjoy it.

    Please verify if it's correct.
     

    Attached Files:

  7. May 8, 2012 #6

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    Your proof that f is well-defined is very weird. It's just a chain of equalities, I can't seem to make anything about it.

    I don't really get why you're making it so hard. Your original proof was very easy, except for that one gap that you should prove.
     
  8. May 8, 2012 #7

    mathwonk

    User Avatar
    Science Advisor
    Homework Helper

    Maybe I am making it too easy by assuming R is commutative, but then it is pretty easy to see that the obvious maps taking (a)tens(m)-->[am], and [m]-->(m)tens([1]),

    are well defined and inverse to each other. done.
     
  9. May 8, 2012 #8
    Okay then. Assume f is well-defined and check the rest please.
    My original proof is very easy, but it's not very easy to fill that gap. Unless something comes to your mind right now, because to me it doesn't look very obvious.

    But I have to prove it in the general non-commutative case tomorrow. :(
     
  10. May 9, 2012 #9

    mathwonk

    User Avatar
    Science Advisor
    Homework Helper

    Then I suggest trying to provide all the reasons for my steps, and then see how they go in the non commutative case. probably they are exactly the same. My answer is like a cab from the airport that drops you off on the opposite side of the street from your hotel, but expects you to cross the street yourself.
     
  11. May 10, 2012 #10
    Yup, but I think I already got a proof myself. The professor liked my proof and said it was correct. so I'm now kinda sure that my proof is correct now. But it wouldn't hurt if others check it too.
    I personally like my proof so much, because it uses a lot of ideas in Algebra which are new to me and it was the first time that I've employed them in such an advanced algebraic topic. (advanced in my level I mean, not in the level of people like you and micromass). So if you validate my proof I'll be very appreciative.
     
  12. May 10, 2012 #11
    By the way, I got a general question.
    Suppose that A,B and C are 3 R-modules. and each one of them are R-isomorphic respectively to A', B', and C'. Here's the question.
    if [itex] A\to B \to C[/itex] is an exact sequence, does it mean that the sequence [itex] A' \to B' \to C'[/itex] is exact as well? I'm saying this because when two algebraic structures are isomorphic their algebraic properties will be preserved because we're just relabeling things in the two sets and keep every thing else the same. Is that right?
     
  13. May 10, 2012 #12

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    How do you define the maps between A', B' and C' ??
     
  14. May 10, 2012 #13
    Ahh, right. Well, we'll define them in the most natural way, for example if in the first sequence we have the two mappings [itex]\varphi[/itex] and [itex]\psi[/itex] in the new sequence we will have the two new mappings [itex]\varphi(f_1)[/itex] and [itex]\psi(f_2)[/itex] where [itex]f_1[/itex] and [itex]f_2[/itex] are isomorphisms between A and B with A' and B' respectively. I guess now the ambiguity is clear.

    By the way, how could I write a function above an arrow in Latex? I want to write down [itex]\varphi[/itex] above an arrow from A to B but I don't know how to do that :(
     
  15. May 10, 2012 #14

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    I don't really get what you mean with [itex]\varphi(f_1)[/itex] and [itex]\psi(f_2)[/itex]. The functions [itex]\varphi[/itex] and [itex]\psi[/itex] act on modules, but you make it seem like they act on maps :confused:

    Did you perhaps mean: [itex]f_2\circ \varphi\circ f_1^{-1}:A^\prime\rightarrow B^\prime[/itex] as the first map and [itex]f_3\circ \psi\circ f_2^{-1}[/itex] for the second map??
     
  16. May 10, 2012 #15

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    Code (Text):

    A\xrightarrow{f} B
    [tex]A\xrightarrow{f} B[/tex]
     
  17. May 10, 2012 #16
    Hmmm, let me tell you what is in my head then.
    If A and A' are isomorphic, then there exists an isomorphism between them. this isomorphism takes an element of A and then sends it to an element in A' which is just the same element with a new name or sign or whatever. so in this way I could find a similar map for A' to B' as the one I've already been given between A and B. That's my idea. I don't know if I'm able to say what's in my head or not but I'll try again if I'm still unclear.

    Thanks.
     
  18. May 10, 2012 #17

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    I know what you mean, but if you want to prove things, then you should spell out the maps specifically. Look again at my post 14, are those the maps you mean??
     
  19. May 10, 2012 #18
    Yup. They are the same maps I have in my mind.
     
  20. May 10, 2012 #19

    micromass

    User Avatar
    Staff Emeritus
    Science Advisor
    Education Advisor
    2016 Award

    OK, so then we wish to prove that

    [tex]Ker(f_3\circ \psi \circ f_2^{-1})=Im(f_2\circ \varphi \circ f_1^{-1})[/tex]

    I'll do one side of the inclusion:
    Take x in the kernel, then [itex]f_3(\psi(f_2^{-1}(x)))=0[/itex]. Since [itex]f_3[/itex] is an isomorphism, its kernel is 0, thus [itex]\psi(f_2^{-1}(x))=0[/itex]. Thus [itex]f_2^{-1}(x)\in Ker(\psi)[/itex]. By exactness, we have that [itex]Ker(\psi)=Im(\varphi)[/itex], thus there exists a [itex]y\in A[/itex] such that [itex]\varphi(y)=f_2^{-1}(x)[/itex]. In other words, [itex]f_2(\varphi(y))=x[/itex]. Write [itex]z=f_1(y)[/itex], then [itex]f^{-1}_1(z)=y[/itex]. Thus
    [tex]f_2(\varphi(f_1^{-1}(z)))=f_2(\varphi(y))=x[/tex]
    The left-hand side is certainly in the image, thus [itex]x\in Im(f_2\circ \varphi\circ f_1^{-1})[/itex].

    Can you do the other inclusion??
     
  21. May 10, 2012 #20
    Sure. It's easy.

    Take x in [itex]Im(f_2\circ \varphi \circ f_1^{-1})[/itex]. Because it's in image, then there exists y in the domain of [itex]f_2\circ \varphi \circ f_1^{-1}[/itex], i.e. in A', such that [itex]f_2\circ \varphi \circ f_1^{-1}(y)=x[/itex]
    Since [itex]f_2[/itex] is an isomorphism it's invertible, and we'll have:
    [itex]f_2^{-1}(x)=\varphi \circ f_1^{-1}(y)[/itex]
    Now let's apply [itex]\psi[/itex] to both sides, we'll obtain:
    [itex]\psi \circ f_2^{-1}(x) = \psi \circ \varphi \circ f_1^{-1}(y) = 0 [/itex]
    Since [itex] \psi \circ \varphi = o [/itex], because anything that we put into [itex]\varphi[/itex] goes to the kernel of [itex]\psi[/itex] and therefore it becomes zero!
    We're done! Since [itex]f_3[/itex] is a homomorphism, it sends 0 to 0, hence:
    [itex] f_3 \circ \psi \circ f_2^{-1} (x) = f_3(0) = 0[/itex]
    and that says [itex] x \in Ker(f_3\circ \psi \circ f_2^{-1})[/itex]

    It's a very neat theorem, I think it'll make a lot of things easier in future for me, and the good thing is that it works on almost all algebraic structures that I know now, because nowhere in the proof we assumed anything else except the definition of an exact sequence, kernel and image of homomorphisms. All of them stay intact in groups, rings and modules. Thanks for your help micromass.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Tensor product of modules
  1. Tensor Product. (Replies: 11)

  2. Tensor product? (Replies: 7)

  3. Tensor product (Replies: 1)

Loading...