MHB Understanding Lemma 4.3.12 in Paul E. Bland's Book: "Rings and Their Modules"

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

I am focused on Section 4.3: Modules Over Principal Ideal Domains ... and I need some further help in order to fully understand the proof of Lemma 4.3.12 ... ...

Lemma 4.3.12 reads as follows:View attachment 8316My question is as follows:

In the Lemma R is a PID ... where in the proof are the special properties of a PID used/needed ... it seems to me that the argument of the proof would hold valid for an ordinary commutative ring with identity ...

Can someone please point out the points in the proof where the special properties of a PID are needed ...

Peter

==============================================================================

It may help MHB
readers of the above post to have access to Bland's definition of a primitive element ... so I am providing the same as follows:View attachment 8317
Hope that helps ...

Peter
 
Physics news on Phys.org
The answer to your question is on page 120 of Bland, quote: "A greatest common divisor of a set of nonzero elements of R may fail to exist. The case is different for a principal ideal ring."
So, if you want existing gcd's, your ring has to be a PID.
 
steenis said:
The answer to your question is on page 120 of Bland, quote: "A greatest common divisor of a set of nonzero elements of R may fail to exist. The case is different for a principal ideal ring."
So, if you want existing gcd's, your ring has to be a PID.
Thanks Steenis ...

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