Tarski–Seidenberg theorem
Tarski–Seidenberg theorem is a theorem in mathematical logic.
All 3 facts, and where they come from
Facts
3 facts · 0 confirmed by two sources · 0 cited · 3 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 16, 2026 · revision 2398126923
- Described as
- theorem in mathematical logic
- Other names
- generalized Sturm theorem, Tarski-Seidenberg theorem
- What it is
- theorem
- Named after
- Alfred Tarski; Abraham Seidenberg
- Wikipedias with a page
- 2
Wikidata item Q16705451 (wikidata.org/wiki/Q16705451), public domain (CC0). Copied 2026-11-16.
What Wikipedia says · copied November 16, 2026 · revision 1375116153
In mathematics, the Tarski–Seidenberg theorem is a theorem on semialgebraic sets, that is, subsets of real coordinate spaces that can be defined by a finite set of polynomial equations and polynomial inequalities. This theorem was proved by Alfred Tarski in 1930 in view of his proof that the theory of real closed fields is complete (every formula can be proved either as true or as false) and admits quantifier elimination. The theorem was later discovered independently by Abraham Seidenberg in the context of constructive mathematics.
The theorem states that, given a set S in the (n + 1)-dimensional space, which is defined by polynomial equations and inequalities involving (n + 1) variables, the projection eliminating one of the variables can be defined similarly. In other words, if ℱ(y,x1,…,xn) is the formula defining S, there exists a formula 𝒢(x1,…,xn) that define the same set as ∃y∣ℱ(y,x1,…,xn).
Although the original proof of the theorem was constructive, the resulting algorithm is galactic, that is, it has a computational complexity that is far too high for using the method on a computer. George E. Collins introduced the algorithm of cylindrical algebraic decomposition, 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. Collins's algorithm is therefore fundamental and widely used in computational algebraic geometry.
From the Wikipedia article “Tarski–Seidenberg theorem” (en.wikipedia.org/wiki/Tarski–Seidenberg_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
