Grbner

Bases Tutorial

David A. Cox

Grbner
Basics
Notation and
Grbner Bases Tutorial
Definitions
Grbner Bases Part I: Grbner Bases and the Geometry of Elimination
The Consistency and
Finiteness Theorems

Elimination
Theory
The Elimination
Theorem
David A. Cox
The Extension and
Closure Theorems

Prove
Department of Mathematics and Computer Science
Extension and Amherst College
Closure



















Theorems
The Extension
Theorem
The Closure
ISSAC 2007 Tutorial
Theorem
An Example
Constructible Sets

References
 Outline

Grbner
Bases Tutorial 1 Grbner Basics
David A. Cox
Notation and Definitions
Grbner Grbner Bases
Basics
Notation and
Definitions
The Consistency and Finiteness Theorems
Grbner Bases
The Consistency and
Finiteness Theorems
2 Elimination Theory
Elimination The Elimination Theorem
Theory
The Elimination
The Extension and Closure Theorems
Theorem
The Extension and
Closure Theorems 3 Prove Extension and Closure Theorems
Prove
Extension and
The Extension Theorem
Closure
Theorems
The Closure Theorem
The Extension
Theorem
An Example
The Closure
Theorem Constructible Sets
An Example
Constructible Sets
4 References
References
 Begin Grbner Basics

Grbner
Bases Tutorial

David A. Cox
k field (often algebraically closed)
Grbner
Basics
Notation and
x = x11 xnn monomial in x1 , . . . , xn
c x , c k term in x1 , . . . , xn
Definitions
Grbner Bases
The Consistency and
Finiteness Theorems
k[x] = k[x1 , . . . , xn ] polynomial ring in n variables
Elimination
Theory
The Elimination
An = An (k) n-dimensional affine space over k
Theorem
The Extension and
Closure Theorems
V(I) = V(f1 , . . . , fs ) An variety of I = hf1 , . . . , fs i
Prove I(V ) k[x] ideal of the variety V An
Extension and
Closure
Theorems
I = {f k[x] | m f m I} the radical of I
The Extension
Theorem
The Closure
Theorem
An Example
Recall that I is a radical ideal if I = I.
Constructible Sets

References
 Monomial Orders

Grbner
Bases Tutorial

David A. Cox
Definition
Grbner
Basics A monomial order is a total order > on the set of monomials
Notation and
Definitions x satisfying:
Grbner Bases
The Consistency and
Finiteness Theorems
x > x implies x x > x x for all x
Elimination
Theory
x > 1 for all x 6= 1
The Elimination
Theorem
The Extension and We often think of a monomial order as a total order on the
set of exponent vectors Nn .
Closure Theorems

Prove
Extension and
Closure
Theorems
Lemma
The Extension
Theorem A monomial order is a well-ordering on the set of all
The Closure
Theorem
An Example
monomials.
Constructible Sets

References
 Examples of Monomial Orders

Grbner
Bases Tutorial

David A. Cox
Examples
Grbner Lex order with x1 > > xn : x >lex x iff
Basics

1 > 1 , or 1 = 1 and 2 > 2 , or . . .

Notation and
Definitions
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
Weighted order using w Rn+ and lex to break ties:
Theory
The Elimination
x >w ,lex x iff
Theorem
The Extension and
Closure Theorems
w > w , or w = w and x >lex x
Prove
Extension and
Closure
Theorems
Graded lex order with x1 > > xn : This is >w ,lex for
The Extension
Theorem w = (1, . . . , 1)
The Closure
Theorem
An Example
Constructible Sets
Weighted orders will appear in Part II when we discuss the
References Grbner walk.
 Leading Terms

Grbner
Bases Tutorial

David A. Cox Definition

Grbner Fix a monomial order > and let f k[x] be nonzero. Write
Basics
Notation and

f = c x + terms with exponent vectors 6=

Definitions
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination such that c 6= 0 and x > x wherever 6= and x

Theory
The Elimination
Theorem
appears in a nonzero term of f . Then:
The Extension and
Closure Theorems LT(f ) = c x is the leading term of f
Prove
Extension and
LM(f ) = x is the leading monomial of f
Closure
Theorems LC(f ) = c is the leading coefficient of f
The Extension
Theorem
The Closure
Theorem The leading term LT(f ) is sometimes called the initial term,
An Example
Constructible Sets denoted in(f ).
References
 The Division Algorithm

Grbner
Bases Tutorial Division Algorithm
David A. Cox
Given nonzero polynomials f , f1 , . . . , fs k[x] and a
Grbner
Basics
monomial order >, there exist r , q1 , . . . , qs k[x] with the
Notation and
Definitions following properties:
Grbner Bases
The Consistency and
Finiteness Theorems
f = q1 f1 + + qs fs + r .
Elimination No term of r is divisible by any of LT(f1 ), . . . , LT(fs ).
Theory
The Elimination
Theorem
LT(f ) = max> {LT(qi ) LT(fi ) | qi 6= 0}.
The Extension and
Closure Theorems

Prove
Extension and
Definition
Closure
Theorems Any representation
The Extension
Theorem
The Closure
Theorem f = q1 f1 + + qs fs
An Example
Constructible Sets

References satisfying the third bullet is a standard representation of f .

 The Ideal of Leading Terms

Grbner
Bases Tutorial

David A. Cox
Definition
Grbner
Basics Given an ideal I k[x] and a monomial order >, the ideal of
Notation and
Definitions leading terms is the monomial ideal
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
hLT(I)i := hLT(f ) | f Ii.
Theory
The Elimination
Theorem If I = hf1 , . . . , fs i, then
The Extension and
Closure Theorems

Prove hLT(f1 ), . . . , LT(fs )i hLT(I)i,

Extension and
Closure
Theorems
The Extension
though equality need not occur.
Theorem
The Closure
Theorem
An Example This is where Grbner bases enter the picture!
Constructible Sets

References
 Grbner Bases

Grbner
Bases Tutorial
Fix a monomial order > on k[x].
David A. Cox
Definition
Grbner
Basics
Given an ideal I k[x] a finite set G I \ {0} is a Grbner
Notation and
Definitions basis for I under > if
Grbner Bases
The Consistency and
Finiteness Theorems
hLT(g) | g Gi = hLT(I)i.
Elimination
Theory
The Elimination
Theorem
The Extension and
Definition
Closure Theorems
A Grbner basis G is reduced if for every g G,
Prove
Extension and
Closure
LT(g) divides no term of any element of G \ {g}.
Theorems
The Extension LC(g) = 1.
Theorem
The Closure
Theorem
An Example
Constructible Sets
Theorem
References Every ideal has a unique reduced Grbner basis under >.
 Criteria to be a Grbner Basis

Grbner
Bases Tutorial Given > and g, h k[x] \ {0}, we get the S-polynomial
David A. Cox
x x
Grbner S(g, h) := g h, x = lcm(LM(g), LM(h)).
Basics LT(g) LT(h)
Notation and
Definitions
Grbner Bases
The Consistency and
Finiteness Theorems
Three Criteria
Elimination
Theory (SR) G I is a Grbner basis of I every f I has
The Elimination
Theorem a standard representation using G.
The Extension and
Closure Theorems
(Buchberger) G is a Grbner basis of hGi for
Prove
Extension and every g, h G, S(g, h) has a standard representation
Closure
Theorems using G.
The Extension
Theorem
The Closure
(LCM) G is a Grbner basis of hGi for every
g, h G, S(g, h) = `G A` `, where A` 6= 0 implies
Theorem
An Example
Constructible Sets
LT(A` `) < lcm(LM(g), LM(h)) (a lcm representation).
References
 The Consistency Theorem

Grbner
Bases Tutorial
Fix an ideal I k[x], where k is algebraically closed.
David A. Cox
Nullstellensatz
Grbner

Basics (Strong) I(V(I)) = I.
Notation and
Definitions
Grbner Bases
(Weak) V(I) = 0/ 1 I I = k[x].
The Consistency and
Finiteness Theorems

Elimination The Consistency Theorem

Theory
The Elimination
Theorem The following are equivalent:
The Extension and
Closure Theorems
I 6= k[x].
Prove
Extension and 1
/ I.
Closure
Theorems
The Extension
V(I) 6= 0.
/
Theorem
The Closure
Theorem
I has a Grbner basis consisting of nonconstant
An Example
Constructible Sets
polynomials.
References I has a reduced Grbner basis 6= {1}.
 The Finiteness Theorem

Grbner
Bases Tutorial
Fix an ideal I k[x], where k is algebraically closed. Also
David A. Cox fix a monomial order >.
Grbner The Finiteness Theorem
Basics
Notation and
Definitions
The following are equivalent:
V(I) An is finite.
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination k[x]/I is a finite-dimensional vector space over k.

Theory
The Elimination
Theorem
I has a Grbner basis G where i, G has a element
The Extension and
Closure Theorems
whose leading monomial is a power of xi .
Prove
Extension and
Only finitely many monomials are not in hLT(I)i.
Closure
Theorems
The Extension
When these conditions are satisfied:
Theorem
The Closure
Theorem
# solutions dimk k[x]/I.
An Example
Constructible Sets Equality holds I is radical.
References
dimk k[x]/I = # solutions counted with multiplicity.
 Begin Elimination Theory

Grbner
Bases Tutorial

David A. Cox
Given
k[x, y] = k[x1 , . . . , xs , ys+1 , . . . , yn ],
Grbner

we write monomials as x y .
Basics
Notation and
Definitions
Grbner Bases
The Consistency and
Finiteness Theorems
Definition
Elimination A monomial order > on k[x, y] eliminates x whenever
Theory
The Elimination
Theorem
The Extension and x > x x y > x y
Closure Theorems

for all y , y .
Prove
Extension and
Closure
Theorems
The Extension
Theorem
The Closure
Example
Theorem
An Example Lex with x1 > > xn eliminates x = {x1 , . . . , xs } s.
Constructible Sets

References
 The Elimination Theorem

Grbner
Bases Tutorial
Fix an ideal I k[x, y].
David A. Cox
Definition
Grbner
Basics I k[y] is the elimination ideal of I that eliminates x.
Notation and
Definitions
Grbner Bases
The Consistency and
Finiteness Theorems
Theorem
Elimination Let G be a Grbner basis of I for a monomial order > that
Theory
The Elimination eliminates x. Then G k[y] is a Grbner basis of the
Theorem
The Extension and
Closure Theorems
elimination ideal I k[y] for the monomial order on k[y]
Prove induced by >.
Extension and
Closure
Theorems
The Extension Proof
Theorem
The Closure
Theorem
f I k[y] has standard representation f = gG Ag g. If
An Example
Constructible Sets
Ag 6= 0, then LT(g) LT(Ag g) LT(f ) k[y], so g G k[y].
References SR Criterion G k[y] is a Grbner basis of I k[y].
 Partial Solutions

Grbner
Bases Tutorial
Given I k[x, y] = k[x1 , . . . , xs , ys+1 , . . . , yn ], the elimination
David A. Cox
ideal I k[y] will be denoted
Grbner
Basics
Notation and
Definitions
Is := I k[y] k[y].
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination Definition
Theory
The Elimination The variety of partial solutions is
Theorem
The Extension and

V(Is ) Ans .
Closure Theorems

Prove
Extension and
Closure
Theorems
The Extension
Question
Theorem
The Closure
Theorem
How do the partial solutions V(Is ) Ans relate to the
An Example
Constructible Sets
original variety V := V(I) An ?
References
 Partial Solutions

Grbner
Bases Tutorial

David A. Cox Given coordinates x1 , . . . , xs , ys+1 , . . . , yn , let

Grbner
Basics s : An Ans
Notation and
Definitions
Grbner Bases
The Consistency and
Finiteness Theorems
denote projection onto the last n s coordinates.
Elimination
Theory An ideal I k[x, y] gives:
The Elimination

V = V(I) An and s (V ) Ans .

Theorem
The Extension and
Closure Theorems

Prove Is = I k[y] k[y] and V(Is ) Ans .

Extension and
Closure
Theorems
The Extension
Lemma
Theorem
The Closure
Theorem s (V ) V(Is ).
An Example
Constructible Sets

References
 Partial Solutions Dont Always Extend

Grbner
Bases Tutorial
In A3 , consider
David A. Cox x
V = V(xy 1, y z).
Grbner
Basics Using lex order
Notation and
Definitions with x > y > z, y
Grbner Bases
The Consistency and I = hxy 1, y zi
Finiteness Theorems
has Grbner basis the plane y = z

Elimination
Theory xy 1, y z. Thus
The Elimination
Theorem
I1 = hy zi, so the z

The Extension and

partial solutions are the solutions

Closure Theorems

Prove
Extension and the line y = z. The the partial
Closure solutions
Theorems The partial solution
the arrows ,
The Extension
Theorem (0, 0) does not extend.
The Closure
Theorem indicate the
An Example
Constructible Sets
projection 1
References
 The Extension Theorem

Grbner
Bases Tutorial

David A. Cox
Let I k[x, y2 , . . . , yn ] = k[x, y] with variety V = V(I) An ,
and let I1 := I k[y] be the first elimination ideal. We
Grbner
Basics assume that k is algebraically closed.
Notation and
Definitions
Grbner Bases Theorem
The Consistency and
Finiteness Theorems
Let b = (a2 , . . . , an ) V(I1 ) be a partial solution. If the ideal I
Elimination
Theory contains a polynomial f such that
The Elimination
Theorem

f = c(y)x N + terms of degree < N in x

The Extension and
Closure Theorems

Prove
Extension and
Closure with c(b) 6= 0, then there is a k such that
Theorems
The Extension (a, b) = (a, a2 , . . . , an ) is a solution, i.e.,
Theorem
The Closure
Theorem
An Example (a, a2 , . . . , an ) V .
Constructible Sets

References
 Zariski Closure

Grbner
Bases Tutorial

David A. Cox
Definition
Grbner
Basics Given a subset S An , the Zariski closure of S is the
Notation and
Definitions smallest variety S An containing S.
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
Theory
The Elimination
Lemma
Theorem
The Extension and
Closure Theorems
The Zariski closure of S An is S = V(I(S)).
Prove
Extension and
Closure
Theorems
The Extension
Example
Theorem
The Closure
Theorem Over C, the set Zn Cn has Zariski closure Zn = Cn .
An Example
Constructible Sets

References
 The Closure Theorem

Grbner
Bases Tutorial Let V = V(I) An and let k be algebraically closed.
David A. Cox
Theorem
Grbner

V(Is ) = s (V ).
Basics
Notation and
Definitions

Thus V(Is ) is the smallest variety in Ans containing s (V ).

Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
Furthermore, there is an affine variety
Theory

W V(Is ) Ans
The Elimination
Theorem
The Extension and
Closure Theorems

Prove
Extension and
with the following properties:
Closure
Theorems V(Is ) \ W = V(Is ).
V(Is ) \ W s (V ).
The Extension
Theorem
The Closure
Theorem
An Example
Constructible Sets Thus most partial solutions in V(Is ) come from actual
References solutions, i.e, the projection of V fills up most of V(Is ).
 Prove Extension and Closure Theorems

Grbner
Bases Tutorial

David A. Cox Traditional proofs of the Extension and Closure Theorems

use resultants or more abstract methods from algebraic
Grbner
Basics geometry.
Notation and
Definitions
Grbner Bases
The Consistency and Recently, Peter Schauenberg wrote
Finiteness Theorems

Elimination
Theory
A Grbner-based treatment of elimination theory for affine
The Elimination
Theorem
varieties
The Extension and
Closure Theorems
(Journal of Symbolic Computation, to appear). This paper
Prove
Extension and uses Grbner bases to give new proofs of the Extension
Closure
Theorems and Closure Theorems.
The Extension
Theorem
The Closure
Theorem Part I of the tutorial will conclude with these proofs. We
An Example
Constructible Sets begin with the Extension Theorem.
References
 Prove the Extension Theorem

Grbner
Bases Tutorial

David A. Cox
Fix a partial solution b = (a2 , . . . , an ) V(I1 ) An1 .
Grbner Notation for the Proof
Basics
Notation and
Definitions
Let f k[x, y2 , . . . , yn ] = k[x, y].
Grbner Bases
The Consistency and
Finiteness Theorems
We write
Elimination
Theory f = c(y) x M + terms of degree < M in x
The Elimination
Theorem
|{z}
The Extension and LCx (f )
Closure Theorems

Prove
Extension and We set
Closure
Theorems f := f (x, b) k[x].
The Extension
Theorem
The Closure
Theorem
An Example
Constructible Sets By hypothesis, there is f I with LCx (f ) 6= 0.
References
 Lemma

Grbner
Bases Tutorial
Let G be a Grbner basis of I using > that eliminates x.
David A. Cox
Lemma
Grbner
Basics
There is g G with LCx (g) 6= 0.
Notation and
Definitions
Grbner Bases
The Consistency and
Proof
Finiteness Theorems

Elimination
Let f = gG Ag g be a standard representation of f I with
Theory
The Elimination
LCx (f ) 6= 0. Thus
Theorem
The Extension and

LT(f ) = max{LT(Ag g) | Ag 6= 0}.

Closure Theorems

Prove
Extension and
Closure
Theorems
Since > eliminates x, it follows that
The Extension
Theorem
The Closure
Theorem
degx (f ) = max{degx (Ag g) | Ag 6= 0}

An Example
Constructible Sets LCx (f ) = LCx (Ag ) LCx (g)
References degx (Ag g)=degx (f )
 Main Claim

Grbner
Bases Tutorial

David A. Cox By the lemma, we can pick g G with LCx (g) 6= 0 and
M := degx (g) minimal. Note that M = degx (g) > 0.
Grbner
Basics
Notation and
Definitions
Main Claim
Grbner Bases
The Consistency and
Finiteness Theorems {f | f I} = hgi k[x].
Elimination
Theory
The Elimination
Consequence: If g(a) = 0 for some a k, then
Theorem
The Extension and
Closure Theorems
f (a, b) = f (a) = 0
Prove
Extension and
Closure
Theorems
for all f I, so (a, b) = (a, a2 , . . . , an ) V = V(I).
The Extension
Theorem
This proves the Extension Theorem!
The Closure
Theorem
An Example
Constructible Sets
Strategy to prove Main Claim: Show h hgi for all h G.
References
 Claim

Grbner
Bases Tutorial

David A. Cox Consider h G with degx (h) < M = degx (g). M minimal
Grbner implies LCx (h) = 0, so degx (h) < degx (h).
Basics
Notation and
Definitions Claim
Grbner Bases
The Consistency and
Finiteness Theorems h = 0.
Elimination
Theory Proof. Let m := degx (h) < M and set
The Elimination
Theorem

S := LCx (g)x Mm h LCx (h)g I,

The Extension and
Closure Theorems

Prove
Extension and
Closure with standard representation S = `G A` `. Observe:
Theorems
The Extension
Theorem LCx (g) x Mm h = S = `G A` `
The Closure
Theorem
An Example
max{degx (A` ) + degx (`) | A` 6= 0} = degx (S) < M
Constructible Sets

References
 Prove the Claim

Grbner
Bases Tutorial LCx (g) x Mm h = S = `G A` `
David A. Cox
max{degx (A` ) + degx (`)} = degx (S) < M
Grbner
Basics
Notation and
First bullet implies: Since LCx (g) 6= 0 and m = degx (h),
Definitions
Grbner Bases
The Consistency and

M degx (h) + degx (h) max{degx (A` ) + degx (`)}
Finiteness Theorems

Elimination
Theory so that
The Elimination
Theorem
The Extension and
Closure Theorems
degx (h) degx (h) min{M (degx (A` ) + degx (`))}.
Prove
Extension and
Closure Second bullet implies: All ` G in S have degx (`) < M, so
Theorems
The Extension
< degx (`). Hence
degx (`)
Theorem
The Closure
Theorem
An Example
< deg (A` ) + deg (`) < M.
degx (A` ) + degx (`)
Constructible Sets
x x
References
The two strict inequalities give degx (h) degx (h) 2.
 Finish the Claim

Grbner
Bases Tutorial The inequality degx (h) degx (h) 2 applies to all h G
David A. Cox with degx (h) < M and hence to all ` G in S = ` A` `.
Grbner
Basics
Arguing as before gives
Notation and
Definitions
Grbner Bases degx (A` ) + degx (`) < degx (A` ) + degx (`) < M,
The Consistency and
Finiteness Theorems

Elimination
Theory
The Elimination
drops by at least 2
Theorem
The Extension and
Closure Theorems
and
Prove
Extension and
Closure } 3.
degx (h) degx (h) min{M (degx (A` ) + degx (`))
Theorems | {z }
The Extension
Theorem
The Closure
3
Theorem
An Example
Constructible Sets Continuing this way, we see that h = 0 for all h G with
References degx (h) < M, as claimed.
 Prove the Main Claim

Grbner
Bases Tutorial Proof. For h G, we show h hgi by induction on degx (h).
David A. Cox
Base Case: degx (h) < M implies h = 0 hgi by Claim.
Grbner
Basics Inductive Step: Assume h hgi for all h G with
Notation and
Definitions
Grbner Bases
degx (h) < m M. Take h G with degx (h) = m. Then
The Consistency and
Finiteness Theorems

Elimination
S := LCx (g) h LCx (h) x mM g I
Theory

has standard representation S = `G A` `, so

The Elimination
Theorem
The Extension and
Closure Theorems

Prove degx (S) < m degx (`) < m ` in S.

Extension and
Closure
Theorems
The Extension
By inductive hypothesis, ` hgi. Hence
Theorem
The Closure
Theorem
An Example LCx (g) h LCx (h) x
mM
g = S = `G A` `.
Constructible Sets

References
Then LCx (g) 6= 0 implies h hgi.
 The Closure Theorem

Grbner
Bases Tutorial We next give Schauenbergs proof of the Closure Theorem.
David A. Cox

Grbner
Fix a partial solution b = (as+1 , . . . , an ) V(Is ) Ans and a
Basics Grbner basis G of I for > that eliminates x = (x1 , . . . , xs ).
Notation and
Definitions
Grbner Bases
The Consistency and
Notation for the Proof
Finiteness Theorems

Elimination
Let f k[x1 , . . . , xs , ys+1 , . . . , yn ] = k[x, y].
Theory
The Elimination We write
Theorem
The Extension and

f = c(y) x (f ) + terms < x (f ) .

Closure Theorems

Prove | {z }
Extension and
Closure LCs (f )
Theorems
The Extension
Theorem
The Closure
We set
Theorem
An Example
f := f (x, b) k[x].
Constructible Sets

References
 A Special Case

Grbner
Bases Tutorial

David A. Cox
Special Case
Grbner
Basics If b V(Is ) satisfies
Notation and
Definitions
Grbner Bases
The Consistency and LCs (g) 6= 0 for all g G \ k[y],
Finiteness Theorems

then b s (V ).
Elimination
Theory
The Elimination
Theorem
The Extension and
Closure Theorems Proof. If we can find a = (a1 , . . . , as ) such that g(a) = 0 for
Prove all g G, then g(a, b) = 0 for all g G. This implies
Extension and
Closure
Theorems
The Extension
(a, b) V ,
Theorem
The Closure
Theorem
An Example and b s (V ) follows.
Constructible Sets

References
 Prove the Special Case

Grbner
Bases Tutorial

David A. Cox Let G = {` | ` G \ k[y]}. Take g, h G \ k[y] and set

Grbner x x
Basics S := LCs (g) h LCs (h) g
Notation and
Definitions x (h) x (g)
Grbner Bases

where x = lcm(x (g), x (h) ). A standard representation

The Consistency and
Finiteness Theorems

Elimination
Theory
S = `G A` ` gives
The Elimination

x x
Theorem
The Extension and
Closure Theorems
LCs (g) h LCs (h) g = S = A `

`.
x (h) x (g) `G
Prove
Extension and
Closure
Theorems Then LCs (g) 6= 0 and LCs (h) 6= 0 imply:
The Extension
Theorem
The Closure
S = A` ` is a lcm representation.
`G
Theorem
An Example
Constructible Sets
S is the S-polynomial of g, h up to a constant.
References
 Finish the Special Case

Grbner
Bases Tutorial

David A. Cox
S = `G
A` ` is a lcm representation.
Grbner
Basics
S is the S-polynomial of g, h up to a nonzero constant.
Notation and
Definitions
Grbner Bases
These tell us that for every
The Consistency and
Finiteness Theorems

Elimination g, h G = {` | ` G \ k[y]},
Theory
The Elimination
Theorem
The Extension and
the S-polynomial of g, h has a lcm representation with
Closure Theorems
respect to G. LCM Criterion G is a Grbner basis of hGi.
Prove
Extension and
Closure
Theorems Since LTx (g) 6= 0 for g G \ k[y], g is nonconstant for every
The Extension
Theorem g G. Consistency Theorem V(G) 6= 0. /
The Closure
Theorem
An Example
Constructible Sets Hence there exits a such that g(a) = 0 for all g G.
References
 Saturation

Grbner
Bases Tutorial Fix ideals I, J k[x].
David A. Cox
Definition
Grbner
Basics The saturation of I with respect to J is
Notation and
Definitions
Grbner Bases
The Consistency and
I : J := {f k[x] | J M f I for M  0}.
Finiteness Theorems

Elimination
Theory To see what this means geometrically, let
The Elimination
Theorem
The Extension and
Closure Theorems
V := V(I)
Prove
Extension and
W := V(J).
Closure
Theorems
The Extension Then:
Theorem
The Closure
Theorem Lemma
An Example

V \ W = V(I : J ).
Constructible Sets

References
 Proof of the Closure Theorem

Grbner
Bases Tutorial
Proof. The goal is to find a variety W V(Is ) such that

V(Is ) \ W s (V )
David A. Cox
and V(Is ) \ W = V(Is ).
Grbner
Basics
Notation and
Let G be a reduced Grbner basis of I that eliminates x. Set
Definitions


J := Is + gG\k [y] LCs (g) .
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
Theory
Then [
The Elimination
Theorem
V(J) = V(Is ) V(LCs (g)).
The Extension and
Closure Theorems gG\k [y]
Prove
Extension and Notice that
Closure
Theorems
The Extension
b V(Is ) \ V(J) LCs (g) 6= 0 g G \ k[y].
Theorem

By Special Case, b s (V ). Hence

The Closure
Theorem
An Example
Constructible Sets

References V(Is ) \ V(J) s (V ).

 Two Cases

Grbner
Bases Tutorial Case 1. V(Is ) \ V(LCs (g)) = V(Is ) for all g G \ k[y].
David A. Cox

Grbner
Intersecting finitely many open dense sets is dense, so
Basics
Notation and T
Definitions V(Is ) \ V(J) = gG\k [y] V(Is ) \ V(LCs (g)) = V(Is ).
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
Thus the theorem holds with W = V(J).
Theory
The Elimination
Theorem Case 2. V(Is ) \ V(LCs (g)) ( V(Is ) for some g G \ k[y].
The Extension and
Closure Theorems

Prove
Extension and
The strategy will be to enlarge I. First suppose that
Closure
Theorems
V(Is ) V(LCs (g)). Then:
The Extension
LCs (g)vanishes on V(Is ) and
hence on V . Hence
Theorem
The Closure
Theorem
An Example
Nullstellensatz LCs (g) I.
Constructible Sets

References
G reduced LCs (g)
/ I (since LT(LCs (g)) divides LT(g)).
 Finish the Proof

Grbner
Bases Tutorial
Together, these bullets imply that
David A. Cox

I ( I + hLCs (g)i I,
Grbner
Basics
Notation and
so in particular, V(I) = V(I + hLCs (g)i). So it suffices to prove
Definitions
Grbner Bases the theorem for I + hLCs (g)i when V(Is ) V(LCs (g)).
The Consistency and
Finiteness Theorems

Elimination On the other hand, when V(Is ) * V(LCs (g)), we have a union
Theory
The Elimination of proper subsets
Theorem
The Extension and
Closure Theorems
V(Is ) = V(Is ) \ V(LCs (g)) (V(Is ) V(hLCs (g)i))
Prove
Extension and
Closure
= V(Is : LCs (g) ) V(Is + hLCs (g)i)
Theorems
The Extension
Theorem Hence it suffices to prove the theorem for
The Closure
Theorem
An Example
Constructible Sets
I ( I + hIs : LCs (g) i and I ( I + hLCs (g)i.
References
ACC these enlargements occur only finitely often.
 Example

Grbner
Bases Tutorial
Consider A4 with variables w , x, y, z. Let 1 : A4 A3 be
David A. Cox projection onto the last three coordinates. Set
Grbner f = x 5 + x 4 + 2 yz
Basics
Notation and
Definitions
Grbner Bases
and I = h(y z)(fw 1), (yw 1)(fw 1)i. This defines
The Consistency and
Finiteness Theorems
V := V(I) = V(y z, yw 1) V((x 5 + x 4 + 2 yz)w 1) A4 .
Elimination
Theory
The Elimination
Theorem
Then:
The Extension and
Closure Theorems {g1 , g2 } = {(y z)(fw 1), (yw 1)(fw 1)} is a
Prove Grbner basis of I for lex with w > x > y > z.
Extension and
Closure I1 = 0.
Theorems
The Extension
Theorem
Furthermore,
The Closure

Theorem 5 4
An Example g1 = (y z)(x + x + 2 yz) w +
Constructible Sets
2
5 4
References g2 = y(x + x + 2 yz) w +
 Continue Example

Grbner
Bases Tutorial As in the proof of the Closure Theorem, let
David A. Cox


Grbner
J = I1 + gG\k [x,y ,z] LC1 (g)
Basics
Notation and
Definitions
= h(y z)(x 5 + x 4 + 2 yz) y(x 5 + x 4 + 2 yz)i
= hy(y z)(x 5 + x 4 + 2 yz)2 i.
Grbner Bases
The Consistency and
Finiteness Theorems

Elimination
Theory This satisfies Case 1 of the proof, so that
The Elimination
Theorem

V(I1 ) \ V(J) = A3 \ V(J) 1 (V ).

The Extension and
Closure Theorems

Prove
Extension and
Closure However,
Theorems
The Extension

Theorem
The Closure 1 (V ) = A \ V(x + x + 2 yz)
3 5 4
Theorem
5 4 5 4


An Example
Constructible Sets V(y z, x + x + 2 yz) \ V(x + x + 2, y, z) .
References
 Constructible Sets

Grbner
Bases Tutorial

David A. Cox
Definition
A set S An is constructible if there are affine varieties
Grbner
Basics Wi Vi An , i = 1, . . . , N, such that
Notation and
Definitions
Grbner Bases
N
[
The Consistency and
Finiteness Theorems
S= Vi \ Wi ).
Elimination
Theory
i=1
The Elimination
Theorem
The Extension and
Closure Theorems Theorem
Prove
Extension and Let k be algebraically closed and s : An Ans be
Closure
Theorems projection onto the last n s coordinates. If V An is an
The Extension
Theorem affine variety, then s (V ) Ans is constructible.
The Closure
Theorem
An Example
Constructible Sets
The proof of the Closure Theorem can be adapted to give
References an algorithm for writing s (V ) as a constructible set.
 References

Grbner
Bases Tutorial

David A. Cox

Grbner
Basics T. Becker, V. Weispfenning, Grbner Bases, Graduate
Notation and
Definitions
Grbner Bases
Texts in Mathematics 141, Springer, New York, 1993.
The Consistency and
Finiteness Theorems
D. Cox, J. Little, D. OShea, Ideals, Varieties and
Elimination
Theory Algorithms, Third Edition, Undergraduate Texts in
The Elimination
Theorem Mathematics, Springer, New York, 2007.
The Extension and
Closure Theorems

Prove
P. Schauenberg, A Grbner-based treatment of
Extension and
Closure
elimination theory for affine varieties, Journal of
Theorems Symbolic Computation, to appear.
The Extension
Theorem
The Closure
Theorem
An Example
Constructible Sets

References