An algebraic integer is a complex number satisfying a monic polynomial with integer coefficients. Let be the monic minimal polynomial of . It is irreducible over . If is a monic polynomial vanishing at , then divides over . Gauss lemma for polynomials implies that monic rational factors of a monic integer polynomial have integer coefficients. Thus , and its irreducibility over implies irreducibility in .
For with , division by the monic works in , giving with . Since , minimality forces . Conversely each multiple of vanishes at . Therefore
Writing , division by expresses every element uniquely as with integer coefficients. A relation among these powers would be a nonzero vanishing polynomial of degree less than . Hence form a basis of the free module over .
The polynomial satisfies the Eisenstein criterion at the prime two: every nonleading coefficient is divisible by two, and the constant coefficient is not divisible by four. Thus it is irreducible over and is the minimal polynomial of every one of its roots. Part (a) gives
But
In the quotient, the two nonzero classes of and multiply to zero. They are nonzero because their nonzero representative degrees are less than five. The quotient is not an integral domain, so is not a prime ideal.
For ring homomorphisms preserving the identity, an image of in the Gaussian integers would satisfy . The minimal polynomial of over would then be , of degree five. This is impossible because has degree at most two. Thus there is no unital homomorphism . If homomorphisms are instead allowed not to preserve the identity, the zero map exists; every nonzero homomorphism into this integral domain is unital, because the image of one is a nonzero idempotent and hence one.
The multiplicative field norm on this ring is
If an element is a unit, its positive integer norm has a multiplicative inverse in the positive integers, hence is one. The only integer solutions of are . Therefore the units are exactly and .
The standard failure of unique factorization is
There is no element of norm two or three: gives norm at least five, while gives a square. An alleged nontrivial factorization of (norm four), (norm nine), or (norm six) would require a factor of norm two or three. Thus all four displayed factors are irreducible elements. No factor in the first factorization is associated to a factor in the second, since associates have the same norm and the norms are respectively four, nine and six. Hence is not a unique factorization domain.

Articles by others on the same topic (0)

There are currently no matching articles.