Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
29 views4 pages

Particular Euclidean Ring: J I A Ib A B

The document discusses the Euclidean ring of Gaussian integers, J[i], and establishes a function d that satisfies the conditions necessary for J[i] to be classified as a Euclidean ring. It demonstrates that for any two elements in J[i], there exist elements t and r such that the division algorithm holds, thereby proving the theorem. The proof is structured in two cases: a special case with positive integers and a general case for arbitrary elements in J[i].

Uploaded by

rotric2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views4 pages

Particular Euclidean Ring: J I A Ib A B

The document discusses the Euclidean ring of Gaussian integers, J[i], and establishes a function d that satisfies the conditions necessary for J[i] to be classified as a Euclidean ring. It demonstrates that for any two elements in J[i], there exist elements t and r such that the division algorithm holds, thereby proving the theorem. The proof is structured in two cases: a special case with positive integers and a general case for arbitrary elements in J[i].

Uploaded by

rotric2022
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Particular Euclidean Ring

Let J[i] denote the set of all complex numbers of the form a + ib when a and b
are integers. Such complex numbers are called Gaussian integers.

Under the usual addition and multiplication of complex numbers J[i] forms an
integral domain called the domain of Gaussian integers.

Now we have to exhibit J[i] as a Euclidean ring. In order to do this, we need a


function d : J[i] → N ∪ {0} such that the following hold:
1. d(x) is a non negative integer for every x ̸= 0 ∈ J[i]
2. d(x) ≤ d(xy) for every y ̸= 0 in J[i]
3. Given u, v ∈ J[i] there exist t, r ∈ J[i] such that v = tu + r where r = 0
(or) d(r) < d(u)
For x = a + ib ∈ J[i], d(x) = a2 + b2

It follows from the definition that d(x) ≥ tf orallx ̸= 0 ∈ J[i]

∴ The condition (1) is satisfied.

Let x, y ∈ J[i].

Since y ̸= 0, we have d(y) ≥ 1 and so d(x) ≤ d(x)d(y) = d(xy).

∴ The condition (2) is satisfied.

Now we will show that condition 3 also holds for this function d in J[i]. This is
done in the proof of the following theorem.

Theorem 1. J[i] is a Euclidean ring.


Proof. T.P J[i] is a Euclidean ring.

i.e) T.P Given x, y ∈ J[i] there exist t, r ∈ J[i] such that y = tx + r where r = 0
(or) d(r) < d(x).

1
case(i):Special case.

Assume x is a positive integer.

Let y = a + ib where a & b are integers.

By division algorithm for the ring of integers there exists integers u, u1 , v, v1

such that
a = un + u1 and b = vn + v1 (1)
where u1 and v1 are integers satisfying
n n
| u1 |≤ | v1 |≤
2 2
2 and 2 (2)
n n
u21 ≤ v12 ≤
4 4
Let t, r ∈ J[i].

Then
t = u + vi and r = u1 + v1 i (3)
Suppose

y = a + ib
= un + u1 + [vn + v1 ]i [by(1)]
= un + u1 + vni + v1 i
= un + vni + u1 + v1 i
= (u + vi)n + (u1 + v1 i)
= tn + r [f rom(3)]

Now
d(r) = d(u1 + v1 i) [f rom(3)]
= u21 + v12
2
n n2
≤ + [f rom(2)]
4 4
n2
=
2
< n2
= d(n)

∴ d(r) < d(n)

2
Thus in this special case we have shown that y = tn + r with r = u1 + v1 i = 0
(or) d(r) < d(n).

case(ii): General case

Let x, y both non zero arbitrary element in J[i].

Let x = a + ib and x = a − ib (conjugate of x).

Then
xx = (a + ib)(a − ib)
= a2 + b2 > 0

∴ xx is a positive integer.

Consider n = xx.

Applying the result of the case (i) to the elements yx and n,

there exist elements t, r ∈ J[i] such that yx = tn + r with r = 0 (or)

d(r) < d(n).

If r = 0, then yx = tn which implies

yx = txx
y = tx + 0

∴ The third condition of Euclidean ring is true.

If d(r) < d(n),

d(yx − tn) < d(n)


d(yx − txx) < d(n)
d(y − tx)d(x) < d(xx) [∵ d(x ≥ 0)]
d(y − tx)d(x) < d(x)d(x)
d(y − tx) < d(x)

Take r0 = y − tx, which implies y = tx + r0 , t & r0 ∈ J[i]

Also r0 ̸= 0 because when r = 0 then only r0 = 0.

So we have to prove d(r0 ) < d(x)

3
Hence d(r0 ) = d(y − tx) < d(x)

Therefore, it is true when d(r) < d(n).

This proves the theorem.

Submitted by,
Sahaya Angel Francy L
2021APM320

You might also like