DOCSLIB.ORG

Effective Quantifier Elimination Over Real Closed Fields

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Effective Quantifier Elimination Over Real Closed Fields EFFECTIVE QUANTIFIER ELIMINATION OVER REAL CLOSED FIELDS N. Vorobjov 1 Tarski (1931, 1951): Elementary algebra and geometry is decidable. More generally, there is an algorithm for quan- tifier elimination in the first order theory of the reals. Boolean formula F (x1;:::; xº) with atoms of the kind f > 0, where f 2 R[x0; x1;:::; xº], xi = (xi;1; : : : ; xi;ni). Φ(x0) := Q1x1Q2x2 ¢ ¢ ¢ QºxºF (x0; x1;:::; xº), where Qi 2 f9; 8g, Qi 6= Qi+1. Theorem 1. There is a quantifier-free formula Ψ(x0) such that Ψ(x0) , Φ(x0) over R, n n i.e., fx0 2 R 0j Ψ(x0)g = fx0 2 R 0j Φ(x0)g. Theorem remains true if R is replaced by any real closed field R, e.g., real algebraic numbers, Puiseux series over R in an infinitesimal. 2 Theorem 2. If atoms f 2 Z[x0; x1;:::; xº], then there is an algorithm which eliminates quanti- fiers from Φ(x0), i.e., for a given Φ(x0) pro- duces Ψ(x0). Corollary 3. The first order theory of the reals is decidable, i.e., there is an algorithm which for a given closed formula Q1x1Q2x2 ¢ ¢ ¢ QºxºF (x1;:::; xº) decides whether it’s true or false. 3 Integer coefficients are mentioned here to be able to handle the problem on a Turing ma- chine. If we are less picky about the model of computation, for example allow exact arith- metic operations and comparisons in a real closed field R, then Theorem ?? and Corol- lary ?? are also true for formulae over R. In what follows we will use exactly this approach. 3-1 Let R be a real closed field. Definition 4. A set X ½ Rn is called semialgebraic if X is representable in a form X = fx 2 RnjF (x)g, where F (x) is a quantifier- free formula. n Corollary 5. Let X = fx0 2 R 0jΦ(x0)g, where Φ(x0) := Q1x1Q2x2 ¢ ¢ ¢ QºxºF (x0; x1;:::; xº). Then X is semialgebraic. 4 Examples: ² Feasibility of a system of polynomial equa- tions and inequalities (= is a semialgebraic set empty?) ² Representation of the closure (or interior, or singular locus, or tubular neighbourhood, etc.) of a semi- algebraic set by a Boolean combination of polynomial inequalities ² Polynomial optimization: find the set of points of local minima of a polynomial function on a semialgebraic set. 5 There is no need to explain to logicians the usefulness of quantifier elimination. Instead I list a few straightforward examples of how it can be used in “ordinary” mathematics. Semialgebraic set in all the examples initially can be naturally represented by prenex formu- lae with quantifiers (sometimes involving "=± language. 5-1 Complexity: Tarski’s quantifier elimination algorithm: “non-elementary” (can’t be bounded from above by any tower of exponentials of a finite height). Problem: construct an efficient algorithm Possible approach: cylindrical (algebraic) cell decomposition (mid-70s, W¨uthrich,Collins) 6 Definition 6. Cylindrical cell is defined by in- duction as follows. 1. Cylindrical 0-cell in Rn is an isolated point. Cylindrical 1-cell in R is an open interval (a; b) ½ R. 2. For n ¸ 2 and 0 · k < n a cylindrical (k + 1)-cell B in Rn is either a graph of a continuous bounded function f : C ! R, where C is a cylindrical a cylindrical (k+1)- cell in Rn¡1, or else a set of the form n f(x1; : : : ; xn) 2 R j (x1; : : : ; xn¡1) 2 C and f(x1; : : : ; xn¡1) < xn < g(x1; : : : ; xn¡1)g; where C is a cylindrical k-cell in Rn¡1, and f; g : C ! R are continuous bounded func- tions such that f(x1; : : : ; xn¡1) < g(x1; : : : ; xn¡1) for all points (x1; : : : ; xn¡1) 2 C. 7 Cylindrical cell decomposition is a very use- ful tool when we study o-minimal structures. Since I’ll need this concept also in my other lecture, let me give a definition. We first de- fine a cylindrical cell. One can notice that any cylindrical cell is homeomorphic to an open ball of the matching dimension (semialgebraically homeomorphic in the case of an arbitrary R). We will give the definition only for the bounded case. 7-1 Definition 7. Cylindrical cell decomposition D of a subset A ½ Rn is defined by induction as follows. 1. If n = 1, then D is a finite family of pair- wise disjoint cylindrical cells (i.e., isolated points and intervals) whose union is A. 2. If n ¸ 2, then D is a finite family of pair- wise disjoint cylindrical cells in Rn whose union is A and there is a cylindrical cell de- composition D0 of ¼(A) such that ¼(C) is its cell for each C 2 D, where ¼ : Rn ! Rn¡1 is the projection map onto the co- ordinate subspace of x1; : : : ; xn¡1. We say that D0 is induced by D. Definition 8. Let B ½ A ½ Rn and D be a CCD of A. Then D is compatible with B if for any C 2 D we have either C ½ B or C \ B = ; (i.e., some subset D0 ½ D is a CCD of B). 8 Example: 9 Theorem 9. (Collins, W¨uthrich). If X ½ Rn is a semialgebraic set, then there is an algorithm for computing CCD of Rn compatible with X. Moreover, CCD is semialgebraic, i.e., each cell is described by a system of polynomial equa- tions and inequalities. Technical tools: resultants and sub-resultants. Compare with classical elimination theory (van-der-Waerden, Modern Algebra) and Chevalley’s Theorem. Corollary 10. There is an algorithm for quan- tifier elimination. 10 The corollary is almost obvious from the defini- tion of the CCD. One reasons by induction on quantifiers starting from Qº and moving out- ward. On each step we use the relation (de- scribed in the definition) between the decom- position of the space of all current variables and the decomposition of the subspace of cur- rent free variables. 10-1 Complexity: Let Φ(x0) involve s atoms of the kind f > 0, where f 2 R[x0;:::; xº], n := n0 + ¢ ¢ ¢ + nº, and deg(f) < d. Then the complexity of constructing CCD and the corresponding quantifier elimination has an upper bound n (sd)O(1) : Similar upper bound on the number of cells, degrees and quantities of polynomials describ- ing CCD and quantifier-free formula equivalent to Φ. If coefficients of polynomials f are integer of bit-sizes less than M, then the (Turing ma- chine) complexity does not exceed n MO(1)(sd)O(1) : 11 Davenport & Heintz (1988) (similar results by Weispfenning (1988)) found a (parametric) example of Φ of degrees · 4, with two free variables and n1 · 2; : : : ; nº · 2 (i.e., each quantifier is responsible for at most two variables) defining in R2 a semialgebraic set consisting of n 22 isolated points. ) Any CCD for Φ can’t contain lesser num- ber of cells. ) Lower complexity bound for any CCD-based algorithm is doubly exponential. Fisher & Rabin (1974): lower bound for deci- sion methods is exponential in the number of quantifier alternations. 12 Simplest case: 9x 2 R (f(x) = 0); where f 2 R[x], deg(f) < d. Sturm’s Theorem (1835): Euclidean algorithm for the division of f by its derivative f 0. 0 Let g1 = f; g2 = f , and g3; : : : ; gt be the se- quence of the negatives of the remainders in the Euclidean algorithm. For any x 2 R let V (x) be the number of sign changes in g1(x); g2(x); : : : ; gt(x). Theorem 11. The number of distinct real roots of f in [a; b] ½ R is S(f; f 0) := V (a) ¡ V (b): Note: sign(f(1)) =sign(leading coefficient a0 of f) d sign(f(¡1)) =sign(a0x at ¡1). 13 Note that over an algebraically closed field the answer is always “Yes”. Sturm’s theorem provides an algorithm to de- cide the existential formula over any real closed field. Now we want to generalize this algorithm to be able to handle systems of many equations and inequalities (in one variable, for time being). 13-1 Ben-Or/Kozen/Reif algorithm (1986): Definition 12. Let f1; : : : ; fk 2 R[x], deg(fi) < d. Consistent sign assignment is a string σ = (σ1; : : : ; σk) where σi 2 f>; <; =g, such that the system f1σ10; : : : ; fkσk0 has a solution in R. Input: f1; : : : ; fk 2 R[x]. Output: The list of all consistent sign assignments. Prepare the input: Make all fi squarefree and relatively prime. Then sets of roots of polynomials fi are disjoint, in particular any consistent sign assignment has at most one =. Moreover, we can add a new polynomial f so that all con- sistent assignments for f1; : : : ; fk can be recon- structed from all consistent assignments of < and > for f1; : : : ; fk at roots of f. 14 Case k = 0: f = 0 Sturm’s Theorem. Case k = 1: f; f1 C1 := fxj f = 0 ^ f1 > 0g C1 := fxj f = 0 ^ f1 < 0g Obviously, the total number of roots of f is 0 S(f; f ) = jC1j + jC1j. (Here and in the sequel S corresponds to the interval [¡1; 1].) 0 Lemma 13. S(f; f f1) = jC1j ¡ jC1j. Sturm + Lemma ) Ã !Ã ! Ã ! 0 1 1 jC1j S(f; f ) = 0 1 ¡1 jC1j S(f; f f1) 15 Case k = 2: f; f1; f2 C2 := fxjf = 0 ^ f2 > 0g C2 := fxjf = 0 ^ f2 < 0g 0 1 0 1 1 1 1 1 jC1 \ C2j B C B C B1 ¡1 1 ¡1C BjC \ C jC B C B 1 2 C = @1 1 ¡1 ¡1A @jC1 \ C2jA 1 ¡1 ¡1 1 jC1 \ C2j 0 1 S(f; f 0) B 0 C B S(f; f f1) C = B 0 C @ S(f; f f2) A 0 S(f; f f1f2) 16 In case k we get a matrix Ak which is a tensor product of k copies of A1 and is non-singular.
Load more

Recommended publications
  • Using Elimination to Describe Maxwell Curves Lucas P
    Louisiana State University LSU Digital Commons LSU Master's Theses Graduate School 2006 Using elimination to describe Maxwell curves Lucas P. Beverlin Louisiana State University and Agricultural and Mechanical College Follow this and additional works at: https://digitalcommons.lsu.edu/gradschool_theses Part of the Applied Mathematics Commons Recommended Citation Beverlin, Lucas P., "Using elimination to describe Maxwell curves" (2006). LSU Master's Theses. 2879. https://digitalcommons.lsu.edu/gradschool_theses/2879 This Thesis is brought to you for free and open access by the Graduate School at LSU Digital Commons. It has been accepted for inclusion in LSU Master's Theses by an authorized graduate school editor of LSU Digital Commons. For more information, please contact [email protected]. USING ELIMINATION TO DESCRIBE MAXWELL CURVES A Thesis Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial ful¯llment of the requirements for the degree of Master of Science in The Department of Mathematics by Lucas Paul Beverlin B.S., Rose-Hulman Institute of Technology, 2002 August 2006 Acknowledgments This dissertation would not be possible without several contributions. I would like to thank my thesis advisor Dr. James Madden for his many suggestions and his patience. I would also like to thank my other committee members Dr. Robert Perlis and Dr. Stephen Shipman for their help. I would like to thank my committee in the Experimental Statistics department for their understanding while I completed this project. And ¯nally I would like to thank my family for giving me the chance to achieve a higher education.
    [Show full text]
  • Effective Noether Irreducibility Forms and Applications*
    Appears in Journal of Computer and System Sciences, 50/2 pp. 274{295 (1995). Effective Noether Irreducibility Forms and Applications* Erich Kaltofen Department of Computer Science, Rensselaer Polytechnic Institute Troy, New York 12180-3590; Inter-Net: [email protected] Abstract. Using recent absolute irreducibility testing algorithms, we derive new irreducibility forms. These are integer polynomials in variables which are the generic coefficients of a multivariate polynomial of a given degree. A (multivariate) polynomial over a specific field is said to be absolutely irreducible if it is irreducible over the algebraic closure of its coefficient field. A specific polynomial of a certain degree is absolutely irreducible, if and only if all the corresponding irreducibility forms vanish when evaluated at the coefficients of the specific polynomial. Our forms have much smaller degrees and coefficients than the forms derived originally by Emmy Noether. We can also apply our estimates to derive more effective versions of irreducibility theorems by Ostrowski and Deuring, and of the Hilbert irreducibility theorem. We also give an effective estimate on the diameter of the neighborhood of an absolutely irreducible polynomial with respect to the coefficient space in which absolute irreducibility is preserved. Furthermore, we can apply the effective estimates to derive several factorization results in parallel computational complexity theory: we show how to compute arbitrary high precision approximations of the complex factors of a multivariate integral polynomial, and how to count the number of absolutely irreducible factors of a multivariate polynomial with coefficients in a rational function field, both in the complexity class . The factorization results also extend to the case where the coefficient field is a function field.
    [Show full text]
  • Arithmetic and Geometric Applications of Quantifier Elimination for Valued Fields
    Model Theory, Algebra, and Geometry MSRI Publications Volume 39, 2000 Arithmetic and Geometric Applications of Quantifier Elimination for Valued Fields JAN DENEF Abstract. We survey applications of quantifier elimination to number the- ory and algebraic geometry, focusing on results of the last 15 years. We start with the applications of p-adic quantifier elimination to p-adic inte- gration and the rationality of several Poincar series related to congruences f(x) = 0 modulo a prime power, where f is a polynomial in several vari- ables. We emphasize the importance of p-adic cell decomposition, not only to avoid resolution of singularities, but especially to obtain much stronger arithmetical results. We survey the theory of p-adic subanalytic sets, which is needed when f is a power series instead of a polynomial. Next we explain the fundamental results of Lipshitz{Robinson and Gardener{Schoutens on subanalytic sets over algebraically closed complete valued fields, and the connection with rigid analytic geometry. Finally we discuss recent geo- metric applications of quantifier elimination over C((t)), related to the arc space of an algebraic variety. One of the most striking applications of the model theory of valued fields to arithmetic is the work of Ax and Kochen [1965a; 1965b; 1966; Kochen 1975], and of Ershov [1965; 1966; 1967], which provided for example the first quantifier elimination results for discrete valued fields [Ax and Kochen 1966], and the decidability of the field Qp of p-adic numbers. As a corollary of their work, Ax and Kochen [1965a] proved the following celebrated result: For each prime number p, big enough with respect to d, any homogeneous polynomial of degree 2 d over Qp in d + 1 variables has a nontrivial zero in Qp.
    [Show full text]
  • More Model Theory Notes Miscellaneous Information, Loosely Organized
    More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A ! M with A ⊆ M finite, and any a 2 M, f extends to a partial elementary map A [ fag ! M. As a consequence, any partial elementary map to M is extendible to an automorphism of M. Atomic models (see below) are homogeneous. A prime model of T is one that elementarily embeds into every other model of T of the same cardinality. Any theory with fewer than continuum-many types has a prime model, and if a theory has a prime model, it is unique up to isomorphism. Prime models are homogeneous. On the other end, a model is universal if every other model of its size elementarily embeds into it. Recall a type is a set of formulas with the same tuple of free variables; generally to be called a type we require consistency. The type of an element or tuple from a model is all the formulas it satisfies. One might think of the type of an element as a sort of identity card for automorphisms: automorphisms of a model preserve types. A complete type is the analogue of a complete theory, one where every formula of the appropriate free variables or its negation appears. Types of elements and tuples are always complete. A type is principal if there is one formula in the type that implies all the rest; principal complete types are often called isolated. A trivial example of an isolated type is that generated by the formula x = c where c is any constant in the language, or x = t(¯c) where t is any composition of appropriate-arity functions andc ¯ is a tuple of constants.
    [Show full text]
  • Etienne Bézout on Elimination Theory Erwan Penchevre
    Etienne Bézout on elimination theory Erwan Penchevre To cite this version: Erwan Penchevre. Etienne Bézout on elimination theory. 2017. hal-01654205 HAL Id: hal-01654205 https://hal.archives-ouvertes.fr/hal-01654205 Preprint submitted on 3 Dec 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Etienne Bézout on elimination theory ∗ Erwan Penchèvre Bézout’s name is attached to his famous theorem. Bézout’s Theorem states that the degree of the eliminand of a system a n algebraic equations in n unknowns, when each of the equations is generic of its degree, is the product of the degrees of the equations. The eliminand is, in the terms of XIXth century algebra1, an equation of smallest degree resulting from the elimination of (n − 1) unknowns. Bézout demonstrates his theorem in 1779 in a treatise entitled Théorie générale des équations algébriques. In this text, he does not only demonstrate the theorem for n > 2 for generic equations, but he also builds a classification of equations that allows a better bound on the degree of the eliminand when the equations are not generic. This part of his work is difficult: it appears incomplete and has been seldom studied.
    [Show full text]
  • Simple Proof of the Main Theorem of Elimination Theory in Algebraic Geometry
    SIMPLE PROOF OF THE MAIN THEOREM OF ELIMINATION THEORY IN ALGEBRAIC GEOMETRY Autor(en): Cartier, P. / Tate, J. Objekttyp: Article Zeitschrift: L'Enseignement Mathématique Band (Jahr): 24 (1978) Heft 1-2: L'ENSEIGNEMENT MATHÉMATIQUE PDF erstellt am: 10.10.2021 Persistenter Link: http://doi.org/10.5169/seals-49707 Nutzungsbedingungen Die ETH-Bibliothek ist Anbieterin der digitalisierten Zeitschriften. Sie besitzt keine Urheberrechte an den Inhalten der Zeitschriften. Die Rechte liegen in der Regel bei den Herausgebern. Die auf der Plattform e-periodica veröffentlichten Dokumente stehen für nicht-kommerzielle Zwecke in Lehre und Forschung sowie für die private Nutzung frei zur Verfügung. Einzelne Dateien oder Ausdrucke aus diesem Angebot können zusammen mit diesen Nutzungsbedingungen und den korrekten Herkunftsbezeichnungen weitergegeben werden. Das Veröffentlichen von Bildern in Print- und Online-Publikationen ist nur mit vorheriger Genehmigung der Rechteinhaber erlaubt. Die systematische Speicherung von Teilen des elektronischen Angebots auf anderen Servern bedarf ebenfalls des schriftlichen Einverständnisses der Rechteinhaber. Haftungsausschluss Alle Angaben erfolgen ohne Gewähr für Vollständigkeit oder Richtigkeit. Es wird keine Haftung übernommen für Schäden durch die Verwendung von Informationen aus diesem Online-Angebot oder durch das Fehlen von Informationen. Dies gilt auch für Inhalte Dritter, die über dieses Angebot zugänglich sind. Ein Dienst der ETH-Bibliothek ETH Zürich, Rämistrasse 101, 8092 Zürich, Schweiz, www.library.ethz.ch http://www.e-periodica.ch A SIMPLE PROOF OF THE MAIN THEOREM OF ELIMINATION THEORY IN ALGEBRAIC GEOMETRY by P. Cartier and J. Tate Summary The purpose of this note is to provide a simple proof (which we believe to be new) for the weak zero theorem in the case of homogeneous polynomials.
    [Show full text]
  • Arxiv:2007.09244V1 [Math.LO] 17 Jul 2020 Rdcs Given Products
    AXIOMS FOR COMMUTATIVE UNITAL RINGS ELEMENTARILY EQUIVALENT TO RESTRICTED PRODUCTS OF CONNECTED RINGS JAMSHID DERAKHSHAN AND ANGUS MACINTYRE† Abstract. We give axioms in the language of rings augmented by a 1-ary predicate symbol Fin(x) with intended interpretation in the Boolean algebra of idempotents as the ideal of finite elements, i.e. finite unions of atoms. We prove that any commutative unital ring satisfying these axioms is elementarily equivalent to a restricted product of connected rings. This is an extension of the results in [3] for products. While the results in [3] give a converse to the Feferman-Vaught theorem for products, our results prove the same for restricted products. We give a complete set of axioms in the language of rings for the ring of adeles of a number field, uniformly in the number field. 0. Introduction This paper is a natural sequel to [3] and the main results and proofs are natural extensions of those in [3]. In many cases we will simply refer to the material from [3] [3] deals with the model theory of products of connected unital rings, and can be construed as providing a partial converse to the Feferman-Vaught Theorem [9] in the special case of products Qi∈I Ri, i ∈ I, where Ri are connected commutative unital rings and I an index set (Recall that a commutative ring R is connected if 0, 1 are the only idempotents of R). The converse concerns the issue of providing axioms for rings elementarily equivalent to rings Qi∈I Ri as above. The solution of this problem is given in [3] and, inter alia has applications to non-standard models arXiv:2007.09244v1 [math.LO] 17 Jul 2020 of PA (first order Peano arithmetic) in [4].
    [Show full text]
  • Triangle Identities Via Elimination Theory
    Triangle Identities via Elimination Theory Dam Van Nhi and Luu Ba Thang Abstract The aim of this paper is to present some new identities via resultants and elimination theory, by presenting the sidelengths, the lengths of the altitudes and the exradii of a triangle as roots of cubic polynomials. 1 Introduction Finding identities between elements of a triangle represents a classical topic in elementary geometry. In Recent Advances in Geometric Inequalities [3], Mitrinovic et al presents the sidelengths, the lengths of the altitudes and the various radii as roots of cubic polynomials, and collects many interesting equalities and inequalities between these quantities. As far as we know, almost of them are built using only elementary algebra and geometry. In this paper, we use transformations of rational functions and resultants to build similar nice equalities and inequalities might be difficult to prove with different methods. 2 Main results To fix notations, suppose we are given a triangle ∆ABC with sidelengh a; b; c. Denote the radius of the circumcircle by R, the radius of incircle by r, the area of ∆ABC by S, the semiperimeter as p, the radii of the excircles as r1; r2; r3, and the altitudes from sides a; b and c, respectively, as ha; hb and hc. We have the results from [3, Chapter 1]. Theorem 1. [3] Using the above notations, (i) a; b; c are the roots of the cubic polynomial x3 − 2px2 + (p2 + r2 + 4Rr)x − 4Rrp: (1) (ii) ha; hb; hc are the roots of the cubic polynomial S2 + 4Rr3 + r4 2S2 2S2 x3 − x2 + x − : (2) 2Rr2 Rr R (iii) r1; r2; r3 are the roots of the cubic polynomial x3 − (4R + r)x2 + p2x − p2r: (3) Next, we present how to use transformations of rational functions to build new geometric equalities ax + b and inequalities.
    [Show full text]
  • Elimination Theory in Differential and Difference Algebra
    J Syst Sci Complex (2019) 32: 287–316 Elimination Theory in Differential and Difference Algebra∗ LI Wei · YUAN Chun-Ming Dedicated to the memories of Professor Wen-Ts¨un Wu DOI: 10.1007/s11424-019-8367-x Received: 15 October 2018 / Revised: 10 December 2018 c The Editorial Office of JSSC & Springer-Verlag GmbH Germany 2019 Abstract Elimination theory is central in differential and difference algebra. The Wu-Ritt character- istic set method, the resultant and the Chow form are three fundamental tools in the elimination theory for algebraic differential or difference equations. In this paper, the authors mainly present a survey of the existing work on the theory of characteristic set methods for differential and difference systems, the theory of differential Chow forms, and the theory of sparse differential and difference resultants. Keywords Differential Chow forms, differential resultants, sparse differential resultants, Wu-Ritt characteristic sets. 1 Introduction Algebraic differential equations and difference equations frequently appear in numerous mathematical models and are hot research topics in many different areas. Differential algebra, founded by Ritt and Kolchin, aims to study algebraic differential equations in a way similar to how polynomial equations are studied in algebraic geometry[1, 2]. Similarly, difference algebra, founded by Ritt and Cohn, mainly focus on developing an algebraic theory for algebraic differ- ence equations[3]. Elimination theory, starting from Gaussian elimination, forms a central part of both differential and difference algebra. For the elimination of unknowns in algebraic differential and difference equations, there are several fundamental approaches, for example, the Wu-Ritt characteristic set theory, the theory of Chow forms, and the theory of resultants.
    [Show full text]
  • Some Lectures on Algebraic Geometry∗
    Some lectures on Algebraic Geometry∗ V. Srinivas 1 Affine varieties Let k be an algebraically closed field. We define the affine n-space over k n n to be just the set k of ordered n-tuples in k, and we denote it by Ak (by 0 convention we define Ak to be a point). If x1; : : : ; xn are the n coordinate n functions on Ak , any polynomial f(x1; : : : ; xn) in x1; : : : ; xn with coefficients n in k yields a k-valued function Ak ! k, which we also denote by f. Let n A(Ak ) denote the ring of such functions; we call it the coordinate ring of n Ak . Since k is algebraically closed, and in particular is infinite, we easily see n that x1; : : : ; xn are algebraically independent over k, and A(Ak ) is hence a 0 polynomial ring over k in n variables. The coordinate ring of Ak is just k. n Let S ⊂ A(Ak ) be a collection of polynomials. We can associate to it n an algebraic set (or affine variety) in Ak defined by n V (S) := fx 2 Ak j f(x) = 0 8 f 2 Sg: This is called the variety defined by the collection S. If I =< S >:= ideal in k[x1; : : : ; xn] generated by elements of S, then we clearly have V (S) = V (I). Also, if f is a polynomial such that some power f m vanishes at a point P , then so does f itself; hence if p m I := ff 2 k[x1; : : : ; xn] j f 2 I for some m > 0g p is the radical of I, then V (I) = V ( I).
    [Show full text]
  • Quantifier Elimination and Real Closed Ordered Fields with A
    Quanti¯er Elimination and Real Closed Ordered Fields with a Predicate for the Powers of Two Yimu Yin December 17, 2005 Abstract In this thesis we ¯rst review the model theory of quanti¯er elim- ination and investigate the logical relations among various quanti¯er elimination tests. In particular we prove the equivalence of two quanti- ¯er elimination tests for countable theories. Next we give a procedure for eliminating quanti¯ers for the theory of real closed ordered ¯elds with a predicate for the powers of two. This result was ¯rst obtained by van den Dries [20]. His method is model-theoretic, which provides no apparent bounds on the complexity of a decision procedure. In the last section we give a complete axiomatization of the theory of real closed ordered ¯elds with a predicate for the Fibonacci numbers. 1 Acknowledgements I thank my advisor Jeremy Avigad for the guidance he has provided me. I am grateful to James Cummings and Rami Grossberg for many helpful suggestions. I also thank Chris Miller for suggesting the problem considered in the last section of this thesis. 2 1 Introduction A \decision procedure" for mathematics is, roughly, a procedure for deter- mining whether or not a mathematical statement is true. Of course, any proof can be viewed as a procedure for determining that a particular theo- rem is true; but when we talk about decision procedures, we usually mean a procedure for deciding a class of statements. Some decision procedures have been around for a very long time. For example, Euclid's algorithm is such a procedure.
    [Show full text]
  • Formalizing Constructive Quantifier Elimination in Agda
    Formalizing Constructive Quantifier Elimination in Agda Jeremy Pope University of Gothenburg Gothenburg, Sweden [email protected] In this paper a constructive formalization of quantifier elimination is presented, based on a classical formalization by Tobias Nipkow. The formalization is implemented and verified in the programming language/proof assistant Agda. It is shown that, as in the classical case, the ability to eliminate a single existential quantifier may be generalized to full quantifier elimination and consequently a decision procedure. The latter is shown to have strong properties under a constructive metatheory, such as the generation of witnesses and counterexamples. Finally, this is demonstrated on a minimal theory on the natural numbers. 1 Introduction 1.1 Predicate Logic and Quantifier Elimination A proposition in predicate logic is formed in one of three ways: from an atom, by linking propositions together using a connective (such as ∨ or ⇒), or by quantifying a proposition with ∀ or ∃. Neglecting the internal structure of atoms, it is the third that sets predicate logic apart from propositional logic; the quantifiers greatly enhance the expressiveness of the language. A drawback of predicate logic is that the truth of a proposition is no longer easy to determine. With propositional logic an exhaustive enumeration is possible, but this is not so in predicate logic: to do so on a proposition such as ∀x.(x =6 x + 1) would require verifying x =6 x + 1 for every possible value of x, which—depending on our choice of domain—could be infinite. There is not always a way around this; predicate logic is indeed undecidable in the general case.
    [Show full text]