next up previous contents
Next: Computation in (continued) Up: Topics on Computational Algebra Previous: Computation in

Computation in ${\mathbb F}[x_1, \dots, x_n]/{\mathbf I}$ (continued)


MTHSC 985 Spring 2001 Clemson University
Topics on Computational Algebra Instructor: Shuhong Gao
Lecture 12, February 26 Scribe: Fred Block

Let I be an ideal in ${\mathbb F}[x_1, \dots, x_n]$ and ${\mathbf R}={\mathbb F}[x_1, \dots, x_n]/{\mathbf I}$. Fix a monomial order on ${\mathbb F}[x_1, \dots, x_n]$. Let G be a Gröbner basis for I and B=B(I) as defined in the previous lecture. By Lemma 11.5, we know that

Suppose that R is represented as $\mbox{Span}(B)$. Addition in R is easy. For multiplication in R, one needs to perform long division by G.

Example 12.1   Consider Example 11.3. For the first monomial order (x>y), the basis monomials are

1, x, x2, x3, y, xy, x2y, x3y, y2, xy2, x2 y2, y3.

A Gröbner basis for I was found to be

\begin{displaymath}G=\{x^3y^2-y, x^4-y^2, xy^3-x^2, y^4-xy\},
\end{displaymath}

so we have (modulo I)

\begin{displaymath}x^3y^2\equiv y,\ \ x^4 \equiv y^2,\ \ xy^3 \equiv x^2,\ \ y^4 \equiv xy.
\end{displaymath}

Now we can compute some products:

\begin{displaymath}x^3 \cdot x^3y \equiv x^6y
\equiv x^4 \cdot x^2y
\equiv y^2 \cdot x^2y
\equiv x^2y^3
\equiv x \cdot x^2
\equiv x^3,
\end{displaymath}


\begin{displaymath}x^{11} \equiv x^3 \left(x^4\right)^2
\equiv x^3 \left(y^2\right)^2
\equiv x^3 \cdot xy
\equiv x^4y \equiv y^3.
\end{displaymath}

The product should be reduced until it becomes a polynomial in $\mbox{Span}(B)$.

Example 12.2   Consider Example 11.3 again. For the second monomial order (y>x), the basis monomials are

\begin{displaymath}1, x, x^2, \dots, x^{11}.
\end{displaymath}

A Gröbner for I was found to be $G=\left\{y-x^7,\ x^{12}-x^2 \right\}$. Now

\begin{displaymath}\mbox{Span}(B) = \{a_0 + a_1 x + \cdots + a_{11} x^{11}: a_i \in {\mathbb Q}\},\end{displaymath}

Addition and multiplication of polynomials in $\mbox{Span}(B)$ modulo Gare simply modulo x12-x2, as y is not involved at all. So,

\begin{displaymath}{\mathbf R}={\mathbb Q}[x,y]/\left<xy^{3} - x^{2}, x^{3}y^{2} - y\right>
\ \cong \ {\mathbb Q}[x]/(x^{12}-x^2).
\end{displaymath}

Notice that with this particular monomial ordering, the ring structure of R seems simpler than its representation in Example 12.1.

Our next goal is to determine the ring structure of ${\mathbb F}[x_1, \dots, x_n]/{\mathbf I}$. We shall study eigenvalues and Fourier transform in ${\mathbb F}[x_1, \dots, x_n]/{\mathbf I}$. Here we consider only the case where B(I) is finite, that is, the ring ${\mathbb F}[x_1, \dots, x_n]/{\mathbf I}$ has finite dimension as a vector space over ${\mathbb F}$. In this case, the ring ${\mathbb F}[x_1, \dots, x_n]/{\mathbf I}$ is called a 0-dimensional algebra over ${\mathbb F}$.

Let

\begin{displaymath}V({\mathbf I})= \left\{ P \in {\mathbb F}^n:\,\,f(P)=0,\,\, \forall\,\,f\in{\mathbf I}\right\},\end{displaymath}

i.e. the set of common zeros of I in ${\mathbb F}^n$. V(I) is called an algebraic set. It is also called a variety in the literature.

Lemma 12.3   If B(I) is finite, then V(I) is also finite. In fact, $\left\vert V({\mathbf I}) \right\vert \leq \left\vert B({\mathbf I})\right\vert$.


 \begin{pf}% latex2html id marker 5994
Suppose we have $m$\space distinct points ...
...)\vert$ . So $\vert V({\mathbf I})\vert\leq\vert B({\mathbf I})\vert$ .
\end{pf}

Exercise 12.4   Show how to find the required polynomials $f_1,\dots,f_m$ used in the proof.

Research Problem. Given some points $P_1, \dots, P_m \in {\mathbb F}^n$, compute a Gröbner basis for the ideal ${\mathbf I}=\{f\in {\mathbb F}[x_1, \dots, x_n]:\,\,f(P_i)=0,\,1\leq i \leq m\}$and B(I) under any given monomial order. Is it possible to compute them using ${\mathcal O}(m^2n)$ operations in ${\mathbb F}$?

In general, if V(I) is finite, then B(I) may not be finite. For example, if ${\mathbb F}= {\mathbb R}$ and ${\mathbf I}=\left< x^2+y^2 +1\right>$ then V(I) is empty as the polynomial f=x2+y2 +1 has no solution in ${\mathbb R}^2$, but B(I) is infinite. Here the problem is that ${\mathbb R}$ is not algebraically closed.

Lemma 12.5   Suppose ${\mathbb F}$ is algebraically closed. If V(I) is finite, then B(I) is finite as well.

Question. When does |V(I)|=|B(I)| if ${\mathbb F}$ is algebraically closed? Need I to be a radical ideal. Think over the ideal I=<f(x)> where f is not squarefree.


next up previous contents
Next: Computation in (continued) Up: Topics on Computational Algebra Previous: Computation in
Xuhong Gao
2001-05-10