1. Not finding help here? Sign up for a free 30min tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Category theory: Prove that two given short Ex. Seq.s are isomorphic.

  1. Mar 30, 2012 #1
    I've attached the problem statement and the solution in a pdf file, please check it and see if I've done it correctly. I'm new to abstract reasoning, I've only had a one semester introduction to group-theory and parts of ring theory based on baby Herstein, so I need others to check my proofs to know whether I'm doing them right or wrong.
    Thanks in advance.
     

    Attached Files:

  2. jcsd
  3. Mar 30, 2012 #2

    jgens

    User Avatar
    Gold Member

    A couple of points:
    1. You need to prove that the diagram to commutes to prove that you have an isomorphism of short exact sequences. This is currently the biggest problem with your argument.
    2. Notice that [itex]\psi[/itex] is only required to be surjective, so writing something like [itex]\gamma = \pi\psi^{-1}[/itex] is nonsense. You explain later what you mean, and you have the right idea, so this is just a notational issue.
    3. Proving that [itex]\alpha,\beta,\gamma[/itex] are isomorphisms is much easier than you think. Defining [itex]\alpha:M \rightarrow \mathrm{im}\,\phi[/itex] such that [itex]\alpha(x)=\phi(x)[/itex] forces [itex]\alpha[/itex] to be injective since [itex]\phi[/itex] is injective by hypothesis and proving surjectivity is similarly easy. Defining [itex]\beta = \mathrm{id}_N[/itex] is clearly an isomorphism. Lastly there exists a canonical isomorphism [itex]\gamma:K \rightarrow N/\ker \psi[/itex] by the first isomorphism theorem for modules. This is the same map you define and it saves you the trouble of proving that [itex]\gamma[/itex] is well-defined.
    Try rewriting it with these concerns in mind.
     
  4. Mar 31, 2012 #3
    Well, We create the maps in a way that the diagram commutes, that's how I obtain α
    ,β and γ. You're right though, because I haven't precisely shown that γψ=π (It's really very obvious that the rest of the diagram commute) but it's not immediately followed from γ
    =πψ-1 that we have γψ=π, so I'll fix this hole in my argument later.

    Yea, you're right, using the notation ψ-1 might cause the confusion that ψ
    is bijective, but ψ-1 isn't really the inverse of ψ, it's only the right inverse which exists because ψ is surjective, so I should've used another letter for the right inverse of ψ, like another Greek letter or whatever.

    That is exactly what I've done.
    Yup, I could use the first isomorphism theorem as well because [itex]\ker \psi[/itex]=[itex]Im \varphi[/itex], that would've reduced the exhausting work to only one line.
     
  5. Mar 31, 2012 #4

    jgens

    User Avatar
    Gold Member

    1. The point is to construct the relevant isomorphisms and prove that they commute; the fact that it is "obvious" in this case is irrelevant since the argument itself is pretty obvious. You also need to define your isomorphisms first before you prove that anything commutes. Doing it any other way is poor form. It is generally a good idea to get some practice with diagram chasing anyway.

    2. Do not use right inverses to construct your isomorphism [itex]/gamma[/itex]. There is a canonical map which exists by the first isomorphism theorem and this works fine. So there is no need to even mention right inverses anywhere in your proof.

    3. Streamline your proof. Unless you are writing this proof for pedagogical reasons, you are much too wordy. There is no need to explain why you chose each isomorphism or anything like that. Just define them in one paragraph and prove everything commutes in the next paragraph. Learning how to write clean proofs is a useful skill.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Category theory: Prove that two given short Ex. Seq.s are isomorphic.
  1. Proving Isomorphisms (Replies: 4)

  2. Proving isomorphisms (Replies: 10)

Loading...