Asymptotic Differential Algebra
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
N° 92 Séminaire De Structures Algébriques Ordonnées 2016
N° 92 Séminaire de Structures Algébriques Ordonnées 2016 -- 2017 F. Delon, M. A. Dickmann, D. Gondard, T. Servi Février 2018 Equipe de Logique Mathématique Prépublications Institut de Mathématiques de Jussieu – Paris Rive Gauche Universités Denis Diderot (Paris 7) et Pierre et Marie Curie (Paris 6) Bâtiment Sophie Germain, 5 rue Thomas Mann – 75205 Paris Cedex 13 Tel. : (33 1) 57 27 91 71 – Fax : (33 1) 57 27 91 78 Les volumes des contributions au Séminaire de Structures Algébriques Ordonnées rendent compte des activités principales du séminaire de l'année indiquée sur chaque volume. Les contributions sont présentées par les auteurs, et publiées avec l'agrément des éditeurs, sans qu'il soit mis en place une procédure de comité de lecture. Ce séminaire est publié dans la série de prépublications de l'Equipe de Logique Mathématique, Institut de Mathématiques de Jussieu–Paris Rive Gauche (CNRS -- Universités Paris 6 et 7). Il s'agit donc d'une édition informelle, et les auteurs ont toute liberté de soumettre leurs articles à la revue de leur choix. Cette publication a pour but de diffuser rapidement des résultats ou leur synthèse, et ainsi de faciliter la communication entre chercheurs. The proceedings of the Séminaire de Structures Algébriques Ordonnées constitute a written report of the main activities of the seminar during the year of publication. Papers are presented by each author, and published with the agreement of the editors, but are not refereed. This seminar is published in the preprint series of the Equipe de Logique Mathématique, Institut de Mathématiques de Jussieu– Paris Rive Gauche (CNRS -- Universités Paris 6 et 7). -
Differential Algebra, Functional Transcendence, and Model Theory Math 512, Fall 2017, UIC
Differential algebra, functional transcendence, and model theory Math 512, Fall 2017, UIC James Freitag October 15, 2017 0.1 Notational Issues and notes I am using this area to record some notational issues, some which are needing solutions. • I have the following issue: in differential algebra (every text essentially including Kaplansky, Ritt, Kolchin, etc), the notation fAg is used for the differential radical ideal generated by A. This notation is bad for several reasons, but the most pressing is that we use f−g often to denote and define certain sets (which are sometimes then also differential radical ideals in our setting, but sometimes not). The question is what to do - everyone uses f−g for differential radical ideals, so that is a rock, and set theory is a hard place. What should we do? • One option would be to work with a slightly different brace for the radical differen- tial ideal. Something like: è−é from the stix package. I am leaning towards this as a permanent solution, but if there is an alternate suggestion, I’d be open to it. This is the currently employed notation. Dave Marker mentions: this notation is a bit of a pain on the board. I agree, but it might be ok to employ the notation only in print, since there is almost always more context for someone sitting in a lecture than turning through a book to a random section. • Pacing notes: the first four lectures actually took five classroom periods, in large part due to the lecturer/author going slowly or getting stuck at a certain point. -
Abstract Differential Algebra and the Analytic Case
ABSTRACT DIFFERENTIAL ALGEBRA AND THE ANALYTIC CASE A. SEIDENBERG In Chapter VI, Analytical considerations, of his book Differential algebra [4], J. F. Ritt states the following theorem: Theorem. Let Y?'-\-Fi, i=l, ■ ■ • , re, be differential polynomials in L{ Y\, • • • , Yn) with each p{ a positive integer and each F, either identically zero or else composed of terms each of which is of total degree greater than pi in the derivatives of the Yj. Then (0, • • • , 0) is a com- ponent of the system Y?'-\-Fi = 0, i = l, ■ • ■ , re. Here the field E is not an arbitrary differential field but is an ordinary differential field appropriate to the "analytic case."1 While it lies at hand to conjecture the theorem for an arbitrary (ordinary) differential field E of characteristic 0, the type of proof given by Ritt does not place the question beyond doubt.2 The object of the present note is to establish a rather general principle, analogous to the well-known "Principle of Lefschetz" [2], whereby it will be seen that any theorem of the above type, more or less, which holds in the analytic case also holds in the abstract case. The main point of this principle is embodied in the Embedding Theorem, which tells us that any field finite over the rationals is isomorphic to a field of mero- morphic functions. The principle itself can be precisely formulated as follows. Principle. If a theorem E(E) obtains for the field L provided it ob- tains for the subfields of L finite over the rationals, and if it holds in the analytic case, then it holds for arbitrary L. -
Chapter 10 Orderings and Valuations
Chapter 10 Orderings and valuations 10.1 Ordered fields and their natural valuations One of the main examples for group valuations was the natural valuation of an ordered abelian group. Let us upgrade ordered groups. A field K together with a relation < is called an ordered field and < is called an ordering of K if its additive group together with < is an ordered abelian group and the ordering is compatible with the multiplication: (OM) 0 < x ^ 0 < y =) 0 < xy . For the positive cone of an ordered field, the corresponding additional axiom is: (PC·)P · P ⊂ P . Since −P·−P = P·P ⊂ P, all squares of K and thus also all sums of squares are contained in P. Since −1 2 −P and P \ −P = f0g, it follows that −1 2= P and in particular, −1 is not a sum of squares. From this, we see that the characteristic of an ordered field must be zero (if it would be p > 0, then −1 would be the sum of p − 1 1's and hence a sum of squares). Since the correspondence between orderings and positive cones is bijective, we may identify the ordering with its positive cone. In this sense, XK will denote the set of all orderings resp. positive cones of K. Let us consider the natural valuation of the additive ordered group of the ordered field (K; <). Through the definition va+vb := vab, its value set vK becomes an ordered abelian group and v becomes a homomorphism from the multiplicative group of K onto vK. We have obtained the natural valuation of the ordered field (K; <). -
DIFFERENTIAL ALGEBRA Lecturer: Alexey Ovchinnikov Thursdays 9
DIFFERENTIAL ALGEBRA Lecturer: Alexey Ovchinnikov Thursdays 9:30am-11:40am Website: http://qcpages.qc.cuny.edu/˜aovchinnikov/ e-mail: [email protected] written by: Maxwell Shapiro 0. INTRODUCTION There are two main topics we will discuss in these lectures: (I) The core differential algebra: (a) Introduction: We will begin with an introduction to differential algebraic structures, important terms and notation, and a general background needed for this lecture. (b) Differential elimination: Given a system of polynomial partial differential equations (PDE’s for short), we will determine if (i) this system is consistent, or if (ii) another polynomial PDE is a consequence of the system. (iii) If time permits, we will also discuss algorithms will perform (i) and (ii). (II) Differential Galois Theory for linear systems of ordinary differential equations (ODE’s for short). This subject deals with questions of this sort: Given a system d (?) y(x) = A(x)y(x); dx where A(x) is an n × n matrix, find all algebraic relations that a solution of (?) can possibly satisfy. Hrushovski developed an algorithm to solve this for any A(x) with entries in Q¯ (x) (here, Q¯ is the algebraic closure of Q). Example 0.1. Consider the ODE dy(x) 1 = y(x): dx 2x p We know that y(x) = x is a solution to this equation. As such, we can determine an algebraic relation to this ODE to be y2(x) − x = 0: In the previous example, we solved the ODE to determine an algebraic relation. Differential Galois Theory uses methods to find relations without having to solve. -
Computing the Homology of Semialgebraic Sets. II: General Formulas Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto
Computing the Homology of Semialgebraic Sets. II: General formulas Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto To cite this version: Peter Bürgisser, Felipe Cucker, Josué Tonelli-Cueto. Computing the Homology of Semialgebraic Sets. II: General formulas. Foundations of Computational Mathematics, Springer Verlag, 2021, 10.1007/s10208-020-09483-8. hal-02878370 HAL Id: hal-02878370 https://hal.inria.fr/hal-02878370 Submitted on 23 Jun 2020 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. Computing the Homology of Semialgebraic Sets. II: General formulas∗ Peter B¨urgissery Felipe Cuckerz Technische Universit¨atBerlin Dept. of Mathematics Institut f¨urMathematik City University of Hong Kong GERMANY HONG KONG [email protected] [email protected] Josu´eTonelli-Cuetox Inria Paris & IMJ-PRG OURAGAN team Sorbonne Universit´e Paris, FRANCE [email protected] Abstract We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a subset of data having exponentially small measure, the cost of the algorithm is single exponential in the size of the data. -
On the Total Curvature of Semialgebraic Graphs
ON THE TOTAL CURVATURE OF SEMIALGEBRAIC GRAPHS LIVIU I. NICOLAESCU 3 RABSTRACT. We define the total curvature of a semialgebraic graph ¡ ½ R as an integral K(¡) = ¡ d¹, where ¹ is a certain Borel measure completely determined by the local extrinsic geometry of ¡. We prove that it satisfies the Chern-Lashof inequality K(¡) ¸ b(¡), where b(¡) = b0(¡) + b1(¡), and we completely characterize those graphs for which we have equality. We also prove the following unknottedness result: if ¡ ½ R3 is homeomorphic to the suspension of an n-point set, and satisfies the inequality K(¡) < 2 + b(¡), then ¡ is unknotted. Moreover, we describe a simple planar graph G such that for any " > 0 there exists a knotted semialgebraic embedding ¡ of G in R3 satisfying K(¡) < " + b(¡). CONTENTS Introduction 1 1. One dimensional stratified Morse theory 3 2. Total curvature 8 3. Tightness 13 4. Knottedness 16 Appendix A. Basics of real semi-algebraic geometry 21 References 25 INTRODUCTION The total curvature of a simple closed C2-curve ¡ in R3 is the quantity Z 1 K(¡) = jk(s) jdsj; ¼ ¡ where k(s) denotes the curvature function of ¡ and jdsj denotes the arc-length along C. In 1929 W. Fenchel [9] proved that for any such curve ¡ we have the inequality K(¡) ¸ 2; (F) with equality if and only if C is a planar convex curve. Two decades later, I. Fary´ [8] and J. Milnor [17] gave probabilistic interpretations of the total curvature. Milnor’s interpretation goes as follows. 3 3 Any unit vector u 2 R defines a linear function hu : R ! R, x 7! (u; x), where (¡; ¡) denotes 3 the inner product in R . -
SOME BASIC THEOREMS in DIFFERENTIAL ALGEBRA (CHARACTERISTIC P, ARBITRARY) by A
SOME BASIC THEOREMS IN DIFFERENTIAL ALGEBRA (CHARACTERISTIC p, ARBITRARY) BY A. SEIDENBERG J. F. Ritt [ó] has established for differential algebra of characteristic 0 a number of theorems very familiar in the abstract theory, among which are the theorems of the primitive element, the chain theorem, and the Hubert Nullstellensatz. Below we also consider these theorems for characteristic p9^0, and while the case of characteristic 0 must be a guide, the definitions cannot be taken over verbatim. This usually requires that the two cases be discussed separately, and this has been done below. The subject is treated ab initio, and one may consider that the proofs in the case of characteristic 0 are being offered for their simplicity. In the field theory, questions of sepa- rability are also considered, and the theorem of S. MacLane on separating transcendency bases [4] is established in the differential situation. 1. Definitions. By a differentiation over a ring R is meant a mapping u—*u' from P into itself satisfying the rules (uv)' = uv' + u'v and (u+v)' = u'+v'. A differential ring is the composite notion of a ring P and a dif- ferentiation over R: if the ring R becomes converted into a differential ring by means of a differentiation D, the differential ring will also be designated simply by P, since it will always be clear which differentiation is intended. If P is a differential ring and P is an integral domain or field, we speak of a differential integral domain or differential field respectively. An ideal A in a differential ring P is called a differential ideal if uÇ^A implies u'^A. -
THE SEMIALGEBRAIC CASE Today's Goal Tarski-Seidenberg Theorem
17 THE SEMIALGEBRAIC CASE Today’s Goal Tarski-Seidenberg Theorem. For every n =1, 2, 3,...,every Lalg-definable subset of Rn can be defined by a quantifier-free Lalg-formula. n Thus every Lalg-definable subset of R is a finite boolean combination (i.e., finitely many intersections, unions, and comple- ments) of sets of the form n {(x1,...,xn) ∈ R | p(x1,...,xn) > 0} where p(x1,...,xn)isapolynomial with coefficients in R. These are called the semialgebraic sets. A function f: A ⊂ Rn → Rm is semialgebraic if its graph is a semialgebraic subset of Rn × Rm. 18 As for the semilinear sets, every semialgebraic set can be written as a finite union of the intersection of finitely many sets defined by conditions of the form p(x1,...,xn)=0 q(x1,...,xn) > 0 where p(x1,...,xn) and q(x1,...,xn) are polynomials with coefficients in R. Proof Strategy • Prove a geometric structure theorem that shows that any semialgebraic set can be decomposed into finitely many semialgebraic generalized cylinders and graphs. • Deduce quantifier elimination from this. 19 Thom’s Lemma. Let p1(X),...,pk(X) be polynomials in the variable X with R coefficients in such that if pj(X) =0then pj(X) is included among p1,...,pk. Let S ⊂ R have the form S = ∩jpj(X) ∗j 0 where ∗j is one of <, >,or=, then S is either empty, a point, or an open interval. Moreover, the (topological) closure of S is obtained by changing relaxing the sign conditions (changing < to ≤ and > to ≥. Note There are 3k such possible sets, and these form a partition of R. -
Algebraic Properties of the Ring of General Exponential Polynomials
Complex Varrahler. 1989. Vol. 13. pp. 1-20 Reprints avdnhle directly from the publisher Photucopyng perm~ftedby license only 1 1989 Gordon and Breach, Science Pubhsherr. Inc. Printed in the United States of Amer~ca Algebraic Properties of the Ring of General Exponential Polynomials C. WARD HENSON and LEE A. RUBEL Department of Mathematics, University of Illinois, 7409 West Green St., Urbana, IL 67807 and MICHAEL F. SINGER Department of Mathematics, North Carolina State University, P.O. Box 8205, Raleigh, NC 27695 AMS No. 30DYY. 32A9Y Communicated: K. F. Barth and K. P. Gilbert (Receitled September 15. 1987) INTRODUCTION The motivation for the results given in this paper is our desire to study the entire functions of several variables which are defined by exponential terms. By an exponential term (in n variables) we mean a formal expression which can be built up from complex constants and the variables z,, . , z, using the symbols + (for addition), . (for multiplication) and exp(.) (for the exponential function with the constant base e). (These are the terms and the functions considered in Section 5 of [I 11. There the set of exponential terms was denoted by C. Note that arbitrary combinations and iterations of the permitted functions can be formed; thus such expressions as are included here.) Each exponential term in n variables evidently defines an analytic Downloaded by [North Carolina State University] at 18:38 26 May 2015 function on C";we denote the ring of all such functions on Cn by A,. This is in fact an exponential ring;that is, A, is closed under application of the exponential function. -
Gröbner Bases in Difference-Differential Modules And
Science in China Series A: Mathematics Sep., 2008, Vol. 51, No. 9, 1732{1752 www.scichina.com math.scichina.com GrÄobnerbases in di®erence-di®erential modules and di®erence-di®erential dimension polynomials ZHOU Meng1y & Franz WINKLER2 1 Department of Mathematics and LMIB, Beihang University, and KLMM, Beijing 100083, China 2 RISC-Linz, J. Kepler University Linz, A-4040 Linz, Austria (email: [email protected], [email protected]) Abstract In this paper we extend the theory of GrÄobnerbases to di®erence-di®erential modules and present a new algorithmic approach for computing the Hilbert function of a ¯nitely generated di®erence- di®erential module equipped with the natural ¯ltration. We present and verify algorithms for construct- ing these GrÄobnerbases counterparts. To this aim we introduce the concept of \generalized term order" on Nm £ Zn and on di®erence-di®erential modules. Using GrÄobnerbases on di®erence-di®erential mod- ules we present a direct and algorithmic approach to computing the di®erence-di®erential dimension polynomials of a di®erence-di®erential module and of a system of linear partial di®erence-di®erential equations. Keywords: GrÄobnerbasis, generalized term order, di®erence-di®erential module, di®erence- di®erential dimension polynomial MSC(2000): 12-04, 47C05 1 Introduction The e±ciency of the classical GrÄobnerbasis method for the solution of problems by algorithmic way in polynomial ideal theory is well-known. The results of Buchberger[1] on GrÄobnerbases in polynomial rings have been generalized by many researchers to non-commutative case, especially to modules over various rings of di®erential operators. -
An Introduction to Differential Algebra
An Introduction to → Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al.2 1ESA Advanced Concepts Team (TEC-SF) 2Dinamica SRL, Milan Outline 1 Overview 2 Five Views of Differential Algebra 1 Algebra of Multivariate Polynomials 2 Computer Representation of Functional Analysis 3 Automatic Differentiation 4 Set Theory and Manifold Representation 5 Non-Archimedean Analysis 2 1/28 DA Introduction Alexander Wittig, Advanced Concepts Team (TEC-SF) Overview Differential Algebra I A numerical technique based on algebraic manipulation of polynomials I Its computer implementation I Algorithms using this numerical technique with applications in physics, math and engineering. Various aspects of what we call Differential Algebra are known under other names: I Truncated Polynomial Series Algebra (TPSA) I Automatic forward differentiation I Jet Transport 2 2/28 DA Introduction Alexander Wittig, Advanced Concepts Team (TEC-SF) History of Differential Algebra (Incomplete) History of Differential Algebra and similar Techniques I Introduced in Beam Physics (Berz, 1987) Computation of transfer maps in particle optics I Extended to Verified Numerics (Berz and Makino, 1996) Rigorous numerical treatment including truncation and round-off errors for computer assisted proofs I Taylor Integrator (Jorba et al., 2005) Numerical integration scheme based on arbitrary order expansions I Applications to Celestial Mechanics (Di Lizia, Armellin, 2007) Uncertainty propagation, Two-Point Boundary Value Problem, Optimal Control, Invariant Manifolds... I Jet Transport (Gomez, Masdemont, et al., 2009) Uncertainty Propagation, Invariant Manifolds, Dynamical Structure 2 3/28 DA Introduction Alexander Wittig, Advanced Concepts Team (TEC-SF) Differential Algebra Differential Algebra A numerical technique to automatically compute high order Taylor expansions of functions −! −! −! 0 −! −! 1 (n) −! −! n f (x0 + δx) ≈f (x0) + f (x0) · δx + ··· + n! f (x0) · δx and algorithms to manipulate these expansions.