Next: Computation in (continued)
Up: Topics on Computational Algebra
Previous: Computation in
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
and
.
Fix a monomial order on
.
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
.
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
so we have (modulo
I)
Now we can compute some products:
The product should be reduced until it becomes a polynomial in

.
Example 12.2
Consider Example
11.3 again. For the second monomial order (
y>
x),
the basis monomials are
A Gröbner for
I was found to be

.
Now
Addition and multiplication of polynomials in

modulo
Gare simply modulo
x12-
x2, as
y is not involved at all.
So,
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
.
We shall study eigenvalues and Fourier transform in
.
Here we consider only the case where
B(I) is finite, that is,
the ring
has finite dimension as a vector space
over
.
In this case, the ring
is called a 0-dimensional algebra over
.
Let
i.e. the set of common zeros of
I in
.
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,

.
Exercise 12.4
Show how to find the required polynomials

used in the proof.
Research Problem.
Given some points
, compute a Gröbner basis
for the ideal
and
B(I) under any given monomial order.
Is it possible to compute them using
operations in
?
In general, if
V(I) is finite, then
B(I) may not be finite.
For example, if
and
then
V(I) is empty as the polynomial
f=x2+y2 +1 has no solution
in
,
but
B(I) is infinite. Here the problem is that
is not algebraically closed.
Lemma 12.5
Suppose

is algebraically closed. If
V(
I) is finite, then
B(
I) is finite as well.
Question.
When does
|V(I)|=|B(I)| if
is algebraically closed?
Need
I to be a radical ideal.
Think over the ideal I=<f(x)> where f is not squarefree.
Next: Computation in (continued)
Up: Topics on Computational Algebra
Previous: Computation in
Xuhong Gao
2001-05-10