2

Let $R$ be a UFD. Let $r,a,b \in R$. Then how can I show that $\operatorname{gcd} (ra,rb) \sim r \operatorname{gcd} (a,b)$?

If $\operatorname{gcd} (a,b) = d$ and $\operatorname{gcd} (ra,rb) = d'$.Then $d|a$ and $d|b$ $\implies$ $rd|ra$ and $rd|rb$ i.e. $rd$ becomes a common divisor of $ra$ and $rb$. Hence we must have $rd|d'$. But I fail to show the converse part i.e. $d'|rd$.

How can I show this? Please help me.

Thank you in advance.

user26857
  • 52,094
  • 1
    See the 2nd and 3rd proofs here of this GCD Distributive Law. – Bill Dubuque Jan 14 '17 at 19:31
  • $d=ax+by \Rightarrow rd=rax+rby=(ra)x+(rb)y$ then $d'|(ra)x+(rb)y\Rightarrow d'|rd$ – Mustafa Jan 14 '17 at 20:28
  • 1
    @A.Chattopadhyay. You are right. That only works if $R$ is a bezout domain. – math Jan 14 '17 at 20:32
  • 1
    No.As far as I know this thing is true in PID and hence in ED.But how can you prove it in a UFD?Please tell me. –  Jan 14 '17 at 20:33
  • I said it to Mustafa not you @mathchat. –  Jan 14 '17 at 20:34
  • @MathChat Correct, UFDs need not be Bezour domains, e.g. in $,R = \Bbb Z[x,y],$ we have $,\gcd(x,y)=1,$ but there are no $,f,g\in R,$ with $,x f + y g = 1,$ (else eval at $,x=0=y,$ yields $0 = 1).,$ That's why I mentioned only the proofs that do not use Bezout / Euclid in my linked answer. – Bill Dubuque Jan 14 '17 at 21:24
  • @ Bill Dubuque. Yes. You are absolutely right. – math Jan 14 '17 at 21:56
  • I did notice you used $\sim$ rather than $=$, but I still feel a bit uneasy about the possibility, for example, that $r$ is negative while $a$ and $b$ are positive. – Mr. Brooks Jan 14 '17 at 22:03

0 Answers0