This paper characterizes the set of parameters for quadratic polynomials where two given integers are simultaneously preperiodic, extending previous results and completing the classification for certain integer pairs.
Contribution
It completes the classification of parameters where two integers are simultaneously preperiodic for quadratic polynomials, building on Buff's approach.
Findings
01
Set of parameters for given integers is fully described when their absolute values differ.
02
Confirmed that the set is finite and explicitly determined for specific integer pairs.
03
Extended previous results to a broader class of integer parameters.
Abstract
In this article, we study the set of parameters c∈C for which two given complex numbers a and b are simultaneously preperiodic for the quadratic polynomial fc(z)=z2+c. Combining complex-analytic and arithmetic arguments, Baker and DeMarco showed that this set of parameters is infinite if and only if a2=b2. Recently, Buff answered a question of theirs, proving that the set of parameters c∈C for which both 0 and 1 are preperiodic for fc is equal to {−2,−1,0}. Following his approach, we complete the description of these sets when a and b are two given integers with ∣a∣=∣b∣.
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
TopicsAnalytic Number Theory Research · Mathematical Dynamics and Fractals · Meromorphic and Entire Functions
Full text
Simultaneously preperiodic integers for quadratic polynomials
Valentin Huguin
Institut de Mathématiques de Toulouse, UMR 5219, Université de Toulouse, CNRS, UPS, F-31062 Toulouse Cedex 9, France
In this article, we study the set of parameters c∈C for which two given complex numbers a and b are simultaneously preperiodic for the quadratic polynomial fc(z)=z2+c. Combining complex-analytic and arithmetic arguments, Baker and DeMarco showed that this set of parameters is infinite if and only if a2=b2. Recently, Buff answered a question of theirs, proving that the set of parameters c∈C for which both [math] and 1 are preperiodic for fc is equal to {−2,−1,0}. Following his approach, we complete the description of these sets when a and b are two given integers with ∣a∣=∣b∣.
2010 Mathematics Subject Classification:
Primary 37P05; Secondary 37F45, 37P35
1. Introduction
For c∈C, let fc:C→C be the complex quadratic map
[TABLE]
Given a point z∈C, we study the sequence (fc∘n(z))n≥0 of iterates of fc at z. The set {fc∘n(z):n≥0} is called the forward orbit of z under fc.
The point z is said to be periodic for fc if there exists an integer p≥1 such that fc∘p(z)=z. The least such integer p is called the period of z. The point z is said to be preperiodic for fc if its forward orbit is finite or, equivalently, if there is an integer k≥0 such that fc∘k(z) is periodic for fc. The smallest integer k with this property is called the preperiod of z.
Definition 1**.**
For a∈C, let Sa be the set defined by
[TABLE]
In this paper, we wish to examine these sets of parameters.
For n≥0, let Fn∈Z[c,z] be the polynomial given by
[TABLE]
The sequence (Fn)n≥0 satisfies F0(c,z)=z and the recursion formulas
[TABLE]
In particular, when n≥1, the polynomial Fn is monic in c of degree 2n−1 and monic in z of degree 2n.
Now, given a point a∈C, define – for k≥0 and p≥1 – the set
[TABLE]
For all k≥0 and p≥1, the set Sak,p contains at most 2k+p−1 elements and consists of the parameters c∈C for which the point a is preperiodic for fc with preperiod less than or equal to k and period dividing p.
In particular, it follows that the set
[TABLE]
is countable.
Proposition 2**.**
For every a∈C, the set Sa is infinite.
Proof.
To obtain a contradiction, suppose that Sa contains finitely many elements. Then, since the sequence (San,1)n≥0 is increasing, there exists an integer N≥0 such that San+1,1=San,1 for all n≥N. Now, note that, for every n≥0, we have
[TABLE]
It follows that, if n≥N and γ is a root of the polynomial Fn+1(c,a)+Fn(c,a), then
[TABLE]
and hence Fn+1(γ,a)=Fn(γ,a)=0, which yields γ=0. Therefore, we have Fn(0,a)=0 and Fn+1(c,a)+Fn(c,a)=c2n for all n≥N. In particular, we get
[TABLE]
which contradicts the fact that FN+2(c,a)+FN+1(c,a)=c2N+1.
∎
Remark 3*.*
Note that, if a∈C, then fc(a)=fc(−a) for all c∈C. Consequently, we have Sa=S−a and Sak,p=S−ak,p for all k≥1 and p≥1.
We have −2∈S02,1∩S11,1, −1∈S00,2∩S11,2 and 0∈S00,1∩S10,1 (see Figure 3).
Since the sets Sa are countably infinite (see Proposition 2), we may wonder whether the sets Sa∩Sb are infinite. This question was answered by Baker and DeMarco in [BD11]. Using potential theory and an equidistribution result for points of small height with respect to an adelic height function, they proved that the set Sa∩Sb is infinite if and only if a2=b2.
As they pointed out, their proof is not effective and does not provide any estimate on the cardinality of these sets when they are finite. In their article, Baker and DeMarco conjectured that −2, −1 and [math] were the only parameters c∈C for which [math] and 1 are simultaneously preperiodic for fc (see Example 6). Using localization properties of the set of parameters c∈C for which both [math] and 1 have bounded forward orbit under fc and the fact that [math] is the only parameter c∈C that is contained in the main cardioid of the Mandelbrot set and for which [math] is preperiodic for fc, Buff gave an elementary proof of their conjecture in [Buf18].
Following his approach, we complete the description of the sets Sa∩Sb when a and b are two given integers with ∣a∣=∣b∣. More precisely, we prove the following theorem, which asserts that Example 5 and Example 6 present all the parameters c∈C for which two given distinct and non-opposite integers are simultaneously preperiodic for the polynomial fc:
Theorem 7**.**
Assume that a and b are two integers with ∣b∣>∣a∣. Then
•
either a=0, ∣b∣=1 and Sa∩Sb={−2,−1,0},
•
or a=0, ∣b∣=2 and Sa∩Sb={−2},
•
or ∣a∣≥1, ∣b∣=∣a∣+1 and Sa∩Sb={−a2−∣a∣−1,−a2−∣a∣},
•
or ∣b∣>max{2,∣a∣+1} and Sa∩Sb=∅.
Our proof is elementary and uses only basic analytic and arithmetic arguments. In particular, the reader does not need to be familiar with complex dynamics.
In Section 2, we reprove some well-known results on the dynamics of the polynomials fc. In Section 3, we go back to the study of the parameter space and give a proof of Theorem 7.
Acknowledgments*.*
The author would like to thank his Ph.D. advisors, Xavier Buff and Jasmin Raissy, for helpful discussions without which this paper would not exist.
2. The dynamics of the quadratic polynomials
We shall investigate here the dynamics of the quadratic maps fc:C→C.
Given a parameter c∈C, let Xc be the set
[TABLE]
and, for k≥0 and p≥1, let Xck,p be the set
[TABLE]
For all k≥0 and p≥1, the set Xck,p contains at most 2k+p elements, is invariant under fc and consists of the preperiodic points for fc with preperiod less than or equal to k and period dividing p. In particular, we have
[TABLE]
Moreover, the set Xc is completely invariant under fc – that is, for every z∈C, fc(z)∈Xc if and only if z∈Xc.
Remark 8*.*
Note that, if c∈C, then fc(z)=fc(−z) for all z∈C. Therefore, the sets Xc and Xck,p, with k≥1 and p≥1, are symmetric with respect to the origin.
Proposition 9**.**
For every c∈C, we have
[TABLE]
where ρc=21+1+4∣c∣.
Proof.
For every z∈C, we have ∣fc(z)∣≥∣z∣2−∣c∣, and ∣z∣2−∣c∣>∣z∣ if and only if ∣z∣>ρc. It follows by induction that, if z∈C satisfies ∣z∣>ρc, then fc∘(k+p)(z)>fc∘k(z) for all k≥0 and p≥1, and hence z is not preperiodic for fc. As the set Xc is invariant under fc, this completes the proof of the proposition.
∎
Now, let us study the dynamics of the polynomial fc when c is a real parameter. Suppose that c∈(−∞,41]. Then the map fc:R→R is even and strictly increasing on R≥0, has two fixed points αc≤βc – with equality if and only if c=41 – given by
[TABLE]
and satisfies fc(z)>z for all z∈(βc,+∞). In particular, we have
[TABLE]
and the sequence (fc∘n(z))n≥0 diverges to +∞ for all z∈(−∞,−βc)∪(βc,+∞).
It follows that, if c∈[−2,41], then
[TABLE]
and hence, for every z∈R, the point z has bounded forward orbit under fc if and only if z∈[−βc,βc].
Remark 10*.*
Note that, for every c∈C, we have ρc=β−∣c∣.
Let us examine more thoroughly the dynamics of the map fc when c∈(−∞,−2]. It is related to the dynamics of the shift map in the space of sign sequences.
Let σ:{−1,1}Z≥0→{−1,1}Z≥0 denote the shift map, which sends any sequence ε=(ϵn)n≥0 of ±1 to the sequence (ϵn+1)n≥0.
A sign sequence ε is said to be periodic with periodp≥1 if σ∘p(ε)=ε and p is the least such integer. The sequence ε is said to be preperiodic with preperiodk≥0 if the sequence σ∘k(ε) is periodic and k is minimal with this property.
For k≥0 and p≥1, define
[TABLE]
to be the set of all preperiodic sign sequences with preperiod less than or equal to k and period dividing p, and define
[TABLE]
to be the collection of all preperiodic sign sequences. For all k≥0 and p≥1, the set Σk,p contains exactly 2k+p elements – each of them being completely determined by the choice of its first k+p terms – and is invariant under the shift map. Moreover, the set Σ is completely invariant under the shift map – that is, any sign sequence ε is preperiodic if and only if the sequence σ(ε) is preperiodic.
Theorem 11**.**
For every c∈(−∞,−2], there exists a unique map
[TABLE]
that makes the diagram below commute and satisfies ϵ0ψc(ε)≥0 for all ε∈Σ.
for all c∈(−∞,−2], and the map ζε:(−∞,−2]→R defined by
[TABLE]
is continuous.
Before proving Theorem 11, observe that c≤−βc for all c∈(−∞,−2], with equality if and only if c=−2. Consequently, for c∈(−∞,−2] and ϵ=±1, the partial inverse gcϵ:[c,+∞)→R of fc given by
[TABLE]
is well defined on [−βc,βc], and we have
[TABLE]
Lemma 12**.**
For all c∈(−∞,−2] and all ε=(ϵ0,…,ϵp−1)∈{−1,1}p, with p≥1, the map gcε:[−βc,βc]→[−βc,βc] defined by
[TABLE]
has a unique fixed point zε(c).
Moreover, for every finite sequence ε of ±1, the map c↦zε(c) is continuous.
Claim 13*.*
If c∈(−∞,−2], ε∈{−1,1}p, with p≥1, and z is a fixed point of gcε, then z∈Xc0,p and ϵjfc∘j(z)>0 for all j∈{0,…,p−1}.
Fix c∈(−∞,−2] and p≥1. For every ε∈{−1,1}p, the map gcε has a fixed point zε(c) by the intermediate value theorem. Now, note that zε(c) is not a fixed point of gcε′ whenever ε=ε′∈{−1,1}p by Claim 13. Therefore, the points zε(c), with ε∈{−1,1}p, are pairwise distinct, and, since Xc0,p contains at most 2p elements, it follows that
[TABLE]
Thus, for every ε∈{−1,1}p, zε(c) is the unique fixed point of the map gcε.
Now, fix p≥1, ε=(ϵ0,…,ϵp−1)∈{−1,1}p and c∈(−∞,−2]. It remains to verify that the map c′↦zε(c′) is continuous at c. For each c′∈(−∞,−2], choose εc′∈{−1,1}p such that zε(c)−zεc′(c′) is minimal. Then we have
[TABLE]
for all c′∈(−∞,−2], and so zεc′(c′) tends to zε(c) as c′ approaches c. By Claim 13, it follows that, whenever c′ is close enough to c, we have ϵjfc′∘j(zεc′(c′))>0 for all j∈{0,…,p−1}, which yields εc′=ε. Thus, the limit of zε(c′) as c′ approaches c is zε(c), and the lemma is proved.
∎
Fix c∈(−∞,−2]. Assume that ψc:Σ→R is a map that satisfies fc∘ψc=ψc∘σ and ϵ0ψc(ε)≥0 for all ε∈Σ. Then, for all ε∈Σ and all n≥0, we have
[TABLE]
It follows that, if ε is a periodic sign sequence with period p≥1, then ψc(ε) is a fixed point of the map gcεp, where εp=(ϵ0,…,ϵp−1)∈{−1,1}p, and hence ψc(ε)=zεp(c). Therefore, for every ε∈Σ with preperiod k≥0 and period p≥1, we have ψc(ε)=gcεpp(zεp(c)), where εpp=(ϵ0,…,ϵk−1)∈{−1,1}k and εp=(ϵk,…,ϵk+p−1)∈{−1,1}p, adopting the convention that gc∅ denotes the identity map of [−βc,βc]. In particular, there is at most one map ψc:Σ→R that satisfies the conditions above.
For ε=(ϵn)n≥0 a preperiodic sign sequence with preperiod k≥0 and period p≥1, define εpp=(ϵ0,…,ϵk−1)∈{−1,1}k, εp=(ϵk,…,ϵk+p−1)∈{−1,1}p and ψc(ε)=gcεpp(zεp(c)). If ε is a periodic sign sequence with period p≥1, then fc∘ψc(ε) is a fixed point of the map gcσ(ε)p since σ(ε)p=(ϵ1,…,ϵp−1,ϵ0), and hence fc∘ψc(ε)=ψc∘σ(ε). Similarly, if ε∈Σ has preperiod k≥1 and period p≥1, then fc∘ψc(ε)=ψc∘σ(ε) since σ(ε)pp=(ϵ1,…,ϵk−1) and σ(ε)p=εp. Moreover, for all ε∈Σ, we have ψc(ε)∈gcϵ0([−βc,βc]), which yields
[TABLE]
Thus, the map ψc:Σ→R so defined has the required properties.
Furthermore, for every ε∈Σ, the map ζε:c↦ψc(ε) is clearly continuous.
∎
Remark 14*.*
Observe that, if c∈(−∞,−2] and ε,ε′∈Σ satisfy ϵ0=−ϵ0′ and σ(ε)=σ(ε′), then ψc(ε)=−ψc(ε′).
Note that the proof of Theorem 11 provides explicit formulas for the maps ζε with ε∈Σk,1 and k≥0.
Example 15**.**
Suppose that ϵ=±1. Then
•
for ε∈Σ1,1 given by ϵ0=ϵ and ϵ1=−1, we have
[TABLE]
•
for ε∈Σ1,1 given by ϵ0=ϵ and ϵ1=1, we have
[TABLE]
•
for ε∈Σ2,1 given by ϵ0=ϵ, ϵ1=1 and ϵ2=−1, we have
[TABLE]
•
for ε∈Σ2,1 given by ϵ0=ϵ, ϵ1=−1 and ϵ2=1, we have
Furthermore, if c∈(−∞,−2), then the map ψc:Σ→R is injective.
Proof.
For all n≥0, we have fc∘n∘ψc=ψc∘σ∘n. Consequently, ψc(Σk,p)⊂Xck,p for all k≥0 and p≥1.
Now, suppose that c∈(−∞,−2). Then, for all ε∈Σ and all n≥0, we have
[TABLE]
Therefore, the map ψc is injective, and, since Xck,p contains at most 2k+p elements, it follows that ψc(Σk,p)=Xck,p, for all k≥0 and p≥1.
It remains to prove that X−2k,p⊂ψ−2(Σk,p) for all k≥0 and p≥1. Fix k≥0 and p≥1, and suppose that z∈X−2k,p. Then, for all c∈(−∞,−2), we have
[TABLE]
As the maps ζε, with ε∈Σk,p, are continuous at −2, it follows that z∈ψ−2(Σk,p). Thus, the proposition is proved.
∎
Remark 17*.*
Applying Montel’s theorem, it follows from Proposition 16 that, for every c∈(−∞,−2], the filled-in Julia set of fc – that is, the set of points z∈C that have bounded forward orbit under fc – is also contained in [−βc,βc].
Note that the map ψ−2 is not injective. More precisely, we have the following:
Proposition 18**.**
For all ε=ε′∈Σ, ψ−2(ε)=ψ−2(ε′) if and only if there exists an integer k≥2 such that ε,ε′∈Σk,1, ϵj=ϵj′ for all j∈{0,…,k−3}, ϵk−2=−ϵk−2′, ϵk−1=ϵk−1′=−1 and ϵk=ϵk′=1.
Proof.
Suppose that ε=ε′∈Σ satisfy ψ−2(ε)=ψ−2(ε′). Then, for all n≥0, we have
[TABLE]
Since ε=ε′, it follows that there is an integer k≥0, which we may assume minimal, such that f−2∘k(ψ−2(ε))=0. For all j∈{0,…,k−1}, the inequalities above are strict, and hence ϵj=ϵj′. Moreover, we have f−2∘(k+1)(ψ−2(ε))=−2 and f−2∘n(ψ−2(ε))=2 for all n≥k+2, which yields ϵk+1=ϵk+1′=−1 and ϵn=ϵn′=1 for all n≥k+2. Thus, the sign sequences ε and ε′ have the desired form.
Conversely, observe that, for ε∈Σ2,1 with ϵ1=−1 and ϵ2=1, we have
[TABLE]
Therefore, if k≥2 and ε∈Σk,1 satisfies ϵk−1=−1 and ϵk=1, then
[TABLE]
does not depend on ϵk−2. This completes the proof of the proposition.
∎
Remark 19*.*
It follows from Proposition 16 and Proposition 18 that, for all k≥0 and p≥1, the set X−2k,p contains exactly 2p elements if k=0 and 2k+p−2k−1+1 elements if k≥1.
Remark 20*.*
Note that we can actually describe the map ψ−2:Σ→R explicitly. For ε∈Σ, define the sequence (δn(ε))n≥0∈{0,1}Z≥0 by
[TABLE]
where δ−1(ε)=0 by convention. Then the map ψ−2:Σ→R is given by
[TABLE]
3. Back to the parameter space
We shall now exploit the statements given in Section 2 to get results concerning the parameter space.
Remark 21*.*
By definition, for every point a∈C and every parameter c∈C, c∈Sa if and only if a∈Xc and, for all k≥0 and p≥1, c∈Sak,p if and only if a∈Xck,p.
Proposition 22**.**
For every a∈C, we have
[TABLE]
where Ra=∣a∣2+∣a∣2+1+1.
Proof.
Suppose that c∈Sa. Then, by Proposition 9, we have
[TABLE]
and hence φ(∣c∣)≤∣a∣2, where φ:R≥0→R is given by
[TABLE]
The map φ is strictly increasing and satisfies φ(Ra)=∣a∣2. Thus, the proposition is proved.
∎
Now, let us give a more extensive description of Sa when a∈(−∞,−2]∪[2,+∞).
Given ϵ=±1, let Σϵk,p – with k≥0 and p≥1 – be the set defined by
[TABLE]
and let Σϵ be the set defined by
[TABLE]
For all k≥0 and p≥1, the set Σϵk,p contains exactly 2k+p−1 elements – each of them being completely determined by the choice of its terms with index in {1,…,k+p−1}.
Suppose that a∈(−∞,−2]∪[2,+∞). Then
•
for ε∈Σsgn(a)2,1 given by ϵ1=−1 and ϵ2=1, the map
[TABLE]
is strictly decreasing on (−∞,−2] and we have ζε(ca−)=a, where ca− is the parameter defined by
[TABLE]
•
for ε∈Σsgn(a)1,1 given by ϵ1=1, the map
[TABLE]
is strictly decreasing on (−∞,−2] and we have ζε(ca+)=a, where ca+ is the parameter defined by
[TABLE]
Remark 23*.*
Note that, for every a∈C with ∣a∣≥2, we have Ra=−c∣a∣−.
Theorem 24**.**
Assume that a∈(−∞,−2]∪[2,+∞). Then there is a unique map
[TABLE]
that satisfies ζε(γa(ε))=a for all ε∈Σsgn(a) (see Figure 5).
Furthermore, we have
[TABLE]
for all k≥0 and p≥1, (see Figure 6) and the map γa is injective.
Claim 25*.*
If a∈(−∞,−2]∪[2,+∞) and γ∈(−∞,−2], then a has at most one preimage under ψγ.
and hence, by the intermediate value theorem, there exists γa(ε)∈[ca−,ca+] such that ζε(γa(ε))=a. Now, note that, if ε∈Σsgn(a)k,p – with k≥0 and p≥1 – and γ∈(−∞,−2] satisfy ζε(γ)=a, then ε is a preimage of a under ψγ, and in particular γ∈Sak,p. Therefore, by Claim 25, the map γa so defined is injective, and, as Sak,p contains at most 2k+p−1 elements, it follows that γa(Σsgn(a)k,p)=Sak,p, for all k≥0 and p≥1. Thus, for every ε∈Σsgn(a), γa(ε) is the unique parameter γ∈(−∞,−2] that satisfies ζε(γ)=a. This completes the proof of the theorem.
∎
Remark 26*.*
Applying Montel’s theorem, it follows from Theorem 24 that, for every a∈(−∞,−2]∪[2,+∞), the set of parameters c∈C for which the point a has bounded forward orbit under fc is also contained in the line segment [ca−,ca+].
Note that, when a is an integer, the set Sa has the following arithmetic property:
Proposition 27**.**
For every a∈Z, the set Sa is contained in the set of algebraic integers and is invariant under the action of Gal(Q/Q).
Proof.
For all k≥0 and p≥1, the polynomial Fk+p(c,a)−Fk(c,a) is monic with integer coefficients since a∈Z. Thus, the proposition is proved.
∎
We shall now prove Theorem 7, which we recall below.
Theorem 7.
Assume that a and b are two integers with ∣b∣>∣a∣. Then
•
either a=0, ∣b∣=1 and Sa∩Sb={−2,−1,0},
•
or a=0, ∣b∣=2 and Sa∩Sb={−2},
•
or ∣a∣≥1, ∣b∣=∣a∣+1 and Sa∩Sb={−a2−∣a∣−1,−a2−∣a∣},
•
or ∣b∣>max{2,∣a∣+1} and Sa∩Sb=∅.
Lemma 28**.**
Assume that m∈Z and c is an algebraic integer whose all Galois conjugates lie in the interval (m−2,m]. Then c=m−1 or c=m.
For a proof of the case a=0 and ∣b∣=1, we refer the reader to [Buf18, Proposition 6].
Thus, we may assume that ∣b∣≥2. By Proposition 22, Theorem 24 and Proposition 27, the set Sa∩Sb is contained in the set of algebraic integers, is invariant under the action of Gal(Q/Q) and satisfies
[TABLE]
Suppose that a=0. Then we have
[TABLE]
with equality if and only if ∣b∣=2. Therefore, Sa∩Sb⊂{−2} if ∣b∣=2 and Sa∩Sb=∅ otherwise. Conversely, observe that −2∈Sa2,1∩Sb1,1 when ∣b∣=2.
Now, suppose that ∣a∣≥1. Then we have
[TABLE]
and
[TABLE]
Therefore, Sa∩Sb⊂{−a2−∣a∣−1,−a2−∣a∣} if ∣b∣=∣a∣+1 by Lemma 28 and Sa∩Sb=∅ otherwise. Conversely, observe that −a2−∣a∣−1∈Sa1,2∩Sb1,2 and −a2−∣a∣∈Sa1,1∩Sb1,1 when ∣b∣=∣a∣+1. Thus, the theorem is proved.
∎
Bibliography2
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[BD 11] Matthew Baker and Laura De Marco, Preperiodic points and unlikely intersections , Duke Math. J. 159 (2011), no. 1, 1–29. MR 2817647
2[Buf 18] Xavier Buff, On postcritically finite unicritical polynomials , New York J. Math. 24 (2018), 1111–1122. MR 3890968