Gaussian integer

The Gaussian integers are the set[1]

${\displaystyle \mathbf {Z} [i]=\{a+bi\mid a,b\in \mathbf {Z} \},\qquad {\text{ where }}i^{2}=-1.}$

In other words, a Gaussian integer is a complex number such that its real and imaginary parts are both integers. Since the Gaussian integers are closed under addition and multiplication, they form a commutative ring, which is a subring of the field of complex numbers. It is thus an integral domain.

When considered within the complex plane, the Gaussian integers constitute the 2-dimensional integer lattice.

The conjugate of a Gaussian integer a + bi is the Gaussian integer a – bi.

The norm of a Gaussian integer is its product with its conjugate.

${\displaystyle N(a+bi)=(a+bi)(a-bi)=a^{2}+b^{2}.}$

The norm of a Gaussian integer is thus the square of its absolute value as a complex number. The norm of a Gaussian integer is a nonnegative integer, which is a sum of two squares. Thus a norm cannot be of the form 4k + 3, with k integer.

The norm is multiplicative, that is, one has[2]

${\displaystyle N(zw)=N(z)N(w),}$

for every pair of Gaussian integers z, w. This can be shown directly, or by using the multiplicative property of the modulus of complex numbers.

The units of the ring of Gaussian integers (that is the Gaussian integers whose multiplicative inverse is also a Gaussian integer) are precisely the Gaussian integers with norm 1, that is, 1, –1, i and –i.[3]

Visualization of maximal distance to some Gaussian integer

Gaussian integers have a Euclidean division (division with remainder) similar to that of integers and polynomials. This makes the Gaussian integers a Euclidean domain, and implies that Gaussian integers share with integers and polynomials many important properties such as the existence of a Euclidean algorithm for computing greatest common divisors, Bézout's identity, the principal ideal property, Euclid's lemma, the unique factorization theorem, and the Chinese remainder theorem, all of which can be proved using only Euclidean division.

A Euclidean division algorithm takes, in the ring of Gaussian integers, a dividend a and divisor b ≠ 0, and produces a quotient q and remainder r such that

${\displaystyle a=bq+r\quad {\text{and}}\quad N(r)<N(b).}$

In fact, one may make the remainder smaller:

${\displaystyle a=bq+r\quad {\text{and}}\quad N(r)\leq {\frac {N(b)}{2}}.}$

Even with this better inequality, the quotient and the remainder are not necessarily unique, but one may refine the choice to ensure uniqueness.

To prove this, one may consider the complex number quotient x + iy = a/b. There are unique integers m and n such that –1/2 < x – m ≤ 1/2 and –1/2 < y – n ≤ 1/2, and thus N(x – m + i(y – n)) ≤ 1/2. Taking q = m + in, one has

${\displaystyle a=bq+r,}$

with

${\displaystyle r=b{\bigl (}x-m+i(y-n){\bigr )},}$

and

${\displaystyle N(r)\leq {\frac {N(b)}{2}}.}$

The choice of x – m and y – n in a semi-open interval is required for uniqueness. This definition of Euclidean division may be interpreted geometrically in the complex plane (see the figure), by remarking that the distance from a complex number ξ to the closest Gaussian integer is at most √2/2.[4]

Since the ring G of Gaussian integers is a Euclidean domain, G is a principal ideal domain, which means that every ideal of G is principal. Explicitly, an ideal I is a subset of a ring R such that every sum of elements of I and every product of an element of I by an element of R belong to I. An ideal is principal, if it consists of all multiples of a single element g, that is, it has the form

${\displaystyle \{gx\mid x\in G\}.}$

In this case, one says that the ideal is generated by g or that g is a generator of the ideal.

Every ideal I in the ring of the Gaussian integers is principal, because, if one chooses in I a nonzero element g of minimal norm, for every element x of I, the remainder of Euclidean division of x by g belongs also to I and has a norm that is smaller than that of g; because of the choice of g, this norm is zero, and thus the remainder is also zero. That is, one has x = qg, where q is the quotient.

For any g, the ideal generated by g is also generated by any associate of g, that is, g, gi, –g, –gi; no other element generates the same ideal. As all the generators of an ideal have the same norm, the norm of an ideal is the norm of any of its generators.

In some circumstances, it is useful to choose, once for all, a generator for each ideal. There are two classical ways for doing that, both considering first the ideals of odd norm. If the g = a + bi has an odd norm a² + b², then one of a and b is odd, and the other is even. Thus g has exactly one associate with a real part a that is odd and positive. In his original paper, Gauss made another choice, by choosing the unique associate such that the remainder of its division by 2 + 2i is one. In fact, as N(2 + 2i) = 8, the norm of the remainder is not greater than 4. As this norm is odd, and 3 is not the norm of a Gaussian integer, the norm of the remainder is one, that is, the remainder is a unit. Multiplying g by the inverse of this unit, one finds an associate that has one as a remainder, when divided by 2 + 2i.

If the norm of g is even, then either g = 2^kh or g = 2^kh(1 + i), where k is a positive integer, and N(h) is odd. Thus, one chooses the associate of g for getting a h which fits the choice of the associates for elements of odd norm.

As the Gaussian integers form a principal ideal domain they form also a unique factorization domain. This implies that a Gaussian integer is irreducible (that is, it is not the product of two non-units) if and only if it is prime (that is, it generates a prime ideal).

The prime elements of Z[i] are also known as Gaussian primes. An associate of a Gaussian prime is also a Gaussian prime. The conjugate of a Gaussian prime is also a Gaussian prime (this implies that Gaussian primes are symmetric about the real and imaginary axes).

A positive integer is a Gaussian prime if and only if it is a prime number that is congruent to 3 modulo 4 (that is, it may be written 4n + 3, with n a nonnegative integer) (sequence A002145 in the OEIS). The other prime numbers are not Gaussian primes, but each is the product of two conjugate Gaussian primes.

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

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

In other words, a Gaussian integer is a Gaussian prime if and only if either its norm is a prime number, or it is the product of a unit (±1, ±i) and a prime number of the form 4n + 3.

It follows that there are three cases for the factorization of a prime number p in the Gaussian integers:

• If p is congruent to 3 modulo 4, then it is a Gaussian prime; in the language of algebraic number theory, p is said to be inert in the Gaussian integers.
• If p is congruent to 1 modulo 4, then it is the product of a Gaussian prime by its conjugate, both of which are non-associated Gaussian primes (neither is the product of the other by a unit); p is said to be a decomposed prime in the Gaussian integers. For example, 5 = (2 + i)(2 − i) and 13 = (3 + 2i)(3 − 2i).
• If p = 2, we have 2 = (1 + i)(1 − i) = i(1 − i)²; that is, 2 is the product of the square of a Gaussian prime by a unit; it is the unique ramified prime in the Gaussian integers.

As for every unique factorization domain, every Gaussian integer may be factored as a product of a unit and Gaussian primes, and this factorization is unique up to the order of the factors, and the replacement of any prime by any of its associates (together with a corresponding change of the unit factor).

If one chooses, once for all, a fixed Gaussian prime for each equivalence class of associated primes, and if one takes only these selected primes in the factorization, then one obtains a prime factorization which is unique up to the order of the factors. With the choices described above, the resulting unique factorization has the form

${\displaystyle u(1+i)^{e_{0}}{p_{1}}^{e_{1}}\cdots {p_{k}}^{e_{k}},}$

where u is a unit (that is, u ∈ {1, –1, i, –i}), e₀ and k are nonnegative integers, e₁, …, e_k are positive integers, and p₁, …, p_k are distinct Gaussian primes such that, depending on the choice of selected associates,

• either p_k = a_k + ib_k with a odd and positive, and b even,
• or the remainder of the Euclidean division of p_k by 2 + 2i equals 1 (this is Gauss's original choice[5]).

An advantage of the second choice is that the selected associates behave well under products for Gaussian integers of odd norm. On the other hand, the selected associate for the real Gaussian primes are negative integers. For example, the factorization of 231 in the integers, and with the first choice of associates is 3 × 7 × 11, while it is (–1) × (–3) × (–7) × (–11) with the second choice.

The field of Gaussian rationals is the field of fractions of the ring of Gaussian integers. It consists of the complex numbers whose real and imaginary part are both rational.

The ring of Gaussian integers is the integral closure of the integers in the Gaussian rationals.

This implies that Gaussian integers are quadratic integers and that a Gaussian rational is a Gaussian integer, if and only if it is a solution of an equation

${\displaystyle x^{2}+cx+d=0,}$

with c and d integers. In fact a + bi is solution of the equation

${\displaystyle x^{2}-2ax+a^{2}+b^{2},}$

and this equation has integer coefficients if and only if a and b are both integers.

As for any unique factorization domain, a greatest common divisor (gcd) of two Gaussian integers a, b is a Gaussian integer d that is a common divisor of a and b, which has all common divisors of a and b as divisor. That is (where | denotes the divisibility relation),

• d | a and d | b, and
• c | a and c | b implies c | d.

Thus, greatest is meant relatively to the divisibility relation, and not for an ordering of the ring (for integers, both meanings of greatest coincide).

More technically, a greatest common divisor of a and b is a generator of the ideal generated by a and b (this characterization is valid for principal ideal domains, but not, in general, for unique factorization domains).

The greatest common divisor of two Gaussian integers is not unique, but is defined up to the multiplication by a unit. That is, given a greatest common divisor d of a and b, the greatest common divisors of a and b are d, –d, id, and –id.

There are several ways for computing a greatest common divisor of two Gaussian integers a and b. When one knows the prime factorizations of a and b,

${\displaystyle a=i^{k}\prod _{m}{p_{m}}^{\nu _{m}},\quad b=i^{n}\prod _{m}{p_{m}}^{\mu _{m}},}$

where the primes p_m are pairwise non associated, and the exponents μ_m non-associated, a greatest common divisor is

${\displaystyle \prod _{m}{p_{m}}^{\lambda _{m}},}$

with

${\displaystyle \lambda _{m}=\min(\nu _{m},\mu _{m}).}$

Unfortunately, except in simple cases, the prime factorization is difficult to compute, and Euclidean algorithm leads to a much easier (and faster) computation. This algorithm consists of replacing of the input (a, b) by (b, r), where r is the remainder of the Euclidean division of a by b, and repeating this operation until getting a zero remainder, that is a pair (d, 0). This process terminates, because, at each step, the norm of the second Gaussian integer decreases. The resulting d is a greatest common divisor, because (at each step) b and r = a – bq have the same divisors as a and b, and thus the same greatest common divisor.

This method of computation works always, but is not as simple as for integers because Euclidean division is more complicated. Therefore, a third method is often preferred for hand-written computations. It consists in remarking that the norm N(d) of the greatest common divisor of a and b is a common divisor of N(a), N(b), and N(a + b). When the greatest common divisor D of these three integers has few factors, then it is easy to test, for common divisor, all Gaussian integers with a norm dividing D.

For example, if a = 5 + 3i, and b = 2 – 8i, one has N(a) = 34, N(b) = 68, and N(a + b) = 74. As the greatest common divisor of the three norms is 2, the greatest common divisor of a and b has 1 or 2 as a norm. As a gaussian integer of norm 2 is necessary associated to 1 + i, and as 1 + i divides a and b, then the greatest common divisor is 1 + i.

If b is replaced by its conjugate b = 2 + 8i, then the greatest common divisor of the three norms is 34, the norm of a, thus one may guess that the greatest common divisor is a, that is, that a | b. In fact, one has 2 + 8i = (5 + 3i)(1 + i).

Given a Gaussian integer z₀, called a modulus, two Gaussian integers z₁,z₂ are congruent modulo z₀, if their difference is a multiple of z₀, that is if there exists a Gaussian integer q such that z₁ − z₂ = qz₀. In other words, two Gaussian integers are congruent modulo z₀, if their difference belongs to the ideal generated by z₀. This is denoted as z₁ ≡ z₂ (mod z₀).

The congruence modulo z₀ is an equivalence relation (also called a congruence relation), which defines a partition of the Gaussian integers into equivalence classes, called here congruence classes or residue classes. The set of the residue classes is usually denoted Z[i]/z₀Z[i], or Z[i]/⟨z₀⟩, or simply Z[i]/z₀.

The residue class of a Gaussian integer a is the set

${\displaystyle {\bar {a}}:=\left\{z\in \mathbf {Z} [i]\mid z\equiv a{\pmod {z_{0}}}\right\}}$

of all Gaussian integers that are congruent to a. It follows that a = b if and only if a ≡ b (mod z₀).

Addition and multiplication are compatible with congruences. This means that a₁ ≡ b₁ (mod z₀) and a₂ ≡ b₂ (mod z₀) imply a₁ + a₂ ≡ b₁ + b₂ (mod z₀) and a₁a₂ ≡ b₁b₂ (mod z₀). This defines well-defined operations (that is independent of the choice of representatives) on the residue classes:

${\displaystyle {\bar {a}}+{\bar {b}}:={\overline {a+b}}\quad {\text{and}}\quad {\bar {a}}\cdot {\bar {b}}:={\overline {ab}}.}$

With these operations, the residue classes form a commutative ring, the quotient ring of the Gaussian integers by the ideal generated by z₀, which is also traditionally called the residue class ring modulo z₀ (for more details, see Quotient ring).

Describing residue classes

All 13 residue classes with their minimal residues (blue dots) in the square Q₀₀ (light green background) for the modulus z₀ = 3 + 2i. One residue class with z = 2 − 4i ≡ −i (mod z₀) is highlighted with yellow/orange dots.

Given a modulus z₀, all elements of a residue class have the same remainder for the Euclidean division by z₀, provided one uses the division with unique quotient and remainder, which is described above. Thus enumerating the residue classes is equivalent with enumerating the possible remainders. This can be done geometrically in the following way.

In the complex plane, one may consider a square grid, whose squares are delimited by the two lines

${\displaystyle {\begin{aligned}V_{s}&=\left\{\left.z_{0}\left(s-{\tfrac {1}{2}}+ix\right)\right\vert x\in \mathbf {R} \right\}\quad {\text{and}}\\H_{t}&=\left\{\left.z_{0}\left(x+i\left(t-{\tfrac {1}{2}}\right)\right)\right\vert x\in \mathbf {R} \right\},\end{aligned}}}$

with s and t integers (blue lines in the figure). These divide the plane in semi-open squares (where m and n are integers)

${\displaystyle Q_{mn}=\left\{(s+it)z_{0}\left\vert s\in \left[m-{\tfrac {1}{2}},m+{\tfrac {1}{2}}\right),t\in \left[n-{\tfrac {1}{2}},n+{\tfrac {1}{2}}\right)\right.\right\}.}$

The semi-open intervals that occur in the definition of Q_mn have been chosen in order that every complex number belong to exactly one square; that is, the squares Q_mn form a partition of the complex plane. One has

${\displaystyle Q_{mn}=(m+in)z_{0}+Q_{00}=\left\{(m+in)z_{0}+z\mid z\in Q_{00}\right\}.}$

This implies that every Gaussian integer is congruent modulo z₀ to a unique Gaussian integer in Q₀₀ (the green square in the figure), which its remainder for the division by z₀. In other words, every residue class contains exactly one element in Q₀₀.

The Gaussian integers in Q₀₀ (or in its boundary) are sometimes called minimal residues because their norm are not greater than the norm of any other Gaussian integer in the same residue class (Gauss called them absolutely smallest residues).

From this one can deduce by geometrical considerations, that the number of residue classes modulo a Gaussian integer z₀ = a + bi equals its norm N(z₀) = a² + b² (see below for a proof; similarly, for integers, the number of residue classes modulo n is its absolute value |n|).

Proof

The relation Q_mn = (m + in)z₀ + Q₀₀ means that all Q_mn are obtained from Q₀₀ by translating it by a Gaussian integer. This implies that all Q_mn have the same area N = N(z₀), and contain the same number n_g of Gaussian integers.

Generally, the number of grid points (here the Gaussian integers) in an arbitrary square with the area A is A + Θ(√A) (see Big theta for the notation). If one considers a big square consisting of k × k squares Q_mn, then it contains k²N + O(k√N) grid points. It follows k²n_g = k²N + Θ(k√N), and thus n_g = N + Θ(√N/k), after a division by k². Taking the limit when k tends to the infinity gives n_g = N = N(z₀).

Many theorems (and their proofs) for moduli of integers can be directly transferred to moduli of Gaussian integers, if one replaces the absolute value of the modulus by the norm. This holds especially for the primitive residue class group (also called multiplicative group of integers modulo n) and Euler's totient function. The primitive residue class group of a modulus z is defined as the subset of its residue classes, which contains all residue classes a that are coprime to z, i.e. (a,z) = 1. Obviously, this system builds a multiplicative group. The number of its elements shall be denoted by ϕ(z) (analogously to Euler's totient function φ(n) for integers n).

For Gaussian primes it immediately follows that ϕ(p) = |p|² − 1 and for arbitrary composite Gaussian integers

${\displaystyle z=i^{k}\prod _{m}{p_{m}}^{\nu _{m}}}$

Euler's product formula can be derived as

${\displaystyle \phi (z)=\prod _{m\,(\nu _{m}>0)}{\bigl |}{p_{m}}^{\nu _{m}}{\bigr |}^{2}\left(1-{\frac {1}{|p_{m}|{}^{2}}}\right)=|z|^{2}\prod _{p_{m}|z}\left(1-{\frac {1}{|p_{m}|{}^{2}}}\right)}$

where the product is to build over all prime divisors p_m of z (with ν_m > 0). Also the important theorem of Euler can be directly transferred:

For all a with (a,z) = 1, it holds that a^ϕ(z) ≡ 1 (mod z).

The ring of Gaussian integers was introduced by Carl Friedrich Gauss in his second monograph on quartic reciprocity (1832).[6] The theorem of quadratic reciprocity (which he had first succeeded in proving in 1796) relates the solvability of the congruence x² ≡ q (mod p) to that of x² ≡ p (mod q). Similarly, cubic reciprocity relates the solvability of x³ ≡ q (mod p) to that of x³ ≡ p (mod q), and biquadratic (or quartic) reciprocity is a relation between x⁴ ≡ q (mod p) and x⁴ ≡ p (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.

The distribution of the small Gaussian primes in the complex plane

Most of the unsolved problems are related to distribution of Gaussian primes in the plane.

• 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?[7]
• Is it possible to walk to infinity using the Gaussian primes as stepping stones and taking steps of a uniformly bounded length? This is known as the Gaussian moat problem; it was posed in 1962 by Basil Gordon and remains unsolved.[8][9]

• Algebraic integer
• Cyclotomic field
• Eisenstein integer
• Eisenstein prime
• Hurwitz quaternion
• Proofs of Fermat's theorem on sums of two squares
• Proofs of quadratic reciprocity
• Quadratic integer
• Splitting of prime ideals in Galois extensions describes the structure of prime ideals in the Gaussian integers
• Table of Gaussian integer factorizations

• C. F. Gauss (1831) "Theoria residuorum biquadraticorum. Commentatio secunda.", Comm. Soc. Reg. Sci. Göttingen 7: 89-148; reprinted in Werke, Georg Olms Verlag, Hildesheim, 1973, pp. 93–148. A German translation of this paper is available online in ″H. Maser (ed.): Carl Friedrich Gauss’ Arithmetische Untersuchungen über höhere Arithmetik. Springer, Berlin 1889, pp. 534″.
• Fraleigh, John B. (1976), A First Course In Abstract Algebra (2nd ed.), Reading: Addison-Wesley, ISBN 0-201-01984-1
• Kleiner, Israel (1998). "From Numbers to Rings: The Early History of Ring Theory". Elem. Math. 53 (1): 18–35. doi:10.1007/s000170050029. Zbl 0908.16001.
• Ribenboim, Paulo (1996). The New Book of Prime Number Records (3rd ed.). New York: Springer. ISBN 0-387-94457-5. Zbl 0856.11001.
• Henry G. Baker (1993). "Complex Gaussian Integers for "Gaussian Graphics"". ACM SIGPLAN Notices. 28 (11): 22–27. doi:10.1145/165564.165571. S2CID 8083226.

• IMO Compendium text on quadratic extensions and Gaussian Integers in problem solving
• Keith Conrad, The Gaussian Integers.