Division Rings & Ring Homomorphisms .... A&W Corollary 2.4 ...

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading "Algebra: An Approach via Module Theory" by William A. Adkins and Steven H. Weintraub ...

I am currently focused on Chapter 2: Rings ...

I need help with an aspect of the proof of Corollary 2.4 ... ...

Corollary 2.4 and its proof read as follows:
A&W - Corollary 2.4 ... .png


In the above proof of Corollary 2.4 we read the following:

" ... ... If ##\text{Ker} (f) = \{ 0 \}## then ##f## is injective ... ... "
Can someone please explain exactly how/why ##\text{Ker} (f) = \{ 0 \}## implies that ##f## is injective ... ?
Help will be appreciated ...

Peter
 

Attachments

  • A&W - Corollary 2.4 ... .png
    A&W - Corollary 2.4 ... .png
    29.1 KB · Views: 851
on Phys.org
Injective means ##f(x)=f(y) \Longrightarrow x=y## which is equivalent to ##f(x-y)=0 \Longrightarrow x-y=0## which means ##\operatorname{ker}f = \{0\}##.
 
  • Like
Likes   Reactions: Math Amateur
Suppose ##f(x) = f(y)## for some ##x,y \in R##. Then, since ##f## is a ring homomorphism, it follows that ##0 = f(x) - f(y) = f(x-y)##, which means that ##x-y \in \ker(f) = \{0\}##, and thus ##x-y = 0## or equivalently ##x = y##. So, we may conclude that ##f## is injective

The converse is also true: indeed, suppose that ##f## is injective. Let ##x \in \ker(f)##. Then ##f(x) = 0##. But, because ##f## is a homomorphism, it follows that ##f(0) = 0 = f(x)##, and because of injectivity it follows that ##0 = x##, so that ##\ker(f) \subseteq \{0\}## and equality follows.
 
  • Like
Likes   Reactions: Math Amateur
Math_QED said:
Suppose ##f(x) = f(y)## for some ##x,y \in R##. Then, since ##f## is a ring homomorphism, it follows that ##0 = f(x) - f(y) = f(x-y)##, which means that ##x-y \in \ker(f) = \{0\}##, and thus ##x-y = 0## or equivalently ##x = y##. So, we may conclude that ##f## is injective

The converse is also true: indeed, suppose that ##f## is injective. Let ##x \in \ker(f)##. Then ##f(x) = 0##. But, because ##f## is a homomorphism, it follows that ##f(0) = 0 = f(x)##, and because of injectivity it follows that ##0 = x##, so that ##\ker(f) \subseteq \{0\}## and equality follows.
Thanks fresh_42, MAth_QED ...

Very clear on that matter now!

Thanks again,

Peter
 
  • Like
Likes   Reactions: WWGD

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K