Gaussian integer

Gaussian integer

In number theory, a Gaussian integer is a complex number whose real and imaginary part are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as Z[i]. The Gaussian integers are a special case of the quadratic integers. This domain does not have a total ordering that respects arithmetic.

Gaussian integers as lattice points in the complex plane

Formally, Gaussian integers are the set

\mathbb{Z}[i]=\{a+bi \mid a,b\in \mathbb{Z} \}.

Note that when they are considered within the complex plane the Gaussian integers may be seen to constitute the 2-dimensional integer lattice.

The norm of a Gaussian integer is the natural number defined as

N \left(a+bi \right) = a^2+b^2 = (a+bi)\overline{(a+bi)} = (a+bi)(a-bi).

(Where the overline over "a+bi" refers to the complex conjugate.)

The norm is multiplicative, i.e.

N(z\cdot w) = N(z)\cdot N(w).

The units of Z[i] are therefore precisely those elements with norm 1, i.e. the elements

1, −1, i and −i.

Contents

As a unique factorization domain

The Gaussian integers form a unique factorization domain with units 1, −1, i, and −i. If x is a Gaussian integer, the four numbers x, ix, −x, and −ix are called the associates of x.

The prime elements of Z[i] are also known as Gaussian primes. An associate of a Gaussian prime is also a Gaussian prime. The Gaussian primes are symmetric about the real and imaginary axes. The positive integer Gaussian primes are the prime numbers congruent to 3 modulo 4, (sequence A002145 in OEIS). One should not refer to only these numbers as "the Gaussian primes", which term refers to all the Gaussian primes, many of which do not lie in Z. [1]

Some of the Gaussian primes

A Gaussian integer a + bi is a Gaussian prime if and only if either:

  • one of a, b is zero and the other is a prime number of the form 4n + 3 (with n a nonnegative integer) or its negative − (4n + 3), or
  • both are nonzero and a2 + b2 is a prime number (which will not be of the form 4n + 3).

The following elaborates on these conditions.

2 is a special case (in the language of algebraic number theory, 2 is the only ramified prime in Z[i]).

The integer 2 factors as 2 = (1 + i)(1 − i) = i(1 − i)2 as a Gaussian integer, the second factorisation (in which i is a unit) showing that 2 is divisible by the square of a Gaussian prime; it is the unique prime number with this property.

The necessary conditions can be stated as following: if a Gaussian integer is a Gaussian prime, then either its norm is a prime number, or its norm is a square of a prime number. This is because for any Gaussian integer g, notice

g \mid g\bar{g} =N(g).

Here \mid means “divides”; that is, x \mid y if x is a divisor of y.

Now N(g) is an integer, and so can be factored as a product p_{1}p_{2}\cdots p_{n} of prime numbers, by the fundamental theorem of arithmetic. By definition of prime element, if g is a Gaussian prime, then it divides (in Z[i]) some pi. Also, \bar g divides

\overline{p_i}=p_i, so N(g) = g\bar{g} \mid p_{i}^{2} in Z.

This gives only two options: either the norm of g is a prime number, or the square of a prime number.

If in fact N(g) = p2 for some prime number p, then both g and \overline{g} divide p2. Neither can be a unit, and so

g = pu and \overline{g}=p\overline{u}

where u is a unit. This is to say that either a = 0 or b = 0, where g = a + bi.

However, not every prime number p is a Gaussian prime. 2 is not because 2 = (1 + i)(1 − i). Neither are prime numbers of the form 4n + 1 because Fermat's theorem on sums of two squares assures us they can be written a2 + b2 for integers a and b, and a2 + b2 = (a + bi)(abi). The only type of prime numbers remaining are of the form 4n + 3.

Prime numbers of the form 4n + 3 are also Gaussian primes. For suppose g = p + 0i for p = 4n + 3, and it can be factored g = hk. Then p2 = N(g) = N(h)N(k). If the factorization is non-trivial, then N(h) = N(k) = p. But no sum of squares of integers can be written 4n + 3. So the factorization must have been trivial and g is a Gaussian prime.

If g is a Gaussian integer whose norm is a prime number, then g is a Gaussian prime, because the norm is multiplicative.

As an integral closure

The ring of Gaussian integers is the integral closure of Z in the field of Gaussian rationals Q(i) consisting of the complex numbers whose real and imaginary part are both rational.

As a Euclidean domain

It is easy to see graphically that every complex number is within \frac{\sqrt 2}{2} units of a Gaussian integer.

Put another way, every complex number (and hence every Gaussian integer) has a maximal distance of

\frac{\sqrt 2}{2}\sqrt{N(z)}

units to some multiple of z, where z is any Gaussian integer; this turns Z[i] into a Euclidean domain, where

v(z) = N(z) \,.

Historical background

The ring of Gaussian integers was introduced by Carl Friedrich Gauss in his second monograph on quartic reciprocity (1832) (see [2]). The theorem of quadratic reciprocity (which he had first succeeded in proving in 1796) relates the solvability of the congruence x2q (mod p) to that of x2p (mod q). Similarly, cubic reciprocity relates the solvability of x3q (mod p) to that of x3p (mod q), and biquadratic (or quartic) reciprocity is a relation between x4q (mod p) and x4p (mod q). Gauss discovered that the law of biquadratic reciprocity and its supplements were more easily stated and proved as statements about "whole complex numbers" (i.e. the Gaussian integers) than they are as statements about ordinary whole numbers (i.e. the integers).

In a footnote he notes that the Eisenstein integers are the natural domain for stating and proving results on cubic reciprocity and indicates that similar extensions of the integers are the appropriate domains for studying higher reciprocity laws.

This paper not only introduced the Gaussian integers and proved they are a unique factorization domain, it also introduced the terms norm, unit, primary, and associate, which are now standard in algebraic number theory.

Unsolved problems

Gauss's circle problem does not deal with the Gaussian integers per se, but instead asks for the number of lattice points inside a circle of a given radius centered at the origin. This is equivalent to determining the number of Gaussian integers with norm less than a given value.

There are also conjectures and unsolved problems about the Gaussian primes. Two of them are:

The real and imaginary axes have the infinite set of Gaussian primes 3, 7, 11, 19, ... and their associates. Are there any other lines that have infinitely many Gaussian primes on them? In particular, are there infinitely many Gaussian primes of the form 1+ki?[2]

Is it possible to walk to infinity using the Gaussian primes as stepping stones and taking steps of bounded length?[3] More generally, is there a constant B such that the set of Gaussian primes is connected by edges of length at most B, or stated differently, such that for every two Gaussian primes p and q, the minimax path in the Gaussian primes between p and q (the path minimizing the length of its longest edge) has every edge length at most B? The latter statement is slightly stronger than the one about walking to infinity, as it also excludes remote "islands" of Gaussian primes, separated from all others by arbitrarily wide "moats" of Gaussian non-primes.

See also

Notes

  1. ^ [1], OEIS sequence A002145 "COMMENT" section
  2. ^ Ribenboim, Ch.III.4.D Ch. 6.II, Ch. 6.IV (Hardy & Littlewood's conjecture E and F)
  3. ^ See Moat-Crossing Problem in the external links

References

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Gaussian integer — Math. a complex number of the form a + bi where a and b are integers. * * * …   Universalium

  • Gaussian integer — noun A complex number where a and b are integers …   Wiktionary

  • gaussian integer — noun Usage: usually capitalized G : a complex number a + bi where a and b are integers and i =√‒̅1 * * * Math. a complex number of the form a + bi where a and b are integers …   Useful english dictionary

  • integer — Synonyms and related words: Gaussian integer, algebraic number, article, cardinal, cardinal number, cipher, collectivity, complex, complex number, defective number, digit, embodiment, entirety, entity, even number, figure, finite number, fraction …   Moby Thesaurus

  • Gaussian period — In mathematics, in the area of number theory, a Gaussian period is a certain kind of sum of roots of unity. They permit explicit calculations in cyclotomic fields, in relation both with Galois theory and with harmonic analysis (discrete Fourier… …   Wikipedia

  • Gaussian elimination — In linear algebra, Gaussian elimination is an algorithm for solving systems of linear equations. It can also be used to find the rank of a matrix, to calculate the determinant of a matrix, and to calculate the inverse of an invertible square… …   Wikipedia

  • Gaussian beam — In optics, a Gaussian beam is a beam of electromagnetic radiation whose transverse electric field and intensity (irradiance) distributions are well approximated by Gaussian functions. Many lasers emit beams that approximate a Gaussian profile, in …   Wikipedia

  • Gaussian integral — The Gaussian integral, or probability integral, is the improper integral of the Gaussian function e^ x}^2} over the entire real line. It is named after the German mathematician and physicist Carl Friedrich Gauss, and the equation is::int {… …   Wikipedia

  • Eisenstein integer — In mathematics, Eisenstein integers, named after Ferdinand Eisenstein, are complex numbers of the form :z = a + bomega ,!where a and b are integers and:omega = frac{1}{2}( 1 + isqrt 3) = e^{2pi i/3}is a complex cube root of unity. The Eisenstein… …   Wikipedia

  • Algebraic integer — This article deals with the ring of complex numbers integral over Z. For the general notion of algebraic integer, see Integrality .In number theory, an algebraic integer is a complex number which is a root of some monic polynomial (leading… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”