Eisenstein integer

The Eisenstein integers are the complex numbers of the form a + bω, where a and b are integers and ω = (−1 + √−3)/2 is a primitive cube root of unity, satisfying ω² + ω + 1 = 0. The ring ℤ[ω] is closed under addition and multiplication, and its units are the six elements ±1, ±ω, ±ω². The norm of an Eisenstein integer α = a + bω is N(α) = a² − ab + b², which is always a nonnegative integer and is multiplicative: N(αβ) = N(α)N(β). This norm makes ℤ[ω] a Euclidean domain, meaning that a Euclidean algorithm exists, and consequently it is a unique factorization domain. The primes in this ring are called Eisenstein primes, and they play a role analogous to ordinary primes in the integers.

Because ℤ[ω] is a Euclidean domain, every nonzero non-unit element factors uniquely into Eisenstein primes up to order and multiplication by units. An ordinary prime p is an Eisenstein prime if and only if p ≡ 2 (mod 3); if p ≡ 1 (mod 3), then p splits as a product of two conjugate Eisenstein primes, and the prime 3 ramifies as (1 − ω)² times a unit. The norm of an Eisenstein integer is a positive integer, and an integer n is representable as a² − ab + b² if and only if every prime factor of n that is congruent to 2 mod 3 appears with an even exponent. This property connects Eisenstein integers to the theory of quadratic forms and to the representation of integers by the form x² − xy + y². The Euclidean algorithm in ℤ[ω] can be used to compute greatest common divisors and to solve linear Diophantine equations in the ring.

Eisenstein integers are central to the study of cubic reciprocity, a generalization of quadratic reciprocity that describes when a cubic congruence has solutions. The law of cubic reciprocity is naturally formulated in ℤ[ω], and it was proved by Gotthold Eisenstein in 1844. The ring also appears in the proof of Fermat's Last Theorem for the exponent 3, where the factorization of x³ + y³ = z³ in ℤ[ω] leads to a contradiction. In geometry, the Eisenstein integers form the vertices of the triangular lattice, which is the dual of the hexagonal lattice; this lattice appears in the packing of circles, in the structure of certain crystals, and in the design of cellular networks. The norm of an Eisenstein integer gives the squared distance from the origin in the triangular lattice, and the units correspond to the sixfold rotational symmetries of the lattice.

Beyond the classical theory, Eisenstein integers have found niche applications. In cryptography, they are used in the construction of lattice-based cryptosystems, such as the NTRU-like schemes over the Eisenstein integers, which can offer efficiency advantages over integer lattices. In signal processing, the hexagonal lattice formed by Eisenstein integers is used for optimal sampling of two-dimensional signals, as it requires fewer samples than rectangular sampling for bandlimited signals. The ring also appears in the study of the Eisenstein integers' connection to the modular group and the j-invariant, where the Eisenstein series of weight 2 and 4 are related to the ring's arithmetic. A less-known fact is that the Eisenstein integers are the ring of integers of the cyclotomic field ℚ(√−3), and they are one of only a few imaginary quadratic fields with class number 1, which implies unique factorization. The norm form a² − ab + b² is also the binary quadratic form of discriminant −3, and it is the only positive definite binary quadratic form with class number 1 up to equivalence.

Norm

For an Eisenstein integer a + bω, the norm is a² − ab + b², a nonnegative integer that is multiplicative.

Unit

An element with a multiplicative inverse in the ring; the units of ℤ[ω] are ±1, ±ω, ±ω².

Eisenstein prime

An element of ℤ[ω] that is not a unit and cannot be factored into two non-units.

Euclidean domain

An integral domain with a norm function that allows a Euclidean algorithm for division.

Cubic reciprocity

A reciprocity law for cubic residues, naturally formulated in the Eisenstein integers.