decide if a system has a finite number of solutions
IsZeroDimensional(J, X, characteristic=p)
a list or set of polynomials or a PolynomialIdeal
(optional) a list or set of variables, a ShortMonomialOrder, or a MonomialOrder
The IsZeroDimensional command decides whether a set of polynomials J with respect to the indeterminates X has a finite number of solutions over the algebraic closure of the coefficient field. For example, in characteristic zero this command tests whether there are a finite number of solutions in the complex numbers. In every domain this test is equivalent to testing whether the HilbertDimension is zero.
The variables of the system can be specified using an optional second argument X. If X is a ShortMonomialOrder then a Groebner basis of J with respect to X is computed. By default, X is the set of all indeterminates not appearing inside a RootOf command or radical when J is a list or set, or PolynomialIdeals[IdealInfo][Variables](J) if J is an ideal.
The optional argument characteristic=p specifies the ring characteristic when J is a list or set. This option has no effect when J is a PolynomialIdeal or when X is a MonomialOrder.
The algorithm for IsZeroDimensional tests whether a power of each variable appears as a leading monomial in a Groebner basis for J. To access this functionality directly (as a subroutine in your program), make J a list or set of leading monomials. IsZeroDimensional will detect this case and execute the algorithm with minimal overhead.
Note that the is_finite command is deprecated. It may not be supported in a future Maple release.
F ≔ x2−2⁢x⁢z+5,x⁢y2+y⁢z3,3⁢y2−8⁢z3
J ≔ F
Download Help Document
What kind of issue would you like to report? (Optional)