This paper discusses the structure of transseries, focusing on ratio sets, grids, and witnesses, highlighting open questions and gaps in the current theoretical framework.
Contribution
It introduces the concept of witnesses in the grid-based formulation of transseries and explores related questions and missing proofs.
Findings
01
Analysis of ratio sets and grids in transseries
02
Introduction of the witness concept for tracking ratios
03
Identification of open questions and gaps in proofs
Abstract
More remarks and questions on transseries. In particular we deal with the system of ratio sets and grids used in the grid-based formulation of transseries. This involves a "witness" concept that keeps track of the ratios required for each computation. There are, at this stage, questions and missing proofs in the development.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Formal Methods in Verification · Logic, programming, and type systems
Full text
Transseries: Ratios,
Grids, and Witnesses
G. A. Edgar
Abstract
More remarks and questions on transseries. In particular
we deal with the system of ratio sets and grids used in the
grid-based formulation of transseries. This involves
a “witness” concept that keeps track of the ratios required
for each computation. There are, at this stage, questions and
missing proofs in the development.
Most of the definitions and computations with transseries
found in [7] (see “Review” below)
were done in the “grid-based” setting.
But often the use of the ratio set was just a hint or an aside.
Here we will carry out these constructions more completely.
This is also an attempt to derive results in a manner
continuing the elementary approach of [7]. So in
some cases I am attempting alternate proofs for results that already
exist in the literature.
I am using the totally ordered monomial group G. Maybe
there should be separate consideration of the parts that are
valid for partially ordered (or quasi-ordered) monomial group.
This would be useful if (when) we have to discuss \mathbb{R}\begin{picture}(10.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(4.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){7.0}}
\put(0.0,9.0){\line(1,0){7.0}}
\end{picture}x,y\begin{picture}(9.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(7.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){7.0}}
\put(0.0,9.0){\line(1,0){7.0}}
\end{picture}.
Review
The differential field T of transseries is completely explained in
my recent expository introduction [7]. Other
sources for the definitions are:
[1], [2], [6], [11].
I will generally follow
the notation from [7].
Write P={S∈T:S≻1,S>0} for the set of
large positive transseries. The operation of
composition T∘S is defined for T∈T, S∈P.
The set P is a group under composition
([11, § 5.4.1], [6, Cor. 6.25],
[8, Prop. 4.20].
Both notations T∘S and T(S) will be used.
We write G for the ordered group of transmonomials.
We write GN,M for the transmonomials with
exponential height N and logarithmic depth M.
We write GN for the log-free transmonomials with height N.
Let lm=loglog⋯logx with m logarithms.
A ratio set μ is a finite subset of Gsmall;
Jμ is the group generated by μ.
If μ={μ1,⋯,μn}, then
Jμ={μk:k∈Zn}.
If m∈Zn, then
Jμ,m={μk:k∈Zn,k≥m}
is a grid. A grid-based transseries is supported
by some grid. A subgrid is a subset of a grid.
If T\in\mathbb{T}=\mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{G}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}, then
the support suppT is a subgrid.
Recall [7] some of the reasons for using
the grid-based field \mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{M}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture} instead of the
full well-based Hahn field R[[M]]:
(i)
The finite ratio set is conducive to computer
calculations.
2. (ii)
Problems from analysis almost always
have solutions in this smaller system.
3. (iii)
Some proofs and formulations of definitions
are simpler in one system than in the other.
4. (iv)
Perhaps (?) the analysis used for Écalle–Borel
convergence can be applied only to grid-based series.
5. (v)
In the well-based case, the domain of exp
cannot be all of R[[M]].
6. (vi)
The grid-based ordered set \mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{M}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture} is a
“Borel order,” but the well-based ordered set R[[M]] is not.
2 Framework
When A=L+c+S with L purely large, c∈R, S small,
write L=largeA, c=constA, and S=smallA.
For A,B⊆G, write
AB={ab:a∈A,b∈B}. And for g∈G, write
gB:={g}B={gb:b∈B}.
Remark 2.1*.*
For g∈G and A∈T, we have
supp(gA)=gsuppA. But for A,B∈T,
we have only
supp(AB)⊆suppAsuppB, and not necessarily
equality, because of possible cancellation. If all coefficients
are ≥0 then there is no cancellation.
Let μ={μ1,⋯,μn}⊂Gsmall be a ratio set.
Write μ∗ for the set of words and μ+ the set
of nonempty words over μ (the monoid and semigroup,
respectively, generated by μ). That is,
[TABLE]
Empty-set conventions say: ∅∗={1} and
∅+=∅.
The grids Jμ,m may then be written
Jμ,m=μmμ∗.
In [11], the definition of grid is
more general: a set of the form gμ∗. But in this totally ordered
setting, we have the following.
Proposition 2.2**.**
Let g∈G and let α⊂Gsmall be finite.
Then there is finite μ⊂Gsmall
and m∈Zn such that gα∗⊆Jμ,m.
So, subgrid (that is, a subset of some grid) has the same meaning for
each of the two definitions of “grid.”
If g=1, let μ=α and m=0 so that μm=g.
If g≺1,
let μ=α∪{g}, and let m have a single nonzero component
1 so that μm=g. If g≻1,
let μ=α∪{g−1}, and let m have a single nonzero
component −1 so that μm=g.
∎
When he allows a partially ordered G, van der Hoeven [11] defines
a grid as a finite
union of sets of the form gμ∗. But
in our (totally ordered) case
that is taken care of by the following.
Proposition 2.3**.**
Given any two grids, there is a third grid that contains them both.
Proof.
([6, Lemma 7.8].)
Let Jμ,m and Jν,n be grids.
If we define α=μ∪ν and extend m and n
with [math]s in the new components, the two grids are contained
respectively in Jα,m and Jα,n.
Then, let p be the componentwise minimum of m and n,
so that both of these grids are contained in Jα,p.
∎
The partial well order property of Zn is
used for the next result. This result turns out to be very useful.
It looks simple (and it is), but it is essential for the
theory. (The name will be explained below.)
Theorem 2.4** (Subgrid Witness Theorem).**
Let A⊆Jμ,m be a nonempty subgrid.
Let g=maxA. Then there is a ratio set
α⊂Jμ
such that A⊆gα∗.
Proof.
(See [4, 4.198],
[6, Lemma 7.8],
[11, Proposition 2.1].)
Let F:={k∈Zn:k≥m,μk∈A}. Then
the set MinF of minimal elements of F is finite.
Now g=maxA so g=μp for some p∈MinF. Let
[TABLE]
[So α consists of μ together with a finite number
of additional monomials, all elements of Jμ.]
We claim A⊆gα∗.
Indeed, let n∈A, say n=μn where n∈F.
Then there is k∈MinF so that k≤n.
Now μk/g∈α, so μk∈gα⊆gα∗.
And n/μk=μn−k∈μ∗⊆α∗. So
n∈gα∗α∗=gα∗.
∎
Order, Far Larger
Let μ⊂Gsmall be a (finite) ratio set.
Let m,n∈G. Then:
[TABLE]
We may rephrase this:
[TABLE]
Of course m≺n if and only if there exists μ
such that m≺μn.
Let A,B⊆G be two sets.
Then [7, Def. 4.12] we say A≺μB iff:
for every a∈A there exists b∈B with a≺μb,
and we say Bμ-dominatesA. So
[TABLE]
Similarly, define:
[TABLE]
The corresponding non-generator definition could be: A≺B iff
for every a∈A there exists b∈B with a≺b.
Of course A≺μB⟹A≺B. But:
Example 2.5*.*
Let A={x−1/2,x−2/3,x−3/4,x−4/5,⋯},
B={1}. Then A≺B, but
there is no finite μ⊂Gsmall
such that A≺μB.
Let A,B∈T. Then we say
A≺μB iff suppA≺μsuppB; we say
A≼μB iff suppA≼μsuppB; we say
A≍μB iff suppA≍μsuppB.
Proposition 2.6**.**
Let A,B∈T. Then:
A≺B if and only if there exists μ such that
A≺μB.
Proof.
The grid-based definitions must be used:
By Theorem 2.4 there is α such that
A≼αmagA.
And magA≺magB,
so there is β
such that magA≺βmagB. Taking the union
μ=α∪β, we get
A≺μB.
∎
Witnesses and Generators
If A≺μB, we may say that μ is a witness
for A≺B, or that μwitnessesA≺B.
A given pair A,B may of course have many
different witnesses. If m,n∈G and m≺n,
then it is witnessed by the singleton {m/n}.
Similarly, if A≼μB, we say μ is
a witness for A≼B; if A≍μB, we
say μ is a witness for A≍B.
For some purposes (such as computer algebra calculation) it may be
desirable to provide a witness for every assertion
A≺B. In [7] we talked of keeping track
of generators, and providing addenda for the set
of generators. Here, we will be doing this more
systematically.
Other “witness” terminology: If A⊆G is a
subgrid, we say that α is a witness for A if
A⊆gα∗, where g=maxA.
Theorem 2.4 says that every subgrid has a witness.
(And of course this is the reason
we call it the Subgrid Witness Theorem.)
If T∈T, then we say that α is a
witness for T if α is a witness for suppT
in the sense just defined.
Thus: if T=0,
then α is a witness for T if and only if
α is a witness for T≼magT.
That is, α is a witness for ag(1+S)
[where a∈R, a=0, g∈G, S∈T, S≺1]
iff S≺α1. Given μ
with suppT⊆Jμ,m, to produce
a witness for T we may need to augment μ with
a smallness addendum for S. Also note the extreme case:
if A={g} is a singleton, then ∅ witnesses A.
For a subgrid A⊆G
we will say μgeneratesA iff A⊆Jμ,m
for some m. And for a transseries A we will say μgeneratesA iff μ generates suppA. There are two conditions:
(i)
μ generates A
2. (ii)
μ witnesses A
They are
related but not the same. If μ witnesses A, we may need
to add a generator for the monomial magA to get a generator
for A. On the other hand,
the usual example 1+xe−x is generated by {x−1,e−x}
but not witnessed by it. A witness can be obtained using a smallness
addendum xe−x.
Notation 2.7*.*
Tβ denotes the set of transseries generated by β;
αT denotes the set of transseries witnessed by α;
αTβ denotes the set of transseries witnessed by α
and generated by β.
Remark 2.8*.*
Closure properties. (See Section 3.)
The set Tβ is closed under sums and products,
but in general not quotients. The set αT is closed under
products and quotients; but in general not sums. The set αTβ
is closed under products, but in general not sums
or quotents. The set αTα is closed under
products and quotents, but in general not sums.
Example 2.9*.*
If A∼B and B≺μC, it need not follow that
A≺μC. For example:
μ={x−1,e−x}, A=x−1+xe−x, B=x−1, C=1.
Proposition 2.10**.**
Let A,B,C∈T and let μ be a ratio set.
If A∼B, B≺μC and μ witnesses A,
then A≺μC.
Proof.
Let a∈suppA. Then a≼μmagA=magB≺μC.
∎
Example 2.11*.*
If A≺μB and B∼C, it need not follow that
A≺μC. For example:
μ={x−1,e−x}, A=xe−x,
B=1+x2e−x, C=1.
Proposition 2.12**.**
Let A,B,C∈T and let μ be a ratio set.
If A≺μB, B∼C, and
μ witnesses B, then A≺μC.
Proof.
Let a∈suppA. Then there is b∈suppB
with a≺μb≼μmagB=magC.
∎
A natural partial order for ratio sets is inclusion of the generated
semigroups. Let α,β be ratio sets. The following are equivalent:
(i)
α∗⊇β∗
2. (ii)
α+⊇β+
3. (iii)
α∗⊇β
4. (iv)
For all A,B∈T, if A≺βB, then A≺αB.
Exponent Subgrids
Lemma 2.13** (Support Lemma).**
If U_{1},\cdots,U_{n}\in\mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{G}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}, then among the linear
combinations
[TABLE]
there are only finitely many different magnitudes.
Proof.
There are at most n different magnitudes among the
real linear combinations of U1,⋯,Un.
Indeed, the set of real linear
combinations has dimension at most n. If possible,
let V1,⋯,Vn+1 be linear combinations
of U1,⋯,Un with
magV1>magV2>⋯>magVn+1. Then,
since they are linearly dependent, there is some k
such that Vk belongs to the linear span of
{Vk+1,⋯,Vn+1}. But then
magVk≤max{magVk+1,⋯,magVn+1},
a contradiction.
∎
Lemma 2.14**.**
Let A⊆G be a subgrid. Let
A1:=⋃suppL where the union is over
all L such that eL∈A. Then A1⊂Glarge
is also a subgrid.
Proof.
There is μ={μ1,⋯,μn} and m∈Zn
with A⊆Jμ,m. Write
μi=eLi, where L_{i}\in\mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{G}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}
is purely large. Then for any eL∈A,
the logarithm L belongs to
W:={∑i=1npiLi:p∈Zn}.
So
[TABLE]
is contained in a finite union of subgrids and is therefore a subgrid itself.
∎
Definition 2.15*.*
Call A1 the exponent subgrid of A.
There is a variant for use with log-free transseries and subgrids.
Lemma 2.16**.**
Let A⊆G∙ be a subgrid. Let
A1:=⋃suppL where the union is over
all L such that xbeL∈A. Then A1⊂G∙large
is also a subgrid.
Proof.
There is μ={μ1,⋯,μn} and m∈Zn
with A⊆Jμ,m. Write
μi=xbieLi, where bi∈R and L_{i}\in\mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{G}_{\bullet}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}
is purely large. Proceed as before.
∎
Remark 2.17*.*
Let A be a log-free subgrid. If A⊂GN, N≥1,
then A1⊂GN−1. If A⊂G0,
then A1=∅.
Definition 2.18*.*
Call A1 the log-free exponent subgrid of A.
If T∈T∙, then the log-free exponent subgrid
of suppT is also called the log-free exponent subgrid
of T. If μ⊂G∙small is a ratio set, it
is a finite set, so it is a subgrid. So we will
sometimes refer to the log-free exponent subgrid of
a ratio set μ
(which is equal to the log-free exponent subgrid of
any grid Jμ,m).
Definition 2.19*.*
An exponent generator for a subgrid A⊂G∙ is a
ratio set α such that: α is contained in the subgroup
generated by the log-free exponent subgrid of A
and L∈Tα for all L with xbeL∈A. We say “an”
exponent generator since there is more than one possibility.
Of course, if A⊂GN, then α⊂GN−1.
Heredity Addendum
A “heredity addendum” is mentioned in [7].
Now we will discuss it more fully.
Definition 2.20*.*
Let B⊆G∙ be a log-free subgrid.
Then B is hereditary iff, for all
xbeL∈B with b∈R and L∈T purely large
log-free, we have suppL⊆B.
Proposition 2.21**.**
Let A⊆G∙ be a log-free subgrid.
There is a hereditary log-free subgrid B such that
B⊇A and the height of B is the
same as the height of A.
Proof.
The proof is by induction on the height.
Suppose first that A has height [math], so
A⊆G0={xb:b∈R}.
Take B=A.
If xbeL∈A, then L=0, so suppL⊆A
vacuously.
Now suppose A⊆GN, N>0, and the result is
known for height N−1. Let A1 be the
log-free exponent subgrid of A. So A1⊆GN−1,
and there is a hereditarty log-free subgrid
B1⊆GN−1 with B1⊇A1.
Let B=A∪B1.
Then B⊇A is a log-free subgrid of height N.
I must show B is hereditary.
Let xbeL∈B. If xbeL∈A,
then suppL⊆A1⊆B.
If xbeL∈B1, then
suppL⊆B1⊆B.
So B is hereditary. This completes the induction.
∎
Remark 2.22*.*
Let A and B be hereditary log-free subgrids.
Then A∪B and A⋅B∪A∪B are also
hereditary log-free subgrids.
Remark 2.23*.*
Let μ={xb1eL1,⋯,xbneLn}
be a log-free ratio set. Then Jμ,m
is hereditary iff suppLi⊆Jμ,m
for 1≤i≤n. If
[TABLE]
then Jμ,m is hereditary for some m, and in that
case we may abuse the above terminology and
say simply that μ is hereditary.
Proposition 2.24**.**
Let μ be a hereditary log-free ratio set.
Let T∈T. If suppT⊆Jμ, then
supp(xT′)⊆Jμ and
\operatorname{supp}\big{(}(xT)^{\prime}\big{)}\subseteq\mathfrak{J}^{\boldsymbol{\mu}}. Assume also that
x−1∈Jμ.
If suppT⊆Jμ,
then supp(T′)⊆Jμ.
Proof.
We first consider xT′. This is proved by induction on
the height. First consider height [math]. If
g∈Jμ, g∈G0, say g=xb, then
g′=bxb−1 and xg′=bg, so
supp(xg′)⊆Jμ. If
suppT⊆Jμ∩G0,
then
[TABLE]
Assume it is true for height N−1. If g∈Jμ,
g∈GN, say g=xbeL, then
g′=(bx−1+L′)g and xg′=(b+xL′)g. By
the induction hypothesis, supp(xL′)⊆Jμ.
Since Jμ is closed under multiplication, we have
supp(xg′)⊆Jμ. If
If suppT⊆Jμ∩GN, then
add as before.
Next consider (xT)′. We have (xT)′=T+xT′, and
both terms have support in Jμ, so also
supp((xT)′)⊆Jμ.
In case x−1∈Jμ, when we have
supp(xT′)⊆Jμ we will also get
supp(T′)⊆Jμ.
∎
3 Beginning Witnesses
We begin with the basic things to be checked concerning the ratio sets.
Some of them were already spelled out in [7].
If A,B are subgrids, then so are
A∪B and A⋅B. Thus: if S,T∈T, then so are
S+T and ST.
Proposition 3.2**.**
If μ generates both S and T,
then μ generates S+T and ST.
Proposition 3.3**.**
If μ witnesses both S and T,
then μ also witnesses ST.
Remark 3.4*.*
But possibly not S+T:
For example, S=x+1, T=−x+xe−x, μ={x−1,e−x}.
Proposition 3.5**.**
If μ witnesses both S≺1 and T≺1, then
μ witnesses ST≺1 and S+T≺1.
Multiply Far-Greater Relations
It was noted in [7] that
A≺μB need not imply AS≺μBS,
even if μ generates A,B,S. The “witness”
concept can overcome this.
Proposition 3.6**.**
Let A,B,S∈T. Assume μ witnesses
either B or S.
If A≺μB, then AS≺μBS.
If A≼μB, then AS≼μBS.
Proof.
Let m∈supp(AS). Then there exist a0∈suppA
and g0∈suppS with m=a0g0. There is
b0∈suppB with a0≺μb0. Let
[TABLE]
which exist because these supports are well ordered.
Now we have assumed that μ witnesses either B or S.
The two cases are similar, so assume μ witnesses S.
Then g1=magS.
Let n=b1g1. I claim n∈supp(BS). Assume not:
it must be because of cancellation in the product BS. So
there exist b2∈suppB and g2∈suppS
so that b1g1=b2g2 but b1=b2
and g1=g2. Now g1=magS and μ witnesses S,
so g2≺μg1. That means g2/g1∈μ+.
But b1/b2=g2/g1, so b1≺μb2,
which contradicts the maximiality of b1. This contradiction
shows that n∈supp(BS). Now
[TABLE]
so m≺μn. Therefore AS≺μBS.
The second assertion is proved similarly.
∎
Example 3.7*.*
False in general: A1≺μA2,B1≺μB2⟹A1B1≺μA2B2. (It is
true for monomials.) Take
μ={x−1,e−x}. Then
[TABLE]
Proposition 3.8**.**
Let A1,A2,B1,B2∈T, let μ be a ratio set.
Assume A1≺μA2, B1≺μB2, and
μ witnesses B2. Then A1B1≺μA2B2.
Proof.
Apply Proposition 3.6 twice:
A1B1≺μA1B2 and A1B2≺μA2B2.
∎
Laurent Series
If α witnesses S and S≺α1, then
α witnesses (and generates)
the sum A=∑j=p∞ajSj. If p≥1, then
α witnesses A≺1.
Let S1≺1,⋯,Sm≺1. Assume αi witnesses
Si≺1 for 1≤i≤m. Consider the sum
[TABLE]
If the “leading coefficient” cp1p2…pm is not zero,
then β:=⋃j=1mαj witnesses A. But as with a finite sum,
an addendum may be required in general.
Proposition 3.9**.**
Let A=0 and assume α witnesses A.
Then α witnesses A−1. And
α witnesses Ab for any b∈R.
Proof.
Write A=aeL(1+S) [with a∈R, a=0,
L purely large, S small] so α witnesses
S≺1, and
[TABLE]
so α witnesses Ab.
∎
Remark 3.10*.*
A generator for Ab is
α∪{e±bL}, the sign chosen so that the monomial
is small.
If bL<0, then α∪{ebL} witnesses Ab≺1.
Remark 3.11*.*
Let α be a ratio set.
Then {A∈T:A=0,α witnesses A} is closed under
products and quotients.
Logarithm and Exponential
Proposition 3.12**.**
Let A=aeL(1+S), where a∈R, a>0,
L is purely large, S is small. If α witnesses L and
β witnesses S≺1, then
[TABLE]
Also: μ generates logA; β witnesses small(logA)≺1;
if A∼1, then β witnesses logA≺1;
if A≍1, then β witnesses and generates logA.
Note: If A≍1, then logA≻1.
Proposition 3.13**.**
Let A=L+c+S, where L=largeA, c=constA,
and S=smallA. If α witnesses S≺1, then
α witnesses
[TABLE]
and μ:=α∪{e±L} generates eA.
If L<0(that is, A is large and negative), then
μ:=α∪{eL} witnesses eA≺1.
Series
If S=∑Ai is μ-convergent, then of course
there is a witness for S. But is there a single
witness for all the terms Ai?
In general, there is no such witness.
Example 3.14*.*
Let μ={x−1,e−x} and for j∈N let
Aj=x−2j+x−j−1e−x:
[TABLE]
Of course S=∑Aj is μ-convergent, since in that sum
each monomial occurs at most once. And μ witnesses S. Now
A_{j}=x^{-2j}\big{(}1+x^{j-1}e^{-x}\big{)}, so if
α witnesses Aj, then xj−1e−x≺α1.
But since the set {xj−1e−x:j∈N} is not
well-ordered, it is not contained in any grid, and in particular
it is not contained in α+.
Geometric Convergence
There is a “more rapid” type of convergence for series (and sequences).
Compare it to “pseudo convergence” commonly used in valuation theory
[9].
The terms of the series decrease at a rate specified
by a ratio set μ. [The “ratio” in the name comes
from this usage: the ratio of consecutive terms in a series.]
Definition 3.15*.*
Let μ be a ratio set. Let Aj∈T for j∈N.
The series ∑j=1∞Aj is said to be
μ-geometrically convergent
if μ witnesses Aj and Aj≻μAj+1 for
all j.
A series is said to be geometrically convergent
if it is μ-geometrically convergent for some μ.
Example 3.14 is convergent but not geometrically convergent.
Proposition 3.16**.**
Assume ∑Aj is μ-geometrically convergent.
Then: All Aj are supported by the subgrid (magA1)μ∗.
The series ∑Aj converges in the point-finite sense.
The sum S=∑Aj is witnessed by μ and S∼A1.
Definition 3.17*.*
A sequence Sj,j=1,2,3,⋯ is said to be
μ-geometrically Cauchy if μ witnesses Sj+1−Sj
and Sj+1−Sj≻μSj−Sj−1 for all j.
(Compare this to the usual “pseudo Cauchy” [9].)
This means the series ∑j=1∞(Sj+1−Sj)
is μ-geometrically convergent in the sense above. And of course
Sj converges in the asymptotic (Costin) topology.
Definition 3.18*.*
Let Sj,S∈T. We say the sequence Sj is μ-geometrically
convergent to S if
μ witnesses S−Sj and S−Sj≻μS−Sj+1
for all j. (It follows that Sj→S.
Of course Sj−S∼Sj−Sj+1
follows, so this is also pseudo convergence.)
Proposition 3.19**.**
Let Sj be μ-geometrically Cauchy. Then there is S
so that Sj converges μ-geometrically to S.
Proof.
Let Sn=∑j=1nAj, so that T=∑j=2∞Aj
is μ-geometrically convergent. So
Sn converges to S=S1+T. Now
S−Sn=∑j=n+1∞Aj, which is μ-geometrically
convergent, so μ witnesses S−Sn and
S−Sn∼An+1. Also
S−Sn∼An+1≻μS−Sn+1, so
S−Sn≻μS−Sn+1 by Proposition 2.12.
∎
Remark 3.20*.*
The usual version of this in valuation theory would be:
the series ∑Aj is pseudo Cauchy
iff Aj≻Aj+1 for all j. The sequence
Sn is pseudo Cauchy iff
Sj−Sj−1≻Sj+1−Sj for all j.
(This is often also used for sequences indexed by ordinals.)
The sequence Sj is pseudo convergent to S iff
S−Sj∼Sj+1−Sj for all j. This will be the useful
notion only for well based transseries spaces.
For example, ∑j=1∞x−logn is pseudo Cauchy,
but its sum is not grid based.
Also: pseudo convergence does not imply convergence (in any
of the three senses of [8, Sec. 6]). For example
Sj=x−jex+xje−x is pseudo convergent to [math].
Also, in the well-based case, where T⊊R[[G]],
there exist pseudo Cauchy sequences in T with pseudo limits
only in R[[G]]∖T.
Lemma 3.21** (Summation Lemma).**
Let μ⊂Gsmall be a ratio set.
Assume μ witnesses V, the series S=∑Bj
converges μ-geometrically, μ witnesses
Aj, and Aj∼BjV for j=1,2,3,⋯.
Then T=∑Aj converges μ-geometrically
and T∼SV.
Proof.
By definition μ witnesses Bj and
Bj≻μBj+1 for all j.
By Proposition 3.3μ witnesses BjV.
By Proposition 3.6μ witnesses
BjV≻μBj+1V. So
Aj∼BjV≻μBj+1V∼Aj+1,
and by Propositions 2.10 and 2.12,
Aj≻μAj+1. So T=∑Aj
converges μ-geometrically. Finally,
magT=magA1=mag(B1V)=magB1magV=magSmagV=mag(SV)
so T∼SV.
∎
Geometric Convergence of Multiple Series
Geometric convergence of series adapts well to multiple series.
Definition 3.22*.*
Let n≥2 be an integer. An n-fold multiple series
is a series indexed by Nn:
[TABLE]
Let μ be a ratio set. We say the n-fold multiple series
∑Ap is μ-geometrically convergent iff:
μ witnesses Ap for all p∈Nn,
A0=0, and
for all p,q∈Nn, if p<q, Ap=0,
and Aq=0, then Ap≻μAq.
Remark 3.23*.*
A grid-based transseries is, of course, the primary example of this.
Let T∈μT.
Write μ={μ1,⋯,μn}
with μ1≻⋯≻μn.
Then suppT⊆mμ∗={mμp:p∈Nn}
where m=magT. And the “formal” series
[TABLE]
is a μ-geometrically convergent n-fold multiple series.
(If the representation of g as mμp is unique,
then the coefficient ap must be T[mμp]. But if
it is not unique, then there is more than one choice
for the coefficients.)
Proposition 3.24**.**
Assume ∑Ap is μ-geometrically convergent. Then all
Ap are supported by the subgrid (magA0)μ∗.
The series ∑Ap converges in the point-finite sense.
The sum S=∑Ap is witnessed by μ and S∼A0.
Lemma 3.25** (Multiple Summation Lemma).**
Let μ⊂Gsmall be a ratio set.
Assume μ witnesses V, the series S=∑Bp
converges μ-geometrically, μ witnesses
Ap, and Ap∼BpV for all p∈Nn.
Then T=∑Ap converges μ-geometrically
and T∼SV.
The proof of Lemma 3.21 adapts with no difficulty.
4 Derivative
[7, Prop. 3.114(a)] states
m≺n⟹m′≺n′ for monomials m,n.
Here is the “witness” version.
Proposition 4.1**.**
Let μ⊂Gsmall be a ratio set.
Then there is a ratio set α such that:
(a)α∗⊇μ;
(b) if m∈Jμ, then m′∈αTα;
(c) for all m,n∈Jμ, if m≺μn
and n=1, then m′≺αmag(n′),
so that m′≺αn′.
Proof.
(I) We begin with the case where μ⊆GN,−1small, N≥1.
That is, every monomial μi∈μ has the form
eLi with L_{i}\in\mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{G}_{N-1}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture} purely large and log-free.
Order μ={μ1,⋯,μn} as usual so that
1≻μ1≻μ2≻⋯≻μn.
So 0>L1>L2>⋯>Ln and thus
L1≼L2≼⋯≼Ln
and L1′≼L2′≼⋯≼Ln′
[the Li are large, so do not have magnitude 1].
Let 1≤j≤n, P=∑i=1npiLi′, and
Q=∑i=1nqiLi′,
pi,qi∈Z. If Q≼Lj′ and P≼Lj′, then
Qμj≺P by
“Height Wins” [7, Prop. 3.72], since
μj=eLj has greater height than both Lj and Lj′.
Write
[TABLE]
By the Support Lemma 2.13,
{mag(Q):Q∈W} is a finite set of monomials.
So we may define α so that
α∗⊇μ and:
(i)
α generates magQ for all Q∈W
2. (ii)
α witnesses Q for all Q∈W
[by (i) and (ii), α generates all Q∈W]
3. (iii)
α witnesses mag(P)≻mag(Q)μj
for all j, 1≤j≤n, and all P,Q∈W
such that Q≼Lj′ and P≼Lj′.
Claim: if 1≤j≤n, P,Q∈W, and Q−P≼Lj′,
then mag(P)≻αmag(Q)μj. Indeed, in case Q≼Lj′
it follows that P≼Lj′ also and the claim follows from (iii).
In the other case Q≻Lj′ it follows that
P≍Q so that mag(P)≻μmag(P)μj=mag(Q)μj.
(a) holds by construction.
(b) Let m∈Jμ. Then the derivative is
[TABLE]
[We used notation m†=m′/m for the logarithmic derivative of m.]
Now m†∈W so, as noted, α generates and
witnesses m†.
Thus α generates and witnesses m′=m†m.
(c) Now let m,n∈Jμ with m≺μn
and n=1. Say m=μp, n=μq,
with p>q in Zn. The derivatives are:
[TABLE]
Let j be largest such that pj=qj.
Then m†−n† is a linear combination of
L1′,⋯,Lj′, and thus m†−n†≼Lj′.
So mag(n†)≻αmag(m†)μj.
If g∈supp(m′), then g=g1m where g1∈supp(m†);
and m†∈W, so g1≼αmag(m†)
by (ii). Also m/μj≼μn since pj>qj. Thus:
[TABLE]
This shows m′≺αmag(n′) and thus that
m′≺αn′.
(II) Now let μ be any ratio set. Say μ⊂GN,M−1,
N≥1,M≥1. Since Gn,m⊆Gn+1,m+1 where we
identify g∘logm∈Gn,m with
(g∘exp)∘logm+1∈Gn+1,m+1, this includes the
general case. Given such μ, define
[TABLE]
so that μ⊂GN,−1. Construct the corresponding
ratio set α from μ as in (I).
Then define
α:={g∘logM:g∈α}∪{lM′}. Recall that
lM′ is a small monomial, since it is a finite product
of the form (xlogxlog2x⋯)−1.
(a) Of course α∗⊇μ since
α∗⊇μ.
(b) Let m∈Jμ. Then m=m∘logM
where m∈Jμ~. So by (I)
α generates and witnesses m′, and therefore
α generates and witnesses m′∘logM. But
[TABLE]
and logM′∈α, so α generates and witnesses m′.
(c) Now let m,n∈Jμ with m≺μn
and n=1. Then m=m∘logM,
n=n∘logM, where
m,n∈Jμ~ with
m≺μ~n,
n=1. So by (I) we have
m′≺α~n′.
Therefore
[TABLE]
as required.
∎
Definition 4.2*.*
We will say that α is a derivative addendum for μ.
For example, if μ={x−1},
then there is no finite ratio set α such that
(x−1n)′≺αn′ for all n∈G. We can see
this by considering n=expk for k=1,2,3,⋯.
Proposition 4.5**.**
If μ⊂GN,M, then the derivative addendum
α may be chosen so that α⊂GN,M+1.
Proof.
Examine the proof to see first: if μ⊂GN,−1,
then α⊂GN.
∎
Remark 4.6*.*
Consider a grid Jμ,m. In the preceding proposition,
if n∈Jμ,m, then
suppn′⊆Jα,m,
where m is chosen so that
mag((μm)′)=αm. This works as long
as m=0. Now consider the grid Jμ,0.
Of course Jμ,0⊆Jμ,m, where
m=(−1,0,⋯,0).
So choose m
where mag((μ1−1)′)=αm.
[Recall that α witnesses (μ1−1)′.]
Proposition 4.7**.**
Let μ be a ratio set, and let α be a derivative
addendum for μ as in
Proposition 4.1.
Let ∑i∈ITi be μ-convergent.
Then ∑Ti′ is α-convergent.
Proof.
There is a grid Jμ,m that supports all Ti,
so by Remark 4.6 there is a grid Jα,m
that supports all Ti′. So it remains to show that the series
∑Ti′ is point-finite. Suppose, to the contrary, that
there is g such that A={i∈I:g∈supp(Ti′)} is infinite.
For i∈A there is n∈supp(Ti) with g∈supp(n′).
Since ∑Ti is point-finite, there are infinitely many
different n∈⋃supp(Ti) with g∈supp(n′).
This is contained in a grid Jμ,m, so
there is an infinite sequence n1≻μn2≻μ⋯
of such monomials. (Of course 1 is not in this sequence.)
But then by Proposition 4.1,
n1′≻μn2′≻μ⋯. So the sequence
supp(n1′),supp(n2′),⋯
is point-finite by [7, Prop. 4.17].
So in fact g cannot belong to all of them.
This contradiction completes the proof.
∎
Proposition 4.8**.**
Let μ be a ratio set, and let α be a derivative addendum
for μ as
defined in Proposition 4.1. For all
S,T∈Tμ, if S≺μT,
T≍1, and μ witnesses T,
then S′≺αT′.
Proof.
Let m∈supp(S′). Then there is a∈suppS
with m∈supp(a′). There is b∈suppT
with a≺μb. Since μ witnesses T,
b≼μmagT. So a≺μmagT.
Then a′≺α(magT)′
by Proposition 4.1(c). There is
n∈supp((magT)′) with m≺αn.
But magT∈Jμ, so
α witnesses (magT)′ by Proposition 4.1(b).
Thus n≼αmag((magT)′) and therefore
m≺αmag((magT)′)=mag(T′)∈supp(T′).
This shows S′≺αT′.
∎
Example 4.9*.*
The hypothesis “μ witnesses T” cannot be omitted
in Proposition 4.8. Let μ={x−1,e−x}.
Consider S=x−1 and T=x−jex+1 for any j∈N.
We have μ witnesses and generates S, μ generates T,
but μ does not witness T. Of course S≺μT
since x−1≺μ1. Compute
[TABLE]
Now assume there is a ratio set α
such that S′≺αT′ for all j∈N. This would mean
[TABLE]
belongs to α+ for all j, which is impossible since
α+ is well-ordered for the reverse of ≺.
Proposition 4.10**.**
Let μ be a ratio set, and let α be a derivative addendum
for μ as
defined in Proposition 4.1.
If μ generates T then α generates T′.
If μ generates and witnesses T and T≍1, then
α witnesses T′.
Proof.
Assume μ generates T.
If m∈suppT, then m∈Jμ, so
suppm′⊆Jα by Proposition 4.1(b).
This holds for all m∈suppT, so
suppT′⊆Jα. That is,
α generates T′.
Now assume μ generates and witnesses T and T≍1.
Let g∈supp(T′). Then
g∈supp(m′) for some m∈supp(T).
Now μ witnesses T, so m≼μmag(T).
Then by Proposition 4.1,
m′≼α(magT)′∼mag(T′), so
m′≼αmag(T′) since α witnesses m′.
But g∈supp(m′),
so g≼αmag(T′).
∎
Example 4.11*.*
The case T≍1 is not included in Proposition 4.10.
It is false:
Let μ={x−1,x−2}. Then α=μ,
and
[TABLE]
Let T=1+x−1+x−2. Then μ witnesses
T, since x−1,x−2∈μ∗. So
T′=−x−2−2x−1−2=−x−2(1+2x1−2).
But μ does not
witness T′ since x1−2∈μ∗.
Even more is true: There is no ratio set α such that
α witnesses T′ for all T witnessed by {x−1,x−2}.
Indeed, {x−1,x−2} witnesses every transseries
T=1+x−j+x−k2 with j,k∈N, while
there exist pairs (j,k)∈N2 with j−k2
negative but as close as we like to [math].
Proposition 4.12**.**
Let μ be a ratio set, and let α be a derivative addendum
for μ. Assume series ∑j=1∞Aj
is μ-geometrically convergent, μ generates A1,
and A1≍1. Then
∑j=1∞Aj′ is α-geometrially convergent.
Proof.
Now μ witnesses and generates all Aj, so α
witnesses Aj′. If some Aj≍1, omit it.
Then Aj′≻αAj+1′, so ∑Aj′
is α-geometrically convergent.
∎
Proposition 4.13**.**
Let μ be a ratio set, and let α be a derivative addendum
for μ. Assume multiple series ∑Ap
is μ-geometrically convergent, μ generates A0,
and A0≍1. Then
∑Ap′ is α-geometrially convergent.
5 Composition
Now we will consider a composition T∘S=T(S). Here
T,S∈P are large and positive.
Let L be purely large (so that g=eL is a monomial). By 3.13,
a witness for g∘S=eL∘S is
a witness for small(L∘S)≺1. A ratio set
for eL∘S may be constructed as this witness together with
one more monomial e±large(L∘S).
Definition 5.1*.*
Let μ={μ1,⋯,μn} be a ratio set.
Write μi=eLi, where Li is purely large
and negative. For each i, let αi be a witness
for small(Li∘S)≺1. Define α=⋃i=1nαi.
(We use this definition only temporarily.)
Definition 5.2*.*
Let μ={μ1,⋯,μn} be a ratio set.
Write μi=eLi, where Li is purely large
and negative. For each i, let αi be a witness
for small(Li∘S)≺1 and let
βi=αi∪{elarge(Li∘S)}.
Define β=⋃i=1nβi.
The ratio set β is called the
S-composition addendum for μ.
Of course α and β depend on μ and on S. The
dependence on S is not simply on a ratio set or
a witness for S, however.
Remark 5.3*.*
According to the construction given,
if β is the S-composition addendum for μ,
then β∘log:={b∘log:b∈β}
is the S∘log-composition addendum for μ.
And β∘exp is the S∘exp-composition addendum
for μ. But in general it may not be true that
β∘U is the S∘U-composition addendum
for μ. The difference is that when
L is purely large, L∘U need not be.
Example 5.4*.*
Suppose μ⊂G0. Then μi=xbi=ebilogx.
Write S=aeA(1+U), with a∈R,a>0,A∈T,A>0,
A purely large, U small. Then
[TABLE]
Now any witness for S is a witness for U≺1, so a witness
for small(Li∘S)≺1. So we may take α any witness for S.
And elarge(Li∘S)=ebiA is a monomial. So for β
add these n monomials to α.
Example 5.5*.*
A special case we need later. Not only μ⊂G0
but S=x+B where B≺x. Then for α we need a
witness for S, which is to say a witness for B≺x.
And for β we need to add mag(S)bi=xbi=μi.
So the S-composition addendum for μ in this case is:
μ itself together with a witness for B≺x.
Proposition 5.6**.**
Let μ be a ratio set, let S∈P,
let α be as in Definition 5.1,
and let β be an S-composition addendum
as in Definition 5.2.
Then (i)α witnesses m(S) for all m∈Jμ;
(ii)β generates m(S) for all m∈Jμ;
(iii) if m∈G and m≺μ1, then
m(S)≺β1;
(iv) if m,n∈G and m≺μn, then
m(S)≺βn(S).
Proof.
For 1≤i≤n, we have μi=eLi and
μi∘S=eLi∘S. Then
Li∘S=A+c+B, where A=large(Li∘S)
is purely large, c is a constant, and B=small(Li∘S)
is small. Of course B≺α1 by the definition of α.
Then μi(S)=eA+c+B=eAeceB. But
eA is a monomial, ec is a constant,
[TABLE]
Therefore α is a witness for μi(S).
By 3.9α witnesses
1/μi(S). By Proposition 3.2α witnesses
μk(S) for all k∈Zn. This proves (i).
Next note that eA∈β by the definition of β.
Therefore β generates μi(S) for all i,
and β generates μk(S). This proves (ii).
Also eA≺β1 by the definition of β,
so μi(S)≺β1. By Proposition 3.2μk(S)≺β1 for all k>0.
This proves (iii).
Now assume m≺μn. Then m/n≺μ1.
By (iii), (m/n)∘S≺β1.
But β witnesses 1, so we may apply Proposition 3.6
to get \big{(}(\mathfrak{m}/\mathfrak{n})\circ S\big{)}\cdot\big{(}\mathfrak{n}\circ S\big{)}\prec^{\boldsymbol{\beta}}\mathfrak{n}\circ S.
That is, m(S)≺βn(S). This proves (iv).
(Note: We did not assume m,n∈Jμ; we did not assume
that β witnesses n∘S.)
∎
Remark 5.7*.*
Consider a grid Jμ,m. In the preceding
proposition, if n∈Jμ,m,
then supp(n∘S)⊆Jβ,m,
where m is chosen so that
mag(μm∘S)=βm.
Proposition 5.8**.**
Let μ be a ratio set, let S∈P, and let
β be an S-composition addendum
as in Definition 5.2. Let ∑i∈ITi
be μ-convergent. Then ∑(Ti∘S)
is β-convergent.
Proof.
There is a grid Jμ,m that supports all Ti, so
by Remark 5.7 there is a grid Jβ,m
that supports all Ti∘S. So it remains to show that the series
∑(Ti∘S) is point-finite. Suppose, to the contrary, that there
is g such that A={i∈I:g∈supp(Ti∘S)} is infinite.
For i∈A there is n∈supp(Ti) with
g∈supp(n∘S). Since ∑Ti is point-finite,
there are infinitely many different n∈⋃supp(Ti)
with g∈supp(n∘S). This is contained in a grid
Jμ,m so there is an infinite sequence
n1≻μn2≻μ⋯ of such monomials.
But then by Proposition 5.6,
n1∘S≻βn2∘S≻β⋯.
So the sequence supp(n1∘S),supp(n2∘S),⋯
is point-finite by [7, Prop. 4.17]. So in fact
g cannot belong to all of them. This contradiction
completes the proof.
∎
Proposition 5.9**.**
Let μ be a ratio set, let S∈P
and let β be as in Definition 5.2. Then
(i) If μ generates T, then β generates T(S).
(ii) If μ generates and witnesses T, then β witnesses T(S).
(iii) If A≺μB, μ witnesses B,
and μ generates B, then
A(S)≺βmag(B(S)) so that A(S)≺βB(S).
Proof.
(i) Let g∈supp(T∘S). There is m∈suppT
with g∈supp(m∘S). Now m∈Jμ,
so supp(m∘S)⊆Jβ.
(ii) Write T=ag⋅(1+U) be the
canonical multiplicative decomposition. Then
T(S)=ag(S)⋅(1+U(S)).
Since μ witnesses
T, we have U≺μ1. So U(S)≺β1 and
β witnesses 1+U(S). Since μ generates T,
we have g∈Jμ. Therefore β
witnesses g(S). So β witnesses the product
T(S)=ag(S)⋅(1+U(S)).
(iii) Let g∈suppA(S). There is m∈supp(A)
with g∈suppm(S). Next, A≺μB,
so there is n∈supp(B) with m≺μn.
And μ witnesses B, so n≼μmag(B).
Thus m≺μmag(B). Therefore
m(S)≺βmag(B)(S) so there is
b∈supp(mag(B)(S)) with g≺βb. Now
μ generates B, so mag(B)∈Jμ,
so β witnesses mag(B)(S). So
b≼βmag(mag(B)(S))=mag(B(S)).
Thus g≺βmag(B(S)). This shows
that A(S)≺βB(S).
∎
Proposition 5.10**.**
Let μ be a ratio set, let S∈P,
and let β be an
S-composition addendum for μ as
in Definition 5.2. Assume series ∑j=1∞Aj
converges μ-geometrically and μ generates A1.
Then ∑j=1∞Aj(S) converges β-geometrically.
Proof.
Now μ generates and witnesses all Aj, so β
generates and witnesses all Aj(S).
And Aj≻μAj+1 so Aj(S)≻βAj+1(S).
Therefore ∑Aj(S) converges β-geometrically.
∎
Proposition 5.11**.**
Let μ be a ratio set, let S∈P,
and let β be an
S-composition addendum for μ. Assume
multiple series ∑Ap
converges μ-geometrically and μ generates A0.
Then ∑Ap(S) converges β-geometrically.
Grid-Based Operator?
Composition is not a “grid-based operator” of its right-hand
argument in the sense of [11, p. 122].
Consider
[TABLE]
In fact, for our argument we will use only aj∈{0,1}.
First let us compute T∘S. Writing s=∑j=1∞ajx−j,
we have
[TABLE]
a transseries with support (contained in) {x−jex:j=0,1,⋯}.
So eS is purely large. Next,
T∘S=e−eS, which is a monomial. For each subset
E⊆{1,2,3,⋯}, if S=x+∑j∈Ex−j,
then we get a monomial mE=T∘S. Since logarithm exists for
transseries, the set E can be recovered from mE, so there are
uncountably many monomials mE of this kind.
Now what would it mean if Φ(Y):=T∘(x+Y) were a grid-based
operator on \mathbb{R}\begin{picture}(8.0,8.0)(-2.0,2.0)\put(0.0,0.0){\line(0,1){9.0}}
\put(2.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}\mathfrak{M}\begin{picture}(7.0,8.0)(0.0,2.0)\put(3.0,0.0){\line(0,1){9.0}}
\put(5.0,0.0){\line(0,1){9.0}}
\put(0.0,0.0){\line(1,0){5.0}}
\put(0.0,9.0){\line(1,0){5.0}}
\end{picture}, where M is a set of monomials
containing x−j,j∈N? Say Φ=∑iΦi,
where Φi(Y)=Φˇi(Y,Y,⋯,Y) and
Φˇi is strongly i-linear. So
[TABLE]
and these are point-finite sums. There are countably many terms
\check{\Phi}_{i}\big{(}x^{-j_{1}},\cdots,x^{-j_{i}}\big{)}, and each involves
only countably many monomials. So since there are
uncountably many sets E, there are in fact
monomials mE that are in none of these supports,
and thus is not in the support of any
\Phi\big{(}\sum_{j\in E}x^{-j}\big{)}.
Inverse
Let μ be a ratio set, let S∈P and let
T be inverse to S so that T∘S=S∘T=x.
We would like “composition addendum” construction also
to be inverse. It doesn’t happen directly. But
perhaps there is something almost as good.
Question 5.12*.*
Are there ratio sets α,β so that
α∗⊇μ, β is an S-composition addendum
for α and α is a T-composition addendum for β?
In particular: Using the construction of Definition 5.2,
let β be composition addendum for μ, then
α composition addendum for β. Does it automatically
happen that β is composition addendum for α?
If not two steps, does it stabilize in three?
6 Fixed Point
The fixed point theorem in [7, Prop. 4.22] (which
comes from Costin [2] for example) uses
a ratio set μ in an essential way.
And it was a main reason for the extent
of the use of ratio sets in that paper. But here we will
discuss “fixed point” again.
Here is a “geometric convergence” version that is sometimes useful
but does not fit as a special case of [7, Prop. 4.22].
Proposition 6.1**.**
Let A⊆T,
let Φ:A→A be a function,
and let α be a ratio set.
Assume:
(a)
if α witnesses S∈A then α witnesses Φ(S);
2. (b)
if S,T∈A and α witnesses S−T, then
α witnesses Φ(S)−Φ(T) and
S−T≻αΦ(S)−Φ(T);
3. (c)
if Tj∈A(j=1,2,⋯)
and Tj converges α-geometrically
to T, then T∈A
4. (d)
There exists T0∈A such that
α witnesses both T0 and Φ(T0)−T0.
Then there is S∈A with S=Φ(S).
Proof.
First, choose T0∈A, using (d).
Then recursively define Tj+1=Φ(Tj) for j∈N.
Now α witnesses T0 and T1−T0.
By (a), α witnesses all Tj.
By (b), α witnesses all Tj+1−Tj and
T1−T0≻αT2−T1≻αT3−T2≻α⋯.
So by Proposition 3.19Tj
converges α-geometrically to some S.
So S∈A and α witnesses S−Tj for all j. Now
(S−Tj) is point-finite, so by (c)
(Φ(S)−Tj+1) is also point-finite, so Tj+1→Φ(S).
Therefore S=Φ(S).
∎
The usual uniqueness proof does not work with these hypotheses.
7 Witnessed Taylor’s Theorem
A simple version of Taylor’s Theorem will approximate
T(S+U) by T(S)+T′(S)⋅U when U is small enough.
Under the right conditions, we should have
T(S+U)−T(S)∼T′(S)⋅U, see Theorem 8.9.
Here we want to consider a witnessed version of this.
Below we consider a condition
m(S)⋅U≺1 for all m∈A, where A is
a subgrid. This may be written as
(A∘S)⋅U≺1. Since a subgrid A has a
maximum element m=maxA, we can write
(A∘S)⋅U≺1 if and only if (m∘S)⋅U≺1.
But the version with a witness will be
of the form (A∘S)⋅U≺ν1, which is not equivalent
to (m∘S)⋅U≺ν1 unless ν witnesses
A∘S.
tsupp
Definition 7.1*.*
We associate to each ratio set μ a subgrid tsuppμ.
[I was using lsuppμ for this at first, but it seems that
is not quite right. I write here something that works in
the proofs, but perhaps it is sometimes larger than
really needed.] This is defined recursively:
(i) For non-monomials:
If T∈T, then define tsuppT=⋃g∈suppTtsuppg,
and verify that it is a subgrid.
(ii) For b∈R, b=0, define tsuppxb={x−1};
tsupp1=∅.
(iii) For b∈R, L∈T∙ purely large, define
tsupp(xbeL)=supp(L′)∪tsupp(L)∪{x−1}.
(iv) If tsupp has been defined on G∙,M, then define
it on G∙,M+1 by: tsupp(g∘log)=((tsuppg)∘log)⋅x−1∪{x−1}.
If m,n∈G, then tsupp(mn)⊆tsuppm∪tsuppn.
Also tsupp(1/m)=tsuppm.
Remark 7.5*.*
If A is a subgrid, then there is a (finite!) ratio set
α such that tsuppA=tsuppα. Simply
choose α so that
α⊆A⊆Jα and apply the following.
Proposition 7.6**.**
Let A be a subgrid. Then ⋃g∈Atsuppg
is a subgrid. If μ is a ratio set, then
tsuppJμ=tsuppμ.
Proof.
Since μ⊆Jμ we have
tsuppJμ⊇tsuppμ.
Write μ={μ1,⋯,μn}.
If g∈Jμ, then g=μk for
some k, so by Remark 7.4 we
have tsuppg⊆⋃i=1ntsuppμi=tsuppμ. So tsuppJμ⊆tsuppμ.
∎
Remark 7.7*.*
If g∈G0, then tsuppg⊂G0.
For N∈N, N≥1: if g∈GN,
then tsuppg⊂GN−1. For N,M∈N,
N≥1,M≥1: if g∈GN,M, then
tsuppg⊂Gmax(N−1,M),M.
If g is log-free, then tsuppg is log-free.
If g has depth M, then tsuppg has depth M.
Taylor Order 1
Taylor’s Theorem of order 1 is the following:
Let T,U1,U2∈T,S∈P.
Assume T≍1,
((tsuppT)∘S)⋅U1≺1, and
((tsuppT)∘S)⋅U2≺1.
Then S+U1,S+U2∈P and
T(S+U1)−T(S+U2)∼T′(S)⋅(U1−U2).
Not valid with lsupp in place of tsupp.
Let T=logx, S=x, U=x. So
lsuppT={T′/T}={1/(xlogx)}.
And (lsuppT)⋅U≺1. So
[TABLE]
but log2∼1.
Here tsuppT={1/(xlogx),1/x} so we would require
U≺x.
Remark 7.9*.*
Below note: If A⋅U1≺β1, and
A⋅U2≺β1, then A⋅(U1−U2)≺β1.
Also note that we have not required that U1,U2 are witnessed
by β, only that they are generated by it, and their difference
is witnessed by it.
Special Case
We will consider first the special case S=x of
Taylor’s Theorem of order 1.
The special case is enough for the proof for the existence of
compositional inverses in Theorem 8.1,
which is used in turn for a general case
of Taylor’s Theorem.
Let T,U1,U2∈T.
Assume T≍1,
(tsuppT)⋅U1≺1, and
(tsuppT)⋅U2≺1.
Then x+U1,x+U2∈P and
T(x+U1)−T(x+U2)∼T′(x)⋅(U1−U2).
This is proved below (Theorem 7.27).
Here is the witnessed version of it.
Theorem 7.10** (Special Witnessed Taylor Order 1).**
Let μ⊂G be a ratio set.
Then there is a ratio set α such that for all
ratio sets β with β∗⊇α,
for all T∈μTμ with T≍1,
and for all U1,U2∈Tβ with
U1−U2∈βT and
[TABLE]
(a)* T(x+U1)−T(x+U2)∼T′(x)⋅(U1−U2).*
(b)* β witnesses T(x+U1)−T(x+U2).*
(c)* β generates T(x+U1)−T(x+U2).*
(d)* If also T≺μx and U1=U2, then*
[TABLE]
This will be proved in several stages.
Proposition 7.11**.**
In Theorem 7.10, if β satisfies
(a) and (b) and β is a derivative addendum for μ, then
β also satisies (c) and (d).
Proof.
(c) From Proposition 4.10, since μ generates T
we have β generates T′. Also β generates U1 and U2,
so it generates U1−U2 and T′(x)⋅(U1−U2).
Therefore β generates T(x+U1)−T(x+U2).
(d) Assume T≺μx. Then T′≺β1.
Since β witnesses U1−U2, by Proposition 3.6
we get T′(x)⋅(U1−U2)≺βU1−U2.
Since β witnesses both (T(x+U1)−T(x+U2)) and U1−U2,
we conclude
β witnesses (T(x+U1)−T(x+U2))/(U1−U2).
Apply Proposition 2.10 to conclude
(T(x+U1)−T(x+U2))/(U1−U2)≺β1.
∎
Write B[A,β,T] to mean:
For all U1,U2∈Tβ, if
U1−U2∈βT,
A⋅U1≺β1, and A⋅U2≺β1, then
β witnesses T(x+U1)−T(x+U2) and
T(x+U1)−T(x+U2)∼T′(x)⋅(U1−U2).
Write A[μ,α] to mean:
For all β with β∗⊇α and
for all T∈μTμ with T≍1,
we have B[tsuppμ,β,T].
So Theorem 7.10 says: for all μ there
exists α such that A[μ,α].
Definition 7.12*.*
Let μ,α⊂G∙ be a log-free ratio sets.
We say (recursively)
that α is a Taylor addendum for μ if:
(a) α is a derivative addendum for μ;
(b) for all xbeL∈Jμ with b=0,L=0, we have
x−1≺αL′;
(c) α is a Taylor addendum for μ,
where μ is an exponent generator for μ.
Begin the recursion by saying ∅ is a Taylor
addendum for ∅.
Remark 7.13*.*
If (c) holds for one exponent generator, then it also
holds for any other exponent generator, since they
generate the same subgroup of Jμ~.
Definition 7.14*.*
Let α⊆G∙,M be a ratio set of logarithmic
depth M. Then
μ=μ∘expM:={g∘expM:g∈μ}
is a log-free ratio set. We say that α
is a Taylor addendum for μ iff
α∘expM is a Taylor addendum for μ.
We will show: If α is a Taylor addendum for μ,
then A[μ,α].
Lemma 7.15**.**
Let μ⊂G∙. Then there is a
Taylor addendum for μ.
Proof.
Let μ⊂GN. The proof is by induction on N.
For N=0, let α be a derivative addendum for μ;
then (b) and (c) hold vacuously.
Assume N>0 and the result holds for N−1.
Let μ be an exponent generator for
μ. By the induction hypothesis, there is a Taylor addendum
α for μ.
Write μ={μ1,⋯,μn},
μi=xbieLi, and
[TABLE]
So for any xbeL∈Jμ, we have L∈W.
The log-free exponent subgrid for Jμ is
A=⋃i=1nsuppLi and
A⊂Jμ~⊂GN−1.
From Lemma 2.13 there are only finitely many different
magnitudes in W:
[TABLE]
Let α be a ratio set such that
α∗⊇α,
α is a derivative addendum for μ,
and for 1≤i≤n:
gi≻α1,
α witnesses Ai:={m∈A:m≼gi},
α witnesses gi′,
x−1≺αgi′.
Such a ratio set exists since there are only finitely many requirements.
If xbeL is any element of Jμ with L=0, then
magL=gi for some i, so L⊆Ai and
L≼αgi so α generates and witnesses L.
If xbeL∈Jμ, b=0, L=0,
then x−1≺αgi′∼mag(L′),
so x−1≺αL′.
∎
Remark 7.16*.*
Follow the construction to see: if μ⊂GN, then
the Taylor addendum α may be chosen so that
α⊂GN.
Proposition 7.17**.**
Let μ,β be ratio sets,
let T∈μTμ, T≍1,
let A⊂G, x−1∈A.
Assume B[A,β,g] for all g∈suppT.
Assume β is a derivative addendum for μ.
Then B[A,β,T].
Proof.
In the proof of B[A,β,T],
if T has a constant term it may be deleted, since that
changes neither the hypothesis nor the conclusion.
Let U1,U2∈Tβ with
U1−U2∈βT,
A⋅U1≺β1, and A⋅U2≺β1.
Then for any term ag of T:
β witnesses ag(x+U1)−ag(x+U2) and
[TABLE]
Now the series T=∑ag (considered as a multiple series
according to its grid, as in Remark 3.23)
converges μ-geometrically,
so T′=∑ag′ converges β-geometrically
by Proposition 4.13.
So we may sum (1) using Lemma 3.25 to get:
β witnesses T(x+U1)−T(x+U2) and
T(x+U1)−T(x+U2)∼T′⋅(U1−U2).
∎
Proposition 7.18**.**
Let b∈R, b=0, and let β be a ratio set.
Then B[{x−1},β,xb].
Proof.
Let U1,U2∈Tβ. Assume
U1≺βx, U2≺βx, U1−U2∈βT. Then
[TABLE]
Now β witnesses the fact that
each term (j>1) is ≺ the first term (j=1), and β witnesses
that first term (U1−U2)/x. So β witnesses
the sum (x+U1)b−(x+U2)b and
(x+U1)b−(x+U2)b∼xb−1(U1−U2).
∎
Corollary 7.19**.**
Let μ⊂G0small be a
ratio set. Let α be a ratio set such that
α is a derivative addendum for μ.
Then A[μ,α].
Proof.
Let β be a ratio set with β∗⊇α.
Then β is also a derivative addendum for μ.
Since tsuppμ={x−1}, for all g∈Jμ we have
B[tsuppμ,β,g].
So B[tsuppμ,β,T] for all T∈μTμ
with T≍1 by Proposition 7.17.
This proves A[μ,α].
∎
Proposition 7.20**.**
Let β be a ratio set.
Then
B[{x−1},β,log].
Proof.
Let U1,U2∈Tβ. Assume
U1≺βx, U2≺βx, and U1−U2∈βT. Then
[TABLE]
Now β witnesses the fact that
each term (j>1) is ≺ the first term (j=1), and β witnesses
that first term (U1−U2)/x. So β witnesses
the sum log(x+U1)−log(x+U2) and
log(x+U1)−log(x+U2)∼(U1−U2)/x.
∎
Corollary 7.21**.**
In the preceding proof, if β also generates x, then
β generates log(x+U1)−log(x+U2).
Proof.
Now β generates U1 and U2, so it generates U1−U2.
If β also generates x, then it generates 1/x and
(U1−U2)/x, and therefore β generates log(x+U1)−log(x+U2).
∎
Proposition 7.22**.**
Let μ,β be ratio sets.
Let b∈R and let L∈μTμ be purely large, L=0.
Assume B[A,β,L] and (if b=0) assume
x−1≺βL′.
Then B[{x−1}∪A∪suppL′,β,xbeL].
Proof.
We take the case b=0. The case b=0 is similar but easier.
Write g=xbeL, so that g=eblogx+L.
Let U1,U2∈Tβ with
U1−U2∈βT,
({x−1}∪A∪suppL′)⋅U1≺β1, and
({x−1}∪A∪suppL′)⋅U2≺β1.
Then β
witnesses L(x+U1)−L(x), L(x+U2)−L(x), and L(x+U1)−L(x+U2);
also L(x+U1)−L(x)∼L′⋅U1,
L(x+U2)−L(x)∼L′⋅U2,
and L(x+U1)−L(x+U2)∼L′⋅(U1−U2).
By Proposition 7.20, β
witnesses blog(x+U1)−blog(x),
blog(x+U2)−blog(x), and blog(x+U1)−blog(x+U2);
also blog(x+U1)−blog(x)∼bU1/x,
blog(x+U2)−blog(x)∼bU2/x, and
blog(x+U1)−blog(x+U2)∼b(U1−U2)/x.
Let
[TABLE]
Since x−1≺L′, we have Q1∼L′⋅U1∼(bx−1+L′)⋅U1≺β1.
Similarly Q2∼(bx−1+L′)⋅U2≺β1
and Q1−Q2∼(bx−1+L′)⋅(U1−U2)≺β1.
Since x−1≺βL′, we have
β witnesses Q1 so
Q1≺β1. Similarly β witnesses Q2, Q2≺β1,
β witnesses Q1−Q2, and Q1−Q2≺β1. Now
[TABLE]
so β witnesses eQ1−eQ2 and
eQ1−eQ2∼Q1−Q2.
Then
[TABLE]
Now β witnesses eQ1−eQ2 and xbeL is a monomial,
so β witnesses g(x+U1)−g(x+U2). Continuing:
[TABLE]
Therefore B[{x−1}∪A∪suppL′,β,xbeL].
∎
Proposition 7.23**.**
Let μ⊂G∙small be a log-free ratio set.
Let α be a Taylor addendum for μ.
Then A[μ,α].
Proof.
Say μ⊂GNsmall. The proof is by induction on N.
The case N=0 is Corollary 7.19. Now let N>1 and
assume the result holds for N−1.
Let μ⊂GN−1small be an exponent generator for μ.
Then α is a Taylor addendum for μ.
So by the induction hypothesis, A[μ,α].
Let β be a ratio set with β∗⊇α.
Note that for all xbeL∈Jμ,
we have tsuppμ⊇{x−1}∪tsuppμ∪suppL′.
We have B[tsuppμ,β,xbeL] for all xbeL∈Jμ
by Proposition 7.22.
Thus by Proposition 7.17 we have
B[tsuppμ,β,T] for all T∈μTμ
with T≍1. Therefore A[μ,α].
∎
Proposition 7.24**.**
Let T∈T, let α be a ratio set, and
let A⊂G.
Define
[TABLE]
Assume B[A,α,T].
Then B[B,β,T∘log].
Proof.
Let U1,U2∈Tβ. Assume
U1−U2∈βT, B⋅U1≺β1, and
B⋅U2≺β1. Now x−1 in B,
so by Proposition 7.20, we conclude
β witnesses log(x+U1)−log(x), log(x+U2)−log(x), and
log(x+U1)−log(x+U2); and
log(x+U1)−log(x)∼U1/x,
log(x+U2)−log(x)∼U2/x, and
log(x+U1)−log(x+U2)∼(U1−U2)/x.
Since x−1∈β, by Corollary 7.21
we conclude that β generates
log(x+U1)−log(x) and log(x+U2)−log(x).
Now define V1:=(log(x+U1)−log(x))∘exp and
V2:=(log(x+U2)−log(x))∘exp, so that
V1,V2∈αTα, V1−V2∈αT,
V_{1}\sim\big{(}U_{1}/x\big{)}\circ\exp,
V_{2}\sim\big{(}U_{2}/x\big{)}\circ\exp, and
and V_{1}-V_{2}\sim\big{(}(U_{1}-U_{2})/x\big{)}\circ\exp.
By the definition of B in terms of A, it follows
that A⋅V1≺α1 and A⋅V2≺α1.
We may apply B[A,α,T] to conclude
α witnesses T(x+V1)−T(x+V2) and
T(x+V1)−T(x+V2)∼T′⋅(V1−V2).
Now
[TABLE]
so β witnesses T\big{(}\log(x+U_{1})\big{)}-T\big{(}\log(x+U_{2})\big{)}.
Continuing,
[TABLE]
∎
Corollary 7.25**.**
Let μ⊂Gsmall be a ratio set.
Let α be a Taylor addendum for μ.
Then A[μ,α].
Proof.
By induction on M, where μ⊂G∙,M.
Apply Definitions 7.1 and 7.14
using Propositions 7.23 and 7.24.
∎
Together with Proposition 7.11,
this completes the proof of Theorem 7.10.
Is the addendum β constructed above much larger than necessary?
Corollary 7.26**.**
Let μ,β⊂Gsmall be ratio sets.
Let B∈Tβ.
Assume β is a Taylor addendum for μ,
β∗⊇μ, and (tsuppμ)⋅B≺β1.
Then β is an (x+B)-composition addendum for μ.
Proof.
Write μ={μ1,⋯,μn} and μi=eLi.
Then suppLi⊆tsuppμ, so Li′⋅B≺β1.
Now tsuppLi⊆tsuppμ, so we have
β generates Li(x+B)−Li and Li(x+B)−Li∼Li′⋅B≺β1.
So small(Li∘(x+B))=Li(x+B)−Li and β witnesses the fact
that this is ≺1.
And elarge(Li∘(x+B))=eLi=μi
is witnessed by β.
∎
The non-witnessed version is a consequence.
Theorem 7.27** (Special Taylor Order 1).**
Let T,U1,U2∈T.
Assume (tsuppT)⋅U1≺1, and
(tsuppT)⋅U2≺1.
Then x+U1,x+U2∈P and
T(x+U1)−T(x+U2)∼T′(x)⋅(U1−U2).
Proof.
We may assume without loss of generality that T≍1,
since subtracting a constant from T does not change
the conclusion.
Since x−1∈tsuppT, from (tsuppT)⋅U1≺1
we conclude U1≺x. Similarly U2≺x. So
x+U1,x+U2∈P. Let μ be a ratio set with
T∈μTμ, and let α be the
Taylor addendum for μ. Choose β⊇α
such that U1,U2∈Tβ, U1−U2∈βT,
and
[TABLE]
Then from Theorem 7.10(a) we conclude
T(x+U1)−T(x+U2)∼T′(x)⋅(U1−U2).
∎
8 Compositional Inverse
Notation: P={S∈T:S≻1,S>0}.
The set P is a group inder the “composition” operation ∘.
We assume associativity is known. The identity is x∈P.
Theorem 8.1**.**
Let T∈P. Then there exists S∈P with T∘S=x.
The proof proceeds in stages. See [11, § 5.4.1],
[6, Cor. 6.25].
Proposition 8.2**.**
Let A∈T0, A≺x.
Then there is B∈T0, B≺x, so that
(x+A)∘(x+B)=x.
Proof.
Write a=magA. So a≺x.
Let μ⊆G0 be a ratio set that generates A,
witnesses A, and witnesses x+A. In particular, a≺μx.
Now β:=μ∪{x−1}⊂G0
is a Taylor addendum for μ (Lemma 7.15
and Example 4.3).
Let B={g∈G0:g≼βa} and
D={B∈βTβ:suppB⊆B,B∼−a}.
Define Φ by
[TABLE]
I claim Φ maps D into itself.
Indeed, let B∈D. Then by Example 5.5, β
is an (x+B)-composition addendum for μ. But μ
generates and witnesses A, so β generates and witnesses
A∘(x+B) by Proposition 5.9.
Note tsuppμ={x−1}.
We have B/x≼βa/x≺β1.
Then by Special Taylor 7.10 we have:
β witnesses A∘(x+B)−A and A∘(x+B)−A≺βB≼a,
so A∘(x+B)∼A∼a and thus Φ(B)∈D.
Therefore Φ maps D into itself.
If Tj∈D and Tj converges geometrically to T,
then T∈D by Proposition 3.16.
Next let B1,B2∈D and assume β witnesses B1−B2.
Then by Proposition 7.10 as above, we have:
β witnesses A∘(x+B1)−A∘(x+B2) and
A∘(x+B1)−A∘(x+B2)≺βB1−B2. That is,
β witnesses Φ(B1)−Φ(B2) and
Φ(B1)−Φ(B2)≺βB1−B2.
We may now apply the fixed point theorem
Proposition 6.1 to conclude
there is B∈D such that B=Φ(B).
That is:
B=−A∘(x+B) or
x+B=x−A∘(x+B) or
x+B+A∘(x+B)=x or
(x+A)∘(x+B)=x.
∎
Proposition 8.3**.**
Let N∈N, N≥1. Let A∈T with
suppA⊆GNsmall∖GN−1.
Then there is B∈T with
suppB⊆GNsmall∖GN−1
such that (x+A)∘(x+B)=x.
Proof.
Write a=magA∈GNsmall∖GN−1.
Let μ⊂GNsmall be a ratio set
that generates A, witnesses A, and witnesses x+A.
Now tsuppμ⊂GN−1 so (tsuppμ)⋅a≺1.
Let β be a Taylor addendum for μ such that
β∗⊇μ and
(tsuppμ)⋅a≺β1.
Let B={g∈GN:g≼βa} and
D={B∈βTβ:suppB⊆B,B∼−a}.
Define Φ by
[TABLE]
I claim Φ maps D into itself. Let B∈D.
Then by Corollary 7.26β is an
(x+B)-composition addendum for μ.
Since μ generates and witnesses A, it follows
that β generates and witnesses A∘(x+B).
By Special Taylor 7.10 we have
β witnesses A∘(x+B)−A and
A∘(x+B)−A≺βB∼−a, so
β witnesses A∘(x+B) and A∘(x+B)∼A∼a.
Thus Φ(B)∼−a. Also suppA∘(x+B)⊆GNsmall
by [7, Prop. 3.98], so Φ(B)∈D.
Therefore Φ maps D into itself.
If Tj∈D and Tj converges geometrically to T,
then T∈D by Proposition 3.16.
Next let B1,B2∈D and assume β witnesses B1−B2.
Then by Proposition 7.10 as above, we have:
β witnesses A∘(x+B1)−A∘(x+B2) and
A∘(x+B1)−A∘(x+B2)≺βB1−B2. That is,
β witnesses Φ(B1)−Φ(B2) and
Φ(B1)−Φ(B2)≺βB1−B2.
We may now apply the fixed point theorem
Proposition 6.1 to conclude
there is B∈D such that B=Φ(B).
That is:
B=−A∘(x+B) or
x+B=x−A∘(x+B) or
x+B+A∘(x+B)=x or
(x+A)∘(x+B)=x.
∎
Proposition 8.4**.**
Let T∈T∙. Assume T∼x.
Then there exists S∈T∙ with
S∼x and T∘S=x.
Proof.
Let N∈N be minimum so that T∈TN. The
proof is by induction on N. The case N=0 is
Proposition 8.2. Now assume N≥1
and the result is known for smaller values.
Now T=x+A0+A1, where suppA0⊂GN−1,
suppA1⊂GNsmall∖GN−1, A0≺x.
The induction hypothesis may be applied
to x+A0, so there is B0 with suppB0⊆GN−1,
B0≺x, and (x+A0)∘(x+B0)=x.
Therefore x+B0+A0∘(x+B0)=x so
B0+A0∘(x+B0)=0.
Write C=A1∘(x+B0) so that
suppC⊂GNsmall∖GN−1
by [7, Prop. 3.98].
By Proposition 8.3 there is D with
suppD⊂GNsmall∖GN−1
and (x+C)∘(x+D)=x.
Let E=D+B0∘(x+D)
so that suppE⊂GN by [7, Prop. 3.98],
E≺x,
and x+E=(x+B0)∘(x+D).
Let S=x+E.
[TABLE]
with S=x+E∼x.
∎
Proposition 8.5**.**
Let T∈T. Assume T∼x.
Then there exists S∈T with
S∼x and T∘S=x.
Proof.
If T is log-free, this follows from Proposition 8.4.
If T∈T∙,M, then
T1=logM∘T∘expM∈T∙ and still
T1∼x. So there is S1 with T1∘S1=x.
Then S=expM∘S1∘logM
satisfies T∘S=x.
∎
Proposition 8.6**.**
Let M∈Z. Let T∈T with T∼lM.
Then there exists S∈P with T∘S=x.
Proof.
Let T1=T∘expM, so that T1∼x.
Then there is S1 with T1∘S1=x.
So S=expM∘S1 satisfies
T∘S=x.
∎
Let T∈P.
There exist m,p so that logm∘T∼lp
([8, Prop. 4.5]).
But there exists S1 with
(logm∘T)∘S1=x. Then
S=S1∘expm satisfies
T∘S=x.
∎
Remark 8.7*.*
As is well-known: if right inverses all exist, then they are
full inverses. Review of the proof:
Suppose T∘S=x as found. Start with S and
get a right-inverse T1 so S∘T1=x.
Then
[TABLE]
Notation 8.8*.*
Write T[−1] for the compositional inverse of T.
Taylor’s Theorem Again
The general order one Taylor’s Theorem is deduced from
the case ∼x using a compositional inverse.
Theorem 8.9** (Taylor Order 1).**
Let T,U1,U2∈T,S∈P.
Assume ((tsuppT)∘S)⋅U1≺1, and