HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, the Tarski–Seidenberg theorem states that a set in (''n'' + 1)-dimensional space defined by
polynomial equation In mathematics, an algebraic equation or polynomial equation is an equation of the form P = 0, where ''P'' is a polynomial with coefficients in some field (mathematics), field, often the field of the rational numbers. For example, x^5-3x+1=0 is a ...
s and inequalities can be projected down onto ''n''-dimensional space, and the resulting set is still definable in terms of polynomial identities and inequalities. The
theorem In mathematics and formal logic, a theorem is a statement (logic), statement that has been Mathematical proof, proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to esta ...
—also known as the Tarski–Seidenberg projection property—is named after
Alfred Tarski Alfred Tarski (; ; born Alfred Teitelbaum;School of Mathematics and Statistics, University of St Andrews ''School of Mathematics and Statistics, University of St Andrews''. January 14, 1901 – October 26, 1983) was a Polish-American logician ...
and
Abraham Seidenberg Abraham Seidenberg (June 2, 1916 – May 3, 1988) was an American mathematician. Early life Seidenberg was born on June 2, 1916, to Harry and Fannie Seidenberg in Washington D.C. He graduated with a B.A. from the University of Maryland in 1937 ...
. It implies that
quantifier elimination Quantifier elimination is a concept of simplification used in mathematical logic, model theory, and theoretical computer science. Informally, a quantified statement "\exists x such that ..." can be viewed as a question "When is there an x such ...
is possible over the reals, that is that every
formula In science, a formula is a concise way of expressing information symbolically, as in a mathematical formula or a ''chemical formula''. The informal use of the term ''formula'' in science refers to the general construct of a relationship betwe ...
constructed from polynomial equations and inequalities by
logical connective In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant. Connectives can be used to connect logical formulas. For instance in the syntax of propositional logic, the ...
s (''or''), (''and''), (''not'') and quantifiers (''for all''), (''exists'') is equivalent to a similar formula without quantifiers. An important consequence is the decidability of the
theory A theory is a systematic and rational form of abstract thinking about a phenomenon, or the conclusions derived from such thinking. It involves contemplative and logical reasoning, often supported by processes such as observation, experimentation, ...
of real-closed fields. Although the original
proof Proof most often refers to: * Proof (truth), argument or sufficient evidence for the truth of a proposition * Alcohol proof, a measure of an alcoholic drink's strength Proof may also refer to: Mathematics and formal logic * Formal proof, a co ...
of the theorem was constructive, the resulting algorithm has a
computational complexity In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations ...
that is too high for using the method on a computer.
George E. Collins George E. Collins (born on January 10, 1928 in Stuart, Iowa – and died on November 21, 2017 in Madison, Wisconsin) was an American mathematician and computer scientist. He is the inventor of Garbage collection (computer science), garbage collec ...
introduced the algorithm of
cylindrical algebraic decomposition In mathematics, cylindrical algebraic decomposition (CAD) is a notion, along with an algorithm to compute it, that is fundamental for computer algebra and real algebraic geometry. Given a set ''S'' of polynomials in R''n'', a cylindrical algebraic ...
, which allows quantifier elimination over the reals in double exponential time. This complexity is optimal, as there are examples where the output has a double exponential number of connected components. This algorithm is therefore fundamental, and it is widely used in computational algebraic geometry.


Statement

A
semialgebraic set In mathematics, a basic semialgebraic set is a set defined by polynomial equalities and polynomial inequalities, and a semialgebraic set is a finite union of basic semialgebraic sets. A semialgebraic function is a function with a semialgebraic gr ...
in R''n'' is a finite union of sets defined by a finite number of polynomial equations and inequalities, that is by a finite number of statements of the form :p(x_1,\ldots,x_n)=0\, and :q(x_1,\ldots,x_n)>0\, for
polynomial In mathematics, a polynomial is a Expression (mathematics), mathematical expression consisting of indeterminate (variable), indeterminates (also called variable (mathematics), variables) and coefficients, that involves only the operations of addit ...
s ''p'' and ''q''. We define a projection map ''π'' : R''n''+1 → R''n'' by sending a point (''x''1, ..., ''x''''n'', ''x''''n''+1) to (''x''1, ..., ''x''''n''). Then the Tarski–Seidenberg theorem states that if ''X'' is a semialgebraic set in R''n''+1 for some ''n'' ≥ 1, then ''π''(''X'') is a semialgebraic set in R''n''.


Failure with algebraic sets

If we only define sets using polynomial equations and not inequalities then we define
algebraic set Algebraic varieties are the central objects of study in algebraic geometry, a sub-field of mathematics. Classically, an algebraic variety is defined as the set of solutions of a system of polynomial equations over the real or complex numbers. ...
s rather than ''semi''algebraic sets. For these sets the theorem fails, i.e. projections of algebraic sets need not be algebraic. As a simple example consider the
hyperbola In mathematics, a hyperbola is a type of smooth function, smooth plane curve, curve lying in a plane, defined by its geometric properties or by equations for which it is the solution set. A hyperbola has two pieces, called connected component ( ...
in R2 defined by the equation :xy-1=0.\, This is a perfectly good algebraic set, but projecting it down by sending (''x'', ''y'') in R2 to ''x'' in R produces the set of points satisfying ''x'' ≠ 0. This is a semialgebraic set, but it is not an algebraic set as the algebraic sets in R are R itself, the
empty set In mathematics, the empty set or void set is the unique Set (mathematics), set having no Element (mathematics), elements; its size or cardinality (count of elements in a set) is 0, zero. Some axiomatic set theories ensure that the empty set exi ...
and the finite sets. This example shows also that, over the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
s, the projection of an algebraic set may be non-algebraic. Thus the existence of real algebraic sets with non-algebraic projections does not rely on the fact that the field of real numbers is not
algebraically closed In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . In other words, a field is algebraically closed if the fundamental theorem of algebra h ...
. Another example is the
parabola In mathematics, a parabola is a plane curve which is Reflection symmetry, mirror-symmetrical and is approximately U-shaped. It fits several superficially different Mathematics, mathematical descriptions, which can all be proved to define exactl ...
in R2, which is defined by the equation :y^2-x=0. Its projection onto the ''x''-axis is the half-line intersections, unions, and set complement">int.html" ;"title=", ∞), a semialgebraic set that cannot be obtained from algebraic sets by (finite) intersection (set theory)">intersections, unions, and set complements.


Relation to structures

This result confirmed that semialgebraic sets in R''n'' form what is now known as an o-minimal structure on R. These are collections of subsets ''S''''n'' of R''n'' for each ''n'' ≥ 1 such that we can take finite unions and complements of the subsets in ''S''''n'' and the result will still be in ''S''''n'', moreover the elements of ''S''1 are simply finite unions of intervals and points. The final condition for such a collection to be an o-minimal structure is that the projection map on the first ''n'' coordinates from R''n''+1 to R''n'' must send subsets in ''S''''n''+1 to subsets in ''S''''n''. The Tarski–Seidenberg theorem tells us that this holds if ''S''''n'' is the set of semialgebraic sets in R''n''.


See also

*
Decidability of first-order theories of the real numbers In mathematical logic, a first-order language of the real numbers is the set of all well-formed sentences of first-order logic that involve universal and existential quantifiers and logical combinations of equalities and inequalities of expressi ...


References

* * *


External links


Tarski–Seidenberg theorem
at PlanetMath.org {{DEFAULTSORT:Tarski-Seidenberg theorem Real algebraic geometry Theorems in algebraic geometry