Processing math: 100%

Monday, May 27, 2013

Prime and Maximal Monomial Ideals (9.6.42)

Dummit and Foote Abstract Algebra, section 9.6, exercise 42:

MathJax TeX Test Page (a) Show M is a monomial prime ideal if and only if M=(S) for some S{x1,...,xn}.
(b) Show (x1,...,xn) is the only maximal monomial ideal.

Proof: (a) () Letting I be such that S={xi | iI}, we have F[x1,...,xn]/MF[xj | jI] which is again a polynomial ring in several variables over a field and is thus in particular an integral domain. () Since M is a monomial ideal, let M=(m1,...) with the monomials countably ordered by m1m2 if deg(m2)<deg(m1) and decided by lexicographic ordering if deg(m2)=deg(m1). Trim this generating list by a process of eliminating mi if it is not generatable by linear combinations of previous monomials. Choose m{x1,...,xn} in the generating set. letting xi be a variable dividing m, we must have xiM else by exercise 10 xi is divisible by a term in the generating list, forcing xi in the generating list so that by the ordering xi appears before m and now m could not have been included. Since xi was arbitrary, we have the product of the variables dividing m violating the primality of M. Therefore m does not exist, and this generating subset is a subset of {x1,...,xn}.

(b) Since maximal ideals are prime ideals, if M=(S) with S{x1,...,xn}, by part (a) we have M(x1,...,xn)F[x1,...,xn], a contradiction. 

No comments:

Post a Comment