]>
Book Contents Previous Section 9.39 LexTriangularPackage Next Section 9.41 Library Book Index

## 9.40 LazardSetSolvingPackage

The LazardSetSolvingPackage package constructor solves polynomial systems by means of Lazard triangular sets. However one condition is relaxed: Regular triangular sets whose saturated ideals have positive dimension are not necessarily normalized.

The decompositions are computed in two steps. First the algorithm of Moreno Maza (implemented in the RegularTriangularSet domain constructor) is called. Then the resulting decompositions are converted into lists of square-free regular triangular sets and the redundant components are removed. Moreover, zero-dimensional regular triangular sets are normalized.

Note that the way of understanding triangular decompositions is detailed in the example of the RegularTriangularSet constructor.

The LazardSetSolvingPackage constructor takes six arguments. The first one, R, is the coefficient ring of the polynomials; it must belong to the category GcdDomain. The second one, E, is the exponent monoid of the polynomials; it must belong to the category OrderedAbelianMonoidSup. the third one, V, is the ordered set of variables; it must belong to the category OrderedSet. The fourth one is the polynomial ring; it must belong to the category RecursivePolynomialCategory(R,E,V). The fifth one is a domain of the category RegularTriangularSetCategory(R,E,V,P) and the last one is a domain of the category SquareFreeRegularTriangularSetCategory(R,E,V,P). The abbreviation for LazardSetSolvingPackage is LAZM3PK.

N.B. For the purpose of solving zero-dimensional algebraic systems, see also LexTriangularPackage and ZeroDimensionalSolvePackage. These packages are easier to call than LAZM3PK. Moreover, the ZeroDimensionalSolvePackage package provides operations to compute either the complex roots or the real roots.

We illustrate now the use of the LazardSetSolvingPackage package constructor with two examples (Butcher and Vermeer).

Define the coefficient ring.

R := Integer

Integer

Type: Domain

Define the list of variables,

ls : List Symbol := [b1,x,y,z,t,v,u,w]

[b1,x,y,z,t,v,u,w]

Type: List Symbol

and make it an ordered set:

V := OVAR(ls)

OrderedVariableList[b1,x,y,z,t,v,u,w]

Type: Domain

then define the exponent monoid.

E := IndexedExponents V

IndexedExponentsOrderedVariableList[b1,x,y,z,t,v,u,w]

Type: Domain

Define the polynomial ring.

P := NSMP(R, V)

NewSparseMultivariatePolynomial(Integer, OrderedVariableList[b1,x,y,z,t,v,u,w])

Type: Domain

Let the variables be polynomial.

b1: P := 'b1

b1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
x: P := 'x

x

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
y: P := 'y

y

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
z: P := 'z

z

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
t: P := 't

t

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
u: P := 'u

u

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
v: P := 'v

v

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
w: P := 'w

w

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])

Now call the RegularTriangularSet domain constructor.

T := REGSET(R,E,V,P)

RegularTriangularSet(Integer, IndexedExponentsOrderedVariableList[b1,x,y,z,t,v,u,w], OrderedVariableList[b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList[b1,x,y,z,t,v,u,w]))

Type: Domain

Define a polynomial system (the Butcher example).

p0 := b1 + y + z - t - w

b1+y+z-t-w

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p1 := 2*z*u + 2*y*v + 2*t*w - 2*w**2 - w - 1

2 v y+2 u z+2 w t-2 w 2-w-1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p2 := 3*z*u**2 + 3*y*v**2 - 3*t*w**2 + 3*w**3 + 3*w**2 - t + 4*w

3 v 2 y+3 u 2 z+(-3 w 2-1)t+3 w 3+3 w 2+4 w

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p3 := 6*x*z*v - 6*t*w**2 + 6*w**3 - 3*t*w + 6*w**2 - t + 4*w

6 v z x+(-6 w 2-3 w-1)t+6 w 3+6 w 2+4 w

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p4 := 4*z*u**3+ 4*y*v**3+ 4*t*w**3- 4*w**4 - 6*w**3+ 4*t*w- 10*w**2- w- 1

4 v 3 y+4 u 3 z+(4 w 3+4 w)t-4 w 4-6 w 3-10 w 2-w-1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p5 := 8*x*z*u*v +8*t*w**3 -8*w**4 +4*t*w**2 -12*w**3 +4*t*w -14*w**2 -3*w -1

8 u v z x+(8 w 3+4 w 2+4 w)t-8 w 4-12 w 3-14 w 2-3 w-1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p6 := 12*x*z*v**2+12*t*w**3 -12*w**4 +12*t*w**2 -18*w**3 +8*t*w -14*w**2 -w -1

12 v 2 z x+(12 w 3+12 w 2+8 w)t-12 w 4-18 w 3-14 w 2-w-1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
p7 := -24*t*w**3 + 24*w**4 - 24*t*w**2 + 36*w**3 - 8*t*w + 26*w**2 + 7*w + 1

(-24 w 3-24 w 2-8 w)t+24 w 4+36 w 3+26 w 2+7 w+1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
lp := [p0, p1, p2, p3, p4, p5, p6, p7]

[b1+y+z-t-w,2 v y+2 u z+2 w t-2 w 2-w-1,3 v 2 y+3 u 2 z+(-3 w 2-1)t+3 w 3+3 w 2+4 w,6 v z x+(-6 w 2-3 w-1)t+6 w 3+6 w 2+4 w,4 v 3 y+4 u 3 z+(4 w 3+4 w)t-4 w 4-6 w 3-10 w 2-w-1,8 u v z x+(8 w 3+4 w 2+4 w)t-8 w 4-12 w 3-14 w 2-3 w-1,12 v 2 z x+(12 w 3+12 w 2+8 w)t-12 w 4-18 w 3-14 w 2-w-1,(-24 w 3-24 w 2-8 w)t+24 w 4+36 w 3+26 w 2+7 w+1]

Type: List NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])

First of all, let us solve this system in the sense of Lazard by means of the REGSET constructor:

lts := zeroSetSplit(lp,false)$T

[{w+1,u,v,t+1,b1+y+z+2},{w+1,v,t+1,z,b1+y+2},{w+1,t+1,z,y,b1+2},{w+1,v-u,t+1,y+z,x,b1+2},{w+1,u,t+1,y,x,b1+z+2},{144 w 5+216 w 4+96 w 3+6 w 2-11 w-1,(12 w 2+9 w+1)u-72 w 5-108 w 4-42 w 3-9 w 2-3 w,(12 w 2+9 w+1)v+36 w 4+54 w 3+18 w 2,(24 w 3+24 w 2+8 w)t-24 w 4-36 w 3-26 w 2-7 w-1,(12 u v-12 u 2)z+(12 w v+12 w 2+4)t+(3 w-5)v+36 w 4+42 w 3+6 w 2-16 w,2 v y+2 u z+2 w t-2 w 2-w-1,6 v z x+(-6 w 2-3 w-1)t+6 w 3+6 w 2+4 w,b1+y+z-t-w}]

Type: List RegularTriangularSet(Integer, IndexedExponents OrderedVariableList [b1,x,y,z,t,v,u,w], OrderedVariableList [b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial( Integer,OrderedVariableList [b1,x,y,z,t,v,u,w]))

We can get the dimensions of each component of a decomposition as follows.

[coHeight(ts) for ts in lts]

[3,3,3,2,2,0]

Type: List NonNegativeInteger

The first five sets have a simple shape. However, the last one, which has dimension zero, can be simplified by using Lazard triangular sets.

Thus we call the SquareFreeRegularTriangularSet domain constructor,

ST := SREGSET(R,E,V,P)

SquareFreeRegularTriangularSet(Integer, IndexedExponentsOrderedVariableList[b1,x,y,z,t,v,u,w], OrderedVariableList[b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList[b1,x,y,z,t,v,u,w]))

Type: Domain

and set the LAZM3PK package constructor to our situation.

pack := LAZM3PK(R,E,V,P,T,ST)

LazardSetSolvingPackage(Integer, IndexedExponentsOrderedVariableList[b1,x,y,z,t,v,u,w], OrderedVariableList[b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList[b1,x,y,z,t,v,u,w]), RegularTriangularSet(Integer, IndexedExponentsOrderedVariableList[b1,x,y,z,t,v,u,w], OrderedVariableList[b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList[b1,x,y,z,t,v,u,w])), SquareFreeRegularTriangularSet(Integer, IndexedExponentsOrderedVariableList[b1,x,y,z,t,v,u,w], OrderedVariableList[b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList[b1,x,y,z,t,v,u,w])))

Type: Domain

We are ready to solve the system by means of Lazard triangular sets:

zeroSetSplit(lp,false)$pack

[{w+1,t+1,z,y,b1+2},{w+1,v,t+1,z,b1+y+2},{w+1,u,v,t+1,b1+y+z+2},{w+1,v-u,t+1,y+z,x,b1+2},{w+1,u,t+1,y,x,b1+z+2},{144 w 5+216 w 4+96 w 3+6 w 2-11 w-1,u-24 w 4-36 w 3-14 w 2+w+1,3 v-48 w 4-60 w 3-10 w 2+8 w+2,t-24 w 4-36 w 3-14 w 2-w+1,486 z-2772 w 4-4662 w 3-2055 w 2+30 w+127,2916 y-22752 w 4-30312 w 3-8220 w 2+2064 w+1561,356 x-3696 w 4-4536 w 3-968 w 2+822 w+371,2916 b1-30600 w 4-46692 w 3-20274 w 2-8076 w+593}]

Type: List SquareFreeRegularTriangularSet(Integer, IndexedExponents OrderedVariableList [b1,x,y,z,t,v,u,w], OrderedVariableList [b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList [b1,x,y,z,t,v,u,w]))

We see the sixth triangular set is nicer now: each one of its polynomials has a constant initial.

We follow with the Vermeer example. The ordering is the usual one for this system.

Define the polynomial system.

f0 := (w - v) ** 2 + (u - t) ** 2 - 1

t 2-2 u t+v 2-2 w v+u 2+w 2-1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
f1 := t ** 2 - v ** 3

t 2-v 3

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
f2 := 2 * t * (w - v) + 3 * v ** 2 * (u - t)

(-3 v 2-2 v+2 w)t+3 u v 2

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
f3 := (3 * z * v ** 2 - 1) * (2 * z * t - 1)

6 v 2 t z 2+(-2 t-3 v 2)z+1

Type: NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])
lf := [f0, f1, f2, f3]

[t 2-2 u t+v 2-2 w v+u 2+w 2-1,t 2-v 3,(-3 v 2-2 v+2 w)t+3 u v 2,6 v 2 t z 2+(-2 t-3 v 2)z+1]

Type: List NewSparseMultivariatePolynomial(Integer,OrderedVariableList [b1,x,y,z,t,v,u,w])

First of all, let us solve this system in the sense of Kalkbrener by means of the REGSET constructor:

zeroSetSplit(lf,true)$T

[{729 u 6+(-1458 w 3+729 w 2-4158 w-1685)u 4+(729 w 6-1458 w 5-2619 w 4-4892 w 3-297 w 2+5814 w+427)u 2+729 w 8+216 w 7-2900 w 6-2376 w 5+3870 w 4+4072 w 3-1188 w 2-1656 w+529,(2187 u 4+(-4374 w 3-972 w 2-12474 w-2868)u 2+2187 w 6-1944 w 5-10125 w 4-4800 w 3+2501 w 2+4968 w-1587)v+(1944 w 3-108 w 2)u 2+972 w 6+3024 w 5-1080 w 4+496 w 3+1116 w 2,(3 v 2+2 v-2 w)t-3 u v 2,((4 v-4 w)t-6 u v 2)z 2+(2 t+3 v 2)z-1}]

Type: List RegularTriangularSet(Integer, IndexedExponents OrderedVariableList [b1,x,y,z,t,v,u,w], OrderedVariableList [b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList [b1,x,y,z,t,v,u,w]))

We have obtained one regular chain (i.e. regular triangular set) with dimension 1. This set is in fact a characterist set of the (radical of) of the ideal generated by the input system lf. Thus we have only the generic points of the variety associated with lf (for the elimination ordering given by ls).

So let us get now a full description of this variety.

Hence, we solve this system in the sense of Lazard by means of the REGSET constructor:

zeroSetSplit(lf,false)$T

[{729 u 6+(-1458 w 3+729 w 2-4158 w-1685)u 4+(729 w 6-1458 w 5-2619 w 4-4892 w 3-297 w 2+5814 w+427)u 2+729 w 8+216 w 7-2900 w 6-2376 w 5+3870 w 4+4072 w 3-1188 w 2-1656 w+529,(2187 u 4+(-4374 w 3-972 w 2-12474 w-2868)u 2+2187 w 6-1944 w 5-10125 w 4-4800 w 3+2501 w 2+4968 w-1587)v+(1944 w 3-108 w 2)u 2+972 w 6+3024 w 5-1080 w 4+496 w 3+1116 w 2,(3 v 2+2 v-2 w)t-3 u v 2,((4 v-4 w)t-6 u v 2)z 2+(2 t+3 v 2)z-1},{27 w 4+4 w 3-54 w 2-36 w+23,u,(12 w+2)v-9 w 2-2 w+9,6 t 2-2 v-3 w 2+2 w+3,2 t z-1},{59049 w 6+91854 w 5-45198 w 4+145152 w 3+63549 w 2+60922 w+21420,(31484448266904 w 5-18316865522574 w 4+23676995746098 w 3+6657857188965 w 2+8904703998546 w+3890631403260)u 2+94262810316408 w 5-82887296576616 w 4+89801831438784 w 3+28141734167208 w 2+38070359425432 w+16003865949120,(243 w 2+36 w+85)v 2+(-81 u 2-162 w 3+36 w 2+154 w+72)v-72 w 3+4 w 2,(3 v 2+2 v-2 w)t-3 u v 2,((4 v-4 w)t-6 u v 2)z 2+(2 t+3 v 2)z-1},{27 w 4+4 w 3-54 w 2-36 w+23,u,(12 w+2)v-9 w 2-2 w+9,6 t 2-2 v-3 w 2+2 w+3,3 v 2 z-1}]

Type: List RegularTriangularSet(Integer, IndexedExponents OrderedVariableList [b1,x,y,z,t,v,u,w], OrderedVariableList [b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList [b1,x,y,z,t,v,u,w]))

We retrieve our regular chain of dimension 1 and we get three regular chains of dimension 0 corresponding to the degenerated cases. We want now to simplify these zero-dimensional regular chains by using Lazard triangular sets. Moreover, this will allow us to prove that the above decomposition has no redundant component. N.B. Generally, decompositions computed by the REGSET constructor do not have redundant components. However, to be sure that no redundant component occurs one needs to use the SREGSET or LAZM3PK constructors.

So let us solve the input system in the sense of Lazard by means of the LAZM3PK constructor:

zeroSetSplit(lf,false)$pack

[{729 u 6+(-1458 w 3+729 w 2-4158 w-1685)u 4+(729 w 6-1458 w 5-2619 w 4-4892 w 3-297 w 2+5814 w+427)u 2+729 w 8+216 w 7-2900 w 6-2376 w 5+3870 w 4+4072 w 3-1188 w 2-1656 w+529,(2187 u 4+(-4374 w 3-972 w 2-12474 w-2868)u 2+2187 w 6-1944 w 5-10125 w 4-4800 w 3+2501 w 2+4968 w-1587)v+(1944 w 3-108 w 2)u 2+972 w 6+3024 w 5-1080 w 4+496 w 3+1116 w 2,(3 v 2+2 v-2 w)t-3 u v 2,((4 v-4 w)t-6 u v 2)z 2+(2 t+3 v 2)z-1},{81 w 2+18 w+28,729 u 2-1890 w-533,81 v 2+(-162 w+27)v-72 w-112,11881 t+(972 w+2997)u v+(-11448 w-11536)u,641237934604288 z 2+(((78614584763904 w+26785578742272)u+236143618655616 w+70221988585728)v+(358520253138432 w+101922133759488)u+142598803536000 w+54166419595008)z+(32655103844499 w-44224572465882)u v+(43213900115457 w-32432039102070)u},{27 w 4+4 w 3-54 w 2-36 w+23,u,218 v-162 w 3+3 w 2+160 w+153,109 t 2-27 w 3-54 w 2+63 w+80,1744 z+(-1458 w 3+27 w 2+1440 w+505)t},{27 w 4+4 w 3-54 w 2-36 w+23,u,218 v-162 w 3+3 w 2+160 w+153,109 t 2-27 w 3-54 w 2+63 w+80,1308 z+162 w 3-3 w 2-814 w-153},{729 w 4+972 w 3-1026 w 2+1684 w+765,81 u 2+72 w 2+16 w-72,702 v-162 w 3-225 w 2+40 w-99,11336 t+(324 w 3-603 w 2-1718 w-1557)u,595003968 z 2+((-963325386 w 3-898607682 w 2+1516286466 w-3239166186)u-1579048992 w 3-1796454288 w 2+2428328160 w-4368495024)z+(9713133306 w 3+9678670317 w 2-16726834476 w+28144233593)u}]

Type: List SquareFreeRegularTriangularSet(Integer, IndexedExponents OrderedVariableList [b1,x,y,z,t,v,u,w], OrderedVariableList [b1,x,y,z,t,v,u,w], NewSparseMultivariatePolynomial(Integer, OrderedVariableList [b1,x,y,z,t,v,u,w]))

Due to square-free factorization, we obtained now four zero-dimensional regular chains. Moreover, each of them is normalized (the initials are constant). Note that these zero-dimensional components may be investigated further with the ZeroDimensionalSolvePackage package constructor.

Book Contents Previous Section 9.39 LexTriangularPackage Next Section 9.41 Library Book Index