Eisenstein integer

In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the complex numbers of the form : z = a + b\omega , where and are integers and : \omega = \frac{-1 + i\sqrt 3}{2} = e^{i2\pi/3} is a primitive (hence non-real) cube root of unity. The Eisenstein integers form a triangular lattice in the complex plane, in contrast with the Gaussian integers, which form a square lattice in the complex plane. The Eisenstein integers are a countably infinite set.

In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the complex numbers of the form z = a + b\omega , where and are integers and \omega = \frac{-1 + i\sqrt 3}{2} = e^{i2\pi/3} is a primitive (hence non-real) cube root of unity. The Eisenstein integers form a triangular lattice in the complex plane, in contrast with the Gaussian integers, which form a square lattice in the complex plane. The Eisenstein integers are a countably infinite set. \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 {\left|a + b\;\!\omega\right|}^2 \,= \, {(a - \tfrac{1}{2} b)}^2 + \tfrac{3}{4} b^2 \, = \, a^2 - ab + b^2~, which is clearly a positive ordinary (rational) integer. Also, the complex conjugate of satisfies \bar\omega = \omega^2~. The group of units in this ring is the cyclic group formed by the sixth roots of unity in the complex plane: , the Eisenstein integers of norm  . N(a+b\,\omega) = a^2 - a b + b^2. A division algorithm, applied to any dividend and divisor , gives a quotient and a remainder smaller than the divisor, satisfying: \alpha = \kappa \beta +\rho \ \ \text{ with }\ \ N(\rho) Here, , , , are all Eisenstein integers. This algorithm implies the Euclidean algorithm, 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{\alpha}{\beta}\ =\ \tfrac{1}{\ |\beta|^2}\alpha\overline{\beta} \ =\ a+bi \ =\ a+\tfrac{1}{\sqrt3}b+\tfrac{2}{\sqrt3}b\omega, for rational . Then obtain the Eisenstein integer quotient by rounding the rational coefficients to the nearest integer: \kappa = \left\lfloor a+\tfrac{1}{\sqrt3}b\right\rceil + \left\lfloor \tfrac{2}{\sqrt3}b\right\rceil\omega \ \ \text{ and }\ \ \rho = {\alpha} - \kappa\beta. Here \lfloor x\rceil may denote any of the standard rounding-to-integer functions. The reason this satisfies , while the analogous procedure fails for most other quadratic integer rings, is as follows. A fundamental domain for the ideal , acting by translations on the complex plane, is the 60°–120° rhombus with vertices , , , . Any Eisenstein integer lies inside one of the translates of this parallelogram, and the quotient 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 \tfrac{\sqrt3}2 |\beta| , so |\rho| \leq \tfrac{\sqrt3}2 |\beta| . (The size of could be slightly decreased by taking to be the closest corner.) In the second type, factors of , 1-\omega and 1-\omega^2 are associates: 1-\omega=(-\omega)(1-\omega^2) , so it is regarded as a special type in some books. The first few Eisenstein primes of the form are: 2, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, ... . Natural primes that are congruent to or modulo are not Eisenstein primes: they admit nontrivial factorizations in . For example: . In general, if a natural prime is modulo and can therefore be written as , then it factorizes over as . Some non-real Eisenstein primes are , , , , , , . Up to conjugacy and unit multiples, the primes listed above, together with and , are all the Eisenstein primes of absolute value not exceeding . , the largest known real Eisenstein prime is the 12th-largest known prime , discovered by Péter Szabolcs and PrimeGrid. \sum_{z\in\mathbf{E}\setminus\{0\}}\frac{1}{z^4}=G_4\left(e^{\frac{2\pi i}{3}}\right)=0 so e^{2\pi i/3} is a root of j-invariant. In general G_k\left(e^{\frac{2\pi i}{3}}\right)=0 if and only if k\not\equiv 0 \pmod 6 . The sum of the reciprocals of all Eisenstein integers excluding raised to the sixth power can be expressed in terms of the gamma function: \sum_{z\in\mathbf{E}\setminus\{0\}}\frac{1}{z^6}=G_6\left(e^{\frac{2\pi i}{3}}\right)=\frac{\Gamma (1/3)^{18}}{8960\pi^6} \approx 5.86303 where are the Eisenstein integers and is the Eisenstein series of weight 6.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378592357 under CC BY-SA 4.0; modifications have been made.