Intersect - Maple Help
For the best experience, we recommend viewing online help using Google Chrome or Microsoft Edge.
Our website is currently undergoing maintenance, which may result in occasional errors while browsing. We apologize for any inconvenience this may cause and are working swiftly to restore full functionality. Thank you for your patience.

Online Help

All Products    Maple    MapleSim


RegularChains

  

Intersect

  

compute the common solutions of a polynomial and a regular chain

 

Calling Sequence

Parameters

Description

Examples

References

Calling Sequence

Intersect(f, rc, R)

Parameters

f

-

polynomial

rc

-

regular chain

R

-

polynomial ring

Description

• 

The command Intersect(f, rc, R) computes the common solutions of the polynomial f and the regular chain rc in the following sense. Let V be the hypersurface defined by f, that is, the solutions of the equation f = 0 . Let W be the quasi-component of rc. Then Intersect(f, rc, R) returns regular chains such that the union of their quasi-components contains the intersection of V and W, and this union is contained in the intersection of V and the Zariski closure of W. See ConstructibleSetTools for a definition of a quasi-component.

• 

When the regular chain rc has dimension zero, Intersect(f, rc, R) computes exactly the intersection of V and W. This is also the case when W is a variety (that is a closed set for Zariski topology) or when rc has dimension one and f is regular w.r.t. the saturated ideal of rc. In all other cases, Intersect(f, rc, R) computes a superset of the intersection of V and W. However this superset is very close to this intersection.

• 

In summary and in broad terms, Intersect(f, rc, R) computes a sharp approximation of the intersection of V and W by means of regular chains.

• 

You can use the function Intersect to solve systems of equations incrementally, that is, one equation after the other. The example below illustrates this strategy.

• 

Another way of understanding the Intersect command is to observe that it specializes the solutions of rc with the constraint f = 0 .

Examples

withRegularChains:

withChainTools:

Define a ring of polynomials.

varsx,y,z:RPolynomialRingvars:

Define a set of equations.

sysx2+y+z1,x+y2+z1,x+y+z21

sysx2+y+z1,y2+x+z1,z2+x+y1

(1)

Define the empty regular chain.

rcEmptyR

rcregular_chain

(2)

Solve the first equation.

decIntersectsys1,rc,R;mapEquations,dec,R

decregular_chain

x2+y+z1

(3)

Solve the first and second equations.

decseqopIntersectsys2,rc,R,rc=dec;mapEquations,dec,R

decregular_chain,regular_chain

xy,y2+y+z1,x+y1,y2y+z

(4)

Solve the three equations together.

decseqopIntersectsys3,rc,R,rc=dec;mapEquations,dec,R

decregular_chain,regular_chain,regular_chain,regular_chain

xz,yz,z2+2z1,x,y,z1,x1,y,z,x,y1,z

(5)

References

  

Moreno Maza, M. "On Triangular Decompositions of Algebraic Varieties." MEGA-2000 conference. Bath, UK, England.

See Also

ConstructibleSetTools

GeneralConstruct

RegularChains

Triangularize