DOCSLIB.ORG

MATH 614 LECTURE NOTES, FALL, 2015 by Mel Hochster

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
MATH 614 LECTURE NOTES, FALL, 2015 by Mel Hochster MATH 614 LECTURE NOTES, FALL, 2015 by Mel Hochster Lecture of September 9 We assume familiarity with the notions of ring, ideal, module, and with the polynomial ring in one or finitely many variables over a commutative ring, as well as with homomor- phisms of rings and homomorphisms of R-modules over the ring R. As a matter of notation, N ⊆ Z ⊆ Q ⊆ R ⊆ C are the non-negative integers, the integers, the rational numbers, the real numbers, and the complex numbers, respectively, throughout this course. Unless otherwise specified, all rings are commutative, associative, and have a multiplica- tive identity 1 (when precision is needed we write 1R for the identity in the ring R). It is possible that 1 = 0, in which case the ring is f0g, since for every r 2 R, r = r ·1 = r ·0 = 0. We shall assume that a homomorphism h of rings R ! S preserves the identity, i.e., that h(1R) = 1S. We shall also assume that all given modules M over a ring R are unital, i.e., that 1R · m = m for all m 2 M. When R and S are rings we write S = R[θ1; : : : ; θn] to mean that S is generated as a ring over its subring R by the elements θ1; : : : ; θn. This means that S contains R and the elements θ1; : : : ; θn, and that no strictly smaller subring of S contains R and the θ1; : : : ; θn. It also means that every element of S can be written (not necessarily k1 kn uniquely) as an R-linear combination of the monomials θ1 ··· θn . When one writes S = R[x1; : : : ; xk] it often means that the xi are indeterminates, so that S is the polynomial ring in k variables over R. But one should say this. The main emphasis in this course will be on Noetherian rings, i.e., rings in which every ideal is finitely generated. Specifically, for all ideals I ⊆ R, there exist f1; : : : ; fk 2 R Pk such that I = (f1; : : : ; fk) = (f1; : : : ; fk)R = i=1 Rfi. We shall develop a very useful theory of dimension in such rings. This will be discussed further quite soon. We shall not be focused on esoteric examples of rings. In fact, almost all of the theory we develop is of great interest and usefulness in studying the properties of polynomial rings over a field or the integers, and homomorphic images of such rings. There is a strong connection between studying systems of equations, studying their solutions sets, which often have some kind of geometry associated with them, and studying commutative rings. Suppose the equations involve variables X1;:::;Xn with coefficients in K. The most important case for us will be when K is an algebraically closed field such as the complex numbers C. Suppose the equations have the form Fi = 0 where the Fi are polynomials in the Xj with coefficients in K. Let I be the ideal generated by the Fi in the polynomial ring K[X1;:::;Xn] and let R be the quotient ring K[X1;:::;Xn]=I. In R, the images xj of the variables Xj give a solution of the equations, a sort of \universal" 1 2 solution. The connection between commutative algebra and algebraic geometry is that algebraic properties of the ring R are reflected in geometric properties of the solution set, and conversely. Solutions of the equations in the field K give maximal ideals of R. This leads to the idea that maximal ideals of R should be thought of as points in a geometric object. Some rings have very few maximal ideals: in that case it is better to consider all of the prime ideals of R as points of a geometric object. We shall soon make this idea more formal. Before we begin the systematic development of our subject, we shall look at some very simple examples of problems, many unsolved, that are quite natural and easy to state. Suppose that we are given polynomials f and g in C[x], the polynomial ring in one variable over the complex numbers C. Is there an algorithm that enables us to tell whether f and g generate C[x] over C? This will be the case if and only if x 2 C[f; g], i.e., if and only if x can be expressed as a polynomial with complex coefficients in f and g. For example, suppose that f = x5 + x3 − x2 + 1 and g = x14 − x7 + x2 + 5. Here it is easy to see that f and g do not generate, because neither has a term involving x with nonzero coefficient. But if we change f to x5 + x3 − x2 + x + 1 the problem does not seem easy. The following theorem of Abhyankar and Moh, whose original proof was about 150 pages long, gives a method of attacking this sort of problem. Theorem (Abhyankar-Moh). Let f, g in C[x] have degrees d and e respectively. If C[f; g] = C[x], then either d j e or e j d, i.e., one of the two degrees must divide the other. Shorter proofs have since been given. Given this difficult result, it is clear that the specific f and g given above cannot generate C[x]: 5 does not divide 14. Now suppose instead that f = x5 + x3 − x2 + x + 1 and g = x15 − x7 + x2 + 5. With this choice, the Abhyankar-Moh result does not preclude the possibility that f and g generate C[x]. To pursue the issue further, note that in g − f 3 the degree 15 terms cancel, producing a polynomial of smaller degree. But when we consider f and g−f 3, which generate the same ring as f and g, the larger degree has decreased while the smaller has stayed the same. Thus, the sum of the degrees has decreased. In this sense, we have a smaller problem. We can now see whether the Abhyankar-Moh criterion is satisfied for this smaller pair. If it is, and the smaller degree divides the larger, we can subtract off a multiple of a power of the smaller degree polynomial and get a new pair in which the larger degree has decreased and the smaller has stayed the same. Eventually, either the criterion fails, or we get a constant and a single polynomial of degree ≥ 2, or one of the polynomials has degree 1. In the first two cases the original pair of polynomials does not generate. In the last case, they do generate. This is a perfectly general algorithm. To test whether f of degree d and g of degree n ≥ d are generators, check whether d divides n. If so and n = dk, one can choose a constant c such that g − cf k has degree smaller than n. If the leading coefficients of f and g are a 6= 0 and b 6= 0, take c = b=ak. The sum of the degrees for the pair f; g − cf k has decreased. Continue in the same way with the new pair, f, g −cf k. If one eventually reaches a pair in which one of the polynomials is linear, the original pair were generators. Otherwise, one reaches either a pair in which neither degree divides the other, or else a pair in which one 3 polynomial has degree ≥ 2 while the other is constant. In either of these cases, the two polynomials do not generate. The constant does not help, since we have all of C available anyway, and a polynomial g of degree d ≥ 2 cannot generate: when g is substituted into a polynomial of degree n, call it F , F (g) has a term of degree dn coming from gn, and no other term occurring can cancel it. Thus, one cannot have x = F (g). One can work backwards from a pair in which one of the polynomials is linear to get all pairs of generators. For example, one gets pairs of generators x; 0 ! x; 1 ! x + 5; 1 ! x + 5; (x + 5)7 + 1 ! 11 (x + 5)7 + 1 + x + 5; (x + 5)7 + 1. If one expands the last pair out, it is not very obvious from looking at the polynomials that they generate. Of course, applying the algorithm described above would enable one to see it. This gives a reasonably appealing method for telling whether two polynomials in one variable generate C[x]. The step of going from the problem of when two polynomials generate to C[x] over C to when three polynomials generate turns out to be a giant one, however! While algorithms are known based on the theory of Gr¨obnerbases, the process is much more complex. There are some elegant conjectures, but there is a lack of elegant theorems in higher dimension. One might hope that given three polynomials that generate C[x], say f, g, and h, with degrees d; e; n, respectively, that it might be true that one of the degrees has to be a sum of non-negative integer multiples of the other two, e.g., n = rd+se. Then one could reduce to a smaller problem (i.e., one where the sum of the degrees is smaller) by subtracting a constant times f rgs from h, while keeping the same f and g. But it is not true in the case of three polynomials that one of the degrees must be a sum of non-negative integer multiples of the other two. (See whether f = x5; g = x4 + x; and h = x3 generate C[x].) The problem of giving an elegant test for deciding when m polynomials generate the polynomial ring C[x1; : : : ; xn] in n variables over C seems formidable, but when m = n there is at least a tantalizing conjecture.
Load more

Recommended publications
  • 1 Sets and Set Notation. Definition 1 (Naive Definition of a Set)
    LINEAR ALGEBRA MATH 2700.006 SPRING 2013 (COHEN) LECTURE NOTES 1 Sets and Set Notation. Definition 1 (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most often name sets using capital letters, like A, B, X, Y , etc., while the elements of a set will usually be given lower-case letters, like x, y, z, v, etc. Two sets X and Y are called equal if X and Y consist of exactly the same elements. In this case we write X = Y . Example 1 (Examples of Sets). (1) Let X be the collection of all integers greater than or equal to 5 and strictly less than 10. Then X is a set, and we may write: X = f5; 6; 7; 8; 9g The above notation is an example of a set being described explicitly, i.e. just by listing out all of its elements. The set brackets {· · ·} indicate that we are talking about a set and not a number, sequence, or other mathematical object. (2) Let E be the set of all even natural numbers. We may write: E = f0; 2; 4; 6; 8; :::g This is an example of an explicity described set with infinitely many elements. The ellipsis (:::) in the above notation is used somewhat informally, but in this case its meaning, that we should \continue counting forever," is clear from the context. (3) Let Y be the collection of all real numbers greater than or equal to 5 and strictly less than 10. Recalling notation from previous math courses, we may write: Y = [5; 10) This is an example of using interval notation to describe a set.
    [Show full text]
  • Introduction to Abstract Algebra (Math 113)
    Introduction to Abstract Algebra (Math 113) Alexander Paulin, with edits by David Corwin FOR FALL 2019 MATH 113 002 ONLY Contents 1 Introduction 4 1.1 What is Algebra? . 4 1.2 Sets . 6 1.3 Functions . 9 1.4 Equivalence Relations . 12 2 The Structure of + and × on Z 15 2.1 Basic Observations . 15 2.2 Factorization and the Fundamental Theorem of Arithmetic . 17 2.3 Congruences . 20 3 Groups 23 1 3.1 Basic Definitions . 23 3.1.1 Cayley Tables for Binary Operations and Groups . 28 3.2 Subgroups, Cosets and Lagrange's Theorem . 30 3.3 Generating Sets for Groups . 35 3.4 Permutation Groups and Finite Symmetric Groups . 40 3.4.1 Active vs. Passive Notation for Permutations . 40 3.4.2 The Symmetric Group Sym3 . 43 3.4.3 Symmetric Groups in General . 44 3.5 Group Actions . 52 3.5.1 The Orbit-Stabiliser Theorem . 55 3.5.2 Centralizers and Conjugacy Classes . 59 3.5.3 Sylow's Theorem . 66 3.6 Symmetry of Sets with Extra Structure . 68 3.7 Normal Subgroups and Isomorphism Theorems . 73 3.8 Direct Products and Direct Sums . 83 3.9 Finitely Generated Abelian Groups . 85 3.10 Finite Abelian Groups . 90 3.11 The Classification of Finite Groups (Proofs Omitted) . 95 4 Rings, Ideals, and Homomorphisms 100 2 4.1 Basic Definitions . 100 4.2 Ideals, Quotient Rings and the First Isomorphism Theorem for Rings . 105 4.3 Properties of Elements of Rings . 109 4.4 Polynomial Rings . 112 4.5 Ring Extensions . 115 4.6 Field of Fractions .
    [Show full text]
  • Arxiv:1310.3297V1 [Math.AG] 11 Oct 2013 Bertini for Macaulay2
    Bertini for Macaulay2 Daniel J. Bates,∗ Elizabeth Gross,† Anton Leykin,‡ Jose Israel Rodriguez§ September 6, 2018 Abstract Numerical algebraic geometry is the field of computational mathematics concerning the numerical solution of polynomial systems of equations. Bertini, a popular software package for computational applications of this field, includes implementations of a variety of algorithms based on polynomial homotopy continuation. The Macaulay2 package Bertini provides an interface to Bertini, making it possible to access the core run modes of Bertini in Macaulay2. With these run modes, users can find approximate solutions to zero-dimensional systems and positive-dimensional systems, test numerically whether a point lies on a variety, sample numerically from a variety, and perform parameter homotopy runs. 1 Numerical algebraic geometry Numerical algebraic geometry (numerical AG) refers to a set of methods for finding and manipulating the solution sets of systems of polynomial equations. Said differently, given f : CN → Cn, numerical algebraic geometry provides facilities for computing numerical approximations to isolated solutions of V (f) = z ∈ CN |f(z)=0 , as well as numerical approximations to generic points on positive-dimensional components. The book [7] provides a good introduction to the field, while the newer book [2] provides a simpler introduction as well as a complete manual for the software package Bertini [1]. arXiv:1310.3297v1 [math.AG] 11 Oct 2013 Bertini is a free, open source software package for computations in numerical alge- braic geometry. The purpose of this article is to present a Macaulay2 [3] package Bertini that provides an interface to Bertini. This package uses basic datatypes and service rou- tines for computations in numerical AG provided by the package NAGtypes.
    [Show full text]
  • Mathematical Logic
    Mathematical logic Jouko Väänänen January 16, 2017 ii Contents 1 Introduction 1 2 Propositional logic 3 2.1 Propositional formulas . .3 2.2 Turth-tables . .7 2.3 Problems . 12 3 Structures 15 3.1 Relations . 15 3.2 Structures . 16 3.3 Vocabulary . 19 3.4 Isomorphism . 20 3.5 Problems . 22 4 Predicate logic 23 4.1 Formulas . 30 4.2 Identity . 36 4.3 Deduction . 37 4.4 Theories . 43 4.5 Problems . 51 5 Incompleteness of number theory 55 5.1 Primitive recursive functions . 57 5.2 Recursive functions . 65 5.3 Definability in number theory . 67 5.4 Recursively enumerable sets . 73 5.5 Problems . 79 6 Further reading 83 iii iv CONTENTS Preface This book is based on lectures the author has given in the Department of Math- ematics and Statistics in the University of Helsinki during several decades. As the title reveals, this is a mathematics course, but it can also serve computer science students. The presentation is self-contained, although the reader is as- sumed to be familiar with elementary set-theoretical notation and with proof by induction. The idea is to give basic completeness and incompleteness results in an unaf- fected straightforward way without delving into all the elaboration that modern mathematical logic involves. There is a section “Further reading” guiding the reader to the rich literature on more advanced results. I am indebted to the many students who have followed the course as well as to the teachers who have taught it in addition to myself, in particular Tapani Hyttinen, Åsa Hirvonen and Taneli Huuskonen.
    [Show full text]
  • Math 203A - Solution Set 1 2 Problem 1
    Math 203A - Solution Set 1 2 Problem 1. Show that the Zariski topology on A is not the product of the Zariski topologies 1 1 on A × A . Answer: Clearly, the diagonal 2 Z = f(x; y): x − y = 0g ⊂ A 2 is closed in the Zariski topology of A . We claim this Z is not closed in the product 1 1 2 topology of A × A . Assume otherwise. Then, the complement A n Z is open in the 1 product topology. Therefore, there are nonempty open sets U; V in A such that 2 U × V ⊂ A n Z: Now, the sets U and V have finite complements: 1 U = A n fp1; : : : ; png; 1 V = A n fq1; : : : ; qmg: We obtain a contradiction picking 1 z 2 A n fp1; : : : ; pn; q1; : : : ; qmg: In this case, we clearly have 2 (z; z) 2 U × V; while (z; z) 62 A n Z: Problem 2. A topological space X is said to be Noetherian if it satisfies the ascending chain condition on open sets, i.e. any ascending chain of open sets eventually stabilizes. (i) Check that any subset Y ⊂ X of a Noetherian space is also Noetherian in the subspace topology. (ii) Check that a Noetherian space which is also Hausdorff must be a finite set of points. (iii) Show that a Noetherian space is quasi-compact i.e., show that any open cover of a Noe- therian space has a finite subcover. n (iv) Show that A is Noetherian in the Zariski topology. Conclude that any affine algebraic set is Noetherian.
    [Show full text]
  • Basic Topological Structures of the Theory of Ordinary Differential Equations
    TOPOLOGY IN NONLINEAR ANALYSIS BANACH CENTER PUBLICATIONS, VOLUME 35 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1996 BASIC TOPOLOGICAL STRUCTURES OF THE THEORY OF ORDINARY DIFFERENTIAL EQUATIONS V. V. FILIPPOV Chair of General Topology and Geometry, Department of Mathematics Moscow State University, 119899, Moscow V-234, Russia E-mail: fil@sci.math.msu.su If you open any book on the theory of ordinary differential equations (TODE) you can observe that almost every proof in the TODE uses the continuity of the dependence of a solution of the Cauchy problem on initial data and parameters of the right-hand side. But the classical TODE has few theorems assuring this continuity. In general they suppose the continuity of the right-hand side. We can note a trivial Example 0.1. Let g(t; y) be a continuous function. The dependence of solutions of the equations y0 = g(t; y) + α(t2 + y2 + α2)−1 on the parameter α is continuous though the right-hand side is not continuous at the point t = y = α = 0. So we meet the problem to describe a topological structure adequate to the idea of the continuity of the dependence of solutions on parameters of the right-hand side of the equation. Solving this problem we develop a new large working theory which gives a natural framework of topological contents of the TODE. The theory deals with equations of classical types, with equations having various singularities in the right-hand sides, with differential inclusions etc. Some account of the theory may be found in [7] (see also the Chapter IX in the book [4] and the book [8]).
    [Show full text]
  • Almost PI Algebras Are PI
    ALMOST PI ALGEBRAS ARE PI MICHAEL LARSEN AND ANER SHALEV Abstract. We define the notion of an almost polynomial identity of an associative algebra R, and show that its existence implies the existence of an actual polynomial identity of R. A similar result is also obtained for Lie algebras and Jordan algebras. We also prove related quantitative results for simple and semisimple algebras. By a well known theorem of Peter Neumann [N], for all ǫ> 0 there exists N > 0 such that if G is a finite group with at least ǫ|G|2 pairs (x,y) ∈ G2 satisfying [x,y] = 1, then [xN ,yN ]N = 1 for all x,y ∈ G. We can express this by saying that if [x,y] is an ǫ-probabilistic identity for G, then [xN ,yN ]N is an identity for G. See also Mann [M] for a similar result on finite groups in which x2 is an ǫ-probabilistic identity. It is an open question whether every probabilistic identity in finite and residually finite groups implies an actual identity; see [LS2] and [Sh] for further discussion of this question. In this paper, we consider the analogous problem for associative algebras (as well as Lie algebras). Here, the possible identities are polynomials in a non-commuting set of variables (or Lie polynomials) rather than elements of a free group. We introduce the notion of an almost identity of an algebra as an analogue of a probabilistic identity and show that algebras with an almost identity satisfy an actual identity. While we focus here on infinite- dimensional algebras we also prove related quantitative results for finite dimensional simple algebras.
    [Show full text]
  • Computing the Equidimensional Decomposition of an Algebraic Closed Set by Means of Lifting fibers
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector ARTICLE IN PRESS Journal of Complexity 19 (2003) 564–596 http://www.elsevier.com/locate/jco Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers Gre´ goire Lecerfà Laboratoire de Mathe´matiques, UMR 8100 CNRS, Universite´ de Versailles St-Quentin-en-Yvelines, 45, Avenue des E´tats-Unis, Baˆtiment Fermat, Versailles, 78035 France Received 3 September 2002; accepted 27 February 2003 Abstract We present a new probabilistic method for solving systems of polynomial equations and inequations. Our algorithm computes the equidimensional decomposition of the Zariski closure of the solution set of such systems. Each equidimensional component is encoded by a generic fiber, that is a finite set of points obtained from the intersection of the component with a generic transverse affine subspace. Our algorithm is incremental in the number of equations to be solved. Its complexity is mainly cubic in the maximum of the degrees of the solution sets of the intermediate systems counting multiplicities. Our method is designed for coefficient fields having characteristic zero or big enough with respect to the number of solutions. If the base field is the field of the rational numbers then the resolution is first performed modulo a random prime number after we have applied a random change of coordinates. Then we search for coordinates with small integers and lift the solutions up to the rational numbers. Our implementation is available within our package Kronecker from version 0.166, which is written in the Magma computer algebra system.
    [Show full text]
  • Cutting Planes in Constraint Logic Programming
    Cutting Planes in Constraint Logic Programming Alexander Bockmayr MPI{I{94{207 February 1994 Author's Address Alexander Bockmayr, Max-Planck-Institut f¨urInformatik, Im Stadtwald, D-66123 Saarbr¨ucken, bockmayr@mpi-sb.mpg.de Publication Notes The present report has been submitted for publication elsewhere and will be copyrighted if accepted. Acknowledgements This work benefited from discussions with P. Barth and S. Ceria. It was supported by the German Ministry for Research and Technology (BMFT) (contract ITS 9103), the ESPRIT Basic Research Project ACCLAIM (contract EP 7195) and the ESPRIT Working Group CCL (contract EP 6028). Abstract In this paper, we show how recently developed techniques from combinatorial optimization can be embedded into constraint logic programming. We develop a constraint solver for the constraint logic programming language CLP(PB) for logic programming with pseudo-Boolean constraints. Our approach is based on the generation of polyhedral cutting planes and the concept of branch-and-cut. In the case of 0-1 constraints, this can improve or replace the finite domain techniques used in existing constraint logic programming systems. Contents 1 Introduction 2 2 Constraint Logic Programming with 0-1 Constraints 3 2.1 Main problems ::::::::::::::::::::::::::::::::::::::: 5 2.2 Pseudo-Boolean and finite domain constraints :::::::::::::::::::::: 6 3 Solving 0-1 Constraints 6 3.1 Equality descriptions of the solution set ::::::::::::::::::::::::: 6 3.2 Inequality descriptions ::::::::::::::::::::::::::::::::::: 7 3.3 Size of the representation ::::::::::::::::::::::::::::::::: 8 3.4 Strength of the representation ::::::::::::::::::::::::::::::: 9 3.5 Defining a solved form ::::::::::::::::::::::::::::::::::: 9 4 Computing the Solved Form 12 5 Branch and Cut 15 6 Conclusion and Further Research 17 A Correctness and Completeness of the Specialized Cutting Plane Algorithm 20 B Cut Lifting 22 1 1 Introduction Constraint logic programming has been one of the major developments in declarative programming in recent years [JM94].
    [Show full text]
  • Lesson 1: Solutions to Polynomial Equations
    NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 1 M3 PRECALCULUS AND ADVANCED TOPICS Lesson 1: Solutions to Polynomial Equations Student Outcomes . Students determine all solutions of polynomial equations over the set of complex numbers and understand the implications of the fundamental theorem of algebra, especially for quadratic polynomials. Lesson Notes Students studied polynomial equations and the nature of the solutions of these equations extensively in Algebra II Module 1, extending factoring to the complex realm. The fundamental theorem of algebra indicates that any polynomial function of degree 푛 will have 푛 zeros (including repeated zeros). Establishing the fundamental theorem of algebra was one of the greatest achievements of nineteenth-century mathematics. It is worth spending time further exploring it now that students have a much broader understanding of complex numbers. This lesson reviews what they learned in previous grades and provides additional support for their understanding of what it means to solve polynomial equations over the set of complex numbers. Students work with equations with complex number solutions and apply identities such as 푎2 + 푏2 = (푎 + 푏푖)(푎 − 푏푖) for real numbers 푎 and 푏 to solve equations and explore the implications of the fundamental theorem of algebra (N-CN.C.8 and N-CN.C.9). Throughout the lesson, students vary their reasoning by applying algebraic properties (MP.3) and examining the structure of expressions to support their solutions and make generalizations (MP.7 and MP.8). Relevant definitions introduced in Algebra II are provided in the student materials for this lesson. A note on terminology: Equations have solutions, and functions have zeros.
    [Show full text]
  • Topology MATH 4181 Fall Semester 1999
    Topology MATH 4181 Fall Semester 1999 David C. Royster UNC Charlotte November 11, 1999 Chapter 1 Introduction to Topology 1.1 History1 Topology is thought of as a discipline that has emerged in the twentieth century. There are precursors of topology dating back into the 1600's. Gottfried Wilhelm Leibniz (1646{1716) was the first to foresee a geometry in which position, rather than magnitude was the most important factor. In 1676 Leibniz use the term geometria situs(geometry of position) in predicting the development of a type of vector calculus somewhat similar to topology as we see it today. The first practical application of topology was made in the year 1736 by the Swiss mathematician Leonhard Euler (1707{1783) in the K¨onigsberg Bridge Problem. Carl F. Gauss (1777{1855) predicted in 1833 that geometry of location would become a mathematical discipline of great importance. His studey of closed surfaces such as the sphere and the torus and surfaces much like those encountered in multi- dimensional calculus may be considered as a harbinger of general topology. Gauss was also interested in knots, which are of current interest today in topology. The word topology was first used by the German mathematics Joseph B. Listing (1808{1882) in the title of his book Vorstudien zur Topologie (Introductory Studies in Topology), a textbook published in 1847. Listing book dealt with knots and sur- faces but failed to generate much interest in either the name or the subject matter. Throughout much of the nineteenth and early twentieth centuries, much of what now falls under the auspices of topology was studied under the name of analysis situs (analysis of position).
    [Show full text]
  • Solving Systems of Polynomial Equations Bernd Sturmfels
    Solving Systems of Polynomial Equations Bernd Sturmfels Department of Mathematics, University of California at Berkeley, Berkeley, CA 94720, USA E-mail address: bernd@math.berkeley.edu 2000 Mathematics Subject Classification. Primary 13P10, 14Q99, 65H10, Secondary 12D10, 14P10, 35E20, 52B20, 62J12, 68W30, 90C22, 91A06. The author was supported in part by the U.S. National Science Foundation, grants #DMS-0200729 and #DMS-0138323. Abstract. One of the most classical problems of mathematics is to solve sys- tems of polynomial equations in several unknowns. Today, polynomial models are ubiquitous and widely applied across the sciences. They arise in robot- ics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, machine learning, control theory, and numerous other areas. The set of solutions to a system of polynomial equations is an algebraic variety, the basic object of algebraic geometry. The algorithmic study of algebraic vari- eties is the central theme of computational algebraic geometry. Exciting recent developments in symbolic algebra and numerical software for geometric calcu- lations have revolutionized the field, making formerly inaccessible problems tractable, and providing fertile ground for experimentation and conjecture. The first half of this book furnishes an introduction and represents a snapshot of the state of the art regarding systems of polynomial equations. Afficionados of the well-known text books by Cox, Little, and O’Shea will find familiar themes in the first five chapters: polynomials in one variable, Gr¨obner bases of zero-dimensional ideals, Newton polytopes and Bernstein’s Theorem, multidimensional resultants, and primary decomposition. The second half of this book explores polynomial equations from a variety of novel and perhaps unexpected angles.
    [Show full text]