The field
introduced above may be thought of
as being similar to
in many respects. What is the
analog (if any) of the ring of integers,
?
This subsection addresses this question.
Let
. The Gaussian number field
is the special quadratic number field
.
The Gaussian integers is the ring
These ``integers'' can be pictured as an lattice in the
complex plane:
Geometrically, addition of Gaussian integers may be
visualized using the parallelogram law: if you represent
the integer
by the vector
from
to
and the integer
by the vector
from
to
then the sum
is represented by the
vector from
to the other endpoint of the
diagonal of the parallelogram spanned by
and
.
For example, to add
and
, we have the following
sketch
Definition 2.1.8
An element
is a
prime (element of
)
if it has the following property:
for all
,
then
or
.
The following characterization of Gausssian primes is
known.
The proof of this result goes beyond the scope of this book.
See [HW] for a proof.
There is an analog of the fundamental theorem of arithmetic
for the ring of Gaussian integers. In other words, each Gaussian
integer can be uniquely (up to order and factors of the form
and
) factored into
a product of Gaussian primes.
Remark 2.1.10
If you ask for a general analog of the fundamental
theorem of arithmetic
for the ring of integers of one of the
number fields
then less is known.
It was conjectured by Gauss (and still unproven today)
that there are infinitely squarefree
for which
ring of integers of
satisfies
the unique factorization theorem.
It was proven by H. Stark in 1967 [St]
(and independently by A. Baker)
that the only cases for which
ring of integers of
,
squarefree, satisfies
the unique factorization theorem is when
.
See [HW], page 217, for further details.
David Joyner
2007-09-03