Gröbner bases talk at the ACAGM Summer School Leuven p. 1
|
|
- Kristopher Beasley
- 7 years ago
- Views:
Transcription
1 Gröbner bases talk at the ACAGM Summer School Leuven p. 1 Gröbner bases talk at the ACAGM Summer School Leuven Hans Schönemann hannes@mathematik.uni-kl.de Department of Mathematics University of Kaiserslautern
2 Gröbner bases talk at the ACAGM Summer School Leuven p. 2 Motivation solving the ideal membership problem for polynomial rings computing the Hilbert function, dimension, etc. for ideal in polynomial rings solving of polynomial equations
3 Gröbner bases talk at the ACAGM Summer School Leuven p. 3 What is a Gröbner basis? Let K be a field, R = K[x] the ring polynomials over K with indeterminants x 1,...,x n. Ideal generated by f 1,...,f k : I := f 1,...,f k = { k h i f i,h i polynomials } i=1
4 Gröbner bases talk at the ACAGM Summer School Leuven p. 3 What is a Gröbner basis? Let K be a field, R = K[x] the ring polynomials over K with indeterminants x 1,...,x n. Ideal generated by f 1,...,f k : I := f 1,...,f k = { k h i f i,h i polynomials } i=1 G = {g 1,...,g s } is a Gröbner basis of I, if f I NF(f G) = 0
5 Gröbner bases talk at the ACAGM Summer School Leuven p. 4 The Geometry-Algebra Dictionary Ideals in Polynomial Rings We always work over a field K. Consider the polynomial ring R = K[x 1,...,x n ]. If T R is any subset, all linear combinations g 1 f 1 + +g r f r, with g 1,...g r R and f r T, form an ideal T of R, called the ideal generated by T. We also say that T is a set of generators for the ideal. Hilbert s Basis Theorem Every ideal of the polynomial ring K[x 1,...,x n ] has a finite set of generators.
6 Gröbner bases talk at the ACAGM Summer School Leuven p. 5 The Geometry-Algebra Dictionary Algebraic Sets I The affine n-space over K is the set A n (K) = { (a 1,...,a n ) a 1,...,a n K }. Definition. If T R is any set of polynomials, its vanishing locus in A n (K) is the set V(T) = {p A n (K) f(p) = 0 for all f T}. Every such set is called an affine algebraic set. The vanishing locus of a subset T R coincides with that of the ideal T generated by T. So every algebraic set in A n (K) is of type V(I) for some ideal I of R. By Hilbert s basis theorem, it is the vanishing locus of a set of finitely many polynomials.
7 Gröbner bases talk at the ACAGM Summer School Leuven p. 6 The Geometry-Algebra Dictionary Algebraic Sets II The vanishing locus of a single non-constant polynomial is called a hypersurface of A n (K). According to our definitions, every algebraic set is the intersection of finitely many hypersurfaces. Example. The twisted cubic curve in A 3 (R) is obtained by intersecting the hypersurfaces V(y x 2 ) and V(xy z):
8 Gröbner bases talk at the ACAGM Summer School Leuven p. 7 The Geometry-Algebra Dictionary Algebraic Sets III Taking vanishing loci defines a map V which sends sets of polynomials to algebraic sets. We summarize the properties of V : Proposition. (i) The map V reverses inclusions: If I J are subsets of R, then V(I) V(J). (ii) Affine space and the empty set are algebraic: V(0) = A n (K). V(1) =. (iii) The union of finitely many algebraic sets is algebraic: If I 1,...,I s are ideals of R, then s k=1 V(I k ) = V( s k=1 I k ).
9 Gröbner bases talk at the ACAGM Summer School Leuven p. 8 The Geometry-Algebra Dictionary Algebraic Sets IV (iv) The intersection of any family of algebraic sets is algebraic: If {I λ } is a family of ideals of R, then V(I λ ) = V λ ( ) I λ. (v) A single point is algebraic: If a 1,...,a n K, then V(x 1 a 1,...,x n a n ) = {(a 1,...,a n )}. λ Computational Problem intersections. Give an algorithm for computing ideal
10 Gröbner bases talk at the ACAGM Summer School Leuven p. 9 Gröbner Bases The key idea behind Gröbner bases is to reduce problems concerning arbitrary ideals in polynomial rings to problems concerning monomial ideals.
11 Gröbner bases talk at the ACAGM Summer School Leuven p. 10 Monomial ordering monomial ordering (term ordering) on K[x 1,...,x n ]: a total ordering < on {x α α N n } with x α < x β implies x γ x α < x γ x β for any γ N n. wellordering: 1 is the smallest monomial. Let a 1,...,a k be the rows of A GL(n,R), then x α < x β if and only if there is an i with a j α = a j β for j < i and a i α < a i β. degree ordering: given by a matrix with coefficients of the first row either all positive or all negative. L(g) leading monomial, c(g) the coefficient of L(g) in g, g = c(g)l(g) + smaller terms with respect to <. elimination ordering for x r+1,...,x n : L(g) K[x 1,...,x r ] implies g K[x 1,...,x r ]).
12 Gröbner bases talk at the ACAGM Summer School Leuven p. 11 What is a Gröbner basis? monomial ordering on {x α xα n n } is well ordering
13 Gröbner bases talk at the ACAGM Summer School Leuven p. 11 What is a Gröbner basis? monomial ordering on {x α xα n n } is well ordering x α x α n n > x β xβ n n if lexicographical ordering: α j = β j if j k 1 and α k > β k degree-lexicographical ordering: α i > β i or α i = β i and α j = β j if j k 1 and α k > β k
14 Gröbner bases talk at the ACAGM Summer School Leuven p. 11 What is a Gröbner basis? monomial ordering on {x α xα n n } is well ordering x α x α n n > x β xβ n n if lexicographical ordering: α j = β j if j k 1 and α k > β k degree-lexicographical ordering: α i > β i or α i = β i and α j = β j if j k 1 and α k > β k deg-lex: 77y 3 +5xy +y 2 +x+3y +1 lex: 5xy +x+77y 3 +y 2 +3y +1
15 Gröbner bases talk at the ACAGM Summer School Leuven p. 12 What is a Gröbner basis? NF(x 3 y +xy +z 2 {x 3 +z,z 2 z}) = xy yz +z
16 Gröbner bases talk at the ACAGM Summer School Leuven p. 12 What is a Gröbner basis? NF(x 3 y +xy +z 2 {x 3 +z,z 2 z}) = xy yz +z x 3 y +xy +z 2 y (x 3 +z) = xy yz +z 2 xy yz +z 2 (z 2 z) = xy yz +z
17 Gröbner bases talk at the ACAGM Summer School Leuven p. 12 What is a Gröbner basis? NF(x 3 y +xy +z 2 {x 3 +z,z 2 z}) = xy yz +z x 3 y +xy +z 2 y (x 3 +z) = xy yz +z 2 xy yz +z 2 (z 2 z) = xy yz +z normal form of f with respect to G = {f 1,...,f k }: NF(f G) h := f while ( monomial m,l(h) = ml(f i ) for some i) h := h c(h) c(f i ) mf i return (c(h)l(h)+nf(h c(h)l(h) G)
18 Gröbner bases talk at the ACAGM Summer School Leuven p. 13 Buchbergers Algorithm input: S={f 1,...f r } polynomials in K[x 1,...,x n ], < well-ordering L:={(f,g), f,g S} while L take (f,g) L, L:=L \{(f,g)} h:=nf(spoly(f,g) S) if h 0 L:=L {(h,f) f S} S:=S {(h)} end end return S
19 Gröbner bases talk at the ACAGM Summer School Leuven p. 14 Example for a Gröbner basis ideal Gröbner basis x 1 + x 2 + x 3 1 = f 1 x 1 + 2x 2 x = f 2 x 1 + 3x 3 4 = g 1 x 2 2x = g 2 NF(g 2 {f 1,f 2 }) = g 2 but NF(g 2 {g 1,g 2 }) = 0 Gröbner bases can be very complicated and their computation can take a lot of time.
20 Gröbner bases talk at the ACAGM Summer School Leuven p. 15 Standard monomials of Gröbner bases Finitely many solutions. Infinitely many solutions.
21 Gröbner bases talk at the ACAGM Summer School Leuven p. 16 Basic Properties of Gröbner bases ideal membership f I iff NF(f,GB(I))=0
22 Gröbner bases talk at the ACAGM Summer School Leuven p. 16 Basic Properties of Gröbner bases ideal membership f I iff NF(f,GB(I))=0 elimination < an elimination order for y 1,...,y n, R = K[x 1,...,x r,y 1,...,y n ]. Then GB(I) K[x 1,...,x r ] = GB(I K[x 1,...,x r ]).
23 Gröbner bases talk at the ACAGM Summer School Leuven p. 16 Basic Properties of Gröbner bases ideal membership f I iff NF(f,GB(I))=0 elimination < an elimination order for y 1,...,y n, R = K[x 1,...,x r,y 1,...,y n ]. Then GB(I) K[x 1,...,x r ] = GB(I K[x 1,...,x r ]). Hilbert function H(I)=H(L(I))
24 Gröbner bases talk at the ACAGM Summer School Leuven p. 17 Leading ideal and dimension leading ideal: L(I) = {L(f) f I} The leading monomials of a Gröbner basis generate the leading ideal. Many invariants of the leading ideal can be computed combinatorically. The ideal and its leading ideal have many common properties.
25 Gröbner bases talk at the ACAGM Summer School Leuven p. 17 Leading ideal and dimension leading ideal: L(I) = {L(f) f I} The leading monomials of a Gröbner basis generate the leading ideal. Many invariants of the leading ideal can be computed combinatorically. The ideal and its leading ideal have many common properties. the dimension the Hilbert function
26 Gröbner bases talk at the ACAGM Summer School Leuven p. 17 Leading ideal and dimension leading ideal: L(I) = {L(f) f I} The leading monomials of a Gröbner basis generate the leading ideal. Many invariants of the leading ideal can be computed combinatorically. The ideal and its leading ideal have many common properties. the dimension the Hilbert function {y 3 +x 2,x 2 y xy 2,x 4 +x 3 } is a Gröbner basis of I =< y 3 +x 2,y 4 +xy 2 > therefore L(I) =< y 3,x 2 y,x 4 > and dim C C[x,y]/I = 8
27 Gröbner bases talk at the ACAGM Summer School Leuven p. 18 Geometry of Elimination Definition. Let A A n (K) and B A m (K) be (nonempty) algebraic sets. A map ϕ : A B is a polynomial map, or a morphism, if its components are polynomial functions on A. That is, there exist polynomials f 1,...,f m R such that ϕ(p) = (f 1 (p),...,f m (p)) for all p A. The image of a morphism needs not be an algebraic set. Example. Let π : A 2 (R) A 1 (R), (a,b) b, be projection of the xy-plane onto the y-axis. Then π maps the hyperbola C = V(xy 1) onto the punctured line π(c) = A 1 (R)\{0} which is not an algebraic set.
28 Gröbner bases talk at the ACAGM Summer School Leuven p. 19 Elimination lexikographical ordering x α x α n n > x β xβ n n if α j = β j for j k 1 and α k > β k
29 Gröbner bases talk at the ACAGM Summer School Leuven p. 19 Elimination lexikographical ordering x α x α n n > x β xβ n n if α j = β j for j k 1 and α k > β k I K[x 1,...,x] ideal, G Gröbner basis, then G K[x k,...,x n ] is a Gröbner basis of I K[x k,...,x n ]. this means geometrically to compute the projection π : V(I) K n K n k+1.
30 Gröbner bases talk at the ACAGM Summer School Leuven p. 20 Solving triangular sets T = {h 1 (x 1 ),h 2 (x 1,x 2 ),...,h n (x 1,...,x n )} zero sets of triangular sets are easy to compute.
31 Gröbner bases talk at the ACAGM Summer School Leuven p. 20 Solving triangular sets T = {h 1 (x 1 ),h 2 (x 1,x 2 ),...,h n (x 1,...,x n )} zero sets of triangular sets are easy to compute. Given f 1...,f m and using Gröbner bases one can compute a given set of triangular sets T 1,...,T r such that the zero set V(f 1...,f m ) = V(T i ) is the union of the zero sets of the T i. If {1} is the minimal Göbner basis of f 1...,f m, the system has no zeros (even in no extension of the base field).
32 Gröbner bases talk at the ACAGM Summer School Leuven p. 21 Solving ring A=0,(x,y,z),lp; ideal I=x2+y+z-1, x+y2+z-1, x+y+z2-1; ideal J=groebner(I); J; J[1]=z6-4z4+4z3-z2 J[3]=y2-y-z2+z J[2]=2yz2+z4-z2 J[4]=x+y+z2-1 triangl(j); [1]: [2]: _[1]=z4-4z2+4z-1 _[1]=z2 _[2]=2y+z2-1 _[2]=y2-y+z _[3]=2x+z2-1 _[3]=x+y-1
33 Gröbner bases talk at the ACAGM Summer School Leuven p. 22 Solving solve(i,6); //-> [1]: [2]: [3]: [4]: [5]: //-> [1]: [1]: [1]: [1]: [1]: //-> //-> [2]: [2]: [2]: [2]: [2]: //-> //-> [3]: [3]: [3]: [3]: [3]: //->
34 Gröbner bases talk at the ACAGM Summer School Leuven p. 23 Intersection of ideals Let (F) = (f 1,...,f r ) R = K[x] and (G) = (g 1,...,g r ) R. Then GB((F) (G)) = GB(y(F)+(1 y)(g)) R in R[y]. Example ring R=0,(x,y,z),dp; ideal F=z; ideal G=x,y; ideal K=intersect(F,G); K; //->K[1]=yz //->K[2]=xz
35 Gröbner bases talk at the ACAGM Summer School Leuven p. 24 Radical membership Definition{f 1 f 2...f k, f α 1 1 fα fα k k I} = I is called the radical of I. Let I R = K[x 1,...,x n ], I generated by F. f I iff 1 GB(F +(yf 1) R[y]
36 Gröbner bases talk at the ACAGM Summer School Leuven p. 25 Principal ideal I=(F) is principal (i.e. has a one-element ideal basis) iff GB(F) has exactly one element.
37 Gröbner bases talk at the ACAGM Summer School Leuven p. 26 Kernel of a ring homomorphism Let Φ be an affine ring homomorphism Φ : R = K[x 1,...,x m ]/I K[y 1,...,y n ]/(g 1,...,g s ) given by f i = Φ(x i ) K[y 1,...,y n ]/(g 1,...,g s ), i = 1,...,m. Then Ker(Φ) is generated by (g 1 (y),...,g s (y), (x 1 f 1 (y)),...,(x m f m (y))) K[x 1,...,x m ] in K[x 1,...,x m ]/I.
38 Gröbner bases talk at the ACAGM Summer School Leuven p. 27 References Gert-Martin Greuel, Gerhard Pfister: A Singular Introduction to Commutative Algebra Springer Verlag, with contributions by Olaf Bachmann, Christoph Lossen, and Hans Schönemann, 2002, Second edition appeared in Wolfram Decker, Christoph Lossen: Computing in Algebraic Geometry - A Quick Start using Singular Springer Verlag, 2005, ACM zca/ Reports_on_ca/02/paper_html/paper.html
Free resolutions talk at the ACAGM Summer School Leuven 2011- p. 1
Free resolutions talk at the ACAGM Summer School Leuven 2011- p. 1 Free resolutions talk at the ACAGM Summer School Leuven 2011 - Hans Schönemann hannes@mathematik.uni-kl.de Department of Mathematics University
More informationGeneralzing Gröbner Bases talk at the ACAGM Summer School Leuven 2011- p. 1
Generalzing Gröbner Bases talk at the ACAGM Summer School Leuven 2011- p. 1 Generalzing Gröbner Bases talk at the ACAGM Summer School Leuven 2011 - Hans Schönemann hannes@mathematik.uni-kl.de Department
More informationGröbner Bases and their Applications
Gröbner Bases and their Applications Kaitlyn Moran July 30, 2008 1 Introduction We know from the Hilbert Basis Theorem that any ideal in a polynomial ring over a field is finitely generated [3]. However,
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationfg = f g. 3.1.1. Ideals. An ideal of R is a nonempty k-subspace I R closed under multiplication by elements of R:
30 3. RINGS, IDEALS, AND GRÖBNER BASES 3.1. Polynomial rings and ideals The main object of study in this section is a polynomial ring in a finite number of variables R = k[x 1,..., x n ], where k is an
More informationComputational algebraic geometry
Computational algebraic geometry Learning coefficients via symbolic and numerical methods Anton Leykin Georgia Tech AIM, Palo Alto, December 2011 Let k be a field (R or C). Ideals varieties Ideal in R
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials
Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from
More informationAlgebra 3: algorithms in algebra
Algebra 3: algorithms in algebra Hans Sterk 2003-2004 ii Contents 1 Polynomials, Gröbner bases and Buchberger s algorithm 1 1.1 Introduction............................ 1 1.2 Polynomial rings and systems
More information11 Multivariate Polynomials
CS 487: Intro. to Symbolic Computation Winter 2009: M. Giesbrecht Script 11 Page 1 (These lecture notes were prepared and presented by Dan Roche.) 11 Multivariate Polynomials References: MC: Section 16.6
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
More informationDegree Bounds for Gröbner Bases in Algebras of Solvable Type
Degree Bounds for Gröbner Bases in Algebras of Solvable Type Matthias Aschenbrenner University of California, Los Angeles (joint with Anton Leykin) Algebras of Solvable Type... introduced by Kandri-Rody
More informationit is easy to see that α = a
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 UF. Therefore
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More information15. Symmetric polynomials
15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More information3 Monomial orders and the division algorithm
3 Monomial orders and the division algorithm We address the problem of deciding which term of a polynomial is the leading term. We noted above that, unlike in the univariate case, the total degree does
More informationThe Geometry of Polynomial Division and Elimination
The Geometry of Polynomial Division and Elimination Kim Batselier, Philippe Dreesen Bart De Moor Katholieke Universiteit Leuven Department of Electrical Engineering ESAT/SCD/SISTA/SMC May 2012 1 / 26 Outline
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationReduction Modulo Ideals and Multivariate Polynomial Interpolation
UNIVERSITÀ DEGLI STUDI DI PADOVA UNIVERSITE BORDEAUX 1 Facoltà di Scienze MM. FF. NN U.F.R. Mathématiques et Informatique Master Thesis Vo Ngoc Thieu Reduction Modulo Ideals and Multivariate Polynomial
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationFrom Factorial Designs to Hilbert Schemes
From Factorial Designs to Hilbert Schemes Lorenzo Robbiano Università di Genova Dipartimento di Matematica Lorenzo Robbiano (Università di Genova) Factorial Designs and Hilbert Schemes Genova, June 2015
More informationON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE
Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a
More informationDIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents
DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More information1 Chapter I Solutions
1 Chapter I Solutions 1.1 Section 1 (TODO) 1 2 Chapter II Solutions 2.1 Section 1 1.16b. Given an exact sequence of sheaves 0 F F F 0 over a topological space X with F flasque show that for every open
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationFIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
More informationRESEARCH STATEMENT AMANDA KNECHT
RESEARCH STATEMENT AMANDA KNECHT 1. Introduction A variety X over a field K is the vanishing set of a finite number of polynomials whose coefficients are elements of K: X := {(x 1,..., x n ) K n : f i
More informationSOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE
SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE CRISTINA FLAUT and DIANA SAVIN Communicated by the former editorial board In this paper, we study some properties of the matrix representations of the
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationFactoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationCommutative Algebra Notes Introduction to Commutative Algebra Atiyah & Macdonald
Commutative Algebra Notes Introduction to Commutative Algebra Atiyah & Macdonald Adam Boocher 1 Rings and Ideals 1.1 Rings and Ring Homomorphisms A commutative ring A with identity is a set with two binary
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More informationAlgebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
More information5. Linear algebra I: dimension
5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs
More informationSECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA
SECOND DERIVATIVE TEST FOR CONSTRAINED EXTREMA This handout presents the second derivative test for a local extrema of a Lagrange multiplier problem. The Section 1 presents a geometric motivation for the
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationCopyrighted Material. Chapter 1 DEGREE OF A CURVE
Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two
More informationBasics of Polynomial Theory
3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where
More informationGroebner bases over noetherian path algebras
Groebner bases over noetherian path algebras Universite Cheikh Anta Diop Colloque sur la cryptographie et les codes correcteurs Dakar 3-11 decembre 2015 Andre Saint Eudes Mialebama Bouesso Postdoc fellow
More informationAssociativity condition for some alternative algebras of degree three
Associativity condition for some alternative algebras of degree three Mirela Stefanescu and Cristina Flaut Abstract In this paper we find an associativity condition for a class of alternative algebras
More informationModern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)
Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)
More informationALGEBRAIC CURVES. An Introduction to Algebraic Geometry WILLIAM FULTON
ALGEBRAIC CURVES An Introduction to Algebraic Geometry WILLIAM FULTON January 28, 2008 Preface Third Preface, 2008 This text has been out of print for several years, with the author holding copyrights.
More informationArithmetic complexity in algebraic extensions
Arithmetic complexity in algebraic extensions Pavel Hrubeš Amir Yehudayoff Abstract Given a polynomial f with coefficients from a field F, is it easier to compute f over an extension R of F than over F?
More informationDetermining distribution parameters from quantiles
Determining distribution parameters from quantiles John D. Cook Department of Biostatistics The University of Texas M. D. Anderson Cancer Center P. O. Box 301402 Unit 1409 Houston, TX 77230-1402 USA cook@mderson.org
More informationarxiv:1502.04893v3 [math.co] 10 Sep 2015
DETECTING BINOMIALITY arxiv:1502.04893v3 [math.co] 10 Sep 2015 CARSTEN CONRADI AND THOMAS KAHLE Abstract. Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
More informationComputer Aided Geometric Design. Axial moving planes and singularities of rational space curves
Computer Aided Geometric Design 26 (2009) 300 316 Contents lists available at ScienceDirect Computer Aided Geometric Design www.elsevier.com/locate/cagd Axial moving planes and singularities of rational
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationGeometric Transformation CS 211A
Geometric Transformation CS 211A What is transformation? Moving points (x,y) moves to (x+t, y+t) Can be in any dimension 2D Image warps 3D 3D Graphics and Vision Can also be considered as a movement to
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationCritical points via monodromy and local methods
Critical points via monodromy and local methods Abraham Martín del Campo joint w/ Jose Rodriguez (U. Notre Dame) SIAM Conference on Applied Algebraic Geometry August 3, 2015 Abraham Martín del Campo (IST)
More informationA glimpse of combinatorics on words
A glimpse of combinatorics on words Benny George K Tata Institute of Fundamental Research,Mumbai India Indo Russian Workshop 2008 Ural State Univeristy Kenkireth TIFR (INDIA) A glimpse of combinatorics
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationNOV - 30211/II. 1. Let f(z) = sin z, z C. Then f(z) : 3. Let the sequence {a n } be given. (A) is bounded in the complex plane
Mathematical Sciences Paper II Time Allowed : 75 Minutes] [Maximum Marks : 100 Note : This Paper contains Fifty (50) multiple choice questions. Each question carries Two () marks. Attempt All questions.
More informationα α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =
More informationA Little Set Theory (Never Hurt Anybody)
A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 7: Conditionally Positive Definite Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationdiscuss how to describe points, lines and planes in 3 space.
Chapter 2 3 Space: lines and planes In this chapter we discuss how to describe points, lines and planes in 3 space. introduce the language of vectors. discuss various matters concerning the relative position
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More information2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.
Math 307 Abstract Algebra Sample final examination questions with solutions 1. Suppose that H is a proper subgroup of Z under addition and H contains 18, 30 and 40, Determine H. Solution. Since gcd(18,
More informationThe Australian Journal of Mathematical Analysis and Applications
The Australian Journal of Mathematical Analysis and Applications Volume 7, Issue, Article 11, pp. 1-14, 011 SOME HOMOGENEOUS CYCLIC INEQUALITIES OF THREE VARIABLES OF DEGREE THREE AND FOUR TETSUYA ANDO
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationBasic Algorithms In Computer Algebra
Basic Algorithms In Computer Algebra Kaiserslautern SS 2011 Prof. Dr. Wolfram Decker 2. Mai 2011 References Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, 1993. Cox, D.; Little,
More informationComputability Theory
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Computability Theory This section is partly inspired by the material in A Course in Mathematical Logic by Bell and Machover, Chap 6, sections 1-10.
More informationLecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook. John Rognes
Lecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook John Rognes November 29th 2010 Contents Introduction v 1 Set Theory and Logic 1 1.1 ( 1) Fundamental Concepts..............................
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
More informationMilnor s Fibration Theorem for Real Singularities
Milnor s Fibration Theorem for Real Singularities av NIKOLAI B. HANSEN MASTEROPPGAVE for graden Master i Matematikk (Master of Science) Det matematisk- naturvitenskapelige fakultet Universitetet i Oslo
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationPOLYTOPES WITH MASS LINEAR FUNCTIONS, PART I
POLYTOPES WITH MASS LINEAR FUNCTIONS, PART I DUSA MCDUFF AND SUSAN TOLMAN Abstract. We analyze mass linear functions on simple polytopes, where a mass linear function is an affine function on whose value
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS. Cosmin Pelea
ACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS Cosmin Pelea Abstract. An important tool in the hyperstructure theory is the fundamental relation. The factorization
More informationIntroduction to Modern Algebra
Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More information