First isomorphism theorem for rings

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
8 replies · 4K views
rukawakaede
Messages
58
Reaction score
0
Consider: [tex]\varphi:R\rightarrow S[/tex] is a homomorphism.

Also,[tex]\hat{\varphi}:\frac{R}{ker\varphi}\rightarrow \varphi(R)[/tex].

How can I show [tex]\hat{\varphi}[/tex] is bijective?

Most textbooks say it is obvious. I see surjectivity obvious but not injectivity.

Could anyone provide a proof for injectivity?
 
Last edited:
Physics news on Phys.org
lavinia said:
if two elements of the ring differ by an element of the kernel then they are equal in the quotient.

Thank you. I think I know the injectivity already. Could you please check if my argument is right?

Assume [tex]\varphi(r)=\varphi(r')[/tex]. I= kernel.
1. if [tex]r=r'[/tex] then then this is obvious as they are in the same coset.
2. if [tex]r\neq r'[/tex] and if [tex]r-r'=a\in I[/tex] then [tex]r+I=r'+I[/tex] and so [tex]\hat\varphi(r+I)=\hat\varphi(r'+I)[/tex] satisfying assumption above.
3. if [tex]r\neq r'[/tex] and if [tex]r-r'=a\not\in I[/tex] then [tex]r+I\neq r'+I[/tex] and so [tex]\hat\varphi(r+I)\neq\hat\varphi(r'+I)[/tex] and so [tex]\varphi(r)\neq\varphi(r')[/tex] contradicting assumption. (?)

So for all [tex]\varphi(r)=\varphi(r')[/tex], we must have this condition [tex]r+I=r'+I[/tex] holds. hence it is injective.
 
Last edited:
rukawakaede said:
Thank you. I think I know the injectivity already. Could you please check if my argument is right?

Assume [tex]\varphi(r)=\varphi(r')[/tex]. I= kernel.
1. if [tex]r=r'[/tex] then then this is obvious as they are in the same coset.
2. if [tex]r\neq r'[/tex] and if [tex]r-r'=a\in I[/tex] then [tex]r+I=r'+I[/tex] and so [tex]\hat\varphi(r+I)=\hat\varphi(r'+I)[/tex] satisfying assumption above.
3. if [tex]r\neq r'[/tex] and if [tex]r-r'=a\not\in I[/tex] then [tex]r+I\neq r'+I[/tex] and so [tex]\hat\varphi(r+I)\neq\hat\varphi(r'+I)[/tex] and so [tex]\varphi(r)\neq\varphi(r')[/tex] contradicting assumption.

So for all [tex]\varphi(r)=\varphi(r')[/tex], we must have this condition [tex]r+I=r'+I[/tex] holds. hence it is injective.

right but you could say this more simply as

if [tex]\varphi(r - r')= 0[/tex] then r - r' is in I and so is zero in the quotient.
 
I would do it essentially the same way as Lavinia. Define [itex]I=\ker\varphi[/itex].

[tex] \begin{align*}<br /> & \hat\varphi(r+I)=\hat\varphi(r'+I)\ \Rightarrow\ \varphi(r)=\varphi(r')\ \Rightarrow\ \varphi(r-r')=0\\<br /> & \Rightarrow\ r-r'\in\ker\varphi=I\ \Rightarrow\ r+I=r'+I<br /> \end{align*}[/tex]
 
lavinia said:
right but you could say this more simply as

if [tex]\varphi(r - r')= 0[/tex] then r - r' is in I and so is zero in the quotient.

Thanks, lavinia!

Another question: I found it strange for 3. in my argument above. In particular:
[tex]r+I\neq r'+I[/tex] and so [tex]\hat\varphi(r+I)\neq\hat\varphi(r'+I)[/tex]. This is not generally true, isn't it?

Do you know a way to avoid this? If I want to show that the statement: if [tex]r-r'\not\in I[/tex] then [tex]\varphi(r)\neq\varphi(r')[/tex]?

This question might be silly, since we can argue the opposite (i.e. if [tex]r-r'\not\in I[/tex] then [tex]\varphi(r)=\varphi(r')[/tex]) and obtain a contradiction from your/Fredrick argument above. But could we prove that directly?
 
Last edited:
Fredrik said:
I would do it essentially the same way as Lavinia. Define [itex]I=\ker\varphi[/itex].

[tex] \begin{align*}<br /> & \hat\varphi(r+I)=\hat\varphi(r'+I)\ \Rightarrow\ \varphi(r)=\varphi(r')\ \Rightarrow\ \varphi(r-r')=0\\<br /> & \Rightarrow\ r-r'\in\ker\varphi=I\ \Rightarrow\ r+I=r'+I<br /> \end{align*}[/tex]
Thanks Fredrik!

Here is the same question as in my previous post:

Another question: I found it strange for 3. in my argument above. In particular:
[tex]r+I\neq r'+I[/tex] and so [tex]\hat\varphi(r+I)\neq\hat\varphi(r'+I)[/tex]. This is not generally true, isn't it?

Do you know a way to avoid this? If I want to show that the statement: if [tex]r-r'\not\in I[/tex] then [tex]\varphi(r)\neq\varphi(r')[/tex]?

This question might be silly, since we can argue the opposite (i.e. if [tex]r-r'\not\in I[/tex] then [tex]\varphi(r)=\varphi(r')[/tex]) and obtain a contradiction from your/lavinia argument above. But could we prove that directly?
 
Last edited:
rukawakaede said:
Another question: I found it strange for 3. in my argument above. In particular:
[tex]r+I\neq r'+I[/tex] and so [tex]\hat\varphi(r+I)\neq\hat\varphi(r'+I)[/tex]. This is not generally true, isn't it?
It is. If I understand you correctly, you're asking if the implication [itex]r+I\neq r'+I\Rightarrow \hat\varphi(r+I)\neq\hat\varphi(r'+I)[/itex] is true (or rather, how to see that it's not). This implication is equivalent to [itex]\hat\varphi(r+I)=\hat\varphi(r'+I)\Rightarrow r+I=r'+I[/itex], and this is exactly what I proved in my previous post.

rukawakaede said:
Do you know a way to avoid this? If I want to show that the statement: if [tex]r-r'\not\in I[/tex] then [tex]\varphi(r)\neq\varphi(r')[/tex]?
This is equivalent to showing that [itex]\varphi(r)=\varphi(r')\Rightarrow r-r'\in I[/itex]. This is also a part of my proof in my previous post.
 
Fredrik said:
It is. If I understand you correctly, you're asking if the implication [itex]r+I\neq r'+I\Rightarrow \hat\varphi(r+I)\neq\hat\varphi(r'+I)[/itex] is true (or rather, how to see that it's not). This implication is equivalent to [itex]\hat\varphi(r+I)=\hat\varphi(r'+I)\Rightarrow r+I=r'+I[/itex], and this is exactly what I proved in my previous post.


This is equivalent to showing that [itex]\varphi(r)=\varphi(r')\Rightarrow r-r'\in I[/itex]. This is also a part of my proof in my previous post.

Thank you. I was asking something really silly :-p