compute the vanishing ideal for finite a set of points
VanishingIdeal(S, X, T, p)
list or set of points
list of variable names
(optional) monomial order
(optional) characteristic, a non-negative integer
The VanishingIdeal command constructs the vanishing ideal for a set of points in affine space. The output of this command is the ideal of polynomials that vanish (that is, are identically zero) on S.
The first argument must be a list or set of points in affine space. Each point is given as a list with coordinates corresponding to the variables in X.
The third argument is optional, and specifies a monomial order for which a Groebner basis is computed. If omitted, VanishingIdeal chooses lexicographic order, which is generally the fastest order.
The field characteristic can be specified with an optional last argument. The default is characteristic zero.
Multiple occurrences of the same point in S are ignored, so that VanishingIdeal always returns a radical ideal.
L ≔ 5,4,4,4,0,2,6,4,1,3,0,5,3,1,3
J ≔ VanishingIdeal⁡L,x,y,z
J ≔ z5−15⁢z4+85⁢z3−225⁢z2+274⁢z−120,9⁢z4−98⁢z3+351⁢z2+24⁢x−454⁢z+48,z4−8⁢z3+13⁢z2+4⁢y+18⁢z−40
M ≔ 1,α,α2α−1,0,1,1α
K ≔ VanishingIdeal⁡M,x,y,2
K ≔ α2⁢y2+α2+x+y+1,α2⁢y2+y2⁢α+y3+y2+y
Farr, Jeff. Computing Grobner bases, with applications to Pade approximation and algebraic coding theory. Ph.D. Thesis, Clemson University, 2003.
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.