Introductory Examples:
>
|
|
>
|
|
>
|
|
>
|
|
>
|
|
The input may contain both radicals and RootOfs, and Resultant will embed the coefficients into an algebraic field, if possible:
>
|
|
>
|
|
| (7) |
>
|
|
| (8) |
Nested and mixed radicals and RootOfs are also supported:
>
|
|
>
|
|
The input must be a pair of polynomials in x. If the inputs are rational expressions in x, an error will be returned:
>
|
|
>
|
|
The coefficients may contain rational functions of arbitrary variables:
>
|
|
The input may contain polynomials disguised as rational functions, because they will be simplified by Normal:
>
|
|
Partial factorizations in the input will be preserved, if possible:
>
|
|
>
|
|
| (15) |
Non-algebraic sub-expressions such as will be frozen and treated as elements of the coefficient field:
>
|
|
However, whenever possible, such expressions will be converted to algebraic numbers (see ConvertRootOf):
>
|
|
A non-algebraic function can also be used for the x parameter, as long as it is not of type Algebraic Object:
>
|
|
>
|
|
The arguments of functions in the input will be recursively normalized (see Normal):
>
|
|
Non-algebraic functions in the input may become algebraic after recursive treatment:
>
|
|
All algebraic numbers will be reduced modulo their minimal polynomial (see Reduce):
>
|
|
| (21) |
>
|
|
| (22) |
The output will be fully normalized and rationalized:
>
|
|
>
|
|
Algebraic functions such as are not accepted:
>
|
|
Floats are not accepted.
>
|
|
When a non-indexed RootOf is given in the input, sometimes the resultant can still be computed:
>
|
|
>
|
|
| (26) |
In this case, Resultant must know whether without an index represents or in order to fully determine the resultant. Without an index, the result cannot be returned in a fully simplified form:
>
|
|
>
|
|
>
|
|
| (29) |
In this case, where the leading coefficient of the polynomial given within a RootOf is a zero divisor, it is impossible to compute the resultant and an error is returned:
>
|
|
To force Resultant to reduce this RootOf to one of lower degree by picking one of the substitutions arbitrarily, use option 'symbolic'=true.
>
|
|
Using option 'characteristic', the resultant can be computed over finite fields:
>
|
|
>
|
|
>
|
|
>
|
|
With option 'makeindependent'=true, the input will be checked for algebraic dependencies even if there are more than algebraic objects in the input:
>
|
|
| (35) |
>
|
|
| (36) |
>
|
|
| (37) |
>
|
|
| (38) |
>
|
|
| (39) |
>
|
|
| (40) |
>
|
|
| (41) |
>
|
|
With option 'makeindependent'=false, the input will never be checked for algebraic dependencies:
>
|
|
>
|
|
| (44) |