Tarski–Seidenberg theorem

Tarski–Seidenberg theorem
Name	Tarski–Seidenberg theorem
Field	Mathematical logic; Real algebraic geometry; Model theory
Statement	Projection of a semialgebraic set is semialgebraic
First proved	1948 (Tarski), 1954 (Seidenberg)
Named after	Alfred Tarski; Abraham Seidenberg

Tarski–Seidenberg theorem is a central result asserting that the projection of a semialgebraic set in Euclidean space is again semialgebraic, providing decidability and closure properties that connect logic, algebra, and geometry. The theorem links work of Alfred Tarski and Abraham Seidenberg to later developments by figures such as Andrei Kolmogorov, Oleg Viro, Heisuke Hironaka, René Thom, and institutions like the Institute for Advanced Study and Princeton University. It underpins algorithmic approaches in fields associated with David Hilbert, Emmy Noether, Oscar Zariski, and Jean-Pierre Serre.

Statement and equivalent formulations

The theorem can be stated: if S ⊂ R^n is semialgebraic then its image under the coordinate projection π: R^n → R^m is semialgebraic. This formulation is equivalent to quantifier elimination for the real closed field (RCF) theory of Alfred Tarski and is connected to decidability results pursued by Kurt Gödel, Alonzo Church, Stephen Kleene, and Turing Award–related computation theories. One equivalent algebraic formulation uses the real spectrum and sums of squares methods developed in the tradition of David Hilbert and Emil Artin, while a geometric equivalent appears in the language of constructible sets studied by Oscar Zariski, André Weil, and Alexander Grothendieck. Model-theoretic equivalences relate it to quantifier elimination proven in works influenced by Wilhelm Ackermann and Jerzy Łoś.

Historical background and contributors

The result originated in the papers of Alfred Tarski (decision method for RCF) and Abraham Seidenberg (elimination theory in real algebraic geometry), with antecedents in elimination work of Giuseppe Gentile and algebraic investigations by Carl Friedrich Gauss and Évariste Galois. Key contributors who clarified and expanded the theorem include Dana Scott, Michael Rabin, Julia Robinson, Andrei Kolmogorov, and Athanase Papadopoulos in different aspects of decidability and quantifier elimination. Subsequent refinements and algorithmic analyses were carried out at institutions such as Harvard University, University of California, Berkeley, Massachusetts Institute of Technology, and the Courant Institute, with notable papers by George Collins introducing cylindrical algebraic decomposition, and later algorithmic complexity bounds by Floyd-style collaborators and researchers influenced by Stephen Smale.

Proofs and methods

Proof techniques divide into logical, algebraic, and geometric streams. Tarski's original approach used model-theoretic quantifier elimination methods connected to the work of Alonzo Church and Kurt Gödel. Seidenberg provided an algebraic elimination proof using resultants and polynomial ideals in the spirit of Emmy Noether and David Hilbert. Modern constructive proofs deploy cylindrical algebraic decomposition (CAD) introduced by George Collins, with algorithmic refinements drawing on complexity theory associated with Leslie Valiant and Richard Karp. Alternative methods use the theory of Pfaffian functions related to Wilhelm Wirtinger and resolution techniques in the atmosphere of Heisuke Hironaka and René Thom. Seminal expositions relate the theorem to model completeness results developed in interactions among Saharon Shelah, Anand Pillay, and Ehud Hrushovski.

Consequences and applications

Consequences span decidability of first-order sentences over real closed fields—impacting work by Tarski and Julia Robinson—and form the backbone of algorithmic real algebraic geometry employed in robotics research at Carnegie Mellon University and control theory at California Institute of Technology. Applications include motion planning problems studied by Michael Shub and Stephen Smale, verification problems in formal methods linked to Edmund Clarke and Allen Emerson, and semidefinite programming approaches inspired by Jean-Jacques Moreau and László Lovász. The theorem influences complexity theory results associated with Richard Karp and Leslie Valiant, and it has been used in diophantine investigations connected to conjectures in the style of Hilbert's tenth problem and work by Yuri Matiyasevich.

Examples and illustrative constructions

Standard examples begin with the projection of an algebraic cylinder or a quadratic cone: projecting the circle variety described by equations studied since Isaac Newton yields a semialgebraic interval, illustrating elimination akin to methods of Niels Henrik Abel and Évariste Galois. A nontrivial example uses semialgebraic sets defined by polynomial inequalities as in classical treatments by Hermann Weyl and John von Neumann, where projecting a set defined by x^2 + y^2 ≤ 1 yields constraints in one variable expressible via sums of squares, echoing results of Emil Artin. Constructive CAD examples by George Collins demonstrate step-by-step elimination for motion planning instances considered by Richard M. Karp-inspired algorithmic research groups.

Generalizations and related results

Generalizations include Gabrielov's theorem on projections of subanalytic sets developed in contexts linked to Yakov Eliashberg and Vladimir Arnold, and related o-minimality frameworks advanced by Lou van den Dries, Alexandre Wilkie, and Anatoly Maltsev. Extensions to Pfaffian functions connect to work by Athanassios Khovanskii and Oleg Viro. In algebraic geometry, Chevalley’s theorem on constructible sets and the work of Alexander Grothendieck provide analogues in the Zariski topology, while quantifier elimination parallels in p-adic settings were pursued by Jan Denef and Igor Shafarevich. Connections to resolution of singularities invoke Heisuke Hironaka and to model theory of fields include contributions of Saharon Shelah and Ehud Hrushovski.

Category:Mathematical theorems