Appendix
Hardy Fields. (H) Functions
1. Hardy fields
Let be the filter base on formed by the intervals of the form . Recall that we have defined an equivalence relation : on the set of real functions defined on sets belonging to “there exists a set such that on ” (V, p. 211), and that the quotient set is endowed with the structure of a ring with unit element.
Definition 1
Given a subset of one says that (the canonical image of in ) is a Hardy field, if satisfies the following conditions:
1. is a subfield of the ring . 2. *Every function in is continuous and differentiable on an interval (depending on the function), and the class with respect to of its derivative belongs to .
The hypothesis that is a field is equivalent to the following conditions: if and then and are equal to functions in on some set in ; further, if is not identically zero on a set in then there exists a set in on which does not vanish, and is equal to a function from on ; by condition 2' one can always assume that is taken so that is continuous on , and consequently has constant sign on this interval.
By an abuse of language, if is such that is a Hardy field we shall say in what follows that is itself a Hardy field.
Example 1
Every Hardy field contains the field of rational constants (the smallest field of characteristic 0, cf. Alg., V, §1), which one can identify with the field ; moreover, since two constants cannot be congruent modulo unless they are equal, is identical to . The real constants also form a Hardy field, which one can identify with .
Cites 1
Example 2
A very important example of a Hardy field is the set of rational functions with real coefficients, which we shall denote by , by an abuse of language; if is a rational function with real coefficients, not identically zero, it is continuous, differentiable, and on an interval , where is strictly greater than the largest of the real roots of the polynomials and ; thus every element of other than 0 is invertible. We note again that two rational functions cannot be congruent modulo unless they are equal, so can again be identified with .
2. Extension of a hardy field
Given a Hardy field we shall see how one can form new Hardy fields such that is obtained by adjoining (in the algebraic sense of the term, cf. Alg., V. §2) new elements, of a form which we shall make precise, to .
Lemma 1
Let* be two continuous real functions that do not change sign on an interval . If, on this interval, the function *is continuous and differentiable, and satisfies the identity
(1)
then there exists an interval on which does not change sign.
Indeed, let us put (cf. IV, p. 183); then, by (1), . If for then is increasing on this interval, so either is on all this interval, or is zero on an interval , or else is on an interval ; since has the same sign as the proposition is proved in this case. The argument is similar if for .
Remark
This very elementary property does not extend to linear differential equations of order ; for example, the function satisfies , but changes sign on every neighbourhood of .
Lemma 2
Let* and be two functions belonging to a given Hardy field and a function satisfying the identity (1) on an interval where and are defined and continuous. If is a polynomial in whose coefficients are functions of belonging to , defined and differentiable on , then there exists an interval on which the function does not change sign.
The proposition is trivial if has coefficients which are identically zero on , or if is of degree 0 in , since any function in is of constant sign on an interval . Suppose that is of degree ; the leading coefficient of is then on an interval ; one can thus write where are functions belonging to and differentiable on ; so it is enough to prove the lemma for . We argue by induction on ; one has
where is a polynomial of degree , with coefficients in . By hypothesis the functions and do not change sign on an interval ; the lemma is thus a consequence of lemma 1.
Theorem 1
Let and be two functions belonging to a given Hardy field and a function satisfying (1) on an interval . When runs through the set of rational fractions in with coefficients in such that is not identically zero on a neighbourhood of the set of functions forms a Hardy field.
Cites 1
Indeed, by lemma 2, there exists an interval on which is defined, continuous, and does not change sign, from which it follows immediately that is a field; moreover, since
(where is defined by hypothesis on a neighbourhood of ), the derivative of every function in belongs to , which proves that satisfies the conditions of def. 1 of V, p. 247.
It is clear that is obtained by the algebraic adjunction to of the class of modulo . Again one says that is obtained by adjoining to .
Corollary 1
If is a function in , not identically zero on a neighbourhood of , then is a Hardy field.
Indeed, is equal to a function in on an interval .
COROLLARY 2 If is any function in , then is a Hardy field.
Indeed, , and is equal to a function in on an interval .
COROLLARY 3 If contains the real constants, and if is a function in , not identically zero on a neighbourhood of , then is a Hardy field for every real number .
Indeed, , and is equal to a function in on an interval .
Finally, we note that if is the primitive of any function in then is again a Hardy field.
3. Comparison of functions in a hardy field
Proposition 1
Two functions in the same Hardy field are comparable to any order* (V, p. 232).
Indeed, if belongs to a Hardy field , then for every integer there exists an interval on which is times differentiable, its derivative being equal to a function in on this interval. It is therefore enough to show that any two functions of are comparable. This is evident if one of the functions is identically zero on a neighbourhood of ; one may therefore restrict oneself to the case where they are both strictly positive on a neighbourhood of . But then, for every real number , is equal to a function in on a neighbourhood of , so has constant sign on a neighbourhood of , which proves the proposition (V, p. 217, prop. 9).
One deduces immediately from this proposition that, if a Hardy field contains the real constants (as we shall always assume in what follows), and if and are any two functions in then any two of the functions ( an arbitrary real), ( being any real number in an interval where and are regulated) are comparable (when they are defined); indeed, any two of these functions belong to a given Hardy field obtained by adjoining them successively to .
Similarly, every function in a Hardy field is comparable to , since and belong to the Hardy field obtained by adjoining to . One thus concludes (in particular) that is comparable to any order to every power , as well as to and to .
One also sees that if and belong to the same Hardy field , if on an interval , and if tends to 0 or to as tends to , then the order of relative to (V, p. 219) is always defined.
Prop. 8 of V, p. 233, is therefore applicable to every function in a Hardy field, and proves that:
1) if is of order relative to then .
2) if is of order relative to then .
3) if is of order relative to then .
4) if is of order relative to then .
Further, we have the following proposition:
Proposition 2
Let be a function belonging to a Hardy field .
1 If is of infinite order relative to , then, for every integer ,
2° If is of finite order relative to then, for every ,
1 If is of infinite order relative to one has , so, since and are comparable to any order, . Put ; since is equal to a function in on a neighbourhood of one deduces from , that , and so , or again . From the relation one deduces by differentiating that
2 If is of finite order relative to , and if , one has , whence, on differentiating, ; one deduces that is of order relative to , which allows one to apply the same argument by induction on so long as , whence formula (3) when is not an integer and .
When is of integral order relative to one can write , where is of order 0 relative to . By prop. 2 one has
If is equivalent to a constant one has with , and it reduces to studying the derivatives of .
4. (H) functions
Proposition 3
If is a Hardy field there exists a Hardy field containing and such that, for every function , not identically zero on a neighbourhood of , both and belong to .
Cites 1
Denote by the set of functions having the following properties: for each function there is a finite number of Hardy fields (the number and the fields depending on ) such that and, for , one has where is equal either to or to with belonging to and not vanishing identically on a neighbourhood of . One says that form a definition sequence for the field and of the function ; the same function can naturally admit several definition sequences.
By def. 1 of V, p. 247, every function , not identically zero on a neighbourhood of , has constant sign and is differentiable on an interval ; if , then and are equal to functions in , thus to functions in , on a neighbourhood of . To see that is a Hardy field it is enough to prove that if and are two functions in then and are equal to functions in on a neighbourhood of . Now let be a definition sequence for , and a definition sequence for . The sequence obtained by concatenating the sequences and is again a definition sequence of a Hardy field and this field contains and , so and are equal to functions in on a neighbourhood of .
One says that the Hardy field defined in the proof of prop. 3 is the (H) extension of the Hardy field .
If is another Hardy field possessing the properties stated in prop. 3, it follows from the construction of that is contained in . By abuse of language, one says that the (H) extension of the Hardy field is the smallest Hardy field having these properties.
Definition 2
The field of (H) functions is called the (H) extension of the Hardy field of rational functions with real coefficients. Any function belonging to this extension is called an (H) function.
Following this definition, if is an (H) function, not identically zero on a neighbourhood of , then and are also (H) functions. More generally, if is a second (H) function, and a definition sequence for , and if tends to with , one sees by induction on that the composite functions and are (H) functions.
5. Exponentials and iterated logarithms
We have already (V, p. 229) defined the iterated logarithms by the conditions for . In the same way one defines the iterated exponentials by the conditions for . It is immediate, by induction on , that is the inverse function of , defined for , and that . By the relations for every , one has, for ,
for all , these numbers being otherwise arbitrary (cf. V, p. 218, prop. 11).
We have already seen (V, p. 229) that, for , one has
Similarly for
whence, by prop. 8 of V, p. 233, for every
One can show that if is any (H) function such that then there exist two integers and such that
(V, p. 263, exerc. 1 and p. 264, exerc. 5) On the other hand, one can define increasing functions (which are no longer (H) functions) such that for every , or for every (V, p. 265, exerc. 8, 9 and 10).
With the help of the iterated logarithms we shall show that one can define a comparison scale (for tending to ) of (H) functions, which are on a neighbourhood of and satisfy the following conditions:
a) the product of any two functions in belongs to ; b) for every function and every real number ;
c) for every function , is a linear combination of a finite number of functions in ; d) for every function , apart from the constant 1, is equivalent to a function in .
First we consider the set of functions of the form , where the are real numbers, zero apart from for a finite number of indices ; it is immediate, from (5) (V, p. 253) that these functions form a comparison scale which satisfies conditions and c). Now we define, by recursion on , the set (for ) formed by the constant 1 and by the functions of the form , where is an arbitrary integer , the functions () are functions in such that , and the are real numbers ; we show by induction that is a comparison scale satisfying and c) and containing . In the first place, the relation holds for , since the logarithm of any nonconstant function in is of the form , where the are iterated logarithms, and so ; on the other hand, if one deduces from the definition of that ; this definition furthermore shows that satisfies and c). It remains to see that is a comparison scale: since the quotient of two functions in again belongs to it suffices to prove that every function of , apart from the constant 1, cannot be equivalent to a constant . Now one has by construction, and since , tends to , so tends to 0 or to as tends to .
This being so, if is the union of the for , then is a comparison scale, for two functions in belong to the same scale ; for the same reason, satisfies a), and it is clear that it also satisfies b) and c). Finally, if there exists an such that ; if is not the constant 1 then tends to 0 or to as tends to ; in the first case and in the second, belongs to by definition, and so to .
Remark
Despite the practical usefulness of the scale which we have just defined, it is easy to give examples of (H) functions which have no principal part with respect to . Indeed, if is an (H) function such that , where is a constant and , then tends to 0 with , so admits, relative to , an asymptotic expansion whose remainder tends to 0, by property c). Now, if one considers for example the (H) function one has , so the asymptotic expansions of relative to are of the form
It is clear that the remainder in this expansion is equivalent to , so does not tend to 0. Hence does not have a principal part relative to .
6. Inverse function of an (h) function
If is an (H) function, then is monotone and continuous on an interval , so the inverse function of the restriction of to this interval is monotone and continuous on a neighbourhood of the point ; but, if is equal to (resp. , finite), one can show that (resp. , or ) is not in general equal to an (H) function on a neighbourhood of . Nevertheless we shall see that in certain important cases one can obtain an (H) function equivalent to (resp. , , ) and sometimes even an asymptotic expansion of this function relative to the scale defined in V, p. 254.
We shall use the following proposition:
Proposition 4
Let and be two (H) functions which are strictly positive on an interval .
Cites 3 · Cited by 1
Cites I § 2. The mean value theorem, V § 3. Asymptotic expansions of functions of a real variable, App. 0. Hardy Fields. (H) Functions
Cited by Proposition 5
1° If one has . 2° If both and then .
The two parts of this proposition are clear if (constant ); one may therefore suppose that (otherwise one applies the argument to ). One then deduces .
1° One can write with (I, p. 14, corollary). Since tends to 0 as tends to , and is equal to an (H) function on a neighbourhood of , it is decreasing on an interval , so, for , one has ; since one has .
2° The condition ensures that tends to with . Again one has with . The same argument as in the first part of the proof shows that, for sufficiently large, . It reduces to showing that tends to 0 as tends to . The proposition is true if since then is an (H) function, increasing for large enough; thus , and by hypothesis. It is also true if ( constant ), for then
since tends to . It only remains to examine the case where . First suppose that is of finite order relative to , and so (V, p. 232, prop. 7) . Then one has
Remark
The conditions imposed on may not be improved, as the following examples show:
a)
b)
We shall first study the inverses of (H) functions of a particular sort:
Proposition 5
Let g be an* (H) function not equivalent to a constant , and such that , and let be the inverse function of , defined on a neighbourhood of . Let be the sequence of functions defined, by recursion on , by the conditions , for ; then and
Cites 2
Let us put , ; then , and . One first deduces that ; since tends to with , the hypothesis shows that ; further,
whence
In the second place we show, by recursion on , that when tends to one has , and
Indeed, , where belongs to the interval with endpoints and ; by the induction hypothesis tends to with , and so tends to 0, which proves (13). One deduces from this relation and from (12) that , whence and consequently . Finally, the relation can also be written , whence
To prove (11), first remark that if is a function such that , then one has . Indeed, for any , for sufficiently large is monotone, so lies between and . Prop. 4 of V, p. 255, shows that , provided one has established the relation . Now, if is of infinite order relative to one has (V, p. 251, prop. 2) , and, since ; if is of finite order relative to one necessarily has ; if , since is not equivalent to a constant , formulae (3) and (4) (V, p. 251) show that ( constant ), whence again ; finally, if then is of order 0 relative to , so , and so again .
This being so, since lies between and , it follows from (14) that , whence by the above; thus
Remark 1
If is of order relative to , the function tends to 0 with once is sufficiently large. Indeed, in the opposite case one would have for every , so would be of infinite order relative to ; in other words, one would have , whence, on differentiating, . But if is of order relative to one has when when , and finally when (V, p. 251, n 3).
In contrast, if is of order 1 relative to one can have for every integer , as the example shows.
Cites 1
Remark 2
When is an (H) function equivalent to a constant one has , with ; the function is the inverse of the function , and one is brought back to the case treated in prop. 5 of V, p. 256.
To have an asymptotic expansion for the function it thus suffices to have such an expansion for the function : if admits an asymptotic expansion relative to the scale under consideration one is thus led (by the definition of (H) functions) to the problems examined in V, p. 223 to 227.
The most general case, as follows, reduces to the case treated in prop. 5 of V, p. 256: the function is assumed to satisfy the relation
Example 1
Let us seek an asymptotic expansion for the inverse function of (for tending to ); putting one is led to seek an expansion of the inverse function of (for tending to ), that is, to apply prop. 5 of V, p. 256, to the case where . Let us, for example, calculate, ; one has
Cites 1
Example 2
Let us seek an asymptotic expansion for the inverse function of the function ; from the identity , where , one deduces ; on putting , one has , and one is led to expand the inverse function of ; for example, one has
Cites 1
Remark
Note that two equivalent (H) functions can have non-equivalent inverses, as the example of the two functions and shows.
Exercises
See the exercises for Appendix 0.