What Is a Quotient Ring of the Gaussian Integers?
At a glance
- 1. Choose an ideal
A quotient is determined by an ideal I; in the Gaussian integers, every ideal is generated by one number α.
- 2. Identify equivalent elements
In Z[i]/(α), two Gaussian integers represent the same class exactly when their difference is divisible by α.
- 3. Count the classes
For nonzero α = a + bi, the quotient has a² + b² elements.
- 4. Check for a field
The quotient is a field exactly when α is a Gaussian prime, or equivalently when (α) is a maximal ideal.
The Gaussian integers are the complex numbers with integer real and imaginary parts: , where . A quotient ring is formed by declaring certain elements equivalent, but the result depends on which ideal you quotient by. Thus, “the quotient ring of the Gaussian integers” is not one specific ring until the ideal is given.
Because is a principal ideal domain, every ideal is generated by one Gaussian integer . The usual quotient therefore has the form .
What the quotient means
The ideal consists of all Gaussian-integer multiples of :
In the quotient , two Gaussian integers and represent the same element precisely when their difference belongs to this ideal:
or, equivalently, when divides in . The elements of the quotient are these equivalence classes, written . Addition and multiplication are performed using representatives: , and likewise for multiplication.
This is the Gaussian-integer version of reducing ordinary integers modulo . In , two integers are equivalent when their difference is divisible by ; here the divisor can be a complex number with integer coordinates.
How many elements are in the quotient?
For , define its norm by
Then has exactly elements. One way to see the count is to view multiplication by as a linear transformation on the integer-coordinate lattice. It sends to , whose matrix has determinant . The absolute determinant is the index of the image lattice, which is the number of distinct quotient classes.
For example, , so has five elements. By contrast, has elements.
This count assumes . If , the quotient by is itself and is infinite. If is a unit, then , so the quotient has just one element.
Worked example: quotient by (2)
In , coefficients are reduced modulo 2. Every class has one of the four representatives , , , or . Also, in this quotient, because .
Equivalently, write the ring as , identifying with . In the field , , so this is not a field: it contains the nonzero element whose square is zero:
A nonzero element whose power is zero is called nilpotent. Its presence shows that the quotient has zero divisors and cannot be a field.
Worked example: quotient by (2 + i)
Now consider . In the quotient, , so . Since the quotient has five elements, calculations can be made in . The map
respects addition and multiplication and sends to . This is consistent with , since . It gives an isomorphism , so this quotient is a field.
When is the quotient a field?
For a commutative ring, the quotient by an ideal is a field exactly when that ideal is maximal. In , every ideal is principal, so is a field exactly when is a Gaussian prime (a nonzero nonunit that is irreducible).
A useful caution: a prime norm is enough to show that is a Gaussian prime, but it is not necessary. For instance, is a Gaussian prime even though . Up to multiplication by units, Gaussian primes are , rational primes with , and numbers whose norm is a rational prime. This classification can help decide whether a particular quotient is a field.
Common mistakes
- Leaving out the ideal. The notation needs a specified ideal ; different choices give different rings.
- Treating the modulus like an ordinary integer. Divisibility is in , and the modulus may have both real and imaginary parts.
- Assuming every finite quotient is a field. A finite quotient can have zero divisors, as demonstrates.
- Using the norm as the field test. The norm counts elements when the generator is nonzero. A prime norm guarantees a field, but composite norm alone does not rule one out; check whether the generator is a Gaussian prime.
References
- Abstract Algebra, by David S. Dummit and Richard M. Foote
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.