Introduction and main results
Let T T T preserve a probability measure μ \mu μ , and let ( A n ) (A_n) ( A n ) be measurable sets with ∑ n μ ( A n ) = ∞ \sum_n \mu(A_n) = \infty ∑ n μ ( A n ) = ∞ . The sequence ( A n ) (A_n) ( A n ) satisfies the strong Borel–Cantelli law if, for μ \mu μ -almost every x x x , the number of n ≤ N n \le N n ≤ N with T n x ∈ A n T^n x \in A_n T n x ∈ A n is asymptotic to ∑ n ≤ N μ ( A n ) \sum_{n\le N} \mu(A_n) ∑ n ≤ N μ ( A n ) . For independent events this follows from a second-moment estimate. For dynamical systems with sufficiently fast decay of correlations, variance arguments of the same kind apply to many sequences of balls; see [25 ] and the references there.
Intermittent maps behave differently. An orbit of a Liverani–Saussol–Vaienti (LSV) map that comes close to the neutral fixed point 0 0 0 leaves its neighbourhood only slowly, so one entrance into a target near 0 0 0 may be followed by a long run of consecutive visits. For a single LSV map with parameter α ∈ ( 0 , 1 ) \alpha\in(0,1) α ∈ ( 0 , 1 ) , Kim [29 Proposition 4.2] showed that almost every orbit visits the intervals [ 0 , n − 1 / ( 1 − α ) ) [0,n^{-1/(1-\alpha)}) [ 0 , n − 1/ ( 1 − α ) ) only finitely often, although their invariant masses are of order 1 / n 1/n 1/ n . Gouëzel [23 ] proved that divergence of the total Lebesgue length nevertheless forces infinitely many visits. Whether the number of visits is also asymptotic to its mean is a finer question, since a few long clusters may carry most of the count. When the strong law fails, one would also like to describe the count itself.
In this paper we study both questions for iid random compositions of LSV maps, with targets [ 0 , u n ] [0,u_n] [ 0 , u n ] shrinking to the neutral fixed point. The parameter law may be a point mass, so the results include a single LSV map. Under the regular-variation assumptions stated below, the strong law holds if and only if an explicit integral converges, whereas convergence in mean requires only n u n → ∞ nu_n \to\infty n u n → ∞ (Theorem 1.2 ). At the critical scale u n ∼ c log log n / n u_n \sim c\log\log n/n u n ∼ c log log n / n , the almost-sure lower limit of the normalized count is a constant in ( 0 , 1 ) (0,1) ( 0 , 1 ) , determined by a scalar equation. When n u n nu_n n u n converges to a positive constant, the clusters survive normalization, and the occupation paths converge to an additive process of Poisson jumps (Theorem 1.4 ). Away from the neutral fixed point, by contrast, a quenched strong law holds for every sequence of intervals with divergent total length (Theorem 1.1 ). Here quenched means that the assertion holds for almost every fixed parameter sequence.
We now describe the setting and the results precisely. For s > 0 s > 0 s > 0 , define the LSV map [33 ]
T s ( x ) = { x ( 1 + 2 s x s ) , 0 ≤ x ≤ 1 / 2 , 2 x − 1 , 1 / 2 < x ≤ 1. T_s(x)=
\begin{cases}
x(1+2^s x^s), & 0\le x\le1/2,\\
2x-1, & 1/2<x\le1.
\end{cases} T s ( x ) = { x ( 1 + 2 s x s ) , 2 x − 1 , 0 ≤ x ≤ 1/2 , 1/2 < x ≤ 1.
The endpoint convention is immaterial for the absolutely continuous laws considered here. Fix B ∈ ( 0 , ∞ ) B\in(0,\infty) B ∈ ( 0 , ∞ ) and a Borel probability π \pi π on ( 0 , B ] (0,B] ( 0 , B ] . On Ω = ( 0 , B ] Z \Omega=(0,B]^{\mathbb{Z}} Ω = ( 0 , B ] Z with law P = π Z \mathbb{P}=\pi^{\mathbb{Z}} P = π Z , let σ \sigma σ be the left shift and write s n ( ω ) = ω n s_n(\omega)=\omega_n s n ( ω ) = ω n . Set T 0 ω = id T^\omega_0=\operatorname{id} T 0 ω = id and T n ω = T s n − 1 ∘ ⋯ ∘ T s 0 T^\omega_n=T_{s_{n-1}}\circ\cdots\circ T_{s_0} T n ω = T s n − 1 ∘ ⋯ ∘ T s 0 . Let L s \mathcal{L}_s L s be the transfer operator relative to Lebesgue measure and L ‾ = ∫ L s d π ( s ) \overline{\mathcal{L}}=\int\mathcal{L}_s\,d\pi(s) L = ∫ L s d π ( s ) . Write ϕ s \phi_s ϕ s for the inverse of the left branch on [ 0 , 1 ] [0,1] [ 0 , 1 ] . All return bases below use Y = [ 1 / 2 , 1 ] Y=[1/2,1] Y = [ 1/2 , 1 ] , with nonnormalized Lebesgue measure Leb ( Y ) = 1 / 2 \operatorname{Leb}(Y)=1/2 Leb ( Y ) = 1/2 .
Theorem 1.1 (Sparse targets under iid forcing). The operator L ‾ \overline{\mathcal{L}} L has an absolutely continuous stationary probability if and only if π ( ( 0 , 1 ) ) > 0 \pi((0,1))>0 π (( 0 , 1 )) > 0 . Under this condition it is unique among absolutely continuous stationary probabilities and equivalent to Lebesgue measure; denote it by μ ‾ = h d x \overline{\mu}=h\,dx μ = h d x . There is a past-measurable probability family μ ω = h ω d x \mu_\omega=h_\omega\,dx μ ω = h ω d x , equivalent to Lebesgue measure for almost every ω \omega ω , such that
( T s 0 ) ∗ μ ω = μ σ ω , E P h ω = h . (T_{s_0})_*\mu_\omega=\mu_{\sigma\omega},\qquad\mathbb{E}_{\mathbb{P}}h_\omega=h. ( T s 0 ) ∗ μ ω = μ σ ω , E P h ω = h . Fix d 0 > 0 d_0>0 d 0 > 0 and a deterministic sequence of intervals A n ⊂ [ d 0 , 1 ] A_n\subset[d_0,1] A n ⊂ [ d 0 , 1 ] , n ≥ 1 n\ge1 n ≥ 1 , with ∑ n Leb ( A n ) = ∞ \sum_n\operatorname{Leb}(A_n)=\infty ∑ n Leb ( A n ) = ∞ . Put p n = μ ‾ ( A n ) p_n=\overline{\mu}(A_n) p n = μ ( A n ) and
M N = ∑ n = 1 N μ ‾ ( A n ) , Q N ( ω ) = ∑ n = 1 N μ σ n ω ( A n ) , S N ( ω , x ) = ∑ n = 1 N 1 A n ( T n ω x ) . M_N=\sum_{n=1}^{N}\overline{\mu}(A_n),\qquad
Q_N(\omega)=\sum_{n=1}^{N}\mu_{\sigma^n\omega}(A_n),\qquad
S_N(\omega,x)=\sum_{n=1}^{N}\mathbf{1}_{A_n}(T^\omega_nx). M N = n = 1 ∑ N μ ( A n ) , Q N ( ω ) = n = 1 ∑ N μ σ n ω ( A n ) , S N ( ω , x ) = n = 1 ∑ N 1 A n ( T n ω x ) . For almost every ω \omega ω ,
Q N ( ω ) M N ⟶ 1 , S N ( ω , x ) Q N ( ω ) ⟶ 1 for Lebesgue-almost every x . \frac{Q_N(\omega)}{M_N}\longrightarrow1,\qquad
\frac{S_N(\omega,x)}{Q_N(\omega)}\longrightarrow1
\quad\text{for Lebesgue-almost every }x. M N Q N ( ω ) ⟶ 1 , Q N ( ω ) S N ( ω , x ) ⟶ 1 for Lebesgue-almost every x . The environment exceptional set may depend on the fixed target sequence. No nesting, shrinking or rate of divergence is assumed.
The denominator is the expected count under the equivariant reference family. It is not defined by evolving each arbitrary initial density. On every fixed interval away from zero, h h h is bounded above and below, so the length-divergence condition is equivalent to M N → ∞ M_N\to\infty M N → ∞ . Pointwise values of h h h and h ω h_\omega h ω refer to their continuous representatives on ( 0 , 1 ] (0,1] ( 0 , 1 ] , constructed in § 3 . The stationary-probability criterion concerns absolutely continuous laws; the singular fixed-point mass at zero remains invariant in all regimes. § 2 and § 3 establish existence and the criterion. § 4 and § 5 complete the strong-law proof of Theorem 1.1 .
Targets at the neutral fixed point. For these targets we use the following standing assumptions and notation.
Parameter law. The law π \pi π is supported on [ α , B ] [\alpha,B] [ α , B ] , where 0 < α < 1 0<\alpha<1 0 < α < 1 , α ≤ B < ∞ \alpha\le B<\infty α ≤ B < ∞ , and
π ( [ α , α + t ] ) ∼ C 0 t κ 0 L 0 ( 1 / t ) ( t ↓ 0 ) , C 0 > 0 , κ 0 ≥ 0. \pi([\alpha,\alpha+t])\sim C_0t^{\kappa_0}L_0(1/t)\quad(t\downarrow0),\qquad C_0>0,\quad\kappa_0\ge0. π ([ α , α + t ]) ∼ C 0 t κ 0 L 0 ( 1/ t ) ( t ↓ 0 ) , C 0 > 0 , κ 0 ≥ 0.
Here L 0 L_0 L 0 is positive, measurable and slowly varying at infinity, with L 0 L_0 L 0 and 1 / L 0 1/L_0 1/ L 0 locally bounded on a sufficiently large tail. Put b ( v ) = v κ 0 / L 0 ( v ) b(v)=v^{\kappa_0}/L_0(v) b ( v ) = v κ 0 / L 0 ( v ) , r = 1 / α r=1/\alpha r = 1/ α , ζ = ( 1 − α ) / α \zeta=(1-\alpha)/\alpha ζ = ( 1 − α ) / α and c ˉ = h ( 1 / 2 ) / 2 \bar{c}=h(1/2)/2 c ˉ = h ( 1/2 ) /2 .
Visit counts. Fix c > 0 c>0 c > 0 and 0 < u ∗ < 1 / 2 0<u_*<1/2 0 < u ∗ < 1/2 . For a deterministic radius schedule ( u n ) (u_n) ( u n ) , put I n = n u n I_n=nu_n I n = n u n and
C N ( ω , x ) = ∑ n = 1 N 1 [ 0 , u n ] ( T ω n x ) , M N = ∑ n = 1 N μ ˉ ( [ 0 , u n ] ) , C_N(\omega,x)=\sum_{n=1}^{N}\mathbf{1}_{[0,u_n]}(T_\omega^n x),\qquad M_N=\sum_{n=1}^{N}\bar{\mu}([0,u_n]), C N ( ω , x ) = n = 1 ∑ N 1 [ 0 , u n ] ( T ω n x ) , M N = n = 1 ∑ N μ ˉ ([ 0 , u n ]) ,
Q N ( ω ) = ∑ n = 1 N μ σ n ω ( [ 0 , u n ] ) , C ∗ = h ( 1 / 2 ) 2 2 α C 0 Γ ( κ 0 + 1 ) ( 1 − α ) . Q_N(\omega)=\sum_{n=1}^{N}\mu_{\sigma^n\omega}([0,u_n]),\qquad C_*=\frac{h(1/2)}{2\,2^\alpha C_0\Gamma(\kappa_0+1)(1-\alpha)}. Q N ( ω ) = n = 1 ∑ N μ σ n ω ([ 0 , u n ]) , C ∗ = 2 2 α C 0 Γ ( κ 0 + 1 ) ( 1 − α ) h ( 1/2 ) .
Here Γ \Gamma Γ denotes Euler’s gamma function.
Regularly varying schedules. Let L L L be positive and measurable, slowly varying at infinity, with L L L and 1 / L 1/L 1/ L locally bounded on a sufficiently large tail. A regularly varying schedule is given by u n = min ( u ∗ , c n − g L ( n ) ) u_n=\min(u_*,cn^{-g}L(n)) u n = min ( u ∗ , c n − g L ( n )) , 0 < g ≤ 1 0<g\le1 0 < g ≤ 1 , for sufficiently large n n n , with arbitrary positive initial radii. Put ξ = g ( 1 − α ) \xi=g(1-\alpha) ξ = g ( 1 − α ) . Define u ( x ) u(x) u ( x ) by the same formula for large real x x x , and put
J ( u ) = ∫ ∞ d x x ( x u ( x ) ) ζ . J(u)=\int^\infty\frac{dx}{x(xu(x))^\zeta}. J ( u ) = ∫ ∞ x ( xu ( x ) ) ζ d x .
Only convergence at infinity matters.
The critical function. Define
H r ( q ) = ∫ 0 ∞ 1 − e − q z z ( 1 + z ) − r d z , h r ( x ) = sup q ≥ 0 { H r ( q ) − x q r − 1 } , 0 < x < 1. H_r(q)=\int_0^\infty\frac{1-e^{-qz}}{z}(1+z)^{-r}\,dz,\qquad h_r(x)=\sup_{q\ge0}\left\{H_r(q)-\frac{xq}{r-1}\right\},\qquad0<x<1. H r ( q ) = ∫ 0 ∞ z 1 − e − q z ( 1 + z ) − r d z , h r ( x ) = q ≥ 0 sup { H r ( q ) − r − 1 x q } , 0 < x < 1.
The next theorem gives the count criterion, the lower envelopes and the mean convergence for regularly varying neutral schedules. Theorem 1.3 makes these conclusions explicit for logarithmic radii and near the strong-law threshold.
Theorem 1.2 (Neutral counts). Assume (RV). For almost every ω \omega ω , μ ω ( [ 0 , u ] ) ∼ C ∗ u 1 − α b ( log ( 1 / u ) ) \mu_\omega([0,u])\sim C_*u^{1-\alpha}b(\log(1/u)) μ ω ([ 0 , u ]) ∼ C ∗ u 1 − α b ( log ( 1/ u )) as u ↓ 0 u\downarrow0 u ↓ 0 . Let ( u n ) (u_n) ( u n ) be a regularly varying schedule.
(i) Normalization. Almost surely,
Q N M N ⟶ 1 , M N ∼ C ∗ c 1 − α g κ 0 1 − ξ N 1 − ξ L ( N ) 1 − α b ( log N ) . \frac{Q_N}{M_N}\longrightarrow1,\qquad M_N\sim\frac{C_*c^{1-\alpha}g^{\kappa_0}}{1-\xi}N^{1-\xi}L(N)^{1-\alpha}b(\log N). M N Q N ⟶ 1 , M N ∼ 1 − ξ C ∗ c 1 − α g κ 0 N 1 − ξ L ( N ) 1 − α b ( log N ) . (ii) Count law and upper fluctuations. For almost every environment and Lebesgue-almost every point , C N / Q N → 1 C_N/Q_N\to1 C N / Q N → 1 if and only if J ( u ) < ∞ J(u)<\infty J ( u ) < ∞ . For g < 1 g<1 g < 1 this integral always converges. At g = 1 g=1 g = 1 , if J ( u ) = ∞ J(u)=\infty J ( u ) = ∞ and I n → ∞ I_n\to\infty I n → ∞ , then lim sup C N / Q N = ∞ \limsup C_N/Q_N=\infty lim sup C N / Q N = ∞ ; if I n I_n I n does not tend to infinity, then lim inf C N / Q N = 0 \liminf C_N/Q_N=0 lim inf C N / Q N = 0 .
(iii) Lower envelopes. For almost every environment and Lebesgue-almost every point , at g = 1 g=1 g = 1 the lower envelope satisfies
lim inf N → ∞ C N Q N = { 0 , I n / log log n → 0 , 1 , I n / log log n → ∞ . \liminf_{N\to\infty}\frac{C_N}{Q_N}=
\begin{cases}
0,& I_n/\log\log n\to0,\\
1,& I_n/\log\log n\to\infty.
\end{cases} N → ∞ lim inf Q N C N = { 0 , 1 , I n / log log n → 0 , I n / log log n → ∞. More generally, at g = 1 g=1 g = 1 , the lower envelope is positive if lim inf n I n / log log n > 0 \liminf_n I_n/\log\log n>0 lim inf n I n / log log n > 0 , and it is strictly less than one if lim sup n I n / log log n < ∞ \limsup_n I_n/\log\log n<\infty lim sup n I n / log log n < ∞ . For every fixed schedule u n ∼ c ˉ log log n / n u_n\sim\bar c\log\log n/n u n ∼ c ˉ log log n / n ,
lim inf N → ∞ C N Q N = d π ( c ) , c ˉ α h r ( d π ( c ) ) = 1 , \liminf_{N\to\infty}\frac{C_N}{Q_N}=d_\pi(c),\qquad\frac{\bar c}{\alpha}h_r(d_\pi(c))=1, N → ∞ lim inf Q N C N = d π ( c ) , α c ˉ h r ( d π ( c )) = 1 , where d π ( c ) d_\pi(c) d π ( c ) is the unique solution in ( 0 , 1 ) (0,1) ( 0 , 1 ) of the second equation. The function d π d_\pi d π is continuous and strictly increasing, with limits zero as c ↓ 0 c\downarrow0 c ↓ 0 and one as c → ∞ c\to\infty c → ∞ . After rescaling c c c by c ˉ / α \bar c/\alpha c ˉ / α , this curve depends only on α \alpha α ; the entrance coefficient c ˉ \bar c c ˉ still depends on the parameter law.
(iv) Stationary mean convergence. Under the stationary annealed physical law Λ ‾ = μ ‾ × π N 0 \overline{\Lambda}=\overline{\mu}\times\pi^{\mathbb{N}_0} Λ = μ × π N 0 , over both the initial point and future symbols, C N / M N → 1 C_N/M_N\to1 C N / M N → 1 in L 1 L^1 L 1 if and only if I n → ∞ I_n\to\infty I n → ∞ . The radii need not be monotone.
Each assertion concerns a fixed schedule; its exceptional set may depend on the parameters of that schedule.
Theorem 1.3 (Logarithmic and threshold-window schedules). Assume (RV), and use the notation introduced before Theorem 1.2 .
(i) Logarithmic schedules. For u n = min ( u ∗ , c ( log n ) κ / n ) u_n=\min(u_\ast,c(\log n)^\kappa/n) u n = min ( u ∗ , c ( log n ) κ / n ) , n ≥ 3 n\ge3 n ≥ 3 , κ ∈ R \kappa\in\mathbb{R} κ ∈ R , with arbitrary positive initial radii,
Q N M N → 1 almost surely , M N ∼ C ∗ c 1 − α α N α ( log N ) κ ( 1 − α ) b ( log N ) . \frac{Q_N}{M_N}\to1\quad\text{almost surely},\qquad M_N\sim\frac{C_\ast c^{1-\alpha}}{\alpha}N^\alpha(\log N)^{\kappa(1-\alpha)}b(\log N). M N Q N → 1 almost surely , M N ∼ α C ∗ c 1 − α N α ( log N ) κ ( 1 − α ) b ( log N ) . Put κ c = α / ( 1 − α ) \kappa_c=\alpha/(1-\alpha) κ c = α / ( 1 − α ) . For almost every environment and Lebesgue-almost every point, the following classification holds:
κ > κ c : C N / Q N → 1 ; 0 < κ ≤ κ c : ( lim inf C N / Q N , lim sup C N / Q N ) = ( 1 , ∞ ) ; − 1 ≤ κ ≤ 0 : ( lim inf C N / Q N , lim sup C N / Q N ) = ( 0 , ∞ ) ; κ < − 1 : C N is eventually constant. \begin{aligned}
\kappa>\kappa_c &: \quad C_N/Q_N\to1;\\
0<\kappa\le\kappa_c &: \quad(\liminf C_N/Q_N,\limsup C_N/Q_N)=(1,\infty);\\
-1\le\kappa\le0 &: \quad(\liminf C_N/Q_N,\limsup C_N/Q_N)=(0,\infty);\\
\kappa<-1 &: \quad C_N\text{ is eventually constant.}
\end{aligned} κ > κ c 0 < κ ≤ κ c − 1 ≤ κ ≤ 0 κ < − 1 : C N / Q N → 1 ; : ( lim inf C N / Q N , lim sup C N / Q N ) = ( 1 , ∞ ) ; : ( lim inf C N / Q N , lim sup C N / Q N ) = ( 0 , ∞ ) ; : C N is eventually constant. For every κ > 0 \kappa>0 κ > 0 , C N / M N → 1 C_N/M_N\to1 C N / M N → 1 also in L 1 L^1 L 1 under the stationary annealed physical law.
(ii) Strong-law threshold window. Let ℓ : [ t 0 , ∞ ) → ( 0 , ∞ ) \ell:[t_0,\infty)\to(0,\infty) ℓ : [ t 0 , ∞ ) → ( 0 , ∞ ) be measurable and slowly varying at infinity, with ℓ \ell ℓ and 1 / ℓ 1/\ell 1/ ℓ locally bounded on this sufficiently large tail. For sufficiently large n n n , set
u n = min { u ∗ , c ( log n ) κ c ℓ ( log n ) / n } u_n=\min\{u_\ast,c(\log n)^{\kappa_c}\ell(\log n)/n\} u n = min { u ∗ , c ( log n ) κ c ℓ ( log n ) / n } and choose an arbitrary positive initial prefix. Put
J ℓ = ∫ t 0 ∞ d t t ℓ ( t ) ζ . J_\ell=\int_{t_0}^{\infty}\frac{dt}{t\ell(t)^\zeta}. J ℓ = ∫ t 0 ∞ t ℓ ( t ) ζ d t . Only convergence at infinity matters. Almost surely,
Q N M N → 1 , M N ∼ C ∗ c 1 − α α N α ( log N ) α ℓ ( log N ) 1 − α b ( log N ) . \frac{Q_N}{M_N}\to1,\qquad M_N\sim\frac{C_\ast c^{1-\alpha}}{\alpha}N^\alpha(\log N)^\alpha\ell(\log N)^{1-\alpha}b(\log N). M N Q N → 1 , M N ∼ α C ∗ c 1 − α N α ( log N ) α ℓ ( log N ) 1 − α b ( log N ) . For almost every environment and Lebesgue-almost every point,
{ C N / Q N → 1 , J ℓ < ∞ , ( lim inf C N / Q N , lim sup C N / Q N ) = ( 1 , ∞ ) , J ℓ = ∞ . \begin{cases}
C_N/Q_N\to1, & J_\ell<\infty,\\
(\liminf C_N/Q_N,\limsup C_N/Q_N)=(1,\infty), & J_\ell=\infty.
\end{cases} { C N / Q N → 1 , ( lim inf C N / Q N , lim sup C N / Q N ) = ( 1 , ∞ ) , J ℓ < ∞ , J ℓ = ∞. For every such correction, C N / M N → 1 C_N/M_N\to1 C N / M N → 1 in stationary annealed L 1 L^1 L 1 . As in Theorem 1.2 , exceptional sets may depend on the schedule.
For ℓ ( t ) = ( log t ) η \ell(t)=(\log t)^\eta ℓ ( t ) = ( log t ) η , the strong law holds exactly when η > κ c \eta>\kappa_c η > κ c ; at equality the lower and upper envelopes are one and infinity. The schedule u n = c n − 1 exp ( log n ) u_n=cn^{-1}\exp(\sqrt{\log n}) u n = c n − 1 exp ( log n ) satisfies the strong law. For u n = c n − 1 ( log log n ) η u_n=cn^{-1}(\log\log n)^\eta u n = c n − 1 ( log log n ) η , η > 0 \eta>0 η > 0 , stationary L 1 L^1 L 1 convergence coexists with an infinite almost-sure upper limit. The almost-sure lower limit is zero for 0 < η < 1 0<\eta<1 0 < η < 1 , d π ( c ) ∈ ( 0 , 1 ) d_\pi(c)\in(0,1) d π ( c ) ∈ ( 0 , 1 ) for η = 1 \eta=1 η = 1 , and one for η > 1 \eta>1 η > 1 . Thus, even when convergence in mean holds, the lower envelope distinguishes persistent
lower bounds from subsequences with unusually few visits; in both cases the normalized count can have arbitrarily large excesses.
Assumption (RV) requires C 0 L 0 ( v ) → π ( { α } ) C_0L_0(v) \to\pi(\{\alpha\}) C 0 L 0 ( v ) → π ({ α }) when κ 0 = 0 \kappa_0=0 κ 0 = 0 ; it permits either a positive minimum atom or an atomless index-zero law. For example, a CDF equal to C 0 ( log ( 1 / t ) ) − σ C_0(\log(1/t))^{-\sigma} C 0 ( log ( 1/ t ) ) − σ for small t > 0 t>0 t > 0 , σ > 0 \sigma>0 σ > 0 , has κ 0 = 0 \kappa_0=0 κ 0 = 0 , no minimum atom, and target mass C ∗ u 1 − α ( log log ( 1 / u ) ) σ C_*u^{1-\alpha}(\log\log(1/u))^\sigma C ∗ u 1 − α ( log log ( 1/ u ) ) σ . The uniform law on [ α , B ] [\alpha,B] [ α , B ] , B > α B>\alpha B > α , has κ 0 = 1 \kappa_0=1 κ 0 = 1 , C 0 = ( B − α ) − 1 C_0=(B-\alpha)^{-1} C 0 = ( B − α ) − 1 and L 0 = 1 L_0=1 L 0 = 1 , even when B ≥ 1. T h e B\geq1. The B ≥ 1. T h e L^1$ assertions use the deterministic stationary mean M N M_N M N , not the random reference mean Q N Q_N Q N . Both theorems are proved in § 8 ; the mean-convergence argument is in Section 8.3. Together with Theorem 1.1 , they separate arbitrary sparse targets away from zero from regularly varying neutral schedules whose clustering changes the count law.
The parameter law may be a point mass. For π = δ α \pi=\delta_\alpha π = δ α , Theorems 1.2 –1.4 apply to the single map T α T_\alpha T α , with κ 0 = 0 \kappa_0=0 κ 0 = 0 , C 0 = 1 C_0=1 C 0 = 1 and L 0 = 1 L_0=1 L 0 = 1 , and the exceptional sets concern the initial point alone. For this map and decreasing radii, Dedecker, Merlevède and Rio [11 ] prove that n u n → ∞ nu_n\to\infty n u n → ∞ implies C N / M N → 1 C_N/M_N\to1 C N / M N → 1 in L 1 L^1 L 1 , and that ∑ n n − 1 ( n u n ) − ( 1 − α ) < ∞ \sum_n n^{-1}(nu_n)^{-(1-\alpha)}<\infty ∑ n n − 1 ( n u n ) − ( 1 − α ) < ∞ implies the strong law. Within the regularly varying class of Theorem 1.2 , that theorem shows that the first condition is also necessary, and that the exponent 1 − α 1-\alpha 1 − α in the second may be replaced by ( 1 − α ) / α (1-\alpha)/\alpha ( 1 − α ) / α . Indeed, by the uniform convergence theorem [7 Theorem 1.2.1] , J ( u ) < ∞ J(u)<\infty J ( u ) < ∞ is equivalent to ∑ n n − 1 ( n u n ) − ( 1 − α ) / α < ∞ \sum_n n^{-1}(nu_n)^{-(1-\alpha)/\alpha}<\infty ∑ n n − 1 ( n u n ) − ( 1 − α ) / α < ∞ , and this series criterion is necessary and sufficient. For u n = c ( log n ) κ / n u_n=c(\log n)^\kappa/n u n = c ( log n ) κ / n the earlier condition requires κ > 1 / ( 1 − α ) \kappa>1/(1-\alpha) κ > 1/ ( 1 − α ) , whereas the strong law holds exactly when κ > α / ( 1 − α ) \kappa>\alpha/(1-\alpha) κ > α / ( 1 − α ) .
The next theorem describes the corresponding occupation paths. We use the Skorokhod space of real-valued càdlàg paths, that is, paths that are right-continuous and have left limits.
Theorem 1.4 (Neutral occupation limits). Assume (RV), and take a regularly varying schedule with g = 1 g=1 g = 1 . Put Λ = μ ˉ × π N 0 \Lambda=\bar{\mu}\times\pi^{\mathbb{N}_0} Λ = μ ˉ × π N 0 . For every fixed T > 0 T>0 T > 0 , every fixed probability ρ ≪ Λ \rho\ll\Lambda ρ ≪ Λ , and every deterministic subsequence N k → ∞ N_k\to\infty N k → ∞ such that I N k = N k u N k → ι ∈ [ 0 , ∞ ] I_{N_k}=N_ku_{N_k}\to\iota\in[0,\infty] I N k = N k u N k → ι ∈ [ 0 , ∞ ] ,
( C ⌊ N k t ⌋ M N k ) 0 ≤ t ≤ T ⟹ ( Z ι ( t ) ) 0 ≤ t ≤ T in D ( [ 0 , T ] ) with scalar M 1 topology. (1) \left(\frac{C_{\lfloor N_k t\rfloor}}{M_{N_k}}\right)_{0\leq t\leq T}\Longrightarrow(Z_\iota(t))_{0\leq t\leq T}\quad\text{in }D([0,T])\text{ with scalar }M_1\text{ topology.} \tag*{(1)} ( M N k C ⌊ N k t ⌋ ) 0 ≤ t ≤ T ⟹ ( Z ι ( t ) ) 0 ≤ t ≤ T in D ([ 0 , T ]) with scalar M 1 topology. (1) The count at time zero is defined to be zero. Here Z 0 ( t ) = 0 Z_0(t)=0 Z 0 ( t ) = 0 and Z ∞ ( t ) = t α Z_\infty(t)=t^\alpha Z ∞ ( t ) = t α . For 0 < ι < ∞ 0<\iota<\infty 0 < ι < ∞ , put β ι = ι c / α \beta_\iota=\iota c/\alpha β ι = ιc / α . Let N ι \mathcal{N}_\iota N ι be a Poisson random measure on ( 0 , ∞ ) 2 (0,\infty)^2 ( 0 , ∞ ) 2 with intensity ι c d s / s r ( 1 + w ) − r − 1 d w \iota c\,ds/s\,r(1+w)^{-r-1}dw ιc d s / s r ( 1 + w ) − r − 1 d w , and set
Z ι ( t ) = r − 1 β ι ∫ ( 0 , t ] × ( 0 , ∞ ) s α w N ι ( d s , d w ) . (2) Z_\iota(t)=\frac{r-1}{\beta_\iota}\int_{(0,t]\times(0,\infty)}s^\alpha w\,\mathcal{N}_\iota(ds,dw). \tag*{(2)} Z ι ( t ) = β ι r − 1 ∫ ( 0 , t ] × ( 0 , ∞ ) s α w N ι ( d s , d w ) . (2) This nondegenerate process has independent increments, is α \alpha α -self-similar, and satisfies
E Z ι ( t ) = t α , E e − θ Z ι ( 1 ) = exp [ − β ι H r ( ( r − 1 ) θ β ι ) ] , θ ≥ 0. (3) \mathbb{E}Z_\iota(t)=t^\alpha,\qquad\mathbb{E}e^{-\theta Z_\iota(1)}=\exp\left[-\beta_\iota H_r\left(\frac{(r-1)\theta}{\beta_\iota}\right)\right],\quad\theta\geq0. \tag*{(3)} E Z ι ( t ) = t α , E e − θ Z ι ( 1 ) = exp [ − β ι H r ( β ι ( r − 1 ) θ ) ] , θ ≥ 0. (3) The same limit holds with the single-horizon denominator Q N k Q_{N_k} Q N k under the stationary two-sided law m ( d ω , d x ) = P ( d ω ) μ ω ( d x ) m(d\omega,dx)=\mathbb{P}(d\omega)\mu_\omega(dx) m ( d ω , d x ) = P ( d ω ) μ ω ( d x ) , and under every fixed probability absolutely continuous with respect to m m m .
These are annealed distributional laws, over the point and the environment. The M 1 M_1 M 1 topology allows the consecutive visits within a residence cluster to merge into a single jump of the limiting path. The additive process is classical: after the time change v = t α v=t^\alpha v = t α , its raw form has the scale-invariant Poisson construction of [35 Theorem 4.1] , with generic jump tail ( 1 + w ) − r (1+w)^{-r} ( 1 + w ) − r and rate β ι \beta_\iota β ι . The theorem identifies this process as the limit of moving neutral counts. It is proved in § 8.8 , using the induced reward estimates rather than the L 1 L^1 L 1 clause of Theorem 1.2 .
Irregular targets and other forcing sequences. Regular variation is needed for the neutral count classification, but not for a criterion for infinitely many visits. For every fixed shrinking neutral schedule and every bounded iid law with essential minimum in ( 0 , 1 ) (0,1) ( 0 , 1 ) , Theorem 6.2 gives such a criterion through a deterministic entrance envelope. It measures the entrance opportunities created by future targets during one excursion. Corollaries 6.4 and 6.5 turn this envelope into an observation-gap test and a comparison of recurrent schedules for two parameter laws. In particular, summable radii can still give infinitely many visits. These are hitting criteria, not strong laws for arbitrary neutral counts.
Two further results clarify the distinction between entrances and residence times without iid forcing. For arbitrary parameter sequences in a compact subset of ( 0 , 1 ) (0,1) ( 0 , 1 ) , Theorem 7.1 gives a strong law for shrinking expanding-branch entrance intervals with divergent total length. The reference densities are specified in Section 7. Theorem 7.3 contrasts this with a nested neutral schedule whose total length diverges but whose normalized count has lower limit zero. For ergodic forcing, Theorem 9.1 gives joint return and residence marks and a compound-Poisson occupation limit. It assumes parameters in a compact subunit interval and either a positive atom at the minimum or a regularly varying minimum law with a quantitative empirical-distribution bound. These limits concern a fixed target on a rare-event time scale, not the moving schedule of Theorem 1.4.
Related work. For deterministic LSV maps, Frolov [19 ] obtained a strong law for divergent interval schedules away from zero. His later paper [20 ] extends estimates for base-supported observations to nonnegative BV observables supported away from zero for a deterministic intermittent map. Besides the counterexample recalled above, Kim [29 Proposition 4.1] proved the strong law for decreasing intervals of divergent invariant mass, provided 0 does not lie in the intersection of their closures. For decreasing neutral radii, Dedecker, Merlevède and Rio [11 ] record the deterministic criterion for infinitely many visits in terms of the total Lebesgue length, together with the sufficient conditions for convergence in mean and for the strong law compared above. For a single LSV map, Holland, Kirsebom, Kunde and Persson [26 ] show that almost every orbit eventually always meets [ 0 , r n ] [0,r_n] [ 0 , r n ] within its first n n n iterates when the invariant mass of [ 0 , r n ] [0,r_n] [ 0 , r n ] is at least ( c log n / n ) 1 − α (c\log n/n)^{1-\alpha} ( c log n / n ) 1 − α for a sufficiently large c c c . This condition allows radii of order log n / n \log n/n log n / n . Nested targets with a fixed nonzero centre are treated in [30 ] . These eventually-always-hitting results concern a target frozen over the first n n n iterates, whereas the lower envelopes in Theorem 1.2 concern cumulative visits to targets that change at every step. For general event sequences, equivalent characterizations of almost-sure finiteness and infinitely many occurrences are given in [39 ] . The deterministic envelope criterion in Section 6.1 follows from the same entrance geometry and [23 ] ; the additional argument treats the future-dependent entrance intervals produced by random compositions.
Haydn, Nicol, Persson and Valenti [25 ] showed that, under an annulus regularity assumption on the invariant measure, sufficiently fast polynomial decay of correlations gives a strong law for balls of measure at least i − γ i^{-\gamma} i − γ , 0 < γ < 1 0<\gamma<1 0 < γ < 1 ; Kim’s example shows that measure of order 1 / i 1/i 1/ i does not suffice [25 ] . For nested intervals on Young towers, Gupta, Nicol and Ott [24 ] give lower bounds for the normalized visit count; their application to LSV maps excludes the neutral fixed point. Carney and Nicol [9 ] study the growth of fixed nonintegrable observables, where deep excursions also play a central role. Here the observables are indicators of moving targets, and the normalization is their own cumulative mean.
The return geometry of random LSV maps has a well-developed theory. Bahsoun, Bose and Duan [5 ] established polynomial mixing for iid mixtures, with the faster map controlling the return tail. Their results already allow a slower map with an infinite absolutely continuous invariant measure. Bahsoun and Bose [4 ] obtained sharp inverse-endpoint and return-tail asymptotics for two-map mixtures, limit laws for fixed observables, and precise correlation asymptotics for observables supported away from zero. Bahsoun, Bose and Ruziboev [6 ] treated quenched mixing and continuous parameter laws, including logarithmic corrections to inverse endpoints. For sufficiently fast mixing environments, Dragičević, Hafouta and Leppänen [12 ] obtained quenched memory loss and limit theorems under conditions on the essential infimum of the random parameter. We use the inducing framework of [4 , 5 , 6 ] . For nonstationary compositions, Korepanov and Leppänen established coupling estimates with uniform return-tail bounds [31 ] , and later allowed time-dependent bounds with ergodic applications [32 ] . Our sequential arguments use the uniform estimates.
There are related strong laws and distributional results for other dynamical settings. Aimino, Nicol and Vaienti [2 ] prove random strong Borel–Cantelli laws under a spectral-gap assumption for nonnegative observables with uniformly bounded norms in the underlying Banach space. For sequential intermittent maps, Nicol, Török and Vaienti [34 ] treat uniformly C 1 C^{1} C 1 observations. Their ratio law assumes parameters bounded above by a number below 1/2 and a positive lower limiting mean; their result for the full subunit range is normalized by time. Holland and Todd [27 ] obtain averaged Poisson recurrence counts with a radius fixed over the observation horizon. Rodriguez Sponheimer [36 Theorems 4.2 and 4.4] proves almost-sure invariance principles for centred shrinking-target counts in Axiom A and spectral-gap systems, with variance determining the Brownian time scale. In our neutral-target problem, clusters remain visible even after division by the expected count.
Occupation limits and deviation estimates also arise in infinite ergodic theory. Sera [37 , 38 ] studies occupation and waiting times for fixed sets under an infinite invariant measure. Our counts instead concern shrinking sets under a stationary probability, with the target changing at each observation. For neutral holes, Bonanno and Tikekar [8 ] determine escape rates by first taking the long-time limit for a fixed hole and then shrinking it. The lower envelope here concerns cumulative visits to moving targets. It requires conditional deviation estimates that are uniform over the changing excursion rewards.
Sequential intermittent rare events are studied in [18 ] for parameters below 1/7 and generic nonzero centres. Marked limits for random intermittent systems are compared with [1 , 3 ] in § 9 . Our prescribed right-branch entrances allow the physical return time and the neutral residence time to be treated jointly throughout a compact subunit parameter range.
Proof strategy and organization. The proofs separate entrance frequency from residence duration by inducing on the expanding branch. For targets away from zero, we average the full-return operators and prove a covariance bound whose slowly decaying term is proportional to the product of the two target masses. The variance of the count is then bounded in terms of the cumulative target mass rather than the elapsed time, and this gives Theorem 1.1 even for arbitrarily slow divergence. Covariance bounds of this product form, and their use in Borel–Cantelli arguments, already occur in the deterministic renewal arguments of [23 , 19 ] ; related fixed-observable asymptotics appear in [4 ] . Here we need uniform bounds for a unbounded Borel iid parameter law and a comparison of random and stationary cumulative target masses.
Direct second-moment control can fail for neutral targets even when the strong law holds. Proposition 6.6 shows that neither deterministic thinning nor fixed nonnegative reweighting repairs this failure under the stationary annealed law in a range of power schedules, whereas block unions do satisfy a vanishing-relative-variance criterion.
For neutral targets, the proof has three further steps. First, the proof of Lemma 8.1 describes compositions of inverse left branches near zero, uniformly in the starting point and in the number of inverse steps. This identifies the target masses, and an integrable bound in the environment compares the random and stationary means. Second, call the number of target visits during one excursion away from the base its reward. Lemmas 8.2 –8.4 estimate these rewards, including conditional bounds, and give the strong-law criterion together with its necessity. The slowly varying correction from the parameter law enters both the target mass and the reward tail, and cancels from the criterion. Third, Lemma 8.5 gives a matching conditional estimate for the probability of unusually small counts, by analysing ordered products of weighted return operators. Spectral perturbation for rare events is classical [28 ] ; the difficulty here is to control these products uniformly when the weights change with time. Passing from the return-time scale to physical time then gives the critical lower envelope in § 8.6 . The same inverse-branch and weighted-operator estimates yield the occupation limits in § 8.8 .
For irregular neutral schedules, Lemma 6.3 compares the expected future entrance envelope with one computed from the averaged drift. The comparison is uniform over all deterministic schedules, including laws with no atom at the minimum. A stopping-time argument then supplies the divergent half of the hitting criterion.
Sections 2–5 construct the stationary measures and prove the iid strong law. Section 6 gives the arbitrary-interval conclusion and the irregular neutral-target criterion, followed by the comparison of thinning and block unions. Section 7 treats sequential entrances and the neutral obstruction. Section 8 proves the neutral count criterion, the critical lower envelope and the occupation limits. Section 9 treats joint excursion marks.
Averaged return operators
We use the inducing framework for random intermittent maps developed in [4 , 5 , 6 ] . The verification below treats a bounded Borel parameter law and gives the operator estimates needed for moving intervals, keeping the return geometry explicit.
Throughout this section 0 < s ≤ B < ∞ 0 < s \le B < \infty 0 < s ≤ B < ∞ , and the parameters are iid with Borel law π \pi π . Choose a ∈ ( 0 , 1 ) a \in(0,1) a ∈ ( 0 , 1 ) such that p a = π ( ( 0 , a ] ) > 0 p_a = \pi((0,a]) > 0 p a = π (( 0 , a ]) > 0 , and put r = 1 / a > 1 r = 1/a > 1 r = 1/ a > 1 , θ = r − 1 \theta= r - 1 θ = r − 1 . All constants may depend on B B B , a a a , p a p_a p a ; none is asserted to remain bounded as p a p_a p a tends to zero. On B V ( Y ) BV(Y) B V ( Y ) use the norm ∥ f ∥ 1 + Var Y f \lVert f\rVert_1 + \operatorname{Var}_Y f ∥ f ∥ 1 + Var Y f , with complexification for spectral arguments. Denote the averaged first-return transfers by R n R_n R n and set R ( z ) = ∑ n ≥ 1 z n R n R(z) = \sum_{n\geq1} z^n R_n R ( z ) = ∑ n ≥ 1 z n R n . More explicitly, let τ ω ( y ) = inf { n ≥ 1 : T ω n y ∈ Y } \tau_\omega(y) = \inf\{n \geq1:T_\omega^n y \in Y\} τ ω ( y ) = inf { n ≥ 1 : T ω n y ∈ Y } . Extending base inputs by zero, define
R n f = E [ 1 Y L s n − 1 ⋯ L s 0 ( 1 { τ ω = n } f ) ] . R_n f = \mathbb{E}\left[1_Y \mathcal{L}_{s_{n-1}}\cdots\mathcal{L}_{s_0}\left(1_{\{\tau_\omega=n\}}f\right)\right]. R n f = E [ 1 Y L s n − 1 ⋯ L s 0 ( 1 { τ ω = n } f ) ] .
Each τ ω \tau_\omega τ ω -partition cell is called a full first-return atom: its return branch maps onto Y Y Y . The same terminology will be used for deterministic parameter sequences and ergodic forcing.
Proposition 2.1 (Averaged renewal and stationary density). Under the fast-band assumption above, R ( 1 ) R(1) R ( 1 ) has a simple fixed probability density h ^ \hat h h ^ , which is positive and Lipschitz on Y Y Y , and the mean return γ = ∫ Y E π h ^ d y \gamma= \int_Y \mathbb{E}_\pi\hat h\,dy γ = ∫ Y E π h ^ d y is finite. Put P ‾ f = γ − 1 h ^ ∫ Y f \overline{P}f = \gamma^{-1}\hat h\int_Y f P f = γ − 1 h ^ ∫ Y f . The renewal operators T n = 1 Y L ‾ n 1 Y T_n = 1_Y\overline{\mathcal{L}}^n1_Y T n = 1 Y L n 1 Y on B V ( Y ) BV(Y) B V ( Y ) satisfy
T n = c n P ‾ + E n , ∣ c n − 1 ∣ ≤ C ( 1 + n ) − ( r − 1 ) , ∥ E n ∥ B V → B V ≤ C ( 1 + n ) − r . (4) T_n = c_n\overline{P} + E_n,\qquad|c_n-1| \leq C(1+n)^{-(r-1)},\qquad\lVert E_n\rVert_{BV\to BV} \leq C(1+n)^{-r}. \tag*{(4)} T n = c n P + E n , ∣ c n − 1∣ ≤ C ( 1 + n ) − ( r − 1 ) , ∥ E n ∥ B V → B V ≤ C ( 1 + n ) − r . (4) The physical operator L ‾ \overline{\mathcal{L}} L has a unique absolutely continuous stationary probability. Its density h h h satisfies h ≥ c > 0 h \geq c > 0 h ≥ c > 0 and h ( x ) ≤ C x − a h(x) \leq Cx^{-a} h ( x ) ≤ C x − a .
Proof. We verify the return geometry and spectrum before applying the renewal theorems, and then construct the physical stationary density.
Inverse distortion and an integrable fast-band tail
For a left-inverse word F ( u ) = q m ( u ) F(u)=q_m(u) F ( u ) = q m ( u ) , enumerate the inverses in their application order: q 0 = u q_0=u q 0 = u , q j = ϕ v j ( q j − 1 ) q_j=\phi_{v_j}(q_{j-1}) q j = ϕ v j ( q j − 1 ) . Put t j = ( 2 q j ) v j t_j=(2q_j)^{v_j} t j = ( 2 q j ) v j and e j = u q j ′ / q j e_j=uq_j'/q_j e j = u q j ′ / q j . Differentiating q j − 1 = q j ( 1 + t j ) q_{j-1}=q_j(1+t_j) q j − 1 = q j ( 1 + t j ) gives
e j = e j − 1 1 + t j 1 + ( 1 + v j ) t j , − ∂ u log ϕ v j ′ ( q j − 1 ( u ) ) = 1 + v j u 1 + t j 1 + ( 1 + v j ) t j ( e j − 1 − e j ) . e_j=e_{j-1}\frac{1+t_j}{1+(1+v_j)t_j},\qquad-\partial_u\log\phi_{v_j}'(q_{j-1}(u))=\frac{1+v_j}{u}\frac{1+t_j}{1+(1+v_j)t_j}(e_{j-1}-e_j). e j = e j − 1 1 + ( 1 + v j ) t j 1 + t j , − ∂ u log ϕ v j ′ ( q j − 1 ( u )) = u 1 + v j 1 + ( 1 + v j ) t j 1 + t j ( e j − 1 − e j ) .
Since e 0 = 1 e_0=1 e 0 = 1 and e j e_j e j decreases to a nonnegative value,
0 ≤ − ∂ u log F ′ ( u ) ≤ 1 + B u . (5) 0\leq-\partial_u\log F'(u)\leq\frac{1+B}{u}. \tag*{(5)} 0 ≤ − ∂ u log F ′ ( u ) ≤ u 1 + B . (5)
A first-return inverse on Y Y Y has the form ( 1 + F ) / 2 (1+F)/2 ( 1 + F ) /2 , contracts by at least 1 / 2 1/2 1/2 , and has log-Jacobian Lipschitz constant D = 2 ( 1 + B ) D=2(1+B) D = 2 ( 1 + B ) . All positive points return for every fixed word: below 1 / 2 1/2 1/2 , T s ≥ T B T_s\geq T_B T s ≥ T B , whose iterates escape every positive starting point. Thus the full-return partitions cover the base up to null endpoints.
Starting an inverse word at q 0 = 1 / 2 q_0=1/2 q 0 = 1/2 , a step v j ≤ a v_j\leq a v j ≤ a satisfies
q j − a − q j − 1 − a = q j − a [ 1 − ( 1 + t j ) − a ] ≥ a 2 − a − 1 q j − a t j ≥ a / 2. q_j^{-a}-q_{j-1}^{-a}=q_j^{-a}[1-(1+t_j)^{-a}]\geq a2^{-a-1}q_j^{-a}t_j\geq a/2. q j − a − q j − 1 − a = q j − a [ 1 − ( 1 + t j ) − a ] ≥ a 2 − a − 1 q j − a t j ≥ a /2.
All other increments are positive. If K m K_m K m counts the fast symbols, then q m ≤ [ 2 a + ( a / 2 ) K m ] − 1 / a q_m\leq[2^a+(a/2)K_m]^{-1/a} q m ≤ [ 2 a + ( a /2 ) K m ] − 1/ a . Reading an iid finite word backwards preserves its iid distribution, so K m K_m K m is binomial with parameters m , p a m,p_a m , p a . Exponential Markov gives
P ( K m ≤ p a m / 2 ) ≤ exp [ − p a ( 1 / 2 − e − 1 ) m ] , E q m ≤ C ( 1 + m ) − r . \mathbb{P}(K_m\leq p_am/2)\leq\exp[-p_a(1/2-e^{-1})m],\qquad\mathbb{E}q_m\leq C(1+m)^{-r}. P ( K m ≤ p a m /2 ) ≤ exp [ − p a ( 1/2 − e − 1 ) m ] , E q m ≤ C ( 1 + m ) − r .
The first-return tail has Lebesgue mass q n − 1 / 2 q_{n-1}/2 q n − 1 /2 . For its inverse branch ψ : Y → I \psi:Y\to I ψ : Y → I , distortion and the product rule give ∥ ψ ′ ( f ∘ ψ ) ∥ B V ≤ C ∣ I ∣ ∥ f ∥ B V \|\psi'(f\circ\psi)\|_{BV}\leq C|I|\|f\|_{BV} ∥ ψ ′ ( f ∘ ψ ) ∥ B V ≤ C ∣ I ∣∥ f ∥ B V . Consequently
E Leb { τ > n } ≤ C ( 1 + n ) − r , ∑ n > N ∥ R n ∥ B V → B V ≤ C ( 1 + N ) − r . (6) \mathbb{E}\operatorname{Leb}\{\tau>n\}\leq C(1+n)^{-r},\qquad\sum_{n>N}\|R_n\|_{BV\to BV}\leq C(1+N)^{-r}. \tag*{(6)} E Leb { τ > n } ≤ C ( 1 + n ) − r , n > N ∑ ∥ R n ∥ B V → B V ≤ C ( 1 + N ) − r . (6)
Parameter averages are defined by their jointly measurable branch formulas in L 1 L^1 L 1 ; their variation bounds follow from Fubini. The series defining R ( z ) R(z) R ( z ) converges in operator norm on the closed disk, and ∑ n n ∥ R n ∥ < ∞ \sum_n n\|R_n\|<\infty ∑ n n ∥ R n ∥ < ∞ .
The induced spectrum and aperiodicity
After k k k returns, each inverse ψ I \psi_I ψ I contracts by 2 − k 2^{-k} 2 − k , has log-Jacobian Lipschitz constant at most 2 D 2D 2 D , and maps onto a partition cell I I I of length at most Leb ( Y ) 2 − k \operatorname{Leb}(Y)2^{-k} Leb ( Y ) 2 − k . Its total physical return length r I r_I r I is at least k k k . Independence at finite stopping times, or equivalently positive concatenation of stopped finite words, gives
R ( z ) k f ( u ) = E ∑ I z r I ψ I ′ ( u ) f ( ψ I ( u ) ) . (7) R(z)^k f(u)=\mathbb{E}\sum_I z^{r_I}\psi_I'(u)f(\psi_I(u)). \tag*{(7)} R ( z ) k f ( u ) = E I ∑ z r I ψ I ′ ( u ) f ( ψ I ( u )) . (7)
For each fixed environment the cells form a partition. We use that partition before averaging; cells belonging to different environments need not be disjoint. The product rule and change of variables yield
∥ R ( z ) k f ∥ 1 ≤ ∥ f ∥ 1 , Var ( R ( z ) k f ) ≤ C 2 − k Var ( f ) + 2 D ∥ f ∥ 1 , ∣ z ∣ ≤ 1. (8) \|R(z)^k f\|_1\leq\|f\|_1,\qquad\operatorname{Var}(R(z)^k f)\leq C2^{-k}\operatorname{Var}(f)+2D\|f\|_1,\qquad|z|\leq1. \tag*{(8)} ∥ R ( z ) k f ∥ 1 ≤ ∥ f ∥ 1 , Var ( R ( z ) k f ) ≤ C 2 − k Var ( f ) + 2 D ∥ f ∥ 1 , ∣ z ∣ ≤ 1. (8)
Let Π m \Pi_m Π m average over a finite equal-cell partition of mesh ℓ m → 0 \ell_m\to0 ℓ m → 0 . Its range is finite-dimensional, ∥ f − Π m f ∥ 1 ≤ C ℓ m Var ( f ) \|f-\Pi_mf\|_1\leq C\ell_m\operatorname{Var}(f) ∥ f − Π m f ∥ 1 ≤ C ℓ m Var ( f ) , and Var ( Π m f ) ≤ C Var ( f ) \operatorname{Var}(\Pi_mf)\leq C\operatorname{Var}(f) Var ( Π m f ) ≤ C Var ( f ) . Applying (8) to f − Π m f f-\Pi_mf f − Π m f bounds the essential norm of R ( z ) k R(z)^k R ( z ) k by C 2 − k C2^{-k} C 2 − k . Hence r e s s ( R ( z ) ) ≤ 1 / 2 r_{\mathrm{ess}}(R(z))\leq1/2 r ess ( R ( z )) ≤ 1/2 .
We also need regularity before evaluating eigenfunctions at endpoints. In (7) , replace f ∘ ψ I f \circ\psi_I f ∘ ψ I by its cell average f I f_I f I , obtaining g k , z g_{k,z} g k , z . Distortion, partition lengths and the sum of restricted variations give
∥ R ( z ) k f − g k , z ∥ ∞ ≤ C 2 − k Var ( f ) , ∥ g k , z ∥ ∞ + Lip ( g k , z ) ≤ C ∥ f ∥ 1 . \lVert R(z)^k f-g_{k,z}\rVert_\infty\le C2^{-k}\operatorname{Var}(f), \qquad\lVert g_{k,z}\rVert_\infty+\operatorname{Lip}(g_{k,z})\le C\lVert f\rVert_1. ∥ R ( z ) k f − g k , z ∥ ∞ ≤ C 2 − k Var ( f ) , ∥ g k , z ∥ ∞ + Lip ( g k , z ) ≤ C ∥ f ∥ 1 .
Thus every eigenfunction with eigenvalue of modulus one has a Lipschitz representative. Positive Cesàro averages of R ( 1 ) k ( 21 Y ) R(1)^k(2\mathbf{1}_Y) R ( 1 ) k ( 2 1 Y ) give an invariant probability density h ^ \hat{h} h ^ , uniformly positive and log-Lipschitz on Y Y Y .
Suppose R ( z ) f = λ f R(z)f=\lambda f R ( z ) f = λ f , ∣ z ∣ = ∣ λ ∣ = 1 |z|=|\lambda|=1 ∣ z ∣ = ∣ λ ∣ = 1 , and set v = f / h ^ v=f/\hat{h} v = f / h ^ . Normalizing (7) by h ^ \hat{h} h ^ gives positive branch weights summing to one. Equality at a maximum of ∣ v ∣ |v| ∣ v ∣ propagates maximum modulus along every positive branch. The iterates of the common return-one inverse ψ 1 ( u ) = ( u + 1 ) / 2 \psi_1(u)=(u+1)/2 ψ 1 ( u ) = ( u + 1 ) /2 converge to the fixed point 1 1 1 ; hence ∣ v ( 1 ) ∣ = max ∣ v ∣ |v(1)|=\max|v| ∣ v ( 1 ) ∣ = max ∣ v ∣ . At 1 1 1 , apply the k k k -return equation for each integer k k k . For almost every environment all inverse images of 1 1 1 have maximum modulus. Intersect these countably many sets of environments of full probability. The return partitions have vanishing mesh, so their inverse images of 1 1 1 are dense and ∣ v ∣ |v| ∣ v ∣ is constant on Y Y Y .
Equality in the one-return equation now gives z v ( ( u + 1 ) / 2 ) = λ v ( u ) zv((u+1)/2)=\lambda v(u) z v (( u + 1 ) /2 ) = λ v ( u ) . At u = 1 u=1 u = 1 this implies λ = z \lambda=z λ = z , and iteration implies that v v v is constant. The positive return-two branch then forces z 2 = λ = z z^2=\lambda=z z 2 = λ = z , so z = λ = 1 z=\lambda=1 z = λ = 1 . All endpoint evaluations use continuous branch extensions; the sums are uniformly absolutely convergent by distortion and partition lengths. The L 1 L^1 L 1 power bound excludes Jordan blocks. It follows that R ( 1 ) R(1) R ( 1 ) has a spectral gap with simple projection P f = h ^ ∫ Y f Pf=\hat{h}\int_Y f P f = h ^ ∫ Y f . For ∣ z ∣ < 1 |z|<1 ∣ z ∣ < 1 , the stronger bound ∥ R ( z ) k f ∥ 1 ≤ ∣ z ∣ k ∥ f ∥ 1 \lVert R(z)^k f\rVert_1\le|z|^k\lVert f\rVert_1 ∥ R ( z ) k f ∥ 1 ≤ ∣ z ∣ k ∥ f ∥ 1 excludes eigenvalue one; on the unit circle the preceding argument does so for z ≠ 1 z\ne1 z = 1 . Thus I − R ( z ) I-R(z) I − R ( z ) is invertible on the closed disk away from 1 1 1 .
Physical normalization and renewal
Let U ℓ U_\ell U ℓ transfer from Y Y Y for ℓ \ell ℓ steps while killing at the first return, and let U 0 U_0 U 0 be extension by zero. For ℓ ≥ 1 \ell\ge1 ℓ ≥ 1 , its explicit averaged formula is
U ℓ f = E [ L s ℓ − 1 ⋯ L s 0 ( 1 { τ ω > ℓ } f ) ] , U ℓ : B V ( Y ) ⟶ L 1 ( [ 0 , 1 ] ) . U_\ell f=\mathbb{E}\left[\mathcal{L}_{s_{\ell-1}}\cdots\mathcal{L}_{s_0}(\mathbf{1}_{\{\tau_\omega>\ell\}}f)\right], \qquad U_\ell:BV(Y)\longrightarrow L^1([0,1]). U ℓ f = E [ L s ℓ − 1 ⋯ L s 0 ( 1 { τ ω > ℓ } f ) ] , U ℓ : B V ( Y ) ⟶ L 1 ([ 0 , 1 ]) .
The strict survival inequality excludes paths already returned at time ℓ \ell ℓ ; parameter averaging is part of the definition. By (6) ,
γ = ∑ ℓ ≥ 0 ∫ U ℓ h ^ = E h ^ τ < ∞ , h = γ − 1 ∑ ℓ ≥ 0 U ℓ h ^ . (9) \gamma=\sum_{\ell\ge0}\int U_\ell\hat{h}=\mathbb{E}_{\hat{h}}\tau<\infty,\qquad h=\gamma^{-1}\sum_{\ell\ge0}U_\ell\hat{h}. \tag*{(9)} γ = ℓ ≥ 0 ∑ ∫ U ℓ h ^ = E h ^ τ < ∞ , h = γ − 1 ℓ ≥ 0 ∑ U ℓ h ^ . (9)
Surviving pieces produce U ℓ + 1 h ^ U_{\ell+1}\hat{h} U ℓ + 1 h ^ , returning pieces produce R ℓ + 1 h ^ R_{\ell+1}\hat{h} R ℓ + 1 h ^ , and R ( 1 ) h ^ = h ^ R(1)\hat{h}=\hat{h} R ( 1 ) h ^ = h ^ ; thus L ‾ h = h \overline{L}h=h L h = h . On the base h Y = h ^ / γ h_Y=\hat{h}/\gamma h Y = h ^ / γ ; below it the time-one term is h ^ ( ( 1 + x ) / 2 ) / ( 2 γ ) \hat{h}((1+x)/2)/(2\gamma) h ^ (( 1 + x ) /2 ) / ( 2 γ ) . Hence h ≥ c > 0 h\ge c>0 h ≥ c > 0 on the whole interval. The physical rank-one operator is P ‾ = P / γ \overline{P}=P/\gamma P = P / γ , not P P P .
All hypotheses of [23 Theorem 2.2] now hold. The derivative normalization is P R ‾ ′ ( 1 ) P = γ P P\overline{R}'(1)P=\gamma P P R ′ ( 1 ) P = γ P . For T n = 1 Y L ‾ n 1 Y T_n=\mathbf{1}_Y\overline{\mathcal{L}}^n\mathbf{1}_Y T n = 1 Y L n 1 Y one obtains a rank-one approximation with an operator-norm remainder of the return-tail order. Separately, [22 Theorem 1.1] bounds the operator-norm distance to the normalized projection by the integrated-tail order; its remainder is smaller in every regime r > 1 r>1 r > 1 . Subtracting the first approximation from the second bounds the scalar correction, since the normalized projection is nonzero. This proves (4) ; here T 0 = id T_0=\operatorname{id} T 0 = id , c 0 = 1 c_0=1 c 0 = 1 , and E 0 = id − P ‾ E_0=\operatorname{id}-\overline{P} E 0 = id − P . The renewal generating function equals ( I − R ( z ) ) − 1 (I-R(z))^{-1} ( I − R ( z ) ) − 1 near zero by stopped-path decomposition. Invertibility continues that inverse throughout the open disk; Cauchy estimates give operator-norm convergence of its coefficient series at every ∣ z ∣ < 1 |z|<1 ∣ z ∣ < 1 , as required by the 2004 theorem.
Split base inputs at the last return:
L ‾ n ( 1 Y f ) = ∑ ℓ = 0 n U ℓ T n − ℓ f . \overline{\mathcal{L}}^n(\mathbf{1}_Yf)=\sum_{\ell=0}^{n}U_\ell T_{n-\ell}f. L n ( 1 Y f ) = ℓ = 0 ∑ n U ℓ T n − ℓ f .
Since ∥ U ℓ ∥ B V → L 1 ≤ C ( 1 + ℓ ) − r \lVert U_\ell\rVert_{BV\to L^1}\leq C(1+\ell)^{-r} ∥ U ℓ ∥ B V → L 1 ≤ C ( 1 + ℓ ) − r , dominated summation and (4) yield convergence to h ∫ f h\int f h ∫ f in L 1 L^1 L 1 . A B V BV B V input supported in [ d , 1 ] [d,1] [ d , 1 ] , d > 0 d>0 d > 0 , has first entry to Y Y Y within a fixed number K d K_d K d of steps, because T s ≥ T B T_s\geq T_B T s ≥ T B on the left branch. Its finitely many unnormalized partial-entry pieces have bounded variation by (5), the product rule and their two boundary jumps. Independence after entry reduces them to the base case. Density of such inputs in L 1 L^1 L 1 , with contraction, proves
L ‾ n f ⟶ h ∫ f in L 1 ( f ∈ L 1 ) . (10) \overline{\mathcal{L}}^n f \longrightarrow h\int f \quad\text{in }L^1\quad(f\in L^1). \tag*{(10)} L n f ⟶ h ∫ f in L 1 ( f ∈ L 1 ) . (10)
This proves uniqueness of the absolutely continuous stationary probability.
We also need an upper bound for the stationary density near zero. For inverse words starting at x < 1 / 2 x<1/2 x < 1/2 , the fast-band argument gives Eq m ( x ) ≤ [ x − a + c m ] − 1 / a + x e − c ′ m \operatorname{Eq}_m(x)\leq[x^{-a}+cm]^{-1/a}+xe^{-c'm} Eq m ( x ) ≤ [ x − a + c m ] − 1/ a + x e − c ′ m . Summation bounds ∑ m Eq m ( x ) ≤ C x 1 − a \sum_m\operatorname{Eq}_m(x)\leq Cx^{1-a} ∑ m Eq m ( x ) ≤ C x 1 − a . Concavity gives F ′ ( x ) ≤ F ( x ) / x F'(x)\leq F(x)/x F ′ ( x ) ≤ F ( x ) / x ; inserting this into the killed formula in (9) gives h ( x ) ≤ C x − a h(x)\leq Cx^{-a} h ( x ) ≤ C x − a . This is an annealed bound, not a uniform envelope for the random fibres.
Equivariant measures and the finiteness criterion
This section constructs the equivariant reference densities h ω h_\omega h ω used in Theorem 1.1, and shows that an absolutely continuous stationary probability exists exactly when π ( ( 0 , 1 ) ) > 0 \pi((0,1))>0 π (( 0 , 1 )) > 0 .
Proposition 3.1 (Probability fibres and finiteness). If π ( ( 0 , 1 ) ) > 0 \pi((0,1))>0 π (( 0 , 1 )) > 0 , the physical density has a past-measurable equivariant probability disintegration h ω h_\omega h ω , equivalent to Lebesgue measure, with E h ω = h \mathbb{E}h_\omega=h E h ω = h . If π ( ( 0 , 1 ) ) = 0 \pi((0,1))=0 π (( 0 , 1 )) = 0 , there is no absolutely continuous stationary probability.
Proof. The probability fibres follow from a locally bounded density martingale; the obstruction follows by inducing and Kac’s formula.
Consider the mass-one class C B \mathcal{C}_B C B of decreasing nonnegative densities for which x B + 1 f ( x ) x^{B+1}f(x) x B + 1 f ( x ) increases. Every such density satisfies f ( x ) ≤ 1 / x f(x)\leq1/x f ( x ) ≤ 1/ x and is locally Lipschitz on [ d , 1 ] [d,1] [ d , 1 ] with constant at most ( B + 1 ) / d 2 (B+1)/d^2 ( B + 1 ) / d 2 . For the branch calculation set g = φ s ( x ) g=\varphi_s(x) g = φ s ( x ) , t = ( 2 g ) s t=(2g)^s t = ( 2 g ) s , and v = ( 1 + x ) / 2 v=(1+x)/2 v = ( 1 + x ) /2 . Each L s \mathcal{L}_s L s , s ≤ B s\leq B s ≤ B , preserves the class: in the weighted left summand the factor ( 1 + t ) B + 1 / [ 1 + ( 1 + s ) t ] (1+t)^{B+1}/[1+(1+s)t] ( 1 + t ) B + 1 / [ 1 + ( 1 + s ) t ] increases, with derivative numerator ( B − s ) + B ( 1 + s ) t ≥ 0 (B-s)+B(1+s)t\geq0 ( B − s ) + B ( 1 + s ) t ≥ 0 ; the right summand uses increasing x / v x/v x / v . Unweighted monotonicity and mass preservation complete the check. Apply (10) to the constant density. Local compactness and closure give h ∈ C B h\in\mathcal{C}_B h ∈ C B . Its stationarity extends to continuous representatives on ( 0 , 1 ] (0,1] ( 0 , 1 ] .
Define h ω ( m ) = L s − 1 ⋯ L s − m h h_\omega^{(m)}=\mathcal{L}_{s_{-1}}\cdots\mathcal{L}_{s_{-m}}h h ω ( m ) = L s − 1 ⋯ L s − m h , with h ω ( 0 ) = h h_\omega^{(0)}=h h ω ( 0 ) = h . At each rational x > 0 x>0 x > 0 these are martingales for the increasing finite-past filtration, since the newly revealed symbol is independent and L h = h \mathcal{L}h=h L h = h . They are bounded by 1 / x 1/x 1/ x . On the intersection of the rational convergence sets, uniform local Lipschitz bounds give local uniform convergence to h ω h_\omega h ω . Bounded convergence yields E h ω ( x ) = h ( x ) \mathbb{E}h_\omega(x)=h(x) E h ω ( x ) = h ( x ) . Fatou gives ∫ h ω ≤ 1 \int h_\omega\leq1 ∫ h ω ≤ 1 , whereas Tonelli gives E ∫ h ω = ∫ h = 1 \mathbb{E}\int h_\omega=\int h=1 E ∫ h ω = ∫ h = 1 . Therefore ∫ h ω = 1 \int h_\omega=1 ∫ h ω = 1 almost surely, and Scheffé’s lemma gives full L 1 L^1 L 1 convergence; no uniform integrability near zero is needed. Passing to L 1 L^1 L 1 limits in h σ ω ( m + 1 ) = L s 0 h ω ( m ) h_{\sigma\omega}^{(m+1)}=\mathcal{L}_{s_0}h_\omega^{(m)} h σ ω ( m + 1 ) = L s 0 h ω ( m ) gives equivariance on a shift-invariant full-measure set. Weighted monotonicity and mass one imply h ω ( 1 ) > 0 h_\omega(1)>0 h ω ( 1 ) > 0 ; decreasingness then implies equivalence with Lebesgue measure. Past measurability makes the fibres independent of future symbols, identifying the stationary annealed law used for the pair estimates below.
For necessity suppose π ( ( 0 , 1 ) ) = 0 \pi((0,1))=0 π (( 0 , 1 )) = 0 . Then T s ≤ T 1 T_s\leq T_1 T s ≤ T 1 below 1 / 2 1/2 1/2 . The inverse endpoints are bounded below by those of T 1 T_1 T 1 , and q j − 1 − q j − 1 − 1 ≤ 2 q_j^{-1}-q_{j-1}^{-1}\leq2 q j − 1 − q j − 1 − 1 ≤ 2 for that map. Thus E Leb { τ > n } ≥ c / n \mathbb{E}\operatorname{Leb}\{\tau>n\}\geq c/n E Leb { τ > n } ≥ c / n . The preceding induced spectral proof requires only bounded parameters and finite returns, not an integrable tail. It still gives a unique positive induced density h ^ \widehat h h , including uniqueness in L 1 L^1 L 1 by approximation and contraction, with infinite mean return. If an absolutely continuous stationary probability μ \mu μ existed, then μ ( Y ) > 0 \mu(Y)>0 μ ( Y ) > 0 : every positive point eventually enters Y Y Y for every word, and stationarity forbids all inverse entry sets having zero mass. The stationary one-sided skew product π N × μ \pi^{\mathbb{N}}\times\mu π N × μ , induced on Y Y Y , has marginal base density invariant under R ( 1 ) R(1) R ( 1 ) ; this follows by independence of the unused future at each finite return. Its normalized marginal must be h ^ \hat{h} h ^ . Kac’s formula gives mean return at most 1 / μ ( Y ) < ∞ 1/\mu(Y)<\infty 1/ μ ( Y ) < ∞ , a contradiction. Singular invariant laws, including the fixed-point atom, are not excluded. □
Covariance estimates in physical time
We now bound the correlation between visits to two targets away from zero. The point is that the slowly decaying part of the bound carries the product of the two target masses, not only a function of the time lag.
Use the stationary skew-product law m ( d ω , d x ) = P ( d ω ) μ ω ( d x ) m(d\omega,dx)=\mathbb{P}(d\omega)\mu_\omega(dx) m ( d ω , d x ) = P ( d ω ) μ ω ( d x ) , and put X n = T ω n x X_n=T_\omega^n x X n = T ω n x , p n = μ ˉ ( A n ) p_n=\bar{\mu}(A_n) p n = μ ˉ ( A n ) . Fix d 0 > 0 d_0>0 d 0 > 0 and A n ⊂ [ d 0 , 1 ] A_n\subset[d_0,1] A n ⊂ [ d 0 , 1 ] .
Proposition 4.1 (Two-target covariance). Let 0 < a < 1 0<a<1 0 < a < 1 satisfy π ( ( 0 , a ] ) > 0 \pi((0,a])>0 π (( 0 , a ]) > 0 , and put r = 1 / a r=1/a r = 1/ a and θ = r − 1 \theta=r-1 θ = r − 1 . For intervals A n ⊂ [ d 0 , 1 ] A_n\subset[d_0,1] A n ⊂ [ d 0 , 1 ] and i < j i<j i < j ,
∣ Cov m ( 1 A i ( X i ) , 1 A j ( X j ) ) ∣ ≤ C d 0 p i p j ( 1 + j − i ) − θ + C d 0 p j ( 1 + j − i ) − r . (11) \left|\operatorname{Cov}_m(\mathbf{1}_{A_i}(X_i),\mathbf{1}_{A_j}(X_j))\right|
\le C_{d_0}p_i p_j(1+j-i)^{-\theta}+C_{d_0}p_j(1+j-i)^{-r}. \tag*{(11)} Cov m ( 1 A i ( X i ) , 1 A j ( X j )) ≤ C d 0 p i p j ( 1 + j − i ) − θ + C d 0 p j ( 1 + j − i ) − r . (11) The constant depends only on d 0 d_0 d 0 , the parameter law and a a a ; it is independent of the target sequence and its cumulative mass.
Proof. We first bound killed occupation away from zero and then split the earlier target at its first return to the base.
Use the auxiliary distance d = min { d 0 , 1 / 4 } d=\min\{d_0,1/4\} d = min { d 0 , 1/4 } ; constants denoted by C d C_d C d therefore depend only on the fixed target distance d 0 d_0 d 0 and the parameter law. A surviving excursion presently in [ d , 1 / 2 ) [d,1/2) [ d , 1/2 ) returns within K d K_d K d further steps. If W ℓ W_\ell W ℓ is the environment-dependent Lebesgue mass W ℓ ( ω ) = Leb { y ∈ Y : τ ω ( y ) > ℓ , T ω ℓ y ∈ [ d , 1 / 2 ) } W_\ell(\omega)=\operatorname{Leb}\{y\in Y:\tau_\omega(y)>\ell,\ T_\omega^\ell y\in[d,1/2)\} W ℓ ( ω ) = Leb { y ∈ Y : τ ω ( y ) > ℓ , T ω ℓ y ∈ [ d , 1/2 )} and r j = E Leb { τ = j } r_j=\mathbb{E}\operatorname{Leb}\{\tau=j\} r j = E Leb { τ = j } , then
∑ ℓ > N E W ℓ ≤ K d ∑ j > N r j ≤ C d ( 1 + N ) − r . \sum_{\ell>N}\mathbb{E}W_\ell\le K_d\sum_{j>N}r_j\le C_d(1+N)^{-r}. ℓ > N ∑ E W ℓ ≤ K d j > N ∑ r j ≤ C d ( 1 + N ) − r .
By (5) , the killed inverse derivative on [ d , 1 / 2 ] [d,1/2] [ d , 1/2 ] is bounded by C d W ℓ C_dW_\ell C d W ℓ . Consequently the operators U ℓ U_\ell U ℓ from B V ( Y ) BV(Y) B V ( Y ) to L ∞ ( [ d , 1 ] ) L^\infty([d,1]) L ∞ ([ d , 1 ]) admit norm bounds a ℓ a_\ell a ℓ with ∑ ℓ > N a ℓ ≤ C d ( 1 + N ) − r \sum_{\ell>N}a_\ell\le C_d(1+N)^{-r} ∑ ℓ > N a ℓ ≤ C d ( 1 + N ) − r . The occupation tail away from zero has exponent r r r , not r − 1 r-1 r − 1 . Insert (4) into the last-return identity and subtract h ∫ f = ∑ ℓ ≥ 0 U ℓ P ˉ f h\int f=\sum_{\ell\ge0}U_\ell\bar{P}f h ∫ f = ∑ ℓ ≥ 0 U ℓ P ˉ f . Splitting convolutions at n / 2 n/2 n /2 gives
∥ L n ( 1 Y f ) − h ∫ f ∥ L ∞ ( [ d , 1 ] ) ≤ C d ∣ ∫ f ∣ ( 1 + n ) − θ + C d ∥ f ∥ B V ( 1 + n ) − r . (12) \left\|\mathcal{L}^n(\mathbf{1}_Yf)-h\int f\right\|_{L^\infty([d,1])}
\le C_d|{\textstyle\int}f|(1+n)^{-\theta}+C_d\|f\|_{BV}(1+n)^{-r}. \tag*{(12)} L n ( 1 Y f ) − h ∫ f L ∞ ([ d , 1 ]) ≤ C d ∣ ∫ f ∣ ( 1 + n ) − θ + C d ∥ f ∥ B V ( 1 + n ) − r . (12)
For an earlier interval A i ⊂ [ d , 1 ] A_i\subset[d,1] A i ⊂ [ d , 1 ] , split 1 A i h \mathbf{1}_{A_i}h 1 A i h at its first entry into Y Y Y , including time zero. There are at most K d + 1 K_d+1 K d + 1 unnormalized densities f i , k f_{i,k} f i , k , with total mass p i p_i p i and total B V BV B V norm at most C d C_d C d . Indeed, each image is an interval; the pushed function G ′ ( h ∘ G ) G'(h\circ G) G ′ ( h ∘ G ) has uniformly bounded supremum and variation on its nonzero part, since h h h is locally Lipschitz and G ′ ≤ 1 G'\le1 G ′ ≤ 1 has controlled logarithmic distortion. Its two boundary jumps are bounded. Averaging preserves these bounds.
Apply (12) after each entry and test against A j A_j A j . Since h ≥ c > 0 h\ge c>0 h ≥ c > 0 , Leb ( A j ) ≤ C p j \operatorname{Leb}(A_j)\le Cp_j Leb ( A j ) ≤ C p j . For the finitely many short lags use bounded local densities and increase the constant. Since d d d depends only on d 0 d_0 d 0 , this proves (11) under the stationary skew-product law. □
From covariance estimates to strong laws
This section turns the covariance bound into the strong law of Theorem 1.1 ; the same two lemmas are used again for the sequential strong law of § 7 . We first isolate the elementary estimate shared by both strong-law proofs.
Lemma 5.1 (Weighted lag estimate). For ρ > 0 \rho>0 ρ > 0 , weights a h ∈ [ 0 , 1 ] a_h\in[0,1] a h ∈ [ 0 , 1 ] , and ∑ h ≥ 1 a h ≤ M \sum_{h\ge1}a_h\le M ∑ h ≥ 1 a h ≤ M , M ≥ 1 M\ge1 M ≥ 1 ,
∑ h ≥ 1 a h h − ρ ≤ C ρ G ρ ( M ) , G ρ ( M ) = { M 1 − ρ , 0 < ρ < 1 , 1 + log M , ρ = 1 , 1 , ρ > 1. (13) \sum_{h\ge1}a_hh^{-\rho}\le C_\rho G_\rho(M),\qquad G_\rho(M)=
\begin{cases}
M^{1-\rho}, & 0<\rho<1,\\
1+\log M, & \rho=1,\\
1, & \rho>1.
\end{cases} \tag*{(13)} h ≥ 1 ∑ a h h − ρ ≤ C ρ G ρ ( M ) , G ρ ( M ) = ⎩ ⎨ ⎧ M 1 − ρ , 1 + log M , 1 , 0 < ρ < 1 , ρ = 1 , ρ > 1. (13)
Proof. Use a h ≤ 1 a_h\le1 a h ≤ 1 up to ⌊ M ⌋ \lfloor M\rfloor ⌊ M ⌋ , and the total-mass bound afterwards.
In the covariance bound (11) , the slow term retains both target masses and the second term is summable in the lag. Summing (11) and applying the weighted lag lemma with exponent r − 1 r-1 r − 1 gives, on every contiguous block I I I ,
Var m ∑ n ∈ I 1 A n ( X n ) ≤ C d 0 ( 1 + ∑ n ∈ I p n ) 2 − δ , δ = min { r − 1 , 1 / 2 } > 0. \operatorname{Var}_{m}\sum_{n\in I}\mathbf{1}_{A_n}(X_n)\le C_{d_0}\left(1+\sum_{n\in I}p_n\right)^{2-\delta},\qquad\delta=\min\{r-1,1/2\}>0. Var m n ∈ I ∑ 1 A n ( X n ) ≤ C d 0 ( 1 + n ∈ I ∑ p n ) 2 − δ , δ = min { r − 1 , 1/2 } > 0.
We recall a standard variance criterion and give the short proof needed here.
Lemma 5.2 (Mass-level interpolation). Let Z N Z_N Z N be nonnegative and nondecreasing, with e N = E Z N → ∞ e_N=\mathbb{E}Z_N\to\infty e N = E Z N → ∞ , 0 ≤ e N + 1 − e N ≤ 1 0\le e_{N+1}-e_N\le1 0 ≤ e N + 1 − e N ≤ 1 , and, for some δ > 0 \delta>0 δ > 0 , E ∣ Z N − e N ∣ 2 ≤ C e N 2 − δ \mathbb{E}|Z_N-e_N|^2\le Ce_N^{2-\delta} E ∣ Z N − e N ∣ 2 ≤ C e N 2 − δ when e N ≥ 2 e_N\ge2 e N ≥ 2 . Then Z N / e N → 1 Z_N/e_N\to1 Z N / e N → 1 almost surely.
Proof. Fix b > 1 b>1 b > 1 and let N k N_k N k be the first index with e N k ≥ b k e_{N_k}\ge b^k e N k ≥ b k . Its overshoot is at most one. For every η > 0 \eta>0 η > 0 , Chebyshev gives a summable upper bound C η b − k δ C_\eta b^{-k\delta} C η b − k δ on P ( ∣ Z N k / e N k − 1 ∣ > η ) \mathbb{P}(|Z_{N_k}/e_{N_k}-1|>\eta) P ( ∣ Z N k / e N k − 1∣ > η ) . The ratio tends to one at these indices. Monotonicity bounds the intermediate lower and upper limits by 1 / b 1/b 1/ b and b b b . Intersect over a countable sequence b ↓ 1 b\downarrow1 b ↓ 1 .
Proof of Theorem 1.1. Equivariance gives E m ( S N ∣ Ω ) = Q N \mathbb{E}_m(S_N\mid\Omega)=Q_N E m ( S N ∣ Ω ) = Q N . Conditional Jensen bounds E P ∣ Q N − M N ∣ 2 \mathbb{E}_{\mathbb{P}}|Q_N-M_N|^2 E P ∣ Q N − M N ∣ 2 by Var m S N \operatorname{Var}_m S_N Var m S N . Apply the lemma to both S N S_N S N and Q N Q_N Q N , and disintegrate m m m . Equivalence of the reference fibres with Lebesgue measure yields the pointwise assertion in the main theorem. This argument does not require a separate environmental correlation estimate for Q N Q_N Q N .
Arbitrary intervals and irregular neutral targets
We first record what Theorem 1.1 gives for arbitrary intervals. § 6.1 then gives a criterion for infinitely many visits to irregular neutral targets, and § 6.2 shows that, for a range of power schedules, neither thinning nor fixed reweighting of the visits restores second-moment control, whereas block unions do.
Corollary 6.1. Under the parameter-law hypotheses of Theorem 1.1 , with π ( ( 0 , 1 ) ) > 0 \pi((0,1))>0 π (( 0 , 1 )) > 0 , every fixed deterministic interval sequence A n ⊂ [ 0 , 1 ] A_n\subset[0,1] A n ⊂ [ 0 , 1 ] satisfying ∑ n Leb ( A n ) = ∞ \sum_n\operatorname{Leb}(A_n)=\infty ∑ n Leb ( A n ) = ∞ is visited infinitely often for almost every environment and Lebesgue-almost every initial point.
Proof. Let J n = ( A n + 1 + 1 ) / 2 ⊂ Y J_n=(A_{n+1}+1)/2\subset Y J n = ( A n + 1 + 1 ) /2 ⊂ Y . Its total length diverges and a visit to J n J_n J n at time n n n forces a visit to A n + 1 A_{n+1} A n + 1 at time n + 1 n+1 n + 1 through the common right branch. Theorem 1.1 gives infinitely many visits to J n J_n J n , proving the assertion.
This corollary gives only an infinitely-often conclusion for general intervals. Theorem 1.1 supplies the strong ratio for targets bounded away from zero. Theorem 1.2 gives the integral criterion for the stated regularly varying neutral schedules, and Theorem 1.3 gives the logarithmic and strong-law-threshold classifications.
A criterion for irregular neutral targets
For the infinitely-often question, regular variation of the radii is unnecessary. A target may be reached during an excursion that began much earlier. The following envelope accounts for these possible entrances.
Suppose that π \pi π is supported on [ α , B ] [\alpha,B] [ α , B ] , where 0 < α < 1 0<\alpha<1 0 < α < 1 , B < ∞ B<\infty B < ∞ , and α \alpha α is its essential minimum. Define the averaged relative drift and its inverse scale by
a ( x ) = ∫ ( 2 x ) s d π ( s ) , 0 < x ≤ 1 2 , q ( t ) = a − 1 ( ( t + 1 ) − 1 ) , t ≥ 0. (14) a(x)=\int(2x)^s\,\mathrm{d}\pi(s), \qquad0<x\le\frac{1}{2}, \qquad q(t)=a^{-1}\left((t+1)^{-1}\right), \qquad t\ge0. \tag*{(14)} a ( x ) = ∫ ( 2 x ) s d π ( s ) , 0 < x ≤ 2 1 , q ( t ) = a − 1 ( ( t + 1 ) − 1 ) , t ≥ 0. (14)
The function a a a is continuous and strictly increasing from zero to one, so q q q is well defined and q ( 0 ) = 1 / 2 q(0)=1/2 q ( 0 ) = 1/2 .
Theorem 6.2 (Irregular neutral targets). Under these iid parameter assumptions , fix deterministic radii 0 ≤ r n ≤ r ∗ < 1 / 2 0\le r_n\le r_*<1/2 0 ≤ r n ≤ r ∗ < 1/2 with r n → 0 r_n\to0 r n → 0 , and put
w j = sup h ∈ N 0 min { r j + h , q ( h ) } , j ≥ 1. (15) w_j=\sup_{h\in\mathbb{N}_0}\min\{r_{j+h},q(h)\}, \qquad j\ge1. \tag*{(15)} w j = h ∈ N 0 sup min { r j + h , q ( h )} , j ≥ 1. (15) For almost every ω \omega ω and Lebesgue-almost every x x x ,
T ω n x ∈ [ 0 , r n ] infinitely often ⟺ ∑ j ≥ 1 w j = ∞ . (16) T_\omega^n x\in[0,r_n]\ \text{infinitely often} \iff\sum_{j\ge1}w_j=\infty. \tag*{(16)} T ω n x ∈ [ 0 , r n ] infinitely often ⟺ j ≥ 1 ∑ w j = ∞. (16) The environment exceptional set may depend on the fixed radius sequence. No regular variation or atom assumption on the minimum of π \pi π is imposed.
For nonincreasing radii, w j = r j w_j=r_j w j = r j . The deterministic version of this special case is recorded in [11 ] . More generally, for a single LSV map the criterion follows from the interval theorem of [23 ] and the inverse-branch entrance reduction used in [29 ] : ϕ α h ( r ) ≍ min { r , ( h + 1 ) − 1 / α } \phi_\alpha^h(r)\asymp\min\{r,(h+1)^{-1/\alpha}\} ϕ α h ( r ) ≍ min { r , ( h + 1 ) − 1/ α } , uniformly for 0 < r ≤ r ∗ 0<r\le r_* 0 < r ≤ r ∗ . In the random case the actual entrance interval depends on future parameters, so the deterministic-target theorem cannot be applied to it directly. We compare its expected length with (15), then prove divergence by restarting finite trials at entrances determined by the past.
Write Φ j , h , ω = ϕ s j ( ω ) ∘ ⋯ ∘ ϕ s j + h − 1 ( ω ) \Phi_{j,h,\omega}=\phi_{s_j(\omega)}\circ\cdots\circ\phi_{s_{j+h-1}(\omega)} Φ j , h , ω = ϕ s j ( ω ) ∘ ⋯ ∘ ϕ s j + h − 1 ( ω ) , with Φ j , 0 , ω = i d \Phi_{j,0,\omega}=\mathrm{id} Φ j , 0 , ω = id , and omit ω \omega ω when no confusion is possible. Let
V j ( ω ) = sup h ≥ 0 Φ j , h , ω ( r j + h ) . (17) V_j(\omega)=\sup_{h\ge0}\Phi_{j,h,\omega}(r_{j+h}). \tag*{(17)} V j ( ω ) = h ≥ 0 sup Φ j , h , ω ( r j + h ) . (17)
These are measurable functions of the symbols from time j j j onwards. The next estimate uses inverse-power and concentration arguments familiar from random return-time estimates [4 , 6 , 12 ] , but retains the full drift a a a and is uniform over the radius sequence.
Lemma 6.3. There are constants c , C , w 0 > 0 c,C,w_0>0 c , C , w 0 > 0 , depending only on the parameter law and r ∗ r_* r ∗ , such that c w j ≤ E V j ≤ C w j cw_j\le\mathbb{E}V_j\le Cw_j c w j ≤ E V j ≤ C w j whenever 0 < w j < w 0 0<w_j<w_0 0 < w j < w 0 . Moreover, one can choose a constant c 0 ∈ ( 0 , 1 / 4 ) c_0\in(0,1/4) c 0 ∈ ( 0 , 1/4 ) and deterministic integers ℓ j ≥ 0 \ell_j\ge0 ℓ j ≥ 0 so that, whenever 0 < w j < w 0 0<w_j<w_0 0 < w j < w 0 , an excursion started at any 0 ≤ y ≤ c 0 w j 0\le y\le c_0w_j 0 ≤ y ≤ c 0 w j stays below 2 c 0 w j 2c_0w_j 2 c 0 w j through time ℓ j \ell_j ℓ j with probability at least 1 / 2 1/2 1/2 , and 2 c 0 w j ≤ r j + ℓ j 2c_0w_j\le r_{j+\ell_j} 2 c 0 w j ≤ r j + ℓ j .
Proof. First, for every fixed b > 0 b>0 b > 0 ,
a ( b x ) a ( x ) ⟶ b α ( x ↓ 0 ) . (18) \frac{a(bx)}{a(x)}\longrightarrow b^\alpha\qquad(x\downarrow0). \tag*{(18)} a ( x ) a ( b x ) ⟶ b α ( x ↓ 0 ) . (18)
Indeed, under the tilted law ( 2 x ) s d π ( s ) / a ( x ) (2x)^s\,d\pi(s)/a(x) ( 2 x ) s d π ( s ) / a ( x ) , the mass of [ α + ε , B ] [\alpha+\varepsilon,B] [ α + ε , B ] is at most ( 2 x ) ε / 2 / π ( [ α , α + ε / 2 ] ) (2x)^{\varepsilon/2}/\pi([\alpha,\alpha+\varepsilon/2]) ( 2 x ) ε /2 / π ([ α , α + ε /2 ]) . This tends to zero, and b s b^s b s is bounded on [ α , B ] [\alpha,B] [ α , B ] .
Choose ℓ j \ell_j ℓ j as the first integer for which min { r j + ℓ j , q ( ℓ j ) } ≥ w j / 2 \min\{r_{j+\ell_j},q(\ell_j)\}\ge w_j/2 min { r j + ℓ j , q ( ℓ j )} ≥ w j /2 . Then
r j + ℓ j ≥ w j / 2 , ℓ j + 1 ≤ a ( w j / 2 ) − 1 . (19) r_{j+\ell_j}\ge w_j/2,\qquad\ell_j+1\le a(w_j/2)^{-1}. \tag*{(19)} r j + ℓ j ≥ w j /2 , ℓ j + 1 ≤ a ( w j /2 ) − 1 . (19)
By (18), choose c 0 < 1 / 4 c_0<1/4 c 0 < 1/4 and then w 0 > 0 w_0>0 w 0 > 0 so that 2 a ( 2 c 0 w ) / a ( w / 2 ) ≤ 1 / 2 2a(2c_0w)/a(w/2)\le1/2 2 a ( 2 c 0 w ) / a ( w /2 ) ≤ 1/2 for w < w 0 w<w_0 w < w 0 . Start at y ≤ c 0 w y\le c_0w y ≤ c 0 w and stop at the first crossing τ \tau τ of 2 c 0 w 2c_0w 2 c 0 w . Before crossing, the conditional mean increment is at most 2 c 0 w a ( 2 c 0 w ) 2c_0w\,a(2c_0w) 2 c 0 w a ( 2 c 0 w ) . Summing the stopped increments, including the possible overshoot, gives for h ≤ a ( w / 2 ) − 1 h\le a(w/2)^{-1} h ≤ a ( w /2 ) − 1
P ( τ ≤ h ) ≤ E ( X h ∧ τ − y ) c 0 w ≤ 2 h a ( 2 c 0 w ) ≤ 1 2 . (20) \mathbb{P}(\tau\le h)\le\frac{\mathbb{E}(X_{h\wedge\tau}-y)}{c_0w}\le2h\,a(2c_0w)\le\frac{1}{2}. \tag*{(20)} P ( τ ≤ h ) ≤ c 0 w E ( X h ∧ τ − y ) ≤ 2 h a ( 2 c 0 w ) ≤ 2 1 . (20)
Here X t X_t X t denotes the forward orbit started at y y y with fresh iid symbols. Taking w = w j w=w_j w = w j , h = ℓ j h=\ell_j h = ℓ j proves the trial assertion. Taking y = c 0 w j y=c_0w_j y = c 0 w j also gives P ( V j ≥ c 0 w j ) ≥ 1 / 2 \mathbb{P}(V_j\ge c_0w_j)\ge1/2 P ( V j ≥ c 0 w j ) ≥ 1/2 , hence the lower mean bound.
For the upper bound, put d α = α 2 − α − 1 d_\alpha=\alpha2^{-\alpha-1} d α = α 2 − α − 1 . Until an orbit from z > 0 z>0 z > 0 reaches Y Y Y ,
X t − α − X t + 1 − α ≥ d α X t − α ( 2 X t ) s t ≥ d α z − α ( 2 z ) s t . X_t^{-\alpha}-X_{t+1}^{-\alpha}\ge d_\alpha X_t^{-\alpha}(2X_t)^{s_t}\ge d_\alpha z^{-\alpha}(2z)^{s_t}. X t − α − X t + 1 − α ≥ d α X t − α ( 2 X t ) s t ≥ d α z − α ( 2 z ) s t .
The last inequality uses s t ≥ α s_t\ge\alpha s t ≥ α and X t ≥ z X_t\ge z X t ≥ z . Survival below Y Y Y through time M M M therefore implies ∑ t < M ( 2 z ) s t ≤ d α − 1 \sum_{t<M}(2z)^{s_t}\le d_\alpha^{-1} ∑ t < M ( 2 z ) s t ≤ d α − 1 . Choose a fixed K > 1 K>1 K > 1 with K α > 16 / d α K^\alpha>16/d_\alpha K α > 16/ d α , and put z = K w z=Kw z = K w , M = ⌊ ( 2 a ( w ) ) − 1 ⌋ M=\lfloor(2a(w))^{-1}\rfloor M = ⌊( 2 a ( w ) ) − 1 ⌋ . For small w w w , the iid summands Z t = ( 2 z ) s t Z_t=(2z)^{s_t} Z t = ( 2 z ) s t lie in [ 0 , b z ] [0,b_z] [ 0 , b z ] , where b z = ( 2 z ) α b_z=(2z)^\alpha b z = ( 2 z ) α , and their sum has mean μ = M a ( z ) ≥ K α / 8 > 2 / d α \mu=M a(z)\ge K^\alpha/8>2/d_\alpha μ = M a ( z ) ≥ K α /8 > 2/ d α . The bounded-variable Chernoff estimate gives
P ( ∑ t < M Z t ≤ d α − 1 ) ≤ exp { − μ / ( 8 b z ) } ≤ exp { − c 1 w − α } . \mathbb{P}\left(\sum_{t<M}Z_t\le d_\alpha^{-1}\right)\le\exp\{-\mu/(8b_z)\}\le\exp\{-c_1w^{-\alpha}\}. P ( t < M ∑ Z t ≤ d α − 1 ) ≤ exp { − μ / ( 8 b z )} ≤ exp { − c 1 w − α } .
For example, convexity yields E e − t Z t / b z ≤ 1 − ( 1 − e − t ) E Z t / b z \mathbb{E}e^{-tZ_t/b_z}\le1-(1-e^{-t})\mathbb{E}Z_t/b_z E e − t Z t / b z ≤ 1 − ( 1 − e − t ) E Z t / b z ; exponential Markov with t = log 2 t=\log2 t = log 2 gives the displayed bound.
If V j > K w j V_j>Kw_j V j > K w j , some h h h has Φ j , h ( r j + h ) > K w j \Phi_{j,h}(r_{j+h})>Kw_j Φ j , h ( r j + h ) > K w j . Then r j + h > w j r_{j+h}>w_j r j + h > w j , so (15) forces q ( h ) ≤ w j q(h)\le w_j q ( h ) ≤ w j and h + 1 ≥ a ( w j ) − 1 h+1\ge a(w_j)^{-1} h + 1 ≥ a ( w j ) − 1 . The orbit from K w j Kw_j K w j remains on the left through this horizon and hence through M = ⌊ ( 2 a ( w j ) ) − 1 ⌋ M=\lfloor(2a(w_j))^{-1}\rfloor M = ⌊( 2 a ( w j ) ) − 1 ⌋ , for small w j w_j w j . Thus every possible witness is covered by the same survival event, giving
P ( V j > K w j ) ≤ e − c 1 w j − α , E V j ≤ K w j + r ∗ e − c 1 w j − α ≤ C w j . \mathbb{P}(V_j>Kw_j)\le e^{-c_1w_j^{-\alpha}},\qquad\mathbb{E}V_j\le Kw_j+r_*e^{-c_1w_j^{-\alpha}}\le Cw_j. P ( V j > K w j ) ≤ e − c 1 w j − α , E V j ≤ K w j + r ∗ e − c 1 w j − α ≤ C w j .
This completes the proof.
Proof of Theorem 6.2. Ignore the null set of points eventually mapped to zero. Every remaining left excursion is finite, since T s ≥ T B T_s\ge T_B T s ≥ T B on the left. An excursion landing at time j j j contains a scheduled hit exactly when its landing point is at most V j V_j V j . Indeed, invert the left branches from the hit time back to j j j . Conversely, such an inverse threshold gives a hit before exit. A positive supremum in (17) is attained because its terms are bounded by r j + h → 0 r_{j+h}\to0 r j + h → 0 . Discarding the finite initial excursion, we obtain the pathwise equivalence
{ X n ≤ r n infinitely often } = { X j − 1 ∈ [ 1 / 2 , ( 1 + V j ) / 2 ] infinitely often } . (21) \{X_n\le r_n\text{ infinitely often}\}=\{X_{j-1}\in[1/2,(1+V_j)/2]\text{ infinitely often}\}. \tag*{(21)} { X n ≤ r n infinitely often } = { X j − 1 ∈ [ 1/2 , ( 1 + V j ) /2 ] infinitely often } . (21)
Suppose first that ∑ j w j < ∞ \sum_jw_j<\infty ∑ j w j < ∞ . Start X 0 X_0 X 0 with law μ ˉ = h d x \bar\mu=h\,dx μ ˉ = h d x , independently of the future symbols. The variable X j − 1 X_{j-1} X j − 1 is independent of V j V_j V j ; the right branch does not depend on s j − 1 s_{j-1} s j − 1 . Boundedness of h h h on Y Y Y gives
P { X j − 1 ∈ [ 1 / 2 , ( 1 + V j ) / 2 ] } = E ∫ 1 / 2 ( 1 + V j ) / 2 h ( x ) d x ≤ C E V j ≤ C ′ w j (22) \mathbb{P}\{X_{j-1}\in[1/2,(1+V_j)/2]\}=\mathbb{E}\int_{1/2}^{(1+V_j)/2}h(x)\,dx\le C\mathbb{E}V_j\le C'w_j \tag*{(22)} P { X j − 1 ∈ [ 1/2 , ( 1 + V j ) /2 ]} = E ∫ 1/2 ( 1 + V j ) /2 h ( x ) d x ≤ C E V j ≤ C ′ w j (22)
for all sufficiently large j j j with w j > 0 w_j > 0 w j > 0 . If w j = 0 w_j = 0 w j = 0 , all later radii are zero. The first Borel–Cantelli lemma and (21) prove convergence. Equivalence of μ ˉ \bar{\mu} μ ˉ with Lebesgue measure transfers this conclusion to Lebesgue initial law.
Now suppose ∑ j w j = ∞ \sum_j w_j = \infty ∑ j w j = ∞ , and use Lebesgue initial law. Since w j ≤ sup n ≥ j r n → 0 w_j \le\sup_{n\ge j} r_n \to0 w j ≤ sup n ≥ j r n → 0 , the lemma applies after a finite prefix. The deterministic intervals J j = [ 1 / 2 , ( 1 + c 0 w j ) / 2 ] J_j = [1/2,(1+c_0w_j)/2] J j = [ 1/2 , ( 1 + c 0 w j ) /2 ] have divergent total length. Theorem 1.1, with a one-step index shift, gives X j − 1 ∈ J j X_{j-1} \in J_j X j − 1 ∈ J j infinitely often almost surely.
Let F t = σ ( X 0 , s 0 , … , s t − 1 ) \mathcal{F}_t = \sigma(X_0,s_0,\ldots,s_{t-1}) F t = σ ( X 0 , s 0 , … , s t − 1 ) . Choose the first sufficiently late such entrance as S 1 S_1 S 1 , and set
E k = S k + ℓ S k , S k + 1 = inf { j ≥ E k + 1 : X j − 1 ∈ J j } . E_k = S_k + \ell_{S_k}, \qquad S_{k+1} = \inf\{j \ge E_k + 1 : X_{j-1} \in J_j\}. E k = S k + ℓ S k , S k + 1 = inf { j ≥ E k + 1 : X j − 1 ∈ J j } .
All these times are finite: each trial skips only finitely many indices of an infinite entrance sequence. They are stopping times for ( F t ) (\mathcal{F}_t) ( F t ) . In particular, { E k ≤ t } = ⋃ j + ℓ j ≤ t { S k = j } \{E_k \le t\} = \bigcup_{j+\ell_j\le t}\{S_k=j\} { E k ≤ t } = ⋃ j + ℓ j ≤ t { S k = j } ; the next start is determined by { E k ≤ j − 1 } \{E_k \le j-1\} { E k ≤ j − 1 } and X j − 1 X_{j-1} X j − 1 , both known at time j − 1 j-1 j − 1 . At time S k S_k S k , the common right branch gives X S k ≤ c 0 w S k X_{S_k} \le c_0w_{S_k} X S k ≤ c 0 w S k , and the unused symbols beginning at S k S_k S k are iid and independent of F S k \mathcal{F}_{S_k} F S k . By (20) , the event H k H_k H k of staying below 2 c 0 w S k 2c_0w_{S_k} 2 c 0 w S k through E k E_k E k satisfies
H k ∈ F E k , P ( H k ∣ F S k ) ≥ 1 2 . H_k \in\mathcal{F}_{E_k}, \qquad\mathbb{P}(H_k \mid\mathcal{F}_{S_k}) \ge\frac{1}{2}. H k ∈ F E k , P ( H k ∣ F S k ) ≥ 2 1 .
It implies a scheduled hit at E k E_k E k . For deterministic a ≤ b a \le b a ≤ b , successively conditioning the last failure, using E k < S k + 1 E_k < S_{k+1} E k < S k + 1 , gives P ( ⋂ k = a b H k c ) ≤ 2 − ( b − a + 1 ) \mathbb{P}(\bigcap_{k=a}^{b} H_k^c) \le2^{-(b-a+1)} P ( ⋂ k = a b H k c ) ≤ 2 − ( b − a + 1 ) . Letting b → ∞ b \to\infty b → ∞ and then taking the countable union over a a a proves that infinitely many trials succeed. Their endpoints are strictly increasing. Finally, Fubini’s theorem gives the claimed almost-every-environment statements in both directions.
The envelope has a simpler form when the target sizes decrease along a prescribed sequence of observation times. Write τ ( b ) = 1 / a ( b ) \tau(b) = 1/a(b) τ ( b ) = 1/ a ( b ) .
Corollary 6.4 (Prescribed observation times). Under the parameter assumptions of Theorem 6.2, fix deterministic integers 0 = n 0 < n 1 < n 2 < ⋯ 0 = n_0 < n_1 < n_2 < \cdots 0 = n 0 < n 1 < n 2 < ⋯ and nonincreasing radii 0 < b k ≤ r ∗ < 1 / 2 0 < b_k \le r_* < 1/2 0 < b k ≤ r ∗ < 1/2 tending to zero. Put d k = n k − n k − 1 d_k = n_k - n_{k-1} d k = n k − n k − 1 . For almost every environment and Lebesgue-almost every initial point,
T ω n k x ∈ [ 0 , b k ] infinitely often ⟺ ∑ k ≥ 1 b k min { d k , τ ( b k ) } = ∞ . (23) T_\omega^{n_k}x \in[0,b_k]\ \text{ infinitely often}
\quad\Longleftrightarrow\quad
\sum_{k\ge1} b_k \min\{d_k,\tau(b_k)\} = \infty. \tag*{(23)} T ω n k x ∈ [ 0 , b k ] infinitely often ⟺ k ≥ 1 ∑ b k min { d k , τ ( b k )} = ∞. (23)
Proof. Set r n k = b k r_{n_k} = b_k r n k = b k and r n = 0 r_n = 0 r n = 0 otherwise, ignoring the null set of points eventually mapped to zero. For n k − 1 < j ≤ n k n_{k-1} < j \le n_k n k − 1 < j ≤ n k , nonincrease of both b k b_k b k and q q q shows that the first future observation attains the supremum in (15) . Consequently
∑ j w j = ∑ k F ( b k , d k ) , F ( b , d ) = ∑ h = 0 d − 1 min { b , q ( h ) } . \sum_j w_j = \sum_k F(b_k,d_k), \qquad F(b,d) = \sum_{h=0}^{d-1}\min\{b,q(h)\}. j ∑ w j = k ∑ F ( b k , d k ) , F ( b , d ) = h = 0 ∑ d − 1 min { b , q ( h )} .
Uniformly over integers d ≥ 1 d \ge1 d ≥ 1 and sufficiently small b b b ,
F ( b , d ) ≍ b min { d , τ ( b ) } . (24) F(b,d) \asymp b\min\{d,\tau(b)\}. \tag*{(24)} F ( b , d ) ≍ b min { d , τ ( b )} . (24)
Indeed, q ( h ) ≥ b q(h) \ge b q ( h ) ≥ b exactly when h + 1 ≤ τ ( b ) h+1 \le\tau(b) h + 1 ≤ τ ( b ) . Thus F = b d F = bd F = b d if d ≤ τ ( b ) d \le\tau(b) d ≤ τ ( b ) , while the first ⌊ τ ( b ) ⌋ \lfloor\tau(b)\rfloor ⌊ τ ( b )⌋ terms give F ≥ b τ ( b ) / 2 F \ge b\tau(b)/2 F ≥ b τ ( b ) /2 if d > τ ( b ) ≥ 2 d > \tau(b) \ge2 d > τ ( b ) ≥ 2 . For the upper bound, choose α < β < 1 \alpha< \beta< 1 α < β < 1 . The tilted-law concentration used to prove (18) gives, for all small b b b , a ( b y ) / a ( b ) ≥ y β / 2 a(by)/a(b) \ge y^\beta/2 a ( b y ) / a ( b ) ≥ y β /2 uniformly in 0 < y ≤ 1 0 < y \le1 0 < y ≤ 1 . Hence, when h + 1 ≥ τ ( b ) h+1 \ge\tau(b) h + 1 ≥ τ ( b ) ,
q ( h ) ≤ b ( 2 τ ( b ) h + 1 ) 1 / β . q(h) \le b\left(\frac{2\tau(b)}{h+1}\right)^{1/\beta}. q ( h ) ≤ b ( h + 1 2 τ ( b ) ) 1/ β .
Since 1 / β > 1 1/\beta> 1 1/ β > 1 , summing this tail and the initial terms gives F ( b , d ) ≤ C b τ ( b ) F(b,d) \le Cb\tau(b) F ( b , d ) ≤ C b τ ( b ) , independently of d d d . Together with F ( b , d ) ≤ b d F(b,d) \le bd F ( b , d ) ≤ b d , this proves (24) . Theorem 6.2 now applies.
The summand in (22) grows with the preceding gap only until that gap reaches the residence scale τ ( b k ) \tau(b_k) τ ( b k ) . For example, for an iid law on { 1 / 2 , 3 / 4 } \{1/2,3/4\} { 1/2 , 3/4 } with both masses positive, τ ( b ) ≍ b − 1 / 2 \tau(b)\asymp b^{-1/2} τ ( b ) ≍ b − 1/2 . Taking n k = k 2 n_k=k^2 n k = k 2 and b k = η k − 3 / 2 b_k=\eta k^{-3/2} b k = η k − 3/2 , 0 < η < r ∗ 0<\eta<r_* 0 < η < r ∗ , gives a divergent criterion comparable to ∑ k k − 3 / 4 \sum_k k^{-3/4} ∑ k k − 3/4 , although ∑ k b k < ∞ \sum_k b_k<\infty ∑ k b k < ∞ . The positive physical-time schedule r k 2 = b k r_{k^2}=b_k r k 2 = b k , r n = η 2 − n r_n=\eta2^{-n} r n = η 2 − n at nonsquares therefore also has summable radii and infinitely many hits.
We can also compare parameter laws through all their neutral-target schedules. Fix 0 < r ∗ < 1 / 2 0<r_*<1/2 0 < r ∗ < 1/2 . Let R ( π ) \mathcal{R}(\pi) R ( π ) be the class of deterministic sequences r = ( r n ) \mathbf{r}=(r_n) r = ( r n ) in [ 0 , r ∗ ] [0,r_*] [ 0 , r ∗ ] , tending to zero, for which the limsup in (16) has full Lebesgue measure for almost every environment with parameter law π \pi π . This assertion is made separately for each schedule; its exceptional set may depend on the schedule.
Corollary 6.5 (Comparison of parameter laws). Let π i \pi_i π i , i = 1 , 2 i=1,2 i = 1 , 2 , satisfy the parameter assumptions of Theorem 6.2, with respective essential minima α i ∈ ( 0 , 1 ) \alpha_i\in(0,1) α i ∈ ( 0 , 1 ) , and let a i a_i a i be their averaged drifts. Then
R ( π 2 ) ⊆ R ( π 1 ) ⟺ a 1 ( r ) = O ( a 2 ( r ) ) ( r ↓ 0 ) . (25) \mathcal{R}(\pi_2)\subseteq\mathcal{R}(\pi_1)
\quad\Longleftrightarrow\quad
a_1(r)=O(a_2(r))\quad(r\downarrow0). \tag*{(25)} R ( π 2 ) ⊆ R ( π 1 ) ⟺ a 1 ( r ) = O ( a 2 ( r )) ( r ↓ 0 ) . (25) In particular, R ( π 1 ) = R ( π 2 ) \mathcal{R}(\pi_1)=\mathcal{R}(\pi_2) R ( π 1 ) = R ( π 2 ) if and only if a 1 ( r ) ≍ a 2 ( r ) a_1(r)\asymp a_2(r) a 1 ( r ) ≍ a 2 ( r ) near zero.
Proof. If a 1 ≤ C a 2 a_1\leq Ca_2 a 1 ≤ C a 2 near zero, choose c ∈ ( 0 , 1 ) c\in(0,1) c ∈ ( 0 , 1 ) with C c α 2 ≤ 1 Cc^{\alpha_2}\leq1 C c α 2 ≤ 1 . Since a 2 ( c r ) ≤ c α 2 a 2 ( r ) a_2(cr)\leq c^{\alpha_2}a_2(r) a 2 ( cr ) ≤ c α 2 a 2 ( r ) , we have a 1 ( c r ) ≤ a 2 ( r ) a_1(cr)\leq a_2(r) a 1 ( cr ) ≤ a 2 ( r ) for small r r r , and hence q 1 ( h ) ≥ c q 2 ( h ) q_1(h)\geq cq_2(h) q 1 ( h ) ≥ c q 2 ( h ) for all sufficiently large integers h h h . Decrease c c c to cover the finitely many remaining indices. For every schedule, its envelopes satisfy w j ( 1 ) ≥ c w j ( 2 ) w_j^{(1)}\geq cw_j^{(2)} w j ( 1 ) ≥ c w j ( 2 ) . Theorem 6.2 proves the inclusion.
Conversely, write v i ( r ) = r / a i ( r ) v_i(r)=r/a_i(r) v i ( r ) = r / a i ( r ) and τ i ( r ) = 1 / a i ( r ) \tau_i(r)=1/a_i(r) τ i ( r ) = 1/ a i ( r ) . Choosing β i ∈ ( α i , 1 ) \beta_i\in(\alpha_i,1) β i ∈ ( α i , 1 ) gives a i ( r ) ≥ π i ( [ α i , β i ] ) ( 2 r ) β i a_i(r)\geq\pi_i([\alpha_i,\beta_i])(2r)^{\beta_i} a i ( r ) ≥ π i ([ α i , β i ]) ( 2 r ) β i , so v i ( r ) → 0 v_i(r)\to0 v i ( r ) → 0 . If a 1 a_1 a 1 is not O ( a 2 ) O(a_2) O ( a 2 ) , we may choose 0 < z m ≤ r ∗ 0<z_m\leq r_* 0 < z m ≤ r ∗ strictly decreasing to zero such that
a 1 ( z m ) a 2 ( z m ) ≥ m 4 , v 1 ( z m ) ≤ 2 − m , m ≥ 2. \frac{a_1(z_m)}{a_2(z_m)}\geq m^4,\qquad
v_1(z_m)\leq2^{-m},\qquad m\geq2. a 2 ( z m ) a 1 ( z m ) ≥ m 4 , v 1 ( z m ) ≤ 2 − m , m ≥ 2.
Make a group of M m = ⌈ 1 / ( m 2 v 1 ( z m ) ) ⌉ M_m=\lceil1/(m^2v_1(z_m))\rceil M m = ⌈ 1/ ( m 2 v 1 ( z m ))⌉ observations of radius z m z_m z m , each preceded by a gap ⌈ max i τ i ( z m ) ⌉ \lceil\max_i\tau_i(z_m)\rceil ⌈ max i τ i ( z m )⌉ . Concatenating these finite groups gives one deterministic schedule with nonincreasing observation radii tending to zero. Corollary 6.4 tests it under law i i i by ∑ m M m v i ( z m ) \sum_m M_mv_i(z_m) ∑ m M m v i ( z m ) . But
M m v 1 ( z m ) ≤ m − 2 + 2 − m , M m v 2 ( z m ) ≥ m 2 . M_mv_1(z_m)\leq m^{-2}+2^{-m},\qquad
M_mv_2(z_m)\geq m^2. M m v 1 ( z m ) ≤ m − 2 + 2 − m , M m v 2 ( z m ) ≥ m 2 .
With zero radii between observations, this schedule belongs to R ( π 2 ) \mathcal{R}(\pi_2) R ( π 2 ) but not R ( π 1 ) \mathcal{R}(\pi_1) R ( π 1 ) . This proves necessity; applying the equivalence in both directions proves the last assertion.
The support and its minimum alone do not determine this recurrence class. For a concrete example, take the uniform law π 1 \pi_1 π 1 on [ 1 / 2 , 3 / 4 ] [1/2,3/4] [ 1/2 , 3/4 ] and the law π 2 \pi_2 π 2 with density 32 ( s − 1 / 2 ) 32(s-1/2) 32 ( s − 1/2 ) on the same interval. Both are atomless. Direct integration in (14) gives
a 1 ( r ) ≍ r 1 / 2 log ( 1 / r ) , a 2 ( r ) ≍ r 1 / 2 ( log ( 1 / r ) ) 2 . a_1(r)\asymp\frac{r^{1/2}}{\log(1/r)},\qquad
a_2(r)\asymp\frac{r^{1/2}}{(\log(1/r))^2}. a 1 ( r ) ≍ log ( 1/ r ) r 1/2 , a 2 ( r ) ≍ ( log ( 1/ r ) ) 2 r 1/2 .
The corresponding distribution-dependent logarithmic return scales are already present in [6 ] . Here they give opposite recurrence outcomes for one schedule: at times n k = k 3 n_k=k^3 n k = k 3 , k ≥ 3 k\geq3 k ≥ 3 , take b k = c k − 2 ( log k ) − 5 b_k=ck^{-2}(\log k)^{-5} b k = c k − 2 ( log k ) − 5 , with c > 0 c>0 c > 0 small enough that b k ≤ r ∗ b_k\leq r_* b k ≤ r ∗ . The gaps are asymptotic to 3 k 2 3k^2 3 k 2 , whereas τ i ( b k ) ≲ k ( log k ) 5 / 2 + i \tau_i(b_k)\lesssim k(\log k)^{5/2+i} τ i ( b k ) ≲ k ( log k ) 5/2 + i , i = 1 , 2 i=1,2 i = 1 , 2 . The gaps exceed both residence scales eventually. The two series in (22) are respectively comparable to
∑ k ≥ 3 1 k ( log k ) 3 / 2 < ∞ , ∑ k ≥ 3 1 k ( log k ) 1 / 2 = ∞ . \sum_{k\geq3}\frac{1}{k(\log k)^{3/2}}<\infty,\qquad
\sum_{k\geq3}\frac{1}{k(\log k)^{1/2}}=\infty. k ≥ 3 ∑ k ( log k ) 3/2 1 < ∞ , k ≥ 3 ∑ k ( log k ) 1/2 1 = ∞.
Thus this same sequence of targets is hit only finitely often under π 1 \pi_1 π 1 , but infinitely often under π 2 \pi_2 π 2 , in the quenched almost-everywhere sense of Corollary 6.4.
Thinning and block unions
For neutral targets, thinning the observation times may fail to produce counts with vanishing relative variance. The next proposition shows that, in a range of power schedules, every fixed nonnegative weighting with divergent mean fails this criterion, whereas suitable consecutive block unions satisfy it. Weighted Borel–Cantelli bounds were studied in [14 ] , and abstract limitations of subsequence bounds in [13 ] . Here the obstruction comes from long residence near the neutral point.
Proposition 6.6 (Weights and block unions). *Suppose that the iid law π \pi π is supported on [ α , B ] [\alpha,B] [ α , B ] , where 1 / 2 < α < 1 1/2 < \alpha< 1 1/2 < α < 1 , B < ∞ B < \infty B < ∞ , and α \alpha α is its essential minimum. Let P \mathbb{P} P denote the stationary annealed law, with X 0 X_0 X 0 distributed according to μ \mu μ independently of the future parameters, and write E \mathbb{E} E and Var P \operatorname{Var}_{\mathbb{P}} Var P for its expectation and variance. Fix 1 / ( 2 α ) < g ≤ 1 1/(2\alpha) < g \le1 1/ ( 2 α ) < g ≤ 1 , 0 < u ∗ < 1 / 2 0 < u_* < 1/2 0 < u ∗ < 1/2 , and put A n = { X n ≤ min ( u ∗ , n − g ) } A_n = \{X_n \le\min(u_*,n^{-g})\} A n = { X n ≤ min ( u ∗ , n − g )} . For every fixed deterministic sequence w n ∈ [ 0 , ∞ ) w_n \in[0,\infty) w n ∈ [ 0 , ∞ ) , set Z N = ∑ n ≤ N w n 1 A n Z_N = \sum_{n\le N} w_n\mathbf{1}_{A_n} Z N = ∑ n ≤ N w n 1 A n and e N = E Z N e_N = \mathbb{E}Z_N e N = E Z N . If e N → ∞ e_N \to\infty e N → ∞ , then
Var P ( Z N ) e N 2 ⟶ ∞ . \frac{\operatorname{Var}_{\mathbb{P}}(Z_N)}{e_N^2} \longrightarrow\infty. e N 2 Var P ( Z N ) ⟶ ∞. There also exist deterministic integers 0 = m 0 < m 1 < ⋯ 0=m_0<m_1<\cdots 0 = m 0 < m 1 < ⋯ with the following property. The unions B k = ⋃ m k − 1 < n ≤ m k A n B_k=\bigcup_{m_{k-1}<n\le m_k} A_n B k = ⋃ m k − 1 < n ≤ m k A n and their count S K = ∑ k ≤ K 1 B k S_K=\sum_{k\le K}\mathbf{1}_{B_k} S K = ∑ k ≤ K 1 B k satisfy
E S K ⟶ ∞ , Var P ( S K ) ( E S K ) 2 ⟶ 0. \mathbb{E}S_K\longrightarrow\infty,\qquad
\frac{\operatorname{Var}_{\mathbb{P}}(S_K)}{(\mathbb{E}S_K)^2}\longrightarrow0. E S K ⟶ ∞ , ( E S K ) 2 Var P ( S K ) ⟶ 0.
Proof. Write H ( u ) = μ ˉ ( [ 0 , u ] ) H(u)=\bar\mu([0,u]) H ( u ) = μ ˉ ([ 0 , u ]) , β = 1 − α \beta=1-\alpha β = 1 − α and ζ = β / α \zeta=\beta/\alpha ζ = β / α . For every a ∈ ( α , 1 ) a\in(\alpha,1) a ∈ ( α , 1 ) , the fast-band probability is positive, so Proposition 2.1 gives H ( u ) ≤ C a u 1 − a H(u)\le C_a u^{1-a} H ( u ) ≤ C a u 1 − a . We also have H ( u ) ≥ c u 1 − α H(u)\ge c u^{1-\alpha} H ( u ) ≥ c u 1 − α for small u u u . Indeed, stationarity, the lower bound for h h h on Y Y Y , and ϕ s ≥ ϕ α \phi_s\ge\phi_\alpha ϕ s ≥ ϕ α give
H ( u ) = ∫ H ( ϕ s ( u ) ) d π ( s ) + ∫ 1 / 2 ( 1 + u ) / 2 h ( v ) d v ≥ H ( ϕ α ( u ) ) + c u . H(u)=\int H(\phi_s(u))\,d\pi(s)+\int_{1/2}^{(1+u)/2}h(v)\,dv\ge H(\phi_\alpha(u))+cu. H ( u ) = ∫ H ( ϕ s ( u )) d π ( s ) + ∫ 1/2 ( 1 + u ) /2 h ( v ) d v ≥ H ( ϕ α ( u )) + c u .
The inequality x − α − T α ( x ) − α ≤ α 2 α x^{-\alpha}-T_\alpha(x)^{-\alpha}\le\alpha2^\alpha x − α − T α ( x ) − α ≤ α 2 α on the left branch implies ϕ α j ( u ) ≥ ( u − α + α 2 α j ) − 1 / α \phi_\alpha^j(u)\ge(u^{-\alpha}+\alpha2^\alpha j)^{-1/\alpha} ϕ α j ( u ) ≥ ( u − α + α 2 α j ) − 1/ α . Iteration and summation prove the lower bound for H H H .
There is a small d > 0 d>0 d > 0 such that an orbit starting below d N − 1 / α dN^{-1/\alpha} d N − 1/ α remains below 2 d N − 1 / α 2dN^{-1/\alpha} 2 d N − 1/ α for the next N N N steps, for every parameter word. To see this, use
x − α − T s ( x ) − α ≤ α 2 α , s ≥ α , x^{-\alpha}-T_s(x)^{-\alpha}\le\alpha2^\alpha,\qquad s\ge\alpha, x − α − T s ( x ) − α ≤ α 2 α , s ≥ α ,
and choose d d d with d − α − α 2 α ≥ ( 2 d ) − α d^{-\alpha}-\alpha2^\alpha\ge(2d)^{-\alpha} d − α − α 2 α ≥ ( 2 d ) − α . Summing the inequality up to a hypothetical first crossing of 2 d N − 1 / α 2dN^{-1/\alpha} 2 d N − 1/ α rules out that crossing. For large N N N , this bound is smaller than ( 2 N ) − g (2N)^{-g} ( 2 N ) − g . On the dyadic block I b = { 2 b , … , 2 b + 1 − 1 } I_b=\{2^b,\ldots,2^{b+1}-1\} I b = { 2 b , … , 2 b + 1 − 1 } , stationarity therefore gives
sup n ∈ I b P ( A n ) ≤ p b : = C a 2 − b g ( 1 − a ) , P ( ⋂ n ∈ I b A n ) ≥ q b : = c 2 − b ζ . \sup_{n\in I_b}\mathbb{P}(A_n)\le p_b:=C_a2^{-bg(1-a)},\qquad
\mathbb{P}\left(\bigcap_{n\in I_b}A_n\right)\ge q_b:=c2^{-b\zeta}. n ∈ I b sup P ( A n ) ≤ p b := C a 2 − b g ( 1 − a ) , P ( n ∈ I b ⋂ A n ) ≥ q b := c 2 − b ζ .
Choose a > α a>\alpha a > α close enough to α \alpha α that 2 g ( 1 − a ) > ζ 2g(1-a)>\zeta 2 g ( 1 − a ) > ζ . Then ∑ b p b 2 / q b < ∞ \sum_b p_b^2/q_b<\infty ∑ b p b 2 / q b < ∞ . All subsequent sums may omit a fixed initial segment.
Put W b ( N ) = ∑ n ∈ I b , n ≤ N w n W_b(N)=\sum_{n\in I_b,\ n\le N}w_n W b ( N ) = ∑ n ∈ I b , n ≤ N w n . Nonnegativity gives E Z N 2 ≥ ∑ b q b W b ( N ) 2 \mathbb{E}Z_N^2\ge\sum_b q_bW_b(N)^2 E Z N 2 ≥ ∑ b q b W b ( N ) 2 , including a partially completed last block. For every fixed sufficiently large b 0 b_0 b 0 , Cauchy–Schwarz now yields
e N ≤ C b 0 + ( ∑ b ≥ b 0 p b 2 q b ) 1 / 2 ( E Z N 2 ) 1 / 2 , (26) e_N\le C_{b_0}+\left(\sum_{b\ge b_0}\frac{p_b^2}{q_b}\right)^{1/2}(\mathbb{E}Z_N^2)^{1/2}, \tag*{(26)} e N ≤ C b 0 + ( b ≥ b 0 ∑ q b p b 2 ) 1/2 ( E Z N 2 ) 1/2 , (26)
ends_mid=1 where C b 0 C_{b_0} C b 0 is the finite expected contribution of the earlier weights. Divide by ( E Z N 2 ) 1 / 2 ≥ ϵ N (\mathop{\rm E}Z_N^2)^{1/2} \geq\epsilon_N ( E Z N 2 ) 1/2 ≥ ϵ N , let N → ∞ N \to\infty N → ∞ , and then let b 0 → ∞ b_0 \to\infty b 0 → ∞ . Thus ϵ N / ( E Z N 2 ) 1 / 2 → 0 \epsilon_N/(\mathop{\rm E}Z_N^2)^{1/2} \to0 ϵ N / ( E Z N 2 ) 1/2 → 0 , which proves the variance assertion.
Since ∑ n min ( u ∗ , n − g ) = ∞ \sum_n \min(u_*,n^{-g})=\infty ∑ n min ( u ∗ , n − g ) = ∞ , Corollary 6.1 gives P ( A n infinitely often ) = 1 \mathop{\rm P}(A_n\text{ infinitely often})=1 P ( A n infinitely often ) = 1 . Here we use absolute continuity of μ ˉ \bar{\mu} μ ˉ and Fubini’s theorem to pass to the stationary annealed law. The necessary direction of [39 Theorem 1.3] supplies the deterministic block unions and their stated variance limit. □ \square □
Taking w n w_n w n to be the indicator of a deterministic set of times shows that no subsequence with divergent expected count satisfies the vanishing-relative-variance criterion. In fact, every fixed nonnegative weighting with divergent mean makes the lower bound in [14 Theorem 1] asymptotically zero: ϵ N 2 / E Z N 2 → 0 \epsilon_N^2/\mathop{\rm E}Z_N^2 \to0 ϵ N 2 / E Z N 2 → 0 . This assertion concerns the original hit indicators. The subevent criterion in [11 ] also uses consecutive block unions in its proof, before selecting smaller subevents. That selection, as well as signed, path-dependent or horizon-dependent weighting, is outside the proposition.
For example, take π = θ δ 3 / 4 + ( 1 − θ ) δ 7 / 8 \pi=\theta\delta_{3/4}+(1-\theta)\delta_{7/8} π = θ δ 3/4 + ( 1 − θ ) δ 7/8 , 0 < θ < 1 0<\theta<1 0 < θ < 1 , and g = 3 / 4 g=3/4 g = 3/4 . Theorem 1.2 gives C N / M N → 1 C_N/M_N\to1 C N / M N → 1 almost surely, while the proposition gives Var P ( C N ) / M N 2 → ∞ \operatorname{Var}_{\mathop{\rm P}}(C_N)/M_N^2\to\infty Var P ( C N ) / M N 2 → ∞ . Rare long residences can therefore dominate second moments even when the strong law holds. Block unions recover a vanishing-relative-variance criterion for these recurrent events, although this conclusion supplies no strong law for the original visit count.
Shrinking entrances under sequential forcing
For entrance targets one can dispense with independence and stationarity of the maps. Throughout this section fix 0 < α ≤ β < 1 0<\alpha\le\beta<1 0 < α ≤ β < 1 , a sequence s n ∈ [ α , β ] s_n\in[\alpha,\beta] s n ∈ [ α , β ] , and X n = T s n − 1 ∘ ⋯ ∘ T s 0 x X_n=T_{s_{n-1}}\circ\cdots\circ T_{s_0}x X n = T s n − 1 ∘ ⋯ ∘ T s 0 x . For a word starting at time n n n , write T n , h = T s n + h − 1 ∘ ⋯ ∘ T s n T_{n,h}=T_{s_{n+h-1}}\circ\cdots\circ T_{s_n} T n , h = T s n + h − 1 ∘ ⋯ ∘ T s n and T n , 0 = id T_{n,0}=\operatorname{id} T n , 0 = id . For A > max { 2 β ( β + 2 ) , 3 / ( 1 − β ) } A>\max\{2^\beta(\beta+2),3/(1-\beta)\} A > max { 2 β ( β + 2 ) , 3/ ( 1 − β )} , let C β , A \mathcal C_{\beta,A} C β , A consist of continuous probability densities on ( 0 , 1 ] (0,1] ( 0 , 1 ] which are nonnegative and decreasing, for which x β + 1 h ( x ) x^{\beta+1}h(x) x β + 1 h ( x ) is increasing, and which satisfy h ( x ) ≤ A x − β h(x)\le Ax^{-\beta} h ( x ) ≤ A x − β . Set μ n = ( X n ) ∗ μ 0 \mu_n=(X_n)_*\mu_0 μ n = ( X n ) ∗ μ 0 , where μ 0 = h 0 d x \mu_0=h_0\,dx μ 0 = h 0 d x and h 0 ∈ C β , A h_0\in\mathcal C_{\beta,A} h 0 ∈ C β , A . The first lower bound on A A A is the cone condition of [31 (1.2)] , following [33 ] ; the second is used for invariance below. Statements of almost-sure convergence in this section refer to x ∼ μ 0 x\sim\mu_0 x ∼ μ 0 .
Theorem 7.1 (Sequential entrance strong law). For every sequence 0 ≤ ϵ n ≤ 1 0\le\epsilon_n\le1 0 ≤ ϵ n ≤ 1 such that ϵ n → 0 \epsilon_n\to0 ϵ n → 0 and ∑ n ϵ n = ∞ \sum_n\epsilon_n=\infty ∑ n ϵ n = ∞ , put
B n = [ 1 / 2 , ( 1 + ϵ n ) / 2 ] , Q N = ∑ n = 1 N μ n ( B n ) . B_n=[1/2,(1+\epsilon_n)/2],\qquad Q_N=\sum_{n=1}^{N}\mu_n(B_n). B n = [ 1/2 , ( 1 + ϵ n ) /2 ] , Q N = n = 1 ∑ N μ n ( B n ) . Then
∑ n = 1 N 1 B n ( X n ) Q N → 1 μ 0 -almost surely . \frac{\sum_{n=1}^{N}\mathbf{1}_{B_n}(X_n)}{Q_N}\to1\qquad\mu_0\text{-almost surely}. Q N ∑ n = 1 N 1 B n ( X n ) → 1 μ 0 -almost surely . No monotonicity, rate of shrinkage or frequency assumption on the map sequence is required. The assertion concerns entrances through the expanding branch, not all visits to the neutral interval.
Regularity and target-mass mixing
We first establish the regularity and coupling estimates used in the proof. The strong law will follow for unions of complete return atoms; inner and outer full-atom approximations then sandwich the actual interval.
Write ϕ s \phi_s ϕ s for the inverse of the left branch and set g = ϕ s ( x ) g=\phi_s(x) g = ϕ s ( x ) , t = ( 2 g ) s t=(2g)^s t = ( 2 g ) s , v = ( 1 + x ) / 2 v=(1+x)/2 v = ( 1 + x ) /2 . Then
L s h ( x ) = h ( g ) 1 + ( 1 + s ) t + h ( v ) 2 . \mathcal L_s h(x)=\frac{h(g)}{1+(1+s)t}+\frac{h(v)}{2}. L s h ( x ) = 1 + ( 1 + s ) t h ( g ) + 2 h ( v ) .
Both summands decrease. For weighted monotonicity the first summand becomes
[ g β + 1 h ( g ) ] ( 1 + t ) β + 1 1 + ( 1 + s ) t . [g^{\beta+1}h(g)]\frac{(1+t)^{\beta+1}}{1+(1+s)t}. [ g β + 1 h ( g )] 1 + ( 1 + s ) t ( 1 + t ) β + 1 .
The logarithmic derivative of the second factor has numerator ( β − s ) + β ( 1 + s ) t ≥ 0 (\beta-s)+\beta(1+s)t\ge0 ( β − s ) + β ( 1 + s ) t ≥ 0 . The weighted right summand is v β + 1 h ( v ) ( x / v ) β + 1 / 2 v^{\beta+1}h(v)(x/v)^{\beta+1/2} v β + 1 h ( v ) ( x / v ) β + 1/2 , also increasing. Since ∫ h = 1 \int h=1 ∫ h = 1 , decreasingness gives h ( v ) / 2 ≤ 1 / ( 1 + x ) h(v)/2\le1/(1+x) h ( v ) /2 ≤ 1/ ( 1 + x ) . Moreover, t ≤ 1 t\le1 t ≤ 1 , x ≤ 2 g x\le2g x ≤ 2 g and s ≤ β s\le\beta s ≤ β imply t ≥ x β t\ge x^\beta t ≥ x β , while
1 − ( 1 + t ) β 1 + ( 1 + s ) t ≥ ( 1 − β ) t 3 . 1-\frac{(1+t)^\beta}{1+(1+s)t}\ge\frac{(1-\beta)t}{3}. 1 − 1 + ( 1 + s ) t ( 1 + t ) β ≥ 3 ( 1 − β ) t .
Consequently the gap between A x − β Ax^{-\beta} A x − β and the left summand is at least A ( 1 − β ) / 3 > 1 A(1-\beta)/3>1 A ( 1 − β ) /3 > 1 , which absorbs the right summand. The cone is invariant.
Choose x 0 > 0 x_0>0 x 0 > 0 with A x 0 1 − β / ( 1 − β ) ≤ 1 / 2 Ax_0^{1-\beta}/(1-\beta)\le1/2 A x 0 1 − β / ( 1 − β ) ≤ 1/2 . Weighted monotonicity gives h ( x ) ≤ h ( 1 ) x 0 − ( β + 1 ) h(x)\le h(1)x_0^{-(\beta+1)} h ( x ) ≤ h ( 1 ) x 0 − ( β + 1 ) for x ≥ x 0 x\ge x_0 x ≥ x 0 . The mass of [ x 0 , 1 ] [x_0,1] [ x 0 , 1 ] is at least 1 / 2 1/2 1/2 , so h ( 1 ) h(1) h ( 1 ) has a uniform positive lower bound. Thus every evolved density h n h_n h n satisfies
c ≤ h n ∣ Y ≤ C , ∣ log h n ( x ) − log h n ( y ) ∣ ≤ 2 ( β + 1 ) ∣ x − y ∣ ( x , y ∈ Y ) . c\le h_n|_Y\le C,\qquad|\log h_n(x)-\log h_n(y)|\le2(\beta+1)|x-y|\quad(x,y\in Y). c ≤ h n ∣ Y ≤ C , ∣ log h n ( x ) − log h n ( y ) ∣ ≤ 2 ( β + 1 ) ∣ x − y ∣ ( x , y ∈ Y ) .
We use the uniform return geometry and coupling estimates of [31 ] . Fix a sufficiently large log-Lipschitz constant K K K on Y Y Y . Restricting a regular base density to a full first-return atom and pushing it to Y Y Y preserves this class after normalization. A regular base probability evolved for any number of physical steps has either zero restriction to Y Y Y , or a restriction whose normalized density is in the same class. This follows as well by splitting into positive components at the last completed return. Countable positive mixtures preserve the logarithmic Lipschitz bound; no regularity assertion is needed before a component returns.
For completeness, the reference cone uses the following regularization bound. On a first-entry atom I = ( x − , x + ] I=(x_-,x_+] I = ( x − , x + ] outside Y Y Y , let G : Y → I G:Y\to I G : Y → I be the inverse entry branch. Full-branch distortion gives sup G ′ ≤ C ∣ I ∣ \sup G'\le C|I| sup G ′ ≤ C ∣ I ∣ and geometry gives ∣ I ∣ ≤ x − |I|\le x_- ∣ I ∣ ≤ x − . Hence
∣ log h ( G ( y ) ) − log h ( G ( y ′ ) ) ∣ ≤ ( β + 1 ) ∣ G ( y ) − G ( y ′ ) ∣ x − ≤ C ∣ y − y ′ ∣ . |\log h(G(y))-\log h(G(y'))|\le(\beta+1)\frac{|G(y)-G(y')|}{x_-}\le C|y-y'|. ∣ log h ( G ( y )) − log h ( G ( y ′ )) ∣ ≤ ( β + 1 ) x − ∣ G ( y ) − G ( y ′ ) ∣ ≤ C ∣ y − y ′ ∣.
Together with inverse-Jacobian distortion, this proves uniform regularity of the normalized entry pushforward.
Put b = 1 / β > 1 b=1/\beta>1 b = 1/ β > 1 . The worst-word inverse endpoints are O ( n − b ) O(n^{-b}) O ( n − b ) : for an inverse step q ′ = ϕ s ( q ) q'=\phi_s(q) q ′ = ϕ s ( q ) , ( q ′ ) − β − q − β ≥ c > 0 (q')^{-\beta}-q^{-\beta}\ge c>0 ( q ′ ) − β − q − β ≥ c > 0 , uniformly on the compact parameter range. Thus a regular base probability has return tail O ( n − b ) O(n^{-b}) O ( n − b ) . Integration of the cone envelope gives the initial entrance tail O ( n − ( b − 1 ) ) O(n^{-(b-1)}) O ( n − ( b − 1 ) ) . Both laws have the common latter tail envelope required by the coupling theorem, which yields
∥ ( T s k + h − 1 ∘ ⋯ ∘ T s k ) ∗ ν − μ k + h ∥ T V ≤ C h − ( b − 1 ) \|(T_{s_{k+h-1}}\circ\cdots\circ T_{s_k})_*\nu-\mu_{k+h}\|_{\mathrm{TV}}\le Ch^{-(b-1)} ∥ ( T s k + h − 1 ∘ ⋯ ∘ T s k ) ∗ ν − μ k + h ∥ TV ≤ C h − ( b − 1 )
for every regular base probability ν \nu ν at time k k k . The densities of both restrictions to Y Y Y are uniformly bounded and Lipschitz. For such functions the elementary interpolation inequality ∥ f − g ∥ ∞ ≤ C ∥ f − g ∥ 1 1 / 2 \|f-g\|_\infty\le C\|f-g\|_1^{1/2} ∥ f − g ∥ ∞ ≤ C ∥ f − g ∥ 1 1/2 follows by integrating over an interval of length comparable to the maximum discrepancy; increasing C C C covers large discrepancies. Therefore, for every measurable J ⊂ Y J\subset Y J ⊂ Y ,
∣ ν ( ( T s k + h − 1 ∘ ⋯ ∘ T s k ) − 1 J ) − μ k + h ( J ) ∣ ≤ C Leb ( J ) h − ρ , ρ = ( b − 1 ) / 2 > 0. (27) \left|\nu\left((T_{s_{k+h-1}}\circ\cdots\circ T_{s_k})^{-1}J\right)-\mu_{k+h}(J)\right|\le C\operatorname{Leb}(J)h^{-\rho},\qquad\rho=(b-1)/2>0. \tag*{(27)} ν ( ( T s k + h − 1 ∘ ⋯ ∘ T s k ) − 1 J ) − μ k + h ( J ) ≤ C Leb ( J ) h − ρ , ρ = ( b − 1 ) /2 > 0. (27)
This estimate is uniform in the starting time and the map sequence.
Lemma 7.2 (Uniform cone and base coupling). For a parameter sequence in the fixed interval [ α , β ] ⊂ ( 0 , 1 ) [\alpha,\beta]\subset(0,1) [ α , β ] ⊂ ( 0 , 1 ) and fixed cone and regular-base constants, uniformly in n , h , n,h, n , h ,
∥ ( T n , h ) ∗ η − ( T n , h ) ∗ η ′ ∥ T V ≤ C ( 1 + h ) − ( b − 1 ) \|(T_{n,h})_*\eta-(T_{n,h})_*\eta'\|_{\mathrm{TV}}\le C(1+h)^{-(b-1)} ∥ ( T n , h ) ∗ η − ( T n , h ) ∗ η ′ ∥ TV ≤ C ( 1 + h ) − ( b − 1 ) whenever both probabilities are cone inputs, or one is a regular base probability and the other a cone input. In the latter case their base target probabilities satisfy (27) .
Proof. The regular base return tail is O ( n − b ) O(n^{-b}) O ( n − b ) and the initial cone entry tail is O ( n − ( b − 1 ) ) O(n^{-(b-1)}) O ( n − ( b − 1 ) ) , as established above. Applying the polynomial coupling estimate of [31 ] to the common O ( n − ( b − 1 ) ) O(n^{-(b-1)}) O ( n − ( b − 1 ) ) entry-tail envelope gives both comparisons; two cone inputs each obey this envelope. The clause of [31 ] used here requires only a positive entry-tail exponent not exceeding the return-tail exponent; the entry tail need not be summable. The interpolation argument above gives the base target estimate. □ \square □
Full-return covariance and cumulative-mass variance
Proof of Theorem 7.1. We begin with a complete-atom schedule and then remove the alignment condition.
Let A i ⊂ Y A_i \subset Y A i ⊂ Y be a union of full first-return atoms at time i i i , with p i = μ i ( A i ) p_i=\mu_i(A_i) p i = μ i ( A i ) . Conditional on X i ∈ A i X_i\in A_i X i ∈ A i , split into the normalized atom probabilities, with weights μ i ( a ) / p i \mu_i(a)/p_i μ i ( a ) / p i . Write τ i ( a ) \tau_i(a) τ i ( a ) for the return time and h = j − i h=j-i h = j − i . Atoms with τ i ( a ) ≤ h / 2 \tau_i(a)\le h/2 τ i ( a ) ≤ h /2 have returned and evolved for at least h / 2 h/2 h /2 further steps, so (27) bounds the discrepancy of their next-hit probability from p j p_j p j by C p j h − ρ Cp_jh^{-\rho} C p j h − ρ . For the other atoms, there is no base mass before return. After return, positive mixtures preserve regularity of the base densities, which bounds the next-hit probability by C p j Cp_j C p j . Thus, including zero-probability targets by continuity,
∣ Cov μ 0 ( 1 A i ( X i ) , 1 A j ( X j ) ) ∣ ≤ C p i p j h − ρ + C p j μ i ( A i ∩ { τ i > h / 2 } ) ≤ C p i p j h − ρ + C p j min { p i , h − b } . (28) \left|\operatorname{Cov}_{\mu_0}\left(\mathbf{1}_{A_i}(X_i),\mathbf{1}_{A_j}(X_j)\right)\right|
\le Cp_ip_jh^{-\rho}+Cp_j\mu_i\left(A_i\cap\{\tau_i>h/2\}\right)
\le Cp_ip_jh^{-\rho}+Cp_j\min\{p_i,h^{-b}\}. \tag*{(28)} Cov μ 0 ( 1 A i ( X i ) , 1 A j ( X j ) ) ≤ C p i p j h − ρ + C p j μ i ( A i ∩ { τ i > h /2 } ) ≤ C p i p j h − ρ + C p j min { p i , h − b } . (28)
No upper bound on the return times of the selected atoms is needed.
Set M N = ∑ i ≤ N p i M_N=\sum_{i\le N}p_i M N = ∑ i ≤ N p i . Summing the second term in the later-time index gives
∑ j ≤ N p j ∑ i < j min { p i , ( j − i ) − b } ≤ M N ∑ h ≥ 1 h − b ≤ C M N . \sum_{j\le N}p_j\sum_{i<j}\min\{p_i,(j-i)^{-b}\}
\le M_N\sum_{h\ge1}h^{-b}
\le CM_N. j ≤ N ∑ p j i < j ∑ min { p i , ( j − i ) − b } ≤ M N h ≥ 1 ∑ h − b ≤ C M N .
For the first term apply the weighted lag lemma with a h = p i + h a_h=p_{i+h} a h = p i + h , then sum with weight p i p_i p i . The diagonal terms are at most M N M_N M N , so (28) gives
Var μ 0 ∑ i ≤ N 1 A i ( X i ) ≤ C M N [ 1 + G ρ ( M N ) ] ≤ C M N 2 − δ , δ = min { ρ , 1 / 2 } > 0 , M N ≥ 1. \operatorname{Var}_{\mu_0}\sum_{i\le N}\mathbf{1}_{A_i}(X_i)
\le CM_N[1+G_\rho(M_N)]
\le CM_N^{2-\delta},
\qquad\delta=\min\{\rho,1/2\}>0,\qquad M_N\ge1. Var μ 0 i ≤ N ∑ 1 A i ( X i ) ≤ C M N [ 1 + G ρ ( M N )] ≤ C M N 2 − δ , δ = min { ρ , 1/2 } > 0 , M N ≥ 1.
The mass-level interpolation lemma now proves the strong law for every full-atom schedule with divergent M N M_N M N . The variance criterion is also given in [19 ] ; the dynamical content here is the full-return pair estimate and the boundary approximation below.
Removing atom alignment
For any finite inverse word F F F , including the empty word, and v ∈ [ a ∗ , 1 / 2 ] v\in[a_\ast,1/2] v ∈ [ a ∗ , 1/2 ] , where a ∗ = ϕ α ( 1 / 2 ) > 0 a_\ast=\phi_\alpha(1/2)>0 a ∗ = ϕ α ( 1/2 ) > 0 , one has
F ′ ( v ) ≤ C F ( v ) 1 + α , F ( v ) F ( w ) ≤ v w ( 0 < w ≤ v ≤ 1 / 2 ) . (29) F'(v)\le CF(v)^{1+\alpha},
\qquad
\frac{F(v)}{F(w)}\le\frac{v}{w}
\qquad(0<w\le v\le1/2). \tag*{(29)} F ′ ( v ) ≤ C F ( v ) 1 + α , F ( w ) F ( v ) ≤ w v ( 0 < w ≤ v ≤ 1/2 ) . (29)
To prove the derivative bound, enumerate inverses in their application order, q 0 = v q_0=v q 0 = v , q j = ϕ u j ( q j − 1 ) q_j=\phi_{u_j}(q_{j-1}) q j = ϕ u j ( q j − 1 ) , and t j = ( 2 q j ) u j t_j=(2q_j)^{u_j} t j = ( 2 q j ) u j . Taylor’s formula on the compact parameter range gives
log ( 1 + ( 1 + u ) t ) ≥ ( 1 + α ) log ( 1 + t ) − C t 2 . \log(1+(1+u)t)\ge(1+\alpha)\log(1+t)-Ct^2. log ( 1 + ( 1 + u ) t ) ≥ ( 1 + α ) log ( 1 + t ) − C t 2 .
Since q j − 1 = q j ( 1 + t j ) ≤ 2 q j q_{j-1}=q_j(1+t_j)\le2q_j q j − 1 = q j ( 1 + t j ) ≤ 2 q j ,
t j 2 ≤ 2 β q j α − 1 ( q j − 1 − q j ) ≤ 2 β + 1 − α ∫ q j q j − 1 z α − 1 d z . t_j^2\le2^\beta q_j^{\alpha-1}(q_{j-1}-q_j)
\le2^{\beta+1-\alpha}\int_{q_j}^{q_{j-1}}z^{\alpha-1}\,dz. t j 2 ≤ 2 β q j α − 1 ( q j − 1 − q j ) ≤ 2 β + 1 − α ∫ q j q j − 1 z α − 1 d z .
The sum is uniformly bounded. Multiplying the inverse derivatives and telescoping ∑ j log ( 1 + t j ) = log ( v / q m ) \sum_j \log(1+t_j)=\log(v/q_m) ∑ j log ( 1 + t j ) = log ( v / q m ) proves the first inequality in (29) . The second follows because inverse words are increasing, concave and vanish at zero.
The boundary of B n B_n B n , for small positive ε n \varepsilon_n ε n , cuts at most one return atom. Its image through the right branch is [ F ( a s ) , F ( 1 / 2 ) ] [F(a_s),F(1/2)] [ F ( a s ) , F ( 1/2 )] , where a s = ϕ s ( 1 / 2 ) ≥ a ∗ a_s=\phi_s(1/2)\ge a_* a s = ϕ s ( 1/2 ) ≥ a ∗ and F ( a s ) ≤ ε n ≤ F ( 1 / 2 ) F(a_s)\le\varepsilon_n\le F(1/2) F ( a s ) ≤ ε n ≤ F ( 1/2 ) . Concavity implies F ( 1 / 2 ) ≤ C ε n F(1/2)\le C\varepsilon_n F ( 1/2 ) ≤ C ε n , and the derivative bound gives
F ( 1 / 2 ) − F ( a s ) ≤ C ε n 1 + α . F(1/2)-F(a_s)\le C\varepsilon_n^{1+\alpha}. F ( 1/2 ) − F ( a s ) ≤ C ε n 1 + α .
The base width is half this quantity. Let A n − A_n^- A n − be the union of full atoms contained in B n B_n B n , and A n + A_n^+ A n + the union of full atoms whose interiors meet B n B_n B n . Uniform base-density bounds yield
A n − ⊂ B n ⊂ A n + up to null endpoints , μ n ( A n + ∖ A n − ) ≤ C ε n 1 + α . A_n^-\subset B_n\subset A_n^+ \quad\text{up to null endpoints},\qquad\mu_n(A_n^+\setminus A_n^-)\le C\varepsilon_n^{1+\alpha}. A n − ⊂ B n ⊂ A n + up to null endpoints , μ n ( A n + ∖ A n − ) ≤ C ε n 1 + α .
For ε n = 0 \varepsilon_n=0 ε n = 0 both unions are empty. Since c ε n ≤ μ n ( B n ) ≤ C ε n c\varepsilon_n\le\mu_n(B_n)\le C\varepsilon_n c ε n ≤ μ n ( B n ) ≤ C ε n , the relative error tends to zero along positive targets. Its cumulative version gives M N ± / Q N → 1 M_N^\pm/Q_N\to1 M N ± / Q N → 1 , where M N ± = ∑ n ≤ N μ n ( A n ± ) M_N^\pm=\sum_{n\le N}\mu_n(A_n^\pm) M N ± = ∑ n ≤ N μ n ( A n ± ) ; both sums diverge. Apply the full-atom strong law to the two schedules and sandwich the actual count between them. This proves the theorem.
Neutral targets: infinite visits without a strong count law
The distinction between entrance counts and neutral visits is necessary even for nested targets with divergent total length.
Theorem 7.3 (Neutral strong-law obstruction). For each 0 < α ≤ β < 1 0<\alpha\le\beta<1 0 < α ≤ β < 1 and the cone constant A A A fixed above, there is a deterministic nonincreasing sequence ε n > 0 \varepsilon_n>0 ε n > 0 , depending only on these constants, such that ε n → 0 \varepsilon_n\to0 ε n → 0 and ∑ n ε n = ∞ \sum_n\varepsilon_n=\infty ∑ n ε n = ∞ . For every word s n ∈ [ α , β ] s_n\in[\alpha,\beta] s n ∈ [ α , β ] and every h 0 ∈ C β , A h_0\in\mathcal{C}_{\beta,A} h 0 ∈ C β , A , put
C N = ∑ n = 1 N 1 [ 0 , ε n ] ( X n ) , E N = ∑ n = 1 N μ n ( [ 0 , ε n ] ) . C_N=\sum_{n=1}^{N}\mathbf{1}_{[0,\varepsilon_n]}(X_n),\qquad E_N=\sum_{n=1}^{N}\mu_n([0,\varepsilon_n]). C N = n = 1 ∑ N 1 [ 0 , ε n ] ( X n ) , E N = n = 1 ∑ N μ n ([ 0 , ε n ]) . Then E N → ∞ E_N\to\infty E N → ∞ and, μ 0 \mu_0 μ 0 -almost surely,
C N ⟶ ∞ , lim inf N → ∞ C N E N = 0. C_N\longrightarrow\infty,\qquad\liminf_{N\to\infty}\frac{C_N}{E_N}=0. C N ⟶ ∞ , N → ∞ lim inf E N C N = 0. The null set may depend on the word and initial density.
Proof. Write H n ( u ) = μ n ( [ 0 , u ] ) H_n(u)=\mu_n([0,u]) H n ( u ) = μ n ([ 0 , u ]) . Cone invariance and the uniform base bounds give constants c Y , C Y > 0 c_Y,C_Y>0 c Y , C Y > 0 with
c Y ≤ h n ∣ Y ≤ C Y , H n ( u ) ≤ A 1 − β u 1 − β . c_Y\le h_n|_Y\le C_Y,\qquad H_n(u)\le\frac{A}{1-\beta}u^{1-\beta}. c Y ≤ h n ∣ Y ≤ C Y , H n ( u ) ≤ 1 − β A u 1 − β .
The two inverse branches give the exact recursion
H n + 1 ( u ) = H n ( ϕ s n ( u ) ) + ∫ 1 / 2 ( 1 + u ) / 2 h n ( v ) d v . (30) H_{n+1}(u)=H_n(\phi_{s_n}(u))+\int_{1/2}^{(1+u)/2}h_n(v)\,\mathrm{d}v. \tag*{(30)} H n + 1 ( u ) = H n ( ϕ s n ( u )) + ∫ 1/2 ( 1 + u ) /2 h n ( v ) d v . (30)
For v = ϕ s ( u ) v=\phi_s(u) v = ϕ s ( u ) , s ≥ α s\ge\alpha s ≥ α , and u ≤ 1 / 2 u\le1/2 u ≤ 1/2 ,
u − v = v ( 2 v ) s ≤ 2 α u 1 + α . u-v=v(2v)^s\le2^\alpha u^{1+\alpha}. u − v = v ( 2 v ) s ≤ 2 α u 1 + α .
Set c 0 = ( 4 2 α ) − 1 c_0=(4\,2^\alpha)^{-1} c 0 = ( 4 2 α ) − 1 and m ( u ) = ⌊ c 0 u − α ⌋ m(u)=\lfloor c_0u^{-\alpha}\rfloor m ( u ) = ⌊ c 0 u − α ⌋ . Starting at u u u , the first m ( u ) m(u) m ( u ) coordinates of any backward inverse word remain at least u / 2 u/2 u /2 : their total decrease is at most m ( u ) 2 α u 1 + α ≤ u / 4 m(u)2^\alpha u^{1+\alpha}\le u/4 m ( u ) 2 α u 1 + α ≤ u /4 . Unrolling (28) for m ( u ) m(u) m ( u ) steps and discarding the oldest nonnegative CDF therefore yields, for sufficiently small u u u ,
H n ( u ) ≥ c Y m ( u ) u 4 ≥ c 1 u 1 − α , n ≥ m ( u ) , c 1 = c Y c 0 / 8. (31) H_n(u)\ge\frac{c_Ym(u)u}{4}\ge c_1u^{1-\alpha},\qquad n\ge m(u),\qquad c_1=c_Yc_0/8. \tag*{(31)} H n ( u ) ≥ 4 c Y m ( u ) u ≥ c 1 u 1 − α , n ≥ m ( u ) , c 1 = c Y c 0 /8. (31)
This finite-time bound is uniform in the word and initial cone density. Consider a block ( a , a + L ] (a,a+L] ( a , a + L ] with constant neutral radius u u u , and put B u = [ 1 / 2 , ( 1 + u ) / 2 ] B_u=[1/2,(1+u)/2] B u = [ 1/2 , ( 1 + u ) /2 ] . Since the left branch increases the coordinate, a neutral visit in the block requires either X a ∈ [ 0 , u ] X_a\in[0,u] X a ∈ [ 0 , u ] or X j ∈ B u X_j\in B_u X j ∈ B u for some a ≤ j < a + L a\le j<a+L a ≤ j < a + L , up to null endpoints. A union bound gives
μ 0 ( the block contains a neutral visit ) ≤ H a ( u ) + ∑ j = a a + L − 1 μ j ( B u ) ≤ C u 1 − β + C L u . (32) \mu_0(\text{the block contains a neutral visit})\le H_a(u)+\sum_{j=a}^{a+L-1}\mu_j(B_u)\le Cu^{1-\beta}+CLu. \tag*{(32)} μ 0 ( the block contains a neutral visit ) ≤ H a ( u ) + j = a ∑ a + L − 1 μ j ( B u ) ≤ C u 1 − β + C Lu . (32)
Set N 0 = 0 N_0=0 N 0 = 0 . After fixing the first k − 1 k-1 k − 1 blocks, choose u k > 0 u_k>0 u k > 0 sufficiently small that
u k ≤ min { 2 − k , 1 / ( 2 k ) , u ∗ } , L k = ⌊ 1 / ( k u k ) ⌋ ≥ 2 m ( u k ) , c 1 4 k u k − α ≥ k ( N k − 1 + 1 ) , u_k\le\min\{2^{-k},1/(2k),u_*\},\qquad L_k=\lfloor1/(ku_k)\rfloor\ge2m(u_k),\qquad\frac{c_1}{4k}u_k^{-\alpha}\ge k(N_{k-1}+1), u k ≤ min { 2 − k , 1/ ( 2 k ) , u ∗ } , L k = ⌊ 1/ ( k u k )⌋ ≥ 2 m ( u k ) , 4 k c 1 u k − α ≥ k ( N k − 1 + 1 ) ,
and u k ≤ u k − 1 / 2 u_k\le u_{k-1}/2 u k ≤ u k − 1 /2 for k > 1 k>1 k > 1 . Here u ∗ u_* u ∗ is a uniform threshold for (31) . Such choices are possible because α < 1 \alpha<1 α < 1 , so L k / m ( u k ) → ∞ L_k/m(u_k)\to\infty L k / m ( u k ) → ∞ and u k − α → ∞ u_k^{-\alpha}\to\infty u k − α → ∞ as u k → 0 u_k\to0 u k → 0 , with k , N k − 1 k,N_{k-1} k , N k − 1 fixed. Put N k = N k − 1 + L k N_k=N_{k-1}+L_k N k = N k − 1 + L k and ε n = u k \varepsilon_n=u_k ε n = u k for N k − 1 < n ≤ N k N_{k-1}<n\le N_k N k − 1 < n ≤ N k . The resulting schedule is deterministic and nonincreasing, tends to zero, and satisfies ∑ n ε n = ∑ k L k u k ≥ ∑ k 1 / ( 2 k ) = ∞ \sum_n\varepsilon_n=\sum_kL_ku_k\ge\sum_k1/(2k)=\infty ∑ n ε n = ∑ k L k u k ≥ ∑ k 1/ ( 2 k ) = ∞ .
At least the last L k / 2 L_k/2 L k /2 times in block k k k exceed m ( u k ) m(u_k) m ( u k ) . Hence (31) implies
E N k ≥ c 1 L k 2 u k 1 − α ≥ c 1 4 k u k − α ≥ k ( N k − 1 + 1 ) . E_{N_k}\ge\frac{c_1L_k}{2}u_k^{1-\alpha}\ge\frac{c_1}{4k}u_k^{-\alpha}\ge k(N_{k-1}+1). E N k ≥ 2 c 1 L k u k 1 − α ≥ 4 k c 1 u k − α ≥ k ( N k − 1 + 1 ) .
Thus E N → ∞ E_N\to\infty E N → ∞ . If block k k k is empty, then C N k = C N k − 1 ≤ N k − 1 C_{N_k}=C_{N_{k-1}}\le N_{k-1} C N k = C N k − 1 ≤ N k − 1 , so C N k / E N k ≤ 1 / k C_{N_k}/E_{N_k}\le1/k C N k / E N k ≤ 1/ k . By (32) , the events G k = { C N k / E N k ≤ 1 / k } G_k=\{C_{N_k}/E_{N_k}\le1/k\} G k = { C N k / E N k ≤ 1/ k } satisfy μ 0 ( G k ) ≥ 1 − C u k 1 − β − C / k → 1 \mu_0(G_k)\ge1-Cu_k^{1-\beta}-C/k\to1 μ 0 ( G k ) ≥ 1 − C u k 1 − β − C / k → 1 . For each K K K , μ 0 ( ⋃ k ≥ K G k ) = 1 \mu_0(\bigcup_{k\ge K}G_k)=1 μ 0 ( ⋃ k ≥ K G k ) = 1 ; continuity from above gives μ 0 ( lim sup k G k ) = 1 \mu_0(\limsup_kG_k)=1 μ 0 ( lim sup k G k ) = 1 . This proves the lower-limit assertion.
Finally apply Theorem 7.1 to the shifted entrance radii ε n + 1 \varepsilon_{n+1} ε n + 1 . There are almost surely infinitely many n n n with X n ∈ B ε n + 1 X_n\in B_{\varepsilon_{n+1}} X n ∈ B ε n + 1 ; the common right branch sends each such hit into [ 0 , ε n + 1 ] [0,\varepsilon_{n+1}] [ 0 , ε n + 1 ] at time n + 1 n+1 n + 1 . Thus C N → ∞ C_N\to\infty C N → ∞ .
The lower-limit obstruction uses only injection and cone bounds; the entrance strong law is needed only to ensure infinitely many visits. Long neutral residence makes the expected count large even though a block with small total entrance mass is usually empty. Positive strong laws for neutral schedules consequently require additional conditions on the targets.
Neutral targets: strong laws and count oscillations
Throughout this section, π \pi π satisfies the standing assumption (RV) of § 1 . Propositions 2.1 and 3.1 apply with fast band a 0 ∈ ( α , 1 ) a_0\in(\alpha,1) a 0 ∈ ( α , 1 ) . Throughout this section r = 1 / α r=1/\alpha r = 1/ α is the exponent of the minimum parameter; it replaces the fast-band exponent 1 / a 1/a 1/ a of § 2 . Lemma 8.1 first identifies the target mass and compares its two cumulative means. We then estimate complete excursion rewards, including conditional bounds given the terminal state of an induced return block. These estimates give the strong law when the integral converges and the required long rewards when it diverges. The critical lower envelope uses a matching conditional deviation rate, followed by a comparison of the induced and physical clocks. The final subsection uses the same reward profiles to prove the occupation-process limits directly; the stationary L 1 L^1 L 1 criterion follows from those limits. Comparison with smooth schedules removes the monotonicity assumption without changing any of these thresholds.
Put r = 1 / α r=1/\alpha r = 1/ α , l u = log ( 1 / u ) l_u=\log(1/u) l u = log ( 1/ u ) , a u = u − α b ( l u ) a_u=u^{-\alpha}b(l_u) a u = u − α b ( l u ) , and w ( u ) = u a u w(u)=ua_u w ( u ) = u a u . Extend b b b to be bounded above and away from zero on finite argument intervals when needed. The constants used in the inverse profiles are
A = α κ 0 + 1 2 α C 0 Γ ( κ 0 + 1 ) , D ∗ = [ α 2 α C 0 Γ ( κ 0 + 1 ) ] − 1 , f ( t ) = ( 1 + t / D ∗ ) − r . A=\alpha^{\kappa_0+1}2^\alpha C_0\Gamma(\kappa_0+1),\qquad D_*=[\alpha^{2\alpha}C_0\Gamma(\kappa_0+1)]^{-1},\qquad f(t)=(1+t/D_*)^{-r}. A = α κ 0 + 1 2 α C 0 Γ ( κ 0 + 1 ) , D ∗ = [ α 2 α C 0 Γ ( κ 0 + 1 ) ] − 1 , f ( t ) = ( 1 + t / D ∗ ) − r .
The uniform-convergence theorem, smooth-equivalent theorem and Potter bounds for regular variation [7 Theorems 1.2.1, 1.3.3 and 1.5.6] will be used below. Choose L ~ 0 ∼ L 0 \widetilde{L}_0 \sim L_0 L 0 ∼ L 0 with v L ~ 0 ′ ( v ) / L ~ 0 ( v ) → 0 v\widetilde{L}_0'(v)/\widetilde{L}_0(v) \to0 v L 0 ′ ( v ) / L 0 ( v ) → 0 , and set b ~ ( v ) = v κ 0 / L ~ 0 ( v ) \widetilde{b}(v)=v^{\kappa_0}/\widetilde{L}_0(v) b ( v ) = v κ 0 / L 0 ( v ) and w ~ ( u ) = u 1 − α b ~ ( l u ) \widetilde{w}(u)=u^{1-\alpha}\widetilde{b}(l_u) w ( u ) = u 1 − α b ( l u ) . Then
u w ~ ′ ( u ) w ~ ( u ) = 1 − α − κ 0 + o ( 1 ) l u > 0 \frac{u\widetilde{w}'(u)}{\widetilde{w}(u)}=1-\alpha-\frac{\kappa_0+o(1)}{l_u}>0 w ( u ) u w ′ ( u ) = 1 − α − l u κ 0 + o ( 1 ) > 0
for small u u u . Thus w ~ ∼ w \widetilde{w}\sim w w ∼ w is continuous and eventually increasing; no monotonicity of the measurable weight b b b is assumed. Sharp inverse-endpoint asymptotics for two-map mixtures are proved in [4 ] ; logarithmic corrections for continuous parameter laws occur in [6 ] . Here both the starting coordinate and the length of the inverse word vary. Besides the resulting joint profile, we need a common integrable environment bound to normalize counts along shifted probability fibres.
Lemma 8.1 (Endpoint normalization). For almost every ω \omega ω , μ ω ( [ 0 , u ] ) / w ( u ) → C ∗ \mu_\omega([0,u])/w(u)\to C_\ast μ ω ([ 0 , u ]) / w ( u ) → C ∗ as u ↓ 0 u\downarrow0 u ↓ 0 , with C ∗ C_\ast C ∗ as in Theorem 1.2 . For every schedule in that theorem, Q N / M N → 1 Q_N/M_N\to1 Q N / M N → 1 almost surely and the stated asymptotics for M N M_N M N hold.
Proof. We first express the fibre mass as a sum over backward entrances. The main steps are to obtain an inverse profile uniformly in its starting scale, dominate its tail by an integrable environment bound, and then pass from the fibre asymptotic to the cumulative means.
Write F ω ( u ) = μ ω ( [ 0 , u ] ) F_\omega(u)=\mu_\omega([0,u]) F ω ( u ) = μ ω ([ 0 , u ]) , q 0 = u q_0=u q 0 = u , and q j = ϕ s − j ( q j − 1 ) q_j=\phi_{s-j}(q_{j-1}) q j = ϕ s − j ( q j − 1 ) . Equivariance gives
F ω ( u ) = F σ − m ω ( q m ) + ∑ j = 0 m − 1 ∫ 1 / 2 ( 1 + q j ) / 2 h σ − j − 1 ω ( v ) d v . F_\omega(u)=F_{\sigma^{-m}\omega}(q_m)+\sum_{j=0}^{m-1}\int_{1/2}^{(1+q_j)/2}h_{\sigma^{-j-1}\omega}(v)\,\mathrm{d}v. F ω ( u ) = F σ − m ω ( q m ) + j = 0 ∑ m − 1 ∫ 1/2 ( 1 + q j ) /2 h σ − j − 1 ω ( v ) d v .
The older fibre is independent of the finite word determining q m q_m q m , so the expected residual is E μ ( [ 0 , q m ] ) → 0 \mathbb{E}\mu([0,q_m])\to0 E μ ([ 0 , q m ]) → 0 . The positive partial sums increase to F ω ( u ) F_\omega(u) F ω ( u ) almost surely, first for rational u u u , then for all u u u by continuity.
Inverse profiles. For an inverse step starting at x x x , set z = x − α z=x^{-\alpha} z = x − α . Uniformly for s ∈ [ α , B ] s\in[\alpha,B] s ∈ [ α , B ] , Taylor expansion at the actual inverse coordinate, followed by its bounded-increment estimate, gives
ϕ s ( x ) − α − z = α 2 s z − ( s − α ) / α + O ( z − 1 ) , 0 < ϕ s ( x ) − α − z ≤ C . \phi_s(x)^{-\alpha}-z=\alpha^2s z^{-(s-\alpha)/\alpha}+O(z^{-1}),\qquad0<\phi_s(x)^{-\alpha}-z\le C. ϕ s ( x ) − α − z = α 2 s z − ( s − α ) / α + O ( z − 1 ) , 0 < ϕ s ( x ) − α − z ≤ C .
The Laplace–Stieltjes identity for V = s − α V=s-\alpha V = s − α gives
E e − t V = t ∫ 0 ∞ e − t v π ( V ≤ v ) d v ∼ C 0 Γ ( κ 0 + 1 ) t − κ 0 L 0 ( t ) . \mathbb{E}e^{-tV}=t\int_0^\infty e^{-tv}\pi(V\le v)\,\mathrm{d}v\sim C_0\Gamma(\kappa_0+1)t^{-\kappa_0}L_0(t). E e − t V = t ∫ 0 ∞ e − t v π ( V ≤ v ) d v ∼ C 0 Γ ( κ 0 + 1 ) t − κ 0 L 0 ( t ) .
After substituting t v = y tv=y t v = y , Potter bounds dominate the small-v v v integrand by an integrable multiple of e − y ( y κ 0 − ϵ + y κ 0 + ϵ ) e^{-y}(y^{\kappa_0-\epsilon}+y^{\kappa_0+\epsilon}) e − y ( y κ 0 − ϵ + y κ 0 + ϵ ) , 0 < ϵ < 1 0<\epsilon<1 0 < ϵ < 1 ; the remaining part is exponentially negligible. This also covers an atomless index-zero law. Hence the conditional mean increment at coordinate z z z is m ( z ) ∼ A / b ( log z ) m(z)\sim A/b(\log z) m ( z ) ∼ A / b ( log z ) .
Fix integers J , C , d ≥ 1 J,C,d\ge1 J , C , d ≥ 1 and let R → ∞ R\to\infty R → ∞ through integers. For each terminal phase ∣ k ∣ ≤ R d |k|\le R^d ∣ k ∣ ≤ R d , read its inverse symbols v 1 , v 2 , … v_1,v_2,\ldots v 1 , v 2 , … in application order and start at an integer Z 0 = z 0 ∈ [ 1 , C R ] Z_0=z_0\in[1,CR] Z 0 = z 0 ∈ [ 1 , C R ] . Set Z i = q i − α Z_i=q_i^{-\alpha} Z i = q i − α , with q 0 = z 0 − 1 / α q_0=z_0^{-1/\alpha} q 0 = z 0 − 1/ α , and let H i \mathcal{H}_i H i reveal the first i i i symbols. The centered increments are Z i − Z i − 1 − m ( Z i − 1 ) Z_i-Z_{i-1}-m(Z_{i-1}) Z i − Z i − 1 − m ( Z i − 1 ) , whose sum is a bounded-increment H i \mathcal{H}_i H i -martingale. Write Z i k , z 0 Z_i^{k,z_0} Z i k , z 0 for this grid trajectory. The conditional exponential bound and union over its phase/initial grid give
P ( max ∣ k ∣ ≤ R d , z 0 ∈ [ 1 , C R ] i ≤ J R ∣ Z i k , z 0 − z 0 − ∑ ℓ = 1 i m ( Z ℓ − 1 k , z 0 ) ∣ > R 3 / 4 ) ≤ C ′ R d + 1 e − c R 1 / 2 . \mathbb{P}\left(\max_{\substack{|k|\le R^d,\ z_0\in[1,CR]\\ i\le JR}}\left|Z_i^{k,z_0}-z_0-\sum_{\ell=1}^{i}m\left(Z_{\ell-1}^{k,z_0}\right)\right|>R^{3/4}\right)\le C'R^{d+1}e^{-cR^{1/2}}. P ∣ k ∣ ≤ R d , z 0 ∈ [ 1 , C R ] i ≤ J R max Z i k , z 0 − z 0 − ℓ = 1 ∑ i m ( Z ℓ − 1 k , z 0 ) > R 3/4 ≤ C ′ R d + 1 e − c R 1/2 .
Its sum over R R R is finite. Intersect these full-measure sets over the fixed integers J , C , d J,C,d J , C , d and rational fixed bands used below. All subsequent profile assertions use this common full-measure event. Overlapping words need not be independent. A fixed band [ α , α + ϵ ] [\alpha,\alpha+\epsilon] [ α , α + ϵ ] , chosen below one, has positive mass. For each phase the probability that its length-i i i prefix contains less than half the expected number of band symbols is at most C ϵ e − c ϵ i C_\epsilon e^{-c_\epsilon i} C ϵ e − c ϵ i . Summing over ∣ k ∣ ≤ R d |k|\le Rd ∣ k ∣ ≤ R d and i ≥ K log R i\ge K\log R i ≥ K log R bounds the failure probability by C ϵ R d − c ϵ K C_\epsilon R^{d-c_\epsilon K} C ϵ R d − c ϵ K . Choose K = K ϵ , d K=K_{\epsilon,d} K = K ϵ , d so that this is summable in R R R , and include these countably many events in the common full-measure set. The resulting prefix counts give Z i ≥ c ϵ i α / ( α + ϵ ) Z_i\ge c_\epsilon i^{\alpha/(\alpha+\epsilon)} Z i ≥ c ϵ i α / ( α + ϵ ) for i ≥ K ϵ , d log R i\ge K_{\epsilon,d}\log R i ≥ K ϵ , d log R , and Z i ≤ z 0 + C i Z_i\le z_0+Ci Z i ≤ z 0 + C i . For the compact profile, specialize to the initial grid points bracketing u − α u^{-\alpha} u − α and choose an integer R ≍ a u R\asymp a_u R ≍ a u . For these points z 0 ∼ u − α z_0\sim u^{-\alpha} z 0 ∼ u − α , and the preceding bounds imply log Z i / log z 0 → 1 \log Z_i/\log z_0\to1 log Z i / log z 0 → 1 uniformly on compact scaled windows, and the martingale error is o ( z 0 ) o(z_0) o ( z 0 ) . Bracketing a real initial coordinate by its integer floor and ceiling changes it by at most one, hence gives asymptotically equivalent radii and scales; monotonicity of the inverse maps extends the grid limits to every real u ↓ 0 u\downarrow0 u ↓ 0 :
q ⌊ t u ⌋ ( u ) / u ⟶ f ( t ) uniformly on compact t -intervals . (33) q_{\lfloor tu\rfloor}(u)/u\longrightarrow f(t)\quad\text{uniformly on compact $t$-intervals}. \tag*{(33)} q ⌊ t u ⌋ ( u ) / u ⟶ f ( t ) uniformly on compact t -intervals . (33)
Here the terminal phase can vary with u u u , with absolute value at most a u d a_u^d a u d , for each fixed d d d ; the phase is suppressed in the notation. The scaled drift is A α − κ 0 = 1 / D ∗ A\alpha^{-\kappa_0}=1/D_* A α − κ 0 = 1/ D ∗ . For the deep profile take R = L R=L R = L . The same argument, discarding i < R 1 − δ i<R^{1-\delta} i < R 1 − δ , gives
q L ( u ) ∼ A − r L − r b ( log L ) r if u − α = o ( L / b ( log L ) ) . (34) q_L(u)\sim A^{-r}L^{-r}b(\log L)^r\quad\text{if }u^{-\alpha}=o(L/b(\log L)). \tag*{(34)} q L ( u ) ∼ A − r L − r b ( log L ) r if u − α = o ( L / b ( log L )) . (34)
Indeed the discarded cost O ( R 1 − δ ) O(R^{1-\delta}) O ( R 1 − δ ) and martingale error O ( R 3 / 4 ) O(R^{3/4}) O ( R 3/4 ) are both o ( R / b ( log R ) ) o(R/b(\log R)) o ( R / b ( log R )) . On the surviving steps the fixed-band bound gives log Z i / log R ∈ [ ℓ + o ( 1 ) , 1 + o ( 1 ) ] \log Z_i/\log R\in[\ell+o(1),1+o(1)] log Z i / log R ∈ [ ℓ + o ( 1 ) , 1 + o ( 1 )] , where ℓ = ( 1 − δ ) α / ( α + ϵ ) \ell=(1-\delta)\alpha/(\alpha+\epsilon) ℓ = ( 1 − δ ) α / ( α + ϵ ) . Uniform convergence of regular variation therefore gives
A ≤ lim inf Z R b ( log R ) R ≤ lim sup Z R b ( log R ) R ≤ A ℓ − κ 0 . A\le\liminf\frac{Z_Rb(\log R)}{R}\le\limsup\frac{Z_Rb(\log R)}{R}\le A\ell^{-\kappa_0}. A ≤ lim inf R Z R b ( log R ) ≤ lim sup R Z R b ( log R ) ≤ A ℓ − κ 0 .
The initial coordinate is negligible by the displayed condition. Let ϵ , δ ↓ 0 \epsilon,\delta\downarrow0 ϵ , δ ↓ 0 . The same estimates apply to reversed future words. In particular, on the same full-measure set the deep limit holds along deterministic pairs ( u , L ) (u,L) ( u , L ) satisfying its displayed condition and terminal phases of absolute value at most L d L^d L d , for any fixed d d d .
An integrable environment bound. To control all residence tails, take u m = e − m u_m=e^{-m} u m = e − m , β m = α + 1 / m < a 0 < 1 \beta_m=\alpha+1/m<a_0<1 β m = α + 1/ m < a 0 < 1 , p m = π ( [ α , β m ] ) ∼ C 0 / b ( m ) p_m=\pi([\alpha,\beta_m])\sim C_0/b(m) p m = π ([ α , β m ]) ∼ C 0 / b ( m ) , and t m = ⌈ e α m b ( m ) ⌉ t_m=\lceil e^{\alpha_m b(m)}\rceil t m = ⌈ e α m b ( m ) ⌉ . Let G m G_m G m mean that every past prefix j ≥ t m j\ge t_m j ≥ t m has at least p m j / 2 p_mj/2 p m j /2 such fast symbols. Bernoulli exponential bounds give
P ( G m c ) ≤ C p m − 1 e − c p m t m ≤ C b ( m ) exp ( − c e α m ) . \mathbb{P}(G_m^c)\le Cp_m^{-1}e^{-c p_m t_m}\le Cb(m)\exp(-ce^{\alpha m}). P ( G m c ) ≤ C p m − 1 e − c p m t m ≤ C b ( m ) exp ( − c e α m ) .
On G m G_m G m , the inverse β m \beta_m β m -power increment yields q j ( u m ) ≤ C u m ( j / t m ) − 1 / β m q_j(u_m)\le Cu_m(j/t_m)^{-1/\beta_m} q j ( u m ) ≤ C u m ( j / t m ) − 1/ β m for j ≥ t m j\ge t_m j ≥ t m . The constant is uniform because e m ( 1 − α / β m ) e^{m(1-\alpha/\beta_m)} e m ( 1 − α / β m ) is bounded. Thus ∑ j q j ( u m ) ≤ C u m t m \sum_jq_j(u_m)\le C u_m t_m ∑ j q j ( u m ) ≤ C u m t m ; its normalized tail beyond T t m Tt_m T t m is at most C T 1 − 1 / a 0 CT^{1-1/a_0} C T 1 − 1/ a 0 .
On the exceptional scales use the fixed band [ α , a 0 ] [\alpha,a_0] [ α , a 0 ] . Let ξ ℓ \xi_\ell ξ ℓ be its successive geometric waiting times in the past, A ℓ = ∑ i = 1 ℓ ξ i A_\ell=\sum_{i=1}^{\ell}\xi_i A ℓ = ∑ i = 1 ℓ ξ i , and K ω = sup ℓ ≥ 1 A ℓ / ℓ \mathcal{K}_\omega=\sup_{\ell\ge1}A_\ell/\ell K ω = sup ℓ ≥ 1 A ℓ / ℓ . For some λ > 0 \lambda>0 λ > 0 , E e λ ξ 1 < ∞ \mathbb{E}e^{\lambda\xi_1}<\infty E e λ ξ 1 < ∞ , so for large t t t ,
P ( K ω > t ) ≤ ∑ ℓ ≥ 1 ( e − λ t E e λ ξ 1 ) ℓ ≤ C e − c t . \mathbb{P}(\mathcal{K}_\omega>t)\le\sum_{\ell\ge1}(e^{-\lambda t}\mathbb{E}e^{\lambda\xi_1})^\ell\le Ce^{-ct}. P ( K ω > t ) ≤ ℓ ≥ 1 ∑ ( e − λ t E e λ ξ 1 ) ℓ ≤ C e − c t .
Each fast step increases the inverse a 0 a_0 a 0 -power by at least a fixed constant. Abel summation, using A ℓ ≤ K ω ℓ A_\ell\le\mathcal{K}_\omega\ell A ℓ ≤ K ω ℓ , gives simultaneously for all small u > 0 u>0 u > 0 ,
∑ j q j ( u ) ≤ ∑ ℓ ≥ 0 ξ ℓ + 1 ( u − a 0 + c ℓ ) − 1 / a 0 ≤ K ω ∑ ℓ ≥ 0 ( u − a 0 + c ℓ ) − 1 / a 0 ≤ C K ω u 1 − a 0 . \sum_j q_j(u)\le\sum_{\ell\ge0}\xi_{\ell+1}(u^{-a_0}+c\ell)^{-1/a_0}\le\mathcal{K}_\omega\sum_{\ell\ge0}(u^{-a_0}+c\ell)^{-1/a_0}\le C\mathcal{K}_\omega u^{1-a_0}. j ∑ q j ( u ) ≤ ℓ ≥ 0 ∑ ξ ℓ + 1 ( u − a 0 + c ℓ ) − 1/ a 0 ≤ K ω ℓ ≥ 0 ∑ ( u − a 0 + c ℓ ) − 1/ a 0 ≤ C K ω u 1 − a 0 .
Consequently
∑ j q j ( u ) w ( u ) ≤ J ω , E J ω < ∞ . (35) \frac{\sum_j q_j(u)}{w(u)} \leq\mathcal{J}_{\omega}, \qquad\mathbb{E}\mathcal{J}_{\omega}<\infty. \tag*{(35)} w ( u ) ∑ j q j ( u ) ≤ J ω , E J ω < ∞. (35)
One may take a constant multiple of 1 + K ω ∑ m ≥ m 0 e ( a 0 − α ) m b ( m ) − 1 1 G m c 1+\mathcal{K}_{\omega}\sum_{m\geq m_0}e^{(a_0-\alpha)m}b(m)^{-1}\mathbf{1}_{G_m^c} 1 + K ω ∑ m ≥ m 0 e ( a 0 − α ) m b ( m ) − 1 1 G m c . Cauchy–Schwarz proves integrability without independence: the expectation of its m m m th exceptional summand is at most e ( a 0 − α ) m b ( m ) − 1 ( E K 1 2 ) 1 / 2 P ( G m c ) 1 / 2 e^{(a_0-\alpha)m}b(m)^{-1}(\mathbb{E}K_1^2)^{1/2}\mathbb{P}(G_m^c)^{1/2} e ( a 0 − α ) m b ( m ) − 1 ( E K 1 2 ) 1/2 P ( G m c ) 1/2 , a summable sequence. Adjacent exponential-radius grids have bounded weight ratios, so the bound extends to all small real u u u . The first Borel–Cantelli lemma makes all sufficiently large scales good and gives the stated uniform tail control. Since h ω ≤ 2 h_\omega\leq2 h ω ≤ 2 on Y Y Y , the injection identity also gives F ω ( u ) ≤ ∑ j q j ( u ) F_\omega(u)\leq\sum_jq_j(u) F ω ( u ) ≤ ∑ j q j ( u ) .
Fibre asymptotics. Local Lipschitz bounds give each injection as c ( σ − j − 1 ω ) q j + O ( q j 2 ) c(\sigma^{-j-1}\omega)q_j+O(q_j^2) c ( σ − j − 1 ω ) q j + O ( q j 2 ) , where c ( ω ) = h ω ( 1 / 2 ) / 2 c(\omega)=h_\omega(1/2)/2 c ( ω ) = h ω ( 1/2 ) /2 . The total error is at most C u ∑ j q j Cu\sum_jq_j C u ∑ j q j . Approximate the profile using (31) and its uniform tail, then apply weighted backward Birkhoff to the bounded coefficients c c c . No independence of trace coefficients and inverse words is used. The limit is E c ∫ 0 ∞ f ( t ) d t = E c D ∗ / ( r − 1 ) = C ∗ \mathbb{E}c\int_0^\infty f(t)\,dt=\mathbb{E}cD_*/(r-1)=C_* E c ∫ 0 ∞ f ( t ) d t = E c D ∗ / ( r − 1 ) = C ∗ .
Cumulative normalization. Set R δ ( ω ) = sup 0 < u ≤ δ ∣ F ω ( u ) / w ~ ( u ) − C ∗ ∣ R_\delta(\omega)=\sup_{0<u\leq\delta}|F_\omega(u)/\widetilde{w}(u)-C_*| R δ ( ω ) = sup 0 < u ≤ δ ∣ F ω ( u ) / w ( u ) − C ∗ ∣ , taking the supremum over rationals. These errors decrease to zero and have an integrable common envelope by (33). First suppose that the radii are eventually decreasing. Then w ~ ( u n ) \widetilde{w}(u_n) w ( u n ) is eventually decreasing and regularly varying with exponent − ξ -\xi − ξ , ξ < 1 \xi<1 ξ < 1 . Birkhoff and Abel summation give ∑ n ≤ N w ~ ( u n ) R δ ( σ n ω ) / ∑ n ≤ N w ~ ( u n ) → E R δ \sum_{n\leq N}\widetilde{w}(u_n)R_\delta(\sigma^n\omega)/\sum_{n\leq N}\widetilde{w}(u_n)\to\mathbb{E}R_\delta ∑ n ≤ N w ( u n ) R δ ( σ n ω ) / ∑ n ≤ N w ( u n ) → E R δ . Indeed, for a n = w ~ ( u n ) a_n=\widetilde{w}(u_n) a n = w ( u n ) and centered Birkhoff sums S n = o ( n ) S_n=o(n) S n = o ( n ) ,
∑ n ≤ N a n ( S n − S n − 1 ) = a N S N + ∑ n < N ( a n − a n + 1 ) S n = o ( ∑ n ≤ N a n ) . \sum_{n\leq N}a_n(S_n-S_{n-1})=a_NS_N+\sum_{n<N}(a_n-a_{n+1})S_n=o\left(\sum_{n\leq N}a_n\right). n ≤ N ∑ a n ( S n − S n − 1 ) = a N S N + n < N ∑ ( a n − a n + 1 ) S n = o ( n ≤ N ∑ a n ) .
Discard the finite prefix u n > δ u_n>\delta u n > δ , then let δ ↓ 0 \delta\downarrow0 δ ↓ 0 . This proves Q N ∼ C ∗ ∑ n ≤ N w ( u n ) Q_N\sim C_*\sum_{n\leq N}w(u_n) Q N ∼ C ∗ ∑ n ≤ N w ( u n ) . Dominated convergence gives the same asymptotic for M N M_N M N .
For general target L L L , the smooth-equivalent theorem gives L ~ ∼ L \widetilde{L}\sim L L ∼ L with x L ~ ′ ( x ) / L ~ ( x ) → 0 x\widetilde{L}'(x)/\widetilde{L}(x)\to0 x L ′ ( x ) / L ( x ) → 0 . Thus u ~ n = c n − g L ~ ( n ) \widetilde{u}_n=cn^{-g}\widetilde{L}(n) u n = c n − g L ( n ) is eventually decreasing. For every rational ϵ ∈ ( 0 , 1 ) \epsilon\in(0,1) ϵ ∈ ( 0 , 1 ) , the decreasing comparison radii u n ± = ( 1 ± ϵ ) u ~ n u_n^\pm=(1\pm\epsilon)\widetilde{u}_n u n ± = ( 1 ± ϵ ) u n , with the same cutoff, bracket u n u_n u n beyond a finite deterministic prefix. Let M N ± , Q N ± M_N^\pm,Q_N^\pm M N ± , Q N ± be their stationary and reference means. Regular variation of the target mass, and divergence of M N M_N M N , give
M N ± M N ⟶ ( 1 ± ϵ ) 1 − α . (36) \frac{M_N^\pm}{M_N}\longrightarrow(1\pm\epsilon)^{1-\alpha}. \tag*{(36)} M N M N ± ⟶ ( 1 ± ϵ ) 1 − α . (36)
The decreasing-weight argument just proved gives Q N ± / M N ± → 1 Q_N^\pm/M_N^\pm\to1 Q N ± / M N ± → 1 . Squeeze Q N Q_N Q N between these means with a bounded prefix error, intersect the countably many full-measure sets, and let ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 . This proves Q N / M N → 1 Q_N/M_N\to1 Q N / M N → 1 without monotonicity of the actual radii. Finally, uniform convergence compares w ( u n ) w(u_n) w ( u n ) with the integral of w ( u ( t ) ) w(u(t)) w ( u ( t )) over [ n , n + 1 ] [n,n+1] [ n , n + 1 ] . Since w ( u ( t ) ) w(u(t)) w ( u ( t )) is regularly varying with exponent − g ( 1 − α ) > − 1 -g(1-\alpha)>-1 − g ( 1 − α ) > − 1 , Karamata’s integral asymptotic [7 Proposition 1.5.8] gives the displayed sum asymptotics, using b ( g log N ) / b ( log N ) → g κ 0 b(g\log N)/b(\log N)\to g^{\kappa_0} b ( g log N ) / b ( log N ) → g κ 0 . □ \square □
Excursion rewards and conditional deviations. Let F \mathcal{F} F be the first-return skew map on Y Y Y with unused one-sided iid noise. Its invariant law is ν = h ^ ( y ) d y × π N 0 \nu=\widehat{h}(y)\,dy\times\pi^{\mathbb{N}_0} ν = h ( y ) d y × π N 0 ; independence of the unused suffix holds at every finite stopping time. Denote its transfer relative to ν \nu ν by P \mathcal{P} P . For a base function g g g ,
P g = R ( 1 ) ( h ^ g ) / h ^ . \mathcal{P}g=R(1)(\widehat{h}g)/\widehat{h}. P g = R ( 1 ) ( h g ) / h .
Positivity and Lipschitz regularity of h ^ \widehat{h} h transfer the BV spectral gap to this normalized operator. Put T 0 = 0 T_0=0 T 0 = 0 , T j = ∑ ℓ = 0 j − 1 τ ∘ F ℓ T_j=\sum_{\ell=0}^{j-1}\tau\circ\mathcal{F}^{\ell} T j = ∑ ℓ = 0 j − 1 τ ∘ F ℓ . Let y j y_j y j be the base coordinate of F j ( y , ω ) \mathcal{F}^j(y,\omega) F j ( y , ω ) . Excursion j j j contributes neutral rewards at physical times T j + 1 , … , T j + 1 − 1 T_j+1,\ldots,T_{j+1}-1 T j + 1 , … , T j + 1 − 1 . Define K N = max { j : T j ≤ N } K_N=\max\{j:T_j\leq N\} K N = max { j : T j ≤ N } ; excursion K N K_N K N is the possibly unfinished one at time N N N . For a point initially outside Y Y Y , add its finite first-entry time to these clocks and treat the preceding observations separately. We use the rewards
V u = ∑ ℓ = 1 τ − 1 1 [ 0 , u ] ( T ω ℓ y ) , m u = ν ( V u ) = γ μ ˉ ( [ 0 , u ] ) , r = 1 / α > 1. V_u=\sum_{\ell=1}^{\tau-1}\mathbf{1}_{[0,u]}(T^\ell_\omega y),\qquad m_u=\nu(V_u)=\gamma\bar{\mu}([0,u]),\qquad r=1/\alpha>1. V u = ℓ = 1 ∑ τ − 1 1 [ 0 , u ] ( T ω ℓ y ) , m u = ν ( V u ) = γ μ ˉ ([ 0 , u ]) , r = 1/ α > 1.
The occupation identity (9) proves the equality for m u m_u m u ; neither excursion endpoint belongs to the neutral target.
Lemma 8.2 (Conditional reward bounds). There are bounded functions χ u \chi_u χ u , with ∥ χ u ∥ ∞ ≤ C m u \|\chi_u\|_\infty\le Cm_u ∥ χ u ∥ ∞ ≤ C m u , such that d u = V u − m u + χ u − χ u ∘ F d_u=V_u-m_u+\chi_u-\chi_u\circ F d u = V u − m u + χ u − χ u ∘ F satisfies P d u = 0 \mathcal{P}d_u=0 P d u = 0 , d u ≥ − C m u d_u\ge-Cm_u d u ≥ − C m u , and
∥ P 1 V u > t ∥ ∞ ≤ C min ( u , t − r b ( log ( e + t ) ) r ) , \|\mathcal{P}\mathbf{1}_{V_u>t}\|_\infty\le C\min(u,t^{-r}b(\log(e+t))^r), ∥ P 1 V u > t ∥ ∞ ≤ C min ( u , t − r b ( log ( e + t ) ) r ) , ∥ P 1 ∣ d u ∣ > t ∥ ∞ ≤ C min ( u , t − r b ( log ( e + t ) ) r ) ( t ≥ C 1 m u ) . (37) \|\mathcal{P}\mathbf{1}_{|d_u|>t}\|_\infty\le C\min(u,t^{-r}b(\log(e+t))^r)\qquad(t\ge C_1m_u). \tag*{(37)} ∥ P 1 ∣ d u ∣ > t ∥ ∞ ≤ C min ( u , t − r b ( log ( e + t ) ) r ) ( t ≥ C 1 m u ) . (37) Here C 1 C_1 C 1 is a fixed constant. The first bound holds for every t > 0 t>0 t > 0 . Also for some ϑ ∈ ( 0 , 1 ) \vartheta\in(0,1) ϑ ∈ ( 0 , 1 ) and all k ≥ 1 k\ge1 k ≥ 1 ,
∥ P k ( V u − m u ) ∥ ∞ ≤ C ϑ k − 1 m u . (38) \|\mathcal{P}^k(V_u-m_u)\|_\infty\le C\vartheta^{k-1}m_u. \tag*{(38)} ∥ P k ( V u − m u ) ∥ ∞ ≤ C ϑ k − 1 m u . (38) In particular, ∥ P k V u ∥ ∞ ≤ C m u \|\mathcal{P}^kV_u\|_\infty\le Cm_u ∥ P k V u ∥ ∞ ≤ C m u . Moreover, P 1 B u ≤ C u \mathcal{P}\mathbf{1}_{B_u}\le Cu P 1 B u ≤ C u for B u = [ 1 / 2 , ( 1 + u ) / 2 ] B_u=[1/2,(1+u)/2] B u = [ 1/2 , ( 1 + u ) /2 ] , and F \mathcal{F} F is ergodic.
Proof. The entrance set is B u = [ 1 / 2 , ( 1 + u ) / 2 ] B_u=[1/2,(1+u)/2] B u = [ 1/2 , ( 1 + u ) /2 ] , and { V u > 0 } = { y ∈ B u } \{V_u>0\}=\{y\in B_u\} { V u > 0 } = { y ∈ B u } , up to endpoints. Consider a return atom with nonzero reward. Its right-image endpoints are F 0 ( ϕ s ( 1 / 2 ) ) F_0(\phi_s(1/2)) F 0 ( ϕ s ( 1/2 )) and F 0 ( 1 / 2 ) F_0(1/2) F 0 ( 1/2 ) , where F 0 F_0 F 0 is a left-inverse prefix. Concavity, F 0 ( 0 ) = 0 F_0(0)=0 F 0 ( 0 ) = 0 , and ϕ s ( 1 / 2 ) ≥ ϕ α ( 1 / 2 ) > 0 \phi_s(1/2)\ge\phi_\alpha(1/2)>0 ϕ s ( 1/2 ) ≥ ϕ α ( 1/2 ) > 0 show that their ratio is at most C α = 1 / ( 2 ϕ α ( 1 / 2 ) ) C_\alpha=1/(2\phi_\alpha(1/2)) C α = 1/ ( 2 ϕ α ( 1/2 )) . The entire atom thus lies in B C α u B_{C_\alpha u} B C α u , even if its boundary cuts B u B_u B u .
On a return-n n n atom I I I , the reward decreases with the entrance coordinate, so its variation is at most n n n . Distortion gives ∥ ψ I ′ ∥ ∞ + Var ψ I ′ ≤ C ∣ I ∣ \|\psi_I'\|_\infty+\operatorname{Var}\psi_I'\le C|I| ∥ ψ I ′ ∥ ∞ + Var ψ I ′ ≤ C ∣ I ∣ . For a fixed Lipschitz input f f f , the branch product therefore has BV norm at most C ∥ f ∥ Lip n ∣ I ∣ C\|f\|_{\operatorname{Lip}}n|I| C ∥ f ∥ Lip n ∣ I ∣ . From entrance coordinate v v v , C v − α Cv^{-\alpha} C v − α symbols in [ α , α + 1 / log ( 1 / v ) ] [\alpha,\alpha+1/\log(1/v)] [ α , α + 1/ log ( 1/ v )] suffice to return: the extra factor v − 1 / log ( 1 / v ) v^{-1/\log(1/v)} v − 1/ l o g ( 1/ v ) is bounded. Their probability is comparable to 1 / b ( log ( 1 / v ) ) 1/b(\log(1/v)) 1/ b ( log ( 1/ v )) , so a negative-binomial waiting bound gives E τ ( v ) ≤ C v − α b ( log ( 1 / v ) ) \mathbb{E}\tau(v)\le Cv^{-\alpha}b(\log(1/v)) E τ ( v ) ≤ C v − α b ( log ( 1/ v )) . Partitioning before averaging proves for the weighted transfer W u f = E ∑ I ( V u ∘ ψ I ) ( f ∘ ψ I ) ψ I ′ W_uf=\mathbb{E}\sum_I(V_u\circ\psi_I)(f\circ\psi_I)\psi_I' W u f = E ∑ I ( V u ∘ ψ I ) ( f ∘ ψ I ) ψ I ′ that
∥ W u f ∥ B V ≤ C ∥ f ∥ Lip ∫ 0 C α u E τ ( v ) d v ≤ C ∥ f ∥ Lip w ( u ) . \|W_uf\|_{BV}\le C\|f\|_{\operatorname{Lip}}\int_0^{C_\alpha u}\mathbb{E}\tau(v)\,dv\le C\|f\|_{\operatorname{Lip}}w(u). ∥ W u f ∥ B V ≤ C ∥ f ∥ Lip ∫ 0 C α u E τ ( v ) d v ≤ C ∥ f ∥ Lip w ( u ) .
For u u u in the remaining compact range, constants absorb the bound. The same argument for the indicator of B u B_u B u , whose branch variation is at most one, gives ∥ R ( 1 ) ( 1 B u h ^ ) ∥ B V ≤ C u \|R(1)(\mathbf{1}_{B_u}\widehat h)\|_{BV}\le Cu ∥ R ( 1 ) ( 1 B u h ) ∥ B V ≤ C u . Stopping removes the consumed prefix, so both transfers are base-only. Consequently P 1 V u > 0 ≤ C u \mathcal{P}\mathbf{1}_{V_u>0}\le Cu P 1 V u > 0 ≤ C u . For the return tail at n n n , use instead the band [ α , α + 1 / log n ] [\alpha,\alpha+1/\log n] [ α , α + 1/ log n ] . Its first n n n symbols contain c n / b ( log n ) cn/b(\log n) c n / b ( log n ) successes except with probability C e − c n / b ( log n ) Ce^{-cn/b(\log n)} C e − c n / b ( l o g n ) . For β n = α + 1 / log n \beta_n=\alpha+1/\log n β n = α + 1/ log n , the inverse-power bound on the good event is q n − 1 ( 1 / 2 ) ≤ C [ n / b ( log n ) ] − 1 / β n q_{n-1}(1/2)\le C[n/b(\log n)]^{-1/\beta_n} q n − 1 ( 1/2 ) ≤ C [ n / b ( log n ) ] − 1/ β n . This is at most C n − r b ( log n ) r Cn^{-r}b(\log n)^r C n − r b ( log n ) r , since ( r − 1 / β n ) log [ n / b ( log n ) ] (r-1/\beta_n)\log[n/b(\log n)] ( r − 1/ β n ) log [ n / b ( log n )] stays bounded. Thus E q n − 1 ( 1 / 2 ) ≤ C n − r b ( log n ) r \mathcal{E}q_{n-1}(1/2)\le Cn^{-r}b(\log n)^r E q n − 1 ( 1/2 ) ≤ C n − r b ( log n ) r . On the exceptional event use q n − 1 ≤ 1 / 2 q_{n-1}\le1/2 q n − 1 ≤ 1/2 . Since V u ≤ τ V_u\le\tau V u ≤ τ , distortion and the positive stopping-transfer formula give the first bound in (35).
By Lemma 8.1, m u ≍ w ( u ) = w a u m_u\asymp w(u)=wa_u m u ≍ w ( u ) = w a u . The base-only function P ( V u − m u ) = W u h ^ / h ^ − m u \mathcal{P}(V_u-m_u)=W_u\widehat h/\widehat h-m_u P ( V u − m u ) = W u h / h − m u has mean zero and BV norm at most C m u Cm_u C m u . The induced spectral gap gives, for some ϑ ∈ ( 0 , 1 ) \vartheta\in(0,1) ϑ ∈ ( 0 , 1 ) , ∥ P k ( V u − m u ) ∥ ∞ ≤ C ϑ k − 1 m u \|\mathcal{P}^k(V_u-m_u)\|_\infty\le C\vartheta^{k-1}m_u ∥ P k ( V u − m u ) ∥ ∞ ≤ C ϑ k − 1 m u . Set χ u = ∑ k ≥ 1 P k ( V u − m u ) \chi_u=\sum_{k\ge1}\mathcal{P}^k(V_u-m_u) χ u = ∑ k ≥ 1 P k ( V u − m u ) . The transfer identity P ( f ∘ F ) = f \mathcal{P}(f\circ\mathcal{F})=f P ( f ∘ F ) = f proves centering. The bounds on χ u \chi_u χ u give the second tail bound and d u ≥ − C m u d_u\ge-Cm_u d u ≥ − C m u , as well as the asserted bound on P k V u \mathcal{P}^kV_u P k V u .
For ergodicity, take a BV base function times a bounded indicator of a cylinder in m m m future symbols. After m m m returns all these symbols are consumed; its transfer is base-only and has finite BV norm by the full-branch product bound. Subsequent transfers converge to its mean by the gap. These test functions span a dense subspace of L 1 ( ν ) L^{1}(\nu) L 1 ( ν ) . Contraction extends convergence to L 1 L^{1} L 1 , proving ergodicity. In particular, physical return times satisfy T j / j → γ T_j/j \to\gamma T j / j → γ .
Lemma 8.3 (Two-sided and lower deviations). Fix ε , Λ , H > 0 \varepsilon,\Lambda,H>0 ε , Λ , H > 0 and put I = ν I=\nu I = ν , ζ = r − 1 \zeta=r-1 ζ = r − 1 . For small u u u , sufficiently large I I I , and log I ≤ H log ( 1 / u ) \log I\le H\log(1/u) log I ≤ H log ( 1/ u ) ,
ν ( ∣ ∑ j < n V u ∘ F j − n m u ∣ > ε n m u ) ≤ C ε , Λ , H I − ζ + 2 I − Λ , (39) \nu\left(\left|\sum_{j<n}V_u\circ\mathcal{F}^{j}-nm_u\right|>\varepsilon nm_u\right)\le C_{\varepsilon,\Lambda,H}I^{-\zeta}+2I^{-\Lambda}, \tag*{(39)} ν ( j < n ∑ V u ∘ F j − n m u > ε n m u ) ≤ C ε , Λ , H I − ζ + 2 I − Λ , (39) ν ( max j < n V u ∘ F j > ε n m u ) ≤ C ε , H I − ζ . (40) \nu\left(\max_{j<n}V_u\circ\mathcal{F}^{j}>\varepsilon nm_u\right)\le C_{\varepsilon,H}I^{-\zeta}. \tag*{(40)} ν ( j < n max V u ∘ F j > ε n m u ) ≤ C ε , H I − ζ . (40) For large n n n and small u u u , without the logarithmic restriction, the endpoint conditional bound is
∥ P n 1 { ∑ j < n V u ∘ F j < ( 1 − ε ) n m u } ∥ ∞ ≤ exp ( − c ε n u ) . (41) \left\|\mathcal{P}^{n}\mathbf{1}_{\left\{\sum_{j<n}V_u\circ\mathcal{F}^{j}<(1-\varepsilon)nm_u\right\}}\right\|_{\infty}\le\exp(-c_{\varepsilon}nu). \tag*{(41)} P n 1 { ∑ j < n V u ∘ F j < ( 1 − ε ) n m u } ∞ ≤ exp ( − c ε n u ) . (41) Consequently, for every deterministic start s ≥ 0 s\ge0 s ≥ 0 ,
ν ( ∑ j = s s + n − 1 V u ∘ F j < ( 1 − ε ) n m u ) ≤ exp ( − c ε n u ) . (42) \nu\left(\sum_{j=s}^{s+n-1}V_u\circ\mathcal{F}^{j}<(1-\varepsilon)nm_u\right)\le\exp(-c_{\varepsilon}nu). \tag*{(42)} ν ( j = s ∑ s + n − 1 V u ∘ F j < ( 1 − ε ) n m u ) ≤ exp ( − c ε n u ) . (42)
Proof. Let x = ε n m u / 2 x=\varepsilon nm_u/2 x = ε n m u /2 and t c = x / q t_c=x/q t c = x / q , where q q q is a large constant chosen below, independently of I I I . Put D = d u 1 ∣ d u ∣ ≤ t c D=d_u\mathbf{1}_{|d_u|\le t_c} D = d u 1 ∣ d u ∣ ≤ t c , and e = D − ( P D ) ∘ F e=D-(\mathcal{P}D)\circ\mathcal{F} e = D − ( P D ) ∘ F . Then P e = 0 \mathcal{P}e=0 P e = 0 , ∣ e ∣ ≤ 2 t c |e|\le2t_c ∣ e ∣ ≤ 2 t c , and P e 2 ≤ P D 2 \mathcal{P}e^2\le\mathcal{P}D^2 P e 2 ≤ P D 2 . For large I I I , t c / a u ≍ I / q → ∞ t_c/a_u\asymp I/q\to\infty t c / a u ≍ I / q → ∞ , so t c ≥ a u t_c\ge a_u t c ≥ a u and t c ≫ m u t_c\gg m_u t c ≫ m u . Fix ϵ 0 > 0 \epsilon_0>0 ϵ 0 > 0 and put ρ = ( κ 0 + ϵ 0 ) r \rho=(\kappa_0+\epsilon_0)r ρ = ( κ 0 + ϵ 0 ) r . Potter bounds and log a u = α l u + o ( l u ) \log a_u=\alpha l_u+o(l_u) log a u = α l u + o ( l u ) give, for s ≥ 1 s\ge1 s ≥ 1 , the conditional tail at t = a u s t=a_us t = a u s bounded by C u s − r ( 1 + log s / l u ) ρ Cu s^{-r}(1+\log s/l_u)^\rho C u s − r ( 1 + log s / l u ) ρ . Write s 0 = t c / a u s_0=t_c/a_u s 0 = t c / a u . The restriction log I ≤ H l u \log I\le Hl_u log I ≤ H l u bounds the logarithmic factor up to s 0 s_0 s 0 . Above it, put s = s 0 v s=s_0v s = s 0 v ; the factor is at most C H ( 1 + log v ) ρ C_H(1+\log v)^\rho C H ( 1 + log v ) ρ . Since ∫ 1 ∞ v − r ( 1 + log v ) ρ d v < ∞ \int_1^\infty v^{-r}(1+\log v)^\rho\,dv<\infty ∫ 1 ∞ v − r ( 1 + log v ) ρ d v < ∞ , conditional integration, including t c P 1 ∣ d u ∣ > t c t_c\mathbb{P}_{1|d_u|>t_c} t c P 1∣ d u ∣ > t c , gives ∥ P D ∥ ∞ ≤ C H u a u ( I / q ) 1 − r \|\mathcal{P}D\|_\infty\le C_Hua_u(I/q)^{1-r} ∥ P D ∥ ∞ ≤ C H u a u ( I / q ) 1 − r . Its total bias divided by x x x is O q , H ( I − ζ ) → 0 O_{q,H}(I^{-\zeta})\to0 O q , H ( I − ζ ) → 0 . Splitting the second-moment integral at a u a_u a u gives
∥ P e 2 ∥ ∞ ≤ σ 2 , σ 2 ≤ C H u a u 2 { 1 , r > 2 , 1 + log I , r = 2 , I 2 − r , 1 < r < 2. \|\mathcal{P}e^2\|_\infty\le\sigma^2,\qquad
\sigma^2\le C_Hua_u^2
\begin{cases}
1, & r>2,\\
1+\log I, & r=2,\\
I^{2-r}, & 1<r<2.
\end{cases} ∥ P e 2 ∥ ∞ ≤ σ 2 , σ 2 ≤ C H u a u 2 ⎩ ⎨ ⎧ 1 , 1 + log I , I 2 − r , r > 2 , r = 2 , 1 < r < 2.
The range below C 1 m u C_1m_u C 1 m u contributes only C m u 2 Cm_u^2 C m u 2 . Let G \mathcal{G} G be the underlying sigma-algebra and G j = F − j G \mathcal{G}_j=\mathcal{F}^{-j}\mathcal{G} G j = F − j G the decreasing filtration. The transfer identity gives
E ν [ e ∘ F j ∣ G j + 1 ] = 0 , E ν [ e 2 ∘ F j ∣ G j + 1 ] = ( P e 2 ) ∘ F j + 1 ≤ σ 2 . \mathbb{E}_{\nu}[e\circ\mathcal{F}^{j}\mid\mathcal{G}_{j+1}]=0,\qquad
\mathbb{E}_{\nu}[e^2\circ\mathcal{F}^{j}\mid\mathcal{G}_{j+1}]=(\mathcal{P}e^2)\circ\mathcal{F}^{j+1}\le\sigma^2. E ν [ e ∘ F j ∣ G j + 1 ] = 0 , E ν [ e 2 ∘ F j ∣ G j + 1 ] = ( P e 2 ) ∘ F j + 1 ≤ σ 2 .
Set b 0 = 2 t c b_0=2t_c b 0 = 2 t c . For λ ≥ 0 \lambda\ge0 λ ≥ 0 and ∣ z ∣ ≤ b 0 |z|\le b_0 ∣ z ∣ ≤ b 0 ,
e λ z ≤ 1 + λ z + e λ b 0 − 1 − λ b 0 b 0 2 z 2 . e^{\lambda z}\le1+\lambda z+\frac{e^{\lambda b_0}-1-\lambda b_0}{b_0^2}z^2. e λ z ≤ 1 + λ z + b 0 2 e λ b 0 − 1 − λ b 0 z 2 .
For positive z z z , this follows from the Taylor series; for negative z z z , the remainder is at most λ 2 z 2 / 2 \lambda^2z^2/2 λ 2 z 2 /2 , which is bounded by the displayed quadratic term. Apply this inequality to both signs of e e e . Conditional centering gives
E ν [ exp ( ± λ e ∘ F j ) ∣ G j + 1 ] ≤ exp [ σ 2 b 0 2 ( e λ b 0 − 1 − λ b 0 ) ] . \mathbb{E}_{\nu}\left[\exp(\pm\lambda e\circ\mathcal{F}^{j})\mid\mathcal{G}_{j+1}\right]\le\exp\left[\frac{\sigma^2}{b_0^2}\left(e^{\lambda b_0}-1-\lambda b_0\right)\right]. E ν [ exp ( ± λ e ∘ F j ) ∣ G j + 1 ] ≤ exp [ b 0 2 σ 2 ( e λ b 0 − 1 − λ b 0 ) ] .
On a finite block, condition successively on G 1 , … , G n \mathcal{G}_1,\ldots,\mathcal{G}_n G 1 , … , G n , removing the earliest remaining term at each step. If v = n σ 2 > 0 v=n\sigma^2>0 v = n σ 2 > 0 , choose λ = b 0 − 1 log ( 1 + b 0 x / v ) \lambda=b_0^{-1}\log(1+b_0x/v) λ = b 0 − 1 log ( 1 + b 0 x / v ) . With Ψ ( s ) = ( 1 + s ) log ( 1 + s ) − s \Psi(s)=(1+s)\log(1+s)-s Ψ ( s ) = ( 1 + s ) log ( 1 + s ) − s , exponential Markov yields
ν ( ∣ ∑ j < n e ∘ F j ∣ > x ) ≤ 2 exp [ − v b 0 2 Ψ ( b 0 x / v ) ] ≤ 2 ( exp ( 1 ) v b 0 x ) x / b 0 . \nu\left(\left|\sum_{j<n}e\circ F^j\right|>x\right)\leq2\exp\left[-\frac{v}{b_0^2}\Psi(b_0x/v)\right]\leq2\left(\frac{\exp(1)v}{b_0x}\right)^{x/b_0}. ν ( j < n ∑ e ∘ F j > x ) ≤ 2 exp [ − b 0 2 v Ψ ( b 0 x / v ) ] ≤ 2 ( b 0 x exp ( 1 ) v ) x / b 0 .
The last inequality uses ( 1 + 1 / s ) log ( 1 + s ) − 1 ≥ log s − 1 (1+1/s)\log(1+s)-1\geq\log s-1 ( 1 + 1/ s ) log ( 1 + s ) − 1 ≥ log s − 1 . If v = 0 v=0 v = 0 , the centered sum vanishes. In the three variance regimes, v / ( b 0 x ) v/(b_0x) v / ( b 0 x ) is bounded by C q , H / I C_{q,H}/I C q , H / I , C q , H ( 1 + log I ) / I C_{q,H}(1+\log I)/I C q , H ( 1 + log I ) / I , and C q , H I − ζ C_{q,H}I^{-\zeta} C q , H I − ζ , respectively. Put β 0 = min ( 1 , ζ ) / 2 \beta_0=\min(1,\zeta)/2 β 0 = min ( 1 , ζ ) /2 , and choose the fixed q q q so that β 0 q / 2 > Λ \beta_0q/2>\Lambda β 0 q /2 > Λ . Since x / b 0 = q / 2 x/b_0=q/2 x / b 0 = q /2 , increasing the cutoff for I I I makes the last bound at most 2 I − Λ 2I^{-\Lambda} 2 I − Λ . The union probability of a discarded difference is at most C n t − r b ( log ( e + t c ) ) r ≤ C q , H I − ζ Cnt^{-r}b(\log(e+t_c))^r\leq C_{q,H}I^{-\zeta} C n t − r b ( log ( e + t c ) ) r ≤ C q , H I − ζ . On the no-discard event, the reward sum differs from the centered truncated sum only by its compensator and the telescoping coboundary. Their combined size is at most x x x for large I I I . This proves (39) ; the direct union bound for V u V_u V u at threshold ε n m u \varepsilon n m_u ε n m u proves (40) .
For the lower tail take λ = θ / a u \lambda=\theta/a_u λ = θ / a u , θ > 0 \theta>0 θ > 0 small. For z ≥ 0 z\geq0 z ≥ 0 , φ ( z ) = e − z − 1 + z \varphi(z)=e^{-z}-1+z φ ( z ) = e − z − 1 + z has derivative at most min ( z , 1 ) \min(z,1) min ( z , 1 ) . Conditional layer-cake integration bounds P φ ( λ d u + ) \mathcal{P}\varphi(\lambda d_u^+) P φ ( λ d u + ) by
C λ 2 m u 2 + C λ 2 ∫ 0 1 / λ t min ( u , t − r b ( log ( e + t ) ) r ) d t + C λ ∫ 1 / λ ∞ min ( u , t − r b ( log ( e + t ) ) r ) d t . C\lambda^2m_u^2+C\lambda^2\int_0^{1/\lambda}t\min(u,t^{-r}b(\log(e+t))^r)\,dt
+C\lambda\int_{1/\lambda}^{\infty}\min(u,t^{-r}b(\log(e+t))^r)\,dt. C λ 2 m u 2 + C λ 2 ∫ 0 1/ λ t min ( u , t − r b ( log ( e + t ) ) r ) d t + C λ ∫ 1/ λ ∞ min ( u , t − r b ( log ( e + t ) ) r ) d t .
The bounded negative part contributes at most C λ 2 m u 2 C\lambda^2m_u^2 C λ 2 m u 2 . The resulting bound is C u ψ r ( θ ) Cu\psi_r(\theta) C u ψ r ( θ ) , where ψ r \psi_r ψ r is θ 2 \theta^2 θ 2 , θ 2 ( 1 + log ( 1 / θ ) ) ρ + 1 \theta^2(1+\log(1/\theta))^{\rho+1} θ 2 ( 1 + log ( 1/ θ ) ) ρ + 1 , or θ r ( 1 + log ( 1 / θ ) ) ρ \theta^r(1+\log(1/\theta))^\rho θ r ( 1 + log ( 1/ θ ) ) ρ in the three regimes. Centering gives the one-step bound
P exp ( − λ d u ) ≤ exp ( C u ψ r ( θ ) ) . \mathcal{P}\exp(-\lambda d_u)\leq\exp(Cu\psi_r(\theta)). P exp ( − λ d u ) ≤ exp ( C u ψ r ( θ )) .
Transferring the earliest factor by P [ H ( g ∘ F ) ] = ( P H ) g \mathcal{P}[H(g\circ F)]=(\mathcal{P}H)g P [ H ( g ∘ F )] = ( P H ) g gives, inductively,
P n exp ( − λ ∑ j < n d u ∘ F j ) ≤ exp ( C n u ψ r ( θ ) ) . \mathcal{P}^n\exp\left(-\lambda\sum_{j<n}d_u\circ F^j\right)\leq\exp(Cnu\psi_r(\theta)). P n exp ( − λ j < n ∑ d u ∘ F j ) ≤ exp ( C n u ψ r ( θ )) .
On the lower event, the sum in this exponential is at most − ε n m u + 2 ∥ χ u ∥ ∞ ≤ − ε n m u / 2 -\varepsilon nm_u+2\|\chi_u\|_\infty\leq-\varepsilon nm_u/2 − ε n m u + 2∥ χ u ∥ ∞ ≤ − ε n m u /2 for large n n n . Positivity bounds its endpoint probability by exp [ − λ ε n m u / 2 + C n u ψ r ( θ ) ] \exp[-\lambda\varepsilon nm_u/2+Cnu\psi_r(\theta)] exp [ − λ ε n m u /2 + C n u ψ r ( θ )] . Since m u / ( u a u ) m_u/(ua_u) m u / ( u a u ) is bounded below positively and ψ r ( θ ) / θ → 0 \psi_r(\theta)/\theta\to0 ψ r ( θ ) / θ → 0 , choosing θ \theta θ sufficiently small proves (41) . Integration and invariance give (42) for every deterministic start. Only the negative exponential moment is used.
Lemma 8.4 (Stopped long rewards). For u < 1 / 2 u<1/2 u < 1/2 , integer L ≥ 1 L\geq1 L ≥ 1 , put A u , L = { V u ≥ L } A_{u,L}=\{V_u\geq L\} A u , L = { V u ≥ L } and p u , L = ν ( A u , L ) p_{u,L}=\nu(A_{u,L}) p u , L = ν ( A u , L ) . Then
p u , L ≍ E q L − 1 ( u ) , ∥ P 1 A u , L ∥ B V ( Y ) ≤ C p u , L . p_{u,L}\asymp\mathbb{E}q_{L-1}(u),\qquad\|\mathcal{P}\mathbf{1}_{A_{u,L}}\|_{BV(Y)}\leq Cp_{u,L}. p u , L ≍ E q L − 1 ( u ) , ∥ P 1 A u , L ∥ B V ( Y ) ≤ C p u , L . The transferred indicator depends only on the base coordinate. For any deterministic choices u j , L j u_j,L_j u j , L j , if E j = F − j A u j , L j E_j=F^{-j}A_{u_j,L_j} E j = F − j A u j , L j and p j = ν ( E j ) p_j=\nu(E_j) p j = ν ( E j ) , then
∣ ν ( E i ∩ E j ) − p i p j ∣ ≤ C p i p j ϑ j − i − 1 , Var ∑ j = 1 m 1 E j ≤ C ∑ j = 1 m p j . \left|\nu(E_i\cap E_j)-p_ip_j\right|\leq Cp_ip_j\vartheta^{j-i-1},\qquad\operatorname{Var}\sum_{j=1}^{m}\mathbf{1}_{E_j}\leq C\sum_{j=1}^{m}p_j. ∣ ν ( E i ∩ E j ) − p i p j ∣ ≤ C p i p j ϑ j − i − 1 , Var j = 1 ∑ m 1 E j ≤ C j = 1 ∑ m p j .
Proof. The right landing must be at most the inverse threshold q L − 1 ( u ) q_{L-1}(u) q L − 1 ( u ) formed from the next L − 1 L-1 L − 1 left symbols. Since h ^ \hat{h} h ^ is uniformly positive and bounded, integration over [ 1 / 2 , ( 1 + q L − 1 ( u ) ) / 2 ] [1/2,(1+q_{L-1}(u))/2] [ 1/2 , ( 1 + q L − 1 ( u )) /2 ] proves the probability comparison. All these L L L observations occur before return, and τ ≥ L + 1 \tau\ge L+1 τ ≥ L + 1 on the event. Hence the observable is determined by the consumed word; testing its stopped transfer against an unused-suffix cylinder separates the iid suffix factor and proves the base-only assertion.
For a fixed infinite word, all selected full return atoms use the same threshold q L − 1 ( u ) q_{L-1}(u) q L − 1 ( u ) . The endpoint-ratio argument in Lemma 8.2 puts their whole right-landing intervals in [ 0 , C α q L − 1 ( u ) ] [0,C\alpha q_{L-1}(u)] [ 0 , C α q L − 1 ( u )] . Their union therefore has length at most C q L − 1 ( u ) Cq_{L-1}(u) C q L − 1 ( u ) , before averaging the partition. On each atom the event indicator has variation at most one. The branch product bound, and division by the positive Lipschitz h ^ \hat{h} h ^ , give the asserted BV estimate. Transfer the earlier event once, apply the base gap for the remaining j − i − 1 j-i-1 j − i − 1 returns, and integrate the resulting uniform error against the later event. Its mean supplies p j p_j p j , even though that event depends on future symbols. Summing covariances proves the variance bound.
Moving Laplace transforms and lower deviations. The exact critical lower envelope requires a matching conditional deviation exponent, rather than only an exponential upper bound. The weighted operators below use a different target at each return. We control their ordered products and the resulting conditional terminal laws; a spectral estimate for a single fixed target would not supply this uniformity. Put k B = h ^ ( 1 / 2 ) / 2 k_B=\hat{h}(1/2)/2 k B = h ^ ( 1/2 ) /2 ; the occupation identity gives c ˉ = k B / γ \bar{c}=k_B/\gamma c ˉ = k B / γ .
Lemma 8.5 (Critical lower deviations). Suppose u n = c log log n / n u_n=c\log\log n/n u n = c log log n / n eventually, with a positive finite prefix. Put I N = N u N I_N=Nu_N I N = N u N , a N = a u N a_N=au_N a N = a u N , and fix λ > 0 \lambda>0 λ > 0 , integers a ≥ 1 a\ge1 a ≥ 1 , b 0 b_0 b 0 , and deterministic j N ≥ 0 j_N\ge0 j N ≥ 0 with j N = o ( N ) j_N=o(N) j N = o ( N ) . Define
v j = u ⌊ λ j ⌋ + a , n N = max { 0 , ⌊ N / λ ⌋ + b 0 } , S N = ∑ j = j N n N − 1 v v j ∘ F j − j N . v_j=u_{\lfloor\lambda j\rfloor+a}, \qquad n_N=\max\{0,\lfloor N/\lambda\rfloor+b_0\}, \qquad S_N=\sum_{j=j_N}^{n_N-1} v_{v_j}\circ F^{j-j_N}. v j = u ⌊ λj ⌋ + a , n N = max { 0 , ⌊ N / λ ⌋ + b 0 } , S N = j = j N ∑ n N − 1 v v j ∘ F j − j N . The limits below hold uniformly outside a null set of terminal base coordinates with respect to h ^ ( y ) d y \hat{h}(y)\,dy h ^ ( y ) d y ; the stopped-transfer kernel constructed in the proof gives their base-valued representatives. For each fixed θ ≥ 0 \theta\ge0 θ ≥ 0 ,
1 I N log ( P n N − j N e − θ S N / a N ) ⟶ Φ λ ( θ ) = − k B λ α H r ( θ D ∗ ) . (43) \frac{1}{I_N}\log\left(\mathbb{P}^{n_N-j_N}e^{-\theta S_N/a_N}\right)\longrightarrow\Phi_\lambda(\theta)=-\frac{k_B}{\lambda\alpha}H_r(\theta D_*). \tag*{(43)} I N 1 log ( P n N − j N e − θ S N / a N ) ⟶ Φ λ ( θ ) = − λ α k B H r ( θ D ∗ ) . (43) For every 0 < x < γ / λ 0<x<\gamma/\lambda 0 < x < γ / λ ,
1 I N log ( P n N − j N 1 S N ≤ x M N ) ⟶ − J λ ( x ) , J λ ( x ) = k B λ α h r ( x λ / γ ) . (44) \frac{1}{I_N}\log\left(\mathbb{P}^{n_N-j_N}\mathbf{1}_{S_N\le xM_N}\right)\longrightarrow-J_\lambda(x), \qquad J_\lambda(x)=\frac{k_B}{\lambda\alpha}h_r(x\lambda/\gamma). \tag*{(44)} I N 1 log ( P n N − j N 1 S N ≤ x M N ) ⟶ − J λ ( x ) , J λ ( x ) = λ α k B h r ( x λ / γ ) . (44) Proof. We first estimate one weighted return operator in the strong BV norm. We then control the ordered product for the changing radii, including its terminal density. Finally, exponential tilting gives the matching conditional lower bound.
The weighted return operator. For a BV base input define A u , θ f = P ( e − θ v u / a u f ) \mathcal{A}_{u,\theta}f=\mathcal{P}(e^{-\theta v_u/a_u}f) A u , θ f = P ( e − θ v u / a u f ) . The multiplier uses only the consumed return word, so this operator is base-valued. On each complete return cell with nonzero reward, the multiplier minus one has sup norm and variation at most one. The geometry in Lemma 8.2 places these whole cells in B C α u B_{C\alpha u} B C α u . Their total and maximum lengths are at most C u Cu C u . Fix the environment first and let I u \mathcal{I}_u I u be these disjoint return cells. The branch product bound for an arbitrary BV input is C ∣ I ∣ ( ∥ f ∥ ∞ + Var I f ) C|I|(\|f\|_\infty+\operatorname{Var}_I f) C ∣ I ∣ ( ∥ f ∥ ∞ + Var I f ) . Consequently,
∑ I ∈ I u ∣ I ∣ ( ∥ f ∥ ∞ + Var I f ) ≤ ( ∑ I ∈ I u ∣ I ∣ ) ∥ f ∥ ∞ + ( sup I ∈ I u ∣ I ∣ ) Var f ≤ C u ∥ f ∥ B V . \sum_{I\in\mathcal{I}_u}|I|(\|f\|_\infty+\operatorname{Var}_I f)
\le\left(\sum_{I\in\mathcal{I}_u}|I|\right)\|f\|_\infty+
\left(\sup_{I\in\mathcal{I}_u}|I|\right)\operatorname{Var} f
\le Cu\|f\|_{BV}. I ∈ I u ∑ ∣ I ∣ ( ∥ f ∥ ∞ + Var I f ) ≤ ( I ∈ I u ∑ ∣ I ∣ ) ∥ f ∥ ∞ + ( I ∈ I u sup ∣ I ∣ ) Var f ≤ C u ∥ f ∥ B V .
Here disjointness is used only within the fixed-environment partition; we average the resulting bound afterwards. Conjugating by the positive Lipschitz density h ^ \hat{h} h ^ , bounded away from zero, changes only the constant. Thus the estimate is in the strong BV norm and gives
∥ A u , θ − P ∥ B V → B V ≤ C u , θ ≥ 0. (45) \lVert\mathcal{A}_{u,\theta}-\mathcal{P}\rVert_{BV\to BV}\le Cu,\qquad\theta\ge0. \tag*{(45)} ∥ A u , θ − P ∥ B V → B V ≤ C u , θ ≥ 0. (45)
The compact inverse profile (33) and its integrable tail bound give, under ν \nu ν ,
ν ( V u > t a u ) u → k B ( 1 + t / D ∗ ) − r ( t > 0 ) , m u u a u → k B D ∗ r − 1 . \frac{\nu(V_u>t a_u)}{u}\to k_B(1+t/D_*)^{-r}\quad(t>0),\qquad\frac{m_u}{u a_u}\to\frac{k_BD_*}{r-1}. u ν ( V u > t a u ) → k B ( 1 + t / D ∗ ) − r ( t > 0 ) , u a u m u → r − 1 k B D ∗ .
Indeed the entrance interval for V u > t a u V_u>t a_u V u > t a u has length q ⌊ t a u ⌋ ( u ) / 2 q_{\lfloor t a_u\rfloor}(u)/2 q ⌊ t a u ⌋ ( u ) /2 , up to a one-step endpoint change; h ^ \hat{h} h ^ is Lipschitz at 1 / 2 1/2 1/2 . Averaging the profile and integrating its uniformly integrable tail proves both assertions. Let W W W have tail ( 1 + t / D ∗ ) − r (1+t/D_*)^{-r} ( 1 + t / D ∗ ) − r , and set ℓ ( θ ) = E e − θ W − 1 \ell(\theta)=\mathbb{E}e^{-\theta W}-1 ℓ ( θ ) = E e − θ W − 1 . Layer cake and the mean bound imply u − 1 ν ( e − θ V u / a u − 1 ) → k B ℓ ( θ ) u^{-1}\nu(e^{-\theta V_u/a_u}-1)\to k_B\ell(\theta) u − 1 ν ( e − θ V u / a u − 1 ) → k B ℓ ( θ ) , uniformly on compact θ \theta θ -intervals.
The base gap in Proposition 2.1 and the strong-norm bound permit a resolvent Neumann series on fixed separating contours. Writing Π f = ν ( f ) 1 \Pi f=\nu(f)1 Π f = ν ( f ) 1 on base functions, the resulting eigenvalue and projection satisfy, with projection error in B V → B V BV\to BV B V → B V ,
η u , θ = 1 + ν ( e − θ V u / a u − 1 ) + O ( u 2 ) , Π u , θ = Π + O ( u ) . \eta_{u,\theta}=1+\nu(e^{-\theta V_u/a_u}-1)+O(u^2),\qquad\Pi_{u,\theta}=\Pi+O(u). η u , θ = 1 + ν ( e − θ V u / a u − 1 ) + O ( u 2 ) , Π u , θ = Π + O ( u ) .
For the first formula, normalize the right eigenfunction g u , θ g_{u,\theta} g u , θ to have ν \nu ν -mean one; it equals 1 + O ( u ) 1+O(u) 1 + O ( u ) in BV. Since ν ∘ P = ν \nu\circ\mathcal{P}=\nu ν ∘ P = ν and ν ( g u , θ − 1 ) = 0 \nu(g_{u,\theta}-1)=0 ν ( g u , θ − 1 ) = 0 , applying ν \nu ν to the eigen-equation gives
η u , θ = ν ( A u , θ 1 ) + ν ( ( A u , θ − P ) ( g u , θ − 1 ) ) = 1 + ν ( e − θ V u / a u − 1 ) + O ( u 2 ) , \eta_{u,\theta}=\nu(\mathcal{A}_{u,\theta}1)+\nu((\mathcal{A}_{u,\theta}-\mathcal{P})(g_{u,\theta}-1))=1+\nu(e^{-\theta V_u/a_u}-1)+O(u^2), η u , θ = ν ( A u , θ 1 ) + ν (( A u , θ − P ) ( g u , θ − 1 )) = 1 + ν ( e − θ V u / a u − 1 ) + O ( u 2 ) ,
by (45) . The remaining powers are bounded by C ρ k C\rho^k C ρ k , ρ < 1 \rho<1 ρ < 1 , uniformly. Since Π u , θ 1 = 1 + O ( u ) > 0 \Pi_{u,\theta}1=1+O(u)>0 Π u , θ 1 = 1 + O ( u ) > 0 , the relative error is O ( ( ρ / η u , θ ) k ) O((\rho/\eta_{u,\theta})^k) O (( ρ / η u , θ ) k ) . Hence, when k u → ∞ ku\to\infty k u → ∞ ,
( k u ) − 1 log ( A u , θ k 1 ) → k B ℓ ( θ ) (ku)^{-1}\log(\mathcal{A}_{u,\theta}^k1)\to k_B\ell(\theta) ( k u ) − 1 log ( A u , θ k 1 ) → k B ℓ ( θ )
uniformly at endpoints and on compact tilt intervals.
Ordered products for moving rewards. For B j f = P ( e − θ V v j / a N f ) \mathcal{B}_j f=\mathcal{P}(e^{-\theta V_{v_j}/a_N}f) B j f = P ( e − θ V v j / a N f ) , the transfer identity gives the ordered product
P n N − j N e − θ S N / a N = B n N − 1 ⋯ B j N 1. \mathcal{P}^{n_N-j_N}e^{-\theta S_N/a_N}=\mathcal{B}_{n_N-1}\cdots\mathcal{B}_{j_N}1. P n N − j N e − θ S N / a N = B n N − 1 ⋯ B j N 1.
Fix a finite partition of [ δ , 1 ] [\delta,1] [ δ , 1 ] . On the indices belonging to each partition interval, bracket the moving rewards by the radii at the two endpoints of that interval, keeping the single denominator a N a_N a N . For a frozen radius at fraction t t t , a u ⌊ t N ⌋ / a N → t α a_{u_{\lfloor tN\rfloor}}/a_N\to t^\alpha a u ⌊ tN ⌋ / a N → t α , and block length times radius tends to infinity. For each block product T i T_i T i , frozen transfer powers bound L i 1 ≤ T i 1 ≤ U i 1 L_i1\le T_i1\le U_i1 L i 1 ≤ T i 1 ≤ U i 1 . Positivity then gives
( ∏ i L i ) 1 ≤ T m ⋯ T 1 1 ≤ ( ∏ i U i ) 1. \left(\prod_i L_i\right)1\le T_m\cdots T_1 1\le\left(\prod_i U_i\right)1. ( i ∏ L i ) 1 ≤ T m ⋯ T 1 1 ≤ ( i ∏ U i ) 1.
Thus the factors need not commute. First let N → ∞ N\to\infty N → ∞ for fixed δ \delta δ and partition, then refine that partition. This gives ( k B / λ ) ∫ δ 1 ℓ ( θ t α ) d t / t (k_B/\lambda)\int_\delta^1\ell(\theta t^\alpha)\,dt/t ( k B / λ ) ∫ δ 1 ℓ ( θ t α ) d t / t . For m = ⌊ δ N / λ ⌋ m=\lfloor\delta N/\lambda\rfloor m = ⌊ δ N / λ ⌋ , conditional Jensen and (38) bound the early transform below by
P m − j N exp ( − θ a N ∑ j = j N m − 1 V v j ∘ F j − j N ) ≥ exp ( − C θ a N ∑ j < m m v j ) . \mathcal{P}^{m-j_N}\exp\left(-\frac{\theta}{a_N}\sum_{j=j_N}^{m-1}V_{v_j}\circ\mathcal{F}^{j-j_N}\right)\ge\exp\left(-\frac{C\theta}{a_N}\sum_{j<m}m_{v_j}\right). P m − j N exp ( − a N θ j = j N ∑ m − 1 V v j ∘ F j − j N ) ≥ exp ( − a N C θ j < m ∑ m v j ) .
Its upper bound is one. Karamata makes this logarithmic error, divided by I N I_N I N , at most C θ δ α + o ( 1 ) C\theta\delta^\alpha+o(1) C θ δ α + o ( 1 ) . Here each mean is transferred by P m − j \mathcal{P}^{m-j} P m − j with m − j ≥ 1 m-j\ge1 m − j ≥ 1 , so the bound (38) applies. The same holds for j N = o ( N ) j_N=o(N) j N = o ( N ) . Let δ ↓ 0 \delta\downarrow0 δ ↓ 0 . Tonelli gives ∫ 0 1 ℓ ( θ t α ) d t / t = − H r ( θ D ∗ ) / α \int_0^1\ell(\theta t^\alpha)\,\mathrm{d}t/t=-H_r(\theta D_*)/\alpha ∫ 0 1 ℓ ( θ t α ) d t / t = − H r ( θ D ∗ ) / α , proving (43) .
Conditional kernels and exponential tilting. For completeness the stopped transfer defines an actual conditional probability kernel. With K K K returns, sum over total consumed lengths n ≥ K n\ge K n ≥ K , integrate their words against π n \pi^n π n , and sum over complete K K K -return inverse cells ψ I \psi_I ψ I , using weights
h ^ ( ψ I ( y ) ) ∣ ψ I ′ ( y ) ∣ h ^ ( y ) . \frac{\widehat{h}(\psi_I(y))\lvert\psi_I'(y)\rvert}{\widehat{h}(y)}. h ( y ) h ( ψ I ( y )) ∣ ψ I ′ ( y )∣ .
They sum to P 1 K ( y ) = 1 \mathcal{P}^{K}_1(y)=1 P 1 K ( y ) = 1 . The unused iid suffix is independent, so every Borel event of the consumed rewards has this base-valued kernel.
Write X N = S N / ( I N a N ) X_N=S_N/(I_Na_N) X N = S N / ( I N a N ) and Φ = Φ λ \Phi=\Phi_\lambda Φ = Φ λ . Since H r H_r H r is concave and H r ′ H'_r H r ′ decreases strictly from 1 / ( r − 1 ) 1/(r-1) 1/ ( r − 1 ) to zero, Φ \Phi Φ is convex and s θ = − Φ ′ ( θ ) s_\theta=-\Phi'(\theta) s θ = − Φ ′ ( θ ) decreases continuously from s 0 = k B D ∗ / [ λ α ( r − 1 ) ] s_0=k_BD_*/[\lambda\alpha(r-1)] s 0 = k B D ∗ / [ λ α ( r − 1 )] to zero. For the upper bound, exponential Markov gives, for every θ ≥ 0 \theta\ge0 θ ≥ 0 and s > 0 s>0 s > 0 ,
P n N − j N 1 X N ≤ s ≤ e θ s I N P n N − j N e − θ S N / a N , \mathcal{P}^{n_N-j_N}\mathbf{1}_{X_N\le s}\le e^{\theta sI_N}\mathcal{P}^{n_N-j_N}e^{-\theta S_N/a_N}, P n N − j N 1 X N ≤ s ≤ e θ s I N P n N − j N e − θ S N / a N ,
so (41) yields lim sup I N − 1 log P n N − j N 1 X N ≤ s ≤ − sup θ ≥ 0 { − θ s − Φ ( θ ) } \limsup I_N^{-1}\log\mathcal{P}^{n_N-j_N}\mathbf{1}_{X_N\le s}\le-\sup_{\theta\ge0}\{-\theta s-\Phi(\theta)\} lim sup I N − 1 log P n N − j N 1 X N ≤ s ≤ − sup θ ≥ 0 { − θ s − Φ ( θ )} . For the lower bound fix θ > 0 \theta>0 θ > 0 and ϵ > 0 \epsilon>0 ϵ > 0 , and let Q N \mathbb{Q}_N Q N be the kernel tilted by e − θ S N / a N / P n N − j N e − θ S N / a N e^{-\theta S_N/a_N}/\mathcal{P}^{n_N-j_N}e^{-\theta S_N/a_N} e − θ S N / a N / P n N − j N e − θ S N / a N . For 0 < z < θ 0<z<\theta 0 < z < θ , exponential Markov under Q N \mathbb{Q}_N Q N and (41) at θ \theta θ and θ − z \theta-z θ − z give
lim sup N → ∞ 1 I N log Q N ( X N > s θ + ϵ ) ≤ Φ ( θ − z ) − Φ ( θ ) − z ( s θ + ϵ ) . \limsup_{N\to\infty}\frac{1}{I_N}\log\mathbb{Q}_N(X_N>s_\theta+\epsilon)\le\Phi(\theta-z)-\Phi(\theta)-z(s_\theta+\epsilon). N → ∞ lim sup I N 1 log Q N ( X N > s θ + ϵ ) ≤ Φ ( θ − z ) − Φ ( θ ) − z ( s θ + ϵ ) .
and similarly, for z > 0 z>0 z > 0 ,
lim sup N → ∞ 1 I N log Q N ( X N < s θ − ϵ ) ≤ Φ ( θ + z ) − Φ ( θ ) + z ( s θ − ϵ ) . \limsup_{N\to\infty}\frac{1}{I_N}\log\mathbb{Q}_N(X_N<s_\theta-\epsilon)\le\Phi(\theta+z)-\Phi(\theta)+z(s_\theta-\epsilon). N → ∞ lim sup I N 1 log Q N ( X N < s θ − ϵ ) ≤ Φ ( θ + z ) − Φ ( θ ) + z ( s θ − ϵ ) .
Since Φ ( θ ∓ z ) − Φ ( θ ) = ± z s θ + o ( z ) \Phi(\theta\mp z)-\Phi(\theta)=\pm zs_\theta+o(z) Φ ( θ ∓ z ) − Φ ( θ ) = ± z s θ + o ( z ) , both bounds are negative for small z z z ; hence Q N ( ∣ X N − s θ ∣ ≤ ϵ ) → 1 \mathbb{Q}_N(\lvert X_N-s_\theta\rvert\le\epsilon)\to1 Q N (∣ X N − s θ ∣ ≤ ϵ ) → 1 uniformly in the terminal coordinate. Undoing the tilt on this event,
P n N − j N 1 X N ≤ s θ + ϵ ≥ e θ ( s θ − ϵ ) I N ( P n N − j N e − θ S N / a N ) Q N ( ∣ X N − s θ ∣ ≤ ϵ ) , \mathcal{P}^{n_N-j_N}\mathbf{1}_{X_N\le s_\theta+\epsilon}\ge e^{\theta(s_\theta-\epsilon)I_N}\left(\mathcal{P}^{n_N-j_N}e^{-\theta S_N/a_N}\right)\mathbb{Q}_N(\lvert X_N-s_\theta\rvert\le\epsilon), P n N − j N 1 X N ≤ s θ + ϵ ≥ e θ ( s θ − ϵ ) I N ( P n N − j N e − θ S N / a N ) Q N (∣ X N − s θ ∣ ≤ ϵ ) ,
so lim inf I N − 1 log P n N − j N 1 X N ≤ s θ + ϵ ≥ Φ ( θ ) + θ s θ − θ ϵ \liminf I_N^{-1}\log\mathcal{P}^{n_N-j_N}\mathbf{1}_{X_N\le s_\theta+\epsilon}\ge\Phi(\theta)+\theta s_\theta-\theta\epsilon lim inf I N − 1 log P n N − j N 1 X N ≤ s θ + ϵ ≥ Φ ( θ ) + θ s θ − θ ϵ . By convexity, − Φ ( θ ) − θ s θ = sup θ ′ ≥ 0 { − θ ′ s θ − Φ ( θ ′ ) } -\Phi(\theta)-\theta s_\theta=\sup_{\theta'\ge0}\{-\theta's_\theta-\Phi(\theta')\} − Φ ( θ ) − θ s θ = sup θ ′ ≥ 0 { − θ ′ s θ − Φ ( θ ′ )} . Given s ∈ ( 0 , s 0 ) s\in(0,s_0) s ∈ ( 0 , s 0 ) and small ϵ > 0 \epsilon>0 ϵ > 0 , choose the unique θ > 0 \theta>0 θ > 0 with s θ = s − ϵ s_\theta=s-\epsilon s θ = s − ϵ . Letting ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 and using continuity of the rate in s s s shows that the two bounds agree, with rate sup θ ≥ 0 { − θ s − Φ ( θ ) } \sup_{\theta\ge0}\{-\theta s-\Phi(\theta)\} sup θ ≥ 0 { − θ s − Φ ( θ )} on ( 0 , s 0 ) (0,s_0) ( 0 , s 0 ) . All Laplace arguments remain nonnegative; no positive exponential moment of W W W is required. Finally M N / ( I N a N ) → k B D ∗ / [ γ α ( r − 1 ) ] M_N/(I_Na_N)\to k_BD_*/[\gamma\alpha(r-1)] M N / ( I N a N ) → k B D ∗ / [ γ α ( r − 1 )] , so the threshold is s = x k B D ∗ / [ γ α ( r − 1 ) ] s=xk_BD_*/[\gamma\alpha(r-1)] s = x k B D ∗ / [ γ α ( r − 1 )] . Substituting q = θ D ∗ q=\theta D_* q = θ D ∗ in the supremum gives J λ ( x ) J_\lambda(x) J λ ( x ) , precisely for 0 < x < γ / λ 0<x<\gamma/\lambda 0 < x < γ / λ . Bracket the convergent deterministic threshold and use continuity of the rate to obtain (42). □
Proof of Theorems 1.2 and 1.3. Lemma 8.1 proves all normalization assertions. It remains to estimate the physical counts. First assume eventual monotonicity of the radii. We transfer concentration to the physical clock, use long rewards and survival for the two failure regimes, and separate L 1 L^1 L 1 convergence from the finer lower envelopes. The matching conditional rate identifies the critical constant. Finally, comparison with smooth schedules removes monotonicity from the general assertions, and continuity transfers the critical constant to asymptotically equivalent schedules.
Strong laws and the physical clock
Fix a > 1 a>1 a > 1 and N k = ⌊ a k ⌋ N_k=\lfloor a^k\rfloor N k = ⌊ a k ⌋ . Uniform convergence for I ( x ) = x u ( x ) I(x)=xu(x) I ( x ) = xu ( x ) , of index 1 − g 1-g 1 − g , shows that J ( u ) < ∞ J(u)<\infty J ( u ) < ∞ if and only if
∑ k I N k − ζ < ∞ . (46) \sum_k I_{N_k}^{-\zeta}<\infty. \tag*{(46)} k ∑ I N k − ζ < ∞. (46)
For g < 1 g<1 g < 1 , Potter bounds imply convergence. In general, convergence implies I n → ∞ I_n\to\infty I n → ∞ , first on the grid, then between its points by uniform convergence. Choose the deviation exponent Λ ≥ ζ \Lambda\ge\zeta Λ ≥ ζ : the remainder I N k − Λ I_{N_k}^{-\Lambda} I N k − Λ is dominated by the same summable series. At any fixed return-index multiple and neighboring endpoint radius, n u ≍ I N k nu\asymp I_{N_k} n u ≍ I N k and log ( n u ) / log ( 1 / u ) \log(nu)/\log(1/u) log ( n u ) / log ( 1/ u ) tends to ( 1 − g ) / g (1-g)/g ( 1 − g ) / g , or zero at g = 1 g=1 g = 1 . Thus a fixed H H H permits (37)–(38) on all these grids. Throughout the proof, λ \lambda λ and Λ ± \Lambda_{\pm} Λ ± denote numbers of physical steps per return, to be compared with the mean return γ \gamma γ . Apply the deviation bounds at every return index ⌊ N k / λ ⌋ \lfloor N_k/\lambda\rfloor ⌊ N k / λ ⌋ , λ > 0 \lambda>0 λ > 0 rational, and both neighboring endpoint radii, on countably many grids a ↓ 1 a\downarrow1 a ↓ 1 . First Borel–Cantelli gives centered-sum and maximum-reward errors tending to zero relative to N k m u N_k m_u N k m u . For rational Λ − < γ < Λ + \Lambda_-<\gamma<\Lambda_+ Λ − < γ < Λ + , the return clock sandwiches the random return index K N k K_{N_k} K N k between N k / Λ + N_k/\Lambda_+ N k / Λ + and N k / Λ − N_k/\Lambda_- N k / Λ − . The unfinished excursion is bounded by one further reward using (38). Letting Λ ± → γ \Lambda_{\pm}\to\gamma Λ ± → γ proves for the frozen physical count H N ( u ) = ∑ n = 1 N 1 [ 0 , u ] ( T n ω ) H_N(u)=\sum_{n=1}^N1_{[0,u]}(T^n\omega) H N ( u ) = ∑ n = 1 N 1 [ 0 , u ] ( T n ω ) that H N k ( u ) ∼ N k μ ˉ ( [ 0 , u ] ) H_{N_k}(u)\sim N_k\bar\mu([0,u]) H N k ( u ) ∼ N k μ ˉ ([ 0 , u ]) . For each block ( N k , N k + 1 ] (N_k,N_{k+1}] ( N k , N k + 1 ] , these estimates hold at both times N k , N k + 1 N_k,N_{k+1} N k , N k + 1 for each radius u N k , u N k + 1 u_{N_k},u_{N_{k+1}} u N k , u N k + 1 , on the countable grids just specified.
Every positive initial point enters Y Y Y in finite time since T s ≥ T B T_s\ge T_B T s ≥ T B below Y Y Y . An absolutely continuous initial law has an absolutely continuous base-entry distribution and unused iid future, so it inherits the ν \nu ν -full event. Include its finite entry offset in T j T_j T j ; the frozen count changes by only finitely many observations. Eventual monotonicity of the radii gives
H N k + 1 ( u N k + 1 ) − H N k ( u N k + 1 ) ≤ C N k + 1 − C N k ≤ H N k + 1 ( u N k ) − H N k ( u N k ) . H_{N_{k+1}}(u_{N_{k+1}})-H_{N_k}(u_{N_{k+1}})\le C_{N_{k+1}}-C_{N_k}
\le H_{N_{k+1}}(u_{N_k})-H_{N_k}(u_{N_k}). H N k + 1 ( u N k + 1 ) − H N k ( u N k + 1 ) ≤ C N k + 1 − C N k ≤ H N k + 1 ( u N k ) − H N k ( u N k ) .
The four frozen-count errors are o ( N k w ( u N k ) ) o(N_kw(u_{N_k})) o ( N k w ( u N k )) . Summing them is o ( M N K ) o(M_{N_K}) o ( M N K ) : Potter bounds with positive exponent 1 − ξ 1-\xi 1 − ξ dominate past normalized scales by a summable geometric sequence, while their relative errors vanish. The two frozen mass sums bracket M N K M_{N_K} M N K ; their relative difference is O ( a ξ − 1 ) + o ( 1 ) O(a^\xi-1)+o(1) O ( a ξ − 1 ) + o ( 1 ) , by regular variation of μ ˉ ( [ 0 , u ] ) ∼ C ∗ w ( u ) \bar\mu([0,u])\sim C_*w(u) μ ˉ ([ 0 , u ]) ∼ C ∗ w ( u ) . Let a ↓ 1 a\downarrow1 a ↓ 1 . Increasing-count interpolation and regular variation of M N M_N M N give C N / M N → 1 C_N/M_N\to1 C N / M N → 1 for all N N N .
Deep entrances and infinite upper limits
For any choices in Lemma 8.4 with ∑ j p j = ∞ \sum_jp_j=\infty ∑ j p j = ∞ , choose consecutive blocks with expected counts at least C 2 k C2^k C 2 k . By the variance bound of that lemma and Chebyshev’s inequality, the events D k D_k D k that a block contains some E j E_j E j satisfy ν ( D k c ) ≤ 2 − k \nu(D_k^c)\le2^{-k} ν ( D k c ) ≤ 2 − k . The first Borel–Cantelli lemma gives infinitely many E j E_j E j , almost surely.
Suppose g = 1 g=1 g = 1 , J ( u ) = ∞ J(u)=\infty J ( u ) = ∞ and I n → ∞ I_n\to\infty I n → ∞ . Fix D > γ D>\gamma D > γ and integer K ≥ 1 K\ge1 K ≥ 1 . Set n j = ⌊ 2 D j ˉ ⌋ n_j=\lfloor2D\bar j\rfloor n j = ⌊ 2 D j ˉ ⌋ , L j = ⌈ K M n j ⌉ L_j=\lceil K M_{n_j}\rceil L j = ⌈ K M n j ⌉ , and E j = F u n j , L j − 1 E_j=F^{-1}_{u_{n_j},L_j} E j = F u n j , L j − 1 . Then L j / a u n j → ∞ L_j/a_{u_{n_j}}\to\infty L j / a u n j → ∞ and log L j ≍ log n j \log L_j\asymp\log n_j log L j ≍ log n j . Thus (32) applies. Its averaged version follows from the band [ α , α + 1 / log L j ] [\alpha,\alpha+1/\log L_j] [ α , α + 1/ log L j ] : on its good event the normalized inverse threshold is bounded. On the exceptional event, it is at most u n j L j r / b ( log L j ) r u_{n_j}L_j^r/b(\log L_j)^r u n j L j r / b ( log L j ) r , whose product with the probability bound C e − c L j / b ( log L j ) Ce^{-cL_j/b(\log L_j)} C e − c L j / b ( l o g L j ) tends to zero. Lemma 8.4 therefore gives
p j ≳ L j − r b ( log L j ) r ≍ 1 j L ( j ) ζ . p_j\gtrsim L_j^{-r}b(\log L_j)^r\asymp\frac{1}{jL(j)^\zeta}. p j ≳ L j − r b ( log L j ) r ≍ j L ( j ) ζ 1 .
Indeed b ( log L j ) / b ( log n j ) → α κ 0 b(\log L_j)/b(\log n_j)\to\alpha^{\kappa_0} b ( log L j ) / b ( log n j ) → α κ 0 : the slowly varying factors contributed by the parameter law to the mean and to the reward tail cancel. Uniform convergence compares this series with J ( u ) J(u) J ( u ) , so it diverges. For logarithmic schedules with − 1 ≤ κ ≤ 0 -1\le\kappa\le0 − 1 ≤ κ ≤ 0 , the compact profile (31), bounded by q / u ≤ 1 q/u\le1 q / u ≤ 1 , instead gives p j ≍ u n j ≍ j − 1 ( log j ) κ p_j\asymp u_{n_j}\asymp j^{-1}(\log j)^\kappa p j ≍ u n j ≍ j − 1 ( log j ) κ , also divergent: L j / a u n j L_j/a_{u_{n_j}} L j / a u n j tends to a positive constant when κ = 0 \kappa= 0 κ = 0 , and tends to zero when − 1 ≤ κ < 0 -1 \le\kappa< 0 − 1 ≤ κ < 0 . In either case, since T j ≤ D j T_j \le D_j T j ≤ D j eventually and L j = o ( j ) L_j = o(j) L j = o ( j ) , T j + L j ≤ n j T_j + L_j \le n_j T j + L j ≤ n j . On E j E_j E j , the next L j L_j L j observations are below u n j u_{n_j} u n j ; monotonicity of the radii makes them actual moving-target hits. At N = T j + L j N = T_j + L_j N = T j + L j , C N ≥ L j ≥ K M n j ≥ K M N C_N \ge L_j \ge K M_{n_j} \ge K M_N C N ≥ L j ≥ K M n j ≥ K M N . Intersecting over integers K K K proves the infinite upper limit.
The annealed L 1 L^1 L 1 criterion
For g < 1 g < 1 g < 1 , the strong law just proved gives C N / M N → 1 C_N/M_N \to1 C N / M N → 1 in stationary probability. For g = 1 g = 1 g = 1 , Theorem 1.4 , proved below from the reward profiles, normalization and (45) , without using the present L 1 L^1 L 1 conclusion, gives this convergence when I N → ∞ I_N \to\infty I N → ∞ . In either case stationarity gives E ( C N / M N ) = 1 \mathbb{E}(C_N/M_N) = 1 E ( C N / M N ) = 1 , so the bounded negative part tends to zero and E ∣ C N / M N − 1 ∣ = 2 E ( 1 − C N / M N ) + → 0 \mathbb{E}|C_N/M_N - 1| = 2\mathbb{E}(1 - C_N/M_N)_+ \to0 E ∣ C N / M N − 1∣ = 2 E ( 1 − C N / M N ) + → 0 . Conversely, if I N I_N I N does not tend to infinity at g = 1 g = 1 g = 1 , there is a deterministic subsequence on which I N → ι < ∞ I_N \to\iota< \infty I N → ι < ∞ . The occupation theorem gives zero or the nondegenerate Z ι ( 1 ) Z_\iota(1) Z ι ( 1 ) , not the constant one, ruling out L 1 L^1 L 1 convergence. This argument covers nonmonotone radii.
The positive lower envelope
First suppose g = 1 g = 1 g = 1 and I n ≥ c 0 log log n I_n \ge c_0 \log\log n I n ≥ c 0 log log n eventually, where c 0 > 0 c_0 > 0 c 0 > 0 . Fix Λ − < γ < Λ + \Lambda_- < \gamma< \Lambda_+ Λ − < γ < Λ + with D = 2 / Λ + − 1 / Λ − > 0 D = 2/\Lambda_+ - 1/\Lambda_- > 0 D = 2/ Λ + − 1/ Λ − > 0 . At N k = 2 k N_k = 2^k N k = 2 k use a fixed number J J J of physical windows [ t i N k , 2 t i N k ] [t_iN_k, 2t_iN_k] [ t i N k , 2 t i N k ] , t i = 2 i − J t_i = 2^{i-J} t i = 2 i − J , 0 ≤ i < J 0 \le i < J 0 ≤ i < J . Their complete return segments are
s i = ⌈ t i N k / Λ − ⌉ , e i = ⌊ 2 t i N k / Λ + ⌋ , l i = e i − s i , v i = u ⌊ 2 t i N k ⌋ . s_i = \lceil t_iN_k/\Lambda_- \rceil,\qquad e_i = \lfloor2t_iN_k/\Lambda_+ \rfloor,\qquad l_i = e_i-s_i,\qquad v_i = u_{\lfloor2t_iN_k\rfloor}. s i = ⌈ t i N k / Λ − ⌉ , e i = ⌊ 2 t i N k / Λ + ⌋ , l i = e i − s i , v i = u ⌊ 2 t i N k ⌋ .
For large k k k , these return-index segments are disjoint and l i v i / I N k → D / 2 l_iv_i/I_{N_k} \to D/2 l i v i / I N k → D /2 . Define the low-reward events on [ s i , e i ) [s_i,e_i) [ s i , e i ) by E i = { ∑ j = s i e i − 1 V v i ∘ F j < l i m v i / 2 } E_i = \{\sum_{j=s_i}^{e_i-1} V_{v_i}\circ F^j < l_im_{v_i}/2\} E i = { ∑ j = s i e i − 1 V v i ∘ F j < l i m v i /2 } . Every later event is measurable at the earlier endpoint. Conditioning out the earliest event using (41) , then iterating over the disjoint segments, gives
ν ( ⋂ i < J E i ) ≤ exp ( − c 1 / 2 ∑ i < J l i v i ) ≤ exp ( − c 1 / 2 J D I N k / 4 ) . \nu\left(\bigcap_{i<J} E_i\right) \le\exp\left(-c_{1/2}\sum_{i<J}l_iv_i\right) \le\exp\left(-c_{1/2}JD I_{N_k}/4\right). ν ( i < J ⋂ E i ) ≤ exp ( − c 1/2 i < J ∑ l i v i ) ≤ exp ( − c 1/2 J D I N k /4 ) .
Since log log N k = log k + O ( 1 ) \log\log N_k = \log k + O(1) log log N k = log k + O ( 1 ) , choose J J J so that c 1 / 2 J D c 0 / 4 > 2 c_{1/2}JDc_0/4 > 2 c 1/2 J D c 0 /4 > 2 , before letting k → ∞ k \to\infty k → ∞ . First Borel–Cantelli makes at least one segment good for every large k k k . On the full-measure event where T j / j → γ T_j/j \to\gamma T j / j → γ , each complete segment lies inside its physical window; strict margins absorb any finite entry offset. The frozen radius then gives actual moving-target hits. Moreover,
l i m v i 2 M N k ⟶ α γ D 2 2 α − 1 t i α > 0. \frac{l_im_{v_i}}{2M_{N_k}} \longrightarrow\frac{\alpha\gamma D}{2}2^{\alpha-1}t_i^\alpha> 0. 2 M N k l i m v i ⟶ 2 α γ D 2 α − 1 t i α > 0.
The minimum over fixed J J J windows is positive. Increasing-count interpolation and M N k + 1 / M N k → 2 α M_{N_{k+1}}/M_{N_k} \to2^\alpha M N k + 1 / M N k → 2 α prove a positive lower envelope.
Suppose g = 1 g = 1 g = 1 and I n / log log n → ∞ I_n/\log\log n \to\infty I n / log log n → ∞ . This includes all logarithmic schedules with κ > 0 \kappa> 0 κ > 0 and all strong-law-threshold schedules in Theorem 1.3 . Fix a > 1 a > 1 a > 1 , put N k = ⌊ a k ⌋ N_k = \lfloor a^k \rfloor N k = ⌊ a k ⌋ , and choose rational Λ − < γ < Λ + \Lambda_- < \gamma< \Lambda_+ Λ − < γ < Λ + with a / Λ + > 1 / Λ − a/\Lambda_+ > 1/\Lambda_- a / Λ + > 1/ Λ − . The return-index segment from s k = ⌈ N k / Λ − ⌉ s_k = \lceil N_k/\Lambda_- \rceil s k = ⌈ N k / Λ − ⌉ through e k = ⌊ N k + 1 / Λ + ⌋ − 1 e_k = \lfloor N_{k+1}/\Lambda_+ \rfloor- 1 e k = ⌊ N k + 1 / Λ + ⌋ − 1 has length l k ≍ N k l_k \asymp N_k l k ≍ N k . Use (42) at radius u N k + 1 u_{N_{k+1}} u N k + 1 . Its failure probabilities are bounded by exp ( − c ε I N k ) \exp(-c_\varepsilon I_{N_k}) exp ( − c ε I N k ) . Since log log N k = log k + O ( 1 ) \log\log N_k = \log k + O(1) log log N k = log k + O ( 1 ) , the assumed intensity condition makes this bound at most k − 2 k^{-2} k − 2 eventually, hence summable. Eventually its reward sum is at least ( 1 − ε ) l k m u N k + 1 (1-\varepsilon)l_km_{u_{N_{k+1}}} ( 1 − ε ) l k m u N k + 1 . The clock gives T s k > N k T_{s_k} > N_k T s k > N k , T e k + 1 < N k + 1 T_{e_k+1} < N_{k+1} T e k + 1 < N k + 1 ; these entire excursions lie inside the physical block and give actual hits. Their length factor is β a = γ ( a / Λ + − 1 / Λ − ) / ( a − 1 ) \beta_a = \gamma(a/\Lambda_+ - 1/\Lambda_-)/(a-1) β a = γ ( a / Λ + − 1/ Λ − ) / ( a − 1 ) . Endpoint masses have ratio tending to a 1 − α a^{1-\alpha} a 1 − α . Summing the lower frozen block masses and interpolating all N N N gives lim inf C N / M N ≥ ( 1 − ε ) β a / a \liminf C_N/M_N \ge(1-\varepsilon)\beta_a/a lim inf C N / M N ≥ ( 1 − ε ) β a / a . Take the rational margins to γ \gamma γ , then countably a ↓ 1 a \downarrow1 a ↓ 1 and ε ↓ 0 \varepsilon\downarrow0 ε ↓ 0 . Thus the lower limit is at least one.
Under the stationary physical law E C N = M N \mathbb{E}C_N = M_N E C N = M N , Fatou therefore forces this lower limit to equal one. The L 1 L^1 L 1 conclusion was proved above.
Conditional survival and deficient counts
Here g = 1 g=1 g = 1 . We prove a strictly sub-one lower envelope when I n / log log n I_n/\log\log n I n / log log n has finite upper limit, and zero both when this ratio tends to zero and when I n I_n I n has a bounded subsequence. Finite changes of the schedule are harmless, so assume the decreasing radii are all below 1 / 2 1/2 1/2 . Fix 0 < λ < γ 0<\lambda<\gamma 0 < λ < γ , and put w j = u ⌊ λ j ⌋ + 1 w_j=u_{\lfloor\lambda j\rfloor+1} w j = u ⌊ λj ⌋ + 1 , n N = ⌊ N / λ ⌋ + 1 n_N=\lfloor N/\lambda\rfloor+1 n N = ⌊ N / λ ⌋ + 1 . On the full-measure event where T j / j → γ T_j/j\to\gamma T j / j → γ , we have T j ≥ λ j T_j\ge\lambda j T j ≥ λj eventually, including any finite entry offset. Every later neutral observation in excursion j j j occurs at an integer time at least ⌊ λ j ⌋ + 1 \lfloor\lambda j\rfloor+1 ⌊ λj ⌋ + 1 , and K N ≤ N / λ K_N\le N/\lambda K N ≤ N / λ eventually. Thus, for a pathwise finite B 0 B_0 B 0 and all large N N N ,
C N ≤ B 0 + ∑ j < n N V w j ∘ F j (47) C_N\le B_0+\sum_{j<n_N}V_{w_j}\circ\mathcal F^j \tag*{(47)} C N ≤ B 0 + j < n N ∑ V w j ∘ F j (47)
The finite B 0 B_0 B 0 absorbs entry observations and complete rewards of the finitely many exceptional early excursions. Complete rewards on the right overcount the unfinished excursion.
Let G \mathcal G G be the full return-skew sigma-algebra. For G w , h = ∏ i < h 1 B w c ∘ F i G_{w,h}=\prod_{i<h}\mathbf{1}_{B^c_w}\circ\mathcal F^i G w , h = ∏ i < h 1 B w c ∘ F i , the identity P [ H ( g ∘ F ) ] = ( P H ) g \mathcal P[H(g\circ\mathcal F)]=(\mathcal P H)_g P [ H ( g ∘ F )] = ( P H ) g and Lemma 8.2 give, inductively,
P h G w , h ≥ ( 1 − C B w ) h ≥ exp ( − 2 C B h w ) ( C B w ≤ 1 / 2 ) . (48) \mathcal P^hG_{w,h}\ge(1-C_Bw)^h\ge\exp(-2C_Bhw)\qquad(C_Bw\le1/2). \tag*{(48)} P h G w , h ≥ ( 1 − C B w ) h ≥ exp ( − 2 C B h w ) ( C B w ≤ 1/2 ) . (48)
For successive disjoint return-index blocks [ a k , b k ) [a_k,b_k) [ a k , b k ) , let E k = F − a k H k E_k=\mathcal F^{-a_k}H_k E k = F − a k H k . If P b k − a k 1 H k ≥ p k \mathcal P^{b_k-a_k}\mathbf{1}_{H_k}\ge p_k P b k − a k 1 H k ≥ p k , then
ν ( ⋂ k = m n E k c ) ≤ ∏ k = m n ( 1 − p k ) . (49) \nu\left(\bigcap_{k=m}^{n}E_k^c\right)\le\prod_{k=m}^{n}(1-p_k). \tag*{(49)} ν ( k = m ⋂ n E k c ) ≤ k = m ∏ n ( 1 − p k ) . (49)
Indeed, every later factor is F − b m G \mathcal F^{-b_m}\mathcal G F − b m G -measurable, and conditioning the earliest one gives E [ 1 E m ∣ F − b m G ] = ( P b m − a m 1 H m ) ∘ F b m ≥ p m \mathbb E[\mathbf{1}_{E_m}\mid\mathcal F^{-b_m}\mathcal G]=(\mathcal P^{b_m-a_m}\mathbf{1}_{H_m})\circ\mathcal F^{b_m}\ge p_m E [ 1 E m ∣ F − b m G ] = ( P b m − a m 1 H m ) ∘ F b m ≥ p m . Iterate. Thus ∑ k p k = ∞ \sum_k p_k=\infty ∑ k p k = ∞ implies E k E_k E k infinitely often.
Choose an integer p > 4 / α p>4/\alpha p > 4/ α . In either iterated-logarithm regime take N k = ( k ! ) p N_k=(k!)^p N k = ( k ! ) p ; in the bounded-intensity case choose a deterministic subsequence with I N k ≤ I 0 I_{N_k}\le I_0 I N k ≤ I 0 and N k / N k − 1 ≥ k p N_k/N_{k-1}\ge k^p N k / N k − 1 ≥ k p . Put a k = n N k − 1 a_k=n_{N_{k-1}} a k = n N k − 1 , b k = n N k b_k=n_{N_k} b k = n N k . By regular-variation summation, ∑ j < n N m w j ∼ ( γ / λ ) M N \sum_{j<n_N}m_{w_j}\sim(\gamma/\lambda)M_N ∑ j < n N m w j ∼ ( γ / λ ) M N . The old prefix A k = ∑ j < a k V w j ∘ F j A_k=\sum_{j<a_k}V_{w_j}\circ\mathcal F^j A k = ∑ j < a k V w j ∘ F j therefore has expectation asymptotic to ( γ / λ ) M N k − 1 (\gamma/\lambda)M_{N_{k-1}} ( γ / λ ) M N k − 1 . Potter bounds give
ν ( A k ) M N k ≤ C ( N k − 1 N k ) α / 2 ≤ C k − p α / 2 . \frac{\nu(A_k)}{M_{N_k}}\le C\left(\frac{N_{k-1}}{N_k}\right)^{\alpha/2}\le Ck^{-p\alpha/2}. M N k ν ( A k ) ≤ C ( N k N k − 1 ) α /2 ≤ C k − p α /2 .
Markov and first Borel–Cantelli imply A k / M N k → 0 A_k/M_{N_k}\to0 A k / M N k → 0 almost surely.
Fix 0 < t < 1 0<t<1 0 < t < 1 , and put L k = ⌊ t N k / λ ⌋ L_k=\lfloor tN_k/\lambda\rfloor L k = ⌊ t N k / λ ⌋ , l k = L k − a k l_k=L_k-a_k l k = L k − a k , h k = b k − L k h_k=b_k-L_k h k = b k − L k . Eventually l k > 0 l_k>0 l k > 0 . In local block coordinates put S k = ∑ j = a k L k − 1 V w j ∘ F j − a k S_k=\sum_{j=a_k}^{L_k-1}V_{w_j}\circ\mathcal F^{j-a_k} S k = ∑ j = a k L k − 1 V w j ∘ F j − a k . Every transfer exponent is positive, so (38) gives
P l k S k = ∑ j = a k L k − 1 P L k − j V w j = ∑ j = a k L k − 1 m w j + Δ k , \mathcal P^{l_k}S_k=\sum_{j=a_k}^{L_k-1}\mathcal P^{L_k-j}V_{w_j}=\sum_{j=a_k}^{L_k-1}m_{w_j}+\Delta_k, P l k S k = j = a k ∑ L k − 1 P L k − j V w j = j = a k ∑ L k − 1 m w j + Δ k ,
∥ Δ k ∥ ∞ ≤ C ∑ j = a k L k − 1 ϑ L k − j − 1 m w j = o ( M N k ) . \|\Delta_k\|_\infty\le C\sum_{j=a_k}^{L_k-1}\vartheta^{L_k-j-1}m_{w_j}=o(M_{N_k}). ∥ Δ k ∥ ∞ ≤ C j = a k ∑ L k − 1 ϑ L k − j − 1 m w j = o ( M N k ) .
Indeed, terms with j < L k / 2 j<L_k/2 j < L k /2 have exponentially small weight times total mean O ( M N k ) O(M_{N_k}) O ( M N k ) ; the remaining means are bounded by C m w L k = O ( M N k / N k ) Cm_{w_{L_k}}=O(M_{N_k}/N_k) C m w L k = O ( M N k / N k ) , and their geometric weights sum to a constant. Karamata and the negligible old mean therefore give P l k S k / M N k → A t = ( γ / λ ) t α \mathcal P^{l_k}S_k/M_{N_k}\to A_t=(\gamma/\lambda)t^\alpha P l k S k / M N k → A t = ( γ / λ ) t α uniformly. For q > A t q>A_t q > A t , pointwise Markov implies
P l k 1 S k ≤ q M N k ≥ η 0 > 0 \mathcal P^{l_k}\mathbf{1}_{S_k\le qM_{N_k}}\ge\eta_0>0 P l k 1 S k ≤ q M N k ≥ η 0 > 0
eventually, for any fixed η 0 < 1 − A t / q \eta_0 < 1 - A_t/q η 0 < 1 − A t / q . Define
H k = { S k ≤ q M N k } ∩ F − l k { G W L k , h k = 1 } . H_k = \{S_k \le qM_{N_k}\} \cap\mathcal{F}^{-l_k}\{G_{W_{L_k},h_k}=1\}. H k = { S k ≤ q M N k } ∩ F − l k { G W L k , h k = 1 } .
On E k = F − a k H k E_k=\mathcal{F}^{-a_k}H_k E k = F − a k H k , every reward with L k ≤ j < b k L_k \le j < b_k L k ≤ j < b k vanishes, since w j ≤ w L k w_j \le w_{L_k} w j ≤ w L k . Transfer the prefix indicator first, multiply by survival, then transfer the suffix. Positivity and (48) yield
P b k − a k 1 H k ≥ η 0 exp ( − 2 C B h k w L k ) = : p k , \mathbb{P}^{b_k-a_k}\mathbf{1}_{H_k} \ge\eta_0\exp(-2C_Bh_kw_{L_k}) =: p_k, P b k − a k 1 H k ≥ η 0 exp ( − 2 C B h k w L k ) =: p k ,
h k w L k I N k ⟶ 1 − t λ t . (50) \frac{h_kw_{L_k}}{I_{N_k}} \longrightarrow\frac{1-t}{\lambda t}. \tag*{(50)} I N k h k w L k ⟶ λ t 1 − t . (50)
Suppose first I n ≤ c 1 log log n I_n \le c_1\log\log n I n ≤ c 1 log log n eventually, with c 1 < ∞ c_1 < \infty c 1 < ∞ . Choose t t t close to one, then γ t α < λ < γ \gamma t^\alpha< \lambda< \gamma γ t α < λ < γ and A t < q < 1 A_t < q < 1 A t < q < 1 , so that A 1 = 2 C B c 1 ( 1 − t ) / ( λ t ) < 1 A_1=2C_Bc_1(1-t)/(\lambda t)<1 A 1 = 2 C B c 1 ( 1 − t ) / ( λ t ) < 1 . For example, λ / γ = ( 1 + t α ) / 2 \lambda/\gamma=(1+t^\alpha)/2 λ / γ = ( 1 + t α ) /2 allows both inequalities as t ↑ 1 t \uparrow1 t ↑ 1 . Since log log N k = log k + log log k + O ( 1 ) \log\log N_k=\log k+\log\log k+O(1) log log N k = log k + log log k + O ( 1 ) , for any A 1 < v < 1 A_1<v<1 A 1 < v < 1 we have p k ≥ η 0 k − v p_k\ge\eta_0k^{-v} p k ≥ η 0 k − v eventually. The conditional block argument gives infinitely many successes. Together with (47) and the negligible old prefix, this yields lim inf C N / M N ≤ q < 1 \liminf C_N/M_N\le q<1 lim inf C N / M N ≤ q < 1 .
For zero lower limits, fix any q > 0 q>0 q > 0 , then λ = γ / 2 \lambda=\gamma/2 λ = γ /2 and t t t with 2 t α < q 2t^\alpha<q 2 t α < q . If I n / log log n → 0 I_n/\log\log n\to0 I n / log log n → 0 , the same factorial grid gives p k ≥ η 0 k − 1 / 2 p_k\ge\eta_0k^{-1/2} p k ≥ η 0 k − 1/2 eventually. On a bounded-intensity subsequence, p k p_k p k has a fixed positive lower bound. The block argument gives lim inf C N / M N ≤ q \liminf C_N/M_N\le q lim inf C N / M N ≤ q in both cases; intersect over countably q ↓ 0 q\downarrow0 q ↓ 0 . An absolutely continuous initial law inherits these full events after its finite first entry, and the finite B 0 B_0 B 0 vanishes relative to M N M_N M N .
For L ( n ) = ( log n ) κ L(n)=(\log n)^\kappa L ( n ) = ( log n ) κ , κ < 0 \kappa<0 κ < 0 , Theorem 1.4 gives C N / M N → 0 C_N/M_N\to0 C N / M N → 0 in stationary annealed probability. If κ < − 1 \kappa<-1 κ < − 1 , entrance probabilities have finite sum. The first Borel–Cantelli lemma gives finitely many entrances. A left step cannot enter a decreasing neutral target from outside, and each positive excursion is finite; hence only finitely many visits occur.
The iterated-logarithm lower-envelope constant
Let the schedule be eventually equal to u n = c log log n / n u_n=c\log\log n/n u n = c log log n / n . First note that H r ′ ( q ) = ∫ 0 ∞ e − q z ( 1 + z ) − r d z H_r'(q)=\int_0^\infty e^{-qz}(1+z)^{-r}\,dz H r ′ ( q ) = ∫ 0 ∞ e − q z ( 1 + z ) − r d z decreases strictly from 1 / ( r − 1 ) 1/(r-1) 1/ ( r − 1 ) to zero and H r ( q ) = log q + O ( 1 ) H_r(q)=\log q+O(1) H r ( q ) = log q + O ( 1 ) as q → ∞ q\to\infty q → ∞ . Thus h r h_r h r is continuous and strictly decreasing from infinity to zero on ( 0 , 1 ) (0,1) ( 0 , 1 ) ; its optimizer is unique and positive. Let S N λ , a , b 0 S_N^{\lambda,a,b_0} S N λ , a , b 0 denote the sum in Lemma 8.5 with j N = 0 j_N=0 j N = 0 , and define
D λ ( c ) = γ λ h r − 1 ( λ α c k B ) . D_\lambda(c)=\frac{\gamma}{\lambda}h_r^{-1}\left(\frac{\lambda\alpha}{c k_B}\right). D λ ( c ) = λ γ h r − 1 ( c k B λ α ) .
We claim lim inf S N λ , a , b 0 / M N = D λ ( c ) \liminf S_N^{\lambda,a,b_0}/M_N=D_\lambda(c) lim inf S N λ , a , b 0 / M N = D λ ( c ) , ν \nu ν -almost surely. For x < D λ ( c ) x<D_\lambda(c) x < D λ ( c ) , (44) makes S N k ≤ x M N k S_{N_k}\le xM_{N_k} S N k ≤ x M N k summable on N k = ⌊ ρ k ⌋ N_k=\lfloor\rho^k\rfloor N k = ⌊ ρ k ⌋ , since I N k / log k → c I_{N_k}/\log k\to c I N k / log k → c and c J λ ( x ) > 1 cJ_\lambda(x)>1 c J λ ( x ) > 1 . Increasing-count interpolation gives a lower bound x ρ − α x\rho^{-\alpha} x ρ − α . Choose countably x ↑ D λ ( c ) x\uparrow D_\lambda(c) x ↑ D λ ( c ) , ρ ↓ 1 \rho\downarrow1 ρ ↓ 1 .
For x > D λ ( c ) x>D_\lambda(c) x > D λ ( c ) , choose D λ ( c ) < x ′ < min ( x , γ / λ ) D_\lambda(c)<x'<\min(x,\gamma/\lambda) D λ ( c ) < x ′ < min ( x , γ / λ ) and integer p > 4 / α p>4/\alpha p > 4/ α . On N k = ( k ! ) p N_k=(k!)^p N k = ( k ! ) p , use consecutive return blocks [ a k , b k ) = [ n N k − 1 , n N k ) [a_k,b_k)=[n_{N_{k-1}},n_{N_k}) [ a k , b k ) = [ n N k − 1 , n N k ) . The old prefix mean is O ( M N k − 1 ) O(M_{N_{k-1}}) O ( M N k − 1 ) ; Potter bounds, Markov’s inequality and the first Borel–Cantelli lemma make its ratio to M N k M_{N_k} M N k tend to zero almost surely. Here a k = o ( N k ) a_k=o(N_k) a k = o ( N k ) . Since c J λ ( x ′ ) < 1 cJ_\lambda(x')<1 c J λ ( x ′ ) < 1 , (44) bounds the new block’s conditional success probability below by k − v k^{-v} k − v , for some v < 1 v<1 v < 1 . In local coordinates let H k H_k H k be the event that this new-block reward is at most x ′ M N k x'M_{N_k} x ′ M N k . The endpoint lower bound survives composition at its global start F a k \mathcal{F}^{a_k} F a k . Apply (47) to E k = F − a k H k E_k=\mathcal{F}^{-a_k}H_k E k = F − a k H k : successes occur infinitely often. Adding the negligible old prefix proves the claimed upper bound; let x ′ ↓ D λ ( c ) x'\downarrow D_\lambda(c) x ′ ↓ D λ ( c ) .
Fix 0 < Λ − < γ < Λ + 0<\Lambda_-<\gamma<\Lambda_+ 0 < Λ − < γ < Λ + and set a + = ⌈ Λ + ⌉ + 2 a_+=\lceil\Lambda_+\rceil+2 a + = ⌈ Λ + ⌉ + 2 . Ordinary clock margins give, for a pathwise finite B 0 B_0 B 0 ,
S N Λ + , a + , − 3 − B 0 ≤ C N ≤ S N Λ − , 1 , 1 + B 0 . (51) S_N^{\Lambda_+,a_+,-3}-B_0\le C_N\le S_N^{\Lambda_-,1,1}+B_0. \tag*{(51)} S N Λ + , a + , − 3 − B 0 ≤ C N ≤ S N Λ − , 1 , 1 + B 0 . (51)
Indeed T j ≥ Λ − j T_j\ge\Lambda_-j T j ≥ Λ − j bounds every later hit by the upper radius; the whole possible unfinished reward is included. On the lower side T j + 1 ≤ Λ + ( j + 1 ) T_{j+1}\le\Lambda_+(j+1) T j + 1 ≤ Λ + ( j + 1 ) , and every included j ≤ ⌊ N / Λ + ⌋ − 4 j\le\lfloor N/\Lambda_+\rfloor-4 j ≤ ⌊ N / Λ + ⌋ − 4 has its target index later than the excursion endpoint but at most N − 4 Λ + + ⌈ Λ + ⌉ + 2 < N N-4\Lambda_{+}+\lceil\Lambda_{+}\rceil+2<N N − 4 Λ + + ⌈ Λ + ⌉ + 2 < N , since Λ + > γ ≥ 1 \Lambda_{+}>\gamma\ge1 Λ + > γ ≥ 1 . Those complete rewards are actual hits. Finite entry offsets and early excursions are absorbed in B 0 B_0 B 0 . Continuity of D λ ( c ) D_\lambda(c) D λ ( c ) at γ \gamma γ and countable clock margins therefore yield lim inf C N / M N = D γ ( c ) = d π ( c ) \liminf C_N/M_N=D_\gamma(c)=d_\pi(c) lim inf C N / M N = D γ ( c ) = d π ( c ) . Its defining equation is the one in the statement. Since h r h_r h r decreases continuously from infinity to zero, d π d_\pi d π increases continuously and strictly from zero to one.
Comparison without target monotonicity
Use the smooth equivalent L ~ \widetilde L L and decreasing comparison radii v n ± = ( 1 ± ϵ ) c n − g L ~ ( n ) v_n^\pm=(1\pm\epsilon)cn^{-g}\widetilde L(n) v n ± = ( 1 ± ϵ ) c n − g L ( n ) from the normalizer proof, for rational ϵ ∈ ( 0 , 1 ) \epsilon\in(0,1) ϵ ∈ ( 0 , 1 ) . Their counts satisfy C N − − O ϵ ( 1 ) ≤ C N ≤ C N + + O ϵ ( 1 ) C_N^- - O_\epsilon(1)\le C_N\le C_N^+ + O_\epsilon(1) C N − − O ϵ ( 1 ) ≤ C N ≤ C N + + O ϵ ( 1 ) . Their means satisfy (34); integral convergence, I n → ∞ I_n\to\infty I n → ∞ , bounded-intensity subsequences, and the hypotheses on I n / log log n I_n/\log\log n I n / log log n are preserved. If J ( u ) < ∞ J(u)<\infty J ( u ) < ∞ , the two comparison strong laws squeeze C N / M N C_N/M_N C N / M N between ( 1 ± ϵ ) 1 − α (1\pm\epsilon)^{1-\alpha} ( 1 ± ϵ ) 1 − α ; intersect countably many full-measure sets and let ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 . On the divergent side with I n → ∞ I_n\to\infty I n → ∞ , one lower comparison gives infinite upper ratio. If I n I_n I n does not tend to infinity, one upper comparison gives zero lower ratio. The same upper comparison gives zero when I n / log log n → 0 I_n/\log\log n\to0 I n / log log n → 0 . When this ratio tends to infinity, countably many lower comparisons give lower limit at least one; stationary Fatou again makes it equal one. Positive lower critical intensity passes to any lower comparison and gives a positive original lower envelope. For bounded upper critical intensity, first fix 0 < t < 1 0<t<1 0 < t < 1 , γ t α < λ < γ \gamma t^\alpha<\lambda<\gamma γ t α < λ < γ and A t < q < 1 A_t<q<1 A t < q < 1 for c n − 1 L ~ ( n ) cn^{-1}\widetilde L(n) c n − 1 L ( n ) . Choose a sufficiently small upper factor 1 + ϵ 1+\epsilon 1 + ϵ so that the same survival exponent remains below one and ( 1 + ϵ ) 1 − α q < 1 (1+\epsilon)^{1-\alpha}q<1 ( 1 + ϵ ) 1 − α q < 1 . Its conditional prefix mean ratio A t A_t A t is unchanged, so the same q q q bounds the comparison’s lower ratio. The mean factor then gives an original lower limit below one. For a fixed u n ∼ c log log n / n u_n\sim c\log\log n/n u n ∼ c log log n / n , compare instead with exact critical schedules of coefficients c ( 1 ± ϵ ) c(1\pm\epsilon) c ( 1 ± ϵ ) . Their mean ratios tend to ( 1 ± ϵ ) 1 − α (1\pm\epsilon)^{1-\alpha} ( 1 ± ϵ ) 1 − α , so the lower envelope is bracketed by these factors times d π ( c ( 1 ± ϵ ) ) d_\pi(c(1\pm\epsilon)) d π ( c ( 1 ± ϵ )) . Continuity and countably ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 give the stated equality, even for nonmonotone radii. The same mean comparison gives Q N / M N → 1 Q_N/M_N\to1 Q N / M N → 1 .
The logarithmic and strong-law-threshold arguments above use their asymptotic sizes: these are unchanged by smooth equivalence and fixed radius factors. In particular, their geometric-grid lower-tail series remain summable, their compact-profile entrance series have the same convergence status, and finite entrance sums stay finite. The same sandwich therefore preserves all the stated finer classifications. The general integral equivalence follows from the convergent side and the two failure cases.
Finally μ ˉ \bar\mu μ ˉ is equivalent to Lebesgue measure. Disintegration over future symbols transfers all stationary full-measure assertions to almost every environment and Lebesgue-almost every point; Lemma 8.1 replaces M N M_N M N by Q N Q_N Q N .
The occupation-process limit
Proof of Theorem 1.4 . We first compute transforms at deterministic return horizons, compare physical prefix counts, and then prove scalar M 1 M_1 M 1 tightness. Write a N = a u N a_N=a_{u_N} a N = a u N . Endpoint normalization and Karamata give
M N ∼ c ˉ D ∗ α ( r − 1 ) I N a N , M ⌊ N t ⌋ M N → t α ( t > 0 ) . (52) M_N\sim\frac{\bar cD_*}{\alpha(r-1)}I_Na_N,\qquad\frac{M_{\lfloor Nt\rfloor}}{M_N}\to t^\alpha\quad(t>0). \tag*{(52)} M N ∼ α ( r − 1 ) c ˉ D ∗ I N a N , M N M ⌊ N t ⌋ → t α ( t > 0 ) . (52)
In particular M N → ∞ M_N\to\infty M N → ∞ , since its regular-variation index is α > 0 \alpha>0 α > 0 , even along subsequences where I N → 0 I_N\to0 I N → 0 . We may use a smooth decreasing equivalent of u n u_n u n . Indeed the supremum of the difference between the two paths, both normalized by M N M_N M N , is at most the number of visits to the symmetric differences of their targets up to ⌊ T N ⌋ \lfloor TN\rfloor ⌊ T N ⌋ , divided by M N M_N M N . Under Λ ˉ \bar\Lambda Λ ˉ , this number has expectation o ( M N ) o(M_N) o ( M N ) , by bracketing the two radii with factors 1 ± ϵ 1\pm\epsilon 1 ± ϵ , regular variation of the target mass, and then ϵ ↓ 0 \epsilon\downarrow0 ϵ ↓ 0 . The two mean and intensity ratios tend to one. Absolute continuity transfers this negligible error to each fixed initial law. Finite prefix changes are harmless; take all comparison radii below 1 / 2 1/2 1/2 .
Return-horizon transforms. Let W 0 W_0 W 0 have tail P ( W 0 > w ) = ( 1 + w ) − r \mathbb{P}(W_0>w)=(1+w)^{-r} P ( W 0 > w ) = ( 1 + w ) − r . The profile and integrable mean calculation in the proof of Lemma 8.5 give u − 1 ν ( e − q V u / a u − 1 ) → k B ( E e − q D ∗ W 0 − 1 ) u^{-1}\nu(e^{-qV_u/a_u}-1)\to k_B(\mathbb{E}e^{-qD_*W_0}-1) u − 1 ν ( e − q V u / a u − 1 ) → k B ( E e − q D ∗ W 0 − 1 ) , uniformly for q q q in compact subsets of [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) . Use (45) and the separating contours there, not that lemma’s critical-schedule conclusion. With ρ 0 < 1 \rho_0<1 ρ 0 < 1 ,
η u , q = 1 + ν ( e − q V u / a u − 1 ) + O ( u 2 ) , Π u , q = Π + O ( u ) , A u , q K 1 = η u , q K { Π u , q 1 + O ( ( ρ 0 / η u , q ) K ) } . \eta_{u,q}=1+\nu(e^{-qV_u/a_u}-1)+O(u^2),\qquad\Pi_{u,q}=\Pi+O(u),\qquad A^K_{u,q}1=\eta^K_{u,q}\{\Pi_{u,q}1+O((\rho_0/\eta_{u,q})^K)\}. η u , q = 1 + ν ( e − q V u / a u − 1 ) + O ( u 2 ) , Π u , q = Π + O ( u ) , A u , q K 1 = η u , q K { Π u , q 1 + O (( ρ 0 / η u , q ) K )} .
Here Π f = ν ( f ) 1 \Pi f=\nu(f)1 Π f = ν ( f ) 1 , and the bounds are in base BV. If K → ∞ K\to\infty K → ∞ , u → 0 u\to0 u → 0 and K u → a ∈ ( 0 , ∞ ) Ku\to a\in(0,\infty) K u → a ∈ ( 0 , ∞ ) , then
log ( A u , q K 1 ) → a k B ( E e − q D ∗ W 0 − 1 ) (53) \log(A^K_{u,q}1)\to ak_B(\mathbb{E}e^{-qD_*W_0}-1) \tag*{(53)} log ( A u , q K 1 ) → a k B ( E e − q D ∗ W 0 − 1 ) (53)
uniformly outside a null set in Y Y Y . The projector error is O ( u ) O(u) O ( u ) , K u 2 → 0 Ku^2\to0 K u 2 → 0 , and the relative remainder vanishes. Divergence of K u Ku K u is not required.
Suppose I N → ι ∈ ( 0 , ∞ ) I_N\to\iota\in(0,\infty) I N → ι ∈ ( 0 , ∞ ) along the chosen subsequence. Set n N ( 0 ) = 0 n_N(0)=0 n N ( 0 ) = 0 , n N ( t ) = ⌊ N t / γ ⌋ + 1 n_N(t)=\lfloor Nt/\gamma\rfloor+1 n N ( t ) = ⌊ N t / γ ⌋ + 1 for t > 0 t>0 t > 0 , v j = u ⌊ γ j ⌋ + 1 v_j=u_{\lfloor\gamma j\rfloor+1} v j = u ⌊ γ j ⌋ + 1 , and S N ( t ) = ∑ j < n N ( t ) V v j ∘ F j S_N(t)=\sum_{j<n_N(t)}V_{v_j}\circ\mathcal{F}^j S N ( t ) = ∑ j < n N ( t ) V v j ∘ F j . Fix 0 = t 0 < ⋯ < t m = T 0=t_0<\cdots<t_m=T 0 = t 0 < ⋯ < t m = T and nonnegative increment tilts θ i \theta_i θ i . On a finite partition of [ δ , T ] [\delta,T] [ δ , T ] containing the positive t i t_i t i , freeze the radii at block endpoints with the single denominator a N a_N a N . At fraction s s s , radius divided by u N u_N u N tends to 1 / s 1/s 1/ s , residence scale divided by a N a_N a N to s α s^\alpha s α , and block length times radius to ι Δ s / ( γ s ) \iota\Delta s/(\gamma s) ι Δ s / ( γ s ) . Apply (51) to the two bounding powers. The factors are ordered from earliest on the right to latest on the left. If each block image of 1 1 1 is bounded by L i 1 , U i 1 L_i1,U_i1 L i 1 , U i 1 , positivity bounds the product by ( ∏ L i ) 1 , ( ∏ U i ) 1 (\prod L_i)1,(\prod U_i)1 ( ∏ L i ) 1 , ( ∏ U i ) 1 ; commutation is unnecessary. Take N N N first for the fixed partition, then refine it. For the initial sector j < d = ⌊ δ N / γ ⌋ j<d=\lfloor\delta N/\gamma\rfloor j < d = ⌊ δ N / γ ⌋ , conditional Jensen and P d − j V v j ≤ C m v j \mathcal{P}^{d-j}V_{v_j}\leq Cm_{v_j} P d − j V v j ≤ C m v j bound its transform below by exp [ − C max i θ i ∑ j < d m v j / a N ] \exp[-C\max_i\theta_i\sum_{j<d}m_{v_j}/a_N] exp [ − C max i θ i ∑ j < d m v j / a N ] and above by one. The exponent is O ( δ α ) O(\delta^\alpha) O ( δ α ) ; all transfer exponents are positive. Let δ ↓ 0 \delta\downarrow0 δ ↓ 0 after the preceding limits. The joint increment transform of S N / a N S_N/a_N S N / a N tends to
exp [ ι c ∑ i ∫ t i − 1 t i ( E e − θ i D ∗ s α W 0 − 1 ) d s s ] (54) \exp\left[\iota c\sum_i\int_{t_{i-1}}^{t_i}\left(\mathbb{E}e^{-\theta_iD_*s^\alpha W_0}-1\right)\frac{ds}{s}\right] \tag*{(54)} exp [ ιc i ∑ ∫ t i − 1 t i ( E e − θ i D ∗ s α W 0 − 1 ) s d s ] (54)
Since M N / a N → β ι D ∗ / ( r − 1 ) M_N/a_N\to\beta\iota D_*/(r-1) M N / a N → β ι D ∗ / ( r − 1 ) , the multivariate Laplace transform identifies the ideal prefix vector with that of Z ι Z_\iota Z ι . Independent increments emerge from this transform.
Physical prefixes. For 0 < Λ − < γ < Λ + 0<\Lambda_-<\gamma<\Lambda_+ 0 < Λ − < γ < Λ + , put a + = ⌈ Λ + ⌉ + 2 a_+=\lceil\Lambda_+\rceil+2 a + = ⌈ Λ + ⌉ + 2 and
S N λ , a , b 0 ( t ) = ∑ j < max ( 0 , ⌊ N t / λ ⌋ + b 0 ) V u ⌊ λ j ⌋ + a ∘ F j . S_N^{\lambda,a,b_0}(t)=\sum_{j<\max(0,\lfloor Nt/\lambda\rfloor+b_0)}V_{u_{\lfloor\lambda j\rfloor+a}}\circ\mathcal{F}^j. S N λ , a , b 0 ( t ) = j < m a x ( 0 , ⌊ N t / λ ⌋ + b 0 ) ∑ V u ⌊ λj ⌋ + a ∘ F j .
The ordinary return clock gives, for each fixed positive t t t , eventually
S N Λ + , a + , − 3 ( t ) − B 0 ≤ C ⌊ N t ⌋ ≤ S N Λ − , 1 , 1 ( t ) + B 0 . S_N^{\Lambda_+,a_+,-3}(t)-B_0\leq C_{\lfloor Nt\rfloor}\leq S_N^{\Lambda_-,1,1}(t)+B_0. S N Λ + , a + , − 3 ( t ) − B 0 ≤ C ⌊ N t ⌋ ≤ S N Λ − , 1 , 1 ( t ) + B 0 .
with B 0 B_0 B 0 pathwise finite. The upper bound follows from T j ≥ Λ − j T_j\geq\Lambda_-j T j ≥ Λ − j and includes the unfinished excursion. For the lower bound, T j + 1 ≤ Λ + ( j + 1 ) T_{j+1}\leq\Lambda_+(j+1) T j + 1 ≤ Λ + ( j + 1 ) ; the chosen radius index is after that endpoint, and the − 3 -3 − 3 offset keeps every included excursion complete before ⌊ N t ⌋ \lfloor Nt\rfloor ⌊ N t ⌋ . The finitely many exceptional excursions contribute to B 0 B_0 B 0 . The ideal S N ( t ) S_N(t) S N ( t ) is also between these two deterministic-index sums. By ν \nu ν -invariance and m u = γ μ ˉ ( [ 0 , u ] ) m_u=\gamma\bar{\mu}([0,u]) m u = γ μ ˉ ([ 0 , u ]) ,
ν ( S N λ , a , b 0 ( t ) ) M N → γ λ t α . \frac{\nu(S_N^{\lambda,a,b_0}(t))}{M_N}\to\frac{\gamma}{\lambda}t^\alpha. M N ν ( S N λ , a , b 0 ( t )) → λ γ t α .
Markov bounds the nonnegative upper-minus-lower error, whose limiting normalized mean is γ ( Λ − − 1 − Λ + − 1 ) t α \gamma(\Lambda_-^{-1}-\Lambda_+^{-1})t^\alpha γ ( Λ − − 1 − Λ + − 1 ) t α . For a finite prefix vector take N N N , then countable margins to γ \gamma γ . The ordinary clock full event and B 0 / M N → 0 B_0/M_N \to0 B 0 / M N → 0 give closeness in probability of the physical and ideal vectors under ν \nu ν . Only after this comparison take vector differences to obtain increments.
Initial laws. The physical skew map S S S is ergodic: an invariant event restricts to a F \mathcal{F} F -invariant event on Y Y Y , and every positive point enters Y Y Y in finite time. Also ν = γ 1 Y Λ ‾ \nu= \gamma1_Y \overline{\Lambda} ν = γ 1 Y Λ , including the unused future. Reindexing counts for decreasing targets and telescoping the annulus means gives E Λ ‾ ∣ C N ∘ S − C N ∣ ≤ 2 \mathbb{E}_{\overline{\Lambda}}|C_N \circ S - C_N| \le2 E Λ ∣ C N ∘ S − C N ∣ ≤ 2 . Every bounded prefix-vector Laplace test G N G_N G N is consequently asymptotically S S S -invariant in L 1 L^1 L 1 . For the physical transfer P S P_S P S , Cesàro means H − 1 ∑ j < H P S j f → ∫ f d Λ ‾ H^{-1}\sum_{j<H}P_S^j f \to\int f\,d\overline{\Lambda} H − 1 ∑ j < H P S j f → ∫ f d Λ in L 1 L^1 L 1 : apply Hilbert mean ergodicity to bounded L 2 L^2 L 2 functions and then truncate. Indeed P S f = f P_Sf=f P S f = f implies ⟨ f , f ∘ S ⟩ = ∥ f ∥ 2 2 \langle f,f\circ S\rangle=\|f\|_2^2 ⟨ f , f ∘ S ⟩ = ∥ f ∥ 2 2 , hence f = f ∘ S f=f\circ S f = f ∘ S , and ergodicity makes fixed functions constant. For fixed H H H , asymptotic invariance and truncation of a probability density f f f show that replacing f f f by this Cesàro mean changes ∫ G N f d Λ ‾ \int G_Nf\,d\overline{\Lambda} ∫ G N f d Λ by o ( 1 ) o(1) o ( 1 ) . Take N N N first, then H H H . Thus the finite-dimensional distributions converge to the same limits under ν \nu ν , Λ ‾ \overline{\Lambda} Λ , and every fixed ρ ≪ Λ ‾ \rho\ll\overline{\Lambda} ρ ≪ Λ .
Tightness and intensity endpoints. Under Λ ‾ \overline{\Lambda} Λ , the nonnegative increasing paths X N ( t ) = C ⌊ N t ⌋ / M N X_N(t)=C_{\lfloor Nt\rfloor}/M_N X N ( t ) = C ⌊ N t ⌋ / M N satisfy E X N ( t ) = M ⌊ N t ⌋ / M N → t α \mathbb{E}X_N(t)=M_{\lfloor Nt\rfloor}/M_N\to t^\alpha E X N ( t ) = M ⌊ N t ⌋ / M N → t α . Their interior M 1 M_1 M 1 oscillation modulus is zero. Terminal means bound their sup norms, and Markov gives vanishing initial, terminal and fixed-time nearby increments in the order N → ∞ N\to\infty N → ∞ , then δ ↓ 0 \delta\downarrow0 δ ↓ 0 . Here is a direct compactness argument. Parametrize the completed graph of an increasing path by t + y t+y t + y , rescaled to [ 0 , 1 ] [0,1] [ 0 , 1 ] . When the terminal value is at most K K K , both coordinates are Lipschitz with constant at most T + K T+K T + K . Uniform graph limits exist by Arzelà–Ascoli; bounds X N ( δ l ) ≤ ε l ↓ 0 X_N(\delta_l)\le\varepsilon_l\downarrow0 X N ( δ l ) ≤ ε l ↓ 0 exclude a spurious initial vertical segment. Terminal vertical segments are allowed. Choose δ l \delta_l δ l with summable failure probabilities from the initial modulus bound, shrinking it below 1 / N 1/N 1/ N for the finitely many exceptional indices. A union bound gives compact sets carrying arbitrarily high probability for the entire sequence. For any subsequential limit, choose neighboring times outside its at-most-countable fixed-discontinuity set. Convergence there and the nearby-increment bound exclude a jump at each deterministic time, including T T T . Dense finite-dimensional laws therefore identify the path limit. Absolute continuity transfers the compact-set bounds to each fixed ρ \rho ρ . This proves scalar M 1 M_1 M 1 convergence for finite ι \iota ι .
If I N → 0 I_N\to0 I N → 0 , a hit between ⌊ δ N ⌋ \lfloor\delta N\rfloor ⌊ δ N ⌋ and ⌊ T N ⌋ \lfloor TN\rfloor ⌊ T N ⌋ requires occupation at the first time or a new right entrance. A left step cannot enter a decreasing target from outside. Since h ≤ 2 h\le2 h ≤ 2 on Y Y Y , its probability is at most μ ‾ ( [ 0 , u ⌊ δ N ⌋ ] ) + ∑ δ N < n ≤ T N u n → 0 \overline{\mu}([0,u_{\lfloor\delta N\rfloor}])+\sum_{\delta N<n\le TN}u_n\to0 μ ([ 0 , u ⌊ δ N ⌋ ]) + ∑ δ N < n ≤ T N u n → 0 . Uniform convergence for slow variation bounds the sum by O δ , T ( I N ) O_{\delta,T}(I_N) O δ , T ( I N ) . Early normalized occupation has limiting mean δ α \delta^\alpha δ α . Markov followed by δ ↓ 0 \delta\downarrow0 δ ↓ 0 proves uniform convergence in probability to zero.
If I N → ∞ I_N\to\infty I N → ∞ , repeat the finite partition with denominator M N M_N M N . For fixed δ > 0 \delta>0 δ > 0 and a fixed partition of [ δ , T ] [\delta,T] [ δ , T ] , each frozen radius v v v has v / u N v/u_N v / u N and a v / a N a_v/a_N a v / a N bounded above and away from zero. Since M N / a N M_N/a_N M N / a N , its tilt q = θ v / M N q=\theta_v/M_N q = θ v / M N tends to zero. To justify linearization with this moving tilt, let Y v Y_v Y v have the conditional law of V v / a v V_v/a_v V v / a v given V v > 0 V_v>0 V v > 0 . The profile and mean limits in the proof of Lemma 8.5, together with ν ( V v > 0 ) ∼ k B v \nu(V_v>0)\sim k_Bv ν ( V v > 0 ) ∼ k B v , give Y v ⇒ D ∗ W 0 Y_v\Rightarrow D_*W_0 Y v ⇒ D ∗ W 0 and E Y v → D ∗ / ( r − 1 ) \mathbb{E}Y_v\to D_*/(r-1) E Y v → D ∗ / ( r − 1 ) . These nonnegative laws are therefore uniformly integrable as v ↓ 0 v\downarrow0 v ↓ 0 . For any q v > 0 q_v>0 q v > 0 tending to zero, split at Y v = K Y_v=K Y v = K : on [ 0 , K ] [0,K] [ 0 , K ] , ( 1 − e − q v y ) / q v → y (1-e^{-q_vy})/q_v\to y ( 1 − e − q v y ) / q v → y uniformly, while the tail error is bounded by E [ Y v 1 Y v > K ] \mathbb{E}[Y_v1_{Y_v>K}] E [ Y v 1 Y v > K ] . Taking v ↓ 0 v\downarrow0 v ↓ 0 , then K → ∞ K\to\infty K → ∞ , proves
ν ( 1 − e − q v V v / a v ) = q v m v a v ( 1 + o ( 1 ) ) . \nu(1-e^{-q_vV_v/a_v})=\frac{q_vm_v}{a_v}(1+o(1)). ν ( 1 − e − q v V v / a v ) = a v q v m v ( 1 + o ( 1 )) .
For θ > 0 \theta>0 θ > 0 this yields ν ( e − θ V v / M N − 1 ) = − ( θ / M N ) m v ( 1 + o ( 1 ) ) \nu(e^{-\theta V_v/M_N}-1)=-(\theta/M_N)m_v(1+o(1)) ν ( e − θ V v / M N − 1 ) = − ( θ / M N ) m v ( 1 + o ( 1 )) at every endpoint of the fixed finite partition; zero tilts give equality. The total eigenvalue error is O ( N u N 2 ) = O ( I N 2 / N ) = o ( 1 ) O(Nu_N^2)=O(I_N^2/N)=o(1) O ( N u N 2 ) = O ( I N 2 / N ) = o ( 1 ) , since I N I_N I N is slowly varying. Projector errors and relative remainders vanish. The ordered transform tends to exp [ − ∑ i θ i ( t i α − t i − 1 α ) ] \exp[-\sum_i\theta_i(t_i^\alpha-t_{i-1}^\alpha)] exp [ − ∑ i θ i ( t i α − t i − 1 α )] . Early Jensen now costs O ( δ α ) O(\delta^\alpha) O ( δ α ) on the M N M_N M N scale; the prefix squeeze, change of law and tightness prove the deterministic limit. Only the intensity along the chosen subsequence enters.
The Poisson integral exists because E W 0 = 1 / ( r − 1 ) \mathbb{E}W_0=1/(r-1) E W 0 = 1/ ( r − 1 ) and ∫ 0 T s α d s / s < ∞ \int_0^T s^\alpha ds/s<\infty ∫ 0 T s α d s / s < ∞ . Its small-time mass tends to zero in L 1 L^1 L 1 ; positive time strips have finite jump intensity. Scaling and disjoint strips give self-similarity and independent increments. Tonelli and layer cake give (3) ; the raw terminal Lévy density is β ι ( 1 + z ) − r d z / z \beta_\iota(1+z)^{-r}dz/z β ι ( 1 + z ) − r d z / z , whose positive mass proves nondegeneracy. The residence scale D ∗ D_* D ∗ cancels on division by M N M_N M N . Prelimit jumps are at most 1 / M N 1/M_N 1/ M N , whereas Z ι Z_\iota Z ι has positive jumps with positive probability; J 1 J_1 J 1 cannot merge these clusters. Finally past measurability projects m m m to Λ ‾ \overline{\Lambda} Λ . Lemma 8.1 gives Q N / M N → 1 Q_N/M_N\to1 Q N / M N → 1 m m m -almost surely, so Slutsky with one scalar multiplier over the path proves the asserted Q N Q_N Q N replacement, also under every fixed law absolutely continuous with respect to m m m .
Excursion marks and residence clocks
The strong laws concern cumulative counts along a fixed divergent schedule. We now hold the entrance interval fixed at size ε \varepsilon ε and observe it for order ε − 1 \varepsilon^{-1} ε − 1 steps. Its rare entrances generate long neutral excursions. The following result identifies both the arrival process and the residence carried by each arrival. Unlike Theorem 1.4, which uses moving targets and the single-horizon denominator M N M_N M N or Q N Q_N Q N under annealed laws, this section uses a fixed target, physical time of order ε − 1 \varepsilon^{-1} ε − 1 , and a separate normalization for residence times, with the environment fixed.
For deterministic LSV maps, Freitas, Freitas, Todd and Vaienti [17 ] showed that the usual neutral-point normalization gives degenerate limits and obtained nondegenerate limits with an adapted normalization in a restricted parameter range. Zweimüller [40 ] proved the exponential first-hitting law at scale h α ( 1 / 2 ) ε / 2 h_\alpha(1/2)\varepsilon/2 h α ( 1/2 ) ε /2 for every α ∈ ( 0 , 1 ) \alpha\in(0,1) α ∈ ( 0 , 1 ) , where h α h_\alpha h α is the invariant probability density of T α T_\alpha T α . The result below concerns the joint return and residence process under ergodic forcing, rather than only the first hitting time.
Let σ \sigma σ be an invertible ergodic probability-preserving map of ( Ω , P ) (\Omega,\mathbb{P}) ( Ω , P ) , let λ : Ω → [ α , β ] \lambda:\Omega\to[\alpha,\beta] λ : Ω → [ α , β ] be measurable, where 0 < α ≤ β < 1 0<\alpha\le\beta<1 0 < α ≤ β < 1 . Write T ω = T λ ( ω ) T_\omega=T_{\lambda(\omega)} T ω = T λ ( ω ) and T ω n = T σ n − 1 ω ∘ ⋯ ∘ T ω T_\omega^n=T_{\sigma^{n-1}\omega}\circ\cdots\circ T_\omega T ω n = T σ n − 1 ω ∘ ⋯ ∘ T ω . The cone estimates in § 7 and the coupling in Lemma 7.2 give a canonical equivariant cone probability μ ω = h ω d x \mu_\omega=h_\omega\,dx μ ω = h ω d x . Indeed, the pullbacks
h ω ( m ) = L λ ( σ − 1 ω ) ⋯ L λ ( σ − m ω ) 1 h_\omega^{(m)}=\mathcal{L}_{\lambda(\sigma^{-1}\omega)}\cdots\mathcal{L}_{\lambda(\sigma^{-m}\omega)}\mathbf{1} h ω ( m ) = L λ ( σ − 1 ω ) ⋯ L λ ( σ − m ω ) 1
are L 1 L^1 L 1 -Cauchy: comparing two past lengths uses their common last m m m maps and two normalized cone inputs, whose difference after those maps is at most C ( 1 + m ) − ( 1 / β − 1 ) C(1+m)^{-(1/\beta-1)} C ( 1 + m ) − ( 1/ β − 1 ) . Local equicontinuity and the common integrable envelope A x − β Ax^{-\beta} A x − β preserve normalization and the cone. The limit is measurable and equivariant. The same comparison gives uniqueness among normalized equivariant cone families. This construction uses invertibility but not independence or mixing of the base.
Put
c ( ω ) = 1 2 h ω ( 1 / 2 + ) , c ‾ ≡ E c > 0 , p = P ( λ = α ) . c(\omega)=\frac{1}{2}h_\omega(1/2+),\qquad\overline{c}\equiv\mathbb{E}c>0,\qquad p=\mathbb{P}(\lambda=\alpha). c ( ω ) = 2 1 h ω ( 1/2 + ) , c ≡ E c > 0 , p = P ( λ = α ) .
When p > 0 p>0 p > 0 , put D p = ( p α 2 α ) − 1 D_p=(p\alpha2^\alpha)^{-1} D p = ( p α 2 α ) − 1 . The cone estimates give uniform positive bounds on c c c , and uniform Lipschitz bounds on the fibre densities restricted to Y Y Y . At an entrance y ∈ B ε = [ 1 / 2 , ( 1 + ε ) / 2 ] y\in B_\varepsilon=[1/2,(1+\varepsilon)/2] y ∈ B ε = [ 1/2 , ( 1 + ε ) /2 ] at time n n n , define
κ n ( y ) = inf { j ≥ 1 : T σ n ω j y ∈ Y } , ζ n , ε ( y ) = inf { k ≥ 0 : T σ n + 1 ω k ( 2 y − 1 ) > ε } . \kappa_n(y)=\inf\{j\ge1:T_{\sigma^n\omega}^j y\in Y\},\qquad
\zeta_{n,\varepsilon}(y)=\inf\{k\ge0:T_{\sigma^{n+1}\omega}^k(2y-1)>\varepsilon\}. κ n ( y ) = inf { j ≥ 1 : T σ n ω j y ∈ Y } , ζ n , ε ( y ) = inf { k ≥ 0 : T σ n + 1 ω k ( 2 y − 1 ) > ε } .
The full-return clock includes the right-branch step. The residence clock starts after it; for almost every entrance the neutral visits occur at times n + 1 , … , n + ζ n , ε n+1,\ldots,n+\zeta_{n,\varepsilon} n + 1 , … , n + ζ n , ε .
Theorem 9.1 (Joint excursion and residence process). If p > 0 p>0 p > 0 , then for almost every fixed ω \omega ω and every fixed probability ρ ≪ L e b \rho\ll\mathrm{Leb} ρ ≪ Leb , with x x x distributed according to ρ \rho ρ ,
∑ n ≥ 0 1 B ε ( T ω n x ) δ ( c ‾ ε , α κ n ( T ω n x ) ) , ε α ζ n , ε ( T ω n x ) ⟹ PRM ( d t ν ρ ( d z , d ω ) ) (55) \sum_{n\ge0}\mathbf{1}_{B_\varepsilon}(T_\omega^n x)\delta_{\left(\overline{c}\varepsilon,\alpha\kappa_n(T_\omega^n x)\right),\varepsilon^\alpha\zeta_{n,\varepsilon}(T_\omega^n x)}\Longrightarrow\operatorname{PRM}(dt\,\nu_\rho(dz,d\omega)) \tag*{(55)} n ≥ 0 ∑ 1 B ε ( T ω n x ) δ ( c ε , α κ n ( T ω n x ) ) , ε α ζ n , ε ( T ω n x ) ⟹ PRM ( d t ν ρ ( d z , d ω )) (55)
where convergence is in distribution for locally finite random measures on [ 0 , ∞ ) × [ 0 , ∞ ) 2 [0,\infty)\times[0,\infty)^2 [ 0 , ∞ ) × [ 0 , ∞ ) 2 with the vague topology. Here PRM denotes a Poisson random measure with the displayed intensity. Time zero and zero marks are included in the state space; the limiting intensity has no atom there. The measure ν p \nu_p ν p is the law of
( Z , W ) = ( D p U − α , D p ( U − α − 1 ) ) , U ∼ Uniform ( 0 , 1 ) . (Z,W)=(D_pU^{-\alpha},D_p(U^{-\alpha}-1)),\qquad U\sim\operatorname{Uniform}(0,1). ( Z , W ) = ( D p U − α , D p ( U − α − 1 )) , U ∼ Uniform ( 0 , 1 ) .
The same limit holds with the reference time coordinate ∑ j < n μ σ j ω ( B ε ) \sum_{j<n}\mu_{\sigma_j\omega}(B_\varepsilon) ∑ j < n μ σ j ω ( B ε ) . For every fixed T > 0 T>0 T > 0 ,
V ε ( t ) = ε α ∑ 0 ≤ j < ⌊ t / ( c ˉ ε ) ⌋ 1 [ 0 , ε ] ( T ω j x ) ⟹ V ( t ) = ∑ S i ≤ t W i in ( D ( [ 0 , T ] ) , M 1 ) , (56) V_\varepsilon(t)=\varepsilon^\alpha\sum_{0\le j<\lfloor t/(\bar c\varepsilon)\rfloor}\mathbf{1}_{[0,\varepsilon]}(T_\omega^jx)\Longrightarrow V(t)=\sum_{S_i\le t}W_i\quad\text{in }(D([0,T]),M_1), \tag*{(56)} V ε ( t ) = ε α 0 ≤ j < ⌊ t / ( c ˉ ε )⌋ ∑ 1 [ 0 , ε ] ( T ω j x ) ⟹ V ( t ) = S i ≤ t ∑ W i in ( D ([ 0 , T ]) , M 1 ) , (56)
where the S i S_i S i form a rate-one Poisson process and its iid residence marks have tail P ( W > w ) = ( 1 + w / D p ) − 1 / α \mathbb{P}(W>w)=(1+w/D_p)^{-1/\alpha} P ( W > w ) = ( 1 + w / D p ) − 1/ α . The environment may be nonmixing, and its parameter values may accumulate at α \alpha α ; no positive gap above the minimum is required.
Alternatively, let π = λ ∗ P \pi=\lambda_*\mathbb{P} π = λ ∗ P , F ( v ) = π ( [ α , v ] ) F(v)=\pi([\alpha,v]) F ( v ) = π ([ α , v ]) , and suppose F ( α + t ) ∼ C 0 t κ 0 L 0 ( 1 / t ) F(\alpha+t)\sim C_0t^{\kappa_0}L_0(1/t) F ( α + t ) ∼ C 0 t κ 0 L 0 ( 1/ t ) , where C 0 > 0 C_0>0 C 0 > 0 , κ 0 ≥ 0 \kappa_0\ge0 κ 0 ≥ 0 , and L 0 L_0 L 0 is positive, measurable and slowly varying. Assume there is a fixed δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) such that, for almost every ω \omega ω and every integer d ≥ 1 d\ge1 d ≥ 1 , finite constants C d ( ω ) , m d ( ω ) C_d(\omega),m_d(\omega) C d ( ω ) , m d ( ω ) satisfy
sup k ∈ Z , ∣ k ∣ ≤ m d v ∈ [ α , β ] ∣ ∑ i = 0 m − 1 1 { λ ( σ k + i ω ) ≤ v } − m F ( v ) ∣ ≤ C d ( ω ) m 1 − δ , m ≥ m d ( ω ) . (57) \sup_{\substack{k\in\mathbb{Z},\ |k|\le m^d\\v\in[\alpha,\beta]}}\left|\sum_{i=0}^{m-1}\mathbf{1}_{\{\lambda(\sigma^{k+i}\omega)\le v\}}-mF(v)\right|\le C_d(\omega)m^{1-\delta},\qquad m\ge m_d(\omega). \tag*{(57)} k ∈ Z , ∣ k ∣ ≤ m d v ∈ [ α , β ] sup i = 0 ∑ m − 1 1 { λ ( σ k + i ω ) ≤ v } − m F ( v ) ≤ C d ( ω ) m 1 − δ , m ≥ m d ( ω ) . (57)
No moment assumption on these constants is imposed. Set
h ε = ε − α ( log ( 1 / ε ) ) κ 0 α 2 α C 0 Γ ( κ 0 + 1 ) L 0 ( log ( 1 / ε ) ) . h_\varepsilon=\frac{\varepsilon^{-\alpha}(\log(1/\varepsilon))^{\kappa_0}}{\alpha^{2\alpha}C_0\Gamma(\kappa_0+1)L_0(\log(1/\varepsilon))}. h ε = α 2 α C 0 Γ ( κ 0 + 1 ) L 0 ( log ( 1/ ε )) ε − α ( log ( 1/ ε ) ) κ 0 .
Then the same conclusions hold with ε α \varepsilon^\alpha ε α replaced by h ε − 1 h_\varepsilon^{-1} h ε − 1 in both processes, and with ν p \nu_p ν p replaced by the law of ( U − α , U − α − 1 ) (U^{-\alpha},U^{-\alpha}-1) ( U − α , U − α − 1 ) . The limiting residence tail is ( 1 + w ) − 1 / α (1+w)^{-1/\alpha} ( 1 + w ) − 1/ α . This alternative permits atomless minimum laws, including index zero. The conclusions still hold for every fixed absolutely continuous initial distribution and with the reference time coordinate defined above. Every iid parameter law satisfies (55); dependent nonmixing examples are given below.
A complete-history Poisson lemma
General stationary and nonstationary marked rare-event criteria are established in [15 , 16 ] . Joint hitting-time and position limits based on short-time regularization, without classical mixing assumptions, are developed in [41 ] . Here full-return regularity gives the following physical-time history argument directly. It will identify the joint physical return/residence kernel once the intermittent clock is determined.
Lemma 9.2 (Complete-history Poisson limit). Fix a parameter sequence ( s n ) n ≥ 0 (s_n)_{n\ge0} ( s n ) n ≥ 0 in [ α , β ] ⊂ ( 0 , 1 ) [\alpha,\beta]\subset(0,1) [ α , β ] ⊂ ( 0 , 1 ) and cone probabilities μ n \mu_n μ n with ( T s n ) ∗ μ n = μ n + 1 (T_{s_n})_*\mu_n=\mu_{n+1} ( T s n ) ∗ μ n = μ n + 1 . Use the composition T n , h T_{n,h} T n , h defined in the sequential section. Suppose A n , ε ⊂ Y A_{n,\varepsilon}\subset Y A n , ε ⊂ Y are unions of full first-return atoms, have length at most C ε C\varepsilon C ε , and all selected atoms return within s ε s_\varepsilon s ε steps, where ε s ε → 0 \varepsilon s_\varepsilon\to0 ε s ε → 0 . Give each atom a constant mark via ξ n , ε : A n , ε → E \xi_{n,\varepsilon}:A_{n,\varepsilon}\to E ξ n , ε : A n , ε → E , where E E E is a compact metric space. Let increasing deterministic timestamps t n , ε t_{n,\varepsilon} t n , ε have at most C T / ε C_T/\varepsilon C T / ε observations on [ 0 , T ] [0,T] [ 0 , T ] . Define the deterministic intensity measure by
J ε ( I × G ) = ∑ n : t n , ε ∈ I μ n ( A n , ε ∩ { ξ n , ε ∈ G } ) . \mathcal{J}_\varepsilon(I\times G)=\sum_{n:t_{n,\varepsilon}\in I}\mu_n(A_{n,\varepsilon}\cap\{\xi_{n,\varepsilon}\in G\}). J ε ( I × G ) = n : t n , ε ∈ I ∑ μ n ( A n , ε ∩ { ξ n , ε ∈ G }) .
Assume I ε \mathcal{I}_{\varepsilon} I ε converges on time/mark continuity rectangles to d t ν \mathrm{d}t\,\nu d t ν , for a finite mark measure ν \nu ν . With X n = T 0 , n x X_n=T_{0,n}x X n = T 0 , n x and x x x distributed according to μ 0 \mu_0 μ 0 , the random measure
∑ n ≥ 0 1 A n , ε ( X n ) δ ( t n , ε , ξ n , ε ( X n ) ) \sum_{n\geq0}\mathbf{1}_{A_{n,\varepsilon}}(X_n)\delta_{(t_{n,\varepsilon},\xi_{n,\varepsilon}(X_n))} n ≥ 0 ∑ 1 A n , ε ( X n ) δ ( t n , ε , ξ n , ε ( X n ))
converges to that Poisson random measure. Physical gaps in the proof refer to the integer observation indices, not the rescaled timestamps.
Proof. Use the uniform full-return regularity, its preservation under positive mixtures, and the coupling in § 7 , in particular Lemma 7.2 . These hold with one fixed log-Lipschitz constant K K K , and loss e ( h ) → 0 e(h)\to0 e ( h ) → 0 . The interpolation argument gives, for every regular base probability η \eta η at time n n n and J ⊂ Y J\subset Y J ⊂ Y ,
∣ η ( T n , h − 1 J ) − μ n + h ( J ) ∣ ≤ C Leb ( J ) e ( h ) . (58) \left|\eta(T_{n,h}^{-1}J)-\mu_{n+h}(J)\right|\leq C\operatorname{Leb}(J)\sqrt{e(h)}. \tag*{(58)} η ( T n , h − 1 J ) − μ n + h ( J ) ≤ C Leb ( J ) e ( h ) . (58)
Consider a history of positive hits. After its last hit, split the conditional law into its full-atom components. Before a component returns it gives no mass to another base hit; at return its normalized density is regular, and afterwards its base restriction remains regular or zero. At the next hit restrict each positive base component to the new full atoms, normalize each nonzero piece, and reweight by its mass. Full-return regularity is scale invariant. Therefore neither the regularity constant nor the base sup-norm bound increases with the history length. Zero-mass histories can be omitted. Only positive-hit histories are conditioned on; factorial moments do not prescribe intermediate non-hits.
For any k k k distinct ordered observation times, let E i E_i E i denote the corresponding marked hit events in the initial probability space. This induction yields
μ 0 ( ⋂ i = 1 k E i ) ≤ ( C ε ) k . \mu_0\left(\bigcap_{i=1}^{k}E_i\right)\leq(C\varepsilon)^k. μ 0 ( i = 1 ⋂ k E i ) ≤ ( C ε ) k .
If successive physical gaps are at least s ε + g ε s_\varepsilon+g_\varepsilon s ε + g ε , every last-hit component has returned and mixed for at least g ε g_\varepsilon g ε steps. By (58) the next conditional probability differs from its marginal p i p_i p i by at most C ε e ( g ε ) C\varepsilon\sqrt{e(g_\varepsilon)} C ε e ( g ε ) . Iteration gives
∣ μ 0 ( ⋂ i = 1 k E i ) − ∏ i p i ∣ ≤ k ( C ε ) k e ( g ε ) . \left|\mu_0\left(\bigcap_{i=1}^{k}E_i\right)-\prod_i p_i\right|\leq k(C\varepsilon)^k\sqrt{e(g_\varepsilon)}. μ 0 ( i = 1 ⋂ k E i ) − i ∏ p i ≤ k ( C ε ) k e ( g ε ) .
Take g ε → ∞ g_\varepsilon\to\infty g ε → ∞ with ε g ε → 0 \varepsilon g_\varepsilon\to0 ε g ε → 0 . Among H ε ≤ C T / ε H_\varepsilon\leq C T/\varepsilon H ε ≤ C T / ε observations, the number of k k k -tuples with a short consecutive gap is at most C k H ε k − 1 ( s ε + g ε ) C_kH_\varepsilon^{k-1}(s_\varepsilon+g_\varepsilon) C k H ε k − 1 ( s ε + g ε ) . Their total contribution, and that of the corresponding marginal products, is O k ( ε ( s ε + g ε ) ) = o ( 1 ) O_k(\varepsilon(s_\varepsilon+g_\varepsilon))=o(1) O k ( ε ( s ε + g ε )) = o ( 1 ) . Summed factorization errors are O k ( e ( g ε ) ) O_k(\sqrt{e(g_\varepsilon)}) O k ( e ( g ε ) ) ; repeated-time diagonals cost O k ( ε ) O_k(\varepsilon) O k ( ε ) . Expanding mixed factorial moments of counts on disjoint rectangles now gives the products of the limiting intensities. Moreover the total count N ε N_\varepsilon N ε on a bounded window satisfies E ( N ε ) k ≤ C T k \mathbb{E}(N_\varepsilon)_k\leq C T^k E ( N ε ) k ≤ C T k , so its nonnegative factorial expansion gives E ( 1 + z ) N ε ≤ exp ( C T z ) \mathbb{E}(1+z)^{N_\varepsilon}\leq\exp(C Tz) E ( 1 + z ) N ε ≤ exp ( C T z ) for z ≥ 0 z\geq0 z ≥ 0 . These bounds ensure uniform integrability and moment determinacy. Mixed moments identify independent Poisson counts, and the first-moment bound gives local tightness. Approximation of compactly supported continuous functions by continuity rectangles identifies the limiting random measure.
Ergodic inverse clocks
Proof of Theorem 9.1. We first assume p > 0 p>0 p > 0 and take ρ = μ ω \rho=\mu_\omega ρ = μ ω . The discrepancy alternative and general fixed absolutely continuous initial laws are treated below. It remains to verify the intensities and then transfer residence marks to the occupation process. Put f = 1 { λ = α } f=1_{\{\lambda=\alpha\}} f = 1 { λ = α } , and, for rational ς > 0 \varsigma>0 ς > 0 , g ς = 1 { α < λ ≤ α + ς } g_{\varsigma}=1_{\{\alpha<\lambda\le\alpha+\varsigma\}} g ς = 1 { α < λ ≤ α + ς } , v ς = E g ς ↓ 0 v_{\varsigma}=\mathbb{E}g_{\varsigma}\downarrow0 v ς = E g ς ↓ 0 as ς ↓ 0 \varsigma\downarrow0 ς ↓ 0 . For rational 0 < η < p / 2 0<\eta<p/2 0 < η < p /2 and integer K K K , let D K , η , ς D_{K,\eta,\varsigma} D K , η , ς be the set of phases for which some backward prefix of length m ≥ K m\ge K m ≥ K has either f f f -frequency differing from p p p by more than η \eta η , or g ς g_{\varsigma} g ς -frequency differing from v ς v_{\varsigma} v ς by more than η \eta η . Backward Birkhoff gives P ( D K , η , ς ) → 0 \mathbb{P}(D_{K,\eta,\varsigma})\to0 P ( D K , η , ς ) → 0 as K → ∞ K\to\infty K → ∞ , with η , ς \eta,\varsigma η , ς fixed. Take one full-measure set on which forward Birkhoff holds for c c c and all these countably many bad-set indicators. For every fixed such set D D D and nonnegative integer shift j N = o ( N ) j_N=o(N) j N = o ( N ) ,
∣ 1 N ∑ n < N 1 D ( σ n + j N ω ) − 1 N ∑ n < N 1 D ( σ n ω ) ∣ ≤ 2 j N N . (59) \left|\frac{1}{N}\sum_{n<N}1_D(\sigma^{n+j_N}\omega)-\frac{1}{N}\sum_{n<N}1_D(\sigma^n\omega)\right|\le\frac{2j_N}{N}. \tag*{(59)} N 1 n < N ∑ 1 D ( σ n + j N ω ) − N 1 n < N ∑ 1 D ( σ n ω ) ≤ N 2 j N . (59)
Define inverse endpoints
b j ( n ) = ϕ λ ( σ n ω ) ∘ ⋯ ∘ ϕ λ ( σ n + j − 1 ω ) ( 1 / 2 ) . b_j(n)=\phi_{\lambda}(\sigma^n\omega)\circ\cdots\circ\phi_{\lambda}(\sigma^{n+j-1}\omega)(1/2). b j ( n ) = ϕ λ ( σ n ω ) ∘ ⋯ ∘ ϕ λ ( σ n + j − 1 ω ) ( 1/2 ) .
Their actual inverse application order starts at the terminal phase σ n + j ω \sigma^{n+j}\omega σ n + j ω and reads backwards. At a good terminal phase, writing q i q_i q i for successive inverse coordinates, the fast count after i ≥ K i\ge K i ≥ K steps is between ( p − η ) i (p-\eta)i ( p − η ) i and ( p + η ) i (p+\eta)i ( p + η ) i . Taylor expansion gives uniformly
q i − α − q i − 1 − α = { α 2 α + O ( q i α ) , λ = α , O ( q i λ − α ) , λ > α . q_i^{-\alpha}-q_{i-1}^{-\alpha}=
\begin{cases}
\alpha2^\alpha+O(q_i^\alpha), & \lambda=\alpha,\\
O(q_i^{\lambda-\alpha}), & \lambda>\alpha.
\end{cases} q i − α − q i − 1 − α = { α 2 α + O ( q i α ) , O ( q i λ − α ) , λ = α , λ > α .
All increments are bounded and fast ones have a positive uniform lower bound. Hence q i ≤ C i − 1 / α q_i\le C i^{-1/\alpha} q i ≤ C i − 1/ α for i ≥ K i\ge K i ≥ K . The near-minimum slow symbols contribute at most C ( v ς + η ) j C(v_{\varsigma}+\eta)j C ( v ς + η ) j ; the remaining slow symbols contribute at most C ∑ i ≤ j i − ς / α C\sum_{i\le j}i^{-\varsigma/\alpha} C ∑ i ≤ j i − ς / α . The fast error is O ( log ( 1 + j ) ) O(\log(1+j)) O ( log ( 1 + j )) , and the initial prefix costs O ( K ) O(K) O ( K ) . Thus
∣ b j ( n ) − α − p α 2 α j ∣ ≤ C ( η + v ς ) j + C K + C log ( 1 + j ) + C ∑ i ≤ j i − ς / α . (60) \left|b_j(n)^{-\alpha}-p\alpha2^\alpha j\right|\le C(\eta+v_{\varsigma})j+CK+C\log(1+j)+C\sum_{i\le j}i^{-\varsigma/\alpha}. \tag*{(60)} b j ( n ) − α − p α 2 α j ≤ C ( η + v ς ) j + C K + C log ( 1 + j ) + C i ≤ j ∑ i − ς / α . (60)
The last sum is o ( j ) o(j) o ( j ) for each fixed ς > 0 \varsigma>0 ς > 0 . Constants multiplying η + v ς \eta+v_{\varsigma} η + v ς can be chosen uniformly as ς ↓ 0 \varsigma\downarrow0 ς ↓ 0 ; the remainder convergence need not be uniform in ς \varsigma ς .
Fix t , T > 0 t,T>0 t , T > 0 , put N ε ( T ) = ⌊ T / ( c ˉ ε ) ⌋ N_\varepsilon(T)=\lfloor T/(\bar c\varepsilon)\rfloor N ε ( T ) = ⌊ T / ( c ˉ ε )⌋ , ℓ ε = ⌊ t ε − α ⌋ \ell_\varepsilon=\lfloor t\varepsilon^{-\alpha}\rfloor ℓ ε = ⌊ t ε − α ⌋ , and define the clipped threshold
U n , ε ( t ) = min { 1 , b ℓ ε − 1 ( n + 1 ) / ε } . U_{n,\varepsilon}(t)=\min\{1,b_{\ell_\varepsilon-1}(n+1)/\varepsilon\}. U n , ε ( t ) = min { 1 , b ℓ ε − 1 ( n + 1 ) / ε } .
Its word ends at σ n + ℓ ε ω \sigma^{n+\ell_\varepsilon}\omega σ n + ℓ ε ω , whose shift is o ( N ε ( T ) ) o(N_\varepsilon(T)) o ( N ε ( T )) since α < 1 \alpha<1 α < 1 . On good phases (58) gives discrepancy from u ( t ) = min { 1 , ( D p / t ) 1 / α } u(t)=\min\{1,(D_p/t)^{1/\alpha}\} u ( t ) = min { 1 , ( D p / t ) 1/ α } at most C t ( η + v ς ) + o K , η , ς , t ( 1 ) C_t(\eta+v_{\varsigma})+o_{K,\eta,\varsigma,t}(1) C t ( η + v ς ) + o K , η , ς , t ( 1 ) . On bad phases it is at most one. Equation (57) therefore gives
lim sup ε ↓ 0 1 N ε ( T ) ∑ n < N ε ( T ) ∣ U n , ε ( t ) − u ( t ) ∣ ≤ P ( D K , η , ς ) + C t ( η + v ς ) . (61) \limsup_{\varepsilon\downarrow0}\frac{1}{N_\varepsilon(T)}\sum_{n<N_\varepsilon(T)}\left|U_{n,\varepsilon}(t)-u(t)\right|\le\mathbb{P}(D_{K,\eta,\varsigma})+C_t(\eta+v_{\varsigma}). \tag*{(61)} ε ↓ 0 lim sup N ε ( T ) 1 n < N ε ( T ) ∑ ∣ U n , ε ( t ) − u ( t ) ∣ ≤ P ( D K , η , ς ) + C t ( η + v ς ) . (61)
First let ε → 0 \varepsilon\to0 ε → 0 , then K → ∞ K\to\infty K → ∞ , η → 0 \eta\to0 η → 0 , and finally ς → 0 \varsigma\to0 ς → 0 . The average discrepancy is zero. The clipping is needed because unclipped inverse endpoints need not converge in mean.
Uniform base Lipschitz regularity gives
μ σ n ω ( B ε ∩ { ε α κ n > t } ) = ε c ( σ n ω ) U n , ε ( t ) + O ( ε 2 ) . \mu_{\sigma^n\omega}(B_\varepsilon\cap\{\varepsilon^\alpha\kappa_n>t\})=\varepsilon c(\sigma^n\omega)U_{n,\varepsilon}(t)+O(\varepsilon^2). μ σ n ω ( B ε ∩ { ε α κ n > t }) = ε c ( σ n ω ) U n , ε ( t ) + O ( ε 2 ) .
Use boundedness of c c c , (59), and Birkhoff for c c c : the sum up to N ε ( T ) N_\varepsilon(T) N ε ( T ) tends to T u ( t ) T u(t) T u ( t ) . This does not assume independence of c c c and the parameter word. Rational t , T t,T t , T , continuity, monotonicity and differences of prefixes give all time/mark continuity rectangles. The same argument without a survival threshold gives total intensity T T T . A finite grid and monotonicity give uniform convergence of the compensator to c ε n ‾ \overline{c\varepsilon n} c ε n on bounded time windows.
Full-return and residence marks
Fix L > D p L>D_p L > D p . Replace B ε B_\varepsilon B ε by its inner full-atom union and retain returns κ ≤ L ε − α \kappa\le L\varepsilon^{-\alpha} κ ≤ L ε − α . The single-cut estimate from the sequential proof changes expected counts by O ( ε α ) O(\varepsilon^\alpha) O ( ε α ) on O ( ε − 1 ) O(\varepsilon^{-1}) O ( ε − 1 ) observations; equivariance and a union bound give the same bound for the probability of any changed hit. Return marks are constant on full atoms, and ε s ε ≤ L ε 1 − α → 0 \varepsilon s_\varepsilon\le L\varepsilon^{1-\alpha}\to0 ε s ε ≤ L ε 1 − α → 0 . The complete-history lemma now yields the truncated full-return process. The expected number of omitted long marks tends to T ( D p / L ) 1 / α T(D_p/L)^{1/\alpha} T ( D p / L ) 1/ α ; Markov’s inequality and L → ∞ L\to\infty L → ∞ remove the cutoff after ε → 0 \varepsilon\to0 ε → 0 .
To identify residence jointly, let q m ε ( n + 1 ) q_m^\varepsilon(n+1) q m ε ( n + 1 ) be the same inverse word started at ε \varepsilon ε , and take m = ⌊ w ε − α ⌋ m=\lfloor w\varepsilon^{-\alpha}\rfloor m = ⌊ w ε − α ⌋ , w > 0 w>0 w > 0 . All intermediate coordinates are at most ε \varepsilon ε . The increment expansion on a good terminal phase yields
ε α ( q m ε ) − α = 1 + p α 2 α w + O w ( η + v ς ) + o K , ς , w ( 1 ) . \varepsilon^\alpha(q_m^\varepsilon)^{-\alpha}=1+p\alpha2^\alpha w+O_w(\eta+v_\varsigma)+o_{K,\varsigma,w}(1). ε α ( q m ε ) − α = 1 + p α 2 α w + O w ( η + v ς ) + o K , ς , w ( 1 ) .
The scaled fast error is O ( m ε 2 α ) O(m\varepsilon^{2\alpha}) O ( m ε 2 α ) , near-minimum slow error is O ( m ε α ( v ς + η ) ) O(m\varepsilon^\alpha(v_\varsigma+\eta)) O ( m ε α ( v ς + η )) , and separated slow error is O ( m ε α + ς ) O(m\varepsilon^{\alpha+\varsigma}) O ( m ε α + ς ) ; the fixed initial prefix and integer rounding vanish. Its terminal shift m + 1 m+1 m + 1 is again o ( ε − 1 ) o(\varepsilon^{-1}) o ( ε − 1 ) . The ratio q m ε / ε q_m^\varepsilon/\varepsilon q m ε / ε is already bounded by one, so the same bad-set argument gives averaged convergence to ( 1 + w / D p ) − 1 / α (1+w/D_p)^{-1/\alpha} ( 1 + w / D p ) − 1/ α .
The return and residence survival sets have the same left endpoint zero after the right branch. Their joint upper endpoint is min { ε , b ℓ ε − 1 ( n + 1 ) , q m ε ( n + 1 ) } \min\{\varepsilon,b_{\ell\varepsilon^{-1}}(n+1),q_m^\varepsilon(n+1)\} min { ε , b ℓ ε − 1 ( n + 1 ) , q m ε ( n + 1 )} . Since minimum is Lipschitz in bounded ratios, their joint cumulative intensity tends to
T min { 1 , ( D p / t ) 1 / α , ( 1 + w / D p ) − 1 / α } . (62) T\min\{1,(D_p/t)^{1/\alpha},(1+w/D_p)^{-1/\alpha}\}. \tag*{(62)} T min { 1 , ( D p / t ) 1/ α , ( 1 + w / D p ) − 1/ α } . (62)
This is precisely the joint tail of the displayed ( Z , W ) (Z,W) ( Z , W ) . Total intensity and the two marginal tails give tightness of the finite joint-intensity measures, and rational upper rectangles identify their weak limit. The kernel has no atom at Z = L Z=L Z = L , and the prelimit inequality ζ ≤ κ − 1 \zeta\le\kappa-1 ζ ≤ κ − 1 bounds the residence coordinate on Z ≤ L Z\le L Z ≤ L . For every η > 0 \eta>0 η > 0 , the limiting measure of the closed set { Z ≤ L , ∣ W − ( Z − D p ) + ∣ ≥ η } \{Z\le L,\lvert W-(Z-D_p)_+\rvert\ge\eta\} { Z ≤ L , ∣ W − ( Z − D p ) + ∣ ≥ η } is zero. Portmanteau therefore gives
∑ n < N ε ( T ) μ σ n ω ( B ε ∩ { ε α κ n ≤ L , ∣ ε α ζ n , ε − ( ε α κ n − D p ) + ∣ ≥ η } ) ⟶ 0. \sum_{n<N_\varepsilon(T)}\mu_{\sigma^n\omega}\left(B_\varepsilon\cap\{\varepsilon^\alpha\kappa_n\le L,\lvert\varepsilon^\alpha\zeta_{n,\varepsilon}-(\varepsilon^\alpha\kappa_n-D_p)_+\rvert\ge\eta\}\right)\longrightarrow0. n < N ε ( T ) ∑ μ σ n ω ( B ε ∩ { ε α κ n ≤ L , ∣ ε α ζ n , ε − ( ε α κ n − D p ) + ∣ ≥ η } ) ⟶ 0.
By equivariance and a union bound, no retained hit has such a discrepancy with probability tending to one. Tightness of the number of hits then transfers the residence coordinate from the continuous function ( z − D p ) + (z-D_p)_+ ( z − D p ) + of the full-return mark. This proves the joint process (53).
Occupation as compressed residence clusters
The left branch increases the coordinate. Thus every neutral visit belongs to a right-branch entrance cluster, unless the orbit starts in [ 0 , ε ] [0,\varepsilon] [ 0 , ε ] , an event of probability O ( ε 1 − β ) O(\varepsilon^{1-\beta}) O ( ε 1 − β ) . For returns bounded by L ε − α L\varepsilon^{-\alpha} L ε − α , each cluster spans at most c L ε 1 − α cL\varepsilon^{1-\alpha} c L ε 1 − α in rescaled time. A cluster crossing a fixed endpoint T T T must enter in the preceding physical window of length L ε − α + 1 L\varepsilon^{-\alpha}+1 L ε − α + 1 ; uniform base bounds make the probability of such an entrance O ( L ε 1 − α + ε ) O(L\varepsilon^{1-\alpha}+\varepsilon) O ( L ε 1 − α + ε ) .
Collapse each retained complete cluster to one jump at its entrance, of height ε α ζ \varepsilon^\alpha\zeta ε α ζ . For fixed L L L , joint marked convergence gives convergence of this finite-jump process: limit times are distinct and avoid prescribed endpoints, so a time change matches the finite sets of times and heights.
The actual occupation staircase and its collapsed vertical segment have the same ordered height ranges. Parametrize their completed graphs by matching heights, pausing when necessary; their time coordinates differ by at most the maximal cluster duration plus a mesh step. Hence their M 1 M_1 M 1 distance is at most c L ε 1 − α + O ( ε ) cL\varepsilon^{1-\alpha}+O(\varepsilon) c L ε 1 − α + O ( ε ) outside the initial/final exceptional events. Remove long marks after taking ε → 0 \varepsilon\to0 ε → 0 , and obtain (56) .
Discrepancy-controlled inverse clocks
For the alternative case, write b ( v ) = v κ 0 / L 0 ( v ) b(v)=v^{\kappa_0}/L_0(v) b ( v ) = v κ 0 / L 0 ( v ) , a u = u − α b ( log ( 1 / u ) ) a_u=u^{-\alpha}b(\log(1/u)) a u = u − α b ( log ( 1/ u )) , and use the constants A = α κ 0 + 1 2 α C 0 Γ ( κ 0 + 1 ) A=\alpha^{\kappa_0+1}2^\alpha C_0\Gamma(\kappa_0+1) A = α κ 0 + 1 2 α C 0 Γ ( κ 0 + 1 ) , D ∗ = ( α 2 α C 0 Γ ( κ 0 + 1 ) ) − 1 D_*=(\alpha2^\alpha C_0\Gamma(\kappa_0+1))^{-1} D ∗ = ( α 2 α C 0 Γ ( κ 0 + 1 ) ) − 1 . Extend b b b to be bounded above and away from zero on finite argument intervals. We prove the two word profiles needed here directly, without using the iid conditional-mean or integrable-envelope assertions of Lemma 8.1 .
On the full environment set of (57) , for each fixed polynomial phase exponent D D D , we prove the compact limit (64) starting at u u u , uniformly on compact scaled time intervals, and the deep limit (65) whenever its initial-coordinate condition holds. The phase windows are respectively a u D a_u^D a u D and L D L^D L D .
Read an inverse word in application order as v 1 , v 2 , … v_1,v_2,\ldots v 1 , v 2 , … , and put q i = φ v i ( q i − 1 ) q_i=\varphi_{v_i}(q_{i-1}) q i = φ v i ( q i − 1 ) , z i = q i − α z_i=q_i^{-\alpha} z i = q i − α . The deterministic inverse expansion gives
z i − z i − 1 = f z i − 1 ( v i ) + O ( z i − 1 − 1 ) , f z ( s ) = α 2 s z − ( s − α ) / α , 0 < z i − z i − 1 ≤ C . z_i-z_{i-1}=f_{z_{i-1}}(v_i)+O(z_{i-1}^{-1}),\qquad f_z(s)=\alpha2^s z^{-(s-\alpha)/\alpha},\qquad0<z_i-z_{i-1}\le C. z i − z i − 1 = f z i − 1 ( v i ) + O ( z i − 1 − 1 ) , f z ( s ) = α 2 s z − ( s − α ) / α , 0 < z i − z i − 1 ≤ C .
For large z z z , the function f z f_z f z is decreasing in s s s , has uniformly bounded variation, and sup s ∣ ∂ z f z ( s ) ∣ ≤ C / ( z log z ) \sup_s|\partial_zf_z(s)|\le C/(z\log z) sup s ∣ ∂ z f z ( s ) ∣ ≤ C / ( z log z ) . To see the last bound, write s = α + v s=\alpha+v s = α + v and use sup v ≥ 0 v e − v t ≤ 1 / ( e t ) \sup_{v\ge0}ve^{-vt}\le1/(et) sup v ≥ 0 v e − v t ≤ 1/ ( e t ) , with t = log z / α − log 2 t=\log z/\alpha-\log2 t = log z / α − log 2 . The spatial average
M ( z ) = ∫ f z ( s ) d π ( s ) ∼ A / b ( log z ) M(z)=\int f_z(s)\,\mathrm{d}\pi(s)\sim A/b(\log z) M ( z ) = ∫ f z ( s ) d π ( s ) ∼ A / b ( log z )
follows from the Laplace–Stieltjes calculation in the neutral normalization proof. It is not a conditional next-symbol mean.
Freeze the coordinate at the start of a block of m m m symbols. Integration by parts against its empirical CDF and (57) bound its frozen error by C C d ( ω ) m 1 − δ CC_d(\omega)m^{1-\delta} C C d ( ω ) m 1 − δ . Both measures have mass m m m , so there is no endpoint mass error, including for atomic π \pi π . If the coordinates are at least Z min Z_{\min} Z m i n , bounded increments and the derivative estimate give adaptive error C m 2 / ( Z min log Z min ) Cm^2/(Z_{\min}\log Z_{\min}) C m 2 / ( Z m i n log Z m i n ) per block, for both f z f_z f z and M ( z ) M(z) M ( z ) . Splitting N N N steps into complete blocks and one remainder therefore yields, uniformly for every prefix,
z N − z 0 = ∑ i = 1 N M ( z i − 1 ) + E N , z_N-z_0=\sum_{i=1}^{N}M(z_{i-1})+E_N, z N − z 0 = i = 1 ∑ N M ( z i − 1 ) + E N ,
∣ E N ∣ ≤ C ω ( N m − δ + N m Z min log Z min + N Z min + m ) . (63) |E_N|\le C_\omega\left(Nm^{-\delta}+\frac{Nm}{Z_{\min}\log Z_{\min}}+\frac{N}{Z_{\min}}+m\right). \tag*{(63)} ∣ E N ∣ ≤ C ω ( N m − δ + Z m i n log Z m i n N m + Z m i n N + m ) . (63)
For fixed window and block exponents (and fixed ϖ , η \varpi,\eta ϖ , η below), choose one sufficiently large d d d . Constants and cutoffs may depend on these choices, ω \omega ω and π \pi π , but not on the radius, word length or terminal phase inside that window. Endpoint parameter limits can be taken along countable rational choices on the same event. The third term is the inverse Taylor remainder and the last term is the incomplete block. Reverse blocks are contiguous blocks of the original two-sided word. If the total word length is at most R R R and its terminal phase has absolute value at most R D R^D R D , every block start has absolute value at most R D + R R^D+R R D + R . When m m m is a fixed positive power of R R R , up to subpower factors, one fixed sufficiently large integer d d d makes R D + R ≤ m d R^D+R\le m^d R D + R ≤ m d . Thus the same C d ( ω ) C_d(\omega) C d ( ω ) controls all blocks; it does not vary with the scale.
For compact residence windows, let q 0 = u q_0=u q 0 = u , z 0 = u − α z_0=u^{-\alpha} z 0 = u − α , N ≤ T a u N\leq Ta_u N ≤ T a u , and m = ⌊ z 0 θ ⌋ m=\lfloor z_0^\theta\rfloor m = ⌊ z 0 θ ⌋ , 0 < θ < 1 0<\theta<1 0 < θ < 1 . Then z 0 ≤ z i ≤ z 0 + C N z_0\leq z_i\leq z_0+CN z 0 ≤ z i ≤ z 0 + C N , so log z i / log z 0 → 1 \log z_i/\log z_0\to1 log z i / log z 0 → 1 uniformly. The uniform-convergence theorem for regular variation gives M ( z i ) ∼ A / b ( log z 0 ) M(z_i)\sim A/b(\log z_0) M ( z i ) ∼ A / b ( log z 0 ) . With Z min = z 0 Z_{\min}=z_0 Z m i n = z 0 , all four errors in (63) , divided by z 0 z_0 z 0 , tend to zero: b ( log ( 1 / u ) ) b(\log(1/u)) b ( log ( 1/ u )) is subpower in z 0 z_0 z 0 . Since b ( α v ) / b ( v ) → α κ 0 b(\alpha v)/b(v)\to\alpha^{\kappa_0} b ( α v ) / b ( v ) → α κ 0 ,
q ⌊ t a u ⌋ ( u ) / u ⟶ ( 1 + t / D ∗ ) − 1 / α . (64) q_{\lfloor ta_u\rfloor}(u)/u\longrightarrow(1+t/D_*)^{-1/\alpha}. \tag*{(64)} q ⌊ t a u ⌋ ( u ) / u ⟶ ( 1 + t / D ∗ ) − 1/ α . (64)
This is uniform for t t t in compact subsets of [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) and terminal phases of absolute value at most a u D a_u^D a u D , for each fixed D D D . The estimates hold directly for all real radii.
For the deep profile, let L → ∞ L\to\infty L → ∞ , z 0 = u − α = o ( L / b ( log L ) ) z_0=u^{-\alpha}=o(L/b(\log L)) z 0 = u − α = o ( L / b ( log L )) , and bound terminal phases by L D L^D L D . Fix 0 < ϖ < 1 0<\varpi<1 0 < ϖ < 1 and η > 0 \eta>0 η > 0 with α + η < 1 \alpha+\eta<1 α + η < 1 , and put χ = α / ( α + η ) \chi=\alpha/(\alpha+\eta) χ = α / ( α + η ) . The fixed band [ α , α + η ] [\alpha,\alpha+\eta] [ α , α + η ] has mass p η > 0 p_\eta>0 p η > 0 . For each reverse prefix of length i ≥ L ϖ i\geq L^\varpi i ≥ L ϖ , use (57) with a fixed integer d > max ( D , 1 ) / ϖ d>\max(D,1)/\varpi d > max ( D , 1 ) / ϖ . Its fast-symbol count is at least p η i / 2 p_\eta i/2 p η i /2 , eventually and uniformly. Each such symbol increases q − ( α + η ) q^{-(\alpha+\eta)} q − ( α + η ) by a fixed positive amount; the other increments are nonnegative. Hence, on these prefixes,
c η L ϖ χ ≤ z i ≤ z 0 + C L ≤ C ′ L . c_\eta L^{\varpi\chi}\leq z_i\leq z_0+CL\leq C'L. c η L ϖ χ ≤ z i ≤ z 0 + C L ≤ C ′ L .
Discard the first ⌊ L ϖ ⌋ \lfloor L^\varpi\rfloor ⌊ L ϖ ⌋ steps, costing O ( L ϖ ) O(L^\varpi) O ( L ϖ ) , and set m = ⌊ L θ ⌋ m=\lfloor L^\theta\rfloor m = ⌊ L θ ⌋ , 0 < θ < ϖ χ 0<\theta<\varpi\chi 0 < θ < ϖ χ . With Z min = c η L ϖ χ Z_{\min}=c_\eta L^{\varpi\chi} Z m i n = c η L ϖ χ , each error in (63) , multiplied by b ( log L ) / L b(\log L)/L b ( log L ) / L , vanishes. Uniform convergence on the logarithmic ratio interval [ ϖ χ + o ( 1 ) , 1 + o ( 1 ) ] [\varpi\chi+o(1),1+o(1)] [ ϖ χ + o ( 1 ) , 1 + o ( 1 )] bounds the scaled mean drift between A ( 1 − o ( 1 ) ) A(1-o(1)) A ( 1 − o ( 1 )) and A ( ϖ χ ) − κ 0 ( 1 + o ( 1 ) ) A(\varpi\chi)^{-\kappa_0}(1+o(1)) A ( ϖ χ ) − κ 0 ( 1 + o ( 1 )) . The initial coordinate and discarded prefix are negligible. Thus
A ≤ lim inf z L b ( log L ) L ≤ lim sup z L b ( log L ) L ≤ A ( ϖ χ ) − κ 0 . A\leq\liminf\frac{z_Lb(\log L)}{L}\leq\limsup\frac{z_Lb(\log L)}{L}\leq A(\varpi\chi)^{-\kappa_0}. A ≤ lim inf L z L b ( log L ) ≤ lim sup L z L b ( log L ) ≤ A ( ϖ χ ) − κ 0 .
First take L → ∞ L\to\infty L → ∞ , then ϖ ↑ 1 \varpi\uparrow1 ϖ ↑ 1 and η ↓ 0 \eta\downarrow0 η ↓ 0 . This proves
q L ( u ) ∼ A − 1 / α L − 1 / α b ( log L ) 1 / α , u − α = o ( L / b ( log L ) ) , (65) q_L(u)\sim A^{-1/\alpha}L^{-1/\alpha}b(\log L)^{1/\alpha},\qquad u^{-\alpha}=o(L/b(\log L)), \tag*{(65)} q L ( u ) ∼ A − 1/ α L − 1/ α b ( log L ) 1/ α , u − α = o ( L / b ( log L )) , (65)
uniformly in each polynomial terminal-phase window. Index zero is included; no minimum atom or moment of the discrepancy constants was used.
Apply the compact and deep profiles just proved. With b ( v ) = v κ 0 / L 0 ( v ) b(v)=v^{\kappa_0}/L_0(v) b ( v ) = v κ 0 / L 0 ( v ) and A A A , D ∗ D_* D ∗ as above, h ε = D ∗ ε − α b ( log ( 1 / ε ) ) h_\varepsilon=D_*\varepsilon^{-\alpha}b(\log(1/\varepsilon)) h ε = D ∗ ε − α b ( log ( 1/ ε )) and A D ∗ = α κ 0 AD_*=\alpha^{\kappa_0} A D ∗ = α κ 0 . For each fixed t > 0 t>0 t > 0 , log ( t h ε ) / log ( 1 / ε ) → α \log(th_\varepsilon)/\log(1/\varepsilon)\to\alpha log ( t h ε ) / log ( 1/ ε ) → α , hence b ( log ( t h ε ) ) / b ( log ( 1 / ε ) ) → α κ 0 b(\log(th_\varepsilon))/b(\log(1/\varepsilon))\to\alpha^{\kappa_0} b ( log ( t h ε )) / b ( log ( 1/ ε )) → α κ 0 . The deep profile started at 1 / 2 1/2 1/2 therefore gives b ⌊ t h ε ⌋ − 1 ( n + 1 ) / ε → t − 1 / α b_{\lfloor th_\varepsilon\rfloor-1}(n+1)/\varepsilon\to t^{-1/\alpha} b ⌊ t h ε ⌋ − 1 ( n + 1 ) / ε → t − 1/ α ; the compact profile gives q ⌊ w h ε ⌋ ( n + 1 ) / ε → ( 1 + w ) − 1 / α q_{\lfloor wh_\varepsilon\rfloor}(n+1)/\varepsilon\to(1+w)^{-1/\alpha} q ⌊ w h ε ⌋ ( n + 1 ) / ε → ( 1 + w ) − 1/ α , for w ≥ 0 w\geq0 w ≥ 0 . Both limits are uniform over n < N ε ( T ) n<N_\varepsilon(T) n < N ε ( T ) : choose an integer d > 1 / α d>1/\alpha d > 1/ α in the polynomial terminal-phase windows of those profiles. Indeed h ε h_\varepsilon h ε is ε − α \varepsilon^{-\alpha} ε − α times a subpower correction, so these windows contain every phase n + O ( h ε ) n+O(h_\varepsilon) n + O ( h ε ) . The single right-branch step and integer rounding vanish on this scale.
The common landing endpoint and the uniform base trace expansion now give
∑ n < N ε ( T ) μ σ n ω ( B ε ∩ { κ n / h ε > t , ζ n , ε / h ε > w } ) ⟶ T min { 1 , t − 1 / α , ( 1 + w ) − 1 / α } . \sum_{n<N_\varepsilon(T)}\mu_{\sigma_n\omega}\left(B_\varepsilon\cap\{\kappa_n/h_\varepsilon>t,\ \zeta_{n,\varepsilon}/h_\varepsilon>w\}\right)\longrightarrow T\min\{1,t^{-1/\alpha},(1+w)^{-1/\alpha}\}. n < N ε ( T ) ∑ μ σ n ω ( B ε ∩ { κ n / h ε > t , ζ n , ε / h ε > w } ) ⟶ T min { 1 , t − 1/ α , ( 1 + w ) − 1/ α } .
The summed trace error is O ( ε ) O(\varepsilon) O ( ε ) ; Birkhoff applies to the fixed bounded function c c c , without independence from inverse words. These joint intensities identify the displayed shared-U U U law. Retain full returns κ ≤ L h ε \kappa\leq Lh_\varepsilon κ ≤ L h ε , L > 1 L>1 L > 1 . The inner-atom error remains O ( ε α ) O(\varepsilon^\alpha) O ( ε α ) , and ε ∣ L h ε ∣ → 0 \varepsilon\lvert Lh_\varepsilon\rvert\to0 ε ∣ L h ε ∣ → 0 , so Lemma 9.2 gives the truncated full-return process. The omitted-return mean tends to T L − 1 / α TL^{-1/\alpha} T L − 1/ α . On retained marks, the joint-intensity limit assigns zero mass to { Z ≤ L , ∣ W − ( Z − 1 ) + ∣ ≥ η } \{Z\leq L,\ \lvert W-(Z-1)_+\rvert\geq\eta\} { Z ≤ L , ∣ W − ( Z − 1 ) + ∣ ≥ η } , η > 0 \eta>0 η > 0 . The preceding Portmanteau and union-bound argument thus transfers actual residence from the return mark. Cluster compression uses width at most c ˉ L ε h ε → 0 \bar cL\varepsilon h_\varepsilon\to0 c ˉ L ε h ε → 0 , with endpoint-crossing probability O ( L ε h ε + ε ) O(L\varepsilon h_\varepsilon+\varepsilon) O ( L ε h ε + ε ) .
Letting L → ∞ L \to\infty L → ∞ after ε → 0 \varepsilon\to0 ε → 0 proves the joint and M 1 M_1 M 1 occupation limits, including the reference time change.
For a general fixed ρ ≪ Leb \rho\ll\operatorname{Leb} ρ ≪ Leb , intersect the good environment set above with all its integer shifts. Approximation of the density of ρ \rho ρ in L 1 L^1 L 1 by normalized nonnegative Hölder densities, the uniform memory bound in [31 ] , and transfer contraction give
d k = ∥ ( T ω k ) ∗ ρ − μ σ k ω ∥ T V ⟶ 0 ( k → ∞ ) . d_k = \lVert(T_\omega^k)_*\rho-\mu_{\sigma^k\omega}\rVert_{\mathrm{TV}} \longrightarrow0 \qquad(k \to\infty). d k = ∥( T ω k ) ∗ ρ − μ σ k ω ∥ TV ⟶ 0 ( k → ∞ ) .
Fix k k k before sending ε → 0 \varepsilon\to0 ε → 0 . Mapping the initial state to its entire future process does not increase total variation, so the process started at time k k k differs in law by at most d k d_k d k from the reference process at σ k ω \sigma^k\omega σ k ω . The probability of an entrance during the first k k k observations tends to zero, since each fixed-time pushforward of ρ \rho ρ is absolutely continuous. All later marks are unchanged by reindexing. Their timestamps shift by c ˉ ε k \bar{c}\varepsilon k c ˉ ε k , or by at most C ε k C\varepsilon k C ε k for the reference compensator; these shifts vanish in the vague topology, using local tightness of the reference counts. For occupation, removing the first k k k and adding the last k k k observations changes the process by at most 2 k ε α 2k\varepsilon^\alpha 2 k ε α , or 2 k / h ε 2k/h_\varepsilon 2 k / h ε in the discrepancy alternative, uniformly on [ 0 , T ] [0,T] [ 0 , T ] , and hence negligibly in M 1 M_1 M 1 . First let ε → 0 \varepsilon\to0 ε → 0 , then k → ∞ k \to\infty k → ∞ . Both limits therefore hold under ρ \rho ρ , on the same full environment set. □
The residence law has finite mean D / ( 1 / α − 1 ) D/(1/\alpha-1) D / ( 1/ α − 1 ) , with D = D p D=D_p D = D p in the ergodic atom normalization and D = 1 D=1 D = 1 in the discrepancy alternative. Its second moment is finite precisely when α < 1 / 2 \alpha<1/2 α < 1/2 ; this is a statement about the limiting entrance mark, not convergence of prelimit moments. The J 1 J_1 J 1 topology cannot give the occupation limit: every prelimit jump has height ε α \varepsilon^\alpha ε α , or h ε − 1 h_\varepsilon^{-1} h ε − 1 in the discrepancy alternative, tending to zero, whereas the limit has positive jumps. The monotone cluster compression is exactly what M 1 M_1 M 1 allows. In particular P ( V ( t ) = 0 ) = e − t \mathbb{P}(V(t)=0)=e^{-t} P ( V ( t ) = 0 ) = e − t , reflecting the possibility of no entrance in a rare-event window. This limit, obtained by shrinking a fixed target while enlarging its observation window, is distinct from an almost-sure strong law for one fixed target schedule.
For a minimum atom of mass p p p , take κ 0 = 0 \kappa_0=0 κ 0 = 0 , C 0 = p C_0=p C 0 = p , L 0 = 1 L_0=1 L 0 = 1 . Then the alternative scale is h ε = D p ε − α h_\varepsilon=D_p\varepsilon^{-\alpha} h ε = D p ε − α , recovering the first normalization after multiplication by D p D_p D p . For uniform noise on [ α , β ] [\alpha,\beta] [ α , β ] , α < β \alpha<\beta α < β , it is h ε = ( β − α ) ε − α log ( 1 / ε ) / ( α 2 α ) h_\varepsilon=(\beta-\alpha)\varepsilon^{-\alpha}\log(1/\varepsilon)/(\alpha2^\alpha) h ε = ( β − α ) ε − α log ( 1/ ε ) / ( α 2 α ) . The corresponding logarithmic inverse-endpoint correction is already present in [6 ] ; the same clock here normalizes the coupled return and residence processes.
To check (55) for iid laws, write the symbols as generalized quantiles of iid uniforms. For a length-m m m uniform block, the empirical count at j / m j/m j / m has deviation probability at most 2 exp ( − 2 a 2 / m ) 2\exp(-2a^2/m) 2 exp ( − 2 a 2 / m ) . Indeed the logarithm of the moment generating function of a centred Bernoulli variable has second derivative at most 1 / 4 1/4 1/4 ; integration and exponential Markov give this bound. Take a = m 3 / 4 / 4 a=m^{3/4}/4 a = m 3/4 /4 , and union over m + 1 m+1 m + 1 grid points and ∣ k ∣ ≤ m d |k|\le m^d ∣ k ∣ ≤ m d . The resulting bound C m d + 1 e − c m Cm^{d+1}e^{-c\sqrt{m}} C m d + 1 e − c m is summable. Monotonicity between grid points costs at most one count unit. First Borel–Cantelli and the countable intersection over d d d prove the assertion with δ = 1 / 4 \delta=1/4 δ = 1/4 . Quantile threshold sets include atomic marginals.
Example 9.3 (Nonmixing continuum of parameters). Choose 0 < α < β < 1 0<\alpha<\beta<1 0 < α < β < 1 . On R / Z \mathbb{R}/\mathbb{Z} R / Z let σ u = u + ϑ \sigma u=u+\vartheta σ u = u + ϑ , where ϑ \vartheta ϑ is irrational, and set λ ( u ) = α + ( β − α ) max { 0 , cos ( 2 π u ) } \lambda(u)=\alpha+(\beta-\alpha)\max\{0,\cos(2\pi u)\} λ ( u ) = α + ( β − α ) max { 0 , cos ( 2 π u )} . Then p = 1 / 2 p=1/2 p = 1/2 , while the slow parameters take a continuum of values accumulating at α \alpha α . The theorem applies although the base is not mixing: the centred correlation of cos ( 2 π u ) \cos(2\pi u) cos ( 2 π u ) with its n n n -step translate is 1 2 cos ( 2 π n ϑ ) \frac{1}{2}\cos(2\pi n\vartheta) 2 1 cos ( 2 π n ϑ ) . The parameter correlations may affect c ˉ \bar{c} c ˉ , although the normalized joint mark kernel depends only on α , p \alpha,p α , p .
For an atomless example on the same base, instead take λ ( u ) = α + 2 ( β − α ) dist ( u , 0 ) \lambda(u)=\alpha+2(\beta-\alpha)\operatorname{dist}(u,0) λ ( u ) = α + 2 ( β − α ) dist ( u , 0 ) . Its marginal is uniform on [ α , β ] [\alpha,\beta] [ α , β ] , and every parameter threshold preimage is a circle arc. For every bounded-type angle, and for Lebesgue-almost every irrational angle, arc counts have discrepancy O ϑ ( ( log ( 2 + m ) ) 3 ) O_{\vartheta}((\log(2+m))^3) O ϑ (( log ( 2 + m ) ) 3 ) , uniformly in the arc and phase. Consequently (55) holds with δ = 1 / 2 \delta= 1/2 δ = 1/2 , and the theorem gives the unit paired-mark law at
h ε = β − α α 2 α ε − α log ( 1 / ε ) . h_{\varepsilon} = \frac{\beta-\alpha}{\alpha2^{\alpha}}\varepsilon^{-\alpha}\log(1/\varepsilon). h ε = α 2 α β − α ε − α log ( 1/ ε ) .
These limits hold for almost every fixed phase, with randomness in the initial fibre point, not in the rotation orbit alone.
The discrepancy bound is the classical continued-fraction estimate, as recorded in [21 Section 2, equation (2.4)] . A convergent denominator block is within 1 / q 1/q 1/ q of a translated rational q q q -grid, so its arc-count error is bounded uniformly. Decomposing m m m into denominator blocks bounds the total error by a constant times the sum of its first K + 1 K+1 K + 1 partial quotients, with K = O ( log m ) K=O(\log m) K = O ( log m ) . Bounded partial quotients give O ( log m ) O(\log m) O ( log m ) . For the metric assertion, invariance of the Gauss measure, which is equivalent to Lebesgue measure, shows that the j j j -th partial quotient exceeds j 2 j^2 j 2 with probability O ( j − 2 ) O(j^{-2}) O ( j − 2 ) . The first Borel–Cantelli lemma bounds the partial quotients by C ( ϑ ) j 2 C(\vartheta)j^2 C ( ϑ ) j 2 , and the Fibonacci lower bound for the denominators gives the stated log-cubed bound.
The first example does not satisfy the full-skew mixing hypothesis used in [3 ] . Random intermittent Poisson limits in [1 ] are important antecedents; they concern time-collapsed counts and heavy-observable marks at generic centres, whereas here the expanding-branch target produces a full physical-time process with coupled return and residence marks. Quenched compensator-time Poisson limits without base mixing were proved earlier in [10 ] for cylinders in random subshifts of finite type.
The common thread of this paper is the difference between how often an orbit enters a target and how long it then stays there. Away from the neutral fixed point, correlations between visits are controlled by the masses of the two targets involved, and this gives a strong law under divergence of the total length alone, however slow. Near the fixed point, a single entrance may contribute a substantial part of the count. For regularly varying schedules this produces three separate thresholds: the integral test for the strong law, the weaker condition n u n → ∞ nu_n \to\infty n u n → ∞ for convergence in mean, and the scale n u n ∼ c log log n nu_n \sim c\log\log n n u n ∼ c log log n , c > 0 c>0 c > 0 , at which the normalized count has an almost-sure lower limit strictly between zero and one. Below this scale the lower limit is zero; above it the lower limit is one. When n u n nu_n n u n has a finite positive limit, the clusters remain visible after normalization, and the occupation paths converge to an additive jump process. For a point-mass parameter law, all of these statements concern a single intermittent map.
The same distinction organizes the remaining results. For irregular neutral schedules, the entrance envelope of Theorem 6.2 , rather than the total length, decides whether there are infinitely many visits, and the observation-gap test shows that the support of the parameter law and its minimum do not determine recurrence by themselves. This is a hitting criterion, not a strong law. Under ergodic forcing, Theorem 9.1 describes the return and residence marks of excursions to a fixed target, an observation scheme different from the moving targets above.
Several questions remain open. We do not know a necessary and sufficient condition for the strong law along neutral schedules that are not regularly varying; the entrance envelope only decides whether infinitely many visits occur. The moving-target occupation limits of Theorem 1.4 are annealed, and we do not know whether they hold for almost every fixed environment. Finally, the neutral-count results use independent parameters, whereas the excursion-mark limits allow ergodic forcing; whether the integral criterion and the critical lower envelope persist under ergodic forcing is also open.
Acknowledgements
The author acknowledges Gewu Intelligence Lab for providing the collaborative research environment in which this project was developed.
Competing interests
The author declares none.
Generative AI declaration
OpenAI GPT-5.6 Sol, Anthropic Claude Fable 5.1, OpenAI GPT-6.1 Sol, OpenAI GPT-6 Astra and Anthropic Claude Opus 5.5 contributed to the development and preparation of this paper during September–October 2026. Their combined work included developing and checking the inducing and target-mass estimates, the strong-law and lower-envelope arguments, the neutral-target criterion and second-moment obstruction, and the occupation and excursion-mark limits. They also searched the literature, checked references, and drafted and revised the manuscript.