transseries

In mathematics, the field $\mathbb^$ of logarithmic-exponential transseries is a non-Archimedean ordered differential field which extends comparability of asymptotic growth rates of elementary nontrigonometric functions to a much broader class of objects. Each log-exp transseries represents a formal asymptotic behavior, and it can be manipulated formally, and when it converges (or in every case if using special semantics such as through infinite surreal numbers), corresponds to actual behavior. Transseries can also be convenient for representing functions. Through their inclusion of exponentiation and logarithms, transseries are a strong generalization of the power series at infinity ($\sum_^\infty \frac$) and other similar asymptotic expansions.

The field $\mathbb^$ was introduced independently by Dahn-Göring and Ecalle in the respective contexts of model theory or exponential fields and of the study of analytic singularity and proof by Ecalle of the Dulac conjectures. It constitutes a formal object, extending the field of exp-log functions of Hardy and the field of accelerando-summable series of Ecalle.

The field $\mathbb^$ enjoys a rich structure: an ordered field with a notion of generalized series and sums, with a compatible derivation with distinguished antiderivation, compatible exponential and logarithm functions and a notion of formal composition of series.

Examples and counter-examples

Informally speaking, exp-log transseries are ''well-based'' (i.e. reverse well-ordered) formal Hahn series of real powers of the positive infinite indeterminate $x$, exponentials, logarithms and their compositions, with real coefficients. Two important additional conditions are that the exponential and logarithmic depth of an exp-log transseries $f,$ that is the maximal numbers of iterations of exp and log occurring in $f,$ must be finite.

The following formal series are log-exp transseries:

:$\sum_^\infty \frac + x^3 + \log x + \log\log x +\sum_^\infty x^ + \sum _^\infty e^.$
:$\sum_ x^e^.$

The following formal series are ''not'' log-exp transseries:

:$\sum_ x^n$ — this series is not well-based.
:$\log x + \log \log x+ \log \log \log x+ \cdots$ — the logarithmic depth of this series is infinite
:$\fracx+e^+e^+\cdots$ — the exponential and logarithmic depths of this series are infinite

It is possible to define differential fields of transseries containing the two last series; they belong respectively to $\mathbb^$ and $\R\langle\langle \omega \rangle\rangle$ (see the paragraph ''Using surreal numbers'' below).

Introduction

A remarkable fact is that asymptotic growth rates of elementary nontrigonometric functions and even all functions definable in the model theoretic structure $(\mathbb,+,\times,<,\exp)$ of the ordered exponential field of real numbers are all comparable:
For all such $f$ and $g$, we have $f \leq_ g$ or $g \leq_ f$, where $f\leq_g$ means $\exists x. \forall y>x. f(y)\leq g(y)$. The equivalence class of $f$ under the relation $f \leq_ g \wedge g \leq_ f$ is the asymptotic behavior of $f$, also called the ''germ'' of $f$ (or the germ of $f$ at infinity).

The field of transseries can be intuitively viewed as a formal generalization of these growth rates: In addition to the elementary operations, transseries are closed under "limits" for appropriate sequences with bounded exponential and logarithmic depth. However, a complication is that growth rates are non- Archimedean and hence do not have the least upper bound property. We can address this by associating a sequence with the least upper bound of minimal complexity, analogously to construction of surreal numbers. For example, $(\sum_^n x^)_$ is associated with $\sum_^\infty x^$ rather than $\sum_^\infty x^-e^$ because $e^$ decays too quickly, and if we identify fast decay with complexity, it has greater complexity than necessary (also, because we care only about asymptotic behavior, pointwise convergence is not dispositive).

Because of the comparability, transseries do not include oscillatory growth rates (such as $\sin x$). On the other hand, there are transseries such as $\sum _ k!e^$ that do not directly correspond to convergent series or real valued functions. Another limitation of transseries is that each of them is bounded by a tower of exponentials, i.e. a finite iteration $e^$ of $e^x$, thereby excluding tetration and other transexponential functions, i.e. functions which grow faster than any tower of exponentials. There are ways to construct fields of generalized transseries including formal transexponential terms, for instance formal solutions $e_$ of the Abel equation $e^=e_(x+1)$.

Formal construction

Transseries can be defined as formal (potentially infinite) expressions, with rules defining which expressions are valid, comparison of transseries, arithmetic operations, and even differentiation. Appropriate transseries can then be assigned to corresponding functions or germs, but there are subtleties involving convergence. Even transseries that diverge can often be meaningfully (and uniquely) assigned actual growth rates (that agree with the formal operations on transseries) using accelero-summation, which is a generalization of Borel summation.

Transseries can be formalized in several equivalent ways; we use one of the simplest ones here.

A ''transseries'' is a well-based sum,

:$\sum a_i m_i,$

with finite exponential depth, where each $a_i$ is a nonzero real number and $m_i$ is a monic transmonomial ($a_i m_i$ is a transmonomial but is not monic unless the ''coefficient'' $a_i = 1$; each $m_i$ is different; the order of the summands is irrelevant).

The sum might be infinite or transfinite; it is usually written in the order of decreasing $m_i$.

Here, ''well-based'' means that there is no infinite ascending sequence $m_ < m_ < m_ < \cdots$ (see well-ordering).

A ''monic transmonomial'' is one of 1, ''x'', log ''x'', log log ''x'', ..., ''e''^{purely_large_transseries}.

: ''Note:'' Because $x^n = e^$, we do not include it as a primitive, but many authors do; ''log-free'' transseries do not include $\log$ but $x^n e^\cdots$ is permitted. Also, circularity in the definition is avoided because the purely_large_transseries (above) will have lower exponential depth; the definition works by recursion on the exponential depth. See "Log-exp transseries as iterated Hahn series" (below) for a construction that uses $x^a e^\cdots$ and explicitly separates different stages.

A ''purely large transseries'' is a nonempty transseries $\sum a_i m_i$ with every $m_i>1$.

Transseries have ''finite exponential depth'', where each level of nesting of ''e'' or log increases depth by 1 (so we cannot have ''x'' + log ''x'' + log log ''x'' + ...).

Addition of transseries is termwise: $\sum a_i m_i + \sum b_i m_i = \sum(a_i + b_i) m_i$ (absence of a term is equated with a zero coefficient).

''Comparison:''

The most significant term of $\sum a_i m_i$ is $a_i m_i$ for the largest $m_i$ (because the sum is well-based, this exists for nonzero transseries). $\sum a_i m_i$ is positive iff the coefficient of the most significant term is positive (this is why we used 'purely large' above). ''X'' > ''Y'' iff ''X'' − ''Y'' is positive.

''Comparison of monic transmonomials:''

: $x = e^, \log x = e^, \ldots$ – these are the only equalities in our construction.
: $x > \log x > \log \log x > \cdots >1 >0.$
: $e^a < e^b$ iff $a < b$ (also $e^0 = 1$).

''Multiplication:''
: $e^a e^b = e^$
: $\left(\sum a_i x_i\right) \left(\sum b_j y_j\right) = \sum_k \left( \sum_ a_i b_j\right) z_k.$

This essentially applies the distributive law to the product; because the series is well-based, the inner sum is always finite.

''Differentiation:''

: $\left(\sum a_i x_i\right)' = \sum a_i x_i'$
: $1' = 0, x' = 1$
: $(e^y)' = y' e^y$
: $(\log y)' = y'/y$ (division is defined using multiplication).

With these definitions, transseries is an ordered differential field. Transseries is also a valued field, with the valuation $\nu$ given by the leading monic transmonomial, and the corresponding asymptotic relation defined for $0\neq f,g \in \mathbb^$ by $f \prec g$ if \forall 0 (where $, f, =\max(f,-f)$ is the absolute value).

Other constructions

Log-exp transseries as iterated Hahn series

Log-free transseries

We first define the subfield $\mathbb^$ of $\mathbb^$ of so-called ''log-free transseries''. Those are transseries which exclude any logarithmic term.

''Inductive definition:''

For $n \in \N,$ we will define a linearly ordered multiplicative group of ''monomials'' $\mathfrak_n$. We then let $\mathbb^E_n$ denote the field of ''well-based series'' \R \mathfrak_n. This is the set of maps $\R\to \mathfrak_n$ with well-based (i.e. reverse well-ordered) support, equipped with pointwise sum and Cauchy product (see Hahn series). In $\mathbb^E_n$, we distinguish the (non-unital) subring $\mathbb^E_$ of ''purely large transseries'', which are series whose support contains only monomials lying strictly above $1$.

:We start with $\mathfrak_0=x^$ equipped with the product $x^a x^b:=x^$ and the order x^a \prec x^b \leftrightarrow a.

:If $n\in \N$ is such that $\mathfrak_n$, and thus $\mathbb^E_n$ and $\mathbb^E_$ are defined, we let $\mathfrak_$ denote the set of formal expressions $x^a e^$ where $a \in \R$ and $\theta \in \mathbb^E_$. This forms a linearly ordered commutative group under the product $(x^a e^)(x^ e^)=(x^) e^$ and the lexicographic order $x^a e^ \prec x^ e^$ if and only if $\theta<\theta'$ or ($\theta=\theta'$ and a).

The natural inclusion of $\mathfrak_0$ into $\mathfrak_1$ given by identifying $x^a$ and $x^a e^0$ inductively provides a natural embedding of $\mathfrak_n$ into $\mathfrak_$, and thus a natural embedding of $\mathbb^E_n$ into $\mathbb^E_$. We may then define the linearly ordered commutative group $\mathfrak=\bigcup_ \mathfrak_n$ and the ordered field $\mathbb^E=\bigcup_ \mathbb^E_n$ which is the field of log-free transseries.

The field $\mathbb^E$ is a proper subfield of the field \R \mathfrak of well-based series with real coefficients and monomials in $\mathfrak$. Indeed, every series $f$ in $\mathbb^E$ has a bounded exponential depth, i.e. the least positive integer $n$ such that $f \in \mathbb^E_n$, whereas the series

:e^+e^+e^+ \cdots \in \R \mathfrak

has no such bound.

''Exponentiation on $\mathbb^E$:''

The field of log-free transseries is equipped with an exponential function which is a specific morphism $\exp:(\mathbb^E,+)\to(\mathbb^, \times)$. Let $f$ be a log-free transseries and let $n \in \N$ be the exponential depth of $f$, so $f \in \mathbb^E_n$. Write $f$ as the sum $f=\theta+r+\varepsilon$ in $\mathbb^E_n,$ where $\theta \in \mathbb^E_$, $r$ is a real number and $\varepsilon$ is infinitesimal (any of them could be zero). Then the formal Hahn sum

:$E(\varepsilon):=\sum_ \frac$

converges in $\mathbb^E_n$, and we define $\exp(f)=e^\exp(r) E(\varepsilon) \in \mathbb^E_$ where $\exp(r)$ is the value of the real exponential function at $r$.

''Right-composition with $e^x$:''

A right composition $\circ_$ with the series $e^x$ can be defined by induction on the exponential depth by

:$\left (\sum f_ \mathfrak \right ) \circ e^x:=\sum f_ (\mathfrak \circ e^x),$

with $x^r \circ e^x:=e^$. It follows inductively that monomials are preserved by $\circ_,$ so at each inductive step the sums are well-based and thus well defined.

Log-exp transseries

''Definition:''

The function $\exp$ defined above is not onto $\mathbb^$ so the logarithm is only partially defined on $\mathbb^E$: for instance the series $x$ has no logarithm. Moreover, every positive infinite log-free transseries is greater than some positive power of $x$. In order to move from $\mathbb^E$ to $\mathbb^$, one can simply "plug" into the variable $x$ of series formal iterated logarithms $\ell_n,n \in \N$ which will behave like the formal reciprocal of the $n$-fold iterated exponential term denoted $e_n$.

For $m,n \in \N,$ let $\mathfrak_$ denote the set of formal expressions $\mathfrak \circ \ell_n$ where $\mathfrak \in \mathfrak_m$. We turn this into an ordered group by defining $(\mathfrak \circ \ell_n)(\mathfrak \circ \ell_n(x)):=(\mathfrak\mathfrak) \circ \ell_n$, and defining $\mathfrak \circ \ell_n\prec \mathfrak\circ \ell_n$ when $\mathfrak\prec \mathfrak$. We define \mathbb^_:=\R \mathfrak_. If $n'> n$ and $m' \geq m+(n'-n),$ we embed $\mathfrak_$ into $\mathfrak_$ by identifying an element $\mathfrak \circ \ell_n$ with the term

:$\left (\mathfrak \circ \overbrace^ \right ) \circ \ell_.$

We then obtain $\mathbb^$ as the directed union

:$\mathbb^=\bigcup_ \mathbb^_.$

On $\mathbb^,$ the right-composition $\circ_$ with $\ell$ is naturally defined by

:$\mathbb^_ \ni \left (\sum f_ \mathfrak \circ \ell_n \right ) \circ \ell:= \sum f_ \mathfrak \circ \ell_\in \mathbb^_.$

''Exponential and logarithm:''

Exponentiation can be defined on $\mathbb^$ in a similar way as for log-free transseries, but here also $\exp$ has a reciprocal $\log$ on $\mathbb^$. Indeed, for a strictly positive series $f \in \mathbb^_$, write $f=\mathfrak r(1+\varepsilon)$ where $\mathfrak$ is the dominant monomial of $f$ (largest element of its support), $r$ is the corresponding positive real coefficient, and $\varepsilon:=\frac-1$ is infinitesimal. The formal Hahn sum

:$L(1+\varepsilon):=\sum_\frac$

converges in $\mathbb^_$. Write $\mathfrak=\mathfrak\circ \ell_n$ where $\mathfrak \in \mathfrak_m$ itself has the form $\mathfrak=x^ae^$ where $\theta \in \mathbb^E_$ and $a \in \R$. We define $\ell(\mathfrak):=a \ell_ +\theta \circ \ell_n$. We finally set

:$\log(f):=\ell(\mathfrak)+\log(c)+L(1+\varepsilon) \in \mathbb^_.$

Using surreal numbers

Direct construction of log-exp transseries

One may also define the field of log-exp transseries as a subfield of the ordered field $\mathbf$ of surreal numbers. The field $\mathbf$ is equipped with Gonshor-Kruskal's exponential and logarithm functions and with its natural structure of field of well-based series under Conway normal form.

Define $F^_0=\R(\omega)$, the subfield of $\mathbf$ generated by $\R$ and the simplest positive infinite surreal number $\omega$ (which corresponds naturally to the ordinal $\omega$, and as a transseries to the series $x$). Then, for $n \in \N$, define $F^_$ as the field generated by $F^_n$, exponentials of elements of $F^_n$ and logarithms of strictly positive elements of $F^_n$, as well as (Hahn) sums of summable families in $F^_n$. The union $F^_=\bigcup_ F^_n$ is naturally isomorphic to $\mathbb^$. In fact, there is a unique such isomorphism which sends $\omega$ to $x$ and commutes with exponentiation and sums of summable families in $F^_$ lying in $F_$.

Other fields of transseries

*Continuing this process by transfinite induction on $\mathbf$ beyond $F^_$, taking unions at limit ordinals, one obtains a proper class-sized field $\R\langle\langle\omega\rangle\rangle$ canonically equipped with a derivation and a ''composition'' extending that of $\mathbb^$ (see ''Operations on transseries'' below).

*If instead of $F^_0$ one starts with the subfield $F^_0:=\R(\omega,\log \omega, \log \log \omega, \ldots)$ generated by $\R$ and all finite iterates of $\log$ at $\omega$, and for $n\in \N, F^_$ is the subfield generated by $F^_n$, exponentials of elements of $F^_n$ and sums of summable families in $F^_n$, then one obtains an isomorphic copy the field $\mathbb^$ of ''exponential-logarithmic transseries'', which is a proper extension of $\mathbb^$ equipped with a total exponential function.

The Berarducci-Mantova derivation on $\mathbf$ coincides on $\mathbb^$ with its natural derivation, and is unique to satisfy compatibility relations with the exponential ordered field structure and generalized series field structure of $\mathbb^$ and $\R\langle\langle\omega\rangle\rangle.$

Contrary to $\mathbb^,$ the derivation in $\mathbb^$ and $\R \langle\langle\omega\rangle\rangle$ is not surjective: for instance the series

:$\frac:=\exp(-(\log \omega+\log \log\omega+\log \log \log \omega+ \cdots)) \in \mathbb^$

doesn't have an antiderivative in $\mathbb^$ or $\R \langle \langle\omega \rangle\rangle$ (this is linked to the fact that those fields contain no transexponential function).

Additional properties

Operations on transseries

Operations on the differential exponential ordered field

Transseries have very strong closure properties, and many operations can be defined on transseries:
* Log-exp transseries form an exponentially closed ordered field: the exponential and logarithmic functions are total. For example:
::$\exp(x^) = \sum_^\infty \fracx^ \quad \text \quad \log(x+\ell)=\ell+\sum_^ \frac.$
* Logarithm is defined for positive arguments.
* Log-exp transseries are real-closed.
* Integration: every log-exp transseries $f$ has a unique antiderivative with zero constant term $F \in \mathbb^$, $F'=f$ and $F_1=0$.
* Logarithmic antiderivative: for $f\in \mathbb^$, there is $h\in \mathbb^$ with $f'=f h'$.

Note 1. The last two properties mean that $\mathbb^$ is ''Liouville closed''.

Note 2. Just like an elementary nontrigonometric function, each positive infinite transseries $f$ has integral exponentiality, even in this strong sense:

:$\exists k,n \in \N: \quad \ell_ -1\leq \ell_n \circ f \leq \ell_+1.$

The number $k$ is unique, it is called the ''exponentiality'' of $f$.

Composition of transseries

An original property of $\mathbb^$ is that it admits a composition $\circ :\mathbb^ \times \mathbb^ \to \mathbb^$ (where $\mathbb^$ is the set of positive infinite log-exp transseries) which enables us to see each log-exp transseries $f$ as a function on $\mathbb^$. Informally speaking, for $g\in\mathbb^$ and $f\in \mathbb^$, the series $f \circ g$ is obtained by replacing each occurrence of the variable $x$ in $f$ by $g$.

=Properties

=
* Associativity: for $f \in \mathbb^$ and $g,h \in \mathbb^$, we have $g\circ h \in \mathbb^$ and $f \circ (g\circ h)=(f \circ g) \circ h$.
* Compatibility of right-compositions: For $g\in \mathbb^$, the function $\circ_g:f\mapsto f \circ g$ is a field automorphism of $\mathbb^$ which commutes with formal sums, sends $x$ onto $g$, $e^x$ onto $\exp(g)$ and $\ell$ onto $\log(g)$. We also have $\circ_x=\operatorname_$.
* Unicity: the composition is unique to satisfy the two previous properties.
* Monotonicity: for $f\in \mathbb^$, the function $g\mapsto f \circ g$ is constant or strictly monotonous on $\mathbb^$. The monotony depends on the sign of $f'$.
* Chain rule: for $f \in \mathbb^\times$ and $g \in \mathbb^$, we have $(f \circ g)'=g'f' \circ g$.
* Functional inverse: for $g \in \mathbb^$, there is a unique series $h \in \mathbb^$ with $g \circ h= h \circ g= x$.
* Taylor expansions: each log-exp transseries $f$ has a Taylor expansion around every point in the sense that for every $g\in \mathbb^$ and for sufficiently small $\varepsilon \in \mathbb^$, we have
::$f\circ (g+\varepsilon)=\sum_ \frac\varepsilon^k$
:where the sum is a formal Hahn sum of a summable family.
* Fractional iteration: for $f \in \mathbb^$ with exponentiality $0$ and any real number $a$, the fractional iterate $f^a$ of $f$ is defined.

Decidability and model theory

Theory of differential ordered valued differential field

The $\left\langle+,\times,\partial,<,\prec\right\rangle$ theory of $\mathbb^$ is decidable and can be axiomatized as follows (this is Theorem 2.2 of Aschenbrenner et al.):
* $\mathbb^$ is an ordered valued differential field.
* $f > 0 \wedge f \succ 1 \Longrightarrow f' > 0$
* $f \prec 1 \Longrightarrow f' \prec 1$
* $\forall f \exists g: \quad g' = f$
* $\forall f \exists h: \quad h' = fh$
* Intermediate value property (IVP):
::$P(f) < 0 \wedge P(g) > 0 \Longrightarrow \exists h: \quad P(h) = 0,$
:where ''P'' is a differential polynomial, i.e. a polynomial in $f, f', f'', \ldots, f^.$

In this theory, exponentiation is essentially defined for functions (using differentiation) but not constants; in fact, every definable subset of $\R^n$ is semialgebraic.

Theory of ordered exponential field

The $\langle+,\times,\exp,< \rangle$ theory of $\mathbb^$ is that of the exponential real ordered exponential field $(\R,+,\times,\exp,<)$, which is model complete by Wilkie's theorem.

Hardy fields

$\mathbb_\mathrm$ is the field of accelero-summable transseries, and using accelero-summation, we have the corresponding Hardy field, which is conjectured to be the maximal Hardy field corresponding to a subfield of $\mathbb$. (This conjecture is informal since we have not defined which isomorphisms of Hardy fields into differential subfields of $\mathbb$ are permitted.) $\mathbb_\mathrm$ is conjectured to satisfy the above axioms of $\mathbb$. Without defining accelero-summation, we note that when operations on convergent transseries produce a divergent one while the same operations on the corresponding germs produce a valid germ, we can then associate the divergent transseries with that germ.

A Hardy field is said ''maximal'' if it is properly contained in no Hardy field. By an application of Zorn's lemma, every Hardy field is contained in a maximal Hardy field. It is conjectured that all maximal Hardy fields are elementary equivalent as differential fields, and indeed have the same first order theory as $\mathbb^$. Logarithmic-transseries do not themselves correspond to a maximal Hardy field for not every transseries corresponds to a real function, and maximal Hardy fields always contain transsexponential functions.Boshernitzan, Michael, ''Hardy fields and existence of transexponential functions'', In ''aequationes mathematicae'', vol. 30, issue 1, pp. 258–280, 1986.

See also

* Formal power series
* Hahn series
* Exponentially closed field
* Hardy field

References

* .
* {{Citation , last1 = Aschenbrenner , first1 = Matthias , last2 = Dries , first2 = Lou van den, last3 = Hoeven , first3 = Joris van der , title = On Numbers, Germs, and Transseries , date = 2017 , arxiv = 1711.06936 , bibcode = 2017arXiv171106936A .

Asymptotic analysis
Mathematical series
Exponentials
Logarithms