Quadratic Integer

In number theory, quadratic integers are a generalization of the usual integers to quadratic fields. Quadratic integers are algebraic integers of degree two, that is, solutions of equations of the form
:
with and (usual) integers. When algebraic integers are considered, the usual integers are often called ''rational integers''.

Common examples of quadratic integers are the square roots of rational integers, such as , and the complex number , which generates the Gaussian integers. Another common example is the non-real cubic root of unity , which generates the Eisenstein integers.

Quadratic integers occur in the solutions of many Diophantine equations, such as Pell's equations, and other questions related to integral quadratic forms. The study of rings of quadratic integers is basic for many questions of algebraic number theory.

History

Medieval Indian mathematicians had already discovered a multiplication of quadratic integers of the same , which allowed them to solve some cases of Pell's equation.

The characterization given in of the quadratic integers was first given by Richard Dedekind in 1871.

Definition

A quadratic integer is an algebraic integer of degree two. More explicitly, it is a complex number $x=\frac$, which solves an equation of the form , with ''b'' and ''c'' integers. Each quadratic integer that is not an integer is not rational—namely, it's a real irrational number if and non-real if —and lies in a uniquely determined quadratic field $\mathbb(\sqrt)$, the extension of $\mathbb$ generated by the square-root of the unique square-free integer that satisfies for some integer . If is positive, the quadratic integer is real. If D < 0, it is ''imaginary'' (that is, complex and nonreal).

The quadratic integers (including the ordinary integers) that belong to a quadratic field $\mathbb(\sqrt)$ form an integral domain called the ''ring of integers of'' $\mathbb(\sqrt).$

Although the quadratic integers belonging to a given quadratic field form a ring, the set of ''all'' quadratic integers is not a ring because it is not closed under addition or multiplication. For example, $1+\sqrt$ and $\sqrt$ are quadratic integers, but $1+\sqrt+\sqrt$ and $(1+\sqrt)\cdot\sqrt$ are not, as their minimal polynomials have degree four.

Explicit representation

Here and in the following, the quadratic integers that are considered belong to a quadratic field $\mathbb(\sqrt),$ where is a square-free integer. This does not restrict the generality, as the equality (for any positive integer ) implies $\mathbb(\sqrt)=\mathbb(\sqrt).$

An element of $\mathbb(\sqrt)$ is a quadratic integer if and only if there are two integers and such that either
:$x=a+b\sqrt D,$
or, if is a multiple of
:$x=\frac a2+\frac b2\sqrt D,$ with and both odd

In other words, every quadratic integer may be written , where and  are integers, and where is defined by:
:$\omega = \begin \sqrt & \mboxD \equiv 2, 3 \pmod \\ & \mboxD \equiv 1 \pmod \end$
(as has been supposed square-free the case $D \equiv 0\pmod$ is impossible, since it would imply that D would be divisible by the square 4).

Norm and conjugation

A quadratic integer in $\mathbb(\sqrt)$ may be written
:,
where and  are either both integers, or, only if , both halves of odd integers. The norm of such a quadratic integer is
:.

The norm of a quadratic integer is always an integer. If , the norm of a quadratic integer is the square of its absolute value as a complex number (this is false if ). The norm is a completely multiplicative function, which means that the norm of a product of quadratic integers is always the product of their norms.

Every quadratic integer has a conjugate
:$\overline = a-b\sqrt.$
A quadratic integer has the same norm as its conjugate, and this norm is the product of the quadratic integer and its conjugate. The conjugate of a sum or a product of quadratic integers is the sum or the product (respectively) of the conjugates. This means that the conjugation is an automorphism of the ring of the integers of $\mathbb(\sqrt)$—see , below.

Quadratic integer rings

Every square-free integer (different from 0 and 1) defines a quadratic integer ring, which is the integral domain consisting of the algebraic integers contained in $\mathbf(\sqrt).$ It is the set where $\omega = \tfrac$ if , and otherwise. It is often denoted $\mathcal_$, because it is the ring of integers of ), which is the integral closure of in $\mathbf(\sqrt).$ The ring consists of all roots of all equations whose discriminant is the product of by the square of an integer. In particular belongs to , being a root of the equation , which has as its discriminant.

The square root of any integer is a quadratic integer, as every integer can be written , where is a square-free integer, and its square root is a root of .

The fundamental theorem of arithmetic is not true in many rings of quadratic integers. However, there is a unique factorization for ideals, which is expressed by the fact that every ring of algebraic integers is a Dedekind domain. Being the simplest examples of algebraic integers, quadratic integers are commonly the starting examples of most studies of algebraic number theory.

The quadratic integer rings divide in two classes depending on the sign of . If , all elements of $\mathcal_$ are real, and the ring is a ''real quadratic integer ring''. If , the only real elements of $\mathcal_$ are the ordinary integers, and the ring is a ''complex quadratic integer ring''.

For real quadratic integer rings, the class number, which measures the failure of unique factorization, is given i
OEIS A003649
for the imaginary case, they are given i
OEIS A000924

Units

A quadratic integer is a unit in the ring of the integers of $\mathbb(\sqrt)$ if and only if its norm is or . In the first case its multiplicative inverse is its conjugate. It is the negation of its conjugate in the second case.

If , the ring of the integers of $\mathbb(\sqrt)$ has at most six units. In the case of the Gaussian integers (), the four units are . In the case of the Eisenstein integers (), the six units are . For all other negative , there are only two units, which are and .

If , the ring of the integers of $\mathbb(\sqrt)$ has infinitely many units that are equal to , where is an arbitrary integer, and is a particular unit called a ''fundamental unit''. Given a fundamental unit , there are three other fundamental units, its conjugate $\overline,$ and also $-u$ and $-\overline.$ Commonly, one calls ''the'' fundamental unit, the unique one which has an absolute value greater than 1 (as a real number). It is the unique fundamental unit that may be written as , with and positive (integers or halves of integers).

The fundamental units for the 10 smallest positive square-free are , , (the golden ratio), , , , , , , . For larger , the coefficients of the fundamental unit may be very large. For example, for , the fundamental units are respectively
, and .

Examples of complex quadratic integer rings

For  < 0, ω is a complex ( imaginary or otherwise non-real) number. Therefore, it is natural to treat a quadratic integer ring as a set of algebraic complex numbers.
* A classic example is $\mathbf$sqrt/math>, the Gaussian integers, which was introduced by Carl Gauss around 1800 to state his biquadratic reciprocity law.
* The elements in $\mathcal_ = \mathbf\left$right/math> are called Eisenstein integers.
Both rings mentioned above are rings of integers of cyclotomic fields Q(ζ₄) and Q(ζ₃) correspondingly.
In contrast, Z[] is not even a Dedekind domain.

Both above examples are principal ideal rings and also Euclidean domains for the norm. This is not the case for
:\mathcal_ = \mathbf\left sqrt\right
which is not even a unique factorization domain. This can be shown as follows.

In $\mathcal_,$ we have
:$9 = 3\cdot3 = (2+\sqrt)(2-\sqrt).$
The factors 3, $2+\sqrt$ and $2-\sqrt$ are irreducible, as they have all a norm of 9, and if they were not irreducible, they would have a factor of norm 3, which is impossible, the norm of an element different of being at least 4. Thus the factorization of 9 into irreducible factors is not unique.

The ideals $\langle 3, 1+\sqrt\rangle$ and $\langle 3, 1-\sqrt\rangle$ are not principal, as a simple computation shows that their product is the ideal generated by 3, and, if they were principal, this would imply that 3 would not be irreducible.

Examples of real quadratic integer rings

For , is a positive irrational real number, and the corresponding quadratic integer ring is a set of algebraic real numbers. The solutions of the Pell's equation , a Diophantine equation that has been widely studied, are the units of these rings, for .
* For , is the golden ratio. This ring was studied by Peter Gustav Lejeune Dirichlet. Its units have the form , where is an arbitrary integer. This ring also arises from studying 5-fold rotational symmetry on Euclidean plane, for example, Penrose tilings.
* Indian mathematician Brahmagupta treated the Pell's equation , corresponding to the ring is . Some results were presented to European community by Pierre Fermat in 1657.

Principal rings of quadratic integers

Unique factorization property is not always verified for rings of quadratic integers, as seen above for the case of . However, as for every Dedekind domain, a ring of quadratic integers is a unique factorization domain if and only if it is a principal ideal domain. This occurs if and only if the class number of the corresponding quadratic field is one.

The imaginary rings of quadratic integers that are principal ideal rings have been completely determined. These are $\mathcal_$ for
:.
This result was first conjectured by Gauss and proven by Kurt Heegner, although Heegner's proof was not believed until Harold Stark gave a later proof in 1967. (See Stark–Heegner theorem.) This is a special case of the famous class number problem.

There are many known positive integers , for which the ring of quadratic integers is a principal ideal ring. However, the complete list is not known; it is not even known if the number of these principal ideal rings is finite or not.

Euclidean rings of quadratic integers

When a ring of quadratic integers is a principal ideal domain, it is interesting to know whether it is a Euclidean domain. This problem has been completely solved as follows.

Equipped with the norm
$N(a + b\sqrt) = , a^2 - Db^2,$ as a Euclidean function,
$\mathcal_$ is a Euclidean domain for negative when
:,
and, for positive , when
: .
There is no other ring of quadratic integers that is Euclidean with the norm as a Euclidean function.

For negative , a ring of quadratic integers is Euclidean if and only if the norm is a Euclidean function for it. It follows that, for
:,
the four corresponding rings of quadratic integers are among the rare known examples of principal ideal domains that are not Euclidean domains.

On the other hand, the generalized Riemann hypothesis implies that a ring of ''real'' quadratic integers that is a principal ideal domain is also a Euclidean domain for some Euclidean function, which can indeed differ from the usual norm.
The values ''D'' = 14, 69 were the first for which the ring of quadratic integers was proven to be Euclidean, but not norm-Euclidean.David A. Clark, ''A quadratic field which is Euclidean but not norm-Euclidean'', Manuscripta Mathematica, 83(1994), 327–33

Notes

References

*
*{{Citation
, last=Dedekind
, first=Richard
, author-link=Richard Dedekind
, title=Vorlesungen über Zahlentheorie von P.G. Lejeune Dirichlet
, url=http://gdz.sub.uni-goettingen.de/en/dms/load/toc/?PPN=PPN30976923X&DMDID=dmdlog1
, edition=2
, year=1871
, publisher=Vieweg
. Retrieved 5. August 2009
*Dummit, D. S., and Foote, R. M., 2004. ''Abstract Algebra'', 3rd ed.
*Artin, M, ''Algebra'', 2nd ed., Ch 13.

Further reading

*J.S. Milne.
Algebraic Number Theory
', Version 3.01, September 28, 2008. online lecture notes

Algebraic number theory
Ring theory
Integers