Introduction to Geometry

Create your own 3D theme park with Blender's procedural modeling toolset Geometry Nodes!

This book provides an introduction to topology, differential topology, and differential geometry. It is based on manuscripts refined through use in a variety of lecture courses. The first chapter covers elementary results and concepts from point-set topology. An exception is the Jordan Curve Theorem, which is proved for polygonal paths and is intended to give students a first glimpse into the nature of deeper topological problems.

This book provides an introduction to topology, differential topology, and differential geometry. It is based on manuscripts refined through use in a variety of lecture courses. The first chapter covers elementary results and concepts from point-set topology. An exception is the Jordan Curve Theorem, which is proved for polygonal paths and is intended to give students a first glimpse into the nature of deeper topological problems.

In theory there is no difference between theory and practice. In practice there is. Yogi Berra A SINGULAR Introduction to Commutative Algebra offers a rigorous intro­ duction to commutative algebra and, at the same time, provides algorithms and computational practice. In this book, we do not separate the theoretical and the computational part. Coincidentally, as new concepts are introduced, it is consequently shown, by means of concrete examples and general proce­ dures, how these concepts are handled by a computer. We believe that this combination of theory and practice will provide not only a fast way to enter a rather abstract field but also a better understanding of the theory, showing concurrently how the theory can be applied. We exemplify the computational part by using the computer algebra sys­ tem SINGULAR, a system for polynomial computations, which was developed in order to support mathematical research in commutative algebra, algebraic geometry and singularity theory. As the restriction to a specific system is necessary for such an exposition, the book should be useful also for users of other systems (such as Macaulay2 and CoCoA) with similar goals. Indeed, once the algorithms and the method of their application in one system is known, it is usually not difficult to transfer them to another system.

From the reviews of the first edition:
"It is certainly no exaggeration to say that … A Singular Introduction to Commutative Algebra aims to lead a further stage in the computational revolution in commutative algebra … . Among the great strengths and most distinctive features … is a new, completely unified treatment of the global and local theories. … making it one of the most flexible and most efficient systems of its type….another strength of Greuel and Pfister's book is its breadth of coverage of theoretical topics in the portions of commutative algebra closest to algebraic geometry, with algorithmic treatments of almost every topic….Greuel and Pfister have written a distinctive and highly useful book that should be in the library of every commutative algebraist and algebraic geometer, expert and novice alike."

From the reviews of the first printing, published as Volume 7 of the Encyclopaedia of Mathematical Sciences:
"…… In this volume, we find an introductory essay entitled "Remarkable Facts of Complex Analysis" by Vitushkin… This is followed by articles by G.M.Khenkin on integral formulas in complex analysis, by E.M.Chirka on complex analytic sets, by Vitushkin on the geometry of hypersurfaces and by P.Dolbeault, on the theory of residues in several variables. … In sum, the volume under review is the first quarter of an important work that surveys an active branch of modern mathematics. Some of the individual articles are reminiscent in style of the early volumes of the first Ergebnisse series and will probably prove to be equally useful as a reference; all contain substantial lists of references."
Bulletin of the American Mathematical Society, 1991 "… This remarkable book has a helpfully informal style, abundant motivation, outlined proofs followed by precise references, and an extensive bibliography; it will be an invaluable reference and a companion to modern courses on several complex variables."

These notes are based on lectures given in the semmar on "Coding Theory and Algebraic Geometry" held at Schloss Mickeln, Diisseldorf, November 16-21, 1987. In 1982 Tsfasman, Vladut and Zink, using algebraic geometry and ideas of Goppa, constructed a seqeunce of codes that exceed the Gilbert-Varshamov bound. The result was considered sensational.