The Eisenstein integers are , where . Their multiplicative algebraic norm isGiven , choose an Eisenstein integer nearest to the complex number . The hexagonal lattice has covering radius , soWith , multiplicativity givesThus division with remainder decreases the nonnegative integer norm, proving that .
Every Euclidean domain is a principal ideal domain: in a nonzero ideal choose an element of least positive Euclidean value and divide every other element by it; minimality forces every remainder to vanish. Every principal ideal domain is a unique factorization domain: the ascending-chain condition supplies factorizations into irreducibles, and Euclid lemma follows because every irreducible generates a prime ideal. Therefore
Factor the equation in the Eisenstein integers:Let . Its norm is , andso is a unit times . Suppose , say . Since ,The first term is divisible by and the second has discrete valuation exactly one, so . Conjugation gives as well. ConsequentlyBut is divisible by three, a contradiction. Hence
Articles by others on the same topic
There are currently no matching articles.