Proving g.c.d.(a,b) in a PID: A Homework Solution

  • Thread starter Thread starter *melinda*
  • Start date Start date
*melinda*
Messages
86
Reaction score
0

Homework Statement



Prove: If a, b are nonzero elements in a PID, then there are elements s, t in the domain such that sa + tb = g.c.d.(a,b).

Homework Equations



g.c.d.(a,b) = sa + tb if sa + tb is an element of the domain such that,
(i) (sa + tb)|a and (sa + tb)|b and
(ii) If f|a and f|b then f|(sa + tb)

The Attempt at a Solution



Since a, b, s, t, are all elements of the PID, so is sa + tb by properties of rings.

I also know that if f|a and f|b then a = xf and b = yf. So f|(sa + tb) can be written as f|(sx + ty)f, which shows that f|(sa + tb) as desired.

I'm just not sure how to satisfy criteria (i) of the definition of g.c.d.

I know that if d and d' are g.c.d.'s of a and b, then d and d' are associates, but I'm not sure how to use this to my advantage.

Any suggestions would be appreciated!
 
Physics news on Phys.org
You don't seem to have invoked the fact you are in a PID, rather than in an arbitrary ring...
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top