Toric Ideals, an Introduction

Size: px
Start display at page:

Download "Toric Ideals, an Introduction"

Transcription

1 The 20th National School on Algebra: DISCRETE INVARIANTS IN COMMUTATIVE ALGEBRA AND IN ALGEBRAIC GEOMETRY Mangalia, Romania, September 2-8, 2012 Hara Charalambous Department of Mathematics Aristotle University of Thessalonike

2 Toric ideals Let A = {a 1,, a m } Z n We consider NA := {l 1 a l m a m l i N 0 } Let K be a field Definition The toric ideal I A associated to A is the kernel of the K-algebra homomorphism given by φ : K[x 1,, x m ] K[t 1,, t n, t 1 1 t 1 n ] where a i = (a i,1, a i,2,, a i,n ) φ(x i ) = t a i = t a i,1 1 t a i,2 2 t a i,n n,

3 Example Let A = {2, 1, 1} N φ : K[x 1, x 2, x 3 ] K[t] : x 1 t 2, x 2 t, x 3 t Some elements in the kernel of φ (ie I A ) are: x 1 x 2 2 I A, x 1 x 2 3 I A, x 2 x 3 I A, x 5 2 x 2 1 x 3 I A, etc It is not hard to prove that there are at least two minimal generating sets, (exercise) I A = (x 1 x 2 2, x 2 x 3 ) = (x 1 x 2 3, x 2 x 3 )

4 Example Let A = {(2, 1, 0), (1, 2, 0), (2, 0, 1), (1, 0, 2), (0, 2, 1), (0, 1, 2)} A φ : K[x 1, x 2, x 3, x 4, x 5, x 6 ] K[t 1, t 2, t 3 ] x 1 t 2 1 t 2, x 2 t 1 t 2 2, x 3 t 2 1 t 3, x 4 t 1 t 2 3, x 5 t 2 2 t 3, x 6 t 2 t 2 3 One can prove that I A = (x 1 x 6 x 2 x 4, x 1 x 6 x 3 x 5, x 2 2 x 3 x 2 1 x 5, x 2 x 2 3 x 2 1 x 4, x 1 x 2 5 x 2 2 x 6, x 1 x 2 4 x 2 3 x 6, x 2 4 x 5 x 3 x 2 6, x 1x 4 x 5 x 2 x 3 x 6, x 4 x 2 5 x 2x 2 6 ) Note that the sum of the first and sixth column equals the sum of the second and fourth column, (dependence relation among the columns)

5 Example Definitions A I A = (x 1 x 3 x 2 x 4 ) The columns of the matrix of A correspond to the edges of the following graph: I A is called the toric ideal of the graph

6 Example The corresponding graph is A The toric ideal is 0: I A = 0

7 Properties of toric ideals toric ideals are prime ideals (easy proof) toric ideals are generated by binomials (needs more work initial terms of polynomials) Does the converse hold? How do we compute toric ideals?

8 Grading and Toric ideals A = {a 1,, a m } Z n We grade the polynomial ring K[x 1,, x m ] by the semigroup NA: deg A (x i ) = a i, i = 1,, m For u = (u 1,, u m ) N m and x u := x u 1 1 x u m m deg A (x u ) := u 1 a u m a m NA we let Theorem The toric ideal I A is generated by all the binomials x u x v such that deg A (x u ) = deg A (x v ) If x u x v I A we define deg A (x u x v ) := deg A (x u )

9 Example Example Let A = {2, 1, 1} In φ : K[x 1, x 2, x 3 ] we set deg A (x 1 ) = 2, deg A (x 2 ) = deg A (x 1 ) = 1 I A = (x 1 x 2 2, x 2 x 3 ) deg A (x 1 x 2 2 ) = 2, deg A (x 2 x 3 ) = 1

10 Example Example A I A = (x 1 x 6 x 2 x 4, x 1 x 6 x 3 x 5, x 2 2 x 3 x 2 1 x 5, x 2 x 2 3 x 2 1 x 4, x 1 x 2 5 x 2 2 x 6, x 1 x 2 4 x 2 3 x 6, x 2 4 x 5 x 3 x 2 6, x 1x 4 x 5 x 2 x 3 x 6, x 4 x 2 5 x 2x 2 6 ) deg A (x 1 x 6 x 2 x 4 ) = (2, 2, 2)

11 Generators of Toric Ideals Remark Ịf u Z m then u = u + u where u +, u N m Recall that A = {a 1,, a m } We let π : Z m ZA where (u 1,, u m ) u 1 a u m a m If w, v N m and deg A (w) = deg A (w) then u = w v ker π Theorem I A = x u+ x u : u ker π

12 Example Example Let A = {2, 1, 1} We have seen that I A = (x 1 x 2 2, x 2 x 3 ) Let π : Z 3 ZA where u = (u 1, u 2, u 3 ) 2u 1 + u 2 + u 3 u = (1, 2, 0) ker π and u = (1, 0, 0) (0, 2, 0) Note that another way to get u is as the difference u = (3, 1, 2) (2, 3, 2) The corresponding binomials are x 1 x 2 2 and x 3 1 x 2 x 2 3 x 2 1 x 3 2 x 2 3 I A

13 Important binomials of I A primitive binomials circuit binomials binomials that belong to a reduced Grobner basis of I A binomials that belong to a minimal generating set of I A (Markov binomials) indispensable binomials that belong to all generating sets of I A

14 Graver basis Definition An irreducible binomial x u+ x u I A is called primitive if there exists no other binomial x v+ x v I A such that x v+ divides x u+ and x v divides x u The set of all primitive binomials of a toric ideal I A is called the Graver basis of I A Example We have seen that I = (x 1 x2 2, x 2 x 3 ) is the toric ideal corresponding to A = {2, 1, 1} All elements of the minimal generating set of I are primitive x 2 5 x 1 2x 3 I is not primitive since x2 2 x 1 I

15 Circuits and supp(x u ) := {i x i divides x u } supp(x u x v ) := supp(x u ) supp(x v ) Definition An irreducible binomial B I A is called a circuit if there is no binomial B I A such that supp(b ) supp(b) No two circuits can have the same support, (why?)

16 Example Example A = {1, 2, 4} Then I A = (x1 2 x 2, x1 4 x 3, x2 2 x 3) All 3 elements of this generating set of I A are circuits: supp(x 2 1 x 2) = {1, 2}, supp(x 4 1 x 3) = {1, 3}, supp(x 2 2 x 3) = {2, 3} All 3 elements of this generating set of I A are primitive The element x 3 x1 2x 2 is primitive but is not a circuit

17 Circuits and Primitive binomials What is the relation between Circuits and Primitive binomials? Theorem (B Sturmfels) Circuits are primitive Theorem (B Sturmfels) The set of circuits of I A generate up to radical I A

18 Review on Monomial Orders By T n we denote the set of monomials x a in k[x 1,, x n ], where x a = x a 1 1 x a 2 2 x a n n and a = (a 1, a 2,, a n ) Definition By a monomial order on T n we mean a total order on T n such that 1 < x a for all x a T n with x a 1 If x a < x b then x a x c < x b x c for all x c T n If n 2 then there are infinitely many monomial orders on T n

19 Review on leading monomials: initial terms Let < be a monomial order on k[x 1,, x n ] Let f be a nonzero polynomial in k[x 1,, x n ] We may write f = a 1 x u 1 + a 2 x u 2 + a r x ur, where a i 0 and x u 1 > x u 2 > > x u r If a 1 = 1 we call f monic Definition For f 0 in k[x 1,, x n ], we define the leading monomial of f to be in < (f ) = x u 1

20 Proof that I A is generated by binomials A = {a 1,, a m }, φ : K[x 1,, x m ] K[t 1,, t n, t1 1 tn 1 ], f (x 1,, x m ) f (t a 1,, t a m ) We will show that I A = x u x v : deg A (x u ) = deg A (x v ) Sketch of Proof One direction (RHS LHS) is clear For the other containment fix a monomial order < If LHS RHS, find f I A, f monic, f RHS Choose f so that in < (f ) = x u is minimal among all elements with this property Since f is in I A = ker φ, f must have at least one other term x v, whose image will cancel the image of x u ( so that deg A (x u ) = deg A (x v )) But then f (x u x v ) I A and this gives a contradiction, (why?)

21 Review: Grobner bases Definition A set of non-zero polynomials G = {g 1,, g t } contained in an ideal I, is called Grobner basis for I if and only if for all nonzero f I there exists i {1,, t} such that in < (g i ) divides in < (f ) For any nonzero ideal I and for any term order there exists a Grobner basis for I There are infinitely many Grobner bases for I

22 Reduced Grobner bases Definition A Grobner basis G = {g 1,, g t } is called a reduced Grobner basis for I if The polynomials g i are monic for i {1,, t} and no monomial of g i is divisible by any in < (g j ) for any j i Theorem (Buchberger) Let < be a monomial order on k[x 1,, x n ] and I a nonzero ideal Then I has a unique reduced Grobner basis with respect to the monomial order <

23 Reduced Grobner bases of toric ideals Theorem Let I be a toric ideal and < a monomial order on the underlying ring The reduced Grobner basis of I consists of binomials (Buchberger s algorithm applied to a binomial generating set of I )

24 How to compute a binomial generating set of I A Usually one starts with the generators of an ideal and then finds a Grobner basis of it For the task in question we work in the opposite direction! Suppose that A = {a 1,, a m } N n Consider the ideal J in K[t 1,, t n, x 1,, x m ]: J = x 1 t a 1,, x m t a m Lemma Let φ : K[x 1,, x m ] K[t 1,, t n ] given by x i t a i = t a i,1 1 t a i,2 2 t a i,n n for i = 1, m Then Sketch of proof I A = ker φ = J K[x 1,, x m ]

25 How to compute a binomial generating set of I A ker φ = x 1 t a 1,, x m t am K[x 1,, x m ] (one direction: inclusion RHS to LHS) Let f be an element on the RHS of the equality Then f (x 1,, x m ) = m (x i t a i )h i (t 1,, t n, x 1,, x m ) i=1 We see that f (t a 1,, t a m ) = 0 and f ker φ = I A

26 How to compute a binomial generating set of I A ker φ = x 1 t a 1,, x m t am K[x 1,, x m ] (Other direction: LHS inside the RHS) Let g(x 1,, x m ) = u c ux 1 u1 x m u m ker φ Then g(t a 1,, t am ) = u c ut u 1a1 t umam = 0 Thus in K[t 1,, t n, x 1,, x n ] g(x 1,, x m ) = g(x 1,, x m ) g(t a 1,, t a m ) = u1 u c u (x 1 x m m t u 1a1 t umam ) J u

27 How to compute a binomial generating set of I A Theorem Consider an elimination monomial order in K[t 1,, t n, x 1,, x m ], with t 1,, t n all greater than x 1,, x m Let G be the reduced Grobner basis of J in K[t 1,, t n, x 1,, x m ] Then G K[x 1,, x m ] is a Grobner basis of J K[x 1,, x m ] = I A The above gives the algorithm for finding a reduced Grobner basis of I A when A N n This is a generating set of I A Exercise Find an algorithm to compute I A when A Z n

28 Initial ideals Definition The Universal Grobner basis of an ideal I is the union of all reduced Grobner bases Is this set finite? Let < be a monomial order on k[x 1,, x n ] and I a nonzero ideal The initial ideal of ideal of I is the monomial ideal generated by the leading monomials of any polynomial of I Theorem Let I be a nonzero ideal of k[x 1,, x n ] Then I has finitely many distinct initial ideals

29 Universal Grobner basis of a toric ideal Theorem ( Weispfenning, N Schwartz) The universal Grobner basis of any ideal I is a finite set Let I A be a toric ideal Theorem Ṭhe universal Grobner basis of I A is a finite set of binomials The universal Grobner basis is a finite subset of I A and is a Grobner basis for I A with respect to all term orders simultaneously

30 Circuits, Universal Grobner bases and Primitive polynomials Let UGB A denote the Universal Grobner basis of A Theorem (Sturmfels) For any toric ideal I A the following containments hold: Circuits A UGB A Graver A

31 B Sturmfels, Grobner bases and Convex Polytopes, University Lecture Series, Vol 8, AMS (1995) B Sturmfels, Equations defining toric varieties, Algebraic Geometry - Santa Cruz 1995, Proc Sympos Pure Math, 62, Part 2, Amer Math Soc, Providence, RI, 1997, pp

arxiv:math/ v1 [math.ac] 11 Jul 2006

arxiv:math/ v1 [math.ac] 11 Jul 2006 arxiv:math/0607249v1 [math.ac] 11 Jul 2006 MINIMAL SYSTEMS OF BINOMIAL GENERATORS AND THE INDISPENSABLE COMPLEX OF A TORIC IDEAL HARA CHARALAMBOUS, ANARGYROS KATSABEKIS, AND APOSTOLOS THOMA Abstract. Let

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

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792

A finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792 Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838

More information

AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS

AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS AN INTRODUCTION TO AFFINE TORIC VARIETIES: EMBEDDINGS AND IDEALS JESSICA SIDMAN. Affine toric varieties: from lattice points to monomial mappings In this chapter we introduce toric varieties embedded in

More information

Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg

Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg Total binomial decomposition (TBD) Thomas Kahle Otto-von-Guericke Universität Magdeburg Setup Let k be a field. For computations we use k = Q. k[p] := k[p 1,..., p n ] the polynomial ring in n indeterminates

More information

Commuting birth-and-death processes

Commuting birth-and-death processes Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death

More information

Binomial Ideals from Graphs

Binomial Ideals from Graphs Binomial Ideals from Graphs Danielle Farrar University of Washington Yolanda Manzano St. Mary s University Juan Manuel Torres-Acevedo University of Puerto Rico Humacao August 10, 2000 Abstract This paper

More information

MATH 326: RINGS AND MODULES STEFAN GILLE

MATH 326: RINGS AND MODULES STEFAN GILLE MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called

More information

Lecture 7.3: Ring homomorphisms

Lecture 7.3: Ring homomorphisms Lecture 7.3: Ring homomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 7.3:

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

Toric ideals finitely generated up to symmetry

Toric ideals finitely generated up to symmetry Toric ideals finitely generated up to symmetry Anton Leykin Georgia Tech MOCCA, Levico Terme, September 2014 based on [arxiv:1306.0828] Noetherianity for infinite-dimensional toric varieties (with Jan

More information

The universal Gröbner basis of a binomial edge ideal

The universal Gröbner basis of a binomial edge ideal The universal Gröbner basis of a binomial edge ideal Mourtadha Badiane Isaac Burke Emil Sköldberg National University of Ireland, Galway Galway, Ireland {m.badiane1,i.burke1,emil.skoldberg}@nuigalway.ie

More information

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35

Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime

More information

A Saturation Algorithm for Homogeneous Binomial Ideals

A Saturation Algorithm for Homogeneous Binomial Ideals A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh and Shashank K Mehta Indian Institute of Technology, Kanpur - 208016, India, {deepkesh,skmehta}@cse.iitk.ac.in Abstract. Let k[x 1,...,

More information

arxiv: v1 [math.ac] 11 Dec 2013

arxiv: v1 [math.ac] 11 Dec 2013 A KOSZUL FILTRATION FOR THE SECOND SQUAREFREE VERONESE SUBRING arxiv:1312.3076v1 [math.ac] 11 Dec 2013 TAKAYUKI HIBI, AYESHA ASLOOB QURESHI AND AKIHIRO SHIKAMA Abstract. The second squarefree Veronese

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

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

Binomial Exercises A = 1 1 and 1

Binomial Exercises A = 1 1 and 1 Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.

More information

On intersections of complete intersection ideals

On intersections of complete intersection ideals On intersections of complete intersection ideals Mircea Cimpoeaş I.M.A.R. mircea.cimpoeas@imar.ro joint work with Dumitru Stamate July 7, 2016, I.M.N.S., Levico Terme, Italy Overview 1 Introduction 2 Main

More information

Ideals and graphs, Gröbner bases and decision procedures in graphs

Ideals and graphs, Gröbner bases and decision procedures in graphs Ideals and graphs, Gröbner bases and decision procedures in graphs GIUSEPPA CARRA FERRO and DANIELA FERRARELLO Department of Mathematics and Computer Science University of Catania Viale Andrea Doria 6,

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

T. Hibi Binomial ideals arising from combinatorics

T. Hibi Binomial ideals arising from combinatorics T. Hibi Binomial ideals arising from combinatorics lecture notes written by Filip Rupniewski (email: frupniewski@impan.pl) Binomial Ideals conference 3-9 September 207, Łukęcin, Poland Lecture Let S =

More information

Math 121 Homework 2 Solutions

Math 121 Homework 2 Solutions Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.

More information

Polynomials over UFD s

Polynomials over UFD s Polynomials over UFD s Let R be a UFD and let K be the field of fractions of R. Our goal is to compare arithmetic in the rings R[x] and K[x]. We introduce the following notion. Definition 1. A non-constant

More information

MATH 690 NOTES. 1. Associated graded rings

MATH 690 NOTES. 1. Associated graded rings MATH 690 NOTES 1. Associated graded rings Question 1.1. Let G = k[g 1 ] = n 0 G n be a one-dimensional standard graded ring over the field k = G 0. What are necessary and sufficient conditions in order

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

arxiv: v2 [math.ac] 24 Jun 2014

arxiv: v2 [math.ac] 24 Jun 2014 Hilbert-Samuel Multiplicity of a Bipartite Graph arxiv:1406.2603v2 [math.ac] 24 Jun 2014 Abstract Priya Das 1, Himadri Mukherjee IISER Kolkata, Mohanpur Campus Let G be a bipartite graph and I(G the toric

More information

DIRAC S THEOREM ON CHORDAL GRAPHS

DIRAC S THEOREM ON CHORDAL GRAPHS Seminar Series in Mathematics: Algebra 200, 1 7 DIRAC S THEOREM ON CHORDAL GRAPHS Let G be a finite graph. Definition 1. The graph G is called chordal, if each cycle of length has a chord. Theorem 2 (Dirac).

More information

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12 MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f

More information

φ(xy) = (xy) n = x n y n = φ(x)φ(y)

φ(xy) = (xy) n = x n y n = φ(x)φ(y) Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

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

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

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

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

Homogeneous Coordinate Ring

Homogeneous Coordinate Ring Students: Kaiserslautern University Algebraic Group June 14, 2013 Outline Quotients in Algebraic Geometry 1 Quotients in Algebraic Geometry 2 3 4 Outline Quotients in Algebraic Geometry 1 Quotients in

More information

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille

Math 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is

More information

Toric Fiber Products

Toric Fiber Products Toric Fiber Products Seth Sullivant North Carolina State University June 8, 2011 Seth Sullivant (NCSU) Toric Fiber Products June 8, 2011 1 / 26 Families of Ideals Parametrized by Graphs Let G be a finite

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

1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism

1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism 1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials

More information

TROPICAL SCHEME THEORY

TROPICAL SCHEME THEORY TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),

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

HILBERT BASIS OF THE LIPMAN SEMIGROUP

HILBERT BASIS OF THE LIPMAN SEMIGROUP Available at: http://publications.ictp.it IC/2010/061 United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL

More information

Solutions of exercise sheet 8

Solutions of exercise sheet 8 D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra

More information

Factorization in Polynomial Rings

Factorization in Polynomial Rings Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,

More information

NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

More information

Lecture 7: Polynomial rings

Lecture 7: Polynomial rings Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules

More information

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and

CHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)

More information

A degree bound for codimension two lattice ideals

A degree bound for codimension two lattice ideals Journal of Pure and Applied Algebra 18 (003) 01 07 www.elsevier.com/locate/jpaa A degree bound for codimension two lattice ideals Leah H. Gold Department of Mathematics, Texas A& M University, College

More information

CHARACTERIZATION OF GORENSTEIN STRONGLY KOSZUL HIBI RINGS BY F-INVARIANTS

CHARACTERIZATION OF GORENSTEIN STRONGLY KOSZUL HIBI RINGS BY F-INVARIANTS CHARACTERIZATION OF GORENSTEIN STRONGLY KOSZUL HIBI RINGS BY F-INVARIANTS KAZUNORI MATSUDA Abstract. Hibi rings are a kind of graded toric ring on a finite distributive lattice D = J(P ), where P is a

More information

MT5836 Galois Theory MRQ

MT5836 Galois Theory MRQ MT5836 Galois Theory MRQ May 3, 2017 Contents Introduction 3 Structure of the lecture course............................... 4 Recommended texts..................................... 4 1 Rings, Fields and

More information

MONOMIAL IDEALS WHOSE POWERS HAVE A LINEAR RESOLUTION

MONOMIAL IDEALS WHOSE POWERS HAVE A LINEAR RESOLUTION MATH. SCAND. 95 (2004), 23 32 MONOMIAL IDEALS WHOSE POWERS HAVE A LINEAR RESOLUTION JÜRGEN HERZOG, TAKAYUKI HIBI and XINXIAN ZHENG Introduction In this paper we consider graded ideals in a polynomial ring

More information

Factorization of integer-valued polynomials with square-free denominator

Factorization of integer-valued polynomials with square-free denominator accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday

More information

MCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals

MCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals

More information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information

School of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon

More information

FINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN

FINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN FINITELY GENERATED SIMPLE ALGEBRAS: A QUESTION OF B. I. PLOTKIN A. I. LICHTMAN AND D. S. PASSMAN Abstract. In his recent series of lectures, Prof. B. I. Plotkin discussed geometrical properties of the

More information

Gröbner bases of nested configurations arxiv: v1 [math.ac] 7 Jan 2008

Gröbner bases of nested configurations arxiv: v1 [math.ac] 7 Jan 2008 Gröbner bases of nested configurations arxiv:080.099v [math.ac] 7 Jan 008 Satoshi Aoki, Takayuki Hibi, Hidefumi Ohsugi and Akimichi Takemura Abstract In this paper we introduce a new and large family of

More information

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 4: MORE ABOUT VARIETIES AND REGULAR FUNCTIONS.

ALGEBRAIC GEOMETRY COURSE NOTES, LECTURE 4: MORE ABOUT VARIETIES AND REGULAR FUNCTIONS. ALGERAIC GEOMETRY COURSE NOTES, LECTURE 4: MORE AOUT VARIETIES AND REGULAR FUNCTIONS. ANDREW SALCH. More about some claims from the last lecture. Perhaps you have noticed by now that the Zariski topology

More information

Depth of some square free monomial ideals

Depth of some square free monomial ideals Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 1, 2013, 117 124 Depth of some square free monomial ideals by Dorin Popescu and Andrei Zarojanu Dedicated to the memory of Nicolae Popescu (1937-2010)

More information

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0

More information

A Study of Edge Toric Ideals using Associated Graphs. Yingyi Shen. Mentor: Sonja Mapes

A Study of Edge Toric Ideals using Associated Graphs. Yingyi Shen. Mentor: Sonja Mapes A Study of Edge Toric Ideals using Associated Graphs Yingyi Shen Mentor: Sonja Mapes Submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in the Trinity College of

More information

Math 210B:Algebra, Homework 2

Math 210B:Algebra, Homework 2 Math 210B:Algebra, Homework 2 Ian Coley January 21, 2014 Problem 1. Is f = 2X 5 6X + 6 irreducible in Z[X], (S 1 Z)[X], for S = {2 n, n 0}, Q[X], R[X], C[X]? To begin, note that 2 divides all coefficients

More information

Section V.6. Separability

Section V.6. Separability V.6. Separability 1 Section V.6. Separability Note. Recall that in Definition V.3.10, an extension field F is a separable extension of K if every element of F is algebraic over K and every root of the

More information

D-MATH Algebra I HS17 Prof. Emmanuel Kowalski. Solution 12. Algebraic closure, splitting field

D-MATH Algebra I HS17 Prof. Emmanuel Kowalski. Solution 12. Algebraic closure, splitting field D-MATH Algebra I HS17 Prof. Emmanuel Kowalski Solution 1 Algebraic closure, splitting field 1. Let K be a field of characteristic and L/K a field extension of degree. Show that there exists α L such that

More information

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

Handout - Algebra Review

Handout - Algebra Review Algebraic Geometry Instructor: Mohamed Omar Handout - Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much

More information

A Generalization of Boolean Rings

A Generalization of Boolean Rings A Generalization of Boolean Rings Adil Yaqub Abstract: A Boolean ring satisfies the identity x 2 = x which, of course, implies the identity x 2 y xy 2 = 0. With this as motivation, we define a subboolean

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

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

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

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 31, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Symbolic Adjunction of Roots When dealing with subfields of C it is easy to

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

arxiv: v1 [math.co] 17 Jul 2007

arxiv: v1 [math.co] 17 Jul 2007 arxiv:0707.2591v1 [math.co] 17 Jul 2007 An Elementary Proof of the Fundamental Theorem of Tropical Algebra Nathan Grigg Nathan Manwaring May 22, 2018 Abstract In this paper we give an elementary proof

More information

Math 121 Homework 3 Solutions

Math 121 Homework 3 Solutions Math 121 Homework 3 Solutions Problem 13.4 #6. Let K 1 and K 2 be finite extensions of F in the field K, and assume that both are splitting fields over F. (a) Prove that their composite K 1 K 2 is a splitting

More information

Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra

Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra Susan M. Hermiller Department of Mathematics and Statistics University of Nebraska-Lincoln Lincoln, NE

More information

Math 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d

Math 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).

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

Extension theorems for homomorphisms

Extension theorems for homomorphisms Algebraic Geometry Fall 2009 Extension theorems for homomorphisms In this note, we prove some extension theorems for homomorphisms from rings to algebraically closed fields. The prototype is the following

More information

arxiv: v1 [math.ac] 6 Jan 2019

arxiv: v1 [math.ac] 6 Jan 2019 GORENSTEIN T-SPREAD VERONESE ALGEBRAS RODICA DINU arxiv:1901.01561v1 [math.ac] 6 Jan 2019 Abstract. In this paper we characterize the Gorenstein t-spread Veronese algebras. Introduction Let K be a field

More information

CHEVALLEY S THEOREM AND COMPLETE VARIETIES

CHEVALLEY S THEOREM AND COMPLETE VARIETIES CHEVALLEY S THEOREM AND COMPLETE VARIETIES BRIAN OSSERMAN In this note, we introduce the concept which plays the role of compactness for varieties completeness. We prove that completeness can be characterized

More information

Math 581 Problem Set 3 Solutions

Math 581 Problem Set 3 Solutions Math 581 Problem Set 3 Solutions 1. Prove that complex conjugation is a isomorphism from C to C. Proof: First we prove that it is a homomorphism. Define : C C by (z) = z. Note that (1) = 1. The other properties

More information

be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism

be any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism 21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore

More information

FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.

FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0

More information

Toric Varieties in Statistics

Toric Varieties in Statistics Toric Varieties in Statistics Daniel Irving Bernstein and Seth Sullivant North Carolina State University dibernst@ncsu.edu http://www4.ncsu.edu/~dibernst/ http://arxiv.org/abs/50.063 http://arxiv.org/abs/508.0546

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

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains

D-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.

More information

Distance-reducing Markov bases for sampling from a discrete sample space

Distance-reducing Markov bases for sampling from a discrete sample space Bernoulli 11(5), 2005, 793 813 Distance-reducing Markov bases for sampling from a discrete sample space AKIMICHI TAKEMURA* and SATOSHI AOKI** Department of Mathematical Informatics, Graduate School of

More information

Algebraic Models in Different Fields

Algebraic Models in Different Fields Applied Mathematical Sciences, Vol. 8, 2014, no. 167, 8345-8351 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.411922 Algebraic Models in Different Fields Gaetana Restuccia University

More information

Spring 2016, lecture notes by Maksym Fedorchuk 51

Spring 2016, lecture notes by Maksym Fedorchuk 51 Spring 2016, lecture notes by Maksym Fedorchuk 51 10.2. Problem Set 2 Solution Problem. Prove the following statements. (1) The nilradical of a ring R is the intersection of all prime ideals of R. (2)

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

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

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman

Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Integral Domains and Fraction Fields 0.1.1 Theorems Now what we are going

More information

Math 203A - Solution Set 3

Math 203A - Solution Set 3 Math 03A - Solution Set 3 Problem 1 Which of the following algebraic sets are isomorphic: (i) A 1 (ii) Z(xy) A (iii) Z(x + y ) A (iv) Z(x y 5 ) A (v) Z(y x, z x 3 ) A Answer: We claim that (i) and (v)

More information

GENERIC LATTICE IDEALS

GENERIC LATTICE IDEALS JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 11, Number 2, April 1998, Pages 363 373 S 0894-0347(98)00255-0 GENERIC LATTICE IDEALS IRENA PEEVA AND BERND STURMFELS I. Introduction Let S = k[x 1,...,x

More information

ALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes!

ALGEBRAIC GROUPS. Disclaimer: There are millions of errors in these notes! ALGEBRAIC GROUPS Disclaimer: There are millions of errors in these notes! 1. Some algebraic geometry The subject of algebraic groups depends on the interaction between algebraic geometry and group theory.

More information

Generalized Alexander duality and applications. Osaka Journal of Mathematics. 38(2) P.469-P.485

Generalized Alexander duality and applications. Osaka Journal of Mathematics. 38(2) P.469-P.485 Title Generalized Alexander duality and applications Author(s) Romer, Tim Citation Osaka Journal of Mathematics. 38(2) P.469-P.485 Issue Date 2001-06 Text Version publisher URL https://doi.org/10.18910/4757

More information

DIANE MACLAGAN. Abstract. The main result of this paper is that all antichains are. One natural generalization to more abstract posets is shown to be

DIANE MACLAGAN. Abstract. The main result of this paper is that all antichains are. One natural generalization to more abstract posets is shown to be ANTICHAINS OF MONOMIAL IDEALS ARE FINITE DIANE MACLAGAN Abstract. The main result of this paper is that all antichains are finite in the poset of monomial ideals in a polynomial ring, ordered by inclusion.

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

Integral Extensions. Chapter Integral Elements Definitions and Comments Lemma

Integral Extensions. Chapter Integral Elements Definitions and Comments Lemma Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients

More information

Polynomial Rings. i=0. i=0. n+m. i=0. k=0

Polynomial Rings. i=0. i=0. n+m. i=0. k=0 Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients

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