<< Chapter < Page Chapter >> Page >
x 7 > z 7 > x 2 y 2 z 2 > x 2 y z 3 > x y 5 > y 3 z 3 > y z 5 > x 5 > x 4 y > x 3 y 2 > x 3 y z > x 3 z 2 .

More formally, we say that x α > grlex x β if deg x α > deg x β or if deg x α = deg x β and x α > lex x β . Since the partial ordering by degree and the lexicographic ordering both have the property that

x α < x β x γ x α < x γ x β for all monomials x γ ,

the graded lexicographic order has this property as well. Since any graded order (an order in which degree is used first and then something else is used as a tie-breaker) satisfies well-ordering automatically (because there are only finitely many monomials of each degree), we see that grlex is a term order.

Example: Graded reverse lexicographic order

Perhaps one of the most frequently used term orders in practice (because it tends to result in faster computations) is graded reverse lexicographic or grevlex order. This one is perhaps a little more confusing. As the name suggests, graded reverse lexicographic order uses degree first, and uses “reverse lexicographic order” to break ties.

If we reverse the lexicographic order however, so that x α > revlex x β if x α < lex x β , the result isn't a monomial ordering. It fails well-ordering, because there are infinite descending sequences, e.g. in revlex order we have

1 > revlex z > revlex z 2 > revlex z 3 > revlex > revlex y z > revlex y z 2 > revlex y z 3 > revlex .

However, the reverse of an order preserved under multiplication by x γ is at least still preserved under multiplication by x γ , so while reverse lexicographic order isn't a monomial order by itself, we can still use it to break ties in a graded order (for which well-ordering is automatic).

There's one final issue to defining grevlex: when we reverse the lex order, it reverses the order of the variables, but we still want to get an order with x 1 > x 2 > > x n in the end. Thus we start with a lex order with x n > > x 1 , so that when we reverse it we get a reverse lexicographic order with x 1 > revlex x 2 > revlex > revlex x n . We then say that x α > grevlex x β if deg x α > deg x β or if deg x α = deg x β and x α > revlex x β .

For example, in the graded reverse lexicographic order on R [ x , y , z ] with x > y > z , we have

y 2 z 2 > x 3 > x y 2 > x y z > y 2 z > x z 2 > x 2 > x y > y 2 > x z > y z > z 2 > x .

Basically, we order by degree first, and break ties by saying a monomial is bigger if it has a smaller power of the least significant variable. More formally, we say that x α > x β if deg x α > deg x β or if deg x α = deg x β and in the vector difference α - β , the rightmost non-zero entry is negative.

Exercises

  1. In each part, determine whether the polynomial f R [ x ] is in the given ideal I R [ x ] . Notice that determining if f lies in the ideal g is equivalent to determining if g divides f . How do we use the same idea in (c) and (d), where I = g 1 , g 2 ?
    1. f ( x ) = x 2 - 3 x + 2 ,         I = x - 2
    2. f ( x ) = x 5 - 4 x + 1 ,         I = x 3 - x 2 + x
    3. f ( x ) = x 2 - 4 x + 4 ,         I = x 4 - 6 x 2 + 12 x - 8 , 2 x 3 - 10 x 2 + 16 x - 8
    4. f ( x ) = x 3 - 1 ,                I = x 9 - 1 , x 5 + x 3 - x 2 - 1
  2. Find an ideal I R [ x ] in which every element f I is divisible by x , but such that x I .
    1. Show that x - y 2 , x y , y 2 = x , y 2 .
    2. Is x - y 2 , x y = x 2 , x y ?
  3. Rewrite each of the following polynomials, ordering the terms first with the lex order, then the graded lex order, and finally the graded reverse lex order, provided that x > y > z .
    1. f ( x , y , z ) = 2 x + 3 y + z + x 2 - z 2 + x 3
    2. 2 x 2 y 8 - 3 x 5 y z 4 + x y z 3 - x y 4
    3. 7 x 2 y 4 z - 2 x y 6 + x 2 y 2
  4. Ideals make sense in the ring of integers Z just as they do in polynomial rings like R [ x ] . For example, in Z the ideal I = a , b consists of all integers x a + y b for x , y Z .
    1. Is 10 in the ideal I = 3 ?
    2. Is 2 in the ideal I = 5 , 8 ?
    3. Is - 6 in the ideal I = 12 , 22 ?
    4. Is 3 in the ideal I = 68 , 173 ?

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, The art of the pfug. OpenStax CNX. Jun 05, 2013 Download for free at http://cnx.org/content/col10523/1.34
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'The art of the pfug' conversation and receive update notifications?

Ask