>
|
|
>
|
|
>
|
|
First, define a polynomial ring.
>
|
|
Use Triangularize to solve the polynomial equations given by and below.
>
|
|
| (2) |
>
|
|
| (4) |
>
|
|
| (5) |
Now remove points which cancel the following .
First, build the common solution set of and as a constructible set and also build one with .
>
|
|
>
|
|
| (8) |
>
|
|
| (9) |
Then use Difference to find a new constructible set which encodes those points that cancel and , but do not cancel .
>
|
|
| (10) |
You can check the result using the Info command: cs2 consists of six points, and five of them cancel .
| (11) |
The set cs3 consists of a single point which does not cancel .
An example on semi-algebraic set difference: to check whether or not two formula/conditions are equivalent. # Semi-algebraic Difference, verifying results
>
|
|
>
|
|
| (13) |
>
|
|
| (14) |
>
|
|
>
|
|
| (15) |
>
|
|
| (16) |
Verify dec1 = dec2 as set of points by Difference.
>
|
|
>
|
|