Misplaced Pages

Wilkie's theorem

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Partial quantifier elimination for ordered fields with exponentials

In mathematics, Wilkie's theorem is a result by Alex Wilkie about the theory of ordered fields with an exponential function, or equivalently about the geometric nature of exponential varieties.

Formulations

In terms of model theory, Wilkie's theorem deals with the language Lexp = (+, −, ·, <, 0, 1, e), the language of ordered rings with an exponential function e. Suppose φ(x1, ..., xm) is a formula in this language. Then Wilkie's theorem states that there is an integer n ≥ m and polynomials f1, ..., fr ∈ Z such that φ(x1, ..., xm) is equivalent to the existential formula

∃ x m + 1 … ∃ x n f 1 ( x 1 , … , x n , e x 1 , … , e x n ) = ⋯ = f r ( x 1 , … , x n , e x 1 , … , e x n ) = 0. {\displaystyle \exists x_{m+1}\ldots \exists x_{n}\,f_{1}(x_{1},\ldots ,x_{n},e^{x_{1}},\ldots ,e^{x_{n}})=\cdots =f_{r}(x_{1},\ldots ,x_{n},e^{x_{1}},\ldots ,e^{x_{n}})=0.}

Thus, while this theory does not have full quantifier elimination, formulae can be put in a particularly simple form. This result proves that the theory of the structure Rexp, that is the real ordered field with the exponential function, is model complete.

In terms of analytic geometry, the theorem states that any definable set in the above language — in particular the complement of an exponential variety — is in fact a projection of an exponential variety. An exponential variety over a field K is the set of points in K where a finite collection of exponential polynomials simultaneously vanish. Wilkie's theorem states that if we have any definable set in an Lexp structure K = (K, +, −, ·, 0, 1, e), say X ⊂ K, then there will be an exponential variety in some higher dimension K such that the projection of this variety down onto K will be precisely X.

Gabrielov's theorem

The result can be considered as a variation of Gabrielov's theorem. This earlier theorem of Andrei Gabrielov dealt with sub-analytic sets, or the language Lan of ordered rings with a function symbol for each proper analytic function on R restricted to the closed unit cube . Gabrielov's theorem states that any formula in this language is equivalent to an existential one, as above. Hence the theory of the real ordered field with restricted analytic functions is model complete.

Intermediate results

Gabrielov's theorem applies to the real field with all restricted analytic functions adjoined, whereas Wilkie's theorem removes the need to restrict the function, but only allows one to add the exponential function. As an intermediate result Wilkie asked when the complement of a sub-analytic set could be defined using the same analytic functions that described the original set. It turns out the required functions are the Pfaffian functions. In particular the theory of the real ordered field with restricted, totally defined Pfaffian functions is model complete. Wilkie's approach for this latter result is somewhat different from his proof of Wilkie's theorem, and the result that allowed him to show that the Pfaffian structure is model complete is sometimes known as Wilkie's theorem of the complement. See also.

References

  1. ^ A.J. Wilkie, Model completeness results for expansions of the ordered field of real numbers by restricted pfaffian functions and the exponential functions, J. Amer. Math. Soc. 9 (1996), pp. 1051–1094.
  2. A. Gabrielov, Projections of semi-analytic sets, Functional Anal. Appl. 2 (1968), pp.282–291.
  3. A.J. Wilkie, A theorem of the complement and some new o-minimal structures, Sel. Math. 5 (1999), pp.397–421.
  4. M. Karpinski and A. Macintyre, A generalization of Wilkie's theorem of the complement, and an application to Pfaffian closure, Sel. math., New ser. 5 (1999), pp.507-516
Categories: