On intersections of polynomial semigroups orbits with plane lines
Jorge Mello
University of New South Wales. mailing adress:
School of Mathematics and Statistics
UNSW Sydney
NSW, 2052
Australia.
[email protected]
Abstract.
We study intersections of orbits in polynomial semigroup dynamics with lines on the affine plane over a number field, extending previous work of D. Ghioca, T. Tucker, M. Zieve (2008).
1. Introduction
One of the most studied topics in complex dynamics is the research on orbits of polynomial maps. For a complex number x and polynomials F={f1,...,fk}⊂C[X], one is very interested in understanding the orbit
OF(x)={fi1(fi2(...(fin(x))...)):n∈N,ij=1,...,k}
and
Fn={fi1∘⋯∘fin:ij=1,...,k}.
Considering orbits with k=1, D. Ghioca, T. Tucker, M. Zieve [7] proved the following
Let x0,y0∈C and f,g∈C[X] with deg(f)=deg(g)>1. If Of(x0)∩Og(y0) is infinite, then f and g have a common iterate.
Such result provided the first non-monomial cases of the so-called dynamical Mordell-Lang Conjecture proposed by Ghioca and Tucker and stated below.
** Dynamical Mordell-Lang Conjecture.** *Let f1,...,fk be polynomials in C[X], and let V be a subvariety of the affine space Ak which contains no positive dimensional subvariety that is periodic under the action of (f1,...,fk) on Ak. Then V(C) has finite intersection with each orbit of (f1,...,fk) on Ak.
*For an overview and a more detailed view in the history of the above conjecture, we refer to [1].
The results of [7] were also extended by the same authors to function fields in the same paper, and to cases where the degrees of the polynomials are distinct in [9], in which they also generalised results to cases of a line in a higher dimensional space intersecting a product of multiple orbits defined by one map. As a corollary (Corollary 1.5, [9]) they obtained information about the intersection of a higher dimensional line with an orbit defined by a semigroup of polynomial maps that have all but one of its coordinates as the identity.
R. Benedetto, D. Ghioca, P. Kurlberg and T. Tucker [3] studied cases of intersection of orbits of rational functions with curves under some natural conditions, and in [4] the same authors proved that if the conjecture does not hold in the context of endomorphisms of varieties, then the set of iterates landing on a referred subvariety forms a set of density zero.
For a discussion with an effective viewpoint and monomial maps, see [12], and for the context of finite fields, some analysis is made in [13]. On [14], intersection of orbits and the Mordell-Lang problem is studied on the disk, with non-polynomial mappings.
In this paper, we study the extension of the results of [7] to polynomial semigroup cases with k≥1 over number fields under some natural conditions. Namely, for sequences Φ=(ϕij)j=1∞ of pairs of univariate polynomials in a finite set F whose coherent orbit
OΦc(x,y)={(x,y),ϕi1(x,y),ϕi1(ϕi2(x,y)),ϕi1(ϕi2(ϕi3(x,y)),...}
intersects the diagonal plane line Δ on infinitely many points.
Among other results, we prove the following:
Theorem 1.1**.**
Let x0,y0∈K, and let F={ϕ1,...,ϕs}⊂K[X]×K[X] be a finite set of pairs of polynomials which are not gotten from monomials by composing with linears on both sides, with ϕi=(fi,gi) and degfi=deggi>1
for each i. Suppose that #(OF(x0,y0)∩Δ)=∞. If the orbit OF(x0,y0) satisfies that there exists a sequence Φ of terms in F with #OΦc(x,y)∩Δ=∞, or otherwise is such that #(OF(x0,y0)∩Δ)=∞ and the maps of F commute with each other, then there exist k∈N, and ϕ=(f,g)∈Fk such that f=g.
In Section 2 we recall properties of height functions, in Section 3 we gather very important needed results about polynomial equations and decompositions, and our main result is proved in Section 4. Further applications of the result and methods are given in Section 5.
2. Preliminaries on height functions
Througout the paper, K is assumed to be a fixed number field. We consider F={ϕ1,...,ϕs}⊂K[X]×K[X] to be a finite set of pairs of polynomials, with ϕi=(fi,gi).
Let x,y∈K, and let
OF(x,y)={ϕin∘...∘ϕi1(x,y)∣n∈N,ij=1,...,s}
denote the forward orbit of P under F.
We set J={1,...,s},W=∏i=1∞J, and let Φw:=(ϕwj)j=1∞ to be a sequence of polynomials from F for w=(wj)j=1∞∈W.
In this situation we let Φw(n)=ϕwn∘...∘ϕw1 with Φw(0)=Id,
and also
Fn:={Φw(n)∣w∈W}.
Precisely, we consider polynomials sequences Φ =(ϕij)j=1∞∈∏i=1∞F and x,y∈K,
denoting
Φ(n)(x,y) :=ϕin(ϕin−1(...(ϕi1(x,y))).
The set
{(x,y),Φ(1)(x,y),Φ(2)(x,y),Φ(3)(x,y),...}
={(x,y),ϕi1(x,y),ϕi2(ϕi1(x,y)),ϕi3(ϕi2(ϕi1(x,y)),...}
is called the forward orbit of (x,y) under Φ, denoted by
OΦ(x,y).
The point (x,y) is said to be Φ-preperiodic if OΦ(x,y) is finite.
For a x,y∈K, the F-orbit of (x,y) is defined as
[TABLE]
The point (x,y) is called preperiodic for F if OF(x,y) is finite.
We let S be the shift map which sends Ψ =(ψi)i=1∞ to
S(Ψ)=(ψi+1)i=1∞.
We also define the coherent orbit of a point (x,y) under a sequence Φ=(ϕij)j=1∞ to be the set
OΦc(x,y)={(x,y),ϕi1(x,y),ϕi1(ϕi2(x,y)),ϕi1(ϕi2(ϕi3(x,y)),...}.
We let Δ denote the diagonal line {(x,x)∣x∈K} in the affine plane A2(K).
In order to deal with pairs of polynomials with distinct degrees, we recall known results about certain canonical heights.
Recall that for x∈Q, the naive logarithmic height is given by
h(x)=∑v∈MK[K:Q][Kv:Qv]log(max{1,∣x∣v},
where MK is the set of places of K, MK∞ is the set of archimedean (infinite) places of K, MK0 is the set of nonarchimedean (finite) places of K, and for each v∈MK, ∣.∣v denotes the corresponding absolute value on K whose restriction to Q gives the usual v-adic absolute value on Q.
Also, we write Kv for the completion of K with respect to ∣.∣, and we let Cv denote the completion of an algebraic closure of Kv.
Considering the affine plane over a field L to be A2(L)=L×L, there is a way to construct height functions associated with sequences of polynomials.
Lemma 2.1**.**
(Theorem 2.3, 10])
There is a unique way to attach to each sequence Φ =(ϕi)i=1∞, with degϕi≥2 as above, a canonical height function
h^Φ:A2(Kˉ)→R**
such that
(i) supx∈X(Kˉ)∣h^Φ(x)−h(x)∣≤O(1).
(ii) h^S(Φ)∘ϕ1=(degϕ1)h^Φ. In particular,
h^Sn(Φ)∘ϕn∘...∘ϕ1=(degϕn)...(degϕ1)h^Φ.
(iii) h^Φ(x)≥0 for all x.
(iv) h^Φ=0 if and only if x is Φ-preperiodic.
We call h^Φ a canonical height function (normalized) for Φ.
Considering conditions as above, namely, a number field K, and H={ϕ1,...ϕk} now with ∑ideggi>k,
the uple (A2(K),g1,...,gk) becomes a particular case of what we call a dynamical eigensystem of degree degϕ1+...+degϕk.
For such, Kawaguchi also proved the following:
Lemma 2.2**.**
(Theorem 1.2.1, [11]) There exists the canonical height function
h^H:A2(Kˉ)→R**
*for (X,ϕ1,...,ϕk) characterized by the following two properties :
(i) h^H=hH+O(1);
(ii) ∑j=1kh^H∘gj=(degg1+...+deggk)h^H.*
The result below is also well known.
Lemma 2.3**.**
(Lemma 5.4, [7])
If l∈K[X] is linear, then there exists cl>0 such that ∣h(l(x))−h(x)∣≤cl for all x∈K.
3. Some results on polynomial composition
The result stated below is a strong fact concerning equations of the form F(X)=G(Y) with infinitely many integral solutions.
Lemma 3.1**.**
(Corollary 2.2, [7])
Let K be a number field, S a finite set of nonarchimedean places of K, and F,G∈K[X] with deg(F)=deg(G)>1.
Suppose F(X)=G(Y) has infinitely many solutions in the ring of S-integers of K. Then F=E∘H∘a and G=E∘c∘H∘b for some E,a,b,c∈K[X] with a,b and c linears, and H∈K[X]. Moreover, for fixed K, there are only finitely many possibilities for H.
The next surprising result that we state shows a certain rigidity on polynomial decomposition.
Lemma 3.2**.**
(Lemma 2.3, [7]) (Rigidity)
Let K be a field of characteristic zero. If A,B,C,D∈K[X]−K satisfy A∘B=C∘D and deg(B)=deg(D), then there is a linear l∈K[X] such that A=C∘l−1 and B=l∘D.
Finally, we show, under some conditions, when polynomials from a finite set can be gotten from the same set through composition with linears.
Lemma 3.3**.**
Let K be a field of characteristic zero, and suppose {F1,...,Fh}⊂K[X] is a finite set of polynomials of degree d>1 with the property that u∘Fi∘v is not a monomial whenever u,v∈K[X] are linear for each i. Then the equations a∘Fi=Fj∘b have only finitely many solutions in linear polynomials a,b∈K[X] for each 1≤i,j≤h.
Proof.
Suppose a∘F1=F2∘b, we denote the coefficients of Xd and Xd−1 in F1 by θd and θd−1, and in F2 by τd and τd−1.
We put β1=−θd−1/dθd,α1=−F1(β1) and β2=−τd−1/dτd,α2=−F2(β2) and see that F^i:=αi+Fi(X+βi)(i=1,2) have no terms of degree d−1 and [math]. Putting a^:=α2+a(x−α1) and b^:=β2+b(X+β1), we have that a^∘F^1=F^2∘b^, and both have no term of degree d−1.
Hence b^ cannot have a term of degree [math], neither F^2∘b^ nor a^. Hence we can make a^=δX and b^=γX, which implies that δF^1(X)=F^2(γX). Writing F^1(X)=∑iuiXi,F^2=∑iviXi, we have γi=δviui for each non zero i term. As F^1,F^2 have at least two terms of distinct degrees, let us say i>j, we have δi−j=ujviuivj and there are finitely many possibilities for δ.
Since by our construction a=−α2+γrurvr(X+α1) and b=β2+γ(X−β1), there are only finitely many possilities for a and b. Making the same procedure for any pair (Fi,Fj) yields the desired result.
∎
4. Proof of Theorem 1.1
Proof.
We start by letting S to be a finite set of nonarchimedean places of K such that the ring of S-integers OS contains x0,y0 and every coefficient of ϕ1,...,ϕs.
Then OS2 contains ϕ(x0,y0) for every ϕ∈⋃n≥1Fn.
By hypothesis we can firstly suppose #(OF(x0,y0)∩Δ)=∞ with #(OΦc(x0,y0)∩Δ)=∞ for some sequence Φ=(F,G)=(ϕij)j=1∞=((fij,gij))j=1∞ of terms belonging to F,
so that #OFc(x0)=∞ and #OGc(y0)=∞ . Let (nj)j∈N be such that
ϕi1∘...∘ϕinj(x0,y0)∈Δ for each j∈N.
By the pigeonhole principle, there exists a t1∈{1,...,s} such that for infinitely many j, we have that ϕinj=ϕt1, so that ϕi1∘...∘ϕinj(x0,y0)=ϕi1∘...∘ϕt1(x0,y0)∈Δ. Again, for the same reason, there must exist a ϕt2∈F such that ϕinj=ϕt1, ϕinj−1=ϕt2, and ϕi1∘...∘ϕinj(x0,y0)=ϕi1∘...∘ϕt2∘ϕt1(x0,y0)∈Δ for infinitely many j.
Obtaining tn inductively in this way, we can consider the sequence Φ′=(F′,G′)=(ϕk′)k=1∞:=(ϕtk)k=1∞, which by its construction satisfies that for every k∈N, the equation F′(k)(X)=G′(k)(Y) has infinitely many solutions in OS×OS.
By Lemma 3.1, for each k we have F′(k)=Ek∘Hk∘ak and G′(k)=Ek∘ck∘Hk∘bk with Ek∈K[X], linears ak,bk,ck∈K[X], and some Hk∈K[X] which comes from a finite set of polynomials.
Thus Hk=Hl for some k<l.
If we write F′(l)=F~∘F′(k) and G′(l)=G~∘G′(k) with (F~,G~)∈Fl−k, we have
F~∘Ek∘Hk∘ak=F′(l)=El∘Hk∘al and
G~∘Ek∘ck∘Hk∘bk=G′(l)=El∘cl∘Hk∘bl.
By Lemma 3.2, there are linears u,v∈K[X] such that
Hk∘ak=u∘Hk∘al and ck∘Hk∘bk=v∘cl∘Hk∘bl.
Thus,
F~∘Ek∘u=El=G~∘Ek∘v,
and by Lemma 3.2, it follows that F~=G~∘l1 for some l1∈K[X] linear.
Again from the pigeonhole principle, there exists some
integer k0 so that for infinitely many ℓ>k0, we have that
Hk0=Hℓ
So, for these infinitely many ℓ, we have
that there exists some linear polynomial aℓ such that
ϕℓ′∘⋯ϕk0+1′:=(Fk0,ℓ,Gk0,ℓ)
satisfies
Fk0,ℓ=Gk0,ℓ∘aℓ.
Inductively, we obtain in this way an infinite N⊂N and an infinite sequence Ψ=(F,G)=(ψi)i=1∞ of terms in ⋃n≥1Fn satisfying
F(n)=G(n)∘ln, with n∈N.
By Lemma 3.2, this means that un∘fij=gij∘ln for some 1≤ij≤s and un linear.
Since {ln∣n∈N} is finite by Lemma 3.3, there exist N>n such that lN=ln. Then, denoting F(N)=FN−n∘F(n) and G(N)=GN−n∘G(n) where FN−n,GN−n∈Fm for some m, we have
F(N)=G(N)∘lN=GN−n∘G(n)∘ln=FN−n∘F(n)=FN−n∘G(n)∘ln,
and thus
FN−n=GN−n
as we wanted to show.
If otherwise, we suppose that #(OF(x0,y0)∩Δ)=∞ and the maps of F commute, we take t1 such that ϕ(x0,y0)=(ϕt1∘...)(x0,y0)∈Δ for infinitely many ϕ if the semigroup generated by F, so that, ft1(X)=gt1(Y) has infinitely many solutions in OS×OS.
Then we choose t2 such that ϕ=(ϕt1∘ϕt2∘...)(x0,y0)=(ϕt2∘ϕt1∘...)(x0,y0)∈Δ for infinitely many ϕ∈∪n≥0Fn (commutativity), so that (ft2∘ft1)(X)=(gt2∘gt1)(Y) has infinitely many solutions in OS×OS. In this way
we build a sequence Φ′=(F′,G′)=(ϕtn)n∈N such that F′(k)(X)=G′(k)(Y) has infinitely many solutions in OS×OS for each k∈N. Then one can proceed as in the first case to achieve the desired conclusion.
∎
It turns out that this result is actually true for orbits which intersect an arbitrary line at infinitely many points.
Corollary 4.1**.**
Under the conditions of Theorem 1.1, with L:X=l(Y) ( l linear over K) in place of Δ, there must exist k∈N, and ϕ=(f,g)∈Fk such that f=l∘g.
Proof.
Suppose #(OF(x0,y0)∩L)=∞. Then defining a new system
Fl:={(f1,l∘g1∘l−1),...,(fs,l∘gs∘l−1)},
we have that #(OFl(x0,l(y0))∩Δ)=∞ with the conditions of Theorem 1.1, from where the result follows.
∎
5. Further applications
The two next corollaries are straight-forward consequences of Theorem 1.1.
Corollary 5.1**.**
Let x0,y0∈K, and let F={ϕ1,...,ϕs}⊂K[X]×K[X] be a set of pairs of polynomials which are not gotten from monomials by composing with linears on both sides, with ϕi=(fi,gi) and degfi=deggi>1
for each i. If #(O{f1,...,fs}(x0)∩O{g1,...,gs}(y0))=∞ such that for some sequence Φ of terms in {f1,...,fs}×{g1,...,gs} we have
OΦc(x0,y0)∩Δ=∞.
Then there exists k∈N, and ϕ=(f,g)∈Fk such that f=g.
Proof.
Here we are under the conditions of Theorem 1.1, from where the result follows.
∎
Corollary 5.2**.**
*Let x0∈K, and let F={f1,...,fs}⊂K[X] be a set of polynomials which are not gotten from monomials by composing with linears on both sides, with degf1=degf2=...=degfs>1. Suppose there are two sequences (trajectories) Φ and Ψ in the semigroup generated by F satisfying the following
“OΦc(x0)∩OΨc(x0)=∞, or otherwise #(OΦ(x0)∩OΨ(x0))=∞ and the elements of F commute“.
Then Φ and Ψ have two “words” in common, namely there exist m,k∈N such that*
Sm(Φ)(k)=Sm(Ψ)(k).
Proof.
We apply the proof of Theorem 1.1 for F and G=F with (x0,x0).
∎
Remark 5.3**.**
In a similar way as in the proof of Corollary 4.1, it can be seen that Corollary 5.1 and Corollary 5.2 can be extended with Δ being replaced by an arbitrary plane line L:X=l(Y) and the set {Φ(nj)(x0)=Ψ(nj)(x0)∣n1<n2<...} by {Φ(nj)(x0)=l(Ψ(nj)(x0))∣n1<n2<...} respectively, implying the more general conclusions
f=l∘g and Sm(Φ)(k)=l∘Sm(Ψ)(k) respectively.
Finally we obtain informations in some cases of polynomial semigroup orbits with polynomials with distinct degrees, for which the theory of canonical heights is useful.
Proposition 5.4**.**
Let x0,y0∈K, and let F={ϕ1,...,ϕs}⊂K[X]×K[X] be a set of pairs of polynomialsof degree at least 2, and Φ=(F,G) be a sequence of terms in F such that deg(G(n))=o(deg(F(n))). Then
#(OΦ(x0,y0)∩Δ)<∞.
In particular, if degfi>deggi for each i=1,...,s, then every sequence( trajectory) of F intersects Δ in only finitely many points.
Proof.
If x0 or y0 is preperiodic for F or G respectively, then the result is true. Otherwise Lemma 2.1 says that h^F(x0)>0, so that there is a δ>0 such that every k big enough satisfies
h(F(k)(x0))>deg(F(k))δ.
Also, there exist ϵ>0 such that
h(G(k)(y0))<deg(G(k))ϵ,
and by the hypothesis we know that deg(F(k))δ>deg(G(k))ϵ for every k large enough. Therefore, h(F(k)(x0))>h(G(k)(y0)) and F(k)(x0)=G(k)(y0) for every k large as wanted.
∎
The result above shows in particular that if #(OΦ(x0,y0)∩Δ)=∞, then it cannot be true that limndeg(F(k))deg(G(k)) or limndeg(G(k))deg(F(k)) is equal to zero, so that the distance between the canonical heights of x0 and y0 associated with F and G respectively cannot be increasingly large.
Related with Proposition 5.4 and considering the difference between the degree sum of the coordinates in the sequence, we have that if the n-iterates of a point under the semigroup are all contained in Δ for infinitely many n, then the sum of the degrees of the polynomials in the first coordinate of the generator set is equal to such sum for the second coordinate polynomials, as it follows below.
Proposition 5.5**.**
Let x0,y0∈K, and let F={ϕ1,...,ϕs}⊂K[X]×K[X] be a set of pairs of polynomials ϕi=(fi,gi) such that ∑idegfi>∑ideggi>s. Suppose that x0 and y0 are not preperiodic for {f1,...,fs} and {g1,...,gs} respectively. Then {ϕ(x0,y0)∣ϕ∈Fn}⊂Δ for all but finitely many numbers n.
Proof.
Using Lemma 2.2 and the hypothesis, we proceed similarly as in the previous proof, so that for some positive numbers δ and ϵ, we have that
[TABLE]
for every k large enough, from where the result follows.
∎
Acknowledgements: I am very grateful to Alina Ostafe, John Roberts and Igor Shparlinski for
their much helpful suggestions and comments. I also thank Professor Dragos Ghioca for valuable comments, discussions and suggestions.
I am very thankful to ARC Discovery Grant DP180100201 and UNSW for supporting me in this work.