Difference between revisions of "Package sagbi/SB.IsInSA"
From ApCoCoAWiki
Andraschko (talk | contribs) (Created page with "{{Version|2}} <command> <title>SB.IsInSA</title> <short_description>This function tests whether a polynomial is in a given Subalgebra.</short_description> <syntax> SB...") |
Andraschko (talk | contribs) (removed indent) |
||
| Line 21: | Line 21: | ||
SB.IsInSA(f,S); -- true | SB.IsInSA(f,S); -- true | ||
</example> | </example> | ||
| − | |||
</description> | </description> | ||
Revision as of 11:35, 26 October 2020
| This article is about a function from ApCoCoA-2. |
SB.IsInSA
This function tests whether a polynomial is in a given Subalgebra.
Syntax
SB.IsInSA(f: RINGELEM,S: TAGGED("$apcocoa/sagbi.Subalgebra")): BOOL
Description
This function takes a polynomial f and a subalgebra S and tests whether f is an element of S using implicitization.
@param f A polynomial
@param S A subalgebra, i.e. of type TAGGED("$apcocoa/sagbi.Subalgebra")
@return true if f is an element of S and false if not.
Example
Use R ::= QQ[x,y,z];
S := SB.Subalgebra(R,[x^2,y+z]);
f := x^4 +2*x^3*y +x^2*y^2 +x^2 +2*x*y +y^2;
SB.IsInSA(f,S); -- true
See also
Package sagbi/SB.IsInSubalgebra
Package sagbi/SB.IsInSubalgebra_SAGBI
