<p>Yes, that's the Ideal Membership Problem and it is solved using Gröbner bases.</p>

CC BY-SA 3.0
2017-10-08T05:23:02.507Z
Thank you, you always give me perfect answer. and I wonder if it may be extended to other closed fields.
XL _At_Here_There
CC BY-SA 3.0
2017-10-08T05:19:18.587Z
2017-10-08T06:03:08.193Z
2017-10-08T06:03:08.193Z
Bjørn Kjos-Hanssen
<p>Given an ideal $I$ over $\mathbb{C}$ and P, a polynomial, is it decidable whether $P\in I$?</p>

<computability><algebra>
Is the relation decidable?
XL _At_Here_There
# Is the relation decidable?

(Asked by: username_0 on 2017-10-08)

Given an ideal $I$ over $\mathbb{C}$ and P, a polynomial, is it decidable whether $P\in I$?

**Tags:** computability, algebra

---

## 1 answers

### Answer by username_1 on 2017-10-08. Score: 3 | Accepted answer

Yes, that's the Ideal Membership Problem and it is solved using Gröbner bases.

> **Comments:**
> **username_0**: Thank you, you always give me perfect answer. and I wonder if it may be extended to other closed fields.  

---

