Divergent Series and Differential Equations Michèle Loday-Richaud
Divergent series and differential equations Michèle Loday-Richaud
To cite this version:
Michèle Loday-Richaud. Divergent series and differential equations. 2014. hal-01011050
HAL Id: hal-01011050 https://hal.archives-ouvertes.fr/hal-01011050 Preprint submitted on 26 Jun 2014
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. Mich`ele LODAY-RICHAUD
DIVERGENT SERIES AND DIFFERENTIAL EQUATIONS M. Loday-Richaud LAREMA, Universit´ed’Angers, 2 boulevard Lavoisier 49 045 ANGERS cedex 01 France. E-mail : [email protected] E-mail : [email protected]
2000 Mathematics Subject Classification.— M1218X, M12147, M12031. Key words and phrases.— divergent series, summable series, summability, multi- summability, linear ordinary differential equation. DIVERGENT SERIES AND DIFFERENTIAL EQUATIONS
Mich`ele LODAY-RICHAUD
Abstract.— The aim of these notes is to develop the various known approaches to the summability of a class of series that contains all divergent series solutions of ordinary differential equations in the complex field. We split the study into two parts: the first and easiest one deals with the case when the divergence depends only on one parameter, the level k also said critical time, and is called k-summability; the second one provides generalizations to the case when the divergence depends on several (but finitely many) levels and is called multi-summability. We prove the coherence of the definitions and their equivalences and we provide some applications. A key role in most of these theories is played by Gevrey asymptotics. The notes begin with a presentation of these asymptotics and their main properties. To help readers that are not familiar with these concepts we provide a survey of sheaf theory and cohomology of sheaves. We also state the main properties of linear ordinary differential equations connected with the subject we are dealing with, including a sketch algorithm to compute levels and various formal invariants of linear differential equations as well as a chapter on irregularity and index theorems. A chapter is devoted to tangent-to-identity germs of diffeomorphisms in C, 0 as an application of the cohomological point of view of summability.
v
Pr´epublications Math´ematiques d’Angers Num´ero 375 — Janvier 2014
CONTENTS
1. Introduction...... 1
2. Asymptotic expansions in the complex domain...... 5 2.1. Generalities...... 5 2.2. Poincar´easymptotics...... 6 2.3. Gevrey asymptotics...... 17 2.4. The Borel-Ritt Theorem...... 26 2.5. The Cauchy-Heine Theorem...... 31
3. Sheaves and Cechˇ cohomology with an insight into asymptotics 37 3.1. Presheaves and sheaves...... 37 3.2. Cechˇ cohomology...... 54
4. Linear ordinary differential equations: basic facts and infinitesimal neighborhoods of irregular singularities...... 63 4.1. Equation versus system...... 63 4.2. The viewpoint of -modules...... 65 D 4.3. Classifications...... 71 4.4. The Main Asymptotic Existence Theorem...... 87 4.5. Infinitesimal neighborhoods of an irregular singular point...... 90
5. Irregularity and Gevrey index theorems for linear differential operators...... 99 5.1. Introduction...... 99 5.2. Irregularity after Deligne-Malgrange and Gevrey index theorems . 102 5.3. Wild analytic continuation and index theorems...... 109 2 CONTENTS
6. Four equivalent approaches to k-summability...... 111 6.1. First approach: Ramis k-summability...... 112 6.2. Second approach: Ramis-Sibuya k-summability...... 118 6.3. Third approach: Borel-Laplace summation...... 124 6.4. Fourth approach: wild analytic continuation...... 155
7. Tangent-to-identity diffeomorphisms and Birkhoff Normalisation Theorem...... 159 7.1. Introduction...... 159 7.2. Birkhoff-Kimura Sectorial Normalization...... 162 7.3. Invariance equation of g...... 167 7.4. 1-summability of the conjugacy series h ...... 169
8. Six equivalent approaches to multisummabilitye ...... 171 8.1. Introduction and the Ramis-Sibuya series...... 171 8.2. First approach: asymptotic definition...... 174 8.3. Second approach: Malgrange-Ramis definition...... 183 8.4. Third approach: iterated Laplace integrals...... 186 8.5. Fourth approach: Balser’s decomposition into sums...... 195 8.6. Fifth approach: Ecalle’s´ acceleration...... 199 8.7. Sixth approach: wild analytic continuation...... 206
Bibliography...... 211
Index of notations...... 217
Index...... 219 CHAPTER 1
INTRODUCTION
Divergent series may diverge in many various ways. When a divergent se- ries issues from a natural problem it must satisfy specific constraints restricting thus the range of possibilities. What we mean, here, by natural problem is a problem formulated in terms of a particular type of equations such as differ- ential equations, ordinary or partial, linear or non-linear, difference equations, q-difference equations and so on . . . Much has been done in the last decades towards the understanding of the divergence of natural series, their classification and how they can be related to analytic solutions of the natural problem. The question of “summing” divergent series dates back long ago. Famous are the works of Euler and later of Borel, Poincar´e, Birkhoff, Hardy and their school until the 1920’s. After a long period of inactivity, the question knew exploding developments in the 1970’s and 1980’s with the introduction by Y. Sibuya and B. Malgrange of the cohomological point of view followed by works of J.-P. Ramis, J. Ecalle´ and many others. In these lecture notes, we focus on the best known class of divergent se- ries, a class motivated by the study of solutions of ordinary linear differential equations with complex meromorphic coefficients at 0 (for short, differential equations) to which they all belong. It is well-known (Cauchy-Lipschitz The- orem) that series solutions of differential equations at an ordinary point are convergent defining so analytic solutions in a neighborhood of 0 in C. At a singular point one must distinguish between regular singular points where all formal solutions are convergent (cf. [Was76, Thm. 5.3] for instance) and irregular singular points where the formal solutions are divergent in general; several examples of divergent series are presented and commented throughout 2 CHAPTER 1. INTRODUCTION the text. The strong point with formal solutions is that they are “easily” computed; at least, there exist algorithms to compute them, whatever the or- der of the linear differential equation. Nonetheless, one wishes to find actual solutions near such singular points and to understand their behavior. The idea underlying a theory of summation is to build a tool that trans- forms formal solutions into unique well-defined actual solutions. Roughly speaking, it is natural to ask that the former ones be linked to the latter ones by an asymptotic condition; in other words, that the formal solutions be Taylor series of the actual solutions in a generalized sense. Only convergent series have an asymptotic function on a full neighborhood of 0 in C; other- wise, the asymptotics are required on sectors with vertex 0. Uniqueness is essential to go back and forth and to guaranty good, well-defined properties. The problem is now fully solved for the class under consideration in several equivalent ways providing thus several equivalent theories of summation or theories of summability. Some methods provide necessary and sufficient con- ditions for a series to be summable, some others provide explicit formulæ. Each method has its own interest; none is the best and their variety must be thought as an enrichment of our means to solve problems. The theories here considered depend on parameters called levels or critical times. The simplest case with only one level k is called k-summability (actually, “simpler than the simplest” is the case when k = 1). The case of several levels k1,k2,...,kν is called multisummability or, to be precise, (k1,k2,...,kν)-summability. At first sight, since the singular points of differential equations are isolated, one could discuss the interest of such a procedure, for, one can approach as close as wished the singular points with the Cauchy-Lipschitz Theorem at the neighboring ordinary points. However, such an approach does not allow a good understanding of the singularities; even numerically, the usual numerical procedures stop being efficient when approaching a singular point, not providing thus even an idea of the behavior at the singular point. On the contrary, a good understanding of the singularity by means of a theory of summation permits a numerical calculation of solutions and of their invariants in most cases.
Chapter 2 deals with asymptotics in the complex domain, ordinary (also called Poincar´easymptotics) and Gevrey asymptotics. The presentation is classical and comes with five examples of divergent series (not all solutions CHAPTER 1. INTRODUCTION 3 of differential equations) that will be commented throughout the text. The chapter contains also a proof of the Borel-Ritt Theorem in Poincar´eand in Gevrey asymptotics and a proof of the Cauchy-Heine Theorem in classical form. In chapter 3 we introduce the language of sheaves and rudiments in Cechˇ cohomology. The sheaves , , <0 and ≤−k of germs of various types of A As A A asymptotic functions that are at the core of what follows, are carefully defined. Cohomological versions of the Borel-Ritt Theorem and of the Cauchy-Heine Theorem are made explicit. Chapter 4 contains basic recalls in the theory of ordinary linear differential equations: comparison of equations and systems with Deligne’s Cyclic vector lemma, the viewpoint of -modules, equivalence of equations or systems, for- D mal and meromorphic classifications, Newton polygons and calculation of the formal invariants in the case of equations, Main Asymptotic Existence Theo- rem in sheaf form and in classical form. We end the chapter with the construc- tion of infinitesimal neighborhoods of singularities of differential equations. Chapter 5 is devoted to index theorems for ordinary linear differential operators in various spaces with an application to the irregularity of operators. In chapter 6 we develop four different approaches to k-summability (that is, summability depending on a unique level k) and we prove their equivalence: Ramis k-summability, Ramis-Sibuya k-summability, Borel-Laplace summation with a proof of Nevanlinna’s Theorem and wild-summability, that is, by means of wild analytic continuation in the infinitesimal neighborhood of 0. Follow some applications: Maillet-Ramis Theorem, sufficient conditions for the k- summability of solutions of differential equations, their resurgence in the sense of J. Ecalle,´ and Martinet-Ramis Tauberian Theorems. In each case, we chose the approach that seemed to us to be the most convenient. Chapter 7 deals with tangent-to-identity germs of diffeomorphisms that are formally conjugated to the translation (by 1). It is meant as an application of Ramis-Sibuya Theorem to prove the 1-summability of the conjugacy map. A proof of the Birkhoff-Kimura sectorial normalization Theorem is provided. A careful study by means of Borel and Laplace transforms will be find in [Sau]. In chapter 8 we develop six different approaches to multisummability and we prove their equivalence: an asymptotic definition generalizing Ramis k-summability, Malgrange-Ramis summability generalizing Ramis-Sibuya k- summability, summation by iterated Laplace integrals and accelero-summation 4 CHAPTER 1. INTRODUCTION generalizing the Borel-Laplace summation, Balser’s decomposition into sums and the wild-multisummability in the infinitesimal neighborhood of 0. Some applications to differential equations and Tauberian Theorems are given.
Acknowledgements. I am very indebted to Jean-Pierre Ramis who initiated me to this subject and was always open to my questioning. I also thanks all those that read all or part of the manuscript and especially Anne Duval, Sergio Carillo, Michael Singer, Duncan Sands and Pascal Remy as well as Raymond S´eroul for his “technical” support. CHAPTER 2
ASYMPTOTIC EXPANSIONS IN THE COMPLEX DOMAIN
2.1. Generalities We consider functions of a complex variable x and their asymptotic expan- sions at a given point x0 of the Riemann sphere. Without loss of generality we assume that x0 = 0 although for some examples classically studied at infinity we keep x = . Indeed, asymptotic expansions at infinity reduce to asymp- 0 ∞ totic expansions at 0 after the change of variable x z = 1/x and asymptotic 7→ expansions at x C after the change of variable x t = x x . The point 0 0 ∈ 7→ − 0 must belong to the closure of the domain where the asymptotics are studied. In general, we consider sectors with vertex 0, or germs of such sectors when the radius approaches 0. The sectors are drawn either in the complex plane C, precisely, in C∗ = C 0 (the functions are then univaluate) or on the \{ } Riemann surface of the logarithm (the functions are multivaluate or given in terms of polar coordinates).
Notations 2.1.1.— We denote by ⊲ = (R) the open sector with vertex 0 made of all points x C α,β ∈ satisfying α< arg(x) <β and 0 < x ′ Definition 2.1.2.— A sector α′,β′ (R ) is said to be a proper sub-sector of (or to be properly included in) the sector α,β(R) and one denotes ′ α′,β′ (R ) ⋐ α,β(R) 6 CHAPTER 2. ASYMPTOTIC EXPANSIONS Figure 1 ′ ∗ if its closure α′,β′ (R ) in C or is included in α,β(R). ′ ′ ′ Thus, the notation α′,β′ (R ) ⋐ α,β(R) means α < α < β < β and R′ 2.2. Poincar´easymptotics Poincar´easymptotic expansions, or for short, asymptotic expansions, are expansions in the basic sense of Taylor expansions providing successive ap- proximations of a function. Unless otherwise mentioned we consider functions of a complex variable and asymptotic expansions in the complex domain and this allows us to use the methods of complex analysis. As we will see, the properties of asymptotic expansions in the complex domain may differ quite a little bit of those in the real domain. In what follows denotes an open sector with vertex 0 either in C∗ or in , the Riemann surface of the logarithm. 2.2.1. Definition. — Definition 2.2.1.— A function f ( ) is said to admit a series n ∈ O n≥0 anx as asymptotic expansion (or to be asymptotic to the series) on a sector if for all proper sub-sector ′ ⋐ of and all N N, there P ∈ exists a constant C > 0 such that the following estimate holds for all x ′: ∈ N−1 f(x) a xn C x N . − n ≤ | | n=0 X ′ The constant C = CN, ′ depends on N and but no condition is required on the nature of this dependence. The technical condition “for all ′ ⋐ ” plays a fundamental role of which we will take benefit soon (cf. Rem. 2.2.10). Observe that the definition includes infinitely many estimates in each of which N is fixed. The conditions have nothing to do with the convergence or 2.2. POINCARE´ ASYMPTOTICS 7 the divergence of the series as N goes to infinity. For N = 1 the condition says that f can be continuously continued at 0 on . For N = 2 it says that the function f has a derivative at 0 on and more generally for any N, that f has a “Taylor expansion” of order N. As in the case of a real variable, asymptotic expansions of functions of a complex variable, when they exist, are unique and they satisfy the same algebraic rules on sums, products, anti-derivatives and compositions. The proofs are similar and we leave them to the reader. The main difference between the real and the complex case lies in the behavior with respect to derivation (cf. Prop. 2.2.9 and Rem. 2.2.10). Notations 2.2.2.— We denote by ⊲ ( ) the set of functions of ( ) admitting an asymptotic expansion A O at 0 on ; ⊲ <0( ) the sub-set of functions of ( ) asymptotic to zero at 0 on . A A Such functions are called flat functions at 0 on ; ⊲ T = T : ( ) C[[x]] the map assigning to each f ( ) its asymp- A → ∈ A totic expansion at 0 on . Due to the uniqueness of the asymptotic expansion, the map T is well defined and is called the Taylor map on (cf. Exa. 2.2.3 below). Due to the algebraic properties of asymptotic expansions the sets ( ) and <0( ) A A are naturally endowed with a structure of vector spaces and the Taylor map is a linear map with kernel <0( ). Proposition 2.2.9 below will improve A this result. We notice that <0( ) is not 0: exponentials of various powers A of x provide examples of non-zero functions of <0( ) for any . For in- A stance, if = x; arg(x) < π/2 , the function exp( 1/x) belongs to <0( ); { | | } − A if = x ; arg(x) < π , the function exp( 1/√x) where √x stands for the { | | } − principal determination of x1/2 belongs to <0( ). A 2.2.2. Examples. — Example 2.2.3 (A trivial example: convergent series) Let be a punctured disc D∗ around 0 (i.e., a sector of opening > 2π in C). If f is an analytic function on D then f is asymptotic to its Taylor series at 0 on D∗. Reciprocally, if f is an analytic function on D∗ that has an asymptotic expansion at 0 on D∗ then, f is bounded near 0 and according to the removable singularity Theorem, f is analytic on all of D. 8 CHAPTER 2. ASYMPTOTIC EXPANSIONS Example 2.2.4 (A fundamental example: the Euler function) Consider the Euler equation dy (1) x2 + y = x. dx Looking for a power series solution one finds the unique series (2) E(x)= ( 1)n n! xn+1 n≥0 − called the Euler series. The Euler seriesX is clearly divergent for all x = 0 and thus, it does e 6 not provide an analytic solution near 0 by Cauchy summation. However, an actual solution can be found by applying the Lagrange method on R+; notice that 0 is a singular point of the equation and the Lagrange method must be applied on a domain (i.e., a connected open set) containing no singular point (R+ is connected, open in R and does not contain 0). Among the infinitely many solutions given by the method we choose the only one which is bounded as x tend to 0+; it reads x 1 1 dt +∞ e−ξ/x E(x)= exp + = dξ 0 − t x t 0 1+ ξ Z Z and is not only a solution on R+ but also a well defined solution on (x) > 0. ℜ Actually, the function E is asymptotic to the Euler series E on x C ; (x) > 0 . { ∈ ℜ } A proof works as follows: writing N−2 e 1 ξN−1 = ( 1)nξn +( 1)N−1 1+ ξ − − 1+ ξ n=0 X +∞ n −u and using 0 u e du = Γ(1+ n), we get the relation N−2 R +∞ ξN−1 e−ξ/x E(x)= ( 1)n Γ(1 + n) xn+1 +( 1)N−1 dξ − − 1+ ξ n=0 0 X Z and we are left to bound the integral remainder term. Choose 0 <δ<π/2 and consider the (unlimited) proper sub-sector δ = x ; arg(x) < π/2 δ | | − of the half-plane = x ; (x) > 0 . { ℜ } Figure 2 2.2. POINCARE´ ASYMPTOTICS 9 For all x δ, we can write ∈ N−2 +∞ E(x) ( 1)n n! xn+1 ξN−1 e−ℜ(ξ/x) dξ − − ≤ n=0 0 X Z +∞ ξN−1 e−ξ sin(δ)/|x| dξ ≤ Z0 x N +∞ = | | uN−1 e−u du = C x N (sin δ)N | | Z0 with C = Γ(N)/(sin δ)N . This proves that the function E(x) is asymptotic to the Euler series E(x) at 0 on the half plane . Observe that the constant C does not depend on x but it depends on N and δ and it tends to infinity as δ tends to 0. Thus, the estimate is no longere valid on the whole sector = x ; (x) > 0 . { ℜ } If we slightly turn the line of integration to the line dθ with argument θ then, the same calculation stays valid and provides a function Eθ(x) with the same asymptotic expansion on the half plane bisected by dθ. Due to Cauchy’s Theorem, Eθ(x) is the analytic continuation of E(x). Denote by E(x) the largest analytic continuation of the initial function E(x) by such a method. Its domain of definition is easily determined: we can rotate the line dθ as long as it does not meet the pole ξ = 1 of the integrand, i.e., we − can rotated it from θ = π to θ =+π. We get so an analytic continuation of the initial − function E on the sector E = x ; 3π/2 < arg(x) < +3π/2 { ∈ − } of the universal cover of C∗. On such a sector, E(x) is asymptotic to the Euler series E(x). e Figure 3 With this construction we are given on x C∗ ; (x) < 0 two determinations E+(x) { ∈ ℜ } and E−(x) of E(x) when the direction θ approaches +π and π respectively. Let us − observe the following two facts: ⊲ The determinations E+(x) and E−(x) are distinct since, otherwise, the func- tion E(x) would be analytic at 0 and the Euler series E(x) would be convergent. ⊲ Although E(x) admits an analytic continuation as a solution of the Euler equation ∗ e on all of the universal cover of C (Cauchy-Lipschitz Theorem) its stops having an asymptotic expansion on any sector larger than E (i.e., E ( ). Indeed, the two determinations E+(x) and E−(x) satisfy the relation (see [LR90] or the calculation of the variation of E(x) in Remark 2.5.3) (3) E+(x) E−(x)=2πi e1/x. − 10 CHAPTER 2. ASYMPTOTIC EXPANSIONS Thus, E+(x) can be continued through the negative imaginary axis by set- ting E+(x)=E(x)+2πie1/x and symmetrically for E−(x) through the positive imaginary axis. Any asymptotic condition fails since e1/x is unbounded at 0 when (x) is positive. ℜ Such a phenomenon of discontinuity of the asymptotics is called Stokes phenomenon (see end of Rem. 2.5.3 and Sect. 4.3). The function E(x) is called the Euler function. Unless otherwise specified we consider it as a function defined on x ; arg(x) < 3π/2 . { ∈ | | } Example 2.2.5 (A classical example: the exponential integral) The exponential integral Ei(x) is the function given by +∞ dt (4) Ei(x)= e−t t · Zx The integral being well defined on horizontal lines avoiding 0 the function Ei(x) is well defined and analytic on the plane C slit along the real non positive axis. Let us first determine its asymptotic behavior at the origin 0 on the right half plane = x ; (x) > 0 . For this, we start with the asymptotic expansion of its deriva- { ℜ } tive Ei′(x)= e−x/x. Taylor expansion with integral remainder for e−x gives − N−1 xn xN 1 e−x = ( 1)n +( 1)N (1 u)N−1 e−ux du − n! − (N 1)! − n=0 0 X − Z and then, since ( ux) < 0, ℜ − N−1 1 xn−1 x N−1 Ei′(x)+ + ( 1)n | | x − n! ≤ N! · n=1 X We see that a negative power of x occurs with a logarithm as anti-derivative. Integrating between ε> 0 and x and making ε tend to 0 we obtain N−1 xn x N Ei(x)+ln(x)+ γ + ( 1)n | | with γ = lim Ei(x)+ln(x) . − n n! ≤ N! − x→0+ n=1 · X To fit our definition of an asymptotic expansion we must consider the func- tion Ei(x)+ln(x). By extension, one says that Ei(x) has the asymptotic expansion ∞ xn ln(x) γ ( 1)n − − − − n n! · n=1 X · We leave as an exercise the fact that γ is indeed the Euler con- n stant limn→+∞ 1/p ln(n). Notice that, this time, we did not need to shrink the p=1 − sector . P Look now what happens at infinity. Instead of calculating the asymptotic expansion of Ei(z) at infinity from its definition we notice that the function y(x)= e1/x Ei(1/x) is the Euler function f(x). Hence, it has on at 0 the same asymptotics as f(x). Turning back to the variable z =1/x we can state that ez Ei(z) has the series ( 1)n n!/zn+1 ≃∞ n≥0 − as asymptotic expansion at infinity on . By extension, one says that Ei(z) is asymptotic P to e−z ( 1)nn!/zn+1 on at infinity. n≥0 − P 2.2. POINCARE´ ASYMPTOTICS 11 Example 2.2.6 (A generalized hypergeometric series 3F0) We consider a generalized hypergeometric equation with given values of the parameters, say, d d d d (5) D3,1y z z +4 z z +1 z 1 y =0. ≡ dz − dz dz dz − The equation has an irregular singular point at infinity and a unique series solution 1 (n + 2)!(n + 3)!(n + 4)! 1 (6) g(z)= z4 2!3!4!n! zn · nX≥0 Using the standard notatione for the hypergeometric series, the series g reads −4 1 g(z)= z 3F0 3, 4, 5 . { } z e By abuse of language, we will also call g an hypergeometric series. e One can check that the equation admits, for 3π < arg(z) < +π, the solution e − 1 g(z)= Γ(1 s)Γ( s)Γ( 1 s)Γ(4 + s)eiπszs ds 2πi 2!3!4! − − − − Zγ where γ is a path from 3 i to 3+ i along the line (s)= 3. This follows from − − ∞ − ∞ ℜ − the fact that the integrand G(s, z) satisfies the order one difference equation deduced from D3,1 by applying a Mellin transform. We leave the proof to the reader. Instead, let us check that the integral is well defined. The integrand G(s, z) being continuous along γ we just have to check the behavior of G(s, z) as s tends to infinity along γ. An asymptotic expansion of Γ(t + iu) for t R fixed and u R large is given by (see [BH86, p. 83]): ∈ ∈ 1 π π 1 (7) Γ(t + iu)= u t− 2 e− 2 |u| √2π ei 2 (t− 2 ) sgn(u)−iu u iu 1+ O 1/u . | | | | It follows that G(t + iu, z) satisfies (8) G(t + iu, z) = (2π)2 u −2t+2 z t e−2π|u|−πu−u arg(z) 1+ O(1/u) . | | | | The exponent of the exponential being negative for 3π < arg( z) < π the integral is − convergent and it defines an analytic function g(z). Let us prove that the function g(z) is asymptotic to g(z) at infinity on the sec- tor = z ; 3π < arg(z) < +π . For this, consider a path { − } ∗e γn,p = γ1 γ2 γ3 γ4 (n,p N ) ∪ ∪ ∪ ∈ as drawn on Fig.4. The path γn,p encloses the poles sm = 4 m for m =0,...,n + 1 of G(s, z) and the − − −4−m residues are Res G(s, z); s = 4 m = (2+ m)!(3 + m)!(4 + m)! z /m! = 2!3!4! am. − − Indeed, Γ(4 + s) has a simple pole at s = 4 m and reads − − ( 1)m Γ 4+( 4 m + t) = Γ( m + t)= − t−1 + O(1) − − − m! while all other factors of G are non-zero analytic functions. We deduce that n+1 1 1 a G(s, z)ds = m 2πi 2!3!4! z4 zm · γn,p m=0 Z X 12 CHAPTER 2. ASYMPTOTIC EXPANSIONS Figure 4. Path γn,p Formula (8) implies the estimate G(t + iεp, z) Cp2n+5 e−(2π+επ+ε arg(z))p, ε = 1, ≤ ± valid for z > 1 all along γ2 γ4 , the constant C depending on n and z but not on p. This | | ∪ shows that the integral along γ2 γ4 tends to zero as p tends to infinity and consequently, ∪ we obtain n+1 1 a g(z)= m + g (z) z4 zm n m=0 1 Xn 3 where gn(z) = G(s, z)ds and γ = s C ; (s) = 4 n oriented 2πi 2!3!4! γn { ∈ ℜ − − − 2 } upwards. R For any (small enough) δ > 0 consider the proper sub-sector δ of defined by δ = z C ; z > 1 and 3π + δ < arg(z) <π δ . ∈ | | − − 3 n s For z δ and s = 4 n + iu γ , the factor z satisfies ∈ − − − 2 ∈ −u(π−δ) s 1 e if u< 0, z 3 u(3π−δ) | | ≤ z 4+n+ 2 · e if u> 0. | | and using again formula (7) we obtain Const G 4 n 3 + iu, z n,δ u 13+n e−|u|δ. − − − 2 ≤ z (4+n)+1 | | | | Hence, there exists a constant C = C(n,δ) depending on n and δ but not on z such that n+1 1 am C g(z) = gn(z) for all z δ. − z4 zm ≤ z (4+n)+1 ∈ m=0 | | X Rewriting this estimate in the form n 1 am an+1 C + an+1 g(z) = gn(z)+ | | for all z δ − z4 zm z(4+n)+1 ≤ z (4+n)+1 ∈ m=0 | | X we satisfy Definition 2.2.1 for g at the order 4+ n . With this method we do not know how the constant C depends on n but we know 2 2 that an+1 grows like (n!) and then C + an+1 itself grows at least like (n!) . | | | | 2.2. POINCARE´ ASYMPTOTICS 13 Example 2.2.7 (A series solution of a mild difference equation) Consider the order one difference equation 1 (9) h(z + 1) 2h(z)= − z · A difference equation is said to be mild when its companion system, here y1(z + 1) 2 1/z y1(z) = " y2(z + 1) # " 0 1 #" y2(z) # 2 0 has an invertible leading term; in our case, 0 1 is invertible. The term “mild” and its contrary “wild” were introduced by M. van der Put and M. Singer [vdPS97]. Let us look at what happens at infinity. By identification, we see that equation (9) n has a unique power series solution in the form h(z) = n≥1 hn/z . The coefficients hn are defined by the recurrence relation e P p (m + p 1)! hn = ( 1) hm − − (m 1)! p! m+p=n − m,pX≥1 starting from the initial value h1 = 1. It follows that the sequence hn is alternate and − satisfies hn n hn−1 . | | ≥ | | Consequently, hn n! and the series h is divergent. Actually the recurrence relation can | | ≥ be solved as follows. Consider the Borel transform e ζn−1 h(ζ)= h n (n 1)! nX≥1 − b of h (cf. Def. 6.3.1). It satisfies the Borel transformed equation e−ζ h(ζ) 2h(ζ)=1 and − then h(ζ)=1/(e−ζ 2). Its Taylor series at 0 reads − e n+1 n b b ( 1) p n b T0h(ζ)= − ζ n! 2p+1 nX≥0 Xp≥0 nb n−1 p+1 which implies that hn =( 1) p≥0 p /2 . Again, we see that the series h is diver- n−1 n−+1 gent since hn n /2 . | | ≥ P e We claim that the function +∞ h(z)= h(ζ)e−zζ dζ Z0 is asymptotic to h(z) at infinity on the sector b= z ; (z) > 0 (right half-plane). Indeed, {π ℜ } π choose N N and a proper sub-sector δ = z ; + δ < arg(z) < δ of . From the ∈ { − 2 2 − } Taylor expansione with integral remainder of h(ζ) at 0 N n−1 N 1 ζ ζ N−1 (N) h(ζ)= hn + b (1 t) h (ζt)dt (n 1)! (N 1)! − n=1 0 X − − Z b b we obtain N h +∞ ζN 1 h(z)= n + (1 t)N−1 h(N)(ζt)dt e−zζ dζ. zn (N 1)! − n=1 0 0 X Z − Z b 14 CHAPTER 2. ASYMPTOTIC EXPANSIONS To bound h(N)(ζt) we use the Cauchy Integral Formula N! h(u) b h(N)(ζt)= du 2πi (u ζt)N+1 Cζt Z −b where Cζt denotes the circleb with center ζt, radius 1/2, oriented counterclockwise. For t [0, 1] and ζ [0, + [ then ζt is non negative and (u) 1/2 when u runs ∈ ∈ ∞ ℜ ≥ − over any Cζt. Hence, we obtain N!2N 1 (N 1)!2N h(N)(ζt) and (1 t)N−1h(N)(ζt)dt − ≤ 2 e1/2 − ≤ 2 e1/2 · Z0 − − Finally, from the identity above we can conclude that, for all z δ, b b ∈ N h 2N +∞ C (10) h(z) n ζN e−ζz dζ = − zn ≤ 2 e1/2 z N+1 n=1 Z0 X − | | N with C = 1 N! 2 . 2− e1/2 (sin δ)N+1 This proves that h(z) is asymptotic to h(z) at infinity on . e Example 2.2.8 (A series solution of a wild difference equation) Consider the order one inhomogeneous wild difference equation 1 1 1 (11) ℓ(z +1)+ 1+ ℓ(z)= z z z · An identification of terms of equal power shows that it admits a unique series solution −n ℓ(z)= ℓnz nX≥1 whose coefficients ℓn are given by thee recurrence relation p (m + p 1)! ℓn+1 = 2ℓn ( 1) ℓm − − − − p!(m 1)! m+p=n − m≥X1,p≥1 from the initial value ℓ1 = 1. It follows that the sequence (ℓn)n≥1 is alternate and satisfies ℓn+1 (n 1) ℓn−1 . | | ≥ − | | n Hence, ℓ2n 2 (n 1)! for all n and consequently, the series is divergent. The Borel ≥ − transform ℓ(ζ) of the series ℓ(z) satisfies the equation ζ ζ b e e−ξℓ(ξ)dξ + ℓ(ξ)dξ + ℓ(ξ)=1 Z0 Z0 equivalent to the two conditions ℓb(0) = 1 and ℓb′(ζ)= b e−ζ 1 ℓ(ζ). Hence, − − 1 −ζ ℓ(ζ)= e−ζ+e . b e b b +∞ −zζ We leave as an exercise to prove thatb the Laplace integral 0 ℓ(ζ)e dζ is a solution of (11) asymptotic to ℓ(z) at infinity on the sector (z) > 1 (Follow the same method ℜ R− as in the previous exercise and estimate the constant C). b b 2.2. POINCARE´ ASYMPTOTICS 15 2.2.3. Algebras of asymptotic functions. — Recall that denotes a given open sector with vertex 0 in C 0 or in the Riemann surface of the \{ } logarithm . Unless otherwise mentioned we refer to the usual derivation d/dx and to Notations 2.2.2. Proposition 2.2.9 (Differential algebra and Taylor map) ⊲ The set ( ) endowed with the usual algebraic operations and the usual A derivation d/dx is a differential algebra. ⊲ The Taylor map T = T : ( ) C[[x]] is a morphism of differential A → algebras with kernel <0( ). A Proof. — Due to the algebraic rules on asymptotic expansions ( ) is a sub- A algebra of ( ). We are left to prove that ( ) is stable under derivation with O A respect to x and that the Taylor map T commutes with derivation. Let f ( ) have an asymptotic expansion T f(x)= a xn. Since f ∈ A n≥0 n belongs to ( ) it admits a derivative f ′ ( ). Moreover, for all ′ ⋐ and O ∈O P all N 0, there exists C > 0 such that, for all x ′, ≥ ∈ N f(x) a xn C x N+1 − n ≤ | | n=0 X and we want to prove that for all ′′ ⋐ , for all N > 0, there exists C′ > 0 such that, for all x ′′, ∈ N−1 f ′(x) (n + 1)a xn C′ x N . − n+1 ≤ | | n=0 X Fix N > 0 and consider the function g(x)= f(x) N a xn. − n=0 n We must prove that the condition P for all ′ ⋐ , there exists C > 0 such that g(x) C x N+1 for all x ′ • | | ≤ | | ∈ implies the condition for all ′′ ⋐ , there exists C′ > 0 such that g′(x) C′ x N for all x ′′. • | | ≤ | | ∈ Given ′′ ⋐ , choose a sector ′ such that ′′ ⋐ ′ ⋐ (see Fig 5) and let δ be so small that, for all x ′′, the closed disc B(x, x δ) centered at x with ∈ | | radius x δ be contained in ′. Denote by γ the boundary of B(x, x δ). | | x | | 16 CHAPTER 2. ASYMPTOTIC EXPANSIONS Figure 5 By assumption, for all t B(x, x δ) and, especially, for all t γ the ∈ | | ∈ x function g satisfies g(t) C t N+1. We deduce from Cauchy’s integral for- ′ 1 | g(t)| ≤ | | ′′ ′ mula g (x)= 2 dt that, for all x , the derivative g satisfies 2πi γx (t−x) ∈ ′ 1R 2π x δ C N+1 ′ N g (x) max g(t) | | 2 x (1 + δ) = C x ≤ 2π t∈γx ( x δ) ≤ x δ | | | | | | | | with C ′ = C (1 + δ)N+1/δ . Hence, the result. Remarks 2.2.10. — Let us insist on the role of Cauchy’s integral formula. ⊲ The proof of Proposition 2.2.9 does require that the estimates in Defi- nition 2.2.1 be satisfied for all ′ ⋐ instead of itself. Otherwise, we could not apply Cauchy’s integral formula and we could not assert anymore that the algebra ( ) is differential. In such a case, algebras of asymptotic functions A would not be suitable to handle solutions of differential equations. ⊲ Theorem 2.2.9 is no longer valid in real asymptotics, where Cauchy’s integral formula does not hold, as it is shown by the following counter-example. The function f(x)= e−1/x sin(e1/x) is asymptotic to 0 (the null series) on R+ at 0. Its derivative f ′(x) = 1 e−1/x sin(e1/x) 1 cos(e1/x) has no x2 − x2 limit at 0 on R+ and then no asymptotic expansion. This proves that the set of real analytic functions admitting an asymptotic expansion at 0 on R+ is not a differential algebra. The following proposition provides, in particular, a proof of the uniqueness of the asymptotic expansion, if any exists. Proposition 2.2.11.— A function f belongs to ( ) if and only if f belongs A to ( ) and a sequence (a ) exists such that O n n∈N 1 (n) ′ lim f (x)= an for all ⋐ . n! x→0 x∈ ′ 2.3. GEVREY ASYMPTOTICS 17 Proof. — The only if part follows from Proposition 2.2.9. To prove the if part consider ′ ⋐ . For all x and x ′, f admits the Taylor expansion 0 ∈ with integral remainder N−1 1 x 1 f(x) f (n)(x )(x x )n = (x t)N−1f (N)(t)dt. − n! 0 − 0 (N 1)! − n=0 x0 X Z − Notice that we cannot write such a formula for x0 = 0 since 0 does not even belong to the definition set of f. However, by assumption, the limit of the left ′ hand side as x0 tends to 0 in exists; hence, the limit of the right hand side exists and we can write N−1 x 1 f(x) a xn = (x t)N−1f (N)(t)dt. − n (N 1)! − n=0 0 X Z − Then, N−1 f(x) a xn 1 x(x t)N−1f (N)(t)dt − n ≤ (N−1)! 0 − n=0 X N R |x| (N) N sup ′ f (t) C x , ≤ N! t∈ ≤ | | 1 (N) the constant C = sup ′ f (t) being finite by assumption. Hence, the N! t∈ | | conclusion 2.3. Gevrey asymptotics When working with differential equations for instance, it appears easily that the conditions required in Poincar´easymptotics are too weak to fit some natural requests, say for instance, to provide asymptotic functions that are solutions of the equation when the asymptotic series themselves are solution or, better, to set a 1-to-1 correspondence between the series solution and their asymptotic expansion. A precise answer to these questions is found in the theories of summation (cf. Chaps. 6 and 8). A first step towards that aim is given by strengthening Poincar´easymptotics into Gevrey asymptotics. From now on, we are given k > 0 and we denote its inverse by s = 1/k When k > 1/2 then π/k < 2π and the sectors of the critical opening π/k to be further considered may be seen as sectors of C∗ itself; otherwise, they must be considered as sectors of the universal cover of C∗. In general, 18 CHAPTER 2. ASYMPTOTIC EXPANSIONS depending on the problem, we may assume that k > 1/2 after performing a change of variable (ramification) x = tp with a large enough p N. ∈ Recall that, unless otherwise specified, we denote by , ′,... open sectors in C∗ or and that the notation ′ ⋐ means that the closure of the sector ′ in C∗ or lies in (cf. Def. 2.1.2). 2.3.1. Gevrey series. — Definition 2.3.1 (Gevrey series of order s or of level k) n A series n≥0 anx is of Gevrey type of order s (in short, s-Gevrey) if there exist constants C > 0,A> 0 such that the coefficients a satisfy P n a C(n!)sAn for all n. | n| ≤ The constants C and A do not depend on n. n n s Equivalently, a series n≥0 anx is s-Gevrey if the series n≥0 anx /(n!) converges. P P Notation 2.3.2.— We denote by C[[x]]s the set of s-Gevrey series. Observe that the spaces C[[x]]s are filtered as follows: C x = C[[x]] C[[x]] C[[x]] ′ C[[x]] = C[[x]] { } 0 ⊂ s ⊂ s ⊂ ∞ for all s,s′ satisfying 0 ⊲ A convergent series (cf. Exa. 2.2.3) is a 0-Gevrey series. ⊲ The Euler series E(x)(cf. Exa. 2.2.4) is 1-Gevrey and hence s-Gevrey for any s> 1. It is s-Gevrey for no s< 1. e ⊲ The hypergeometric series 3F0(1/z) (cf. Exa. 2.2.6) is 2-Gevrey and s-Gevrey for no s< 2. ⊲ The series h(z) (cf. Exa. 2.2.7) is 1-Gevrey. Indeed, it is at least 1-Gevrey since hn n! and it is at most 1-Gevrey since its Borel transform at infinity converges. | | ≥ e n n ⊲ From the fact that ℓ2n+1 2 n! and ℓ2n 2 (n 1)! we know that, if the | | ≥ | | ≥ − series ℓ˜(z) (cf. Exa. 2.2.8) is of Gevrey type then it is at least 1/2-Gevrey. From the fact that its Borel transform is convergent it is of Gevrey type and at most 1-Gevrey. Note however that its Borel transform is an entire function and consequently, ℓ˜(z) could be less than 1-Gevrey. Proposition 2.3.4.— C[[x]]s is a differential sub-algebra of C[[x]] stable un- der composition. 2.3. GEVREY ASYMPTOTICS 19 Proof.— C[[x]]s is clearly a sub-vector space of C[[x]]. We have to prove that it is stable under product, derivation and composition. ⊲ Stability of C[[x]]s under product. — Consider two s-Gevrey series n n n≥0 anx and n≥0 bnx satisfying, for all n and for positive constants A, B, C and K, the estimates P P a C(n!)sAn and b K(n!)sBn. | n| ≤ | n| ≤ n Their product is the series n≥0 cnx where cn = p+q=n apbq. Then, P P c CK (p!)s(q!)sApBq CK(n!)s(A + B)n. | n| ≤ ≤ p+q=n X Hence the result. ⊲ Stability of C[[x]]s under derivation. — Given an s-Gevrey series a xn satisfying a C(n!)sAn for all n, its derivative b xn n≥0 n | n| ≤ n≥0 n satisfies P P b =(n + 1) a (n + 1)C((n + 1)!)sAn+1 C′(n!)sA′n | n| | n+1| ≤ ≤ for convenient constants A′ > A and C′ C. Hence the result. ≥ ⊲ Stability of C[[x]]s under composition [Gev18]. — Let f(x) = p n p≥1 apx and g(y)= n≥0 bny be two s-Gevrey series. The compo- sition g f(x) = c xn provides a well-defined power series in xe. From P ◦ n≥0 Pn the hypothesis, theree exist constants h,k,a,b > 0 such that, for all p and n, P s p the coefficientse e of the series f and g satisfy respectively ap h(p!) a and | | ≤ b k(n!)sbn. | n| ≤ Fa`adi Bruno’s formula allowse use to write n mj n! c = N(m) m ! b j! a n | | |m| j mX∈In jY=1 where In stands for the set of non-negative n-tuples m = (m1, m2, . . . , mn) satisfying the condition n jm = n, where m = n m and the coeffi- j=1 j | | j=1 j cient N(m) is a positive integer depending neither on f nor on g. Using the P n P Gevrey hypothesis and the condition j=1 jmj = n, we can then write e e n P 1+s n! c kan N(m) m !1+s (hb)|m| j! mj . | n| ≤ | | mX∈In jY=1 20 CHAPTER 2. ASYMPTOTIC EXPANSIONS As clearly m n and N(m) N(m)1+s, with B = max(hb, 1), we obtain | | ≤ ≤ n 1+s n! c k (aB)n N(m) m ! j! mj | n| ≤ | | mX∈In jY=1 and then, from the inequality K X1+s K X 1+s for non-negative s i=1 i ≤ i=1 i and X ’s, the estimate i P P n 1+s n! c k (aB)n N(m) m ! j! mj . | n| ≤ | | mX∈In jY=1 Now, applying Fa`adi Bruno’s formula to the case of the series f(x)= x/(1 x) − and g(x) = 1/(1 x), implying thus g f(x)=1+ x/(1 2x), we get the − ◦ − relation e n e2n−1n! when n 1 e N(m) m ! (j!)mj e= ≥ | | 1 when n = 0; mX∈In jY=1 hence, a fortiori, n N(m) m ! (j!)mj 2n n! | | ≤ mX∈In jY=1 and we can conclude that c k (n!)s (21+s aB)n | n| ≤ for all n N, which ends the proof. ∈ One has actually the more general result stated in Proposition 2.3.6 below. Definition 2.3.5.— A series g(y ,...,y )= b yn1 ...ynr 1 r n1,··· ,nr≥0 n1,...,nr 1 r is said to be (s ,...,s )-Gevrey if there exist positive constants C,M ,...,M 1 r P 1 r such that, for all n-tuple (n1,...,ne r) of non-negative integers, the series sat- isfies an estimate of the form b C(n !)s1 (n !)sr M n1 M nr . n1,...,nr ≤ 1 ··· r 1 ··· r It is said to be s-Gevrey when s1 = = sr = s. ··· Proposition 2.3.6.— Let f1(x), f2(x),..., fr(x) be s-Gevrey series without constant term and let g(y1,...,yr) be an s-Gevrey series in r variables. Then, the series g(f1(x),...,efr(x))eis an s-Gevreye series. e th Since the expression of the n derivative of g(f1(x),..., fr(x)) has the e e e same form as in the case of g(f(x)) the proof is identical to the one for g(f(x)) and we leave it as an exercise. e e e e e e e 2.3. GEVREY ASYMPTOTICS 21 The result is, a fortiori, true when g or some of the fj’s are analytic. The fact that C[[x]]s be stable by product (and composition of course) can then be seen as a consequence of that proposition.e e 2.3.2. Algebras of Gevrey asymptotic functions. — Definition 2.3.7 (Gevrey asymptotics of order s) A function f ( ) is said to be Gevrey asymptotic of order s (for short, ∈O n s-Gevrey asymptotic) to a series n≥0 anx on if for any proper sub-sector ′ ⋐ there exist constants C ′ > 0 and A ′ > 0 such that, the following P estimate holds for all N N∗ and x ′: ∈ ∈ N−1 n s N N (12) f(x) a x C ′ (N!) A ′ x − n ≤ | | n=0 X A series which is the s-Gevrey asymptotic expansion of a function is said to be an s-Gevrey asymptotic series. Notation 2.3.8.— We denote by ( ) the set of functions admitting an As s-Gevrey asymptotic expansion on . 1 Given an open arc I of S , let I (R) denote the sector based on I with radius R. Since there is no possible confusion, we also denote the set of germs of functions admitting an s-Gevrey asymptotic expansion on a sector based on I by (I)= lim (R) . s −→ s I A R→0 A ′ ∗ The constants C ′ and A ′ may depend on ; they do not depend on N N ∈ and x ′. Gevrey asymptotics differs from Poincar´easymptotics by the fact ∈ that the dependence on N of the constant CN, ′ (cf. Def. 2.2.1) has to be of Gevrey type. Comments 2.3.9 (On the examples of chapter 1) The calculations in Section 2.2.2 show the following Gevrey asymptotic properties: ⊲ The Euler function E(x) is 1-Gevrey asymptotic to the Euler series E(x) on any (germ at 0 of) half-plane bisected by a line dθ with argument θ such that π<θ< +π. − It is then 1-Gevrey asymptotic to E(x) at 0 on the full sector 3π/2 < arg(xe) < +3π/2. − ⊲ Up to an exponential factor the exponential integral has the same properties on germs of half-planes at infinity. e 22 CHAPTER 2. ASYMPTOTIC EXPANSIONS ⊲ The generalized hypergeometric series g(z) of Example 2.2.6 is 2-Gevrey and we stated that the function g(z) is asymptotic in the rough sense of Poincar´eto g(z) on the half-plane (z) > 0 at infinity. We will seee (cf. Com. 6.2.7) that the function g(z) is ℜ actually 1/2-Gevrey asymptotic to g(z). Our computations in Sect. 2.2.2 do not allowe us to state yet such a fact since we did not determine how the constant C depends on N. ⊲ The function h(z) of Examplee 2.2.7 was proved to be 1-Gevrey asymptotic to the series h(z) (cf. Estim. (10) on the right half-plane (z) > 0 at infinity. ℜ ⊲ The function ℓ(z) of Example 2.2.8 satisfies the same estimate (10) as h(z) on the sectore ′ = π/2+ δ < arg(z) < π/2 δ , for (0 <δ <π/2), with a constant C {− 1/2− } which can be chosen equal to C = e−1/2+e N!2N /(sin δ)N+1. The function ℓ(z) is then 1-Gevrey asymptotic to the series ℓ˜(z) on the right half-plane (z) > 0 at infinity. ℜ Proposition 2.3.10.— An s-Gevrey asymptotic series is an s-Gevrey se- ries. n Proof. — Suppose the series n≥0 anx is the s-Gevrey asymptotic series of a function f on . For all N, the result follows from Condition (12) applied P twice to N−1 N a xN = f(x) a xn f(x) a xn . N − n − − n n=0 n=0 X X Proposition 2.3.11.— A function f ( ) belongs to s( ) if and only if ′ ′ ∈ A ′ A for all ⋐ there exist constants C ′ > 0 and A ′ > 0 such that the following estimate holds for all N N and x ′: ∈ ∈ N d f ′ s+1 ′N (13) (x) C ′ (N!) A ′ . dxN ≤ Proof.— Prove that Condition (13) implies Condition (12). — Like in the proof of Prop. 2.2.11, write Taylor’s formula with integral remainder: N−1 f(x) a xn = x 1 (x t)N−1f (N)(t)dt = 1 xf (N)(t)d(x t)N − n 0 (N−1)! − − N! 0 − n=0 X R R and conclude that N−1 N n 1 d f N ′ s ′N N f(x) anx sup N (t) x C ′ (N!) A ′ x . − ≤ N! t∈ ′ dx ·| | ≤ | | n=0 X Prove that Condition (12) implies Condition (13). — Like in the proof of Prop. 2.2.9, attach to any x ′ a circle γ centered at x with radius x δ, the ∈ x | | constant δ being chosen so small that γx be contained in and apply Cauchy’s 2.3. GEVREY ASYMPTOTICS 23 integral formula: N−1 dN f N! dt N! dt (x)= f(t) = f(t) a tn dxN 2πi (t x)N+1 2πi − n (t x)N+1 γx γx n=0 Z − Z X − since the N th derivative of a polynomial of degree N 1 is 0. Hence, − N N d f N! s N t ′ N (x) C (N!) A ′ | | N+1 dt dx ≤ 2π γ t x Z x | − | N N 1 s+1 N x (1 + δ) C ′ (N!) A ′ | | 2πδ x ≤ 2π x N+1δN+1 | | | | s+1 ′N ′ 1 = C ′ (N!) A ′ with A ′ = A ′ 1+ . δ Proposition 2.3.12 (Differential algebra and Taylor map) The set ( ) is a differential C-algebra and the Taylor map T restricted As to ( ) induces a morphism of differential algebras As T = T : ( ) C[[x]] s, As −→ s with values in the algebra of s-Gevrey series. Proof. — Let ′ ⋐ . Suppose f and g belong to ( ) and satisfy on ′ As dN f dN g (x) C(N!)s+1AN and (x) C′(N!)s+1A′N . dxN ≤ dxN ≤ The product fg belongs to ( ) (cf. Prop. 2.2.9) and its derivatives satisfy A N dN (fg) dpf dN−pg (x) Cp (x) (x) CC′(N!)s+1(A + A′)N . dxN ≤ N dxp dxN−p ≤ p=0 X The fact that the range T ( ) be included in C[[x]] follows from Propo- s, As s sition 2.3.10. Observe now the effect of a change of variable x = tr, r N∗. Clearly, if ∈ a series f(x) is Gevrey of order s (level k) then the series f(tr) is Gevrey of order s/r (level kr). What about the asymptotics? Let e=]α,β[ ]0,R[ be a sector in (the directions α ande β are not given × 1/r modulo 2π) and let /r =]α/r, β/r[ ]0,R [ so that as the variable t runs r × over /r the variable x = t runs over . From Definition 2.3.7 we can state: Proposition 2.3.13 (Gevrey asymptotics in an extension of the vari- able) The following two assertions are equivalent: 24 CHAPTER 2. ASYMPTOTIC EXPANSIONS (i) the function f(x) is s-Gevrey asymptotic to the series f(x) on ; (ii) the function g(t) = f(tr) is s/r-Gevrey asymptotic to g(t) = f(tr) e on /r. e e Way back, given an s′-Gevrey series g(t), the series f(x) = g(x1/r) ex- hibits, in general, fractional powers of x. To keep working with series of integer powers of x one may use rank reductione as followse [LR01e]. One can uniquely decompose the series g(t) as a sum r−1 j r g(et)= t gj(t ) Xj=0 r e e r 2πi/r r where the terms gj(t ) are entire power series in t . Set ω = e and x = t . The series g (x) are given, for j = 0,...,r 1, by the relations j − e r−1 j r ℓ(r−j) ℓ e rt gj(t )= ω g(ω t). Xℓ=0 For j = 0,...,r 1, let j edenote the sector e − /r j =](α + 2jπ)/r, (β + 2jπ)/r[ ]0,R1/r[ /r × 0 j j r so that as t runs through /r = /r then ω t runs through /r and x = t runs through . From the previous relations and Proposition 2.3.13 we can state: Corollary 2.3.14 (Gevrey asymptotics and rank reduction) The following two assertions are equivalent: (i) for ℓ = 0,...,r 1 the series g(t) is an s′-Gevrey asymptotic series − on ℓ/r (in the variable t); (ii) for j = 0,...,r 1 the r-ranke reduced series g (x) is an s′r-Gevrey − j asymptotic series on (in the variable x = tr). e With these results we might limit the study of Gevrey asymptotics to small values of s (s s ) or to large ones (s s ) at convenience. ≤ 0 ≥ 1 2.3.3. Flat s-Gevrey asymptotic functions. — In this section we ad- dress the following question: to characterize the functions that are both s- Gevrey asymptotic and flat on a given sector . To this end, we introduce the notion of exponential flatness. 2.3. GEVREY ASYMPTOTICS 25 Definition 2.3.15.— A function f is said to be exponentially flat of order k (or k-exponentially flat) on a sector if, for any proper subsector ′ ⋐ of , there exist constants K and A > 0 such that the following estimate holds for all x ′ : ∈ A (14) f(x) K exp ≤ − x k · | | The constants K and A may depend on ′. Notation 2.3.16.— We denote the set of k-exponentially flat functions on by ≤−k( ). A Proposition 2.3.17.— Let be an open sector. The functions which are s-Gevrey asymptotically flat on are the k-exponentially flat functions, i.e., ( ) <0( )= ≤−k( ) (recall s = 1/k). As ∩ A A Proof.— ⊲ Let f ( ) <0( ) and prove that f ≤−k( ). ∈ As ∩ A ∈ A It is, here, more convenient to write Condition (12) in the following equivalent form: for all ′ ⋐ , there exist A> 0,C > 0 such that the estimate N f(x) CN N/k A x N = C exp ln N A x k ≤ | | k | | holds for all N and all x ′ (with possibly new constants Aand C). ∈ For x fixed, look for a lower bound of the right hand side of this estimate as N runs over N. The derivative ϕ′(N)=ln N(A x )k + 1 of the function | | ϕ(N)= N ln N(A x )k | | seen as a function of a real variable N > 0 vanishes at N = 1/ e(A x k) 0 | | and ϕ reaches its minimal value ϕ(N ) = N at that point. Taking into 0 − 0 account the monotonicity of ϕ, for instance to the right of N0, we can assert that 1 1 inf ϕ(N) ϕ(N0 + 1) = ϕ(N0) 1+ 1 (1 + N0)ln 1+ . N∈N ≤ N0 − N0 Substituting this value of N0 as a function of x in ϕ, we can write ϕ(N0 + 1) = ϕ(N0)ψ(x) where ψ(x) is a bounded function on . Hence, there exists a constant C′ > 0 such that f(x) C′ exp a with a = 1 > 0 independent of x ′. | | ≤ − |x|k k eAk ∈ This proves that f belongs to ≤−k( ). A 26 CHAPTER 2. ASYMPTOTIC EXPANSIONS ⊲ Let f ≤−k( ) and prove that f ( ) <0( ). ∈ A ∈ As ∩ A The hypothesis is now: for all ′ ⋐ , there exist A > 0,C > 0 such that an estimate A f(x) C exp ≤ − x k | | holds for all x ′. Hence, for any N, the estimate ∈ A f(x) x −N C exp x −N . ·| | ≤ − x k | | | | For N fixed, look for an upper bound of the right hand side of this estimate as x runs over R+. Let ψ( x ) = exp A x −N . Its logarithmic derivative | | | | − |x|k | | ψ′( x ) N Ak | | = + ψ( x ) − x x k+1 | | | | | | vanishes for Ak/ x k = N and ψ reaches its maximum value at that point. | | Thus, max ψ( x ) = exp N N N/k and there exists constants |x|>0 | | − k Ak a =(eAk)−1/k and C > 0 such that, for all N N and x Σ′ the function f ∈ ∈ satisfies f(x) CN N/k a x N . ≤ | | <0 Hence, f belongs to s( ) ( ). A ∩ A 2.4. The Borel-Ritt Theorem With any asymptotic function f ( ) over a sector the Taylor map T ∈ A associates a formal series f = T (f). We address now the converse problem: is any formal series the Taylor series of an asymptotic function over a given sector ? The theorem belowe states that the answer is yes for any open sector with finite radius in C∗ or in Poincar´easymptotics. In case the series is s-Gevrey an s-Gevrey asymptotic function always exists when the opening of the sector is small enough but we will see on examples that it might not exist for a too wide . Notice that the Taylor series of a function f (C∗) ∈ A is necessarily convergent by the removable singularity Theorem of Riemann. And thus, when is included in C∗, it cannot be a full neighborhood of 0 in C∗. Theorem 2.4.1 (Borel-Ritt).— Let = C∗ be an open sector of C∗ or of 6 the Riemann surface of logarithm with finite radius R. (i) (Poincar´easymptotics) The Taylor map T : ( ) C[[x]] is onto. A → 2.4. THE BOREL-RITT THEOREM 27 (ii) (Gevrey asymptotics) Suppose has opening π/k. Then, the | | ≤ Taylor map T : ( ) C[[x]] is onto. Recall s = 1/k. s, As → s Proof. — (i) Poincar´easymptotics. — Various proofs exist. The one pre- sented here can be found in [Mal95]. For simplicity, begin with the case of a sector in C∗. ⊲ Case when lies in C∗. Modulo rotation it is sufficient to consider the case when = −π,+π(R) is the disc of radius R slit on the real negative axis. Figure 6 Given any series a xn C[[x]] we look for a function f ( ) n≥0 n ∈ ∈ A with Taylor series T f = a xn. To this end, one introduces functions P n≥0 n β (x) ( ) satisfying the two conditions n ∈O P (1) : a β (x)xn ( ) and (2) : T β (x) 1 for all n 0. n n ∈O n ≡ ≥ nX≥0 Such functions exist: consider, for instance, the functions β 1 and, for 0 ≡ n 1, β (x) = 1 exp b /√x with positive b and √x the principal ≥ n − − n n determination of the square root. In view to Condition (1), observe that since 1 ez = z et dt − − 0 then 1 ez < z for (z) < 0. This implies β (x) b / x for all | − | | | ℜ | n | ≤ n | |R x and n 1 and then, ∈ ≥ p a β (x)xn a b x n−1/2 a b Rn−1/2. n n ≤ | n| n | | ≤ | n| n Now, choose b such that the series a b Rn−1/2 be convergent. n n≥1 | n| n Then, the series a β (x)xn converges normally on and its sum f(x)= n≥0 n n P a β (x)xn is holomorphic on . n≥0 n n P To prove Condition (2), consider any proper sub-sector ′ ⋐ of and P x ′. Then, for any N 1, we can write ∈ ≥ N−1 N−1 f(x) a xn a (β (x) 1)xn + x N a β (x)xn−N . − n ≤ n n − | | n n n=0 n=0 n≥N X X X The first summand is a finite sum of terms all asymptotic to 0 and then, is majorized by C′ x N , for a convenient positive constant C′. The second | | 28 CHAPTER 2. ASYMPTOTIC EXPANSIONS summand is majorized by x N 2 a + a b Rn−1/2−N . | | | N | | n| n n≥XN+1 Choosing C = C′ + 2 a + a b Rn−1/2N provides a positive con- | N | n≥N+1 | n| n stant C (independent of x but depending on N and ′) such that P N f(x) a xn C x N for all x ′. − n ≤ | | ∈ n=0 X This ends the proof in this case. ⊲ General case when lies in C∗. — It is again sufficient to consider the case of a sector of the form = x C∗ ; arg(x) < kπ, 0 < x Let f(x) C[[x]]s be an s-Gevrey series which, up to a polynomial, we ∈ n may assume to be of the form f(x) = n≥k anx . It is sufficient to consider a sector eof opening π/k (as always, k = 1/s) and by means of a rotation, we P can then assume that is an opene sector bisected by the direction θ = 0 with opening π/k; we denote by R its radius. We must find a function f ( ), ∈ As s-Gevrey asymptotic to f over . The proof used here is based on the Borel and the Laplace transforms which will be at the coree of Borel-Laplace summation in Section 6.3. Since f(x) is an s-Gevrey series (cf. Def. 2.3.1) its k-Borel transform(1) a f(ξ)= n ξn−k e Γ(n/k) nX≥k is a convergent series(2) andb we denote by ϕ(ξ) its sum. The adequate Laplace transform to “invert” the k-Borel transform (as a function ϕ(ξ), not as a series f(ξ)) in the direction θ = 0 would be the k-Laplace transform +∞ −ζ/xk b k(ϕ)(x)= φ(ζ)e dζ L Z0 (1) n See Sect. 6.3.1. The k-Borel transform of a series Pn≥k anx is the usual Borel transform of the n/k k s series Pn≥k anX with respect to the variable X = x and expressed in the variable ξ = ζ . (2) Although, when k is not an integer, the series f(ξ) is not a series in integer powers of ξ it becomes b so after factoring by ξ−k. We mean here that the power series ξkf(ξ) is convergent. b 2.4. THE BOREL-RITT THEOREM 29 where ζ = ξk and φ(ζ) = ϕ(ζ1/k). However, although the series f(ξ) is convergent, its sum ϕ(ξ) cannot be analytically continued along R+ up to infinity in general. So, we choose b> 0 belonging to the disc of convergenceb of f(ξ) and we consider a truncated k-Laplace transform bk b k (15) f b(x)= φ(ζ)e−ζ/x dζ Z0 instead of the full Laplace transform (ϕ)(x). Lemma 2.4.2 below shows that Lk the function f = f b answers the question. Lemma 2.4.2 (Truncated Laplace transform).— With notations and conditions as above, and especially being an open sector bisected by θ = 0 with opening π/k, the truncated k-Laplace transform f b(x) of the sum ϕ(ξ) of the k-Borel transform of f(x) in direction θ = 0 is s-Gevrey asymptotic to f(x) on (with s = 1/k as usually). e Proofe . — Given 0 < δ < π/2 and R′ < R, consider the proper sub-sector of defined by = x ; arg(x) < π/(2k) δ/k and x | | ≥ 30 CHAPTER 2. ASYMPTOTIC EXPANSIONS N−1 bk b n an n−N (N/k)−1 −ζℜ(1/xk) f (x) anx | | b ζ e dζ − ≤ Γ(n/k) 0 | | nX=k nX≥N Z N−1 a +∞ + | n| idem Γ(n/k) k n=k Zb X +∞ a k | n| bn−N ζ (N/k)−1 e−ζ sin(δ)/|x| dζ ≤ Γ(n/k) 0 | | nX≥k Z a x N +∞ = n bn−N u(N/k)−1 e−u du | | | | N/k Γ(n/k) (sin δ) 0 nX≥k Z a x N = | n| bn−N | | Γ(N/k)= CΓ(N/k)AN x N Γ(n/k) (sin δ)N/k | | nX≥k where A = 1 and C = |an| bn < + . The constants A and C b(sin δ)1/k n≥k Γ(n/k) ∞ depend on and on the choice of b but are independent of x. This achieves δ P the proof. Comment 2.4.3 (On the Euler series (Exa. 2.2.4)) The proof of the Borel-Ritt Theorem provides infinitely many functions asymptotic to the Euler series E(x)= ( 1)nn! xn+1 at 0 on the sector = x ; arg(x) < 3π/2 . n≥0 − { | | } For instance, the following family provides infinitely many such functions: P e n −a/((n!)2x1/3) n+1 Fa(x)= ( 1) n! 1 e x , a> 0. − − n≥0 X − +∞ e ξ/x We saw in Example 2.2.4 that the Euler function E(x)= 0 1+ξ dξ is both solution of the Euler equation and asymptotic to the Euler series on . We claim that it is the unique R function with these properties. Indeed, suppose E1 be another such function. Then, the difference E(x) E1(x) would be both asymptotic to the null series 0 on and solution − of the homogeneous associated equation x2y′ + y = 0. However, the equation x2y′ + y =0 admits no such solution on but 0. Hence, E = E1 and the infinitely many functions given by the proof of the Borel-Ritt Theorem do not satisfy the Euler equation in general. Taking into account Props. 2.2.9, 2.3.12 and 2.3.17 we can reformulate the Borel-Ritt Theorem 2.4.1 as follows. Corollary 2.4.4.— The set <0( ) of flat functions on and the set A ≤−k( ) of k-exponentially flat functions on are differential ideals of ( ) A A 2.5. THE CAUCHY-HEINE THEOREM 31 and ( ) respectively. The sequences As T 0 <0( ) ( ) C[[x]] 0 → A −→ A −−→ → and, when π/k, | | ≤ T 0 ≤−k( ) ( ) s, C[[x]] 0 → A −→ As −−−→ s → are exact sequences of morphisms of differential algebras. The Borel-Ritt Theorem implies the classical Borel Theorem in the real case providing thus a new proof of it. Corollary 2.4.5 (Classical Borel Theorem).— Any formal power series a xn C[[x]] is the Taylor series at 0 of n≥0 n ∈ a ∞-function of a real variable x. C P Proof. — Apply the Borel-Ritt Theorem on a sector ′ containing R+ and on a sector ′′ containing R−. The two functions so obtained glue together at 0 into a ∞-function in a neighborhood of 0 in R. C 2.5. The Cauchy-Heine Theorem In this section we are given: • ∗ ⊲ a sector = α,β(R) with vertex 0 in C ; • • ⊲ a point x0 in and the straight path γ = ]0,x0] in ; • • ⊲ a function ϕ <0( ) flat at 0 on . ∈ A Definition 2.5.1.— One defines the Cauchy-Heine integral associated with ϕ and x0, to be the function 1 ϕ(t) f(x)= dt. 2πi t x Zγ − Figure 7 32 CHAPTER 2. ASYMPTOTIC EXPANSIONS Denote by: ⊲ = α,β+2π(R) a sector with vertex 0 in the Riemann surface of loga- • rithm overlapping on ; ⊲ θ0 the argument of x0 satisfying α<θ0 <β; ⊲ γ = θ0,θ0+2π( x0 ) the disc of radius x0 slit along γ; D• • | | | | ⊲ ′ = x < x = ( x ); ∩{| | | 0|} α,β | 0| ⊲ ′ = x < x = ( x ). ∩{| | | 0|} α,β+2π | 0| The Cauchy-Heine integral determines a well-defined and analytic func- tion f on γ. By Cauchy’s Theorem, Cauchy-Heine integrals associated with D • 1 ϕ(t) different points x0 and x1 in differ by ⌢ dt, an analytic function 2πi x0x1 t−x on a neighborhood of 0. R Theorem 2.5.2 (Cauchy-Heine).— With notations and conditions as be- • 1 ϕ(t) fore and especially, ϕ flat on , the Cauchy-Heine integral f(x)= 2πi γ t−x dt has the following properties: R 1. The function f can be analytically continued from to ′; we also use Dγ the term Cauchy-Heine integral when referring to this analytic continuation which we keep denoting by f. 2. The function f belongs to ( ′). A 3. Its Taylor series at 0 on ′ reads n 1 ϕ(t) ′ T f(x)= anx with an = n+1 dt. 2πi γ t nX≥0 Z • 4. Its variation varf(x)= f(x) f(xe2πi) is equal to ϕ(x) for all x ′. −≤−k • ′ ∈ 5. If, in addition, ϕ belongs to ( ) then, f belongs to s( ) with the A • A above Taylor series, i.e., , if ϕ is k-exponentially flat on then, f is s-Gevrey n ′ asymptotic to the above series n≥0 anx on (recall s = 1/k). Proof. — The five steps can beP proved as follows. 1. — Consider, for instance, the function f for values of x on the left of γ. To analytically continue this “branch” of the function f to the right of γ it suffices to deform the path γ by pushing it to the right keeping its endpoints ′ 0 and x0 fixed. This allows us to go up to the boundary arg(x)= α of . We can similarly continue the “branch” of the function f defined for values of x on the right of γ up to the boundary arg(x)= β + 2π of ′. 2–3. — We have to prove that, for all subsector ′′ ⋐ ′, the function f satisfies the asymptotic estimates of Definition 2.2.1. 2.5. THE CAUCHY-HEINE THEOREM 33 ⊲ Suppose first that ′′ γ = . Writing ∩ ∅ N−1 1 xn xN = + t x tn+1 tN (t x) n=0 − X − as in Example 2.2.4, we get N−1 xN ϕ(t) f(x)= a xn + dt. n 2πi tN (t x) n=0 γ X Z − Figure 8 Given x ′′, then t x dist(t, ′′)= t sin(δ) for all t γ and so ∈ | − | ≥ | | ∈ N−1 (16) f(x) a xn C x N − n ≤ | | n=0 X where the constant C = 1 |ϕ(t)| dt is finite (the integral converges 2π γ |t|N+1 sin(δ) ′′ since ϕ is flat at 0 on γ) and R depends on N and , but is independent of x ′′. ∈ ⊲ Suppose now that ′′ γ = . Push homotopically γ into a path made ∩ 6 ∅ of the union of a segment γ1 = ]0,x1] and a curve γ2, say a circular arc, joining ′′ x1 to x0 without meeting as shown on the figure. The integral splits into two parts f1(x) and f2(x). Figure 9 34 CHAPTER 2. ASYMPTOTIC EXPANSIONS The term f1(x) belongs to the previous case and is then asymptotic to 1 ϕ(t) n ′′ n+1 dt x on . 2πi γ1 t nX≥0 Z The term f2(x) defines an analytic function on the disc x < x0 and is 1 ϕ(t) n | | | | asymptotic to its Taylor series n+1 dt x . Hence, the result. n≥0 2πi γ2 t • • 4. — Given x ′ compute the variation of f at x. Recall that x ′ ∈ P R ∈ means that x belongs to the first sheet of ′. So, as explained in the proof of point 1, to evaluate f(x) we might have to push homotopically the path γ to the right into a path γ′. When x lies to the left of γ we can keep γ′ = γ. To evaluate f(xe2πi) we might have to push homotopically the path γ to the left into a path γ′′ taking γ′′ = γ when x lies to the right of γ. • The concatenation of γ′ and γ′′ generates a path Γ in enclosing x and − • since the function ϕ(t)/(t x) is meromorphic on we obtain by the Cauchy’s − Residue Theorem: 1 ϕ(t) ϕ(t) (17)var f(x)= f(x) f(xe2πi)= dt = Res ,t = x = ϕ(x) − 2πi Γ t x t x Z − − Figure 10 5. — Given ′′ ⋐ ′ suppose that the function ϕ satisfies ϕ(x) K exp A/ x k on ′′. ≤ − | | Consider the case when ′′ γ = . Then, the constant C in estimate (16) ∩ ∅ satisfies k K exp( A/ t ) ′ −N/k C −N+1| | dt C A Γ(N/k) ≤ 2π γ t ≤ Z | | with a constant C′ > 0 independent of N. The case when ′′ γ = is treated ∩ 6 ∅ similarly by deforming the path γ as in points 2–3. Hence, f(x) is s-Gevrey n ′ asymptotic to the series n≥0 anx on . P 2.5. THE CAUCHY-HEINE THEOREM 35 Comments 2.5.3 (On the Euler function (Exa. 2.2.4)) • Set = α,β ( ) with α = 3π/2 and β = π/2 and = α,β+2π( ). Let E(x) denote ∞ − − ∞ the Euler function as in Example 2.2.4 and, given θ, let dθ denote the half line issuing from 0 with direction θ. • ⊲ The variation of the Euler function E on is given by e−ξ/x e−ξ/x var E(x) = dξ dξ (ε small enough) 1+ ξ − 1+ ξ Zd−π+ε Zdπ−ε e−ξ/x = 2πi Res ,ξ = 1 (Cauchy’s Residue Thm.) − 1+ ξ − = 2πie1/x. − ⊲ Apply the Cauchy-Heine Theorem by choosing the 1-exponentially flat func- • • 1/x tion ϕ(x)= 2πie on and a point x0 , for instance x0 = r real negative. • ′ − ′ ′ ∈ − Denote = x < x0 and = x < x0 . The Cauchy-Heine Theorem ∩{| | | |} ∩ {| | | |} ′ provides a function f which, as the Euler function, belongs to 1( ) with variation ϕ(x) • A on ′. We claim that E and f differ by an analytic function near 0. Indeed, the Taylor series ′ n of f on reads n≥0 an,x0 x with coefficients x0 1/t +∞ P e n−1 n−1 −u an,x = dt =( 1) u e du 0 − tn+1 − Z0 Z1/r while the Taylor coefficients an of the Euler function E are given by a0 = 0 and for n 1 ≥ by an = limr→+∞ an,x . Since a0,x has no limit as r tends to + we consider, instead 0 0 ∞ of f, the function −r +∞ −u 1 1 1/t xe f(x) a0,x0 = e dt = du. − − 0 t x − t 1/r 1+ ux Z − Z Suppose x = x eiθ. Then, the Euler function at x can be defined by the integral | | e−ξ/x +∞ xe−u E(x)= dξ = du 1+ ξ 1+ xu Zdθ Z0 and 1/r e−u E(x) f(x)= a0,x + x du − − 0 1+ ux Z0 which is an analytic function on the disc x deduced from the Euler equation (1) by dividing it by x and then, differentiating once. Since the equation has no singular point but 0 (and infinity) the Cauchy-Lipschitz Theorem allows one to analytically continue the Euler function along any path which avoids 0 and then in particular, outside of the sector 3π/2 < arg(x) < +3π/2. However, when − crossing the lateral boundaries of this sector the Euler function E(x) stops being asymptotic to the Euler series at 0; it even stops having an asymptotic expansion since, from the variation formula above (cf. also the end of Exa. 2.2.4), one has now to take into account an exponential term which is unbounded. This phenomenon is known under the name of Stokes phenomenon. It is at the core of the meromorphic classification of linear differential equations (cf. Sect. 4.3). Exercise 2.5.4. — Study the asymptotics at 0 of the function +∞ e−ξ/x F (x)= dξ. ξ2 + 3ξ + 2 Z0 and its analytic continuation. Compute its variation. CHAPTER 3 SHEAVES AND CECHˇ COHOMOLOGY WITH AN INSIGHT INTO ASYMPTOTICS In this chapter, we recall some definitions and results used later and some examples, about sheaves and Cechˇ cohomology. For more precisions we refer to the classical literature (cf. [God58], [Ten75], [Ive86] for instance). 3.1. Presheaves and sheaves Sheaves are the adequate tool to handle objects defined by local conditions without having to make explicit how large is the domain of validity of the conditions. They are mainly used as a bridge from local to global properties. It is convenient to start with the weaker concept of presheaves which we usually denote with an overline. 3.1.1. Presheaves. — Let us start with the definition of presheaves with values in the category of sets and continue with the case of various sub- categories (for the definition of a category, see for instance [God58, Sect. 1.7]). Definition 3.1.1 (Presheaf).— A presheaf (of sets) over a topological F space X called the base space is defined by the following data: (i) to any open set U of X there is a set (U) whose elements are called F sections of on U; F (ii) to any couple of open sets V U there is a map ρ : (U) (V ) ⊆ V,U F → F called restriction map satisfying the two conditions: ⊲ ρU,U = idU for all U, ⊲ ρ ρ = ρ for all open sets W V U. W,V ◦ V,U W,U ⊆ ⊆ In the language of categories, a presheaf of sets over X is then a contravariant functor from the category of open subsets of X into the category of sets. 38 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY Unless otherwise specified, we assume that X does not reduce to one element. The names “section” and “restriction map” take their origin in Example 3.1.2 below which, with the notion of espace ´etal´e (cf. Def. 3.1.10), will become a reference example. Example 3.1.2 (A fundamental example).— Let F be a topological space and π : F X a continuous map. A presheaf is associated with F and π as follows: → F for all open set U in X one defines (U) as the set of sections of π on U, i.e., continuous F maps s : U F such that π s = idU . The restriction maps ρV,U for V U are defined → ◦ ⊆ by ρV,U (s)= s|V . Example 3.1.3 (Constant presheaf).— Given any set (or group, vector space, etc...) C, the constant presheaf X over X is defined by X (U) = C for all C C open set U in X and the maps ρV,U = idC : C C as restriction maps. → Example 3.1.4 (An exotic example).— Given any marked set with more than one element, say (X = C, 0), one defines a presheaf over X as follows: (X)= X G G and (U) = 0 when U = X; all the restriction maps are equal to the null maps except G { } 6 ρX,X which is the identity on X. Below, we consider presheaves with values in a category equipped with C an algebraic structure. We assume moreover that, in , there exist products, C the terminal objects are the singletons, the isomorphisms are the bijective morphisms. The same conditions will apply to the sheaves we consider later on. Definition 3.1.5.— A presheaf over X with values in a category is a C presheaf of sets satisfying the following two conditions: (iii) For all open set U of X the set (U) is an object of the category ; F C (iv) For any couple of open sets V U the map ρ is a morphism in . ⊆ V,U C In the next chapters, we will mostly be dealing with presheaves or sheaves of modules, in particular, of Abelian groups or vector spaces, and presheaves or sheaves of differential C-algebras, i.e., presheaves or sheaves with values in a category of modules, Abelian groups, or vector spaces and presheaves or sheaves with values in the category of differential C-algebras. 3.1. PRESHEAVES AND SHEAVES 39 Definition 3.1.6 (Morphism of presheaves).— Given and two F G presheaves over X with values in a category , a morphism f : is a C F → G collection, for all open sets U of X, of morphisms f(U): (U) (U) F −→ G in the category which are compatible with the restriction maps, i.e., such that C the diagrams f(U) (U) (U) F −−−−→ G ′ ρV,U ρV,U f(V ) (V) (V ) F y −−−−→ Gy commute (ρ and ρ′ denote the restriction maps in and respectively). V,U V,U F G Definition 3.1.7.— A morphism f of presheaves is said to be injective or surjective when all morphisms f(U) are injective or surjective. The morphisms of presheaves from into form a set, precisely, they F G form a subset of Hom (U), (U) . Composition of morphisms in the U⊆X F G category induces composition of morphisms of presheaves over X with values C Q in . It follows that presheaves over X with values in form themselves a C C category. When is Abelian, the category of presheaves over X with values in is C C also Abelian. In particular, one can talk of an exact sequence of presheaves fj fj+1 · · · → F j−1 −→ F j −−→ F j+1 →··· which means that the following sequence is exact for all open set U: f (U) f (U) (U) j (U) j+1 (U) . · · · → F j−1 −−→ F j −−−→ F j+1 →··· The category of modules over a given ring, hence also the category of Abelian groups and the category of vector spaces, are Abelian. They admit the trivial module 0 as terminal object. { } The category of rings, and in particular, the category of differential C- algebras, is not Abelian. Although the quotient of a ring by a subring A J is not a ring in general, this becomes true when is an ideal and allows one J to consider short exact sequences 0 / 0 of presheaves of → J → A → A J → rings or of differential C-algebras. 40 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY Definition 3.1.8 (Stalk).— Given a presheaf over X and x X, the F ∈ stalk of at x is the direct limit F = lim (U), x −→ F U∋x F the limit being taken on the filtrant set of the open neighborhoods of x in X ordered by inclusion. The elements of are called germs of sections of F x F at x. Let us first recall what is understood by the terms direct limit and filtrant. ⊲ The direct limit E = lim(E ,f ) −→ α β,α α∈I of a direct family (E ,f : E E for α β)(i.e., it is required that the α β,α α −→ β ≤ set of indices I be ordered and right filtrant which means that given α,β I ∈ there exists γ I greater than both α and β; moreover, the morphisms must ∈ satisfy f = id and f f = f for all α β γ) is the quotient α,α α γ,β ◦ β,α γ,α ≤ ≤ of the sum F = E of the spaces E by the equivalence relation : for α∈I α α R x E and y E , one says that ∈ α ∈ Fβ x y if there exists γ such that γ α, γ β and f (x)= f (y). R ≥ ≥ γ,α γ,β In the case of a stalk here considered, the maps fβ,α are the restriction maps ρV,U . ⊲ Filtrant means here that, given any two neighborhoods of x, there exists a neighorhood smaller than both of them. Their intersection, for example, provides such a smaller neighborhood. Thus, a germ ϕ at x is an equivalence class of sections under the equiva- lence relation: given two open sets U and V of X containing x, two sections s (U) and t (V ) are equivalent if and only if there is an open set ∈ F ∈ F W U V containing x such that ρ (s)= ρ (t). ⊆ ∩ W,U W,V By abuse and for simplicity, we allow us to say “the germ ϕ at x” when ϕ is an element of (U) with U x identifying so the element ϕ in the equivalence F ∋ class to the equivalence class itself. Given s (U) and t (V ) one should be aware of the fact that the ∈ F ∈ F equality of the germs s = t for all x U V does not imply the equality of x x ∈ ∩ the sections themselves on U V . ∩ 3.1. PRESHEAVES AND SHEAVES 41 A counter-example is given by taking the sections s 0 and t 1 whose germs are ≡ ≡ everywhere 0 in Example 3.1.4. Also, it is worth to notice that a consistent collection of germs for all x U ∈ does not imply the existence of a section s (U) inducing the given germs ∈ F at each x U. Consistent means here that any section v (V ) representing ∈ ∈ F a given germ at x induces the neighboring germs: there exists an open sub- neighborhood V ′ V U of x where the given germs are all represented by ⊆ ⊆ v. A counter-example is given by the constant presheaf X when X is disconnected. Consider, C ∗ for instance, X = R ,C = R and the collection of germs sx = 0 for x < 0 and sx = 1 for x> 0. The presheaf defined in Section 3.1.5 will provide another example. A Such inconveniences are circumvented by restricting the notion of presheaf to the stronger notion of sheaf given just below. 3.1.2. Sheaves. — Definition 3.1.9 (Sheaf).— A presheaf over X is a sheaf (we denote it F then by ) if, for all open set U of X, the following two properties hold: F 1. If two sections s and σ of (U) agree on an open covering = U F U { j}j∈J of U (i.e., if they satisfy ρUj ,U (s)= ρUj ,U (σ) for all j) then s = σ. 2. Given any consistent family of sections s (U ) on an open cov- j ∈ F j ering = U of U there exists a section s (U) gluing all the s ’s U { j}j∈J ∈ F j (i.e., such that for all j, ρUj ,U (s)= sj). Consistent means here that, for all i,j, the restrictions of si and sj agree on U U , i.e., ρ (s )= ρ (s ). i ∩ j Ui∩Uj ,Ui i Ui∩Uj ,Uj j The presheaf of Example 3.1.2 is a sheaf. In Example 3.1.4 Condition 1 fails. In the F case of the constant presheaf over a disconnected base space X (cf. Exa. 3.1.3) and in the case of the presheaf in the next section Condition 2 fails. A It follows from the axioms of sheaves that ( ) is a terminal object. F ∅ Thus, ( )= 0 when is a sheaf of modules, Abelian groups and vector F ∅ { } F spaces or of differential C-algebras. When is a sheaf of modules the restriction maps are linear and Condi- F tion 1 reduces to: a section which is zero in restriction to a covering = U U { j} is the null section. 42 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY 3.1.3. From presheaves to sheaves: espaces ´etal´es. — With any presheaf there is a sheaf canonically associated as follows. Consider the F F space F = (disjoint union of the stalks of ) and endow it with the x∈X F x F following topology: a set Ω F is open in F if, for all open set U of X and F ⊆ all section s (U), the set of all elements x U such that the germ s of s ∈ F ∈ x at x belong to Ω is open in X. Given s (U) where U is an open subset of X, consider the map ∈ F s˜ : U F defined bys ˜(x)= s . Denote by π the projection map π : −→ x F X, s π(s ) = x. The topology on F is the less fine for whichs ˜ is → x 7→ x continuous for all U and s, and the topology induced on the stalks = π−1(x) F x is the discrete topology. The setss ˜(U) are open in F and the mapss ˜ satisfy π(˜s(x)) = x for all x U. It follows that π is a local homeomorphism. ∈ Definition 3.1.10 (Espace ´etal´e, associated sheaf) ⊲ The topological space F is called the espace ´etal´e over X associated with . F ⊲ The sheaf associated with the presheaf is the sheaf of continuous F F sections of π : F X as defined in Example 3.1.2. → Example 3.1.11 (Constant sheaf).— The espace ´etal´eassociated with the constant presheaf X in Example 3.1.3 is the topological space X C endowed with the C × topology product of the given topology on X and of the discrete topology on C. Whereas the sections of X are the constant functions over X, the sections of the associated sheaf C X are all locally constant functions. The sheaf X is commonly called the constant sheaf C C over X with stalk C. Since there is no possible confusion one calls it too, the constant sheaf C over X using the same notation for the sheaf and its stalks. The maps i(U) given, for all open subsets U of X, by i(U): (U) (U), s s˜ F −→ F 7−→ define a morphism i of presheaves. These maps may be neither injective (fail- ure of condition 1 in Def. 3.1.9. See Exa. 3.1.4) nor surjective (failure of Condition 2 in Def. 3.1.9. See Exa. 3.1.11 or 3.1.22). One can check that the morphism i is injective when Condition 1 of sheaves (cf. Def. 3.1.9) is satisfied and that it is surjective when both Conditions 1 and 2 are satisfied, and so, we can state Proposition 3.1.12.— The morphism i is an isomorphism of presheaves if and only if is a sheaf. F 3.1. PRESHEAVES AND SHEAVES 43 In all cases, i induces an isomorphism between the stalks and at F x Fx any point x X. ∈ The morphism of presheaves i satisfies the following universal property: Suppose is a sheaf; then, any morphism of presheaves ψ : can G F →G be factored uniquely through the sheaf associated with , i.e., there exists F F a unique morphism ψ such that the following diagram commutes: From the fact that,when is itself a sheaf, the morphism i is an isomor- F phism of presheaves between any presheaf and its associated sheaf, one can always think of a sheaf as being the sheaf of the sections of an espace ´etal´e F π X. From that viewpoint, it makes sense to consider sections over any −→ subset W of X, open or not, and also to define any section as a collection of germs. Not any collection of germs is allowed. Indeed, if ϕ (W ) repre- ∈ F x sents the germ sx on a neighborhood Wx of x then, for the section s : W F ′ → to be continuous at x, the germs sx′ for x close to x must also be represented by ϕ. The set (W ) of the sections of a sheaf over a subset W of X is F F widely denoted by Γ(W ; ). F Recall the following definition (see end of Sect. 3.1.1 and Def. 3.1.9). Definition 3.1.13 (Consistency).— ⊲ A family of sections s (W ) is said to be consistent if, when W W j ∈ F j i ∩ j is not empty, the restrictions of s and s to W W coincide. i j i ∩ j ⊲ A family of germs is said to be consistent if any germ generates its neighbors. One can state: Proposition 3.1.14.— Given a sheaf over X and W any subset of X, F open or not, a family of germs (s ) is a section of over W if and only x x∈W F if it is consistent. Definition 3.1.15.— Let be the sheaf associated with a presheaf . We F F define a local section of to be any section of the presheaf . F F 44 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY Considering representatives of the germs s of a section s Γ(W ; ), x ∈ F Proposition 3.1.14 can be reformulated as follows. Proposition 3.1.16.— Let be the sheaf associated with a presheaf F F over X and let W be any subset of X, open or not. Sections of over W can F be seen as consistent collections of local sections s (U ) with U open in j ∈ F j j X and W U . ⊆ j j Clearly, suchS collections are not unique. When W is not open the inclusion W U is proper and the section ⊆ j j lives actually on a larger open set (the size of which depends not only on W S but both on W and the section). 3.1.4. Morphisms of sheaves. — Definition 3.1.17 (Sheaf morphism).— A morphism of sheaves is just a morphism of presheaves. With this definition, Proposition 3.1.12 has the following corollary. Corollary 3.1.18.— Let be a sheaf and ′ its associated sheaf when con- F F sidered as a presheaf. Then, and ′ are isomorphic sheaves. F F ′ Given two sheaves and ′ over X, let F π X and F ′ π X′ be their F F −→ −→ respective espace ´etal´e. From the identification of a sheaf to its espace ´etal´ea morphism f : ′ of sheaves can be seen as a continuous map, which can F → F also be denoted safely by f, between the associated espaces ´etal´es with the condition that the following diagram commute: Like presheaves, sheaves with values in a given category and their mor- C phisms form a category which is Abelian when is also Abelian. The category C of sheaves and the category of espaces ´etal´es with values in a given category are equivalent. C Definition 3.1.19.— A morphism f : ′ of sheaves over X is said to F → F be injective (resp. surjective, resp. an isomorphism) if, for any x X, the ∈ stalk map f : ′ is injective (resp. surjective, resp. bijective). x Fx → Fx 3.1. PRESHEAVES AND SHEAVES 45 When a morphism f : ′ is injective then, for all open subset U of F → F X, the map f(U) : (U) ′(U) is injective. However, the fact that f be F → F surjective does not imply the surjectivity of the maps f(U) for all U; hence, a surjective morphism of sheaves is not necessarily surjective as a morphism of presheaves, the converse being, of course, true since the functor direct limit is exact. Example 3.1.20.— Take for the sheaf of germs of holomorphic functions on F X = C∗ and for ′ the subsheaf (see Def. 3.1.21 below) of the non-vanishing functions. F The map f : ϕ exp ϕ is a morphism from to ′ which is surjective as a morphism 7→ ◦ F F of sheaves since the logarithm exists locally on C∗. However, the logarithm is not defined as a univaluate function on all of C∗ and so, the map f is not a surjective morphism of presheaves. For instance, the identical function Id : x x cannot be written in the 7→ form Id = f(ϕ) for any ϕ in (C∗) or more generally, any ϕ in (U) as soon as U is not F F simply connected in C∗. Definition 3.1.21.— A sheaf over X is a subsheaf of a sheaf over X F G if, for all open set U, it satisfies the conditions ⊲ (U) (U), F ⊆G .the inclusion map (U) ֒ (U) commute to the restriction maps ⊳ F →G .The inclusion j : ֒ is an injective morphism of sheaves F →G 3.1.5. Sheaves of asymptotic and of s-Gevrey asymptotic func- A As tions over S1.— The sheaves and of asymptotic functions we intro- A As duce in this section play a fundamental role in what follows. ⊲ Topology of the base space S1. — The base space S1 is the circle of directions from 0. One should consider it as the boundary of the real blow up of 0 in C, i.e., as the boundary S1 0 of the space of polar coordinates × { } (θ,r) S1 [0, [. ∈ × ∞ For simplicity, we denote S1 for S1 0 . × { } The map π : C defined by π(θ,r) = r eiθ sends S1 to 0 → and S1 homeomorphically to C∗. A basis of open sets of S1 is \ given by the arcs I = ]θ0,θ1[ seen as the direct limit of the domains ˇ = I ]0,R[ in as R tends to 0. Such domains are identified via π to × sectors = x = r eiθ; θ <θ<θ and 0 Figure 1 I are given by (I)= lim ( ). −→ I,R A R→0 A Suppose an element of (I) is represented by two functions ϕ ( ) A ∈ A I,R and ψ ( ) on the same sector . This means that there exists a sub- ∈ A I,R I,R sector I,R′ of I,R on which ϕ and ψ coincide. By analytic continuation, we conclude that ϕ = ψ on all of I,R. Choosing as restriction maps the usual restriction of functions, this defines a presheaf of differential C-algebras. The example below shows that such a presheaf is not a sheaf. Example 3.1.22.— Consider the lacunar series (see [Rud87, Hadamard’s Thm. 16.6 and Exa. 16.7]) 2n n/2 f1(x)= an(x 1) with an = exp( 2 ). − − nX≥0 − 2 n Since limsup an = 1 its radius of convergence as a series in powers of x 1 is n→+∞ | | − equal to 1. We know from a theorem of Hadamard that its natural domain of holomorphy is the open disc D = x C ; x 1 < 1 . The series of the derivatives of any order { ∈ | − | } (starting from order 0) converge uniformly on the closed disc D. The function f1 admits then an asymptotic expansion at 0 on any sector included in D. Figure 2 3.1. PRESHEAVES AND SHEAVES 47 π π 1 Consider now the arc I =] 2 , 2 [ of S . To any θ I there is a sector θ = Iθ ]0,Rθ[ − ∈ × π on which f1 is well defined and belongs to ( θ). However, as θ approaches the A ± 2 radius Rθ tends to 0 and there is no sector = I ]0,R[ with R> 0 on which f1 is even × defined. Thus, Condition 2 of Definition 3.1.9 fails on U = I. ⊲ The sheaf over S1. — The sheaf of asymptotic functions over S1 is A A the sheaf associated with the presheaf . A section of over an interval I is A A defined by a collection of asymptotic functions f ( ) on = I ]0,R [ j ∈ A j j j × j where I is an open covering of I and R = 0 for all j. The sheaf is a { j} j 6 A sheaf of differential C-algebras. ⊲ The subsheaf <0 of flat germs. — Given an open sector = I ]0,R[ A I,R × (cf. Notations. 2.2.2), we define <0(I)= lim <0( ). −→ I,R A R→0 A The set <0(I) is a subset of (I). Considering the restriction maps ρ of A A J,I the presheaf (I) restricted to <0(I) we obtain a presheaf I <0(I) over A A 7→ A S1. The associated sheaf is denoted by <0 and is a subsheaf of over S1. A A ⊲ The Taylor map. — The Taylor map T : ( ) C[[x]] induces I,R A I,R → a map T : C[[x]] A → also called Taylor map which is a morphism of sheaves of C-differential algebras with kernel <0. Thus, <0 is a subsheaf of ideals of . A A A ⊲ The sheaf over S1. — Similarly, one defines a presheaf over S1 As As by setting (I)= lim ( ) s −→ s I,R A R→0 A for the set of (equivalence classes of) s-Gevrey asymptotic functions on a sector based on I. Its associated sheaf is denoted by . As ⊲ The sheaf ≤−k over S1. — One also defines a presheaf by setting A ≤−k(I)= lim ≤−k( ) −→ I,R A R→0 A and ≤−k denotes the associated sheaf over S1. According to Proposi- A tion 2.3.17, the presheaf ≤−k is a sub-presheaf of , and then, ≤−k is a A As A subsheaf of , precisely, the subsheaf of s-Gevrey flat germs. As The Taylor map T : C[[x]] induces a Taylor map A → T = T : C[[x]] s As −→ s 48 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY which is a morphism of sheaves of C-differential algebras with kernel ≤−k. A Thus, ≤−k is a subsheaf of ideals of . A As 3.1.6. Quotient sheaves and exact sequences. — From now on, unless otherwise specified, we suppose that all the sheaves or presheaves we consider are sheaves or presheaves of Abelian groups (or, more generally, sheaves or presheaves with values in an Abelian category ). Recall that such sheaves or C presheaves and their morphisms form themselves an Abelian category which will allow us to talk of exact sequences of sheaves. Given a sheaf with values in and a subsheaf one defines a presheaf G C F by setting U (U)/ (U) for all open set U of the base space X, the 7→ G F restriction maps being induced by those of . G Condition 1 of sheaves is always satisfied (for a proof see [Mal95, An- nexe 1] for instance) while Condition 2 fails in general (cf. Exa. 3.1.24). Definition 3.1.23.— One defines the quotient sheaf = / to be the H G F sheaf over X associated with the presheaf U (U)/ (U) for all open set U of X 7−→ G F with restriction maps induced by those of . G If and are sheaves of Abelian groups or of vector spaces so is the F G quotient . If is a sheaf of algebras and a subsheaf of ideals, then is a H G F H sheaf of algebras. As noticed at the end of Section 3.1.3, the fact that the quotient presheaf satisfies Condition 1 of sheaves (Def. 3.1.9) means that the natural map (U)/ (U) (U) G F →H is injective. If Condition 2 were also satisfied then this natural map would be surjective. However, this is not true, in general, as shown by the Exam- ple 3.1.24 below. Example 3.1.24.— (Quotient sheaf and Euler equation) We saw in Example 2.2.4 that the Euler equation dy x2 + y = x (1) dx − +∞ e ξ/x admits an actual solution E(x)= 0 1+ξ dξ which is asymptotic to the Euler se- ries E(x)= ( 1)nn!xn+1 on the sector 3π < arg(x) < + 3π . n≥0 − R − 2 2 e P 3.1. PRESHEAVES AND SHEAVES 49 Consider the homogeneous version of the Euler equation 2 3 d y 2 dy 0 y x +(x + x) y =0. E ≡ dx2 dx − Recall that one obtains the equation 0y = 0 by dividing equation(1) by x and differen- E tiating. In any direction, 0 y = 0 admits a two dimensional C-vector space of solutions E spanned by e1/x and E(x). 1 Following P. Deligne we denote by the sheaf over S of the germs of solutions of ( 0) V E having an asymptotic expansion at 0 and we denote by θ the stalk of in a direction θ. V V The sheaf is a sheaf of vector spaces and a subsheaf of seen as a sheaf of vector spaces. V A Since E(x) has an asymptotic expansion in all directions 3π/2 <θ< 3π/2 and e1/x has − an asymptotic expansion (equal to 0) on (x) < 0 we can assert that ℜ 2 if +π/2 <θ< 3π/2, dimC θ = V ( 1 if π/2 θ +π/2 − ≤ ≤ · Denote by <0 = <0 the subsheaf of flat germs of . We observe V V ∩A V that (S1)= 0 and <0(S1)= 0 , hence the quotient (S1)/ <0(S1)= 0 . V { } V { } V V { } A global section of the quotient sheaf / <0 is a collection of solutions over an V V open covering of S1 which agree on the intersections up to flat solutions. The solution E induces such a global section while e1/x does not. Thus, the space of global sections 1 <0 1 <0 Γ(S ; / ) has dimension dimC Γ(S ; / ) = 1. This shows that the quotient sheaf V V V V / <0 is different from the quotient presheaf. The quotient sheaf / <0 is isomorphic to V V V V the constant sheaf C as a sheaf of C-vector spaces. Let f : be a morphism of sheaves with values in over the same F →G C base space X. Let ρ and ρ′ denote the restriction maps in and V,U V,U F G respectively. One can define the presheaves Ker (f),Im (f) and Coker (f) over X with values in by setting C ⊲ for Ker (f) : U ker f(U) : (U) (U) for all open set U X 7−→ F → G ⊆ with restriction maps r = ρ ; V,U V,U |ker(f(U)) ⊲ for Im (f) : U f (U) with restriction maps r′ = ρ′ ; 7−→ F V,U V,U |f(F(U)) ⊲ for Coker (f): U (U)/f (U) with restriction maps canonically 7−→ G F induced from ρ′ on the quotient. V,U So defined, Ker (f) and Im (f) appear as sub-presheaves of and respec- F G tively, Coker (f) as a quotient of . For a definition by a universal property G we refer to the classical literature. One can check that the presheaf Ker (f) is actually a sheaf (precisely, a subsheaf of ). Hence, the definition: F Definition 3.1.25.— The sheaves kernel, image and cokernel of a mor- phism of sheaves f can be defined as follows. 50 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY ⊲ The kernel er(f) of the sheaf morphism f, is the sheaf defined by K U ker f(U) for all open set U X 7−→ ⊆ with the restriction maps ρ . V,U |ker(f(U)) ⊲ The image m(f) and the cokernel oker(f ) of the sheaf morphism f, are I C the sheaves respectively associated with the presheaves Im (f) and Coker (f). The sheaves oker(f ) and m(f) are respectively a quotient and a kernel: C I oker(f )= / m(f ), m(f )= er oker(f ) C G I I K G→C where oker(f ) stands for the canonical quotient map. G→C Definition 3.1.26.— Exactness of sequences of presheaves and of sheaves are defined by the following non-equivalent conditions: f g ⊲ A sequence of presheaves is said to be exact when F −→ G −→ H Im (f (U)) = Ker (g(U)) for all open set U X. f g ⊆ ⊲ A sequence of sheaves is said to be exact when F −→ G −→ H Im(f ) = Ker(g ) for all x X. x x ∈ fn fn+1 ⊲ A sequence n−1 n n+1 of presheaves or ··· → F −→ F −−→f F →f ··· sheaves is exact when each subsequence n n+1 is exact. Fn−1 −→ Fn −−→ Fn+1 A sequence of sheaves can be seen as a sequence of presheaves. One can show that exactness as a sequence of presheaves implies exactness as a sequence of sheaves the converse being false in general. Precisely, to a short (hence f g to any) exact sequence of presheaves 0 0 there corresponds → F → G f→ Hg → canonically the exact sequence of sheaves 0 0. Reciprocally, f g → F →G → H → an exact sequence 0 0 of sheaves can be seen as a sequence → F →G → H → f g of presheaves but, in general, only the truncated sequence 0 → F → G → H is exact as a sequence of presheaves. Let PreshX and ShX denote respectively the categories of presheaves and sheaves over X with values in a given Abelian category . In the language of C categories the properties above are formulated as follows. ⊲ The functor of sheafification Presh Sh is exact. X → X .The functor of inclusion Sh ֒ Presh is only left exact ⊳ X → X 3.1. PRESHEAVES AND SHEAVES 51 3.1.7. The Borel-Ritt Theorem revisited. — By construction, <0(I) A and ≤−k(I) are the kernels of the Taylor maps A T : (I) C[[x]] and T : (I) C[[x]] I A −→ s,I As −→ s respectively for any open arc I of S1. Hence, the sequences 0 <0 T C[[x]] and 0 ≤−k Ts C[[x]] → A −→ A −−→ → A −→ As −−→ s are exact sequences of presheaves and they generate the exact sequences of sheaves of differerential algebras 0 <0 T C[[x]] and 0 ≤−k Ts C[[x]] . →A −→ A −−→ →A −→ As −−→ s The Borel-Ritt Theorem 2.4.1 allows one to complete these sequences into short exact sequences as follows. Corollary 3.1.27 (Borel-Ritt).— The sequences (18) 0 <0 T C[[x]] 0, →A −→ A −−→ → (19) 0 ≤−k Ts C[[x]] 0 →A −→ As −−→ s → are exact sequences of sheaves of differential C-algebras over S1. Equivalently, the quotient sheaves / <0 and / ≤−k are isomorphic via the Taylor map A A As A to the constant sheaves C[[x]] and C[[x]]s respectively, as sheaves of differential C-algebras. With this approach, the surjectivity of T or Ts means that, given any series and any direction there exist a sector containing the direction and a function asymptotic on it to the given series. We cannot not claim that the sector can be chosen to be arbitrarily wide. Observe that (18) and (19) are not exact sequences of presheaves over S1. Indeed, the range of the Taylor map T : (S1) C[[x]], as well as the range A → of T : (S1) C[[x]] , is made of convergent series and, consequently, these s As → s maps are not surjective. 3.1.8. Change of base space: direct image, restriction and exten- sion by 0. — The following definition makes sense since for f continuous and U open in Y the set f −1(U) is open in X. Definition 3.1.28 (Direct image).— Let f : X Y be a continuous → map. With any sheaf over X one can associate a sheaf f over Y called F ∗F its direct image by setting f (U)= f −1(U) for all open set U in Y, ∗F F 52 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY with restriction maps ρ (s )= ρ −1 −1 (s) for all open sets V U in Y. ∗ V,U ∗ f (V ),f (U) ⊆ When is a sheaf of Abelian groups, vector spaces, etc. . . , so is its direct F image f . ∗F To a morphism ϕ : of sheaves over X there corresponds a morphism F →G of sheaves ϕ : f f over Y defined by ∗ ∗F → ∗G s f (U)= f −1(U) ϕ(s ) f −1(U) = f (U). ∗ ∈ ∗F F 7−→ ∗ ∈G ∗G The functor direct image is left exact. Thus, to an exact sequence 0 ′ u ′ v ′′ → F −→ F −→ F there corresponds the exact sequence u v 0 f ′′ ∗ f ′ ∗ f ′′. → ∗F −→ ∗F −→ ∗F We suppose now that X is a subspace of Y with inclusion j : X ֒ Y and → that we are given a sheaf over Y . The restriction of into a sheaf over X is G G fully natural in terms of espaces ´etal´es. We denote by π : G Y the espace → ´etal´eassociated with . G Definition 3.1.29 (Restriction).— The sheaf restricted to X is the sheaf with espace ´etal´e G G|X −1 π| : π (X) X. π−1(X) → The definition makes sense since as π : G Y is a local homeomorphism −1 → so is π| : π (X) X. The restricted sheaf can also be seen as the π−1(X) → inverse image of by the inclusion map j, a viewpoint which we won’t develop G here. As in the previous section we consider now sheaves of Abelian groups and j we denote by 0 the neutral element. With X ֒ Y let and ′ be sheaves −→ F F over X and Y respectively. Definition 3.1.30 (Extension).— ⊲ A sheaf ′ is an extension of a sheaf if its restriction ′ to X is F F F|X isomorphic to . F 3.1. PRESHEAVES AND SHEAVES 53 ⊲ An extension ′ of is an extension by 0 if, for all y Y X, the ′ F F ′ ∈ \ stalk y is 0. (Equivalently, is the constant sheaf 0.) F F|Y \X Definition 3.1.31 (Support of a section).— The support of a section s Γ(U; ) is the subset of U where s does not ∈ F vanish: supp(s)= x U ; s = 0 . ∈ x 6 Example 3.1.32.— Let be the sheaf of C-vector spaces generated over S1 by the E function e1/x. The sheaf is isomorphic to the constant sheaf with stalk C over S1. Let E e(x) be the class of e1/x in the quotient sheaf / <0 where <0 = <0. Thus, e(x)=0 E E E E∩A for (x) < 0 and the support of e is the arc π/2 arg(x) π/2, a closed subset of S1. ℜ − ≤ ≤ The support supp(s) is always a closed subset of U, for, if a germ sx is 0 then, there is an open neighborhood Vx of x on which sx is represented by the 0 function generating thus the germs 0 on a neighborhood of x. Recall that a subset X of Y is said to be locally closed in Y if any point x X admits in Y a neighborhood V (x) such that its intersection V (x) X ∈ Y Y ∩ is closed in VY (x). This is equivalent to saying that there exist X1 open in Y and X closed in Y such that X = X X . 2 1 ∩ 2 Definition 3.1.33 (Sheaf j!F).— Suppose X is locally closed in Y and denote by j : X ֒ Y the inclusion map → of X in Y . Given a sheaf of Abelian groups over X one defines the sheaf j F !F over Y by setting, for all open U of Y , j (U)= s Γ(X U; ); supp(s) is closed in U !F ∈ ∩ F with restriction maps induced by those of j (of which j is a subsheaf). ∗F !F One can check that j is a sheaf; it is then clearly a subsheaf of j and !F ∗F there is a canonical inclusion j ֒ j . Moreover, j is an extension of !F → ∗F !F by 0. When X is closed in Y then the two sheaves coincide: j = j . F !F ∗F Unlike the functor j∗ which is only left exact, the functor j! is exact. The extension of sheaves by 0 provides a characterization of locally closed subspaces as follows: X is locally closed in Y if and only if, for any sheaf F over X, there is a unique extension of to Y by 0 (cf. [Ten75] Thm. 3.8.6). F Example 3.1.34 (j = j ).— As an illustration consider the sheaf ′ generated as ∗ ! E a sheaf of C-vector spaces6 by e1/x over the punctured disc D∗ = x C ;0 < x < 1 { ∈ | | } .and consider the inclusion j : D∗ ֒ C → 54 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY ′ ′ The direct image j∗ of by j is a non-constant sheaf of C-vector spaces. Indeed, E E ′ n for U a connected open set in C, one has j∗ (U) C where n is the number of connected E ≃ components of U D∗. ∩ Figure 3 ′ The stalks of j∗ are given by E ∗ ′ C if x D , j∗ x ∈ E ≃ ( 0 otherwise, ′ ′ ∗ so that, in some way, the direct image j∗ spreads out, onto the closure of D . Thus, ′ E′ E the direct image j∗ is an extension of but not an extension by 0. E ′ E ′ ∗ On the contrary, the sheaf j! is an extension of by 0. It is well defined since D E E ′ ′ being open in C is also locally closed in C. This shows that j∗ = j! and therefore, that E 6 E the functors j∗ and j! are different. 3.2. Cechˇ cohomology Let be a sheaf over a topological space X. We assume that is a F F sheaf of Abelian groups. The set Γ(U; ) of sections of over a U X is F F ⊂ then naturally endowed with a structure of Abelian group and ( ) = 0 , F ∅ { } the trivial Abelian group 0. Unless otherwise specified, all the coverings we consider are coverings by open sets. 3.2.1. Cechˇ cohomology of a covering .— Let = U be an U U { i}i∈I open covering of X. Denote U = U U , U = U U U , and so on. . . i,j i ∩ j i,j,k i ∩ j ∩ k Definition 3.2.1.— One defines the Cechˇ complex of associated with the F covering to be the differential complex U d0 d1 0 Γ(Ui ; ) Γ(Ui ,i ; ) → i0 0 F −→ i0,i1 0 1 F −→ d d d Q n−1 Γ(UQ ; ) n Γ(U ; ) n+1 ··· −−→ i0,...,in F −→ i0,...,in+1 F −−−→ · · · where, for all n, the mapQdn is defined by Q d : f =(f ) g =(g ) n i0,...,in 7−→ i0,...,in+1 3.2. CECHˇ COHOMOLOGY 55 where n+1 ℓ gi0,...,in+1 = ( 1) f − i0,...,iℓ−1,ıℓ,iℓ+1,...,in+1 b Ui ,...,i Xℓ=0 0 n+1 the hat over i indicating that the index i is omitted. ℓ ℓ Each term of the complex is an Abelian group. The maps dn are morphisms of Abelian groups. Consequently, the image im dn and the kernel ker dn are Abelian groups. For all n, the maps dn are “differentials” which, in this context, means that d d = 0 and thus, n ◦ n−1 im d ker d and the quotients ker d /im d are Abelian groups. n−1 ⊂ n n n−1 Definition 3.2.2.— One calls ⊲ n-cochains of (with values) in the elements of the Abelian group U F n( ; )= Γ(U ; ), C U F i0,...,in F ⊲ n-cocycles of (with values)Y in the elements of the Abelian group U F n( ; ) = ker d , Z U F n ⊲ n-coboundaries of (with values) in the elements of the Abelian U F group n( ; )=im d , B U F n−1 ⊲ n-th Cechˇ cohomology group of (with values) in the Abelian group U F Hn( ; )= n( ; )/ n( ; ) = ker d /im d . U F Z U F B U F n n−1 In particular, H0( ; ) Γ(X; ) the set of global sections of over X. U F ≃ F F Definition 3.2.3 (Refinement of a covering).— A covering = V V is said to be finer than the covering = U , and we de- { j}j∈J U { i}i∈I note , if any element in is contained in at least one element of . VU V U Equivalently, one can say that there exists a map σ : J I such that V U for all j J. −→ j ⊂ σ(j) ∈ Such a map is called inclusion map or simplicial map. With the simplicial map σ are naturally associated the maps σ∗ : n( ; ) n( ; ), f =(f ) σ∗f =(F ) n C U F −→ C V F i0,...,in 7−→ n j0,...,jn given by Fj ,...,j = f V . 0 n σ(j0),...,σ(jn)| j0,...,jn 56 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY ∗ ∗ ˇ The family σ =(σn) defines a morphism of Cech complexes and induces, for all n, a morphism of groups Sn( , ): Hn( ; ) Hn( ; ). V U U F −→ V F It turns out that these latter homomorphims are independent of the choice of the simplicial map σ. The case when n = 1 has the following specificity: Proposition 3.2.4.— When n = 1, the morphism S1( , ) : H1( ; ) H1( ; ) is injective. V U U F −→ V F We refer to [Ten75, Thm. 4.15, p. 148] . 3.2.2. Cechˇ cohomology of the space X.— The preceding section suggests to take the direct limit (cf. Def. p. 40) of the groups Hn( ; ) U F using the maps S( , ) as the coverings become finer and finer. Indeed, the V U coverings of X endowed with fineness form an ordered, right filtrant(1) “set” and the maps Sn( , ) satisfy, for all n, the conditions: V U ⊲ Sn( , ) = Id for all , U U U ⊲ Sn( , ) Sn( , )= Sn( , ) for all W V ◦ V U W U WVU providing thus a direct system (Hn( ; ), Sn( , )) of Abelian groups. U F V U The only problem is that coverings of a topological space do not form a set. That difficulty can be circumvented by limiting the considered coverings to those that are indexed by a given convenient set, i.e., a set of indices large enough to allow arbitrarily fine coverings. In the cases we consider any count- able set is convenient, say, N or Z. Actually, for X = S1, we may consider coverings with a finite number of open sets since there exists finite coverings of S1 that are arbitrarily fine. From now on, we assume that the coverings are indexed by subsets J of N. Another trick due to R. Godement consists in considering only the cover- ings U indexed by the points x X with the condition x U (cf. [God58, { x} ∈ ∈ x Sect. 5.8, p. 223]). Hence, the following definition: Definition 3.2.5.— The n-th Cechˇ cohomology group of the space X (with values) in is the direct limit of the cohomology groups Hn( ; ), the limit F U F (1) “Right filtrant” means here that to each finite family U1,..., Up of open coverings of X there is a covering V finer than all of them. 3.2. CECHˇ COHOMOLOGY 57 being taken over coverings ordered with fineness. One denotes Hn(X; ) = lim Hn( ; ). −→ F U U F When X is a manifold and n> dim X there exists arbitrarily fine coverings without intersections n +1 by n + 1 and then, Hn(X; ) = 0. The canonical F isomorphism H0(X; ) Γ(X; ) is valid without restriction. F ≃ F The following two results are useful. Theorem 3.2.6 (Leray’s Theorem).— Given an acyclic covering of X U which is either closed and locally finite or open then, Hn( ; )= Hn(X; ) for all n. U F F Acyclic means that Hn(U ; ) = 0 for all U and all n 1. i F i ∈U ≥ We refer to [God58, Thm. 5.2.4, Cor. p. 209], (case closed and locally U finite) and to [God58, Thm. 5.4.1, Cor. p. 213] (case open). U Theorem 3.2.7.— To any short exact sequence of sheaves of Abelian groups over X 0 0 → G −→ F −→ H → there is a long exact sequence of cohomology 0 H0(X; ) H0(X; ) H0(X; ) → G −→ F −→ H δ 0 H1(X; ) H1(X; ) H1(X; ) −→ G −→ F −→ H δ 1 H2(X; ) H2(X; ) H2(X; ) −→ G −→ F −→ H δ2 −→··· The maps δ0,δ1,... are called coboundary maps. For their general defini- tion, see the references above. 3.2.3. The Borel-Ritt Theorem and cohomology. — We know from Corollary 3.1.27 that the sheaves / <0 and / ≤−k are constant sheaves A A As A with stalks C[[x]] and C[[x]]s respectively. Their global sections Γ(S1; / <0) H0(S1; / <0) and Γ(S1; / ≤−k) H0(S1; / ≤−k) A A ≡ A A As A ≡ As A are then also respectively isomorphic to C[[x]] and C[[x]]s and we can state the following corollary of the Borel-Ritt Theorem. 58 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY Corollary 3.2.8 (Borel-Ritt).— The Taylor map induces the following isomorphisms: H0(S1; / <0) C[[x]], H0(S1; / ≤−k) C[[x]] . A A ≃ As A ≃ s We can synthesize: (equivalence class of a) formal series 1 0-cochain (fj)j∈J over S f(x)= a xn C[[x]] with values in and n ∈ ⇐⇒ A n≥0 coboundary (fj fℓ)j,ℓ∈J X −<0 e with values in A The components fj(x) of the 0-cochains are all asymptotic to f(x). (equivalence class of a) e s-Gevrey series 1 0-cochain (fj)j∈J over S f(x)= a xn C[[x]] with values in s and n ∈ s ⇐⇒ A n≥0 coboundary (fj fℓ)j,ℓ∈J X −≤−k e with values in A The components fj(x) of the 0-cochains are all s-Gevrey asymptotic to f(x). Due to Proposition 2.3.17 it would actually be sufficient to ask for the coboundary to be with values in <0. This latter equivalence will be improved A ine Corollary 6.2.2. 3.2.4. The case when X = S1 and the Cauchy-Heine Theorem. — Since, in what follows, we will mostly be dealing with sheaves over S1, it is worth developing this case further. With X = S1 things are often made simpler by the fact that S1 is a manifold of dimension 1. On another hand, 1 one has to take into account the fact that S has a non-trivial π1. Definition 3.2.9 (Good covering).— An open covering = (I ) of I j j∈J S1 is said to be a good covering if ⊲ it is finite with J = p elements, | | 1 ⊲ its elements Ij are connected (i.e., open arcs of S ), ⊲ it has thickness 2 (i.e., no 3-by-3 intersections), ≤ 3.2. CECHˇ COHOMOLOGY 59 1 ⊲ when p = 2 its two open arcs I1 and I2 are proper arcs of S so • that I1 I2 is made of two disjoint open arcs which we denote by I1 and • ∩ I2; when p 3 its open arcs Ij can be indexed by the cyclic group Z/pZ so • ≥ that I := I I = and I I = as soon as ℓ j > 1 modulo p. j j ∩ j+1 6 ∅ j ∩ ℓ ∅ | − | The definition implies that open arcs of a good covering are not nested. • The family of the arcs I is sometimes called the nerve of the covering . j I The case p = 1, i.e., the case of coverings of S1 by just one arc, is worth to consider. These unique arcs cannot be proper arcs of S1: one has to introduce overlapping arcs i.e., arcs of the universal cover of S1 of length > 2π. Such coverings are widely used to make proofs simpler by using the additivity of 1-cocycles. A typical example is given by the Cauchy-Heine Theorem (Thm. 2.5.2 and Cor. 3.2.14 below). Definition 3.2.10 (Elementary good covering).— An open covering = I with only one overlapping open arc I = ]α,β + 2π[ and nerve I• { } I =]α,β[( S1 is called an elementary good covering. Example 3.2.11 (The Euler series as a 0-cochain) The Euler series f(x), which belongs to C[[x]]1, can be seen as a 0-cochain as follows. 1 Consider the covering = I1,I2 of S made of the arcs e I { } I1 =] 3π/2, +π/2[ and I2 =] π/2, +3π/2[. − − The elements of intersect over the two arcs •I • 1 1 I 1 = x S ; (x) < 0 and I 2 = x S ; (x) > 0 . { ∈ ℜ } { ∈ ℜ } The corresponding 0-cochain to consider is the pair (f1(x),f2(x)) made of the restrictions of the Euler function f(x) to I1 and I2 respectively. Both f1(x) and f2(x) are sections of • • 1. The coboundary (f 1, f 2) is given by A • • • • 1/x f (x)= f1(x) f2(x)=2πie on I 1 and f (x)= f2(x) f1(x)=0 on I 2 1 − 2 − and has values in ≤−1. A Figure 4 60 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY • Since the component f is trivial one could also consider a branch covering made of 2 • the unique arc I =] 3π/2, +3π/2[ overlapping on I = x S1 ; (x) < 0 . − { ∈ ℜ } Figure 5 The (branched) 0-cochain f(x) is 1-Gevrey asymptotic to f(x) on I and its cobound- • ary f +(x) f −(x)=2πi exp(1/x) is a section of ≤−1 over I . − A e Given a good covering = I of S1, a 1-cochain is a family I { j} f Γ(I I ; ) for j and ℓ Z/pZ. j,ℓ ∈ j ∩ ℓ F ∈ • • • The 1-cocycle conditions f +f = f on I I I for all j,k,ℓ are empty j,k k,ℓ j,ℓ j ∩ k ∩ ℓ since so are the 3-by-3 intersections; consequently, any 1-cochain is a 1-cocycle. Taking into account the necessary conditions fj,j = 0 and fk,j = fj,k on 1- • −• cocycles, a 1-cocycle can thus be seen as any collection (f Γ(I ; )) for j ∈ j F j Z/pZ. ∈ • By linearity, a 1-cocycle (f j)j∈Z/pZ can be decomposed into a sum • • j∈Z/pZ ϕj where ϕj is the 1-cocycle over the covering having all trivial I • th Pcomponents (equal to 0, the neutral element) but the j equal to f j. Fix • j and consider the elementary good covering j whose nerve is Ij and the • • I 1-cocycle f j Γ(Ij, ). The covering is finer than j. We identify the • ∈ • F I • I 1-cocycles ϕj and f j and we say that the 1-cocycle ϕj can be lifted into the • elementary 1-cocycle f j. Proposition 3.2.12.— There exist arbitrarily fine good coverings of S1 Consequently, when is a sheaf over S1, to determine H1(S1; ) it suffices F F to consider good coverings. Example 3.2.13.— (Euler equation and cohomology) We consider the elementary good covering = I of S1 defined by the overlapping interval I = ] I { }• − 3π/2, +3π/2[ with self-intersection I = ] 3π/2, π/2[ and we consider the sheaf of − − V asymptotic solutions of the Euler equation (cf. Exa. 3.1.24). A 1-cocycle of in is • • I V a section ϕ (x)= af(x)+ be−1/x over I with arbitrary constants a and b in C. There is no 1-cocycle condition. The 0-cochains are of the form cf(x) over I, with c C an ∈ arbitrary constant and they generate the 1-coboundaries c f(xe2πi) f(x) =2πice−1/x. − 3.2. CECHˇ COHOMOLOGY 61 • The cohomological class of ϕ is then uniquely represented by af(x) for 3π/2 < arg(x) < − π/2. Hence, H1( ; ) is a vector space of dimension one, isomorphic to C. − I V Given a covering of S1 finer than we have seen (cf. Prop. 3.2.4) that the J 1 1 I map SJ ,I : H ( ; ) H ( ; ) is injective. Let us check that it is surjective on the I V → J V example of = J1,J2 for J1 =] π/4, 5π/4[ and J2 =] 5π/4,π/4[. • J { } • − − We set J 1= ]3π/4, 5π/4[ and J 2=] π/4,π/4[. • • − • • A 1-cocycle (ϕ1, ϕ2) over the covering is cohomologous to (ϕ1 + ϕ2, 0) via the • J • • • 0-cochain (0, ϕ2) where we keep denoting by ϕ2 the continuation of ϕ2 to J 2. How- • • • • • ever, ϕ=ϕ1 + ϕ2 can be continued to I (we keep denoting by ϕ the continuation) and • • • therefore, the 1-cocycle (ϕ1 + ϕ2, 0) lifts up into the 1-cocycle ϕ of the covering . I Figure 6 The proof extends to any good covering finer than by induction on the number J I of connected 2-by-2 intersections. We can conclude that H1( ; )= H1(S1; ). I V V The same result can be seen as a consequence of the theorem of Leray (Thm. 3.2.6) after showing that is acyclic for . I V In the case when X = S1 the long exact sequence of cohomology of Theo- rem 3.2.7 reduces to 0 H0(S1; ) H0(S1; ) H0(S1; ) → G −→ F −→ H δ 0 H1(S1; ) H1(S1; ) H1(S1; ) 0. −→ G −→ F −→ H → The coboundary map δ is defined as follows: The sheaf is the quotient 0 H of by . A 0-cocycle in H0(S1; ) is a collection of f Γ(I ; ) such F G H i ∈ i F that f f belong to Γ(I ; ) for all i,j. There corresponds the 1-cocycle i − j i,j G (g = f f ) of with values in . To different representatives f ′ of i,j i − j i,j I G i the 0-cocycle there correspond a cohomologous 1-cocycle (g′ = f f ) of i,j i − j i,j with values in ; hence, an element of H1 I ; and consequently, an I G { i} G element of H1(S1; ). G The Cauchy-Heine Theorem (Thm. 2.5.2) can be reformulated as a coho- mological condition as follows. Corollary 3.2.14 (Cauchy-Heine).— 62 CHAPTER 3. SHEAVES AND CECHˇ COHOMOLOGY (i) The natural map H1(S1, <0) H1(S1, ) is the null map. A → A (ii) The natural map H1(S1, ≤−k) H1(S1, ) is the null map. A → As Proof. — (i) It suffices to prove the assertion for any good covering. Given a covering of S1 there is a natural map from H1( ; <0) into H1( ; ) I I A I A (cohomologous 1-cocycles of H1( ; <0) are also cohomologous in H1( ; )). I A I A By linearity, it suffices to consider the case of an elementary good covering • = I with self-intersection I (cf. Def. 3.2.10). The Cauchy-Heine Theorem I { } as stated in Thm. 2.5.2 says that a 1-cocycle of H1( ; <0) is a coboundary I A in H1( ; ), that is, it is cohomologous to the trivial 1-cocycle 0 in H1( ; ). I A I A (ii) Same proof by replacing <0 by ≤−k and by . A A A As Although the maps are zero maps, far from being null spaces, H1(S1, ) A and H1(S1, ) are huge spaces. As CHAPTER 4 LINEAR ORDINARY DIFFERENTIAL EQUATIONS: BASIC FACTS AND INFINITESIMAL NEIGHBORHOODS OF IRREGULAR SINGULARITIES In this chapter, we first gather some basic facts on linear ordinary dif- ferential equations. Our aim is not to be exhaustive (in particular, we omit most of the proofs) but to provide the useful material to better understand series solutions of differential equations and examples. We end the chapter with the construction of infinitesimal neighborhoods for the singularities of solutions of linear differential equations at an irregular singular point in the spirit of the infinitesimal neighborhoods of algebraic geometry. The adequacy of such neighborhoods to characterize the summability properties of the for- mal solutions of a given differential equation is presented in Chapters 6 and 8 (Defs. 6.4.1 and 8.7.1). Consider a linear differential operator of order n dn dn−1 (20) D = b (x) + b (x) + + b (x) where b (x) 0 n dxn n−1 dxn−1 ··· 0 n 6≡ with analytic coefficients at x = 0. Unless otherwise specified, we assume that the coefficients bn,bn−1,...,b0 do not vanish simultaneously at x = 0. When the coefficients bn,bn−1,...,b0 are polynomials in x their maximal degree is called the degree of D. 4.1. Equation versus system With the differential equation Dy = 0, setting y y′ Y = . , . y(n−1) 64 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS is associated its companion system ∆Y = 0 defined by the n-dimensional order one differential operator 0 1 0 ··· ...... d . . . . ∆= B(x) where B(x)= . dx − . 01 · b0 bn−1 − bn ··· ··· − bn Reciprocally, the question is to determine if and how one can put a given system in companion form. Definition 4.1.1 (Gauge transformation).— Given a system of dimen- sion n with meromorphic coefficients ∆Y dY B(x)Y = 0 a gauge transfor- ≡ dx − mation is a linear change of the unknown variables Z = TY with T invertible in a sense to be made precise. In the case when T belongs to GL(n, C x [1/x]) { } the gauge transformation T is said to be meromorphic; in the case when T be- longs to GL(n, C[[x]][1/x]) it is said to be formal (meromorphic). A gauge transformation Z = TY changes the system ∆Y = 0 into the differential system T∆Z = 0 with d dT T∆= T ∆T −1 = T −1 TBT −1. dx − dx − When T is meromorphic (resp. formal), so is T∆; however, T∆ may be mero- morphic for some formal T . We can now answer the question. Proposition 4.1.2 ((Deligne’s) Cyclic vector lemma) To any system ∆Y = 0 with meromorphic coefficients there is a meromor- phic gauge transformation Z = TY such that the transformed system T∆ = 0 is in companion form. The formulation in terms of cyclic vectors (cf. Rem. 4.2.6) is due to P. Deligne [Del70, Lem II.1.3] although more algorithmic proofs already existed [Cop36], [Jac37]. The companion form is obtained by differential elimination. Despite the fact that the program is short and simple it is not (at least, not yet) available in computer algebra systems such as Mathematica or Maple (see [BCLR03] for a sketched algorithm and references; see also [Ram84, Thm. 1.6.16]). As a consequence of the Cyclic vector lemma, theoretical properties can be proved equally on equations or systems (as long as these properties stay unchanged under meromorphic gauge transformations). To perform calcula- tions one could, in principle using the algorithm, go from equations to systems 4.2. THE VIEWPOINT OF D-MODULES 65 and reciprocally at convenience. Actually, these algorithms are usually very “expensive” and used sparingly. 4.2. The viewpoint of D-modules The notion of differential module, or equivalently, of -module generalizes D the notion of order one differential system in an abstract setting free of coordi- nates. From this viewpoint, the gauge transformations and the meromorphic or formal equivalence arise naturally. Suppose we are given a differential field (K,∂). Precisely, for our purpose, we suppose that K is either the field C x [1/x] of meromorphic series at 0 { } or the field C[[x]][1/x] of the formal ones. The derivation is ∂ = d/dx. The constant subfield C of K, i.e., the set of the elements f K satisfying ∂f = 0, ∈ is C = C and the C-vector space of the derivations of K has dimension 1 and generator ∂. 4.2.1. -modules and order one differential systems. — D Definition 4.2.1.— A differential module(1) (M, ) of rank n over K is a ∇ K-vector space M of dimension n equipped with a map : M M, ∇ −→ called connection, which satisfies the two conditions: (i) is additive; ∇ (ii) satisfies the Leibniz rule (fm) = ∂f m + f (m) for all f K ∇ ∇ · ∇ ∈ and m M. ∈ We may observe that is also C-linear. Indeed, when f C is a constant ∇ ∈ the Leibniz rule reads (fm)= f (m). ∇ ∇ The link with differential systems is as follows. Choose a K-basis e =[e e e ] of M and let 1 2 ··· n [ε ε ε ]= [e e e ]B with B gl(n,K) 1 2 ··· n − 1 2 ··· n ∈ be its image by (the minus sign is introduced to fit the usual notations for ∇ systems and has no special meaning). The connection is fully determined n ∇ by the matrix B. Indeed, let y = j=1 yjej be any element of M. In matrix notation, we write y = eY where Y = t y y is the column matrix of the P 1 ··· n (1) In French, one says “un vectoriel `aconnexion”. 66 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS components of y in the basis e. Then, applying the Leibniz rule, we see that y is uniquely determined by ∇ y = e (∂Y BY ). ∇ − Thus, with the connection and the K-basis e is naturally associated the ∇ differential operator ∆ = ∂ B of order one and dimension n. − Definition 4.2.2.— Let (M , ) and (M , ) be differential modules. 1 ∇1 2 ∇2 (i) A morphism of differential modules from (M , ) to (M , ) is a 1 ∇1 2 ∇2 K-linear map : M M which commutes to the connections and , T 1 → 2 ∇1 ∇2 i.e., such that the following diagram commutes: M T M 1 −−−−→ 2 ∇1 ∇2 T M1 M2 y −−−−→ y (ii) A morphism is an isomorphism if is bijective. T T Denote by n and n the rank of (M , ) and (M , ) respectively. 1 2 1 ∇1 2 ∇2 Choose K-basis e1 and e2 of M1 and M2 and denote by ∆1 and ∆2 the differ- ential system operators associated with of and in the basis e and e ∇1 ∇2 1 2 respectively. Denote by T the matrix of in these basis. The definition says T that is a morphism if T satisfies the relation T ∆2T = T ∆1. It says that is an isomorphism if, in addition, n = n and the matrix T is T 1 2 invertible so that the condition may be written −1 ∆1 = T ∆2T −1 −1 −1 and is also valid for T in the form ∆1T = T ∆2; hence, the commutation of the diagram with T : M M replaced by T −1 : M M . We recognize 1 → 2 2 → 1 the formula linking the operators ∆1 and ∆2 under the gauge transformation (cf. Def. refgauge). Suppose M = M =: M. An invertible K-morphism T 1 2 T is just a change of K-basis in M. Therefore, to the connection there are the ∇ infinitely many system operators T −1∆T associated with all T GL(n,K) ∈ and it is natural to set the following definition. 4.2. THE VIEWPOINT OF D-MODULES 67 Definition 4.2.3.— Two differential system operators ∆ = ∂ B 1 − 1 and ∆ = ∂ B are said to be K-equivalent if there exists a gauge transfor- 2 − 2 mation T in GL(n,K) such that −1 ∆1 = T ∆2T. When K = C x [1/x] is the field of meromorphic series the systems are said { } to be meromorphically equivalent. When K = C[[x]][1/x] is the field of for- mal meromorphic series they are said to be formally equivalent or formally meromorphically equivalent. In modern language, we should say K-similar but the old denomination K- equivalent is still in common use. The condition is clearly an equivalence relation: indeed, any system op- −1 −1 −1 erator ∆ satisfies ∆ = I ∆I; if ∆1 = T ∆2T then ∆2 = S ∆1S with −1 −1 −1 −1 S = T ; if ∆1 = T ∆2T and ∆2 = S ∆3S then ∆1 = (ST ) ∆3(ST ). With this definition, a differential module can be identified to an equivalence class of systems. Denote by = K[∂] the ring of differential operators on K, i.e., the ring D of polynomials in ∂ with coefficients in K satisfying the non-commutative rule ∂x = x∂ + 1. Let us now show how a differential module can be identified to a -module, D i.e., a module over the ring in the classical sense. For this, we go to a dual D approach as follows. Consider n as a left -module and denote by ε =[ε ε ] its canonical D D 1 ··· n -basis. Given a n-dimensional system operator ∆ = ∂ B with coefficients D − in K we make it act linearly on n to the right by setting D n P ε [P P ]∆=[P ∂ P ∂] [P P ]B. j j 7−→ 1 ··· n 1 ··· n − 1 ··· n Xj=1 The cokernel n/ n∆ has a natural structure of left -module (but no natural D D D structure of right-module over ) and has rank n (its dimension as K-vector D space). Denote by M n/ n∆ this K-vector space of dimension n. The ≡D D images in the cokernel of the n elements ε1,...,εn — which we keep denoting by ε ,...,ε — of the canonical -basis ε form a K-basis of M. On another 1 n D hand, the operator ∂ acting on M to the left defines a connection on M: indeed, it acts additively and satisfies the Liebniz rule. The question remains to determine which class of systems it represents. From the relation ∂ B = 0 − 68 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS in M we deduce that, for all j = 1,...,n, the components of ∂εj in the basis ε are given by the jth row of the matrix B. Hence, ∂[ε ε ε ]=[ε ε ε ] tB. 1 2 ··· n 1 2 ··· n And we can conclude that the system operator associated with the connection ∂ is the adjoint ∆∗ = ∂ + tB of ∆. We can state: Proposition 4.2.4.— Given a differential system operator ∆= ∂ B with − coefficients B in K the pair (M = n/ n∆,∂) defines a differential module D D of rank n over K with connection ∂ = ∗ adjoint to ∆. ∇ From now on, we may talk of the differential module n/ n∆, the connec- D D tion = ∂ being understood. With this result we can identify left -modules ∇ D and differential modules equipped with a K-basis. Observe, in particular, that a morphism or an isomorphism φ : n/ n∆ n/ n∆ D D 1 −→ D D 2 in the sense of Definition 4.2.2 is a morphism or an isomorphism of -modules D in the classical sense and reciprocally. Proposition 4.2.5.— Two system operators ∆ = ∂ B and ∆ = ∂ B 1 − 1 2 − 2 with coefficients in K are K-equivalent if and only if the -modules n/ n∆ D D D 1 and n/ n∆ are isomorphic. D D 2 Proof. — We have to prove that two differential systems ∆1Y = 0 and ∆2Y = ∗ ∗ 0 on one hand and their adjoints ∆1Y = 0 and ∆2Y = 0 on the other hand are simultaneously K-equivalent. To this end, consider fundamental solutions and of ∆ Y = 0 and ∆ Y = 0 respectively in any convenient extension Y1 Y2 1 2 of K (for instance, the formal fundamental solutions given by Thm. 4.3.1). The systems ∆1Y = 0 and ∆2Y = 0 are equivalent if and only if there exists a −1 gauge transformation T GL(n,K) such that ∆1 = T ∆2T or equivalently ∈ t −1 t −1 t −1 2 = T 1. This latter relation is equivalent to the relation 2 = T 1 . Y Y t −1 t −1 Y Y Hence the result since 1 and 2 are fundamental solutions of the adjoints ∗ Y ∗ Y equations ∆1Y = 0 and ∆2Y = 0 respectively. Remark 4.2.6. — Let us end this section with a remark on the Cyclic vector lemma (Prop. 4.1.2). In a differential module (M, ) of rank n one calls cyclic ∇ vector any vector e M such that the n vectors e, e,..., n−1e form a ∈ ∇ ∇ K-basis of M. In such a basis, the matrix of the connection reads in the ∇ 4.2. THE VIEWPOINT OF D-MODULES 69 form 0 0 an−1 ··· . . 1 . . B∇ = ...... . . . 0 1 a0 ··· Let ∆ be a system of dimension n with coefficients in K and consider the -module n/ n∆. In a cyclic basis e the system ∆ admits tB as matrix D D D − ∇ which is a companion form (cf. Sect. 4.1) but, stricto sensu, the minus signs in the sup-diagonal of 1’s. One can cancel these minus signs by taking the basis (e, ∂e,..., ( 1)n−1∂n−1e). − − 4.2.2. -modules and differential operators of order n.— The aim D of this section is to describe the K-equivalence of order n linear differential operators with coefficients in K. Consider a single linear differential operator D = ∂n + b (x)∂n−1 + + b (x), b ,...,b K. n−1 ··· 0 0 n−1 ∈ The operator D acts linearly on by multiplication to the right. Its cokernel D / D has a natural structure of left -module. The pair ( / D,∂) defines D D D D D a differential module of rank n. Again, by abuse, we talk of the differential module / D, the connection ∂ being understood. D D Proposition 4.2.7.— Let ∆ be the companion system operator of D (cf. Sect. 4.1). Then, the -modules / D and n/ n∆ are isomorphic. D D D D D Proof. — Consider the map U : n , (δ δ ) δ + δ ∂ + + δ ∂n−1 D −→ D 1 ··· n 7−→ 1 2 ··· n and the map V : n , projection over the last component, defined by D →D (δ δ ) δ . 1 ··· n 7−→ n The maps U and V are -linear; the diagram D n ·∆ n D −−−−→D V U ·D Dy −−−−→ Dy 70 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS commutes and it can be completed into the commutative diagram with exact rows 0 n ·∆ n n/ n∆ 0 −−−→D −−−−→D −−−−→D D −−−→ V U u ·D 0 / D 0. −−−→ Dy −−−−→ Dy −−−−→ D yD −−−→ The quotient map u does exist. It is left -linear and surjective since U is also D left -linear and surjective. On the other hand, the modules n/ n∆ and D D D / D have equal ranks. Therefore, u is an isomorphism of K-vector spaces D D and in particular, is injective. From Propositions 4.2.7 and 4.2.5 we may set the following definition. Definition 4.2.8 (equivalent operators).— Two linear differential oper- ators D and D of order n are said to be K-equivalent if the -modules 1 2 D / D and / D are isomorphic. D D 1 D D 2 Let us now make explicit the equivalence of order n linear differential operators in the spirit of Definition 4.2.3. Recall that = K[∂] is a non commutative ring with non-commutation D relations generated by ∂x = x∂ +1. In the ring there is an euclidian division D on the right and on the left. Consequently, any left or right ideal is principal and any two differential operators have a greatest common divisor on the left (denoted by lgcd) and on the right (rgcd) as well as a least common multiple on the left (llcm) and on the right (rlcm). These gcd and lcm are uniquely determined by adding the condition that they are monic polynomials, which we do. The counterpart for a differential operator D of a gauge transforma- ∈D tion for a system involves a transformation , with A , of the form TA ∈D (D) = llcm(D,A)A−1. TA By this, we mean that we take the lcm of D and A on the left and we divide it by A on the right (this is possible since, by definition, A can be factored on the right in any llcm involving A). In other words, (D) is the factor of TA smallest degree we must multiply A on the left to obtain a left multiple of D. Notice that such a factor is unique due to the uniqueness of llcm(D,A) as a monic polynomial. Proposition 4.2.9.— The differential operators D and D are K- 1 2 ∈ D equivalent if and only if there exists A prime to D to the right such ∈ D 2 4.3. CLASSIFICATIONS 71 that D = (D ). 1 TA 2 We may notice that, as A and D are prime, the operators D and (D ) 2 2 TA 2 have the same order. Proof. — By definition, the K-equivalence of D1 and D2 means that there is an isomorphism of -modules D ϕ : / D / D . D D 1 −→ D D 2 As a morphism of -modules the map ϕ is well defined by D ϕ(1 + D )= A + D . D 1 D 2 For any L , one has then ϕ(L + D ) = LA + D . Since ϕ(D ) = 0 ∈ D D 1 D 2 1 there exists L such that D A = L D . Conversely, any A such that 1 ∈ D 1 1 2 there is an L satisfying D A = L D determines a morphism of -modules 1 1 1 2 D from / D into / D by setting ϕ(1 + D )= A + D . D D 1 D D 2 D 1 D 2 The injectivity of ϕ means that the condition ϕ(L) = 0, i.e., LA = PD2 for a certain P , implies L = QD with Q . Hence, to any rela- ∈D 1 ∈ D tion LA = PD there is Q such that PD = QD A, that is to say, any 2 ∈ D 2 1 left common multiple of A and D2 is a left multiple of D1A. Otherwise said, D1A is the llcm of A and D2 and then, D = (D ). 1 TA 2 Let us now express the surjectivity of ϕ. This amount to the fact that there exists L such that ϕ(L + D )=1+ D , which means that there ∈D D 1 D 2 is P such that LA + PD = 1. This is a B´ezout relation for A and D on ∈D 2 2 the right which means that A and D2 are prime on the right. 4.3. Classifications We denote by K = C[[x]][1/x] the field of all meromorphic series at 0 either convergent or not and by K = C x [1/x] the subfield of the convergent { } ones. We consider lineare differential systems or equations with coefficients in K, i.e., with convergent meromorphic coefficients. The formal classification of linear differential systems or equations is the classification under K-equivalence (cf. Def 4.2.3 and Prop. 4.2.9). The mero- morphic(2) classification is the classification under K-equivalence. e (2) We use the term meromorphic in the sense of convergent meromorphic. Otherwise, we specify formal meromorphic or simply formal. 72 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS In this section, we sketch the main theoretical results on the formal and the meromorphic classes of systems or equations. In the case of equations we also sketch the practical algorithms based on Newton polygons to compute the formal invariants. 4.3.1. The case of systems. — Denote by ′ the derivation with respect ′ dY to x, writing Y instead of dx , and consider an order one linear differential system (21) ∆Y Y ′ B(x)Y = 0 ≡ − with meromorphic coefficients (i.e., B(x) gℓ(n,K)). ∈ Recall (cf. Sect. 4.1) that a gauge transformation Z = TY changes the dif- ferential system Y ′ B(x) Y = 0 into the differential system Z′ TB(x) Z = 0 − − with TB = T ′ T −1 + TBT −1. When T (x) is meromorphic we denote T G = GL(n, C x [1/x]) the ma- ∈ { } trix TB(x) is also meromorphic. But the matrix TB(x) may also be convergent for some divergent T (x). We denote by G(B) the set of formal meromorphic gauge transformations T GL(n, C[[x]][1/x]) such that TB(x) is convergent. ∈ The set G(B) contains G. While G is a group,e G(B) is not. The meromorphic class of the system is its orbit under the gauge transformations in G while its formal classe is its (larger) orbit under those ineG(B). 4.3.1.1. Formal classification. — The formal classification of n-dimensional e meromorphic linear differential systems is performed by selecting, in each class, a system of a special form called a normal form. There exist algorithms to fully calculate a normal form of any given system (cf. end of Sect. 4.3.2.3). Theorem 4.3.1 (Formal fundamental solution and normal form) 1. To any system (21) : Y ′ = B(x) Y there is a formal fundamental solution (i.e., a matrix of n linearly independent formal solutions) of the form (x)= F (x) xL eQ(1/x) Y where J e ⊲ Q(1/x)= j=1 qj(1/x) Inj (assume the qj’s are distinct) is a diagonal matrix satisfying Q(0) = 0; its diagonal entries are polynomials in 1/x or in a L 1/p fractional power 1/t = 1/x of 1/x; the notation Inj stands for the identity 4.3. CLASSIFICATIONS 73 matrix of dimension nj. The smallest possible number p is called the degree of ramification of the system, eQ(1/x) the irregular part of (x) and the q ’s Y j the determining polynomials. ⊲ L gℓ(n, C) is a constant matrix called the matrix of the exponents of ∈ formal monodromy. ⊲ F (x) GL(n, C[[x]][1/x]) is an invertible formal meromorphic matrix. ∈ e 2. The matrix (x) = xL eQ(1/x) is a (formal) fundamental solution of a Y0 system ′ Y = B0(x) Y ′ with polynomial coefficients in x and 1/x. The system Y = B0(x) Y is for- mally equivalent to the initial system Y ′ = B(x) Y via the formal gauge trans- F formation F (x) (hence, B(x)= eB0(x)) and it is called a normal form of the given system Y ′ = B(x) Y . The fundamental matrix (x) is called a normal Y0 solution. e A normal solution exhibits all formal invariants. However, the normal form and the normal solution are not unique: indeed, given P GL(n, C) any ∈ permutation matrix or any matrix commuting with Q(1/x), the matrix −1 −1 P (x) P −1 = xPLP ePQ(1/x)P Y0 ′ P is also a normal solution associated with the normal form Y = B0(x)Y since a fundamental solution of the given system Y ′ = B(x)Y reads in the form (x) P −1 =(F (x) P −1) P (x) P −1 Y Y0 and F (x) P −1 still belongs to GL(n, C[[x]][1/x]). In the unramified case e (i.e., with ramification degree p = 1), a minimal full set of formal invariants is givene by the diagonal matrix Q(1/x) of the determining polynomials up to permutation and by the invariants of similarity of L (eigenvalues and size of the corresponding irreducible Jordan blocks). In the ramified case (i.e., with ramification degree p > 1) the situation is a little more intricate : given ′ a determining polynomial in the variable t′ = x1/p (i.e., with ramification degree p′) any element in its orbit under the action of the Galois group of ′ the ramification t′p = x is also a determining polynomial and any of them equally characterizes the orbit. In other words, a minimal set of invariants is well determined by one polynomial in each orbit jointly with the invariants of similarity of L. 74 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS ′ Any normal form is meromorphically equivalent to Y = B0(x) Y . That’s why, sometimes, one generalizes the definition by calling normal form any ′ system meromorphically equivalent to Y = B0(x) Y . The theorem of formal classification was first proved in a weaker form, called Hukuhara-Turrittin Theorem, in which the given system Y ′ = B(x) Y is considered as a system in the ramified variable t = x1/p (p the degree of ramification of the system) allowing, thus, gauge transformations in a finite extension of the initial variable x (cf. [DMR07, p. 104, Thm. (4.2.1)] and also [Was76, HS99]). Stated as above it was first proved by W. Balser, W. Jurkat and D.A. Lutz [BJL79]. A simpler proof and an expression of the normal form in terms of rank reduced systems built on the minimal set of invariants can be found in [LR01]. Let us now state some definitions associated with the formal invariants. Choose a formal fundamental solution of System (21): J (22) (x)= F (x)xL eQ(1/x) with Q = q (1/x)I and distinct q ’s Y j nj j Mj=1 e and the normal form Y ′ = B (x)Y with fundamental solution (x) = 0 Y0 xL eQ(1/x). Definition 4.3.2 (Stokes arcs).— (i) Let q C[1/x] be a polynomial of degree k > 0 in the variable 1/x. We ∈ call Stokes arc associated with eq(1/x) (in short, with q) the closure of any arc of S1 of length π/k made of directions where eq(1/x) is flat. (ii) In the case of ramified polynomials q C[1/x1/p],p N∗, Stokes arcs ∈ ∈ can be defined similarly w.r.t. the variable t = x1/p on the corresponding p- sheet cover of S1. When the fractional degree of q is over 1/2 we call Stokes arcs of q their projection on S1 by the map t x = tp. Otherwise, the 7→ projections are onto S1 and one has to keep working with the variable t in the p-sheet cover . (iii) The Stokes arcs of a linear differential equation or system are the Stokes arcs associated with all its determining polynomials. Example 4.3.3.— Suppose a determining polynomial of system (21) be given by q(1/x)= 1/x2/3. − 4.3. CLASSIFICATIONS 75 Then, the polynomials jq(1/x) and j2q(1/x) (where j3 = 1) are also determining polyno- mials of system (21). A fundamental solution of the system in the variable t = x1/3 con- 2 2 2 2 tains the three exponentials e−1/t , e−j/t and e−j /t to which correspond the six Stokes arcs defined by π/4 arg(t) +π/4 mod π/3 and 3π/4 arg(t) 5π/4 mod π/3. By − ≤ ≤ ≤ ≤ projection of these six arcs on the circle S1 of directions in the variable x we obtain the two Stokes arcs defined by 3π/4 arg(x) +3π/4 mod π, each one associated with the − ≤ ≤ three polynomials. The matrix F (x) satisfies the homological system dF (23) = B(x) F FB (x). e dx − 0 which is a linear differential system in the entries of F and which admits the polynomials q q for j,ℓ = 1,...,J as determining polynomials and so, we ℓ − j can state: Proposition 4.3.4.— The Stokes arcs of the homological system (23) are the Stokes arcs associated with all polynomials q q for 1 j = ℓ J. ℓ − j ≤ 6 ≤ Split the matrix F (x) into column-blocks corresponding to the block- structure of Q (for j = 1,...,J, the matrix Fj(x) has nj columns): e F (x)= F (x) F (x) F (x) . 1 2 ···e J Definition 4.3.5 (Stokese arcse of Fej(x)).—eWe call Stokes arcs of Fj(x) the Stokes arcs associated with the polynomials qℓ qj for 1 ℓ J, ℓ = j. e − ≤ ≤ 6 e The Stokes arcs of the homological system are the Stokes arcs of all Fj(x). Definition 4.3.6 (Levels, anti-Stokes directions) e We call (i) levels of system (21) the degrees of the determining polynomials q q ℓ − j for 1 j = ℓ J, of the homological system (23); ≤ 6 ≤ (ii) anti-Stokes direction associated with (24) (q q )(1/x)= a /xk 1+ o(1/x) = 0 ℓ − j − ℓ,j 6 any direction along which the exponential eq ℓ−qj has maximal decay, i.e., , any direction θ = arg(a )/k mod 2π/k along which a /xk is real negative; ℓ,j − ℓ,j (iii) anti-Stokes directions of system (21) the anti-Stokes directions asso- ciated with all determining polynomials (q q )(1/x) = 0 of the homological ℓ − j 6 system (23); (iv) levels of F (x) the degrees of the polynomials q q for 1 ℓ J, ℓ = j; j ℓ− j ≤ ≤ 6 e 76 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS (v) anti-Stokes directions of Fj(x) the anti-Stokes directions associated with the polynomials qℓ qj for 1 ℓ J, ℓ = j. − ≤e ≤ 6 Observe that 0 is not a level since q = q for all ℓ = j and the polynomials ℓ 6 j 6 q contain no constant term. Notice, in the right hand side of (24), the minus sign which we would not introduce if we worked at infinity. The anti-Stokes directions of a system are the middle points of the Stokes arcs of its homological system. The denomination “anti-Stokes directions” is not universal: sometimes, one calls such directions “Stokes directions” while to us, the Stokes directions are the oscillating lines of the exponentials eqℓ−qj . It is worth to notice that it is always possible to permute the columns of a formal fundamental solution by writing it −1 −1 (x)= F (x) P xP LP eP Q(1/x)P Y with P the chosen permutation. It is also always possible to normalize a given e eigenvalue of L, say λ1, and a given determining polynomial, say q1, to zero by the change of variable Y x−λ1 e−q1 Y in the initial system (and at the same 7→ time, in its normal form). The Stokes arcs and the levels of F1(x) are then the Stokes arcs and the degrees of the determining polynomials qj themselves. e 4.3.1.2. Meromorphic classification. — The meromorphic classification pro- ceeds differently than the formal one since it’s hopeless to exhibit (and, a fortiori, to calculate), in each meromorphic class, a system of a special form analogous to the normal form of the formal classification. Theoretically, the meromorphic classes are well identified as non-Abelian 1-cohomology classes. In practice, the meromorphic classes are identified via a finite number of ma- trices of a special form called Stokes matrices. Contrary to normal solutions, the Stokes matrices do not depend algebraically on the system; they are, in general, deeply transcendental with respect to the coefficients of the system. Some algorithms exist to calculate numerical approximations of the Stokes matrices in some “simple” situations but, yet, none is efficient in the very general case. Since the meromorphic classification refines the formal meromorphic one it is convenient, without any loss, to restrict the classification to a given formal ′ L Q(1/x) class with normal form Y = B0(x) Y and normal solution 0(x)= x e . ′ ′ Y Any system Y = B(x) Y in the formal class of Y = B0(x) Y satisfies, by F definition, a relation B(x)= eB0(x) for a convenient formal gauge transforma- tion F (x) but such a gauge transformation F (x) is not unique in general: one e e 4.3. CLASSIFICATIONS 77 −1 F1 F2 F F1 has e B0 = e B0 if and only if e2 e B0 = B0, i.e., if and only if there exists a ′ gauge transformation T which leaves invariant the normal form Y = B0(x) Y and such that F1(x)= F2(x)T (x). Notice that T (x) acts on F2(x) to the right. T The gauge transformations T for which B0 = B0 form a group. e e e Definition 4.3.7.— The group G0(B0) G(B0) of the gauge transforma- T ⊂ tions T for which B0 = B0 is called the group of isotropies or group of ′ invariance of the normal form Y = B0(x)Y . e The group G0(B0) is in general small, even trivial, and it is easily de- termined in each particular case: it is made of all matrices T (x) such that there exists a matrix C GL(n, C) satisfying T (x) (x)= (x) C; this cor- ∈ Y0 Y0 responds to constant block-diagonal matrices C commuting with Q(3) and L −L such that x Cx is meromorphic. In the case when all diagonal terms qj in Q(1/x) are distinct the group G0(B0) is made of all invertible constant diag- onal matrices; if, in addition, we ask for tangent-to-identity transformations then the group reduces to the identity. Examples 4.3.8.— Denote by Ij the identity matrix of dimension j and by Jj the irreducible nilpotent upper Jordan block of dimension j. ⊲ Suppose the normal solution has the form λ1I1⊕(λ2I3+J3) q1I1⊕q2I3 0(x)= x e Y where 0 < (λ1), (λ2) < 1 and where q1 = q2 are polynomials in 1/x. The invertible ℜ ℜ −1 6 matrices C such that 0(x) C 0(x) is a meromorphic transformation are those which Y Y commute both to eq1I1⊕q2I3 (this is a general fact) and to xλ1I1⊕(λ2I3+J3). One can check ∗ that this means that the matrix C has the form C = C1 C2 where C1 = cI1 with c C 2 ⊕ ∈ and C2 = c1I3 + c2J3 + c3J with c1,c2,c3 C and c1 = 0. All such constant matrices C 3 ∈ 6 form the group G0(B0). Lj qj In ⊲ Suppose the normal solution has the form 0(x)= x e j with distinct qj ’s Y and matrices Lj = diag(λj,1,...,λj,n ) with integer coefficients λj,1,...,λj,n Z. j L j ∈ Then, C = Cj is any constant invertible block-diagonal matrix with Cj of dimension nj and the elements of G (B ) are the transformations of the form T (x) = xLj C x−Lj . L 0 0 j Their coefficients are polynomials in x and 1/x. L The meromorphic classes of formal gauge transformations of a system, ′ either a normal form or not, Y = B0(x) Y are, by definition, the elements of the quotient G G(B0) of all formal meromorphic gauge transformations of ′ \ Y = B0Y by the convergent ones to the left. The meromorphic classes of systems in the formale class of Y ′ = B Y are the quotient G G(B ) / G (B ) 0 \ 0 0 0 (3) If Q = L qj Inj then C = L Cj with matrices Cj of size nj . e 78 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS ′ of the previous classifying set by the group G0(B0) of invariance of Y = B0 Y to the right (recall that the isotropies act on gauge transformations to the right, cf. supra). Since the group G0(B0) can always be made explicit it is sufficient to describe the classifying set G G(B ) of gauge transformations(4) \ 0 of the normal form. A first description of the meromorphice classes of gauge transformations was set up through a careful analysis of the Stokes phenomenon by Y. Sibuya [Sib77, Sib90] and by B. Malgrange [Mal79] (cf. Coms. 2.5.3). To state <0 1 their result we need to introduce the sheaf Λ (B0) over S of germs of flat ′ <0 isotropies of the normal form Y = B0(x) Y : a germ ϕ(x)inΛ (B0) is a germ (5) ϕ of GL(n, ) which is asymptotic to the identity and satisfies B0 = B0. The <0A sheaf Λ (B0) is a sheaf of non-commutative groups. Theorem 4.3.9 (Malgrange-Sibuya).— The classifying set G G(B0) is 1 1 <0 \ isomorphic to the first (non Abelian) cohomology set H S ;Λ (B0) . e The map from G G(B ) into H1 S1;Λ<0(B ) is abstractly given by the \ 0 0 Main Asymptotic Existence Theorem (Cor. 4.4.4) while, way back, it is made explicit by means of Cauchy-Heinee integrals. Actually, meromorphic classes of gauge transformations can be given a simpler characterization as follows. ′ Let A be the set of anti-Stokes directions of the normal form Y = B0(x) Y <0 and denote by Stoα(B0) the subgroup of the stalk Λα (B0) made of all germs ′ of flat isotropies of Y = B0(x) Y having maximal decay at α. When α A the group Sto (B ) is trivial (no flat isotropy has maximal 6∈ α 0 decay but the identity). When α A the group Stoα(B0) can be given a ∈ L Q(1/x) linear representation as follows: given a normal solution 0(x) = x e J Y with Q(1/x)= j=1 qj(1/x) and distinct qj’s choose a determination α of α. Denote by (x) the function defined by (x) with that determination of Y0,αL Y0 the argument near the direction α. An element ϕα(x) of Stoα(B0) is a flat transformation such that ϕ (x) (x)= (x)(I + C ) α Y0,α Y0,α n α for a unique constant invertible matrix In + Cα. L Q(1/x) −Q(1/x) −L This implies that ϕα(x)= x e (In + Cα)e x with the given (4) D.G. Babbitt and V.S. Varadarajan [BV89] call them meromorphic pairs (B , F ). 0 e (5) Flatness must be understood, here, in the multiplicative meaning of asymptotic to identity. 4.3. CLASSIFICATIONS 79 (ℓ,j) choice of the argument near α. Denote by Cα = [Cα ] the decomposition of Cα into blocks fitting the structure of Q. Hence, the germ ϕα(x) reads L (ℓ,j) (qℓ−qj )(1/x) −L ϕα(x)= x In + Cα e x . k k An exponential eq(1/x) = e−a/x (1+o(1/|x |)) has maximal decay in a direction α S1 if and only if ae−ikα is real negative (k might be fractional). Hence, ∈ − q (1/x)−q (1/x) ϕα(x) is flat in direction α if and only if, as soon as e ℓ j does not (ℓ,j) have maximal decay in direction α the corresponding block Cα of Cα van- ishes. In particular, for j = ℓ, the exponential eqj −qℓ does not have maximal (j,j) q −q decay and the corresponding diagonal block Cα is zero; if e j ℓ has maxi- q −q (ℓ,j) mal decay in direction α then e j ℓ has not and thus, if a block Cα is not (j,ℓ) equal to zero the symmetric block Cα is necessarily zero. This implies that the matrix In + Cα is unipotent. Reciprocally, any constant unipotent matrix with the necessary blocks of zeros characterizes a unique element of Stoα(B0). Consequently, Stoα(B0) has a natural structure of a unipotent Lie group. The Malgrange-Sibuya Theorem has been improved by showing that in each 1-cohomology class there is a unique 1-cocycle of a special form called the Stokes cocycle which is constructible from any cocycle in its 1-cohomology class [LR94, Thm. II.2.1]; the uniqueness of the Stoles cocycle is further developed in [LR03]. Definition 4.3.10 (Stokes cocycle).— A Stokes cocycle is a 1-cocycle (ϕα)α∈A with the following properties: it is indexed by the set A of anti-Stokes directions and each component ϕα determines an element of Stoα(B0). The set of Stokes cocycles can be identified to the finite product Sto (B ) and we can state: α∈A0 α 0 TheoremQ 4.3.11 (Stokes cocycle).— The classifying set G G(B ) is isomorphic to the product Sto (B ) of 0 α∈A0 α 0 \ ′ the Stokes groups associated with a normal form Y = B0(x) Y . e Q From this theorem the classifying set inherits a natural structure of a unipotent Lie group. For applications of this property we refer to [LR94]. Let (ϕα)α∈A be a Stokes cocycle associated with a gauge transforma- ′ ′ tion F (x) from the normal form Y = B0(x) Y to a system Y = B(x) Y (hence, F (x) G(B )). Let (x) be a normal solution. Choose a determina- ∈ 0 Y0 tion αeof the argument for all α (it is usually understood that all α belong to a same intervale e ]2mπ, 2(m + 1)π]) and denote by (x) the normal solution Y0,α 80 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS with that choice of a determination of the argument. Finally, for all α A, ∈ let the matrix (In + Cα)α∈A represent ϕα with respect to these choices. Definition 4.3.12.— The matrices (In + Cα)α∈A are called the Stokes ma- trices associated with the fundamental solution F (x) (x). Y0,α Like Stokes cocycles, Stokes matrices characterizee the meromorphic classes of gauge transformations: they form a full free set of meromorphic invariants. The Stokes cocycle and the Stokes matrices are connected to the theory of summation (Chap. 6) as follows. Suppose we are given a formal fundamental solution (x)= F (x) 0(x) at 0 and an anti-Stokes direction α A and denote + Y − Y ∈ by Fα (x) and Fα (x) the sums (k- or multisums) of F (x) to the left and to the right of the directione α. e Theorem 4.3.13.— The Stokes cocycle (ϕα)α∈A satisfy ϕ = F +(x)−1F −(x) for all α A. α α α ∈ The Stokes matrices (I +C ) A at 0 associated with F (x) (x) for a given n α α∈ Y0,α determination α of α satisfy e F −(x) (x)= F +(x) (x)(I + C ) for all α A. α Y0,α α Y0,α n α ∈ Formerly, one used to call Stokes matrices all matrices In + C satisfying a condition of the type F (x) (x)= F (x) (x)(I + C) j Y0,α ℓ Y0,α n linking two overlapping asymptotic solutions, i.e., any matrix representing a germ of isotropy F (x)−1 F (x)= (x)(I + C) (x)−1, not necessarily a ℓ j Y0,α n Y0,α Stokes germ. This appeared to be not restrictive enough to easily characterize the meromorphic classes of systems or to exhibit good Galoisian properties: an example of a non-Galoisian “Stokes matrix” in the wide sense is given in [LR94, Sect. III.3.3.2]. Henceforward, we use the expression Stokes matrix in the restrictive sense of associated to a Stokes cocycle. 4.3.2. The case of equations. — The meromorphic and the formal equiv- alence of linear differential operators of order n were given in Definition 4.2.8 with a characterization in Proposition 4.2.9. Like for systems the formal class of an equation is made explicit from a formal fundamental solution which can be read as the first row of a formal 4.3. CLASSIFICATIONS 81 fundamental solution of its companion system. Each such solution takes the form φ(x) xλ eq(1/x) where the factors φ(x) are polynomials in ln(x) with formal series coefficients. Levels, Stokes arcs and anti-Stokes directions are defined similarly as for sys- tems. The invariants are all the determining polynomials q(1/x) with mul- tiplicities, the corresponding exponents λ and the degrees in ln(x) of each associated φ(x). The meromorphic classes in a given formal class are also characterized by (adequate) Stokes matrices. The formal invariants are much easier to determine for an equation than for a system. Below we sketch a procedure to follow for an equation. 4.3.2.1. Newton polygons. — Newton polygons are a very convenient tool to identify the formal invariants of a linear differential equation Dy = 0 at a singular point. By means of a change of variable any singular point can be moved to the origin 0. However, we state the definitions both at 0 and at infinity. Consider a linear differential operator dn dn−1 D = b + b + + b n dxn n−1 dxn−1 ··· 0 with coefficients bj that are either meromorphic series in x (for a study at x = 0) or in powers of 1/x (for a study at x = ). Temporarily, we ∞ do not need that the coefficients be convergent. The valuation of a power series b(x) = β xm at the origin is denoted by v (b) and defined m≥m0 m 0 as the smallest degree with respect to x of the non-zero monomials β xm P m of b; thus, v (b)= m when β = 0. The valuation of a power series 0 0 m0 6 b(1/x) = β /xm at infinity is denoted by v (b) and defined as m≥m1 m ∞ the highest degree with respect to x of a non-zero monomial β /xm of b; P m thus, v (b)= m when β = 0. When b is a polynomial in x, then v (b) ∞ − 1 m1 6 ∞ is the degree of b with respect to x. Definition 4.3.14 (Newton polygons).— (i) Newton polygon at 0. — Suppose the coefficients bj of D are for- mal or convergent meromorphic power series in x. With the operator D one associates in R+ R the set of marked points × PD = (j,v (b ) j) ; 0 j n . PD 0 j − ≤ ≤ 82 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS The Newton polygon (D) of D at 0 is the upper envelop in R+ R of the N0 × various attaching lines of with non-negative slopes. PD (ii) Newton polygon at infinity. — Suppose the coefficients bj of D are formal or convergent meromorphic power series in 1/x. With the operator D one associates in R+ R the set of marked points × PD = (j,v (b ) j) ; 0 j n . PD ∞ j − ≤ ≤ + The Newton polygon ∞(D) of D at 0 is the lower envelop in R R of the N × various attaching lines of with non-positive slopes. PD Equivalently, we can say that the Newton polygon at 0 is the intersection of the closed upper half-planes limited by the various attaching lines of with PD non-negative slopes while the Newton polygon at infinity is the intersection of the closed lower half-planes limited by the various attaching lines of with PD non-positive slopes. One obtains the same Newton polygon when one enlarges the set of marked j points to any points (j, m j) corresponding to a non-zero monomial xm d − dxj in D or to the horizontal segments issuing from the points of backwards PD to the vertical axis. m dj m Example 4.3.15.— Consider the operator D = x dxj . Since x is both a mero- morphic series in x and in 1/x it makes sense to determine both its Newton polygon at 0 and at infinity. There corresponds to D the unique marked point (j,m j) and the − corresponding Newton polygons are as shown on Fig. 1. Figure 1 When D has polynomial coefficients one can define its Newton polygons both at 0 and at infinity. Definition 4.3.16 (Full Newton polygon).— Suppose D has polynomial coefficients. The full Newton polygon (D) is the intersection (D) N N0 ∩ (D) of the Newton polygons of D at 0 and at infinity. N∞ For simplicity and when there is no ambiguity, we denote by (D) anyone N of these Newton polygons. 4.3. CLASSIFICATIONS 83 Example 4.3.17.— Here below are the full Newton polygons of the Euler operator 2 d 3 d2 2 d = x dx + 1, its homogeneous variant 0 = x dx2 +(x +x) dx 1 and the hypergeometric E d d d E d − operator D3,1 = z z +4 z z +1 z 1 . dz − dz dz dz − Figure 2 From now on, unless otherwise specified, we work at the origin 0, i.e., we suppose that D has formal or convergent meromorphic coefficients at 0. Proposition 4.3.18 (levels of D).— Suppose 0 is a singular point of D, i.e., at least one of the coefficients bj/bn has a pole at 0. (i) The levels of D at 0 are the positive slopes of (D). N0 (ii) The point 0 is regular singular for D if and only if the Newton poly- gon (D) has no non-zero slope. N0 Proposition 4.3.19.— Newton polygons satisfy the following properties. (i) Let D = xmD, m Z. The Newton polygon of D is the Newton m ∈ m polygon of D translated vertically by m. (ii) Let D1 and D2 be two linear differential operators meromorphic at 0. Then, (D D )= (D )+ (D ). N0 1 2 N0 1 N0 2 Proof. — Assertion (i) is elementary. For a proof of (ii) we refer, for instance, to [DMR07, Lem. 1.4.1, p. 99]. As a consequence of (i), we may define the Newton polygon of an equa- tion Dy = 0 as being the Newton polygon of D up to vertical translation. On the set C[[x]][1/x, d/dx] of linear differential operators at 0 it is con- venient to introduce a weight (or 0-weight) w by setting dj dj dj w xk = k j and w xk = min w xk . dxj − dxj k,j dxj X In particular, w(x) = 1,w d = 1 and, to an operator D with weight dx − w(D)= w, the product x−wD has weight 0. At our convenience, given a differential equation Dy = 0, we can then assume that D has weight 0. 84 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS Lemma 4.3.20.— Given j N and k Z, one has ∈ ∈ ′′ j j j k+1 d jk+j d j′ d x = x + c ′ ′′ x (c ′ ′′ C). dx dxj j ,j dxj′′ j ,j ∈ 1≤j′′ Observe that all monomials in the right hand side have weight jk and then, the whole expression in the left hand side has weight jk. The marked point associated with xjk+j dj/dxj is A =(j,jk). The marked points associated with the monomials in the sum are (j′,jk) with 1 j′ j 1, hence points ≤ ≤ − lying on the horizontal segment between A and the vertical coordinate axis. Proof. — The formula in Lemma 4.3.20 is trivially true for j = 1. By Leibniz d k+1 k+1 d k rule we obtain the commutation law dx x = x dx +(k+1)x , from which it follows that d 2 d2 d xk+1 = x2k+2 +(k + 1)x2k+1 dx dx2 dx· Hence the formula for j = 2. The general case is similarly obtained by recur- rence. Proposition 4.3.21.— Given a differential operator D in the variable x denote by Dz the operator deduced from D by the change of variable x = 1/z. Then, the Newton polygons (D) and (D ) are symmetric with each other N0 N∞ z with respect to the horizontal coordinate axis. d 2 d Proof. — One has dz = x dx . From Lemma 4.3.20 we know that we can − 2 d expand D in powers of the derivation δ = x dx with weight w(δ) = +1: D = c (x)δn + c (x)δn−1 + + c (x) n n−1 ··· 0 and the set of marked points is then given by (j,v (c )+ j) for 0 j n. PD 0 j ≤ ≤ Now, the operator Dz reads dn dn−1 D =( 1)nc (1/z) +( 1)n−1c (1/z) + + c (1/z) z − n dzn − n−1 dzn−1 ··· 0 and the associated marked points are (j,v c (1/z) j)=(j, v (c ) ∞ j − − 0 j − j). 4.3.2.2. Newton polygon and Borel transform. — We consider here the clas- sical Borel transform (or 1-Borel transform) at 0 as defined in Section 6.3.1 B below and we denote by ξ the variable in the Borel plane. We suppose that 4.3. CLASSIFICATIONS 85 D has polynomial coefficients in x and 1/x. As previously, we can expand D 2 d in powers of δ = x dx : D = c (x)δn + c (x)δn−1 + + c (x). n n−1 ··· 0 We assume that the coefficients cj are polynomials in 1/x. If this were not the −N case, we would replace D by x D with N the degree of the cj’s with respect to x. Let ∆ = (D) denote the operator deduced from D by Borel transform. B Since (δ)= ξ and 1 = d (cf. Sect. 6.3.1) the operator ∆ reads B B x dξ d d d ∆= c ξn + c ξn−1 + + c n dξ n−1 dξ ··· 0 dξ and is then a linear differential operator with polynomial coefficients. The fact that D had coefficients polynomial in 1/x is a key point here. In the general case, due to the fact that (fg)= (f) (g), the Borel transform of B B ∗B a linear differential operator is a convolution operator. The proposition below is a corollary of [Mal91b, Thm. (1.4)]. Proposition 4.3.22.— With normalization as above, the following two properties are equivalent: (i) the levels of D at 0 are 1; ≤ (ii) the levels of ∆ at infinity are 1. ≤ Proof. — Let v = min v (c ) 0 be the minimal valuation of the coefficients j 0 j ≤ of D at 0. This implies that all marked points associated with D at 0 are on the line issuing from (0,v) with slope 1 (Recall that δ has weight 1) or over and that at least one of them belongs to the line. As a consequence, all levels of D are 1 if and only if the point (n,v + n) of the line is a marked point, ≤ i.e., if and only if v0(cn)= v. To the other side, ∆ has degree n and order v. Similarly at 0, its − Newton polygon at infinity has no slope > 1 if and only if the monomial n d−v ξ dξ−v does exist in ∆. And indeed, this is precisely what the condition v0(cn)= v says. 4.3.2.3. Calculating the formal invariants. — We briefly sketch here how to calculate the formal invariants of a linear differential equation Dy = 0 with (formal) meromorphic coefficients at 0. Recall that the formal invariants at 0 of the equation are the determining polynomials q(1/x) with multiplicities, the exponents of formal monodromy λ and how many logarithms are associated with. 86 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS ⊲ Indicial equation. — Suppose the Newton polygon (D) has a hori- N0 zontal side and consider the operator restricted to the marked points lying on that horizontal side. Up to a power of x to the left that operator reads dr dr−1 d D = γ xr + γ xr−1 + + γ x + γ , γ ,...,γ C. 0 r dxr r−1 dxr−1 ··· 1 dx 0 r 0 ∈ The indicial equation is the equation in the variable λ obtained by writing that xλ satisfies the equation D y = 0, i.e., denoting [λ] = λ(λ 1) ... (λ r + 1), 0 r − − the equation γr [λ]r + γr−1 [λ]r−1 + ... + γ1 [λ]1 + γ0 = 0. λ Its roots λj (with multiplicities) are the exponents of factors x associated with no exponential. ⊲ k-characteristic equation. — Suppose the Newton polygon (D) has N0 a side with slope k and consider the differential operator restricted to the ′ s′′ marked points lying on that side with slope k. This operator reads xk D d k dxs′′ with ds ds−1 d D = c xs(k+1) + c x(s−1)(k+1) + + c xk+1 + c . k s dxs s−1 dxs−1 ··· 1 dx 0 k The k-characteristic equation is the equation obtained by writing that e−a/x satisfies the equation Dky = 0, i.e., c Xs + c Xs−1 + + c X + c = 0. s s−1 ··· 1 0 Its roots (counted with multiplicities) are the dominant coefficients a of the k exponentials e−a/x +··· times k. Differently said, they are equal to the domi- k nant coefficients ak in the derivatives of the exponentials e−a/x (1+0(1/x)). ⊲ Iterated characteristic equations. — Once one has determined the dom- inant coefficient a in the exponentials the next coefficients including the factor xλ attached to each exponential can be determined as follows. Select one root (−a/xk) a and consider the differential operator D1 = D deduced from D by the k k change of variable y = e−a/x Y (and simplifying by the factor e−a/x ). The ′ Newton polygon 0(D1) may have no slope k < k and no horizontal side; Nk in that case e−a/x is the exponential we look for and it comes factored with no xλ. It may have no slope k′ k term in the exponential e−a/x +··· and so on . . . until all exponentials and associated xλ are found. ⊲ Frobenius method. — When the indicial equations have multiple roots modulo Z there might exist logarithmic terms. To determine which terms appear with logarithms there exist a classical algorithm called Frobenius al- gorithm. Although the procedure is easy and natural from a theoretical view- point (it might be long and laborious in practice) we do not develop it here and we refer to the classical literature, for instance, [CL55, Sec 4.8]. When one knows all normal solutions, to complete them by formal series to get solutions of the initial equation Dy = 0 one proceeds by like powers identification. All these algorithms have been implemented in Maple packages such as Isolde or gfun. The case of systems is much more difficult to treat practically. There ex- ists however algorithms to determine formal fundamental solutions. One can always apply the Cyclic vector algorithm (Sect. 4.1) and proceed as before. However, this way, there appear, in general, huge coefficients making the cal- culation heavy. It is then, in general, recommended to operate directly on the system itself. One method, which relies on Moser’s rank, was developed by M. Barkatou and his group (cf. [BCLR03] for a sketched algorithm and references). A variant was developed by M. Miyake [Miy11]. 4.4. The Main Asymptotic Existence Theorem Consider a linear differential operator n dj D = b (x) j dxj Xj=1 with analytic coefficients at 0. The question here addressed is: is any formal solution of the equation Dy = 0 the asymptotic expansion of an asymptotic solution? A positive answer is given by the Main Asymptotic Existence The- orem (M.A.E.T.) either in Poincar´easymptotics or in Gevrey asymptotics. In the case of Poincar´easymptotics the theorem, precisely Cor. 4.4.2, is mostly due to Hukuhara and Turritin with a complete proof by Wasow [Was76]. An extension to Gevrey asymptotics is given by B. Malgrange in [Mal91a, Append. 1] and to non linear operators [RS89] by J.-P. Ramis and Y. Sibuya. 88 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS The theorem roughly says that to a formal solution f of a differential equation (linear or non linear) there correspond actual solutions f asymptotic to f on various sectors. Given a direction, it is possible to determinee from the equation itself a minimal opening of the sector on which such an asymptotic solutione exists. However, these asymptotic solutions are, in general, neither unique nor given by explicit formulæ. Theorem 4.4.1 (Main Asymptotic Existence Theorem) The operator D acts linearly and surjectively on the sheaf <0 and on the A sheaves ≤−k for all k > 0. A In other words, the sequences <0 D <0 0 and ≤−k D ≤−k 0 for all k > 0 A −→A −→ A −→A −→ are exact sequences of sheaves of C-vector spaces. For the proof we refer to [Mal91a, Append 1; Thm. 1] where the theorem is stated and proved for all spaces m Corollary 4.4.2.— Let f(x) = m≥0 amx be a power series solution of the differential equation Dy = 0. P e 1 (i) Given any direction θ S , there exists a sector = ′ (R) ∈ θ ]θ−δ,θ+δ [ and a function f ( ) such that ∈ A θ ⊲ Df(x) = 0 for all x (i.e., f is an analytic solution on ), ∈ θ θ ⊲ T θ f = f (i.e., f is asymptotic to f at 0 on θ). (ii) If the series f(x) is Gevrey of order s then θ and f(x) can be chosen e e so that f(x) be s-Gevrey asymptotic to f(x) on θ. e Proof. — (i) The Borel-Ritt Theorem (cf. Thm. 2.4.1 (i)), provides for any e sector ′ containing the direction θ, a function g ( ′) with asymptotic ′ ∈ A expansion T ′ g = f on . Since T ′ is a morphism of differential algebras, <0 ′ T ′ Dg = DT ′ g = Df = 0. Hence, the function Dg is flat: Dg ( ). The ∈ A Main Asymptotic Existencee Theorem above applied to Dg in the direction θ provides a sector e ′ containing the direction θ and a function h <0( ) θ ⊂ ∈ A θ such that Dh = Dg. The function f = g h satisfies the required conditions − on θ. (ii) When the series f(x) is s-Gevrey the Borel-Ritt Theorem with Gevrey conditions (cf. Thm. 2.4.1.(ii)) provides a function g ( ′) over some sector ∈ As ′ containing the directione θ which is s-Gevrey asymptotic to f on ′. Its e 4.4. THE MAIN ASYMPTOTIC EXISTENCE THEOREM 89 derivative Dg is asymptotic to Df(x) = 0 and, from Proposition 2.3.17, we can assert that Dg is k-exponentially flat on ′. Hence, by the Main Asymptotic Existence Theorem, h belongs toe ≤−k and the conclusion follows as in the A previous case. Since the proof relies on the Borel-Ritt Theorem it does not provide the uniqueness of the asymptotic solutions. The theorem does not make explicit the size of the sector θ. When the series f is convergent the sector θ can be chosen to be a full disc around 0 and f(x) to be the sum of the series. The opening of a possible sector can be verye different depending on the series and on the chosen direction θ. The analysis of the Stokes phenomenon of the differential equation shows that in any direction one can choose a sector of opening at least π/k for k the highest level of the equation. Comments 4.4.3 (On the examples of section 2.2.2) ⊲ Example 2.2.4. The Euler function is asymptotic to the Euler series on a sector of opening 3π and this sector is an asymptotic sector in any direction θ. The highest (and actually unique) level of the Euler equation is k = 1 and thus, the actual opening of 3π is larger than π/k = π. However, if we ask for a sector bisected by the direction θ the opening reduces to π in the direction θ = π. ⊲ Example 2.2.6. The hypergeometric function g(z) is asymptotic to the hyperge- ometric series g(z) on a sector of opening 4π while π/k = 2π (the unique level of the hypergeometric equation D3,1y =0 is k =1/2). The anti-Stokes (and singular) directions are the directionse θ =0 mod 2π since the exponentials of a formal fundamental solution 1/2 are e±2 z . An asymptotic sector bisected by θ =0 has 2π as maximal opening. ⊲ In the previous two examples there exists only one singular direction and the pos- sible asymptotic sectors are much larger than the announced minimal value. Actually, considering two neighboring singular directions θ<θ′ an asymptotic sector always ex- ists with opening ]θ π/(2k),θ′ + π/(2k)[ for k the highest level of the equation. When − the singular directions are irregularly distributed the asymptotic sectors are “irregularly” wide. Let ∆Y Y ′ B(x) Y = 0 be a linear differential system of order 1 ≡ − and dimension n with formal fundamental solution F (x) xL eQ(1/x). The Main Asymptotic Existence Theorem 4.4.1 and its Corollary 4.4.2 remain valid for systems in the following form. e 90 CHAPTER 4. LINEAR ORDINARY DIFFERENTIAL EQUATIONS Corollary 4.4.4.— The operator ∆ acts surjectively in <0 n and in n A ≤−k for all k > 0 and consequently, it satisfies in all direction θ S1 the A ∈ following properties: (i) There exists a sector θ = ]θ−ω,θ+ω′[(R) and an invertible matrix function F GL n, ( ) such that ∈ A θ ∆ F (x) xLeQ(1/x) = 0 for all x , ∈ θ ( T θ F = F (F is asymptotic to F at 0 on θ). (ii) If an entry of F eis s-Gevrey then the correspondinge entry of F can be chosen to be s-Gevrey asymptotic on a convenient θ. e Proof. — This extension to differential systems follows from the fact that each entry of F (x) satisfies itself a linear differential equation with meromorphic ′ coefficients deduced from the homological system (23): F = BF FB0. e − 4.5. Infinitesimal neighborhoods of an irregular singular point While algebraic functions have moderate growth the form of formal so- lutions given above and the Main Asymptotic Existence Theorem show that solutions of linear differential equations at an irregular singular point may ex- hibit exponential growth or decay. Infinitesimal neighborhoods of algebraic ge- ometry are then insufficient to discriminate between the various solutions. We define below infinitesimal neighborhoods for irregular singularities of solutions of differential equations as suggested by P. Deligne in a letter to J.-P. Ramis dated 7/01/1986 [DMR07]. This approach is developed, with an application to index theorems, in [LRP97]. 4.5.1. Infinitesimal neighborhoods associated with exponential or- der. — We begin with a concept related only to the exponential order of growth or decay of the singularity under consideration. This concept will show up to be slightly too poor for a good characterization of k-summable series but it is a necessary step, at least for clarity. ⊲ Base space X. — From this viewpoint the infinitesimal neighborhood X of 0 in C is defined as a full copy of C compactified by the adjunction of a circle at infinity and endowed with a structural sheaf defined as below. For F obvious reasons we represent the infinitesimal neighborhood of 0 as a compact disc in place of the origin 0 in C. The “outside world” C∗ = C 0 is not \{ } 4.5. INFINITESIMAL NEIGHBORHOODS 91 affected by the construction and stays being endowed with the sheaf of germs of analytic functions. ⊲ Sheaf ≤k,k> 0. — Similar to the definition of k-exponentially flat A functions in Section 3.1.5 one says that a function f has exponential growth of order k on a sector if, for any proper subsector ′ ⋐ , there exist constants K and A> 0 such that the following estimate holds for all x ′: ∈ A f(x) K exp . | | ≤ x k | | The set of all functions with exponential growth of order k on is denoted ≤k by ( ) and one defines a sheaf ≤k over S1 of germs with exponential A A growth of order k (or, with k-exponential growth) in a similar way as ≤−k A (cf. Sect. 3.1.5). ⊲ Presheaf . — In view to define the sheaf it suffices to define the F F presheaf on a basis of open sets of X. We consider the following open sets F (cf. Fig. 3): Figure 3. Basis of open sets in X the discs D(0,k) for all k > 0, the (truncated) sectors I ]k′,k′′[= x = r eiθ ; θ I and 0