Function
src/algebra/algorithms/groebnerBase.ts:966idealMembership
idealMembership(f: SparsePolynomial, polys: readonly SparsePolynomial[], order: MonomialOrder, opts?: Omit<GroebnerBasisOptions, "order" | "reduced">): booleanTests exact ideal membership by reducing against a computed Groebner basis.
throws
GroebnerBudgetExceeded Thrown when basis computation exceeds a budget.
Parameters
| Name | Type | Description |
|---|---|---|
f | SparsePolynomial | Polynomial to test. |
polys | readonly SparsePolynomial[] | Exact integer-coefficient ideal generators. |
order | MonomialOrder | Monomial order; defaults to LEX. |
opts | Omit<GroebnerBasisOptions, "order" | "reduced"> | Pair strategy and deterministic budgets. |
Returns
boolean — Whether the normal form of f is zero.