MHB Split Monomorphisma .... Bland Definition 3.2.2 & Proposition 3.2.3 ....

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Definition Split
Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Paul E. Bland's book "Rings and Their Modules" ...

Currently I am focused on Section 3.2 Exact Sequences in $$\text{Mod}_R$$ ... ...

I need some help in order to fully understand Definition 3.2.2 and Proposition 3.2.3 ...

Definition 3.2.2 and Proposition 3.2.3 read as follows:
https://www.physicsforums.com/attachments/8072
In Definition 3.2.2 we read that $$f'f = \text{id}_{M_1}$$ ... ... BUT ... ... I thought that $$f'f$$ was only defined on $$f(M) = \text{Im } f $$ ... ... what then happens to elements $$x \in M$$ that are outside of $$f(M) = \text{Im } f$$ ... ... see Fig. 1 below ...
View attachment 8073Note that in the proof of Proposition 3.2.3 we read:" ... ... If $$x \in M$$, then $$f'(x) \in M_1$$ ... ... " But ... how does this work for $$x$$ outside of $$f(M) = \text{Im } f $$ such as $$x$$ shown in Fig. 1 above?
I would be grateful if someone could explain how Definition 3.2.2 "works" ... ...

Peter
 
Physics news on Phys.org
Hi, Peter.

The condition that needs to occur in order to form the composition $f'f$ (or any function composition) is that $f$'s range must be a subset of $f'$'s domain. Since $f'$ is defined on all of $M$, there is no issue forming $f'f$.

Even when $x\in M-f(M_{1})$, $f'(x)$ still exists because $f'$ is defined on all of $M$.
 
GJA said:
Hi, Peter.

The condition that needs to occur in order to form the composition $f'f$ (or any function composition) is that $f$'s range must be a subset of $f'$'s domain. Since $f'$ is defined on all of $M$, there is no issue forming $f'f$.

Even when $x\in M-f(M_{1})$, $f'(x)$ still exists because $f'$ is defined on all of $M$.

Thanks GJA ...

Appreciate your help...

Peter
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top