RegularChains[ConstructibleSetTools][MakePairwiseDisjoint] - make the defining regular systems in a constructible set pairwise disjoint
|
Calling Sequence
|
|
MakePairwiseDisjoint(cs, R)
|
|
Parameters
|
|
cs
|
-
|
constructible set
|
R
|
-
|
polynomial ring
|
|
|
|
|
Description
|
|
•
|
The command MakePairwiseDisjoint(cs, R) returns a constructible set cs1 such that cs1 and cs are equal and the regular systems representing cs1 are pairwise disjoint.
|
•
|
Generally, in a constructible set, there is some redundancy among its components defined by regular systems. By default, functions on constructible sets do not remove redundancy because such a computation is expensive.
|
•
|
This command is part of the RegularChains[ConstructibleSetTools] package, so it can be used in the form MakePairwiseDisjoint(..) only after executing the command with(RegularChains[ConstructibleSetTools]). However, it can always be accessed through the long form of the command by using RegularChains[ConstructibleSetTools][MakePairwiseDisjoint](..).
|
|
|
Examples
|
|
>
|
|
>
|
|
First, define the polynomial ring.
>
|
|
| (1) |
Consider the following almost general linear equations. They are not completely general, since their constant term, namely , is the same.
>
|
|
| (2) |
>
|
|
| (3) |
After projecting the variety defined by and into the parameter space given by the last 5 variables, you can see when such general linear equations have solutions after specializing the last 5 variables.
>
|
|
| (4) |
>
|
|
| (5) |
>
|
|
| (6) |
>
|
|
| (7) |
There are 9 regular systems defining the image cs of the projection. To remove common parts of these regular systems, use MakePairwiseDisjoint.
>
|
|
| (8) |
>
|
|
| (9) |
>
|
|
| (10) |
Now, there are 10 components.
>
|
|
| (11) |
Notice that some components have split during the redundancy removal.
|
|
Download Help Document
Was this information helpful?