4 Hilbert s Basis Theorem and Gröbner basis

Size: px
Start display at page:

Download "4 Hilbert s Basis Theorem and Gröbner basis"

Transcription

1 4 Hilbert s Basis Theorem and Gröbner basis We define Gröbner bases of ideals in multivariate polynomial rings and see how they work in tandem with the division algorithm. We look again at the standard questions: ideal generation, ideal membership and analysing the solutions of systems of polynomials. Since Gröbner basis makes profit from contemplating the leading terms of equations, we look for a moment at the univariate case. Imagine trying to solve f(t) = 0 over C using only the leading term of f. Of course, that throws almost all the information away. But you can still distinguish between three cases: f = 0, f is a nonzero constant and deg f > 0. That doesn t sound much, but pronounced geometrically the set of solutions is either one dimensional, empty or a nonempty finite set it captures the three possible quite different types of behaviour. 4. The leading terms in an ideal Here is the definition of Gröbner basis out of the blue. Definition 9 Let I k[x,..., x n ] be a nonzero ideal. Then a subset G I is a Gröbner basis of I if and only if G is finite and for all f I there is some g G whose leading monomial LM(g) divides LM(f). This definition is about as unenlightening as it could possibly be. Since the definition wisely requires that G be finite, it is not even clear that Gröbner bases exist, so here is one class of examples. Lemma 20 Let I = (m,..., m r ) k[x,..., x n ] be an ideal generated by monomials m,..., m r. Then G = {m,..., m r } is a Gröbner basis of I. Proof Any f I has an expression f = a m + + a r m r for some polynomials a i k[x,..., x n ]. In other words, every term of f is divisible by some m i, so it is certainly true of the leading term of f. The division algorithm with Gröbner basis In the last section, we said that we could characterise those sets of polynomials that work well with the division algorithm. First we see that the problem of nonuniqueness of the remainder in the Division Algorithm is solved. Theorem 2 Let G = {g,..., g s } be a Gröbner basis of I k[x,..., x n ]. Then for any f k[x,..., x n ] there are polynomials q,..., q s, r k[x,..., x n ] such that f = q g + + q s g s + r where r is reduced with respect to G and LT(f) LT(q i ) LT(g i ) for every i =,..., s. Moreover r is uniquely determined by these conditions.

2 In other words, however we compute f = q i g i + r, whether we use the division algorithm or not, as long as we obey the conditions on leading terms, the remainder r will always turn out to be the same polynomial. The q i, by contrast, are not well determined at all, and we compute the extent to which they can be varied in Part IV. Proof The existence of such an r and the conditions on leading terms follows immediately from the division algorithm. We only need to prove that r is unique. Suppose that we have two expressions f = g + r = g 2 + r 2 satisfying the conclusions of the theorem. We must prove that r = r 2. Certainly r r 2 = g 2 g I, so by the definition of Gröbner basis there is a polynomial g G so that LM(g) divides LM(r r 2 ). But both r r 2 is reduced with respect to G, since this is true for both r and r 2, so there is no monomial in r r 2 that is divisible by LM(g) for any g G. That is a contradiction unless r r 2 = 0, and that is what we had to prove. This proof makes no condition on the order of elements in G, so the following notation does make sense. Definition 22 The unique polynomial r in the theorem is called the remainder of f after division by G and is denoted either by f G or f mod G. This solves many of our questions: part (b) of the corollary below is the ideal membership problem for ideals with a given Gröbner basis. Corollary 23 Let G = {g,..., g s } be a Gröbner basis of I k[x,..., x n ] and f k[x,..., x n ]. Then (a) there is a unique r that is reduced with respect to G and so that f r I. (b) f I if and only if f G = 0. Part (b) follows from (a) because if f I then r = 0 satisfies the conditions of (a) and so it must be the unique remainder on applying the division algorithm. Notice finally that the Gröbner basis really does generate I as an ideal it is a natural slip of the brain to assume this without checking, but it is certainly not part of the definition, and fortunately we have not used this fact at all yet. Equivalent characterisations of Gröbner basis There are lots of different ways of saying what a Gröbner basis is. These two propositions give two of them; both are famous. Proposition 24 Let I k[x,..., x n ] be an ideal and G = {g,..., g s } I. Then G is a Gröbner basis of I if and only if for every f I, there is an expression f = q g + + q s g s with LT(f) LT(q i ) LT(g i ) for every i =,..., s. 2

3 Proof Given such an expression, LM(f) = LM(q i g i ) for at least one i. Then LT(g i ) divides LT(f). Given a monomial order > on k[x,..., x n ], every polynomial f k[x,..., x n ] has a leading term LT(f) with respect to >. If I is an ideal, we can consider the leading terms of every polynomial in I. Definition 25 Let I k[x,..., x n ] be an ideal with monomial order >. The initial ideal of I, denoted LT(I), is the ideal generated by the leading terms of every element of I: in other words, LT(I) = {LT(f) : f I} k[x,..., x n ]. We can rephrase the definition of Gröbner basis in terms of LT(I). Proposition 26 Let I k[x,..., x n ] be an ideal and G = {g,..., g s } I. Then G is a Gröbner basis of I if and only if {LT(g ),..., LT(g s )} generates the ideal LT(I). By Lemma 20, if the leading terms LT(g i ) do generate the ideal LT(I) then they are a Gröbner basis for it. This is an exercise in the division algorithm, and we leave the proof to the exercises. 4.2 S-polynomials and the Buchberger criterion We make our routine technique of cancelling leading terms more formal by defining the S-polynomial of two polynomials. Definition 27 Let f, g k[x,..., x n ] be two nonzero polynomials. Then the S- polynomial of f and g is S(f, g) = where L = LCM(LM(f), LM(g)). L LT(f) f L LT(g) g For example, let f = 2yx y and g = 3y 2 x. Suppose > is the grlex monomial order with y > x. Then LT(f) = 2yx, LT(g) = 3y 2 so L = LCM(yx, y 2 ) = y 2 x and S(f, g) = ( ) ( ) y 2 x y (2yx y) x (3y 2 x) 2yx 3y 2 = (y/2)(2yx y) (x/3)(3y 2 x) = (/2)y 2 + (/3)x 2. Dividing this S-polynomial by f, g using the division algorithm gives so we see that S(f, g) = (/6)g + ((/3)x 2 (/6)x) S(f, g) f,g = (/3)x 2 (/6)x. So if I = (f, g), then LT(I) includes (/3)x 2, and since this is not in the ideal generated by LT(f), LT(g) we conclude that {f, g} is not a Gröbner basis of I. This is the central observation of Buchberger s criterion. 3

4 Theorem 28 (Buchberger s criterion) Let G = {g,..., g s } k[x,..., x n ] be a set of nonzero polynomials, and let I = (g,..., g s ) k[x,..., x n ] be the ideal they generate. Then G is Gröbner basis for I if and only if S(f, g) G = 0 for every i < j s. This theorem is central to our theory. We prove it in the next section. I believe it comes to us in exactly this form from Buchberger s 965 PhD thesis you can get Buchberger s own account from his webpage although many other people contributed ideas before that. The first point Example Let f = y 2, g = xy + and define the ideal I = (f, g). Using Buchberger s criterion, show that the given basis f, g of I is not a Gröbner basis. Show that f, g, h, where h = x + y, is a Gröbner basis for I. (In particular, you must show that h I you ve already done this using the division algorithm.) In fact, f, h is also a Gröbner basis: it is easy to check that g is a combination of these two. Homework Q.. Let I be the ideal with basis y 2, xy + (with respect to the lex order with x > y). Work out why each of the two equivalent characterisations of Gröbner basis above fail for this basis. Show that this is not a Gröbner basis by using the Buchberger criterion. Q.2. Repeat the exercise with the ideal generated by xy 2 and x 2 y 3. Q.3. Show that any non-zero ideal in any polynomial ring has infinitely many elements. Q.4. Let f be any polynomial and {m,..., m s } be a set of monomials. The division algorithm (applied with some order chosen on the m i ) computes an expression f = q i m i + r, where r is the reduced remainder. Show that r is simply the sum of those terms of f that are not divisible by any of the m i. Conclude that the division algorithm will return the same reduced remainder, whatever order the m i are written in. 4

5 Example 2 We know that computing the kernel of a matrix M is the same as solving a system of linear equations. Let M be the 3 3 matrix of linear forms x y z y 2z M = y 2z x 4z. x + y x y y For different values of x, y, z, the dimension of the solution space will change, that is to say that rank of the matrix M will vary with x, y, z. It is easy to say when M has full rank: that is when det M is not zero, and this happens for all values of x, y, z which do not satisfy x 3 2x 2 y 5x 2 z + 9xyz + y 3 y 2 z = 0. () At values that do satisfy this equation, the rank of M is at most 2. For what values of x, y, z does M have rank at most? From linear algebra, we know that this happens at any values for which all of the 2 2 minors of M vanish. So we consider the ideal defined by these minors. Let R = k[x, y, z] have the lex order with x > y > z and let I R be the ideal generated by the 2 2 minors of M, so I has basis 2xz 3yz, x 2 2xy xz + y 2 yz, xy 2xz y 2 2yz x 2 + xy + 4xz + y 2 6yz, 2xz + 2y 2 2yz, x 2 + xy 4xz y 2 4yz xz 2yz, xy + 2xz + y 2 yz, x 2 + xy + 4xz 2yz. These look complicated, and so the hope is that, as in the univariate case, considering leading terms of these polynomials will give us some information about the solutions. The leading monomials that we can see are x 2, xy, xz. However, it is easy to find elements of I whose leading term is not a combination of these. For example, the leading term of (2xz 3yz) 2(xz 2yz) is yz, which does not have x as a factor so is not a combination. Finding another element with leading term y 2 is also easy. In fact, in this case the problem is now completely solved, since one can check that I = (x 2, xy, xz, y 2, yz). In other words, the rank of M is at most exactly along the z axis. If we think of points p = (x, y, z) A 3 k parametrising the matrices M p = M, the picture is very pretty. For a general point p A 3 k, the matrix M p has full rank. If p lies on the hypersurface () but not on the z-axis, then the rank of M p is 2. Moreover, the z-axis is exactly the singular locus the locus where all the derivatives of the equation () vanish, and so the locus where the tangent plane is not defined of this hypersurface. For p on the z-axis but not at the origin, the rank of M is. And the origin is certainly a distinguished point of V (I), since the generators of I all vanish twice only there. And we see immediately that special case of rank zero is achieved only when x, y, z are all zero, that is, when p is the origin. 5

6 Conclusion At heart, this example is just about the leading terms of an ideal that happens to be generated by the nine 2 2 minors of a matrix with polynomial entries. Let B be the basis of 2 2 minors used to define I. Then the ideal generated by the leading terms of polynomials in B is only (x 2, xy, xz). After calculating (presumably by cancelling leading terms, if you tried it yourself) the basis for I was x 2, xy, xz, y 2, yz. So certainly the leading terms of different bases for the same ideal can generate different monomial ideals. What we want to look at is the ideal consisting of the leading terms of every f I. This is what Gröbner basis computes. 6

7 5 The existence of Gröbner bases 5. Back to S-polynomials and the Buchberger criterion Let s think again about the Buchberger criterion. One implication in this theorem is clear: S-polynomials lie in the ideal I and so reduce to zero on division by a Gröbner basis G. The converse is the point. By construction, S-polynomials are expressions that kill a pair of leading terms. The next lemma says that any k-linear expression that kills leading terms is a combination of S-polynomials. Lemma 29 Suppose f,..., f s k[x,..., x n ] have the same leading term, LT(f i ) = X 0. If f = c i f i with c i k satisfies LT(f) < X, then there are d i,j k so that f = i<j d i,js(f i, f j ). Proof Let LT(f i ) = a i X so that S(f i, f j ) = (/a i )f i (/a j )f j. The coefficient of X in f is zero by hypothesis, so c a + c s a s = 0. The proof is complete by rearranging the defining expression of f into S-polynomial terms: f = c f ( + c ) s f s ( ) = c a a f + + c s a s a s f s ( ) ( ) = c a a f a 2 f 2 + (c a + c 2 a 2 ) a 2 f 2 a 3 f 3 ( ) +(c a + c 2 a 2 + c 3 a 3 ) a 3 f 3 a 4 f 4 ( ) + + (c a + + c s a s ) a s f s a s f s ( ) +(c a + + c s a s ) a s f s since most terms cancel in the addition and the final c i a i factor is zero. Proof of Buchberger s criterion LT(f) for some i. We can write Let f I. We must show that LT(g i ) divides f = h g + + h s g s (2) but of course we do not have any bound on the leading terms on the right-hand side of (2). Define the largest such term to be X = max i {LM(h i g i ) : i =,..., s}. We can suppose that the expression (2) for f has been chosen so that this X is minimal (with respect to the monomial order) among leading terms appearing in such expressions. If X = LM(f) then we are done. So supposing not, we identify the worst offending terms: S X = {i {,..., s} : LM(h i g i ) = X}, and for i S X we write h i = c i X i + h i where c i k and X > LT(h i). 7

8 Define g = i S X c x (X i g i ). This has the same leading part as that of the expression (2), and that completely cancels out. So LM(g) < X although LM(X i g i ) = X for every i S. So by Lemma 29, g is really a k-linear combination of S-polynomials: there are d i,j k for which g = i,j S,i<j d i,j S(X i g i, X j g j ). The proof is almost complete, bar the calculation: these S-polynomials are almost S(g i, g j ), and indeed we check that they do reduce to zero under G; but then we can make an expression for f with smaller leading term X than (2), which contradicts the minimality of X. It is easy to see that ( S(X i g i, X j g j ) = X LCM(LM(g i ), LM(g j )) so that S(X i g i, X j g j ) = v h i,j,vg v for h i,j,v satisfying So we conclude that ) S(g i, g j ) max{lm(h i,j,v } = LM(S(X i g i, X j g j )) < X. v f = i S X h i g i + i/ S X h i g i = i S X (c i X i + h i)g i + = i S X c i X i g i + i S X h ig i + = i,j S X,i<j d i,j v S X h i,j,v g v = ( ) v S X i,j S X,i<j d i,jh i,j,v g v Now every expression p v g v on the right-hand side has leading term < X. So this is an expression f = q i g i with max i {LM(q i g i } < X, contradicting the minimality of (2). 5.2 Existence of Gröbner bases and Buchberger s algorithm Buchberger s criterion allows one to check whether a given finite set is a Gröbner basis, but it does not explain why an ideal should have a Gröbner basis. It is easy to see that how to use it to make an algorithm that computes a Gröbner basis from a given (finite) basis. Algorithm (Buchberger s algorithm) input I = (f,..., f s ) k[x] output Gröbner basis G I start H := {f,..., f s } repeat G := H P := {{f, g} : f, g H and f g} 8

9 for {f, g} P do h := S(f, g) H if h 0 then H := H {h} end if end for until H = G return G. The key point in the proof of this algorithm is its termination. As you must expect, this follows from Hilbert s basis theorem, and so we discuss that now. Finite generation and the ascending chain condition Let R be any ring and I R a non-zero ideal. Certainly I contains infinitely many non-zero elements, so we can make an infinite sequence (f, f 2,... ) = (f i ) i= of distinct f i I. Consider the ideals I j = (f,..., f j ) which form a chain of inclusions I I 2 I 3. Can one ever choose a sequence so that every inclusion in this chain is strict? Definition 30 Let R be a commutative ring. An ascending chain of ideals in R is a sequence of ideals I, I 2,... for which I I 2 I 3. An ascending chain is said to terminate if there is some K N for which I j = I K whenever j K. So an ascending chain that terminates looks like I I 2 I 3. I K I K = I K+ = I K+2 = and the inclusions I j I j+ for j < K may be strict or not. Example Just for the purposes of this exercise, imagine that the only ideals you work with are monomial ideals. We can try to make an ascending chain of monomial ideals I I 2 I 3 in k[x, y] where each inclusion is strict. Suppose we start with I = (x 4, x 3 y, x 2 y 3, xy 4, y 6 ). Only 4 monomials are not in I : namely, x, x 2, x 3, y, xy, x 2 y, y 2, xy 2, x 2 y 2, y 3, xy 3, y 4, y 5. (Drawing a picture of the exponents (i, j) N 2 of monomials x i y j makes this clear.) To make I 2 strictly bigger than I, we must include at least one of these missing monomials. Suppose we include xy 2, so that I 2 = (x 4, x 3 y, xy 2 x 2 y 3, xy 4, y 6 ) = (x 4, x 3 y, xy 2, y 6 ). 9

10 Only monomials are not in I 2 : namely, x, x 2, x 3, y, xy, x 2 y, y 2, y 3, y 4, y 5. To make I 3 strictly bigger than I 2, we must include at least one of these missing monomials. Suppose we include x 2, so that Only 8 monomials are not in I 3 : namely I 3 = (x 4, x 3 y, xy 2, y 6, x 2 ) = (x 2, xy 2, y 6 )., x, y, xy, y 2, y 3, y 4, y 5. And so we can continue. But, whatever choices we make for monomial to add, eventually we will make an ideal that contains all the monomials (and so is equal to k[x, y]) and cannot be enlarged at all. So we cannot make an infinite and strictly increasing chain of ideals: our chain of ideals terminates. Of course, we could have allowed ourselves to make steps I k = I k+ along the way that is allowed in the definition of ascending chain, after all. But that won t help: there has to come a point in the increasing chain I I 2 I 3 where the ideals stop increasing and are all equal any ascending chain of monomial ideals we build will terminate. Lemma 3 Let R be a ring. Statements (a) and (b) below are equivalent. (a) (b) Every ideal in R has a finite basis. Every ascending chain of ideals in R terminates. Proof Suppose that (a) holds and let I I 2 be an ascending chain of ideals in R. It is easy to check that the subset I = j= I j is an ideal of R. Let f,..., f s I be a basis of I, which exists by (a). Each f i must lie in some ideal of the chain, say f i I j(i). Of course, then f i I k whenever k j(i). In particular, if N = max{j(),..., j(s)} then every f i I N. So I N I N+ I I N, and therefore every inclusion in this chain is in fact equality. The converse is easy: if an ideal does not have a finite basis, then the ascending chain constructed as in the example above cannot terminate. Theorem 32 (Hilbert s Basis Theorem) If I k[x,..., x n ] is an ideal, then there are finitely many polynomials f,..., f s I so that I = (f,..., f s ). 0

11 Discussion in place of proof We will not prove this theorem there is a standard proof that could appear in several courses. But there is an interesting point for us that is often omitted. Imagine that this theorem was proved for monomial ideals: that result is called Dickson s Lemma, and a precise statement of it is if I k[x,..., x n ] be an ideal generated by a (possibly infinite) set of monomials A I, then there is a finite subset {m,..., m s } A so that I = (m,..., m s ). Theorem 32 follows from this at once. Given I, consider its ideal of leading terms LT(I). By definition, LT(I) is generated by the set of all LT(g) for g I. By Dickson s Lemma, it is generated by only finitely many of these monomials, LT(I) = (LT(g ),..., LT(g s ) for g,..., g s I. By construction, {g,..., g s } is a Gröbner basis for I, and so in particular it is a basis. One might expect a proof of Dickson s Lemma (see [Cox, Little, O Shea], for instance) to be easier that a proof of Hilbert s Basis Theorem. But in fact, the proofs are an almost identical induction on the number of variables working with leading terms of polynomials. It is not usually emphasised, but the usual proof of Theorem 32 does prove the existence of Gröbner bases for every ideal. Proof of Algorithm At every stage, the sets G, H, P are all finite, and so each operation can be carried out and the for-endfor loop is a finite loop. If at the end of the repeat-until loop, the two sets H and G are equal, then every S-polynomial between elements of H reduces to zero modulo H and so H (and therefore also G) is a Gröbner basis for the ideal it generates. Of course, that ideal is I because H contains the original basis f,..., f s of I, and every element h added to H was also in I. The only question is why does the repeat-until loop terminate. Define H to be the set H after one pass through this loop, H 2 to be the set H after two passes through this loop, and so on. If the loop does not terminate, then it generates a sequence of strict inclusions H H 2 H 3. Let I j be the ideal generated by {LT(h) : h H j }, and consider the ascending chain I I 2 I 3. I claim that I j I j+ is a strict inclusion for every j. Certainly there is some h H j+ \H j. Moreover, it arises from the algorithm as h = S(f, g) H j for some pair f, g H j. Certainly LT(h) I j+. But equally clearly LT(h) / I j for h is reduced with respect to H j by construction. We have constructed an ascending chain in I that does not terminate. By Lemma 3, this means that I does not have a finite basis. But that contradicts Hilbert s basis theorem. So our initial hypothesis that the repeat-until loop did not terminate was wrong.

12 Q.. Let I = (x 2, xy 2, y 3 ), an ideal in k[x, y]. Find an ascending chain I I 2 for which the first three inclusions are strict (that is, I I 2 I 3 I 4 ). Sketch your ideals in N 2, by plotting their exponents (i, j) for x i y j. Can you find an example for which I 4 k[x, y]? Q.2. Explain why a sequence of monomial ideals that starts with the ideal I = (x 2 y, y 4 ) in k[x, y] must terminate. (Note that there are infinitely many monomials not lying in this ideal, so the basic finiteness argument that forces termination in the previous example needs something extra.) Q.3. Follow the Buchberger algorithm step by step to compute Gröbner basis of the ideal I = (x 3 y, xy 2 ) k[x, y] with respect to the lex order with x > y. Compute the sequence of ideals generated by the leading terms of polynomials in the basis at each stage of the calculation. 2

5 The existence of Gröbner basis

5 The existence of Gröbner basis 5 The existence of Gröbner basis We use Buchberger s criterion from the previous section to give an algorithm that constructs a Gröbner basis of an ideal from any given set of generators Hilbert s Basis

More information

Gröbner Bases. eliminating the leading term Buchberger s criterion and algorithm. construct wavelet filters

Gröbner Bases. eliminating the leading term Buchberger s criterion and algorithm. construct wavelet filters Gröbner Bases 1 S-polynomials eliminating the leading term Buchberger s criterion and algorithm 2 Wavelet Design construct wavelet filters 3 Proof of the Buchberger Criterion two lemmas proof of the Buchberger

More information

Lecture 15: Algebraic Geometry II

Lecture 15: Algebraic Geometry II 6.859/15.083 Integer Programming and Combinatorial Optimization Fall 009 Today... Ideals in k[x] Properties of Gröbner bases Buchberger s algorithm Elimination theory The Weak Nullstellensatz 0/1-Integer

More information

MCS 563 Spring 2014 Analytic Symbolic Computation Monday 27 January. Gröbner bases

MCS 563 Spring 2014 Analytic Symbolic Computation Monday 27 January. Gröbner bases Gröbner bases In this lecture we introduce Buchberger s algorithm to compute a Gröbner basis for an ideal, following [2]. We sketch an application in filter design. Showing the termination of Buchberger

More information

On the minimal free resolution of a monomial ideal.

On the minimal free resolution of a monomial ideal. On the minimal free resolution of a monomial ideal. Caitlin M c Auley August 2012 Abstract Given a monomial ideal I in the polynomial ring S = k[x 1,..., x n ] over a field k, we construct a minimal free

More information

M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS

M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS (1) (a) Fix a monomial order. A finite subset G = {g 1,..., g m } of an ideal I k[x 1,..., x n ] is called a Gröbner basis if (LT(g

More information

Math 4370 Exam 1. Handed out March 9th 2010 Due March 18th 2010

Math 4370 Exam 1. Handed out March 9th 2010 Due March 18th 2010 Math 4370 Exam 1 Handed out March 9th 2010 Due March 18th 2010 Problem 1. Recall from problem 1.4.6.e in the book, that a generating set {f 1,..., f s } of I is minimal if I is not the ideal generated

More information

Polynomials, Ideals, and Gröbner Bases

Polynomials, Ideals, and Gröbner Bases Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields

More information

Problem Set 1 Solutions

Problem Set 1 Solutions Math 918 The Power of Monomial Ideals Problem Set 1 Solutions Due: Tuesday, February 16 (1) Let S = k[x 1,..., x n ] where k is a field. Fix a monomial order > σ on Z n 0. (a) Show that multideg(fg) =

More information

PREMUR Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications

PREMUR Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications PREMUR 2007 - Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications Day 1: Monomial Orders In class today, we introduced the definition of a monomial order in the polyomial

More information

S-Polynomials and Buchberger s Algorithm

S-Polynomials and Buchberger s Algorithm S-Polynomials and Buchberger s Algorithm J.M. Selig Faculty of Business London South Bank University, London SE1 0AA, UK 1 S-Polynomials As we have seen in previous talks one of the problems we encounter

More information

POLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada

POLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada THE TEACHING OF MATHEMATICS 2013, Vol. XVI, 1, pp. 22 28 POLYNOMIAL DIVISION AND GRÖBNER BASES Samira Zeada Abstract. Division in the ring of multivariate polynomials is usually not a part of the standard

More information

ABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n

ABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n ABSTRACT Title of Thesis: GRÖBNER BASES WITH APPLICATIONS IN GRAPH THEORY Degree candidate: Angela M. Hennessy Degree and year: Master of Arts, 2006 Thesis directed by: Professor Lawrence C. Washington

More information

Lecture 2: Gröbner Basis and SAGBI Basis

Lecture 2: Gröbner Basis and SAGBI Basis Lecture 2: Gröbner Basis and SAGBI Basis Mohammed Tessema Suppose we have a graph. Suppose we color the graph s vertices with 3 colors so that if the vertices are adjacent they are not the same colors.

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

2. Prime and Maximal Ideals

2. Prime and Maximal Ideals 18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let

More information

Lecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]

Lecture 1. (i,j) N 2 kx i y j, and this makes k[x, y] Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j

More information

Grobner Bases: Degree Bounds and Generic Ideals

Grobner Bases: Degree Bounds and Generic Ideals Clemson University TigerPrints All Dissertations Dissertations 8-2014 Grobner Bases: Degree Bounds and Generic Ideals Juliane Golubinski Capaverde Clemson University, julianegc@gmail.com Follow this and

More information

Lesson 14 Properties of Groebner Bases

Lesson 14 Properties of Groebner Bases Lesson 14 Properties of Groebner Bases I. Groebner Bases Yield Unique Remainders Theorem Let be a Groebner basis for an ideal, and let. Then there is a unique with the following properties (i) No term

More information

Groebner Bases and Applications

Groebner Bases and Applications Groebner Bases and Applications Robert Hines December 16, 2014 1 Groebner Bases In this section we define Groebner Bases and discuss some of their basic properties, following the exposition in chapter

More information

(II.B) Basis and dimension

(II.B) Basis and dimension (II.B) Basis and dimension How would you explain that a plane has two dimensions? Well, you can go in two independent directions, and no more. To make this idea precise, we formulate the DEFINITION 1.

More information

Abstract Algebra for Polynomial Operations. Maya Mohsin Ahmed

Abstract Algebra for Polynomial Operations. Maya Mohsin Ahmed Abstract Algebra for Polynomial Operations Maya Mohsin Ahmed c Maya Mohsin Ahmed 2009 ALL RIGHTS RESERVED To my students As we express our gratitude, we must never forget that the highest appreciation

More information

Gröbner Bases & their Computation

Gröbner Bases & their Computation Gröbner Bases & their Computation Definitions + First Results Priyank Kalla Associate Professor Electrical and Computer Engineering, University of Utah kalla@ece.utah.edu http://www.ece.utah.edu/~kalla

More information

GRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases

GRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.

More information

2. Intersection Multiplicities

2. Intersection Multiplicities 2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.

More information

A decoding algorithm for binary linear codes using Groebner bases

A decoding algorithm for binary linear codes using Groebner bases A decoding algorithm for binary linear codes using Groebner bases arxiv:1810.04536v1 [cs.it] 9 Oct 2018 Harinaivo ANDRIATAHINY (1) e-mail : hariandriatahiny@gmail.com Jean Jacques Ferdinand RANDRIAMIARAMPANAHY

More information

Counting Zeros over Finite Fields with Gröbner Bases

Counting Zeros over Finite Fields with Gröbner Bases Counting Zeros over Finite Fields with Gröbner Bases Sicun Gao May 17, 2009 Contents 1 Introduction 2 2 Finite Fields, Nullstellensatz and Gröbner Bases 5 2.1 Ideals, Varieties and Finite Fields........................

More information

8. Prime Factorization and Primary Decompositions

8. Prime Factorization and Primary Decompositions 70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings

More information

Math 418 Algebraic Geometry Notes

Math 418 Algebraic Geometry Notes Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R

More information

Gröbner bases for the polynomial ring with infinite variables and their applications

Gröbner bases for the polynomial ring with infinite variables and their applications Gröbner bases for the polynomial ring with infinite variables and their applications Kei-ichiro Iima and Yuji Yoshino Abstract We develop the theory of Gröbner bases for ideals in a polynomial ring with

More information

Gröbner Bases over a Dual Valuation Domain

Gröbner Bases over a Dual Valuation Domain International Journal of Algebra, Vol. 7, 2013, no. 11, 539-548 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.3550 Gröbner Bases over a Dual Valuation Domain André Saint Eudes Mialébama

More information

10. Smooth Varieties. 82 Andreas Gathmann

10. Smooth Varieties. 82 Andreas Gathmann 82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It

More information

Rewriting Polynomials

Rewriting Polynomials Rewriting Polynomials 1 Roots and Eigenvalues the companion matrix of a polynomial the ideal membership problem 2 Automatic Geometric Theorem Proving the circle theorem of Appolonius 3 The Division Algorithm

More information

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R. Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over

More information

12. Hilbert Polynomials and Bézout s Theorem

12. Hilbert Polynomials and Bézout s Theorem 12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of

More information

MATH 422, CSUSM. SPRING AITKEN

MATH 422, CSUSM. SPRING AITKEN CHAPTER 3 SUMMARY: THE INTEGERS Z (PART I) MATH 422, CSUSM. SPRING 2009. AITKEN 1. Introduction This is a summary of Chapter 3 from Number Systems (Math 378). The integers Z included the natural numbers

More information

Algebraic Varieties. Chapter Algebraic Varieties

Algebraic Varieties. Chapter Algebraic Varieties Chapter 12 Algebraic Varieties 12.1 Algebraic Varieties Let K be a field, n 1 a natural number, and let f 1,..., f m K[X 1,..., X n ] be polynomials with coefficients in K. Then V = {(a 1,..., a n ) :

More information

The F 4 Algorithm. Dylan Peifer. 9 May Cornell University

The F 4 Algorithm. Dylan Peifer. 9 May Cornell University The F 4 Algorithm Dylan Peifer Cornell University 9 May 2017 Gröbner Bases History Gröbner bases were introduced in 1965 in the PhD thesis of Bruno Buchberger under Wolfgang Gröbner. Buchberger s algorithm

More information

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................

More information

0. Introduction 1 0. INTRODUCTION

0. Introduction 1 0. INTRODUCTION 0. Introduction 1 0. INTRODUCTION In a very rough sketch we explain what algebraic geometry is about and what it can be used for. We stress the many correlations with other fields of research, such as

More information

8 Appendix: Polynomial Rings

8 Appendix: Polynomial Rings 8 Appendix: Polynomial Rings Throughout we suppose, unless otherwise specified, that R is a commutative ring. 8.1 (Largely) a reminder about polynomials A polynomial in the indeterminate X with coefficients

More information

9. Integral Ring Extensions

9. Integral Ring Extensions 80 Andreas Gathmann 9. Integral ing Extensions In this chapter we want to discuss a concept in commutative algebra that has its original motivation in algebra, but turns out to have surprisingly many applications

More information

ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.

ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add

More information

Computing Free Resolutions in Macaulay2

Computing Free Resolutions in Macaulay2 Computing Free Resolutions in Macaulay2 Madeline Brandt October 6, 2015 Introduction We will let R = k[x 1,..., x r ]. Definition 1. A free resolution of an R-module M is a complex F : F n φ n φ 1 F1 F0

More information

Computational Theory of Polynomial Ideals

Computational Theory of Polynomial Ideals Eidgenössische Technische Hochschule Zürich Computational Theory of Polynomial Ideals a Bachelor Thesis written by Paul Steinmann supervised by Prof. Dr. Richard Pink Abstract We provide methods to do

More information

Algebraic Geometry. Andreas Gathmann. Notes for a class. taught at the University of Kaiserslautern 2002/2003

Algebraic Geometry. Andreas Gathmann. Notes for a class. taught at the University of Kaiserslautern 2002/2003 Algebraic Geometry Andreas Gathmann Notes for a class taught at the University of Kaiserslautern 2002/2003 CONTENTS 0. Introduction 1 0.1. What is algebraic geometry? 1 0.2. Exercises 6 1. Affine varieties

More information

Summer Project. August 10, 2001

Summer Project. August 10, 2001 Summer Project Bhavana Nancherla David Drescher August 10, 2001 Over the summer we embarked on a brief introduction to various concepts in algebraic geometry. We used the text Ideals, Varieties, and Algorithms,

More information

Math 203A - Solution Set 1

Math 203A - Solution Set 1 Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in

More information

Reversely Well-Ordered Valuations on Polynomial Rings in Two Variables

Reversely Well-Ordered Valuations on Polynomial Rings in Two Variables Reversely Well-Ordered Valuations on Polynomial Rings in Two Variables Edward Mosteig Loyola Marymount University Los Angeles, California, USA Workshop on Valuations on Rational Function Fields Department

More information

1.2 Posets and Zorn s Lemma

1.2 Posets and Zorn s Lemma 1.2 Posets and Zorn s Lemma A set Σ is called partially ordered or a poset with respect to a relation if (i) (reflexivity) ( σ Σ) σ σ ; (ii) (antisymmetry) ( σ,τ Σ) σ τ σ = σ = τ ; 66 (iii) (transitivity)

More information

Math 145. Codimension

Math 145. Codimension Math 145. Codimension 1. Main result and some interesting examples In class we have seen that the dimension theory of an affine variety (irreducible!) is linked to the structure of the function field in

More information

MATH 631: ALGEBRAIC GEOMETRY: HOMEWORK 1 SOLUTIONS

MATH 631: ALGEBRAIC GEOMETRY: HOMEWORK 1 SOLUTIONS MATH 63: ALGEBRAIC GEOMETRY: HOMEWORK SOLUTIONS Problem. (a.) The (t + ) (t + ) minors m (A),..., m k (A) of an n m matrix A are polynomials in the entries of A, and m i (A) = 0 for all i =,..., k if and

More information

1 xa 2. 2 xan n. + c 2 x α 2

1 xa 2. 2 xan n. + c 2 x α 2 Operations Research Seminar: Gröbner Bases and Integer Programming Speaker: Adam Van Tuyl Introduction In this talk I will discuss how to use some of the tools of commutative algebra and algebraic geometry

More information

Page 23, part (c) of Exercise 5: Adapt the argument given at the end of the section should be Adapt the argument used for the circle x 2 +y 2 = 1

Page 23, part (c) of Exercise 5: Adapt the argument given at the end of the section should be Adapt the argument used for the circle x 2 +y 2 = 1 Ideals, Varieties and Algorithms, fourth edition Errata for the fourth edition as of August 6, 2018 Page 23, part (c) of Exercise 5: Adapt the argument given at the end of the section should be Adapt the

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 017/018 DR. ANTHONY BROWN. Lines and Their Equations.1. Slope of a Line and its y-intercept. In Euclidean geometry (where

More information

Coding Theory: A Gröbner Basis Approach

Coding Theory: A Gröbner Basis Approach Eindhoven University of Technology Department of Mathematics and Computer Science Coding Theory: A Gröbner Basis Approach Master s Thesis by D.W.C. Kuijsters Supervised by Dr. G.R. Pellikaan February 6,

More information

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

More information

Algorithms for Algebraic Geometry

Algorithms for Algebraic Geometry Chapter 2 Algorithms for Algebraic Geometry Outline: 1. Gröbner basics. 39 47 9 2. Algorithmic applications of Gröbner bases. 48 56 9 3. Resultants and Bézout s Theorem. 57 69 13 4. Solving equations with

More information

Math 203A - Solution Set 1

Math 203A - Solution Set 1 Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in

More information

Algebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014

Algebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014 Algebraic Geometry Andreas Gathmann Class Notes TU Kaiserslautern 2014 Contents 0. Introduction......................... 3 1. Affine Varieties........................ 9 2. The Zariski Topology......................

More information

Letterplace ideals and non-commutative Gröbner bases

Letterplace ideals and non-commutative Gröbner bases Letterplace ideals and non-commutative Gröbner bases Viktor Levandovskyy and Roberto La Scala (Bari) RWTH Aachen 13.7.09, NOCAS, Passau, Niederbayern La Scala, Levandovskyy (RWTH) Letterplace ideals 13.7.09

More information

18.S34 linear algebra problems (2007)

18.S34 linear algebra problems (2007) 18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction

More information

Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics

Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics Tan Tran Junior Major-Economics& Mathematics History Groebner bases were developed by Buchberger in 1965, who later named

More information

COMPLEX ALGEBRAIC SURFACES CLASS 9

COMPLEX ALGEBRAIC SURFACES CLASS 9 COMPLEX ALGEBRAIC SURFACES CLASS 9 RAVI VAKIL CONTENTS 1. Construction of Castelnuovo s contraction map 1 2. Ruled surfaces 3 (At the end of last lecture I discussed the Weak Factorization Theorem, Resolution

More information

MATH 497A: INTRODUCTION TO APPLIED ALGEBRAIC GEOMETRY

MATH 497A: INTRODUCTION TO APPLIED ALGEBRAIC GEOMETRY MATH 497A: INTRODUCTION TO APPLIED ALGEBRAIC GEOMETRY These are notes from the Penn State 2015 MASS course Introduction to Applied Algebraic Geometry. This class is taught by Jason Morton and the notes

More information

A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ

A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In

More information

f(x) = h(x)g(x) + r(x)

f(x) = h(x)g(x) + r(x) Monomial Orders. In the polynomial algebra over F a eld in one variable x; F [x], we can do long division (sometimes incorrectly called the Euclidean algorithm). If f(x) = a 0 + a x + ::: + a n x n 2 F

More information

Standard forms for writing numbers

Standard forms for writing numbers Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,

More information

3 The language of proof

3 The language of proof 3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;

More information

THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS. Contents

THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS. Contents THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS ALICE MARK Abstract. This paper is a simple summary of the first most basic definitions in Algebraic Geometry as they are presented in Dummit and Foote ([1]),

More information

Cosets and Lagrange s theorem

Cosets and Lagrange s theorem Cosets and Lagrange s theorem These are notes on cosets and Lagrange s theorem some of which may already have been lecturer. There are some questions for you included in the text. You should write the

More information

INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 14

INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 14 INTRODUCTION TO ALGEBRAIC GEOMETRY, CLASS 14 RAVI VAKIL Contents 1. Dimension 1 1.1. Last time 1 1.2. An algebraic definition of dimension. 3 1.3. Other facts that are not hard to prove 4 2. Non-singularity:

More information

e socle degrees 0 2: 1 1 4: 7 2 9: : : 12.

e socle degrees 0 2: 1 1 4: 7 2 9: : : 12. Socle degrees of Frobenius powers Lecture January 8, 26 talk by A. Kustin I will talk about recent joint work with Adela Vraciu. A preprint is available if you want all of the details. I will only talk

More information

Math 210B. Artin Rees and completions

Math 210B. Artin Rees and completions Math 210B. Artin Rees and completions 1. Definitions and an example Let A be a ring, I an ideal, and M an A-module. In class we defined the I-adic completion of M to be M = lim M/I n M. We will soon show

More information

10. Noether Normalization and Hilbert s Nullstellensatz

10. Noether Normalization and Hilbert s Nullstellensatz 10. Noether Normalization and Hilbert s Nullstellensatz 91 10. Noether Normalization and Hilbert s Nullstellensatz In the last chapter we have gained much understanding for integral and finite ring extensions.

More information

Proof Techniques (Review of Math 271)

Proof Techniques (Review of Math 271) Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

2 Systems of Linear Equations

2 Systems of Linear Equations 2 Systems of Linear Equations A system of equations of the form or is called a system of linear equations. x + 2y = 7 2x y = 4 5p 6q + r = 4 2p + 3q 5r = 7 6p q + 4r = 2 Definition. An equation involving

More information

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 2: HILBERT S NULLSTELLENSATZ. ANDREW SALCH 1. Hilbert s Nullstellensatz. The last lecture left off with the claim that, if J k[x 1,..., x n ] is an ideal, then

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #18 11/07/2013 As usual, all the rings we consider are commutative rings with an identity element. 18.1 Regular local rings Consider a local

More information

(and the Frobenius problem) - a gentle introduction

(and the Frobenius problem) - a gentle introduction GRÖBNER BASES (and the Frobenius problem) - a gentle introduction Niels Lauritzen c Niels Lauritzen 2004. NIELS LAURITZEN DEPARTMENT OF MATHEMATICAL SCIENCES UNIVERSITY OF AARHUS DK-8000 ÅRHUS C DENMARK

More information

Computing Minimal Polynomial of Matrices over Algebraic Extension Fields

Computing Minimal Polynomial of Matrices over Algebraic Extension Fields Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this

More information

9. Birational Maps and Blowing Up

9. Birational Maps and Blowing Up 72 Andreas Gathmann 9. Birational Maps and Blowing Up In the course of this class we have already seen many examples of varieties that are almost the same in the sense that they contain isomorphic dense

More information

Chapter 5. Number Theory. 5.1 Base b representations

Chapter 5. Number Theory. 5.1 Base b representations Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

More information

ADVANCED TOPICS IN ALGEBRAIC GEOMETRY

ADVANCED TOPICS IN ALGEBRAIC GEOMETRY ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of

More information

A brief introduction to computational algebraic geometry

A brief introduction to computational algebraic geometry A brief introduction to computational algebraic geometry Evan M. Bullock This is a collection of lecture notes and problem sets from MATH 499: VIGRE Computational Algebraic Geometry at Rice University

More information

Lecture 4 February 5

Lecture 4 February 5 Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 4 February 5 Lecturer: Lior Pachter Scribe/ Editor: Michaeel Kazi/ Cynthia Vinzant 4.1 Introduction to Gröbner Bases In this lecture

More information

Reid 5.2. Describe the irreducible components of V (J) for J = (y 2 x 4, x 2 2x 3 x 2 y + 2xy + y 2 y) in k[x, y, z]. Here k is algebraically closed.

Reid 5.2. Describe the irreducible components of V (J) for J = (y 2 x 4, x 2 2x 3 x 2 y + 2xy + y 2 y) in k[x, y, z]. Here k is algebraically closed. Reid 5.2. Describe the irreducible components of V (J) for J = (y 2 x 4, x 2 2x 3 x 2 y + 2xy + y 2 y) in k[x, y, z]. Here k is algebraically closed. Answer: Note that the first generator factors as (y

More information

COMPLEX ALGEBRAIC SURFACES CLASS 15

COMPLEX ALGEBRAIC SURFACES CLASS 15 COMPLEX ALGEBRAIC SURFACES CLASS 15 RAVI VAKIL CONTENTS 1. Every smooth cubic has 27 lines, and is the blow-up of P 2 at 6 points 1 1.1. An alternate approach 4 2. Castelnuovo s Theorem 5 We now know that

More information

CHAPTER 10: POLYNOMIALS (DRAFT)

CHAPTER 10: POLYNOMIALS (DRAFT) CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously

More information

Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore

Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore (Refer Slide Time: 00:15) Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore Lecture No. # 03 Mathematical Preliminaries:

More information

11. Dimension. 96 Andreas Gathmann

11. Dimension. 96 Andreas Gathmann 96 Andreas Gathmann 11. Dimension We have already met several situations in this course in which it seemed to be desirable to have a notion of dimension (of a variety, or more generally of a ring): for

More information

The Integers. Peter J. Kahn

The Integers. Peter J. Kahn Math 3040: Spring 2009 The Integers Peter J. Kahn Contents 1. The Basic Construction 1 2. Adding integers 6 3. Ordering integers 16 4. Multiplying integers 18 Before we begin the mathematics of this section,

More information

On the relation of the Mutant strategy and the Normal Selection strategy

On the relation of the Mutant strategy and the Normal Selection strategy On the relation of the Mutant strategy and the Normal Selection strategy Martin Albrecht 1 Carlos Cid 2 Jean-Charles Faugère 1 Ludovic Perret 1 1 SALSA Project -INRIA, UPMC, Univ Paris 06 2 Information

More information

Math 711: Lecture of September 7, Symbolic powers

Math 711: Lecture of September 7, Symbolic powers Math 711: Lecture of September 7, 2007 Symbolic powers We want to make a number of comments about the behavior of symbolic powers of prime ideals in Noetherian rings, and to give at least one example of

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 43

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 43 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 43 RAVI VAKIL CONTENTS 1. Facts we ll soon know about curves 1 1. FACTS WE LL SOON KNOW ABOUT CURVES We almost know enough to say a lot of interesting things about

More information

(dim Z j dim Z j 1 ) 1 j i

(dim Z j dim Z j 1 ) 1 j i Math 210B. Codimension 1. Main result and some interesting examples Let k be a field, and A a domain finitely generated k-algebra. In class we have seen that the dimension theory of A is linked to the

More information

A Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes.

A Harvard Sampler. Evan Chen. February 23, I crashed a few math classes at Harvard on February 21, Here are notes from the classes. A Harvard Sampler Evan Chen February 23, 2014 I crashed a few math classes at Harvard on February 21, 2014. Here are notes from the classes. 1 MATH 123: Algebra II In this lecture we will make two assumptions.

More information

5 + 9(10) + 3(100) + 0(1000) + 2(10000) =

5 + 9(10) + 3(100) + 0(1000) + 2(10000) = Chapter 5 Analyzing Algorithms So far we have been proving statements about databases, mathematics and arithmetic, or sequences of numbers. Though these types of statements are common in computer science,

More information

Linear Algebra, Summer 2011, pt. 2

Linear Algebra, Summer 2011, pt. 2 Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................

More information