Misplaced Pages

Monomial ideal

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In abstract algebra, a monomial ideal is an ideal generated by monomials in a multivariate polynomial ring over a field.

A toric ideal is an ideal generated by differences of monomials (provided the ideal is prime). An affine or projective algebraic variety defined by a toric ideal or a homogeneous toric ideal is an affine or projective toric variety, possibly non-normal.

Definitions and properties

Let K {\displaystyle \mathbb {K} } be a field and R = K [ x ] {\displaystyle R=\mathbb {K} } be the polynomial ring over K {\displaystyle \mathbb {K} } with n indeterminates x = x 1 , x 2 , , x n {\displaystyle x=x_{1},x_{2},\dotsc ,x_{n}} .

A monomial in R {\displaystyle R} is a product x α = x 1 α 1 x 2 α 2 x n α n {\displaystyle x^{\alpha }=x_{1}^{\alpha _{1}}x_{2}^{\alpha _{2}}\cdots x_{n}^{\alpha _{n}}} for an n-tuple α = ( α 1 , α 2 , , α n ) N n {\displaystyle \alpha =(\alpha _{1},\alpha _{2},\dotsc ,\alpha _{n})\in \mathbb {N} ^{n}} of nonnegative integers.

The following three conditions are equivalent for an ideal I R {\displaystyle I\subseteq R} :

  1. I {\displaystyle I} is generated by monomials,
  2. If f = α N n c α x α I {\textstyle f=\sum _{\alpha \in \mathbb {N} ^{n}}c_{\alpha }x^{\alpha }\in I} , then x α I {\displaystyle x^{\alpha }\in I} , provided that c α {\displaystyle c_{\alpha }} is nonzero.
  3. I {\displaystyle I} is torus fixed, i.e, given ( c 1 , c 2 , , c n ) ( K ) n {\displaystyle (c_{1},c_{2},\dotsc ,c_{n})\in (\mathbb {K} ^{*})^{n}} , then I {\displaystyle I} is fixed under the action f ( x i ) = c i x i {\displaystyle f(x_{i})=c_{i}x_{i}} for all i {\displaystyle i} .

We say that I K [ x ] {\displaystyle I\subseteq \mathbb {K} } is a monomial ideal if it satisfies any of these equivalent conditions.

Given a monomial ideal I = ( m 1 , m 2 , , m k ) {\displaystyle I=(m_{1},m_{2},\dotsc ,m_{k})} , f K [ x 1 , x 2 , , x n ] {\displaystyle f\in \mathbb {K} } is in I {\displaystyle I} if and only if every monomial ideal term f i {\displaystyle f_{i}} of f {\displaystyle f} is a multiple of one the m j {\displaystyle m_{j}} .

Proof: Suppose I = ( m 1 , m 2 , , m k ) {\displaystyle I=(m_{1},m_{2},\dotsc ,m_{k})} and that f K [ x 1 , x 2 , , x n ] {\displaystyle f\in \mathbb {K} } is in I {\displaystyle I} . Then f = f 1 m 1 + f 2 m 2 + + f k m k {\displaystyle f=f_{1}m_{1}+f_{2}m_{2}+\dotsm +f_{k}m_{k}} , for some f i K [ x 1 , x 2 , , x n ] {\displaystyle f_{i}\in \mathbb {K} } .

For all 1 i k {\displaystyle 1\leqslant i\leqslant k} , we can express each f i {\displaystyle f_{i}} as the sum of monomials, so that f {\displaystyle f} can be written as a sum of multiples of the m i {\displaystyle m_{i}} . Hence, f {\displaystyle f} will be a sum of multiples of monomial terms for at least one of the m i {\displaystyle m_{i}} .

Conversely, let I = ( m 1 , m 2 , , m k ) {\displaystyle I=(m_{1},m_{2},\dotsc ,m_{k})} and let each monomial term in f K [ x 1 , x 2 , . . . , x n ] {\displaystyle f\in \mathbb {K} } be a multiple of one of the m i {\displaystyle m_{i}} in I {\displaystyle I} . Then each monomial term in I {\displaystyle I} can be factored from each monomial in f {\displaystyle f} . Hence f {\displaystyle f} is of the form f = c 1 m 1 + c 2 m 2 + + c k m k {\displaystyle f=c_{1}m_{1}+c_{2}m_{2}+\dotsm +c_{k}m_{k}} for some c i K [ x 1 , x 2 , , x n ] {\displaystyle c_{i}\in \mathbb {K} } , as a result f I {\displaystyle f\in I} .

The following illustrates an example of monomial and polynomial ideals.

Let I = ( x y z , y 2 ) {\displaystyle I=(xyz,y^{2})} then the polynomial x 2 y z + 3 x y 2 {\displaystyle x^{2}yz+3xy^{2}} is in I, since each term is a multiple of an element in J, i.e., they can be rewritten as x 2 y z = x ( x y z ) {\displaystyle x^{2}yz=x(xyz)} and 3 x y 2 = 3 x ( y 2 ) , {\displaystyle 3xy^{2}=3x(y^{2}),} both in I. However, if J = ( x z 2 , y 2 ) {\displaystyle J=(xz^{2},y^{2})} , then this polynomial x 2 y z + 3 x y 2 {\displaystyle x^{2}yz+3xy^{2}} is not in J, since its terms are not multiples of elements in J.

Monomial ideals and Young diagrams

Bivariate monomial ideals can be interpreted as Young diagrams.

Let I {\displaystyle I} be a monomial ideal in I k [ x , y ] , {\displaystyle I\subset k,} where k {\displaystyle k} is a field. The ideal I {\displaystyle I} has a unique minimal generating set of I {\displaystyle I} of the form { x a 1 y b 1 , x a 2 y b 2 , , x a k y b k } {\displaystyle \{x^{a_{1}}y^{b_{1}},x^{a_{2}}y^{b_{2}},\ldots ,x^{a_{k}}y^{b_{k}}\}} , where a 1 > a 2 > > a k 0 {\displaystyle a_{1}>a_{2}>\dotsm >a_{k}\geq 0} and b k > > b 2 > b 1 0 {\displaystyle b_{k}>\dotsm >b_{2}>b_{1}\geq 0} . The monomials in I {\displaystyle I} are those monomials x a y b {\displaystyle x^{a}y^{b}} such that there exists i {\displaystyle i} such a i a {\displaystyle a_{i}\leq a} and b i b . {\displaystyle b_{i}\leq b.} If a monomial x a y b {\displaystyle x^{a}y^{b}} is represented by the point ( a , b ) {\displaystyle (a,b)} in the plane, the figure formed by the monomials in I {\displaystyle I} is often called the staircase of I , {\displaystyle I,} because of its shape. In this figure, the minimal generators form the inner corners of a Young diagram.

The monomials not in I {\displaystyle I} lie below the staircase, and form a vector space basis of the quotient ring k [ x , y ] / I {\displaystyle k/I} .

For example, consider the monomial ideal I = ( x 3 , x 2 y , y 3 ) k [ x , y ] . {\displaystyle I=(x^{3},x^{2}y,y^{3})\subset k.} The set of grid points S = { ( 3 , 0 ) , ( 2 , 1 ) , ( 0 , 3 ) } {\displaystyle S={\{(3,0),(2,1),(0,3)}\}} corresponds to the minimal monomial generators x 3 y 0 , x 2 y 1 , x 0 y 3 . {\displaystyle x^{3}y^{0},x^{2}y^{1},x^{0}y^{3}.} Then as the figure shows, the pink Young diagram consists of the monomials that are not in I {\displaystyle I} . The points in the inner corners of the Young diagram, allow us to identify the minimal monomials x 0 y 3 , x 2 y 1 , x 3 y 0 {\displaystyle x^{0}y^{3},x^{2}y^{1},x^{3}y^{0}} in I {\displaystyle I} as seen in the green boxes. Hence, I = ( y 3 , x 2 y , x 3 ) {\displaystyle I=(y^{3},x^{2}y,x^{3})} .

A Young diagram and its connection with its monomial ideal.

In general, to any set of grid points, we can associate a Young diagram, so that the monomial ideal is constructed by determining the inner corners that make up the staircase diagram; likewise, given a monomial ideal, we can make up the Young diagram by looking at the ( a i , b j ) {\displaystyle (a_{i},b_{j})} and representing them as the inner corners of the Young diagram. The coordinates of the inner corners would represent the powers of the minimal monomials in I {\displaystyle I} . Thus, monomial ideals can be described by Young diagrams of partitions.

Moreover, the ( C ) 2 {\displaystyle (\mathbb {C} ^{*})^{2}} -action on the set of I C [ x , y ] {\displaystyle I\subset \mathbb {C} } such that dim C C [ x , y ] / I = n {\displaystyle \dim _{\mathbb {C} }\mathbb {C} /I=n} as a vector space over C {\displaystyle \mathbb {C} } has fixed points corresponding to monomial ideals only, which correspond to integer partitions of size n, which are identified by Young diagrams with n boxes.

Monomial orderings and Gröbner bases

A monomial ordering is a well ordering {\displaystyle \geq } on the set of monomials such that if a , m 1 , m 2 {\displaystyle a,m_{1},m_{2}} are monomials, then a m 1 a m 2 {\displaystyle am_{1}\geq am_{2}} .

By the monomial order, we can state the following definitions for a polynomial in K [ x 1 , x 2 , , x n ] {\displaystyle \mathbb {K} } .

Definition

  1. Consider an ideal I K [ x 1 , x 2 , , x n ] {\displaystyle I\subset \mathbb {K} } , and a fixed monomial ordering. The leading term of a nonzero polynomial f K [ x 1 , x 2 , , x n ] {\displaystyle f\in \mathbb {K} } , denoted by L T ( f ) {\displaystyle LT(f)} is the monomial term of maximal order in f {\displaystyle f} and the leading term of f = 0 {\displaystyle f=0} is 0 {\displaystyle 0} .
  2. The ideal of leading terms, denoted by L T ( I ) {\displaystyle LT(I)} , is the ideal generated by the leading terms of every element in the ideal, that is, L T ( I ) = ( L T ( f ) f I ) {\displaystyle LT(I)=(LT(f)\mid f\in I)} .
  3. A Gröbner basis for an ideal I K [ x 1 , x 2 , , x n ] {\displaystyle I\subset \mathbb {K} } is a finite set of generators { g 1 , g 2 , , g s } {\displaystyle {\{g_{1},g_{2},\dotsc ,g_{s}}\}} for I {\displaystyle I} whose leading terms generate the ideal of all the leading terms in I {\displaystyle I} , i.e., I = ( g 1 , g 2 , , g s ) {\displaystyle I=(g_{1},g_{2},\dotsc ,g_{s})} and L T ( I ) = ( L T ( g 1 ) , L T ( g 2 ) , , L T ( g s ) ) {\displaystyle LT(I)=(LT(g_{1}),LT(g_{2}),\dotsc ,LT(g_{s}))} .

Note that L T ( I ) {\displaystyle LT(I)} in general depends on the ordering used; for example, if we choose the lexicographical order on R [ x , y ] {\displaystyle \mathbb {R} } subject to x > y, then L T ( 2 x 3 y + 9 x y 5 + 19 ) = 2 x 3 y {\displaystyle LT(2x^{3}y+9xy^{5}+19)=2x^{3}y} , but if we take y > x then L T ( 2 x 3 y + 9 x y 5 + 19 ) = 9 x y 5 {\displaystyle LT(2x^{3}y+9xy^{5}+19)=9xy^{5}} .

In addition, monomials are present on Gröbner basis and to define the division algorithm for polynomials in several indeterminates.

Notice that for a monomial ideal I = ( g 1 , g 2 , , g s ) F [ x 1 , x 2 , , x n ] {\displaystyle I=(g_{1},g_{2},\dotsc ,g_{s})\in \mathbb {F} } , the finite set of generators { g 1 , g 2 , , g s } {\displaystyle {\{g_{1},g_{2},\dotsc ,g_{s}}\}} is a Gröbner basis for I {\displaystyle I} . To see this, note that any polynomial f I {\displaystyle f\in I} can be expressed as f = a 1 g 1 + a 2 g 2 + + a s g s {\displaystyle f=a_{1}g_{1}+a_{2}g_{2}+\dotsm +a_{s}g_{s}} for a i F [ x 1 , x 2 , , x n ] {\displaystyle a_{i}\in \mathbb {F} } . Then the leading term of f {\displaystyle f} is a multiple for some g i {\displaystyle g_{i}} . As a result, L T ( I ) {\displaystyle LT(I)} is generated by the g i {\displaystyle g_{i}} likewise.

See also

Footnotes

  1. ^ Dummit & Foote 2004
  2. Miller & Sturmfels 2005

References

Further reading

Categories: