PolynomialIdeals[EliminationIdeal] - eliminate variables from an ideal (subring intersection)
|
Calling Sequence
|
|
EliminationIdeal(J, X)
|
|
Parameters
|
|
J
|
-
|
polynomial ideal
|
X
|
-
|
set of subring variable names
|
|
|
|
|
Description
|
|
•
|
The EliminationIdeal command eliminates variables from an ideal using a Groebner basis computation. The result of EliminationIdeal(J, X) is the intersection of the ideal J with the subring .
|
•
|
Note: You cannot use the Intersect command to compute this result. For any variables X, the polynomial ring is represented by the ideal , and Intersect(J, <1>) = J.
|
•
|
The EliminationIdeal command can be used to perform nonlinear elimination on a general set of relations. This is demonstrated below.
|
|
|
Examples
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
In this example, we use EliminationIdeal to derive trigonometric identities algebraically, starting from an ideal of known relations. The trigonometric functions are enclosed in backquotes to prevent Maple from recognizing them.
>
|
|
| (6) |
>
|
|
| (7) |
>
|
|
| (8) |
>
|
|
| (9) |
>
|
|
| (10) |
|
|
Download Help Document
Was this information helpful?