In a principal ideal domain, an ascending chain of ideals stabilizes: its union is an ideal , and its generator belongs to one member, which then contains the union. This proves the needed ascending chain condition. If a nonzero nonunit had no finite irreducible factorization, split it into two nonunits and select a factor that still has no such factorization. Continuing would give a strictly ascending chain of principal ideals, because with a nonunit implies . This contradicts the chain condition, so factorization exists.
An irreducible element generates a maximal ideal: any intermediate ideal is with , and irreducibility forces or to be a unit. Therefore is a prime element. In any two irreducible factorizations, the first prime factor divides a factor of the other, hence is associate to it. Cancel and continue. This proves every principal ideal domain is a unique factorization domain.
In , the multiplicative field norm is . The only units are . There is no element of norm two, so every element of norm four is irreducible: a factorization into nonunits would require norms two and two. Consequentlyis a pair of genuinely different irreducible factorizations. Neither nor is associate to .
Take the Eisenstein integers , where and . Since , the embedded subring is , whose additive index in is two. Its larger ring has Eisenstein-integer norm and is Euclidean. Indeed, write a complex quotient in the real basis and round both coordinates to integers. The coordinate errors satisfy , giving . Thus division leaves a remainder of smaller norm. A Euclidean domain is a principal ideal domain, because division by a nonzero element of least norm in an ideal leaves zero remainder. This gives the requested index-two embedding into a principal ideal domain.
Articles by others on the same topic
There are currently no matching articles.