A Gaussian integer has the form with . Its multiplicative norm is , which makes a Euclidean domain.
The product of a Gaussian integer with its complex conjugate. It is multiplicative: , which gives the Brahmagupta-Fibonacci identity.
A nonzero Gaussian integer is squarefree if no square of a Gaussian prime divides it. Equivalently, every exponent in its Gaussian prime factorization is at most one, disregarding multiplication by units.
The Gaussian integer is not squarefree, because . By contrast is squarefree: its factors are nonassociate Gaussian primes. Thus squarefreeness in need not agree with squarefreeness in . This distinction is essential when using a Gaussian Möbius function to exclude repeated prime factors.
The Gaussian Möbius function on nonzero Gaussian integers is zero when a square of a Gaussian prime divides the argument, and otherwise equals , where is the number of nonassociate prime factors. It takes value one on units and is unchanged by multiplying its argument by a unit.
To sum over divisors without counting associates four times, one may define it on nonzero principal ideals, or choose one generator from each associate class. Then is one for the unit ideal and zero otherwise: for a product of distinct prime ideals the sum is . This gives Möbius inversion in Gaussian arithmetic.
A Gaussian prime is a nonzero nonunit Gaussian integer irreducible in . Since this ring is a Euclidean domain, irreducible and prime elements coincide. For , is a Gaussian prime exactly when is an ordinary prime number. On a coordinate axis, it is prime exactly when the nonzero coordinate has absolute value an ordinary prime congruent to three modulo four.
Thus , , and are Gaussian primes, while and are not. The multiplicative norm makes these factorizations and primality tests transparent.
An odd Gaussian integer is primary when it satisfies the displayed congruence. The four units have distinct images in , a group of order four; hence every odd ideal has a unique primary generator. Indeed and .
If is a Gaussian integer and is a nonzero prime ideal of , then is a finite field. Complex conjugation preserves , so a nonzero gives the positive integer . Primality supplies a rational prime . Since satisfies the monic polynomial , the ring is a quotient of and has at most elements. It is a finite integral domain, hence a field. The proof does not require to be a principal ideal domain.

Ancestors (9)

  1. Euclidean domain
  2. Principal ideal domain
  3. Integral domain
  4. Commutative algebra
  5. Ring theory
  6. Algebra
  7. Area of mathematics
  8. Mathematics
  9. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

A **Gaussian integer** is a complex number of the form \( a + bi \), where \( a \) and \( b \) are both integers, and \( i \) is the imaginary unit with the property that \( i^2 = -1 \). In other words, Gaussian integers are the set of complex numbers whose real and imaginary parts are both whole numbers.