Algebraic geometry is a branch of mathematics which combines techniques of abstract algebra, especially commutative algebra, with the language and the problems of geometry.
It occupies a central place in modern mathematics and has multiple conceptual connections with such diverse fields as complex analysis, topology and number theory. Initially a study of systems of polynomial equations in several variables, the subject of algebraic geometry starts where equation solving leaves off, and it becomes even more important to understand the intrinsic properties of the totality of solutions of a system of equations, than to find a specific solution; this leads into some of the deepest areas in all of mathematics, both conceptually and in terms of technique.
The fundamental objects of study in algebraic geometry are algebraic varieties, geometric manifestations of solutions of systems of polynomial equations. Plane algebraic curves, which include lines, circles, parabolas, ellipses, hyperbolas, cubic curves like elliptic curves and quartic curves like lemniscates, and Cassini ovals, are some of the most studied classes of algebraic varieties. A point of the plane belongs to an algebraic curve if its coordinates satisfy a given polynomial equation. Basic questions involve the study of the points of special interest like the singular points, the inflexion points and the points at infinity. More advanced questions involve the topology of the curve and relations between the curves given by different equations. In the 20th century, algebraic geometry has split into several subareas.
- The main stream of algebraic geometry is devoted to the study of the complex points of the algebraic varieties and more generally to the points with coordinates in an algebraically closed field.
- The study of the points of an algebraic variety with coordinates in the field of the rational numbers or in a number field became algebraic number theory.
- The study of the real points of an algebraic variety is the subject of real algebraic geometry.
- A large part of singularity theory is devoted to the singularities of algebraic varieties.
- With the rise of the computers, a computational algebraic geometry area has emerged, which lies at the intersection of algebraic geometry and computer algebra. It consists essentially in developing algorithms and software for studying and finding the properties of explicitly given algebraic varieties.
- Much of the development of the main stream of algebraic geometry in the 20th century occurred within an abstract algebraic framework, with increasing emphasis being placed on "intrinsic" properties of algebraic varieties not dependent on any particular way of embedding the variety in an ambient coordinate space; this parallels developments in topology, differential and complex geometry. One key achievement of this abstract algebraic geometry is Grothendieck's scheme theory which allows one to use sheaf theory to study algebraic varieties in a way which is very similar to its use in the study of differential and analytic manifolds. This is obtained by extending the notion of point: In classical algebraic geometry, a point of an affine variety may be identified, through Hilbert's Nullstellensatz, with a maximal ideal of the coordinate ring, while the points of the corresponding affine scheme are all prime ideals of this ring. This means that a point of such a scheme may be either a usual point or a subvariety. This approach also enables a unification of the language and the tools of classical algebraic geometry, mainly concerned with complex points, and of algebraic number theory. Wiles's proof of the longstanding conjecture called Fermat's last theorem is an example of the power of this approach.
Sphere and slanted circle
In classical algebraic geometry, the main objects of interest are the vanishing sets of collections of polynomials, meaning the set of all points that simultaneously satisfy one or more polynomial equations. For instance, the two-dimensional sphere in three-dimensional Euclidean space R3 could be defined as the set of all points (x,y,z) with
- Failed to parse (Missing texvc executable; please see math/README to configure.): x^2+y^2+z^2-1=0.\,
A "slanted" circle in R3 can be defined as the set of all points (x,y,z) which satisfy the two polynomial equations
- Failed to parse (Missing texvc executable; please see math/README to configure.): x^2+y^2+z^2-1=0,\,
- Failed to parse (Missing texvc executable; please see math/README to configure.): x+y+z=0.\,
First we start with a field k. In classical algebraic geometry, this field was always the complex numbers C, but many of the same results are true if we assume only that k is algebraically closed. We consider the affine space of dimension n over k, denoted An(k) (or more simply An, when k is clear from the context). When one fixes a coordinates system, one may identify An(k) with kn. The purpose of not working with kn is to emphasize that one "forgets" the vector space structure that kn carries.
A function f : An → A1 is said to be polynomial or regular if it can be written as a polynomial, that is, if there is a polynomial p in k[x1,...,xn] such that f(M) = p(t1,...,tn) for every point M with coordinates (t1,...,tn) in An. The property of a function to be regular does not depend on the choice of a coordinate system in An.
Regular functions on affine n-space are thus exactly the same as polynomials over k in n variables. We will refer to the set of all regular functions on An as k[An].
We say that a polynomial vanishes at a point if evaluating it at that point gives zero. Let S be a set of polynomials in k[An]. The vanishing set of S (or vanishing locus) is the set V(S) of all points in An where every polynomial in S vanishes. In other words,
- Failed to parse (Missing texvc executable; please see math/README to configure.): V(S) = \{(t_1,\dots,t_n)|\forall p\in S, p(t_1,\dots,t_n) = 0\}.\,
A subset of An which is V(S), for some S, is called an algebraic set. The V stands for variety (a specific type of algebraic set to be defined below).
Given a subset U of An, can one recover the set of polynomials which generate it? If U is any subset of An, define I(U) to be the set of all polynomials whose vanishing set contains U. The I stands for ideal: if two polynomials f and g both vanish on U, then f+g vanishes on U, and if h is any polynomial, then hf vanishes on U, so I(U) is always an ideal of k[An].
Two natural questions to ask are:
- Given a subset U of An, when is U = V(I(U))?
- Given a set S of polynomials, when is S = I(V(S))?
The answer to the first question is provided by introducing the Zariski topology, a topology on An whose closed sets are the algebraic sets, and which directly reflects the algebraic structure of k[An]. Then U = V(I(U)) if and only if U is an algebraic set or equivalently a Zariski-closed set. The answer to the second question is given by Hilbert's Nullstellensatz. In one of its forms, it says that I(V(S)) is the radical of the ideal generated by S. In more abstract language, there is a Galois connection, giving rise to two closure operators; they can be identified, and naturally play a basic role in the theory; the example is elaborated at Galois connection.
For various reasons we may not always want to work with the entire ideal corresponding to an algebraic set U. Hilbert's basis theorem implies that ideals in k[An] are always finitely generated.
An algebraic set is called irreducible if it cannot be written as the union of two smaller algebraic sets. Any algebraic set is a finite union of irreducible algebraic sets and this decomposition is unique. Thus its elements are called the irreducible components of the algebraic set. An irreducible algebraic set is also called a variety. It turns out that an algebraic set is a variety if and only if it may be defined as the vanishing set of a prime ideal of the polynomial ring.
Some authors do not make a clear distinction between algebraic sets and varieties and use irreducible variety to make the distinction when needed.
Just as continuous functions are the natural maps on topological spaces and smooth functions are the natural maps on differentiable manifolds, there is a natural class of functions on an algebraic set, called regular functions or polynomial functions. A regular function on an algebraic set V contained in An is the restriction to V of a regular function on An. For an algebraic set defined on the field of the complex numbers, the regular functions are smooth and even analytic.
It may seem unnaturally restrictive to require that a regular function always extend to the ambient space, but it is very similar to the situation in a normal topological space, where the Tietze extension theorem guarantees that a continuous function on a closed subset always extends to the ambient topological space.
Just as with the regular functions on affine space, the regular functions on V form a ring, which we denote by k[V]. This ring is called the coordinate ring of V.
Since regular functions on V come from regular functions on An, there is a relationship between the coordinate rings. Specifically, if a regular function on V is the restriction of two functions f and g in k[An], then f − g is a polynomial function which is null on V and thus belongs to I(V). Thus k[V] may be identified with k[An]/I(V).
Using regular functions from an affine variety to A1, we can define regular maps from one affine variety to another. First we will define a regular map from a variety into affine space: Let V be a variety contained in An. Choose m regular functions on V, and call them f1, ..., fm. We define a regular map f from V to Am by letting f = (f1, ..., fm). In other words, each fi determines one coordinate of the range of f.
If V' is a variety contained in Am, we say that f is a regular map from V to V' if the range of f is contained in V'.
The definition of the regular maps apply also to algebraic sets. The regular maps are also called morphisms, as they make the collection of all affine algebraic sets into a category, where the objects are the affine algebraic sets and the morphisms are the regular maps. The affine varieties is a subcategory of the category of the algebraic sets.
Given a regular map g from V to V' and a regular function f of k[V'], then f∘g∈k[V]. The map f→f∘g is a ring homomorphism from k[V'] to k[V]. Conversely, every ring homomorphism from k[V'] to k[V] defines a regular map from V to V'. This defines an equivalence of categories between the category of algebraic sets and the opposite category of the finitely generated reduced k-algebras. This equivalence is one of the starting points of scheme theory.
Contrarily to the preceding ones, this section concerns only varieties and not algebraic sets. On the other hand the definitions extend naturally to projective varieties (next section), as an affine variety and its projective completion have the same field of functions.
If V is an affine variety, its coordinate ring is an integral domain and has thus a field of fractions which is denoted k(V) and called the field of the rational functions on V or, shortly, the function field of V. Its elements are the restrictions to V of the rational functions over the affine space containing V. The domain of a rational function f is not V but the complement of the subvariety (a hypersurface) where the denominator of f vanishes.
Like for regular maps, one may define a rational map from a variety V to a variety V'. Like for the regular maps, the rational maps from V to V' may be identified to the field homomorphisms from k(V') to k(V).
Two affine varieties are birationally equivalent if there two rational functions between them which are inverse one to the other in the regions where both are defined. Equivalently, they are birationally equivalent if their function fields are isomorphic.
An affine variety is a rational variety if it is birationally equivalent to an affine space. This means that the variety admits a rational parameterization. For example, the circle of equation x^2 + y^2 − 1 = 0 is a rational curve, as it has the parameterization
- Failed to parse (Missing texvc executable; please see math/README to configure.): x=\frac{2\,t}{1+t^2}
- Failed to parse (Missing texvc executable; please see math/README to configure.): y=\frac{1-t^2}{1+t^2}\,,
which may also be viewed as a rational map from the line to the circle.
The problem of resolution of singularities is to know if every algebraic variety is birationally equivalent to a variety whose projective completion is non singular (see also smooth completion). It has been positively solved in characteristic 0 by Hironaka in 1964 and is yet unsolved in finite characteristic.
parabola (
y =
x2, red) and cubic (
y =
x3, blue) in projective space
Many properties of the affine varieties depend on their behaviour "at infinity".
For example, consider the variety V(y − x2). If we draw it, we get a parabola. As x increases, the slope of the line from the origin to the point (x, x2) becomes larger and larger. As x decreases, the slope of the same line becomes smaller and smaller.
Compare this to the variety V(y − x3). This is a cubic curve. As x increases, the slope of the line from the origin to the point (x, x3) becomes larger and larger just as before. But unlike before, as x decreases, the slope of the same line again becomes larger and larger. So the behavior "at infinity" of V(y − x3) is different from the behavior "at infinity" of V(y − x2).
The consideration of the projective completion of the two curves, which is their prolongation "at infinity" in the projective plane, allows to quantify this difference: the point at infinity of the parabola is a regular point, whose tangent is the line at infinity, while the point at infinity of the cubic curve is a cusp. Also, both curves are rational, as they are parameterized by x, and Riemann-Roch theorem implies that the cubic curve must have a singularity, which must be at infinity, as all its points in the affine space are regular.
Thus many of the properties of the algebraic varieties, including birational equivalence and all the topological properties depends on the behavior "at infinity" and, thus imply to study the varieties in the projective space. Furthermore, the introduction of projective techniques made many theorems in algebraic geometry simpler and sharper: For example, Bézout's theorem on the number of intersection points between two varieties can be stated in its sharpest form only in projective space. For these reasons, projective space plays a fundamental role in algebraic geometry.
Nowadays, the projective space Pn of dimension n is usually defined as the set of the lines passing through a point, considered as the origin, in the affine space of dimension n+1, or equivalently to the set of the vector lines in a vector space of dimension n+1. When a coordinate system has been chosen in the space of dimension n+1, all the points of a line have the same set of coordinates, up to the multiplication by an element of k. This defines the homogeneous coordinates of a point of Pn as a sequence of n+1 elements of the base field k, defined up to the multiplication by a non zero element of k (the same for the whole sequence).
Given a polynomial in n+1 variables, it vanishes at all the point of a line passing through the origin if and only if it is homogeneous. In this case, one says that the polynomial vanishes at the corresponding point of Pn. This allows to define a projective algebraic set in Pn as the set V(f1, ..., fk) where vanishes a finite set of homogeneous polynomials {f1, ..., fk}. Like for affine algebraic sets, there is a bijection between the projective algebraic sets and the reduced homogeneous ideals which define them. The projective varieties are the projective algebraic sets whose defining ideal is prime. In other words, a projective variety is a projective algebraic set, whose homogeneous coordinate ring is an integral domain, the projective coordinates ring being defined as the quotient of the graded ring or the polynomials in n+1 variables by the homogeneous (reduced) ideal defining the variety. Every projective algebraic set may be uniquely decomposed into a finite union of projective varieties.
The only regular functions which may be defined properly on a projective variety are the constant functions. Thus this notion is not used in projective situations. On the other hand the field of the rational functions or function field is a useful notion, which, similarly as in the affine case, is defined as the set of the quotients of two homogeneous elements of the same degree in the homogeneous coordinate ring.
The real algebraic geometry is the study of the real points of the algebraic geometry.
The fact that the field of the reals number is an ordered field may not be occulted in such a study. For example, the curve of equation Failed to parse (Missing texvc executable; please see math/README to configure.): x^2+y^2-a=0
is a circle if Failed to parse (Missing texvc executable; please see math/README to configure.): a>0
, but does not have any real point if Failed to parse (Missing texvc executable; please see math/README to configure.): a<0 . It follows that real algebraic geometry is not only the study of the real algebraic varieties, but has been generalized to the study of the semi-algebraic sets, which are the solutions of systems of polynomial equations and polynomial inequalities. For example, a branch of the hyperbola of equation Failed to parse (Missing texvc executable; please see math/README to configure.): x y-1 = 0
is not an algebraic variety, but is a semi-algebraic set defined by Failed to parse (Missing texvc executable; please see math/README to configure.): x y-1=0
and Failed to parse (Missing texvc executable; please see math/README to configure.): x>0
or by Failed to parse (Missing texvc executable; please see math/README to configure.): x y-1=0
and Failed to parse (Missing texvc executable; please see math/README to configure.): x+y>0
.
One of the challenging problems of real algebraic geometry is the unsolved Hilbert's sixteenth problem: Decide which respective positions are possible for the ovals of a non singular plane curve of degree 8.
One may date the origin of computational algebraic geometry to meeting EUROSAM'79 (International Symposium on Symbolic and Algebraic Manipulation) held at Marseilles, France in June 1979. At this meeting,
Since them, most results in this area are related to one or several of these items either by using or improving one of these algorithms, or by finding algorithms whose complexity is simply exponential in the number of the variables.
A Gröbner basis is a system of generators of a polynomial ideal whose computation allows to deduce many properties of the affine algebraic variety defined by the ideal.
Given an ideal I defining an algebraic set V:
- V is empty (over an algebraically closed extension of the basis field), if and only if the Gröbner basis for any monomial ordering is reduced to {1}.
- By mean of the Hilbert series one may compute the dimension and the degree of V from any Gröbner basis of I for a monomial ordering refining the total degree.
- If the dimension of V is 0, one may compute the points (finite in number) of V from any Gröbner basis of I (see systems of polynomial equations.
- A Gröbner basis computation allows to remove from V all irreducible components which are contained in a given hyper surface.
- A Gröbner basis computation allows to compute the Zariski closure of the image of V by the projection on the k first coordinates, and the subset of the image where the projection is not proper.
- More generally Gröbner basis computations allows to compute the Zariski closure of the image and the critical points of a rational function of V into another affine variety.
Gröbner basis computations do not allow to compute directly the primary decomposition of I nor the prime ideals defining the irreducible components of V, but most algorithms for this involve Gröbner basis computation. The algorithms which are not based on Gröbner bases use regular chains but may need Gröbner bases in some exceptional situations.
Gröbner base are deemed to be difficult to compute. In fact they may contain, in the worst case, polynomials whose degree is doubly exponential in the number of variables and a number of polynomials which is also doubly exponential. However, this is only a worst case complexity, and the complexity bound of Lazard's algorithm of 1979 may frequently apply. Faugère's F4 and F5 algorithms realize this complexity, as F5 algorithm may be viewed as an improvement of Lazard's 1979 algorithm. It follows that the best implementations allow to compute almost routinely with algebraic sets of degree more than 100. This means that, presently, the difficulty of computing a Gröbner basis is strongly related to the intrinsic difficulty of the problem.
CAD is an algorithm which has been introduced in 1973 by G. Collins to implement with an acceptable complexity Tarski's theorem on quantifier elimination over the real numbers.
This theorem concerns the formulas of the first-order logic whose atomic formulas are polynomial equalities or inequalities between polynomials with real coefficients. These formulas are thus the formulas which may be constructed from the atomic formulas by the logical operators and (∧), or (∨), not (¬), for all (∀) and exists (∃). Tarsky's theorem asserts that, from such a formula, one may compute an equivalent formula without quantifier (∀, ∃).
The complexity of CAD is doubly exponential in the number of variables. This means that CAD allow, in theory, to solve every problem of real algebraic geometry which may be expressed by such a formula, that is almost every problem concerning explicitly given varieties and semi-algebraic sets.
While Gröbner basis computation has doubly exponential complexity only in rare cases, CAD has almost always this high complexity. This implies that, unless if most polynomials appearing in the input are linear, it may not solve problems with more than four variables.
Since 1973, most of the research on this subject is devoted either to improve CAD or to find alternate algorithms in special cases of general interest.
As an example of the state of art, there are efficient algorithms to find at least a point in every connected component of a semi-algebraic set, and thus to test if a semi-algebraic set is empty. On the other hand CAD is yet, in practice, the best algorithm to count the number of connected components.
The basic general algorithms of computational geometry have a double exponential worst case complexity. More precisely, if d is the maximal degree of the input polynomials and n the number of variables, their complexity is at most Failed to parse (Missing texvc executable; please see math/README to configure.): d^{2^{c n}}
for some constant c, and, for some inputs, the complexity is at least Failed to parse (Missing texvc executable; please see math/README to configure.): d^{2^{c' n}}
for another constant c′.
During the last 20 years of 20th century, various algorithms have been introduced to solve specific subproblems with a better complexity. Most of these algorithms have a complexity Failed to parse (Missing texvc executable; please see math/README to configure.): d^{O(n^2)} .
Among these algorithms which solve a sub problem of the problems solved by Gröbner bases, one may cite testing if an affine variety is empty and solving non homogeneous polynomial systems which have a finite number of solutions. Such algorithms are rarely implemented because, on most entries Faugère's F4 and F5 algorithms have a better practical efficiency and probably a similar or better complexity (probably because the evaluation of the complexity of Gröbner basis algorithms on a particular class of entries is a difficult task which has be done only in few special cases).
The main algorithms of real algebraic geometry which solve a problem solved by CAD are related to the topology of semi-algebraic sets. One may cite counting the number of connected components, testing if two points are in the same components or computing a Whitney stratification of a real algebraic set. They have a complexity of Failed to parse (Missing texvc executable; please see math/README to configure.): d^{O(n^2)} , but the constant involved by O notation is so high that using them to solve any non trivial problem effectively solved by CAD, is impossible even if one could use all the existing computing power in the world. Therefore these algorithms have never been implemented and this is an active research area to search for algorithms with have together a good asymptotic complexity and a good practical efficiency.
The modern approaches to algebraic geometry redefine and effectively extend the range of basic objects in various levels of generality to schemes, formal schemes, ind-schemes, algebraic spaces, algebraic stacks and so on. The need for this arises already from the useful ideas within theory of varieties, e.g. the formal functions of Zariski can be accommodated by introducing nilpotent elements in structure rings; considering spaces of loops and arcs, constructing quotients by group actions and developing formal grounds for natural intersection theory and deformation theory lead to some of the further extensions.
Most remarkably, in late 1950s, algebraic varieties were subsumed into Alexander Grothendieck's concept of a scheme. Their local objects are affine schemes or prime spectra which are locally ringed spaces which form a category which is antiequivalent to the category of commutative unital rings, extending the duality between the category of affine algebraic varieties over a field k, and the category of finitely generated reduced k-algebras. The gluing is along Zariski topology; one can glue within the category of locally ringed spaces, but also, using the Yoneda embedding, within the more abstract category of presheaves of sets over the category of affine schemes. The Zariski topology in the set theoretic sense is then replaced by a Zariski topology in the sense of Grothendieck topology. Grothendieck introduced Grothendieck topologies having in mind more exotic but geometrically finer and more sensitive examples than the crude Zariski topology, namely the étale topology, and the two flat Grothendieck topologies: ffpf and fpqc; nowadays some other examples became prominent including Nisnevich topology. Sheaves can be furthermore generalized to stacks in the sense of Grothendieck, usually with some additional representability conditions leading to Artin stacks and, even finer, Deligne-Mumford stacks, both often called algebraic stacks.
Sometimes other algebraic sites replace the category of affine schemes. For example, Nikolai Durov has introduced commutative algebraic monads as a generalization of local objects in a generalized algebraic geometry. Versions of a tropical geometry, of an absolute geometry over a field of one element and an algebraic analogue of Arakelov's geometry were realized in this setup.
Another formal generalization is possible to Universal algebraic geometry in which every variety of algebra has its own algebraic geometry. The term variety of algebra should not be confused with algebraic variety.
The language of schemes, stacks and generalizations has proved to be a valuable way of dealing with geometric concepts and became cornerstones of modern algebraic geometry.
Algebraic stacks can be further generalized and for many practical questions like deformation theory and intersection theory, this is often the most natural approach. One can extend the Grothendieck site of affine schemes to a higher categorical site of derived affine schemes, by replacing the commutative rings with an infinity category of differential graded commutative algebras, or of simplicial commutative rings or a similar category with an appropriate variant of a Grothendieck topology. One can also replace presheaves of sets by presheaves of simplicial sets (or of infinity groupoids). Then, in presence of an appropriate homotopic machinery one can develop a notion of derived stack as such a presheaf on the infinity category of derived affine schemes, which is satifsying certain infinite categorical version of a sheaf axiom (and to be algebraic, inductively a sequence of representability conditions). Quillen model categories, Segal categories and quasicategories are some of the most often used tools to formalize this yielding the derived algebraic geometry, introduced by the school of Carlos Simpson, including Andre Hirschowitz, Bertrand Toën, Gabrielle Vezzosi, Michel Vaquié and others; and developed further by Jacob Lurie, Bertrand Toën, and Gabrielle Vezzosi. Another (noncommutative) version of derived algebraic geometry, using A-infinity categories has been developed from early 1990-s by Maxim Kontsevich and followers.
Some of the roots of algebraic geometry date back to the work of the Hellenistic Greeks from the 5th century BC. The Delian problem, for instance, was to construct a length x so that the cube of side x contained the same volume as the rectangular box a2b for given sides a and b. Menechmus (circa 350 BC) considered the problem geometrically by intersecting the pair of plane conics ay = x2 and xy = ab.[1] The later work, in the 3rd century BC, of Archimedes and Apollonius studied more systematically problems on conic sections,[2] and also involved the use of coordinates.[1] The Arab mathematicians were able to solve by purely algebraic means certain cubic equations, and then to interpret the results geometrically. This was done, for instance, by Ibn al-Haytham in the 10th century AD.[3] Subsequently, Persian mathematician Omar Khayyám (born 1048 A.D.) discovered the general method of solving cubic equations by intersecting a parabola with a circle.[4] Each of these early developments in algebraic geometry dealt with questions of finding and describing the intersections of algebraic curves.
Such techniques of applying geometrical constructions to algebraic problems were also adopted by a number of Renaissance mathematicians such as Gerolamo Cardano and Niccolò Fontana "Tartaglia" on their studies of the cubic equation. The geometrical approach to construction problems, rather than the algebraic one, was favored by most 16th and 17th century mathematicians, notably Blaise Pascal who argued against the use of algebraic and analytical methods in geometry.[5] The French mathematicians Franciscus Vieta and later René Descartes and Pierre de Fermat revolutionized the conventional way of thinking about construction problems through the introduction of coordinate geometry. They were interested primarily in the properties of algebraic curves, such as those defined by Diophantine equations (in the case of Fermat), and the algebraic reformulation of the classical Greek works on conics and cubics (in the case of Descartes).
During the same period, Blaise Pascal and Gérard Desargues approached geometry from a different perspective, developing the synthetic notions of projective geometry. Pascal and Desargues also studied curves, but from the purely geometrical point of view: the analog of the Greek ruler and compass construction. Ultimately, the analytic geometry of Descartes and Fermat won out, for it supplied the 18th century mathematicians with concrete quantitative tools needed to study physical problems using the new calculus of Newton and Leibniz. However, by the end of the 18th century, most of the algebraic character of coordinate geometry was subsumed by the calculus of infinitesimals of Lagrange and Euler.
It took the simultaneous 19th century developments of non-Euclidean geometry and Abelian integrals in order to bring the old algebraic ideas back into the geometrical fold. The first of these new developments was seized up by Edmond Laguerre and Arthur Cayley, who attempted to ascertain the generalized metric properties of projective space. Cayley introduced the idea of homogeneous polynomial forms, and more specifically quadratic forms, on projective space. Subsequently, Felix Klein studied projective geometry (along with other sorts of geometry) from the viewpoint that the geometry on a space is encoded in a certain class of transformations on the space. By the end of the 19th century, projective geometers were studying more general kinds of transformations on figures in projective space. Rather than the projective linear transformations which were normally regarded as giving the fundamental Kleinian geometry on projective space, they concerned themselves also with the higher degree birational transformations. This weaker notion of congruence would later lead members of the 20th century Italian school of algebraic geometry to classify algebraic surfaces up to birational isomorphism.
The second early 19th century development, that of Abelian integrals, would lead Bernhard Riemann to the development of Riemann surfaces.
In the same period began the algebraization of the algebraic geometry through commutative algebra. The prominent results in this direction are David Hilbert's basis theorem ans Nullstellensatz, which are the basis of the connexion between algebraic geometry and commutative algebra, and Francis Sowerby Macaulay's multivariate resultant, which is the basis of elimination theory. Probably because of the size of the computation which is implied by multivariate resultant, elimination theory has been forgotten during the middle of 20th century before to be renewed by singularity theory and computational algebraic geometry.[6]
B. L. van der Waerden, Oscar Zariski and André Weil developed a foundation for algebraic geometry based on contemporary commutative algebra, including valuation theory and the theory of ideals. One of the goals was to gives a rigorous framework for proving the results of Italian school of algebraic geometry. In particular, this school used systematically the notion of generic point without any precise definition, which was first given by these authors during the 1930s.
In the 1950s and 1960s Jean-Pierre Serre and Alexander Grothendieck recast the foundations making use of sheaf theory. Later, from about 1960, and largely spearheaded by Grothendieck, the idea of schemes was worked out, in conjunction with a very refined apparatus of homological techniques. After a decade of rapid development the field stabilized in the 1970s, and new applications were made, both to number theory and to more classical geometric questions on algebraic varieties, singularities and moduli.
An important class of varieties, not easily understood directly from their defining equations, are the abelian varieties, which are the projective varieties whose points form an abelian group. The prototypical examples are the elliptic curves, which have a rich theory. They were instrumental in the proof of Fermat's last theorem and are also used in elliptic curve cryptography.
In parallel with the abstract trend of the algebraic geometry, which is concerned with general statements about varieties, methods for effective computation with concretely-given varieties have also been developed, which lead to the new area of computational algebraic geometry. One of the founding methods of this area is the theory of Gröbner bases, introduced by Bruno Buchberger in 1965. Another funding method, more specially devoted to real algebraic geometry, is the cylindrical algebraic decomposition, introduced by George E. Collins in 1973.
Algebraic geometry now finds application in statistics,[7] control theory,[8] robotics,[9] error-correcting codes,[10] phylogenetics[11] and geometric modelling.[12] There are also connections to string theory,[13] game theory,[14] graph matchings,[15] solitons[16] and integer programming.[17]
- ^ a b Dieudonné, Jean (1972). "The historical development of algebraic geometry". The American Mathematical Monthly 79 (8): 827–866. DOI:10.2307/2317664. JSTOR 2317664.
- ^ Kline, M. (1972) Mathematical Thought from Ancient to Modern Times (Volume 1). Oxford University Press. pp. 108, 90.
- ^ Kline, M. (1972) Mathematical Thought from Ancient to Modern Times (Volume 1). Oxford University Press. p. 193.
- ^ Kline, M. (1972) Mathematical Thought from Ancient to Modern Times (Volume 1). Oxford University Press. pp. 193–195.
- ^ Kline, M. (1972) Mathematical Thought from Ancient to Modern Times (Volume 1). Oxford University Press. p. 279.
- ^ A witness of this oblivion is the fact that Van der Waerden has removed the chapter on elimination theory from the third edition (and all the subsequent ones) if his treatise Moderne algebra (in German).
- ^ Mathias Drton, Bernd Sturmfels, Seth Sullivant (2009), Lectures on Algebraic Statistics Springer, ISBN 978-3-7643-8904-8
- ^ Peter L. Falb (1990), Methods of algebraic geometry in control theory, Birkhäuser, ISBN 978-3-7643-3454-3
- ^ J. M. Selig (205), Geometric fundamentals of robotics, Springer, ISBN 978-0-387-20874-9
- ^ Michael A. Tsfasman, Serge G. Vlăduț, Dmitry Nogin (2007), Algebraic geometric codes: basic notions, AMS Bookstore, ISBN 978-0-8218-4306-2
- ^ Barry A. Cipra (2007), Algebraic Geometers See Ideal Approach to Biology, SIAM News, Volume 40, Number 6
- ^ Bert Jüttler, Ragni Piene (2007) Geometric modeling and algebraic geometry, Springer, ISBN 978-3-540-72184-0
- ^ David A. Cox, Sheldon Katz (1999) Mirror symmetry and algebraic geometry, AMS Bookstore, ISBN 978-0-8218-2127-5
- ^ The algebraic geometry of perfect and sequential equilibrium, LE Blume, WR Zame - Econometrica: Journal of the Econometric Society, 1994 - jstor.org
- ^ Richard Kenyon; Andrei Okounkov; Scott Sheffield (2003). "Dimers and Amoebae". arXiv:math-ph/0311005 [math-ph].
- ^ IM Krichever and PG Grinevich, Algebraic geometry methods in soliton theory, Chapter 14 of Soliton theory, Allan P. Fordy, Manchester University Press ND, 1990, ISBN 978-0-7190-1491-8
- ^ David A. Cox, Bernd Sturmfels, Dinesh N. Manocha (1997 Applications of computational algebraic geometry, AMS Bookstore, ISBN 978-0-8218-0750-7
A classical textbook, predating schemes:
Modern textbooks that do not use the language of schemes:
Textbooks in computational algebraic geometry
- Saugata Basu; Richard Pollack, Marie-Françoise Roy (2006). Algorithms in real algebraic geometry. Springer-Verlag.
- Laureano González-Vega, Tómas Recio (1996). Algorithms in algebraic geometry and applications. Birkhaüser.
- Mohamed Elkadi, Bernard Mourrain, Ragni Piene (2006). Algebraic geometry and geometric modeling. Springer-Verlag.
- Alicia Dickenstein (2008). Algorithms in algebraic geometry. Springer-Verlag.
- David A. Cox, John B. Little, Donal O'Shea (1998). Using algebraic geometry. Springer-Verlag.
- Bob F. Caviness, Jeremy R. Johnson (1998). Quantifier elimination and cylindrical algebraic decomposition. Springer-Verlag.
Textbooks and references for schemes:
On the Internet:
