MHB Why Does d and 1 Being Associates Imply 1 is a GCD?

  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    domains 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 help in order to fully understand the proof of Proposition 4.3.12 ... ...

Proposition 4.3.12 reads as follows:View attachment 8314In the above proof by Bland we read the following:

" ... ... Since $$x$$ is primitive, $$d$$ is a unit, so $$d$$ and $$1$$ are associates. Thus $$1$$ is a greatest common denominator of $$\{ a_\alpha \ \mid \ a_\alpha \neq 0 \}$$. ... ... "Can someone please explain exactly why $$d$$ and $$1$$ being associates implies that $$1$$ is a greatest common denominator of $$\{ a_\alpha \ \mid \ a_\alpha \neq 0 \}$$ ... ...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 8315Hope that helps ...

Peter
 
Last edited:
Physics news on Phys.org
Re: Free Modules Over Prncipal Ideal Domains ... Bland, Proposition 4.3.12 ... ...

Hi Peter,

If $c$ is any common divisor of $\{a_{\alpha}: a_{\alpha}\neq 0\}$, then $c|d$ by definition of gcd. Since $d$ and $1$ are associates $d|1\Longrightarrow c|1,$ because $c|d$. Since $c$ is arbitrary, $1$ is a gcd of $\{a_{\alpha}: a_{\alpha}\neq 0\}$ by definition.
 
Re: Free Modules Over Prncipal Ideal Domains ... Bland, Proposition 4.3.12 ... ...

GJA said:
Hi Peter,

If $c$ is any common divisor of $\{a_{\alpha}: a_{\alpha}\neq 0\}$, then $c|d$ by definition of gcd. Since $d$ and $1$ are associates $d|1\Longrightarrow c|1,$ because $c|d$. Since $c$ is arbitrary, $1$ is a gcd of $\{a_{\alpha}: a_{\alpha}\neq 0\}$ by definition.
Thanks for the help GJA ...

But ... just a clarification ...

I can verify that $$d \mid 1$$ and that $$d|1\Longrightarrow c|1$$ ... but I cannot follow your argument from there ... that because $c$ is arbitrary, $1$ is a gcd of $\{a_{\alpha}: a_{\alpha}\neq 0\}$ ... ? ... ... can you please explain more fully ...

... essentially ... how does $$d \mid 1$$ and $$d|1\Longrightarrow c|1$$ together with $$c$$ being arbitrary imply that the gcd of $\{a_{\alpha}: a_{\alpha}\neq 0\}$ is $$1$$ ... ... ?

Thanks again ...

Peter
 
Last edited:
Re: Free Modules Over Prncipal Ideal Domains ... Bland, Proposition 4.3.12 ... ...

Hi Peter,

The definition of a gcd in a commutative ring (which $R$ is since it's a PID) is that any common divisor must also divide the gcd. By showing that the arbitrary common divisor $c$ divides $1$, we have shown $1$ is a gcd by definition. See the "GCD in Commutative Rings" section for a reference https://en.wikipedia.org/wiki/Greatest_common_divisor
 
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