|
|
|
|
|
Grbner BasisIn computer algebra and computational algebraic geometry, a Grbner basis (named after Wolfgang Grbner) is a particular kind of generating subset of an ideal I in a polynomial ring. It is characterised by the property that the ideal given by the leading terms of polynomials in I is itself generated by the leading terms of the basis. This criterion is stated relative to some monomial order. It is a significant fact of commutative algebra that such generating subsets exist, and can be effectively obtained starting with any generating subset. The basis depends on the monomial ordering chosen, and different orderings can give rise to radically different Grbner bases. Two of the most commonly used orderings are lexicographic ordering, and degree lexicographic, a variant on lexicographic ordering where monomials are sorted first by degree, then by lexicographic ordering when two monomials are of the same degree. In most cases (polynomials in finitely many variables with complex coefficients (more generally coefficients over any field), for example), Grbner bases exist for any monomial ordering. One method for generating them is known as Buchberger's algorithm. A Grbner basis is termed reduced if the leading coefficient of each element of the basis is 1 and no monomial in any element of the basis is in the ideal generated by the leading coefficients of the other elements of the basis. Both standard and reduced Grbner bases are often computable in practice. Properties and applications of Grbner bases Deciding equality of ideals Reduced Grbner bases can be shown to be unique for any given ideal and monomial ordering, and are also often computable in practice. Thus one can determine if two ideals are equal by looking at their reduced Grbner bases. Deciding membership of ideals The reduction of a polynomial f by the multivariate division algorithm for an ideal using a Grbner basis will yield 0 if and only if f is in the ideal. (This is not true in general for polynomials in more than one variable). This gives a test for determining whether or not a polynomial is in an ideal with a given set of generators. Elimination property If a Grbner basis for an ideal I in - kx2, ..., xn
is computed relative to the lexicographic ordering with - x1 > x2 > ... > xn,
the intersection of I with - kxk+1, ..., xn
is given by the intersection of the Grbner basis with - kxk'+1, ..., xn.
In particular a polynomial f lies in - kxk+1, ..., xn,
if and only if its leading term lies in this subring. This is known as the elimination property Solving equations In particular, this gives us a method for solving simultaneous polynomial equations. If there are only finitely many solutions to the system of equations - {f1..., xn = a1, ..., fm..., xn = an},
we should be able to manipulate these equations to get something of the form - g(xn) = b.
The elimination property says that if we compute a Grbner basis for the ideal generated by {f1 − a1, ..., fm − am} relative to the right lexicographic ordering, then we can find the polynomial g as one of the elements of our basis. Furthermore, (taking k = n − 1) there will be another polynomial in the basis involving only xn−1 and xn, so we can take our possible solutions for xn and find corresponding values for xn−1. This lifting continues all the way up until we've found the values of all the variables. The same elimination property can almost be used to convert parametric equations of polynomials into nonparametric equations. Given the equations - {x1 = f1(t1, ..., tm), ..., xn = fn(t1, ..., tm)},
we compute a Grbner basis for the ideal generated by - {x1 − f1, ..., xn − fn}
relative to any ordering which places polynomials involving t greater than those which don't: for example, lexicographic ordering with - t1 > t2 > ... > tm > x1 > ... > xn.
Taking only the elements of the basis which do not involve the t variables, we get a set of equations describing not the original surface, but the smallest affine variety containing it. Intersecting ideals - {f1, ..., fm}
and J is generated by some - {g1, ..., gk},
then the intersection of I and J can be found by taking a Grbner basis for the ideal generated by - {tf1, ..., tfm, (1 − t)g1, ..., (1 − t)gk}
relative to any lexicographic ordering which places t first, then taking only those terms not involving t. In particular, this allows us to calculate the least common multiple (and hence the greatest common divisor) of two polynomials f and g, since it is the generator of the intersection of the ideals generated by f and by g. This is true even if we do not know how to factor the polynomials! Also note, that for more than one variable the polynomial ring is no euclidian domain, so the Euclidian algorithm doesn't work here. External link
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|