arXiv is now an independent nonprofit! Learn more
License: CC BY 4.0
arXiv:2602.00293v3 [math.DS] 22 Jul 2026

Smooth Circle Covering with a Physical Measure on a Hyperbolic Repelling Fixed PointThanks: We thank Stefano Luzzatto for his supervision, and the anonymous referee for the suggestion to improve the regularity of our results to CC^{\infty}.

Rubio Gunawan 1Scuola Internazionale Superiore di Studi Avanzati (SISSA), Trieste, Italy 1Abdus Salam International Centre for Theoretical Physics (ICTP), Trieste, Italy.
Date: August 11, 2026

1. Main Result and Discussion

1.1. Setting and Literature Study

In dynamical systems, given a point xx, we often look for descriptions of long-term behavior of the forward orbit {xn}n0\{x_{n}\}_{n\geq 0}. In ergodic theory we use the notion of empirical measure, which is the sequence of measures defined by 1ni=0n1δxi\frac{1}{n}\sum_{i=0}^{n-1}\delta_{x_{i}}. Given a measure μ\mu, its basin of attraction BμB_{\mu} is the set of points whose sequence of empirical measures weakly converge to μ\mu: Bμ:={x:limn1ni=0n1δxiμ}B_{\mu}:=\left\{x:\lim_{n\to\infty}\frac{1}{n}\sum_{i=0}^{n-1}\delta_{x_{i}}\to\mu\right\}. A measure μ\mu is called a physical measure if BμB_{\mu} has positive Lebesgue measure.

A fixed point pp supporting a physical measure δp\delta_{p} is an example of a statistical attractor. A point xBδpx\in B_{\delta_{p}} is not attracted to pp in the classical sense, but given an arbitrarily small neighborhood of pp, for sufficiently large timescales the orbit will almost always be inside that neighborhood. A topological attractor (such as a fixed point pp with |f(p)|<1|f^{\prime}(p)|<1) is a trivial example of a statistical attractor. A well-known example of statistical attractors that are not topological attractors are the intermittency maps of [5] and [4], which feature a topologically repelling indifferent fixed point pp with f(p)=1f^{\prime}(p)=1.

In this paper we will focus on the more interesting and counterintuitive situation of a hyperbolic repelling fixed point with |f(p)|>1|f^{\prime}(p)|>1. We coin a new term for fixed points that are hyperbolic repelling and also statistical attractors.

Definition 1.1.

pp is called a Sisyphus Attractor if |f(p)|>1|f^{\prime}(p)|>1 and |Bδp|>0|B_{\delta_{p}}|>0.

Hofbauer and Keller [3] first proved the existence of Sisyphus Attractors for unimodal maps using the rich combinatorics of the kneading sequence within a full family. We consider instead the setting of circle coverings, which can also be seen as full branch maps in which all branches are orientation preserving.

Definition 1.2.

𝒟\mathcal{D} is the set of circle local homeomorphisms f:𝕊1𝕊1f:\mathbb{S}^{1}\to\mathbb{S}^{1} that are topologically conjugate to the doubling map (x2x mod 1x\mapsto 2x\text{ mod }1).

As far as we know, there are no known examples of Sisyphus Attractors in the literature for maps in 𝒟\mathcal{D}. However, Benedicks-Misiurewicz [1] and Zweimüller [6] studied some unimodal maps with flat (all derivatives vanishing) critical points. Both papers, using different arguments, show that integrability of log|f|\log|f^{\prime}| is equivalent to the existence of an absolutely continuous invariant probability measure (ACIP). In particular, [6] proves the existence of an induced Gibbs-Markov map with bounded distortion, and shows that existence of an ACIP is also equivalent to the integrability of first return time. In the special case with full branches, by additional arguments, it should be possible to show that nonintegrability of first return time implies the existence of a Sisyphus Attractor. By further arguments, including applying an involution, it might be possible to obtain a Sisyphus Attractor using the same methods for a circle covering, which might or might not be in 𝒟\mathcal{D}.

The purpose of this paper is to introduce a new method to find a Sisyphus Attractor for a circle covering map. For f𝒟f\in\mathcal{D}, let pp denote its unique fixed point, and qq denote the unique preimage of pp other than itself. We have:

Theorem 1.3.

f𝒟C(𝕊1)\exists f\in\mathcal{D}\cap C^{\infty}(\mathbb{S}^{1}) and pp is a Sisyphus Attractor.

Our argument for the proof of Theorem 1.3 also uses a full branch induced map but, unlike [6], our induced map has unbounded distortion and integrable return times. It is therefore a completely different mechanism from those used in the previous literature for unimodal maps. We also emphasize that in order to have a CC^{\infty} construction, we needed qq to be a flat critical point, but unlike the case of the unimodal maps, this flatness is not essential to obtain a Sisyphus Attractor. We will elaborate this role of flatness further in Section 8. In fact, we obtain a full measure BδpB_{\delta_{p}} by sacrificing smoothness and flatness at qq:

Theorem 1.4.

f𝒟C(𝕊1{q})\exists f\in\mathcal{D}\cap C^{\infty}(\mathbb{S}^{1}\setminus\{q\}) and pp is a Sisyphus Attractor with |Bδp|=1|B_{\delta_{p}}|=1.

We also conjecture that fC(𝕊1)f\in C^{\infty}(\mathbb{S}^{1}) and |Bδp|=1|B_{\delta_{p}}|=1 are compatible, but we were unable to prove it with our methods.

Conjecture 1.5.

f𝒟C(𝕊1)\exists f\in\mathcal{D}\cap C^{\infty}(\mathbb{S}^{1}) and pp is a Sisyphus Attractor with |Bδp|=1|B_{\delta_{p}}|=1.

Also observe that for the doubling map (x2x mod 1x\mapsto 2x\text{ mod }1), we have |Bδp|=0|B_{\delta_{p}}|=0. This implies that the topological conjugacy of our results with the doubling map is singular. The conjugacy also implies that the basins in our results are meagre.

2. Outline of Proof

The general strategy for this paper is to find maps f𝒟f\in\mathcal{D} that have a particular first return map FF, in order to apply our previous results on wild attractors in [2].

For the rest of the paper, for any given map f𝒟f\in\mathcal{D}, we will identify the circle 𝕊1\mathbb{S}^{1} with the unit interval I=[0,1]I=[0,1] with endpoints identified, the unique fixed point p=0=1p=0=1, and the other preimage of pp as a point q(0,1)q\in(0,1). We will then treat ff as an orientation preserving full branch map with 2 branches, with respect to the partition 𝒫={I1=[0,q),I2=[q,1)}\mathcal{P}=\{I_{1}=[0,q),I_{2}=[q,1)\}. We now study the first return map of ff on I2I_{2}. First we introduce this related space of full branch maps defined on [q,1][q,1].

Definition 2.1.

Let \mathcal{F}^{\prime} denote the set of orientation-preserving full branch maps F:[q,1][q,1]F:[q,1]\to[q,1] , F(q)=F(1)=1F(q)=F(1)=1. and branch domains {Kn}n\{K_{n}\}_{n\in\mathbb{N}} defined by

(1) Kn=[zn+1,zn),K_{n}=[z_{n+1},z_{n}),

where (zn)n1(z_{n})_{n\geq 1} is a decreasing sequence with z1=1z_{1}=1 and znqz_{n}\to q.

Definition 2.2.

Let \mathcal{F} be the set of maps in \mathcal{F}^{\prime} that have a generating partition.

Let f𝒟f\in\mathcal{D}, τ\tau its first return time on [q,1][q,1], and FF its first return map on [q,1][q,1]. Then FF\in\mathcal{F}. We now show how the dynamics of certain points by FF can give us information of their dynamics by ff. For a point xI2x\in I_{2}, we have the sequence of return times {τi(x)}i0\{\tau_{i}(x)\}_{i\geq 0}, defined by τi(x)=τ(Fi(x))\tau_{i}(x)=\tau(F^{i}(x)). Define EE to be the set of points whose sequence of return times has a strictly increasing tail:

(2) E={xI2|T0:iT,τi+1(x)>τi(x)}.E=\{x\in I_{2}|\exists T\geq 0:\forall i\geq T,\tau_{i+1}(x)>\tau_{i}(x)\}.

Note that EE is fully invariant by FF. We then have:

Proposition 2.3.

Let f𝒟f\in\mathcal{D}, and FF be its first return map on I2I_{2}. Then EBδ0E\subset B_{\delta_{0}}.

We introduce some tools to estimate the Lebesgue measure of EE. Given FF\in\mathcal{F} defined on I2I_{2}, for each branch domain KnK_{n}, we define the following set:

(3) Kn:=mn+1Km=(q,zn+1).K_{n}^{-}:=\bigcup_{m\geq n+1}K_{m}=(q,z_{n+1}).

Note that KnK_{n}^{-} is the union of the branch domains to the left of KnK_{n}. We also define:

(4) Ln\displaystyle L_{n} :={xKn:F(x)Kn}Kn.\displaystyle:=\left\{x\in K_{n}:F(x)\in K_{n}^{-}\right\}\subset K_{n}.

Note that LnL_{n} is a subinterval of KnK_{n} that shares its left endpoint. We pay particular attention to maps FF such that |Ln|/|Kn|1|L_{n}|/|K_{n}|\to 1 fast enough:

Definition 2.4.

\mathcal{F}_{*} is the set of maps in \mathcal{F} such that there exists a monotonically increasing sequence (pn)(p_{n}) of positive numbers such that: |Ln|/|Kn|pn{|L_{n}|}/{|K_{n}|}\geq p_{n} and n1pn>0\prod_{n\geq 1}p_{n}>0. Furthermore we define two subfamilies:

weak\displaystyle\mathcal{F}_{*}^{weak} :={F:n,f|Ln:LnKn is convex.}\displaystyle:=\{F\in\mathcal{F}:\forall n,f|_{L_{n}}:L_{n}\to K_{n}^{-}\text{ is convex.}\}
strong\displaystyle\mathcal{F}_{*}^{strong} :={F:n,f|Kn:KnI2 is convex.}\displaystyle:=\{F\in\mathcal{F}:\forall n,f|_{K_{n}}:K_{n}\to I_{2}\text{ is convex.}\}

The subfamilies weak\mathcal{F}_{*}^{weak} and strong\mathcal{F}_{*}^{strong} give us estimates on |C||C| and |E||E|:

Proposition 2.5.

Let f𝒟f\in\mathcal{D}. Let FF be its first return map on [q,1][q,1].

  1. (1)

    If FweakF\in\mathcal{F}_{*}^{weak}, then |E|>0|E|>0. In particular by Proposition 2.3, |Bδ0|>0|B_{\delta_{0}}|>0.

  2. (2)

    If FstrongF\in\mathcal{F}_{*}^{strong}, then |E|=|I2||E|=|I_{2}|. In particular by Proposition 2.3, |Bδ0|=1|B_{\delta_{0}}|=1.

By Proposition 2.5, the following Propositions 2.6 and 2.7 are now sufficient to prove our main Theorems 1.3 and 1.4 respectively.

Proposition 2.6.

There exists f𝒟C(𝕊1)f\in\mathcal{D}\cap C^{\infty}(\mathbb{S}^{1}) such that f(p)>1f^{\prime}(p)>1, and the first return map FF on [q,1][q,1] is an element of weak\mathcal{F}_{*}^{weak}.

Proposition 2.7.

There exists f𝒟f\in\mathcal{D} such that f(p)>1f^{\prime}(p)>1, fC(𝕊1{q})f\in C^{\infty}(\mathbb{S}^{1}\setminus\{q\}) and the first return map FF on [q,1][q,1] is an element of strong\mathcal{F}_{*}^{strong}

A key ingredient for the proofs of Proposition 2.6 and 2.7 is the realization method given by Proposition 5.1, which shows how to find a map f𝒟f\in\mathcal{D} that has a given map FF\in\mathcal{F}^{\prime} as its first return map.

We briefly outline the contents of the remaining sections. In Section 3 we prove Proposition 2.3. In Section 4 we prove Proposition 2.5. In Section 5 we give a number of ”realization-type” results which specify conditions on a pair f1:[0,q)[0,1)f_{1}:[0,q)\to[0,1) and FF\in\mathcal{F}^{\prime} to guarantee the existence of f2f_{2} which satisfies certain properties. In Sections 6 and 7 we do the highly nontrivial construction of maps which satisfy the conditions of Section 5 to prove Propositions 2.6 and 2.7. In Section 8 we make remarks on the role of a flat critical point that appears in our results.

3. Induced Dynamics

In this section we prove Proposition 2.3, which shows how the dynamics of the return time by the induced map can determine the empirical measure. Fix a map f𝒟f\in\mathcal{D} and let FF\in\mathcal{F} be its first return map on I2I_{2}. Recall the sequence of return times {τi(x)}i0\{\tau_{i}(x)\}_{i\geq 0}, and the set of points with eventually strictly increasing return times EE as defined in (2). We define the sequence of cumulative return times. i1,Ri(x):=0j<iτj(x)\forall i\geq 1,R_{i}(x):=\sum_{0\leq j<i}\tau_{j}(x) For consistency, we define R0:=0R_{0}:=0.

Proof of Proposition 2.3.

Fix a point xEx\in E. It is sufficient to prove that for any interval neighborhood UU of 00, the proportion of visits to UU tends to 1, that is:

limJ#{0j<J:xjU}J=1.\displaystyle\lim_{J\to\infty}\frac{\#\{0\leq j<J:x_{j}\in U\}}{J}=1.

Now fix an interval neighborhood UU of 00. Let rr be the right endpoint of UU. Let NN be the smallest integer such that fN(r)I2f^{N}(r)\in I_{2}. Because ff is an orientation preserving homeomorphism, points outside of UU must visit I2I_{2} in time NN or less. Thus for the range of time between Ri(x)R_{i}(x) and Ri+1(x)R_{i+1}(x), the orbit of xjx_{j} must spend at least τi(x)N\tau_{i}(x)-N time inside UU. Because xEx\in E, for ii sufficiently large, we have τi(x)>>N\tau_{i}(x)>>N. Therefore as JJ\to\infty, the proportion of times that xjx_{j} spends in UU tends to 11. ∎

4. Dynamics of F

In this section we estimate the Lebesgue measure of EE to prove Proposition 2.5. Let f𝒟f\in\mathcal{D}, and FF\in\mathcal{F} be its first return map on I2I_{2}. Recall the definition of EE in (2) and the left subintervals LnKnL_{n}\subset K_{n} in (4). Recall also that the partition 𝒫F={Kn}n1\mathcal{P}^{F}=\{K_{n}\}_{n\geq 1} is defined by first return time τ\tau (i.e. xKnτ(x)=nx\in K_{n}\iff\tau(x)=n). Therefore, we obtain the following expression for EE in terms of LnL_{n}:

E={xI2|T0:Fi(x)m1Lm for all iT}.E=\{x\in I_{2}|\exists T\geq 0:F^{i}(x)\in\bigcup_{m\geq 1}L_{m}\text{ for all }i\geq T\}.

Note that this new expression allows us to extend the definition of EE for general maps FF\in\mathcal{F}^{\prime} without specifying that it is the first return map of some f𝒟f\in\mathcal{D}. Now we define a family of related subsets of I2I_{2}:

C\displaystyle C :={xI2|Fi(x)m1Lm for all i0}.\displaystyle:=\{x\in I_{2}|F^{i}(x)\in\bigcup_{m\geq 1}L_{m}\text{ for all }i\geq 0\}.
Cn\displaystyle C_{n} :={xI2|Fi(x)m1Lm for all i such that 0i<n}.\displaystyle:=\{x\in I_{2}|F^{i}(x)\in\bigcup_{m\geq 1}L_{m}\text{ for all }i\text{ such that }0\leq i<n\}.

By definition, n1Cn=CE\bigcap_{n\geq 1}C_{n}=C\subset E. With these definitions, Proposition 2.5 is essentially proven in [2].

Proof of Proposition 2.5.

We prove the first item. Let FweakF\in\mathcal{F}_{*}^{weak}. By the proof of Proposition 2.1. of [2], we have |E|>|C||[q,1]|P>0|E|>|C|\geq|[q,1]|P>0. By Proposition 2.3, |Bδ0||E|>0|B_{\delta_{0}}|\geq|E|>0.

Now we prove the second item. Let FstrongF\in\mathcal{F}_{*}^{strong}. By the proof of Proposition 2.2. of [2], we have |E|=|[q,1]||E|=|[q,1]|. Thus EE is a subset of [q,1][q,1] with full Lebesgue Measure. Because f𝒟f\in\mathcal{D} and EBδ0E\subset B_{\delta_{0}}, we obtain |Bδ0|=1|B_{\delta_{0}}|=1.

5. Realization of Induced Maps

In this section we state several results, which show us how to find a two-branched map f:[0,1)[0,1)f:[0,1)\to[0,1) that has certain properties by choosing its first branch and first return map. The following subsections will contain the proofs of these results. For the rest of this section, let f1:[0,q)[0,1)f_{1}:[0,q)\to[0,1) be an orientation preserving nonsingular homeomorphism, and FF\in\mathcal{F}^{\prime} be defined on [q,1][q,1].

Proposition 5.1 (Realization Method).

There exists a unique homeomorphism f2:[q,1)[0,1)f_{2}:[q,1)\to[0,1), such that the full branch map f:[0,1)[0,1)f:[0,1)\to[0,1) defined by (f1,f2)(f_{1},f_{2}) has first return map FF on [q,1][q,1].

We give a sufficient condition such that f𝒟f\in\mathcal{D}:

Lemma 5.2.

If FF\in\mathcal{F} (which means FF has a generating partition), the unique ff from Proposition 5.1 has a generating partition and thus f𝒟f\in\mathcal{D}.

We give a sufficient condition on the pair (f1,F)(f_{1},F) such that f2f_{2} is CC^{\infty} on (q,1)(q,1):

Definition 5.3 (Adjusted First Return).

A pair (f1,F)(f_{1},F) is adjusted if there exists a sequence of positive real numbers (mn)n1(m_{n})_{n\geq 1} such that:

  1. (i)

    n1\forall n\geq 1, there exists an interval Ln=[zn+1,zn+1+δn)KnL_{n}=[z_{n+1},z_{n+1}+\delta_{n})\subset K_{n} where FF is affine with slope mnm_{n}, which means F|Ln(x)=q+mn(xzn+1)F|_{L_{n}}(x)=q+m_{n}(x-z_{n+1}).

  2. (ii)

    n2\forall n\geq 2, there exists an interval Rn=(znεn,zn)KnR_{n}=(z_{n}-\varepsilon_{n},z_{n})\subset K_{n} where the graph of FF is the graph of f1f_{1} around qq, contracted horizontally by a factor of mn1m_{n-1}, which means F|Rn(x)=f1(q+mn1(xzn))F|_{R_{n}}(x)=f_{1}(q+m_{n-1}(x-z_{n})).

  3. (iii)

    f1f_{1} is a CC^{\infty} diffeomorphism.

  4. (iv)

    FF has CC^{\infty} branches.

Lemma 5.4 (Adjusted Gluing Lemma).

Let the pair (f1,F)(f_{1},F) be adjusted. Take the unique f2:[q,1)[q,1)f_{2}:[q,1)\to[q,1) given by Proposition 5.1. Then f2f_{2} is CC^{\infty} on (q,1)(q,1).

We give a sufficient condition on the pair (f1,F)(f_{1},F) to glue f1,f2f_{1},f_{2} smoothly at qq:

Definition 5.5 (Gluing Flatly).

An adjusted pair (f1,F)(f_{1},F) glues flatly if it satisfies:

  1. (i)

    f1f_{1} extends as a CC^{\infty} diffeomorphism on [0,q][0,q], such that qq is a flat critical point (i.e. n1,f(n)(q)=0\forall n\geq 1,f^{(n)}(q)=0).

  2. (ii)

    There exists b[0,q)b\in[0,q) such that f1|[0,b]:[0,b][0,q]f_{1}|_{[0,b]}:[0,b]\to[0,q] is affine with slope m=q/b>0m=q/b>0. Thus the backward orbit of qq satisfies f1n(q)=qmnf_{1}^{-n}(q)=qm^{-n}.

  3. (iii)

    There exists α>0\alpha>0 such that the sequence of endpoints znz_{n} (as defined in (1)) satisfies znqnαz_{n}-q\approx n^{-\alpha}, where the notation \approx means the ratio of the two expressions are bounded above and below by uniform positive constants.

  4. (iv)

    k0\forall k\geq 0, there exists Ck,αk>0C_{k},\alpha_{k}>0 such that: maxxKn|F(k)(x)|Cknαk.\max_{x\in K_{n}}|F^{(k)}(x)|\leq C_{k}n^{\alpha_{k}}.

  5. (v)

    For any degree k1k\geq 1, there exists Dk>0D_{k}>0 and βk(0,1/α)\beta_{k}\in(0,1/\alpha) such that maxxKn|(f11)(k)(F(x))|exp(Dknβk).\max_{x\in K_{n}}|(f_{1}^{-1})^{(k)}(F(x))|\leq\exp(D_{k}n^{\beta_{k}}).

Lemma 5.6 (Flat Gluing Lemma).

Let (f1,F)(f_{1},F) glue flatly. Then the full branch map ff given by Proposition 5.1 is CC^{\infty} at qq, and qq is a flat critical point.

5.1. Realization

Proof of Proposition 5.1.

We will explicitly construct an f2f_{2} which proves Proposition 5.1. We first define a new family of subintervals:

(5) n1,Jn:=f1(n1)([q,1)).\displaystyle\forall n\geq 1,J_{n}:=f_{1}^{-(n-1)}([q,1)).

Essentially, JnJ_{n} is the set of points in II such that its first visit to [q,1)[q,1) is in time (n1)(n-1). In particular, J1=[q,1)J_{1}=[q,1). Note that the family {Jn}n\{J_{n}\}_{n\in\mathbb{N}} partitions (0,1)(0,1). The subintervals JnJ_{n} accumulate (monotonically in nn) only at the left endpoint 00, in a similar manner to the subintervals KnK_{n} of 𝒫F\mathcal{P}^{F}. Recall we want f2f_{2} to be defined such that FF is the first return map of ff on [q,1][q,1]. Fix a partition element KnK_{n}, which we want to have points with return time nn. f2|Knf_{2}|_{K_{n}} must satisfy (f1)n1f2|Kn=F|Kn(f_{1})^{n-1}\circ f_{2}|_{K_{n}}=F|_{K_{n}}. So we must define f2|Knf_{2}|_{K_{n}} as follows:

(6) n1,f2|Kn:=(f1)(n1)F|Kn.\displaystyle\forall n\geq 1,f_{2}|_{K_{n}}:=(f_{1})^{-(n-1)}\circ F|_{K_{n}}.

We now know each piece f2|Kn:KnJnf_{2}|_{K_{n}}:K_{n}\to J_{n} is a nonsingular orientation-preserving homeomorphism. Because {Kn}n\{K_{n}\}_{n\in\mathbb{N}} partitions (q,1)(q,1) and {Jn}n\{J_{n}\}_{n\in\mathbb{N}} partitions (0,1)(0,1) with the same accumulating behavior, by gluing and defining f2(q)=0f_{2}(q)=0, we obtain a unique nonsingular orientation-preserving homeomorphism f2:[q,1)[0,1)f_{2}:[q,1)\to[0,1). We also obtain a full branch map ff, and ff has FF as its first return map on [q,1)[q,1). ∎

5.2. Generating Partition

Lemma 5.2 is an immediate consequence of the following general lemma on generating partitions of first return maps:

Lemma 5.7.

Let ff be a full branch map with respect to a countable partition 𝒫={In}\mathcal{P}=\{I_{n}\}. Let Δ\Delta be a union of elements of 𝒫\mathcal{P}. Let F:ΔΔF:\Delta\to\Delta be the first return map, which is full branch with respect to a countable partition 𝒫F={Jm}\mathcal{P}^{F}=\{J_{m}\}. If FF has a generating partition, then ff has a generating partition.

Proof.

Take a pair of (non-exceptional) points x1,y1In𝒫x_{1},y_{1}\in I_{n}\in\mathcal{P}. Pick ImΔI_{m}\subset\Delta, and let x=f1|Im(x1)x=f^{-1}|_{I_{m}}(x_{1}), y=f1|Im(y1)y=f^{-1}|_{I_{m}}(y_{1}). Thus x,yΔx,y\in\Delta. Because FF has a generating partition, M0\exists M\geq 0 such that x,yx,y lie on different elements of the refinement 𝒫MF\mathcal{P}_{M}^{F}. Let JJ be the partition element of 𝒫MF\mathcal{P}_{M}^{F} that contains xx (and does not contain yy). Observe that FM:JΔF^{M}:J\to\Delta is a homeomorphism. By the definition of FF, N0\exists N\geq 0 such that fN:JΔf^{N}:J\to\Delta is a homeomorphism. Recall Δ\Delta is a union of elements of 𝒫\mathcal{P}, thus the refinement 𝒫N+1\mathcal{P}_{N+1} has a collection of elements that partition JJ. Therefore, xx and yy must also lie on different elements of 𝒫N+1\mathcal{P}_{N+1}. ∎

5.3. Gluing in (0,q)(0,q)

To prove Lemma 5.4, we study the regularity of f2f_{2} in (0,q)(0,q). For this purpose, we introduce the notation of graph pieces. Given a pair of integers m1\ell\geq m\geq 1, the graph piece ϕ,m:KJm\phi_{\ell,m}:K_{\ell}\to J_{m} is an orientation preserving homeomorphism defined by the following composition:

(7) ϕ,m:=f1mf2|K.\phi_{\ell,m}:=f_{1}^{\ell-m}\circ f_{2}|_{K_{\ell}}.
Refer to caption
Figure 1. Example of ff and ϕ,m\phi_{\ell,m} with 4\ell\leq 4.

We can also express the pieces of f2f_{2} and the branches of FF as graph pieces:

(8) n1:\displaystyle\forall n\geq 1: ϕn,n=f1nnf2|Kn=f2|Kn,\displaystyle\phi_{n,n}=f_{1}^{n-n}\circ f_{2}|_{K_{n}}=f_{2}|_{K_{n}}, ϕn,1=f1n1f2|Kn=F|Kn.\displaystyle\phi_{n,1}=f_{1}^{n-1}\circ f_{2}|_{K_{n}}=F|_{K_{n}}.

We make an elementary observation on the regularity of f2f_{2}. Suppose f1f_{1} and FF have a certain regularity (say Cr,r1C^{r},r\geq 1). Then by (6) and by composition, f2f_{2} has the same regularity on each interior K̊n\mathring{K}_{n}. This means to prove the regularity of f2f_{2}, we only need to prove it for the gluing of consecutive pieces. In fact, we have the following general lemma for CC^{\infty} regularity:

Lemma 5.8 (General Gluing Lemma).

Let f1:[0,q)[0,1)f_{1}:[0,q)\to[0,1) be a CC^{\infty} diffeomorphism, let FF\in\mathcal{F}^{\prime} have CC^{\infty} branches, and let f2f_{2} be the unique second branch given by Proposition 5.1. Then the following three statements are equivalent:

  1. (i)

    f2:[q,1)[q,1)f_{2}:[q,1)\to[q,1) is CC^{\infty} on (q,1)(q,1).

  2. (ii)

    n1\forall n\geq 1, ϕn,n\phi_{n,n} and ϕn+1,n+1\phi_{n+1,n+1} glue in a CC^{\infty} way at a neighborhood of zn+1z_{n+1}.

  3. (iii)

    n1\forall n\geq 1, ϕn,1\phi_{n,1} and ϕn+1,2\phi_{n+1,2} glue in a CC^{\infty} way at a neighborhood of zn+1z_{n+1}.

Proof.

Recall by (8) that f2f_{2} is the gluing of pieces {ϕn,n}n1\{\phi_{n,n}\}_{n\geq 1}. By construction, f2f_{2} has CC^{\infty} regularity on each interior K̊n\mathring{K}_{n}, thus (i) and (ii) are equivalent. Now fix an index nn. We have the following equalities:

f1n1ϕn,n\displaystyle f_{1}^{n-1}\circ\phi_{n,n} =ϕn,1,\displaystyle=\phi_{n,1}, f1n1ϕn+1,n+1\displaystyle f_{1}^{n-1}\circ\phi_{n+1,n+1} =ϕn+1,2.\displaystyle=\phi_{n+1,2}.

Because f1n1f_{1}^{n-1} is CC^{\infty}, the pair (ϕn,n,ϕn+1,n+1)(\phi_{n,n},\phi_{n+1,n+1}) glues in a CC^{\infty} way if and only if the pair (ϕn,1,ϕn+1,2)(\phi_{n,1},\phi_{n+1,2}) glues in a CC^{\infty} way. Thus (ii) and (iii) are equivalent. ∎

Proof of Lemma 5.4.

We want item (i) of Lemma 5.8, so it is sufficient to verify item (iii). Fix n1n\geq 1, and take U=LnRn+1U=L_{n}\bigcup R_{n+1} as the neighborhood of zn+1z_{n+1}. Because the pair is adjusted, we obtain:

ϕn,1|U(x)=F|Ln(x)\displaystyle\phi_{n,1}|_{U}(x)=F|_{L_{n}}(x) =q+mn(xzn+1),\displaystyle=q+m_{n}(x-z_{n+1}),
ϕn+1,2|U(x)=f11F|Rn+1(x)=f11(f(q+mn(xzn+1)))\displaystyle\phi_{n+1,2}|_{U}(x)=f_{1}^{-1}\circ F|_{R_{n+1}}(x)=f_{1}^{-1}(f(q+m_{n}(x-z_{n+1}))) =q+mn(xzn+1).\displaystyle=q+m_{n}(x-z_{n+1}).

The two pieces together define an affine map xq+mn(xzn+1)x\mapsto q+m_{n}(x-z_{n+1}) on UU, thus they glue smoothly at qq. ∎

5.4. Flat gluing at qq

Lemma 5.4 gives a sufficient condition for ff to be CC^{\infty} in (q,1)(q,1). However, this does not imply a CC^{\infty} extension to [q,1)[q,1), because the derivatives might oscillate close to qq. In particular if FF\in\mathcal{F}_{*}, we should expect derivatives of f2f_{2} to oscillate greatly. To prove Lemma 5.6, we must bound this oscillation.

Proof of Lemma 5.6.

We claim the following limit holds for any k0k\geq 0:

(9) lim supxq+|f2(k)(x)|/exp((xq)1/α)<.\limsup_{x\to q^{+}}|f_{2}^{(k)}(x)|/\exp(-(x-q)^{-1/\alpha})<\infty.

Observe exp((xq)1/α)\exp(-(x-q)^{-1/\alpha}) extends to a CC^{\infty} diffeomorhism on [q,1)[q,1) such that qq is a flat critical point. By (9) and Squeeze Theorem, we obtain f2f_{2} also extends to a CC^{\infty} diffeomorphism on [q,1)[q,1) such that qq is a flat critical point. Thus by item (i) of Definition 5.5, ff is CC^{\infty} at qq, and qq is a flat critical point.

We prove (9) for k=0k=0. Take x[q,1)x\in[q,1). There is a unique n>1n>1 such that x[zn+1,zn)x\in[z_{n+1},z_{n}). By (iii), n(xq)1/αn\approx(x-q)^{-1/\alpha}. By (ii), C>0\exists C>0 such that:

(10) f2|Kn(x)f1(n1)(1)=f1(n2)(q)=qm(n2)\displaystyle f_{2}|_{K_{n}}(x)\leq f_{1}^{-(n-1)}(1)=f_{1}^{-(n-2)}(q)=qm^{-(n-2)}
=exp(log(m)(n2))exp(C(xq)1/α).\displaystyle\,=\exp(-\log(m)(n-2))\leq\exp(-C(x-q)^{-1/\alpha}).

Now we prove (9) for k1k\geq 1. Recall by (6), f2|Kn=f1n1F|Knf_{2}|_{K_{n}}=f_{1}^{n-1}\circ F|_{K_{n}}. By (ii),

(11) f2|Kn=m(n2)(f11F|Kn).f_{2}|_{K_{n}}=m^{-(n-2)}(f_{1}^{-1}\circ F|_{K_{n}}).

We want to bound the kk-th derivative of f11F|Knf_{1}^{-1}\circ F|_{K_{n}} evaluated at xKnx\in K_{n}. By Faà di Bruno’s formula, the kk-th derivative of a general composition hgh\circ g evaluated at xx is a polynomial PkP_{k} with 2k2k variables evaluated at h(m)(g(x))h^{(m)}(g(x)) and g(m)(x)g^{(m)}(x) with 1mk1\leq m\leq k. Recall the bounds of (iv), (v). Let γk=maxmkβk\gamma_{k}=\max_{m\leq k}\beta_{k}. Note γk<1/α\gamma_{k}<1/\alpha. As nn\to\infty, the fastest growing bound is exp(Dknγk)\exp(D_{k}n^{\gamma_{k}}). Let SkS_{k} be the sum of absolute value of coefficients of PkP_{k}. For sufficiently large nn, Ck>0\exists C_{k}>0 such that:

(12) |(f1F|Kn)(k)(x)|Sk[exp(Dknγk)]deg(Pk)exp(Ck(xq)γk).\displaystyle|(f_{1}\circ F|_{K_{n}})^{(k)}(x)|\leq S_{k}[\exp(D_{k}n^{\gamma_{k}})]^{\deg(P_{k})}\leq\exp(C_{k}(x-q)^{-\gamma_{k}}).

By (10), m(n2)exp(C(xq)1/αlogq)m^{-(n-2)}\leq\exp(-C(x-q)^{-1/\alpha}-\log q). Substituting together with (12) to (11), we obtain: |f2(k)(x)|exp(Ck(xq)γkC(xq)1/αlogq)|f_{2}^{(k)}(x)|\leq\exp(C_{k}(x-q)^{-\gamma_{k}}-C(x-q)^{-1/\alpha}-\log q) for xx sufficiently close to qq. Because γk<1/α\gamma_{k}<1/\alpha, we have (9) for k1k\geq 1.

6. Smooth Construction

In this section we prove Proposition 2.6. Our strategy is to choose a suitable pair (f1,F)(f_{1},F), then we obtain a unique ff by Proposition 5.1. First, fix a point q(0,1/2)q\in(0,1/2), and define 𝒫:={I1=[0,q),I2=[q,1)}\mathcal{P}:=\{I_{1}=[0,q),I_{2}=[q,1)\}.

6.1. Choice of f1f_{1}

We choose f1:[0,q)[0,1)f_{1}:[0,q)\to[0,1) to be a CC^{\infty} orientation preserving homeomorphism that satisfies three properties:

  • There exists a point b(0,q)b\in(0,q), such that the restriction f1|[0,b]:[0,b][0,q]f_{1}|_{[0,b]}:[0,b]\to[0,q] is affine and has slope:

    (13) m=q/b>1.m=q/b>1.
  • Define φ:[0,1][0,e9]\varphi:[0,1]\to[0,e^{-9}] by φ(0):=0\varphi(0):=0, φ(x):=exp(9x(1/9))\varphi(x):=\exp(-9x^{(-1/9)}). There exists a one-sided open neighborhood UU of qq such that:

    (14) f1|U(x):=1φ(qx).f_{1}|_{U}(x):=1-\varphi(q-x).

    Note because 00 is a flat critical point of φ\varphi, we have

    (15) k1,f1(j)(q)=0,\forall k\geq 1,f_{1}^{(j)}(q)=0,

    i.e. qq is a flat critical point of f1f_{1}.

  • We also assume that

    (16) x[0,q]U:f(x)>0.\forall x\in[0,q]\setminus U:f^{\prime}(x)>0.

    Recall the function x1/xx\to 1/x is smooth away from 00, and (f1)(x)=1/f(x)(f^{-1})^{\prime}(x)=1/f^{\prime}(x). Thus f1f^{-1} is also CC^{\infty} on the compact set [0,q]U[0,q]\setminus U, and as a consequence the derivatives of f1f^{-1}

For future reference, we also note bounds of φ(x)\varphi(x) and derivatives of φ1(y)\varphi^{-1}(y). First:

(17) φ(x)<x.\varphi(x)<x.

Furthermore, we have φ1(y)=((logy)/9)9\varphi^{-1}(y)=(-(\log y)/9)^{-9}. Note (φ1)(y)=y1((logy)/9)10(\varphi^{-1})^{\prime}(y)=y^{-1}(-(\log y)/9)^{-10}. By induction, we have for a sequence of polynomials (ϕk)k1(\phi_{k})_{k\geq 1}:

(18) (φ1)(k)(y)=ykϕk(((logy)/9)1).(\varphi^{-1})^{(k)}(y)=y^{-k}\phi_{k}\left((-(\log y)/9)^{-1}\right).

Substituting y=φ(x)y=\varphi(x), we obtain for a constant CkC_{k} depending on kk:

(19) (φ1)(k)(φ(x))=φ(x)kϕk(x1/9)Ckφ(x)k(\varphi^{-1})^{(k)}(\varphi(x))=\varphi(x)^{-k}\phi_{k}(x^{1/9})\leq C_{k}\varphi(x)^{-k}

6.2. Choice of Partition 𝒫F\mathcal{P}^{F}

Before we choose FF, we must choose a partition 𝒫F={Kn}n1\mathcal{P}^{F}=\{K_{n}\}_{n\geq 1}. This is done by choosing their endpoints znz_{n} (as in (1)):

(20) z1:=1,z2:=1(1q)/m,n3,zn:=q+(z2q)2[(n1)n]1.\displaystyle z_{1}:=1,\quad z_{2}:=1-(1-q)/m,\quad\forall n\geq 3,z_{n}:=q+(z_{2}-q)2[(n-1)n]^{-1}.

Note also z2=q+(z2q)2[(21)2]1z_{2}=q+(z_{2}-q)2[(2-1)2]^{-1}. We note their lengths:

(21) |K1|\displaystyle|K_{1}| =z2z1=(1q)/m,\displaystyle=z_{2}-z_{1}=(1-q)/m,
n2,|Kn|\displaystyle\forall n\geq 2,|K_{n}| =znzn+1=(z2q)4[(n1)n(n+1)]1.\displaystyle=z_{n}-z_{n+1}=(z_{2}-q)4[(n-1)n(n+1)]^{-1}.

Recall the union Kn=kn+1KnK_{n}^{-}=\bigcup_{k\geq n+1}K_{n} defined in (3). We note its length.

(22) |Kn|\displaystyle|K_{n}^{-}| =zn+1q=(z2q)[n(n+1)]1.\displaystyle=z_{n+1}-q=(z_{2}-q)[n(n+1)]^{-1}.

6.3. Construction of FF

The following Lemma 6.1 specifies a choice of FF\in\mathcal{F}^{\prime} with several desired properties for further reference.

Lemma 6.1.

There exists a map FF\in\mathcal{F}^{\prime} with branch domains given by 𝒫F\mathcal{P}^{F} such that (f1,F)(f_{1},F) is adjusted, and together with the Ln,RnL_{n},R_{n} given in Definition 5.3 satisfy:

  1. (i)

    The first branch F|K1F|_{K_{1}} is affine with slope m1=mm_{1}=m.

  2. (ii)

    n1|Ln|/|Kn|>0\prod_{n\geq 1}|L_{n}|/|K_{n}|>0.

  3. (iii)

    n1,F(Ln)=Kn=kn+1Kn\forall n\geq 1,F(L_{n})=K_{n}^{-}=\bigcup_{k\geq n+1}K_{n}

  4. (iv)

    For n2n\geq 2, F|LnF|_{L_{n}} is affine with constant slope mnm_{n}, and n1<mn<nn-1<m_{n}<n.

  5. (v)

    |Rn|n5|R_{n}|\approx n^{-5}.

  6. (vi)

    x2\forall x\geq 2, F|Rn(x)=1φ(mn1(znx))F|_{R_{n}}(x)=1-\varphi(m_{n-1}(z_{n}-x)).

  7. (vii)

    F|Kn(x)mnF|_{K_{n}}^{\prime}(x)\geq m_{n}, except on a subinterval of the form [zndn,zn)[z_{n}-d_{n},z_{n}) where FF is concave, and dn<|K1|/2d_{n}<|K_{1}|/2.

  8. (viii)

    k1\forall k\geq 1, there exists positive numbers Ck,αkC_{k},\alpha_{k} such that FKn(k)(x)CknαkF_{K_{n}}^{(k)}(x)\leq C_{k}n^{\alpha_{k}}.

Proof.

To satisfy (i), let F|K1:K1[q,1)F|_{K_{1}}:K_{1}\to[q,1) to be affine. By (21), it has constant slope (1q)/K1=m(1-q)/K_{1}=m. To satisfy item (i) of Definition 5.3 and (iii) for n=1n=1, let L1L_{1} be the subset of K1K_{1} that maps to K1K_{1}^{-}. We now define the other branches. Let NN be a large integer to be fixed later. Now we subdivide KnK_{n} into three subintervals:

(23) Ln:=\displaystyle L_{n}:= [zn+1,zn2(N+n)2|Kn|),\displaystyle[z_{n+1},z_{n}-2(N+n)^{-2}|K_{n}|), |Ln|=(12(N+n)2)|Kn|\displaystyle|L_{n}|=(1-2(N+n)^{-2})|K_{n}|
(24) Rn:=\displaystyle R_{n}:= [zn(N+n)2|Kn|,zn),\displaystyle[z_{n}-(N+n)^{-2}|K_{n}|,z_{n}), |Rn|=(N+n)2|Kn|,\displaystyle|R_{n}|=(N+n)^{-2}|K_{n}|,
(25) Mn:=\displaystyle M_{n}:= Kn(LnRn),\displaystyle K_{n}\setminus(L_{n}\cup R_{n}), |Mn|=(N+n)2|Kn|=|Rn|.\displaystyle|M_{n}|=(N+n)^{-2}|K_{n}|=|R_{n}|.

Observe that |Ln|/|Kn|=12(N+n)2|L_{n}|/|K_{n}|=1-2(N+n)^{-2}. Because 2(N+n)2<\sum 2(N+n)^{-2}<\infty and log(1+x)x\log(1+x)\approx x for small xx, we conclude (ii). To satisfy item (i) of Definition 5.3 and (iii) for n2n\geq 2, let F|Ln:LnKnF|_{L_{n}}:L_{n}\to K_{n}^{-} to be affine. By (21), (22), and (23):

(26) mn=|Kn|/|Ln|=(12(N+n)2)1(n1).m_{n}=|K_{n}^{-}|/|L_{n}|=(1-2(N+n)^{-2})^{-1}(n-1).

Note because 1<(12(N+n)2)1<(1n1)11<(1-2(N+n)^{-2})^{-1}<(1-n^{-1})^{-1}, we have (n1)<mn<n(n-1)<m_{n}<n, and thus (iv). To confirm (v), we compute by (21) and (24):

(27) |Rn|=(N+n)2|Kn|=(z2q)4[(n1)n(n+1)]1(N+n)2n5.|R_{n}|=(N+n)^{-2}|K_{n}|=(z_{2}-q)4[(n-1)n(n+1)]^{-1}(N+n)^{-2}\approx n^{-5}.

Because FF is adjusted, we must have F|Rn(x)=f1(q+mn1(xzn))F|_{R_{n}}(x)=f_{1}(q+m_{n-1}(x-z_{n})). By (14), on a onesided neighborhood UU of qq, we have f1(x)=1φ(qx)f_{1}(x)=1-\varphi(q-x). Assume NN is large enough such that n|MnRn|<|U|n|M_{n}\cup R_{n}|<|U| for all nn. By (iv), mn|Rn|<|U|m_{n}|R_{n}|<|U|. To satisfy item (ii) of Definition 5.3:

(28) F|Rn(x)=1φ(mn1(xzn)),F|_{R_{n}}(x)=1-\varphi(m_{n-1}(x-z_{n})),

which verifies (vi). Now we define a nonsmooth F|MnF|_{M_{n}}, to smoothen later. We subdivide MnM_{n} into three subintervals of length |Mn|/3|M_{n}|/3. On the left subinterval, F(x)=q+mn(xzn+1)F(x)=q+m_{n}(x-z_{n+1}), so it glues to F|LnF|_{L_{n}} smoothly. On the right subinterval, F(x)=1φ(mn1(xzn))F(x)=1-\varphi(m_{n-1}(x-z_{n})), so it glues to F|RnF|_{R_{n}} smoothly. On the middle subinterval, we define FF by an affine line segment. To smoothen F|MnF|_{M_{n}}, let gg be a nonnegative CC^{\infty} bump function supported on [0,1][0,1]. Let gn:=g(x/(|Mn|/3))g_{n}:=g(x/(|M_{n}|/3)), it is compactly supported on [0,|Mn|/3][0,|M_{n}|/3]. We obtain a smooth F|MnF|_{M_{n}} by convolution of gng_{n} against the nonsmooth FF. The three pieces F|Ln,F|Mn,F|RnF|_{L_{n}},F|_{M_{n}},F|_{R_{n}} are smooth glue smoothly, which satisfies (iv) of Definition 5.3. Furthermore because convolution with positive kernels preserves convexity and concavity, (vii) holds for dn=|Rn|+2|Mn|/3d_{n}=|R_{n}|+2|M_{n}|/3, and we can assume NN is large enough such that dn<|K1|/2d_{n}<|K_{1}|/2 for all nn. Fix k1k\geq 1. Observe max|gn(k)|=(|Mn|/3)kmax|g(k)(x)|(n5)k\max|g_{n}^{(k)}|=(|M_{n}|/3)^{-k}\max|g^{(k)}(x)|\approx(n^{-5})^{-k}. By differential properties of convolution, we obtain (viii). Furthermore the three pieces F|Ln,F|Mn,F|RnF|_{L_{n}},F|_{M_{n}},F|_{R_{n}} glue smoothly, which satisfies (iv) of Definition 5.3. ∎

Refer to caption
Figure 2. Sketch of the three pieces of F|KnF|_{K_{n}}

6.4. Verification of Properties

We have chosen f1f_{1} in Subsection 6.1, and FF\in\mathcal{F}^{\prime} in Lemma 6.1. By Proposition 5.1, we obtain a full branch map f:IIf:I\to I with branches defined on 𝒫={[0,q),[q,1)}\mathcal{P}=\{[0,q),[q,1)\}. To prove Proposition 2.6, we must verify four properties: f𝒟f\in\mathcal{D}, FweakF\in\mathcal{F}_{*}^{weak}, fC(𝕊1)f\in C^{\infty}(\mathbb{S}^{1}), and f(p)>1f^{\prime}(p)>1.

Lemma 6.2.

FF has a generating partition, thus FF\in\mathcal{F}. By Lemma 5.7, f𝒟f\in\mathcal{D}.

Proof.

Consider Δ=n2Kn\Delta=\bigcup_{n\geq 2}K_{n}. Let G:ΔΔG:\Delta\to\Delta be the first return map of FF. Again by Lemma 5.7, it is sufficient to show that GG is uniformly expanding and thus has a generating partition. Points in the dynamic of F:[q,1)[q,1)F:[q,1)\to[q,1) outside of Δ\Delta must spend time in K1K_{1}, and by item (i) of Lemma 6.1, F|K1(x)=m>1F|_{K_{1}}^{\prime}(x)=m>1. Furthermore by chain rule, G(x)=(Fτ(x))(x)=mτ(x)1F(x)G^{\prime}(x)=(F^{\tau(x)})^{\prime}(x)=m^{\tau(x)-1}F^{\prime}(x). Now consider n2n\geq 2, we study GG^{\prime} and FF^{\prime} at KnK_{n}. Recall item (vii) and (iv) of Lemma 6.1. Outside of a subinterval of the form [zndn,zn)[z_{n}-d_{n},z_{n}), we have:

G(x)F(x)mn>n11.G^{\prime}(x)\geq F^{\prime}(x)\geq m_{n}>n-1\geq 1.

Now we take a point z[zndn,zn)z\in[z_{n}-d_{n},z_{n}). (Fτ(z))(F^{\tau(z)}) is a concave CC^{\infty} diffeomorphism on [zndn,zn)[z_{n}-d_{n},z_{n}). It extends continuously to [zndn,zn][z_{n}-d_{n},z_{n}] by zn1z_{n}\mapsto 1. By the definition of return time, Fτ(z)K1F^{\tau(z)}\notin K_{1}. By the Mean Value Theorem, c(x,zn)\exists c\in(x,z_{n}) such that:

(Fτ(z))(c)=[Fτ(z)(zn)Fτ(z)(z)]/[znz]|K1|/|Rn|.(F^{\tau(z)})^{\prime}(c)=[F^{\tau(z)}(z_{n})-F^{\tau(z)}(z)]/[z_{n}-z]\geq|K_{1}|/|R_{n}|.

Because Fτ(z)F^{\tau(z)} is convex, we obtain G(z)=(Fτ(z))(z)(Fτ(z))(c)>|K1|/|Rn|G^{\prime}(z)=(F^{\tau(z)})^{\prime}(z)\geq(F^{\tau(z)})^{\prime}(c)>|K_{1}|/|R_{n}|. Recall |Rn||K1|/2|R_{n}|\leq|K_{1}|/2 by item (vii) of Lemma 6.1. Thus G(z)2G^{\prime}(z)\geq 2. Therefore xΔ,G(x)min{m2,2}>1\forall x\in\Delta,G^{\prime}(x)\geq\min\{m_{2},2\}>1. ∎

Lemma 6.3.

FweakF\in\mathcal{F}_{*}^{weak}.

Proof.

By the previous Lemma 6.2, we know FF\in\mathcal{F}. By item (iii) of Lemma 6.1, the subintervals LnL_{n} are consistent with the definition in (4). By item (ii), we can take pn=|Ln|/|Kn|p_{n}=|L_{n}|/|K_{n}| and satisfy Definition 2.4, thus FF\in\mathcal{F}_{*}. By item (iv), F|LnF|_{L_{n}} is affine and thus convex, thus FweakF\in\mathcal{F}_{*}^{weak}. ∎

Lemma 6.4.

The pair f1,Ff_{1},F glues flatly, and thus by Lemma 5.6, ff is CC^{\infty} at qq.

Proof.

Because f1,Ff_{1},F are smooth and FF is adjusted to f1f_{1}, it is sufficient to verify each item of Definition 5.5. Items (i) and (ii) are verified by choice of f1f_{1} in Subsection 6.1. Item (iii) is verified with α=2\alpha=2 by choice of znqn2z_{n}-q\approx n^{-2} in Subsection 6.2. Item (iv) is verified by item (viii) of Lemma 6.1. We must now verify item (v). Fix a degree kk and an interval KnK_{n}. We want to find maxxKn|(f11)(k)(F(x))|\max_{x\in K_{n}}|(f_{1}^{-1})^{(k)}(F(x))|. By the proof of Lemma 5.4 we know f11Ff_{1}^{-1}\circ F is affine for xRnx\in R_{n}. So the maximum must be achieved on xKnRnx\in K_{n}\setminus R_{n}. Because f1f_{1} is concave at a neighborhood of qq, the maximum must be achieved at x=zn|Rn|x=z_{n}-|R_{n}|. By items (iv), (v) and (vi) of Lemma 6.1 we have OPENF(zn|Rn))=φ(mn1|Rn|)φ(Cn4)F(z_{n}-|R_{n}))=\varphi(m_{n-1}|R_{n}|)\leq\varphi(Cn^{-4}), for a constant C>0C>0. So by the bound (19), we obtain for a constant Ck>0C_{k}>0 depending on kk:

maxxKn|(f11)(k)(F(x))|\displaystyle\max_{x\in K_{n}}|(f_{1}^{-1})^{(k)}(F(x))| Ckφ(Cn4)k=Ck[exp(9C1/9n4/9)]k\displaystyle\leq C_{k}\varphi(Cn^{-4})^{-k}=C_{k}[\exp(-9C^{-1/9}n^{4/9})]^{-k}
=Ckexp(9kC1/9n4/9)exp(Dkn4/9).\displaystyle=C_{k}\exp(9kC^{-1/9}n^{4/9})\leq\exp(D_{k}n^{4/9}).

For some Dk>0D_{k}>0. Which means item (v) is verified with βk=4/9<1/2=1/α\beta_{k}=4/9<1/2=1/\alpha. ∎

Lemma 6.5.

fC(𝕊1)f\in C^{\infty}(\mathbb{S}^{1}).

Proof.

f1f_{1} is CC^{\infty} on (p,q)(p,q) by construction. Because FF is adjusted to f1f_{1}, by Lemma 5.4, f2f_{2} is CC^{\infty} on (q,p)(q,p). By Lemma 6.4, ff is CC^{\infty} at qq. It remains to verify smoothness at pp. By choice of f1f_{1} and item (i) of Lemma 6.1, ff is affine with slope mm on the interval K1[p,b)K_{1}\cup[p,b), which is a neighborhood of pp. Thus ff is CC^{\infty} at p=0=1p=0=1. ∎

Proof of Proposition 2.6.

We have chosen f1:[0,q)[0,q)f_{1}:[0,q)\to[0,q) in Subsection 6.1. and FF\in\mathcal{F}^{\prime} in Lemma 6.1. We obtain f:𝕊1𝕊1f:\mathbb{S}^{1}\to\mathbb{S}^{1} from Proposition 5.1. Lemmas 6.2, 6.3 and 6.5 respectively give us f𝒟f\in\mathcal{D}, FweakF\in\mathcal{F}_{*}^{weak}, and fC(𝕊1)f\in C^{\infty}(\mathbb{S}^{1}). Note f(p)=m>1f^{\prime}(p)=m>1 as a consequence of the proof of Lemma 6.5. ∎

7. Construction for Proposition 2.7

In this section we prove Proposition 2.7. Our strategy is to choose a suitable pair (f1,F)(f_{1},F), then we obtain a unique ff by Proposition 5.1. First, fix a point q(0,1/2)q\in(0,1/2), and define 𝒫:={I1=[0,q),I2=[q,1)}\mathcal{P}:=\{I_{1}=[0,q),I_{2}=[q,1)\}.

7.1. Choice of f1f_{1}

We choose f1:I1If_{1}:I_{1}\to I to be a convex CC^{\infty} orientation preserving homeomorphism such that limxqf(x)=+\lim_{x\to q^{-}}f^{\prime}(x)=+\infty, and there exists a point b(0,q/2)b\in(0,q/2), such that the restriction f1|[0,b)f_{1}|_{[0,b)} maps to [0,q)[0,q), and it is affine with slope m:=q/b>2m:=q/b>2. Note that an explicit formula for f1f_{1} can be written with standard algebraic functions such as x(qx)1/2x\to-(q-x)^{1/2} and smoothing techniques, but it is not important to have such an explicit formula.

7.2. Choice of Partition 𝒫F\mathcal{P}^{F}

Before we choose FF, we must choose a partition 𝒫F={Kn}n1\mathcal{P}^{F}=\{K_{n}\}_{n\geq 1}. This is done by choosing their endpoints znz_{n} (as in (1)). Let a(0,1/2)a\in(0,1/2), then define:

(29) z1:=1,z2:=1(1q)/m,n3,zn:=q+(z2q)an2.\displaystyle z_{1}:=1,\quad z_{2}:=1-(1-q)/m,\quad\forall n\geq 3,z_{n}:=q+(z_{2}-q)a^{n-2}.

For future reference we observe their lengths:

(30) |K1|\displaystyle|K_{1}| =z2z1=(1q)/m,\displaystyle=z_{2}-z_{1}=(1-q)/m,
n2,|Kn|\displaystyle\forall n\geq 2,|K_{n}| =znzn+1=(z2q)(an2an1).\displaystyle=z_{n}-z_{n+1}=(z_{2}-q)(a^{n-2}-a^{n-1}).

Recall the union Kn=kn+1KnK_{n}^{-}=\bigcup_{k\geq n+1}K_{n} defined in (3). We note its length.

(31) |Kn|\displaystyle|K_{n}^{-}| =zn+1q=(z2q)an1.\displaystyle=z_{n+1}-q=(z_{2}-q)a^{n-1}.

7.3. Choice of FF

The following Lemma 7.1 specifies a choice of FF\in\mathcal{F}^{\prime} with several desired properties for further reference.

Lemma 7.1.

There exists a map FF\in\mathcal{F}^{\prime} with branch domains given by 𝒫F\mathcal{P}^{F} such that it is adjusted to f1f_{1} (Definition 5.3), and furthermore FF together with the subintervals Ln,RnL_{n},R_{n} given in Definition 5.3 satisfy:

  1. (i)

    The first branch F|K1F|_{K_{1}} is affine with slope m1=m>1m_{1}=m>1.

  2. (ii)

    n1|Ln|/|Kn|>0\prod_{n\geq 1}|L_{n}|/|K_{n}|>0.

  3. (iii)

    n1,F(Ln)=Kn=kn+1Kn\forall n\geq 1,F(L_{n})=K_{n}^{-}=\bigcup_{k\geq n+1}K_{n}

  4. (iv)

    For n2n\geq 2, F|LnF|_{L_{n}} is affine with constant slope mnm_{n} and mna/(1a)>1m_{n}\geq a/(1-a)>1.

  5. (v)

    Each branch F|KnF|_{K_{n}} is convex.

Proof.

To satisfy (i), let F|K1:K1(q,1)F|_{K_{1}}:K_{1}\to(q,1) to be affine. By (30), it has constant slope (1q)/K1=m(1-q)/K_{1}=m. To satisfy item (i) of Definition 5.3 and (iii) for n=1n=1, let L1L_{1} be the subset of K1K_{1} that maps to K1K_{1}^{-}. Choose a sequence (pn)n2(p_{n})_{n\geq 2} such that n2pn>0\prod_{n\geq 2}p_{n}>0. For n2n\geq 2, we define the subinterval LnKnL_{n}\subset K_{n} as follows:

(32) Ln:=[zn+1,zn+1+pn|Kn|),|Ln|=pn|Kn|.L_{n}:=[z_{n+1},z_{n+1}+p_{n}|K_{n}|),\quad|L_{n}|=p_{n}|K_{n}|.

This choice of LnL_{n} satisfies (ii). To satisfy item (i) of Definition 5.3 and (iii) for n2n\geq 2, let F|Ln:LnKnF|_{L_{n}}:L_{n}\to K_{n}^{-} to be affine. We compute by (30), (31), and (32):

(33) mn=|Kn|/|Ln|=pn1a/(1a).m_{n}=|K_{n}^{-}|/|L_{n}|=p_{n}^{-1}a/(1-a).

For each n2n\geq 2, let δn>0\delta_{n}>0 be a small number to be fixed later, then let Rn=(znδn,zn)R_{n}=(z_{n}-\delta_{n},z_{n}). To satisfy item (ii) of Definition 5.3, we have F|Rn(x)=f(q+mn(xzn))F|_{R_{n}}(x)=f(q+m_{n}(x-z_{n})). Recall by Subsection 7.1 that f1f_{1} is convex and limxqf(x)=\lim_{x\to q^{-}f^{\prime}(x)}=\infty. We now extend the graphs of F|LnF|_{L_{n}} and F|RnF|_{R_{n}} into Kn(LnRn)K_{n}\setminus(L_{n}\cup R_{n}), then connect the two graphs with a line segment to create a nonsmooth graph. If we assume δn\delta_{n} to be small enough, then the graph is convex. We smoothen the graph by convolution with a smooth positive bump function. This gives us a smooth branch F|KnF|_{K_{n}} which satisfies item (iv) of Definition 5.3. Because convolution with positive kernels preserve convexity, we satisfy (v). ∎

Refer to caption
Figure 3. Sketch of (f1,F)(f_{1},F) with q=1/2,b=3/8q=1/2,b=3/8.

7.4. Verification of Properties

We have chosen f1f_{1} in Subsection 7.1, and FF\in\mathcal{F}^{\prime} in Lemma 7.1. By Proposition 5.1, we obtain a full branch map f:IIf:I\to I with branches defined on 𝒫={[0,q),[q,1)}\mathcal{P}=\{[0,q),[q,1)\}. To prove Proposition 2.7, we must verify three properties: f𝒟f\in\mathcal{D}, FstrongF\in\mathcal{F}_{*}^{strong}, fC(𝕊1{q})f\in C^{\infty}(\mathbb{S}^{1}\setminus\{q\}), and f(p)>1f^{\prime}(p)>1.

Lemma 7.2.

FF has a generating partition, thus FF\in\mathcal{F} and f𝒟f\in\mathcal{D}.

Proof.

By item (i), (iv) and (v) of Lemma 7.1, for all x(q,1)x\in(q,1), F(x)>>1F^{\prime}(x)>>1. Thus FF is uniformly expanding, and has a generating partition. ∎

Lemma 7.3.

FstrongF\in\mathcal{F}_{*}^{strong}.

Proof.

By the previous Lemma 7.2, we know FF\in\mathcal{F}. By item (iii) of Lemma 7.1, the subintervals LnL_{n} are consistent with the definition in (4). By item (ii), we can take pn=|Ln|/|Kn|p_{n}=|L_{n}|/|K_{n}| and satisfy Definition 2.4, thus FF\in\mathcal{F}_{*}. By item (v), each branch F|KnF|_{K_{n}} is convex, thus FstrongF\in\mathcal{F}_{*}^{strong}. ∎

Lemma 7.4.

fC(𝕊1{q})f\in C^{\infty}(\mathbb{S}^{1}\setminus\{q\}).

Proof.

f1f_{1} is CC^{\infty} on (p,q)(p,q) by construction. By Lemma 5.4, because FF is adjusted to f1f_{1}, we have f2f_{2} is CC^{\infty} on (q,p)(q,p). We must check the regularity of ff at pp. By item (i) of Lemma 7.1 ff is affine with slope mm on the interval K1[p,b)K_{1}\cup[p,b), which is a neighborhood of pp. Therefore fC(𝕊1{q})f\in C^{\infty}(\mathbb{S}^{1}\setminus\{q\}). ∎

Proof of Proposition 2.7.

We have chosen f1:[0,q)[0,q)f_{1}:[0,q)\to[0,q) in Subsection 6.1. and FF\in\mathcal{F}^{\prime} in Lemma 6.1. We obtain f:IIf:I\to I from Proposition 5.1. Lemmas 7.2, 7.3 and 7.4 respectively give us f𝒟f\in\mathcal{D}, FstrongF\in\mathcal{F}_{*}^{strong}, and fC(𝕊1{q})f\in C^{\infty}(\mathbb{S}^{1}\setminus\{q\}). Note f(p)=m>1f^{\prime}(p)=m>1 by item (i) of Lemma 7.1. ∎

8. Remarks on the Role of Flat Critical Points

In Section 5 we introduced Lemma 5.6, which gives sufficient conditions on (f1,F)(f_{1},F) such that ff is smooth at qq with qq a flat critical point. Because we used it to construct ff for Theorem 1.4, ff must have a flat critical point qq. We now make brief informal remarks on the role of the flatness of qq in both our results, and compare our strategy with results in the literature, in particular the unimodal maps with flat critical point.

8.1. Flatness and Regularity

With our methods, qq being flat is necessary for regularity. Assume fC(𝕊1)f\in C^{\infty}(\mathbb{S}^{1}) and FF\in\mathcal{F}_{*}. Because of how \mathcal{F}_{*} is defined, FF^{\prime} must be small in the subintervals LnKnL_{n}\subset K_{n}, and large outside of it. As a consequence, maxx,yKnf(x)/f(y)\max_{x,y\in K_{n}}f^{\prime}(x)/f^{\prime}(y)\to\infty as nn\to\infty. Thus all derivatives of qq must vanish.

However, qq being flat is not strictly necessary to have a Sisyphus Attractor. We can take the construction in Section 7, and choose a<b/qa<b/q. Observe znqanz_{n}-q\approx a^{n}, and f(zn)f(q)(b/q)nf(z_{n})-f(q)\approx(b/q)^{n}. We obtain limxq+[f(x)f(q)]/[xq]=.\lim_{x\to q^{+}}[f(x)-f(q)]/[x-q]=\infty. Even though f(q)f^{\prime}(q) is not even defined, we still have a Sisyphus Attractor.

8.2. A Difference of Strategy

We now compare our Sisyphus Attractor to the unimodal maps with flat critical points shown in [6]. Two particular assumptions are needed to find a Sisyphus Attractor in that setting. The first is nonpositive Schwarzian derivative, which implies some type of bounded distortion. The second one is log|f|=\int\log|f^{\prime}|=-\infty, which is a nonintegrability condition which in that setting is equivalent to having nonintegrable return time.

These assumptions are not met by the maps in our results. Note in both our results, FF\in\mathcal{F}_{*}. Thus FF^{\prime} must vary dramatically in very small intervals, and so does ff^{\prime}. This means unbounded distortion is actually the key for our results.

On the other hand, integrability of return time is independent from our results. Note in (21), we have |Kn|n3|K_{n}|\approx n^{-3}, which gives an integrable return time. One can also modify Section 6 to use |Kn|n2|K_{n}|\approx n^{-2}, which gives a nonintegrable return time.

References

  • [1] M. Benedicks and M. Misiurewicz (1989) Absolutely continuous invariant measures for maps with flat tops. Inst. Hautes Études Sci. Publ. Math., pp. 203–213. External Links: ISSN 0073-8301,1618-1913, Link, MathReview (G. R. Goodson) Cited by: §1.1.
  • [2] R. Gunawan (2025) Uniformly expanding full branch maps with a wild attracting point. Note: arXiv:2503.20608 [math.DS] External Links: 2503.20608, Link Cited by: §2, §4, §4, §4.
  • [3] F. Hofbauer and G. Keller (1990) Quadratic maps without asymptotic measure. Comm. Math. Phys. 127 (2), pp. 319–337. External Links: Document Cited by: §1.1.
  • [4] C. Liverani, B. Saussol, and S. Vaienti (1999) A probabilistic approach to intermittency. Ergodic Theory Dynam. Systems 19 (3), pp. 671–685. External Links: Document Cited by: §1.1.
  • [5] Y. Pomeau and P. Manneville (1980) Intermittent transition to turbulence in dissipative dynamical systems. Comm. Math. Phys. 74 (2), pp. 189–197. External Links: ISSN 0010-3616,1432-0916, Link, MathReview Entry Cited by: §1.1.
  • [6] R. Zweimüller (2004) SS-unimodal Misiurewicz maps with flat critical points. Fund. Math. 181 (1), pp. 1–25. External Links: ISSN 0016-2736,1730-6329, Document, Link, MathReview (Henk Bruin) Cited by: §1.1, §1.1, §8.2.