Eisenstein Integers
   HOME

TheInfoList



OR:

In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after
Leonhard Euler Leonhard Euler ( , ; 15 April 170718 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician and engineer who founded the studies of graph theory and topology and made pioneering and influential discoveries in ma ...
), are the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
s of the form :z = a + b\omega , where and are
integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
s and :\omega = \frac = e^ is a
primitive Primitive may refer to: Mathematics * Primitive element (field theory) * Primitive element (finite field) * Primitive cell (crystallography) * Primitive notion, axiomatic systems * Primitive polynomial (disambiguation), one of two concepts * Pr ...
(hence non-real) cube root of unity. The Eisenstein integers form a triangular lattice in the
complex plane In mathematics, the complex plane is the plane formed by the complex numbers, with a Cartesian coordinate system such that the -axis, called the real axis, is formed by the real numbers, and the -axis, called the imaginary axis, is formed by th ...
, in contrast with the
Gaussian integers In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as \mathbf /ma ...
, which form a square lattice in the complex plane. The Eisenstein integers are a countably infinite set.


Properties

The Eisenstein integers form a commutative ring of algebraic integers in the
algebraic number field In mathematics, an algebraic number field (or simply number field) is an extension field K of the field of rational numbers such that the field extension K / \mathbb has finite degree (and hence is an algebraic field extension). Thus K is a ...
\mathbb(\omega) — the third cyclotomic field. To see that the Eisenstein integers are algebraic integers note that each is a root of the monic polynomial :z^2 - (2a - b)\;\!z + \left(a^2 - ab + b^2\right)~. In particular, satisfies the equation :\omega^2 + \omega + 1 = 0~. The product of two Eisenstein integers and is given explicitly by :(a + b\;\!\omega) \;\! (c + d\;\!\omega)=(ac - bd) + (bc + ad - bd)\;\!\omega~. The 2-norm of an Eisenstein integer is just its squared modulus, and is given by :^2 \,= \, ^2 + \tfrac b^2 \, = \, a^2 - ab + b^2~, which is clearly a positive ordinary (rational) integer. Also, the
complex conjugate In mathematics, the complex conjugate of a complex number is the number with an equal real part and an imaginary part equal in magnitude but opposite in sign. That is, (if a and b are real, then) the complex conjugate of a + bi is equal to a - ...
of satisfies :\bar\omega = \omega^2~. The group of units in this ring is the
cyclic group In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative bi ...
formed by the sixth
roots of unity In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power . Roots of unity are used in many branches of mathematics, and are especially important i ...
in the complex plane: \left\~, the Eisenstein integers of norm 1.


Eisenstein primes

If and are Eisenstein integers, we say that divides if there is some Eisenstein integer such that . A non-unit Eisenstein integer is said to be an Eisenstein prime if its only non-unit divisors are of the form , where is any of the six units. There are two types of Eisenstein prime. First, an ordinary
prime number A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only way ...
(or ''rational prime'') which is congruent to is also an Eisenstein prime. Second, 3 and each rational prime congruent to are equal to the norm of an Eisentein integer . Thus, such a prime may be factored as , and these factors are Eisenstein primes: they are precisely the Eisenstein integers whose norm is a rational prime.


Euclidean domain

The ring of Eisenstein integers forms a Euclidean domain whose norm is given by the square modulus, as above: :N(a+b\,\omega) = a^2 - a b + b^2. A
division algorithm A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder, the result of Euclidean division. Some are applied by hand, while others are employed by digital circuit designs and software. Di ...
, applied to any dividend \alpha and divisor \beta\neq 0, gives a quotient \kappa and a remainder \rho smaller than the divisor, satisfying: :\alpha = \kappa \beta +\rho \ \ \text\ \ N(\rho) < N(\beta). Here \alpha, \beta, \kappa, \rho are all Eisenstein integers. This algorithm implies the
Euclidean algorithm In mathematics, the Euclidean algorithm,Some widely used textbooks, such as I. N. Herstein's ''Topics in Algebra'' and Serge Lang's ''Algebra'', use the term "Euclidean algorithm" to refer to Euclidean division or Euclid's algorithm, is an ...
, which proves Euclid's lemma and the unique factorization of Eisenstein integers into Eisenstein primes. One division algorithm is as follows. First perform the division in the field of complex numbers, and write the quotient in terms of ω: : \frac\ =\ \tfrac\alpha\overline \ =\ a+bi \ =\ a+\tfracb+\tfracb\omega, for rational a,b\in\mathbb. Then obtain the Eisenstein integer quotient by rounding the rational coefficients to the nearest integer: :\kappa = \left\lfloor a+\tfracb\right\rceil + \left\lfloor \tfracb\right\rceil\omega \ \ \text\ \ \rho = - \kappa\beta. Here \lfloor x\rceil may denote any of the standard
rounding Rounding means replacing a number with an approximate value that has a shorter, simpler, or more explicit representation. For example, replacing $ with $, the fraction 312/937 with 1/3, or the expression with . Rounding is often done to obta ...
-to-integer functions. The reason this satisfies N(\rho) < N(\beta), while the analogous procedure fails for most other quadratic integer rings, is as follows. A fundamental domain for the ideal \mathbb
omega Omega (; capital: Ω, lowercase: ω; Ancient Greek ὦ, later ὦ μέγα, Modern Greek ωμέγα) is the twenty-fourth and final letter in the Greek alphabet. In the Greek numeric system/ isopsephy ( gematria), it has a value of 800. Th ...
beta =\mathbb Z\beta+\mathbb Z\omega\beta, acting by translations on the complex plane, is the 60°–120° rhombus with vertices 0,\beta,\omega\beta, \beta+\omega\beta. Any Eisenstein integer ''α'' lies inside one of the translates of this parallelogram, and the quotient \kappa is one of its vertices. The remainder is the square distance from ''α'' to this vertex, but the maximum possible distance in our algorithm is only \tfrac2 , \beta, , so , \rho, \leq \tfrac2 , \beta, < , \beta, . (The size of ''ρ'' could be slightly decreased by taking \kappa to be the closest corner.)


Quotient of by the Eisenstein integers

The quotient of the complex plane by the lattice containing all Eisenstein integers is a
complex torus In mathematics, a complex torus is a particular kind of complex manifold ''M'' whose underlying smooth manifold is a torus in the usual sense (i.e. the cartesian product of some number ''N'' circles). Here ''N'' must be the even number 2''n'', w ...
of real dimension 2. This is one of two tori with maximal symmetry among all such complex tori. This torus can be obtained by identifying each of the three pairs of opposite edges of a regular hexagon. (The other maximally symmetric torus is the quotient of the complex plane by the additive lattice of
Gaussian integers In number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as \mathbf /ma ...
, and can be obtained by identifying each of the two pairs of opposite sides of a square fundamental domain, such as .)


See also

* Gaussian integer * Cyclotomic field * Systolic geometry * Hermite constant *
Cubic reciprocity Cubic reciprocity is a collection of theorems in elementary and algebraic number theory that state conditions under which the congruence ''x''3 ≡ ''p'' (mod ''q'') is solvable; the word "reciprocity" comes from the form of ...
* Loewner's torus inequality * Hurwitz quaternion * Quadratic integer * Dixon elliptic functions


Notes


External links


Eisenstein Integer--from MathWorld
{{DEFAULTSORT:Eisenstein Integer Algebraic numbers Quadratic irrational numbers Cyclotomic fields Lattice points Systolic geometry Integers