Groebner - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Algebra : Polynomials : Groebner : Groebner/NormalForm

Groebner

  

NormalForm

  

normal form of a polynomial modulo an ideal

  

Reduce

  

full reduction of a polynomial

 

Calling Sequence

Parameters

Description

Examples

References

Calling Sequence

NormalForm(f, G, T, Q, characteristic=p)

Reduce(f, G, T, s, Q, characteristic=p)

Parameters

f

-

a polynomial or a list or set of polynomials

G

-

a list of polynomials or a PolynomialIdeal

T

-

a MonomialOrder or ShortMonomialOrder

Q

-

(optional) name - assigned quotients

p

-

(optional) characteristic

s

-

(optional) name - assigned denominator

Description

• 

The NormalForm command computes the remainder of a multivariate polynomial f divided by a list of multivariate polynomials G.  The division takes place with respect to a monomial order T.  If G is a Groebner basis with respect to T then the result is a canonical representative for the equivalence class of f modulo G. A list of quotients can be assigned to an optional fourth argument Q.

• 

The Reduce command is similar to NormalForm, except that denominators are cleared and content is removed. The result is a scaled remainder r, denominator s, and quotients Q such that rs=fi=1nQiGi where r/s is the normal form. Note that NormalForm and Reduce return the same quotients Q (they are not scaled by s).

• 

If the first argument is a list or set then a sparse algorithm based on linear algebra is used to divide all the polynomials simultaneously.  This is more efficient than mapping NormalForm or Reduce over the list or set.  It is also more efficient when a lot of reduction steps are expected (the polynomials involved have high degree or many terms).  The sparse algorithm does not compute quotients. Setting infolevel[F4] to either 4 or 5 will output information about the size of the linear system being solved.

• 

If T is a ShortMonomialOrder then the elements of f and G must be polynomials in the ring implied by T.  If T is a MonomialOrder created with the Groebner[MonomialOrder] command, then the elements of f and G must be members of the algebra used to define T.  If G is a PolynomialIdeal, a Groebner basis with respect to T is computed automatically and used for the division.

• 

The optional argument characteristic=p can be used to specify the ring characteristic when G is a list of polynomials and T is a ShortMonomialOrder.  The default value is zero.

• 

Note that the normalf and reduce commands have been superseded by NormalForm and Reduce. They are now deprecated, and may not be supported in a future Maple release.

Examples

withGroebner:

Fx22xz+5,xy2+yz3,3y28z3

F:=x22xz+5,yz3+xy2,8z3+3y2

(1)

GBasisF,tdegx,y,z

G:=x22xz+5,8z33y2,8xy2+3y3,9y4+48y3z+320y2

(2)

p320xy2+9xy496z2y4x+1600y318y5xz592xzy3+45y5+240zy4

p:=18xy5z96xy4z2+9xy4592xy3z+45y5+240y4z+320xy2+1600y3

(3)

NormalFormp,G,tdegx,y,z,'Q'

0

(4)

Q

0,0,94y3z12z2y2+98y274zy+40,34zy2+378y

(5)

rpaddQiGi,i=1..nopsG

r:=18y5xz96z2y4x+9xy4592xzy3+45y5+240zy4+320xy2+1600y394y3z12z2y2+98y274zy+408xy2+3y334zy2+378y9y4+48y3z+320y2

(6)

expandr

0

(7)

q3x3yz2xz2+y3+yz

q:=3x3yz2xz2+y3+yz

(8)

NormalFormq,G,tdegx,y,z

9y3z215yz2xxz2414y3+60zy2+zy

(9)

Reduceq,G,tdegx,y,z,'s'

36y3z260xyz24xz241y3+240y2z+4yz

(10)

s

4

(11)

infolevelF45:

NormalFormp,q,G,tdegx,y,z

 19 x 19 with 2 rhs
 symbolic preproc       0.000 sec
 linear solve           0.000 sec
 build result           0.000 sec

0,9y3z215yz2xxz2414y3+60zy2+zy

(12)

The next example is a non-commutative (Weyl) algebra where Dn*n = n*Dn + 1

withOre_algebra:

Adiff_algebraDn,n

A:=Ore_algebra

(13)

TMonomialOrderA,tdegDn

T:=monomial_order

(14)

w17nDn+1

w1:=7Dnn+1

(15)

w25Dn2

w2:=5Dn2

(16)

Reduceskew_productn5Dn41,w1,A,w1,T

0

(17)

wskew_productskew_productnDn+5,w1,A,skew_productn3Dn2,w2,A,A+Dn51

w:=35n5Dn5+14n5+425n4Dn4+170n4+880n3Dn3352n3Dn2+Dn51

(18)

Reducew,w1,w2,T,'s'

1

(19)

s

16807n5225008n6+16807n5+76560

(20)

rNormalFormw,w1,w2,T,'Q'

r:=116807225008n616807n576560n5

(21)

Q

5Dn4n42Dn3n4+40n3Dn318n3Dn2+17Dn4n827n2Dn2949Dn3n2+65649n+638343Dn2n395702401Dnn4+7656016807n5,0

(22)

normalwskew_productQ1,w1,A+skew_productQ2,w2,A,expanded

116807225008n616807n576560n5

(23)

References

  

Cox, D.; Little, J.; and O'Shea, D. Ideals, Varieties, and Algorithms. 2nd ed. Springer-Verlag, 1997.

  

Pearce, R., and Monagan, M. "A Sparse Algorithm for Polynomial Division with Application to F4." In preparation, 2006.

See Also

Basis

InterReduce

MonomialOrder

 


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam