MHB Euclidean Rings - Rotman Example 3.76

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
I am reading Joseph J. Rotman's book: A First Course in Abstract Algebra with Applications (Third Edition) ...

I am currently focused on Section 3.5 From Numbers to Polynomials ...

I need help with Example 3.76 ... ... the example concerns Euclidean rings and their defining characteristics so I am including the definition of a Euclidean ring in the relevant text shown below ... ...

The relevant text from Rotman's book is as follows:https://www.physicsforums.com/attachments/4649

View attachment 4648
I am trying to understand Example 3.76 which indicates that every field is a Euclidean ring ... ...

I can see that point (i) of the definition is satisfied with $$\partial$$ set identically to zero ...... BUT ... I fail to understand what Rotman is saying about how point (ii) is satisfied ... ...

In order for (ii) to be satisfied, for every $$g \in R$$ and every $$f \in R^{\times}$$ we have to find $$q, r \in R$$ such that:

$$g = qf + r$$ ... ... ... (*)

... BUT ...

Rotman says to set $$q = f^{-1}$$ and $$r = 0$$

but if we do this (*) above becomes

$$g = f f^{-1} + 0 = 1$$ ...

but $$g$$ may be any element of $$R$$ ... ?Can someone please explain what is going on ... that is, what Rotman means in this example ...

Hope someone can help ...

Peter
 
Last edited:
Physics news on Phys.org
Peter said:
Rotman says to set $$q = f^{-1}$$ and $$r = 0$$ but if we do this (*) above becomes $$g = f f^{-1} + 0 = 1$$ ... but $$g$$ may be any element of $$R$$ ... ?
You are right. The book should say: if $g\in R$ and $f\in R^{\times}$ set $q=gf^{-1}$ and $r=0.$ So, for all $g\in R$ and for all $f\in R^{\times}$ we verify $g=(\underbrace{gf^{-1}}_{q})\;f+\underbrace{0}_{r}.$
 
Fernando Revilla said:
You are right. The book should say: if $g\in R$ and $f\in R^{\times}$ set $q=gf^{-1}$ and $r=0.$ So, for all $g\in R$ and for all $f\in R^{\times}$ we verify $g=(\underbrace{gf^{-1}}_{q})\;f+\underbrace{0}_{r}.$

Thanks for that clarification Fernando ... I 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