RegularChains[Intersect] - compute the common solutions of a polynomial and a regular chain
Intersect(f, rc, R)
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 .
Define a ring of polynomials.
Define a set of equations.
Define the empty regular chain.
Solve the first equation.
Solve the first and second equations.
Solve the three equations together.
ConstructibleSetTools, GeneralConstruct, RegularChains, Triangularize
Moreno Maza, M. "On Triangular Decompositions of Algebraic Varieties." MEGA-2000 conference. Bath, UK, England.
Download Help Document