Repository · Full text

Strong mixing of the Boca–Cobeli–Zaharescu map

Read PDF

HTML version 1 Added

Papers are listed without authors and are not intended for submission or formal publication.

Contents

Strong mixing of the Boca–Cobeli–Zaharescu map

Abstract

We prove that the Boca–Cobeli–Zaharescu map is strongly mixing for normalized Lebesgue measure on the Farey triangle. This answers the mixing question of Athreya and Cheung (Int. Math. Res. Not., 2014), which remained open after Cheung and Quas (arXiv, 2024) established weak mixing. Our main tool is a criterion for weakly mixing transformations whose induced maps on sets of measure tending to one are conjugate to the original transformation by maps converging to the identity. We decompose subsequential limits of graph measures according to the number of extra ordinary iterates needed to complete a fixed number of induced returns. Under a bounded mean-excess hypothesis at each scale, a finite invariant measure built from the positive-excess components forces each such component to be a multiple of the product measure; only the zero-excess component can obstruct mixing. For the BCZ map, we make this remaining mass arbitrarily small by estimating the probability that a long thin rectangle contains no primitive lattice point. The estimate combines a finite prime sieve, exact pairwise independence on an auxiliary torus, and a summable bound for the remaining prime divisors.

Note. This paper was generated entirely by AI, including MiMo, using an automated research pipeline developed by Chenghua Liu and Hanyu Li.

1 Introduction

The Boca–Cobeli–Zaharescu (BCZ) map was introduced to study correlations of Farey gaps [4]. Its iterates record consecutive normalized denominator pairs: if qj,qj+1,qj+2 are consecutive denominators in the Farey sequence of order Q, the map sends (qj/Q,qj+1/Q) to (qj+1/Q,qj+2/Q). Thus a piecewise linear map of a triangle encodes the progression through a Farey sequence. The joint spacing distributions of Augustin, Boca, Cobeli, and Zaharescu [3], and the correlation measures of Boca and Zaharescu [5], describe arithmetic statistics as the Farey order tends to infinity. The dynamical mixing question asks whether, in the resulting invariant system, observations separated by many iterates become asymptotically independent.

Athreya and Cheung [2] identified the BCZ map as a Poincaré return map for the horocycle flow on unimodular lattices. They proved that normalized Lebesgue measure on the Farey triangle is invariant and ergodic, and that the map has zero entropy. They also explicitly asked whether the map is mixing [2, §8.3]. Although the horocycle flow is mixing, this property does not in general pass to a return map: separation by a prescribed number of returns is different from separation by a prescribed flow time.

Cheung and Quas [6] proved weak mixing using the self-inducing geometry of the section. Restricting to lattices with a shorter horizontal vector gives an induced map conjugate to the original map, and the conjugacy approaches the identity as the restriction disappears. Their proof finds a positive proportion of points for which the induced and ordinary return counts differ by exactly one, and uses this event to exclude nonconstant eigenfunctions. Artiles [1] subsequently extended weak mixing to the corresponding return maps for lattice translation surfaces. Here we prove strong mixing for the BCZ map.

Theorem 1 (Strong mixing).

Let

Ω={(a,b)∈(0,1]2:a+b>1},dm=2dadb,

and let B:Ω→Ω be the Boca–Cobeli–Zaharescu map

B⁡(a,b)=(b,⌊1+ab⌋⁢b−a).

Then, for all measurable sets A,C⊂Ω,

limn→∞m⁡(B−n⁢A∩C)=m⁡(A)⁢m⁢(C).

Equivalently, for f,g∈L2⁢(m),

limn→∞∫Ωf⁡(x)⁢g⁢(Bn⁢x)⁢dm⁢(x)=(∫Ωf⁢dm)⁢(∫Ωg⁢dm).

In particular, two prescribed measurable conditions on finite blocks of the stationary BCZ process become asymptotically independent as their separation grows. The convergence holds along all integer times, not merely after averaging over time. We do not obtain a rate of mixing.

The step beyond weak mixing is to use all positive excess return counts, rather than only the event of one extra return. Consider a subsequential limit ν of the distributions of (x,Bn⁢x), with x distributed according to m. Near-identity self-induction gives two decompositions of this same limit. In one decomposition a component corresponds to an excess of j ordinary iterates; in the other, that component is shifted by j iterates in its second coordinate. Summing the intermediate shifts over j>0 produces a nonnegative measure of finite mass, with finiteness supplied by Kac’s return-time formula [7]. The equality of the decompositions makes this measure invariant under id×B. Ergodicity identifies it as a multiple of m×m, and weak mixing then does the same for each positive-excess component. Any nonproduct part of ν must therefore come from zero excess. Theorem 4 formulates this argument for general induced maps.

For the BCZ map, an extra ordinary return is recorded by a primitive lattice vector in the strip removed from the smaller section. We show that the probability of finding no such vector can be made arbitrarily small. The required estimate concerns rectangles of width α/n and height 2⁢n, with n→∞ before α→∞. A finite prime sieve makes the relevant counting variables pairwise independent on an auxiliary torus. Comparing this auxiliary measure with the section measure and controlling the remaining prime divisors gives the estimate in Lemma 5. Thus the proof combines a criterion for controlling every subsequential correlation limit with an arithmetic argument that eliminates its zero-excess component. The section geometry and weak mixing remain established inputs; the latter is also proved in Appendix A, following Cheung–Quas.

2 Self-induction of the horocycle section

For x=(a,b)∈Ω, write

Λx=Z⁡(a,0)+Z⁡(b,a−1),hu=(10−u1).

A nonzero vector of Λx is primitive if it is not an integer multiple, by a factor of absolute value greater than one, of another lattice vector. In the displayed basis, this is equivalent to coprimality of its two integer coefficients. The matrix hu preserves the first coordinate of a vector and decreases its slope by u. The Farey triangle parametrizes the section of lattices having a primitive horizontal vector with positive length at most 1.

We recall the return description from [2]. A lattice vector with positive second coordinate has the form

v=(−p⁢a+q⁢b,q/a),p∈Z,q∈N={1,2,…}.

If its first coordinate belongs to (0,1], then p≥0: otherwise −p⁢a+q⁢b≥a+b>1. Its slope is consequently at least 1/(a⁢b), with equality first attained by the primitive vector (b,a−1). At time 1/(a⁢b) this vector becomes horizontal. If k=⌊(1+a)/b⌋, changing the basis to

h1/(a⁢b)⁢(b,a−1)=(b,0),h1/(a⁢b)⁢(−(a,0)+k⁡(b,a−1))=(k⁢b−a,b−1)

identifies the returned lattice with ΛB⁡(a,b). Thus the return time is

τ⁡(a,b)=1a⁢b,∫Ωτ⁢dm=2⁢∫01−log⁡(1−a)a⁢da=π23.(1)

More generally, future returns correspond, in increasing order of slope, to primitive vectors in Λx with first coordinate in (0,1] and second coordinate positive. Distinct such primitive vectors cannot have the same slope.

The map B is invertible modulo null sets, with inverse

B−1⁢(a,b)=(⌊1+ba⌋⁢a−b,a).

Its linear branches have determinant one, so it preserves m. Ergodicity follows from the section construction and ergodicity of the horocycle flow, as proved in [2, Theorem 1.2]. All maps below are understood modulo null sets. Extending m by zero to Ω¯ and choosing a measurable extension of B to the added boundary gives a compact metric probability-space model.

For 0<r<1, let

Yr={(a,b)∈Ω:a≤r},m⁡(Yr)=r2,mr=r−2⁢m|Yr.

Write Br for the first-return map of B to Yr, and Rr,n⁢(y) for the number of ordinary iterates until the nth return to Yr. Thus

Brn⁢y=BRr,n⁢(y)⁢y,Rr,n⁢(y)≥n.

The following form of the self-induction in [2, 6] also records the normalization of measure and flow time.

Lemma 2 (Self-induction and time scaling).

Define

ϕr⁢(a,b)=(r⁢a,r⁡(b+j⁢a)),j=⌊r−1−ba⌋.(2)

Then ϕr:Ω→Yr is an almost-everywhere bijection satisfying

(ϕr)∗⁢m=mr,Br⁢ϕr=ϕr⁢B.

Moreover, ϕr→id in m-measure as r↑1.

Let Hn⁢(x)=∑i=0n−1τ⁡(Bi⁢x), and let Hr,n⁢(y) be the horocycle flow time until the nth return to the smaller section. Then

Hr,n⁢(ϕr⁢x)=r−2⁢Hn⁢(x).(3)
Proof.

Let gr=diag⁡(r,r−1). It maps the section with horizontal cutoff 1 onto the section with horizontal cutoff r. In the first row above the horizontal axis of gr⁢Λx, choose the rightmost vector whose first coordinate is at most 1. Its first coordinate is r⁡(b+j⁢a) with j as in (2); it belongs to (1−ra,1]. This gives the stated coordinates.

For (s,t)∈Yr, put

j=⌈t−rs⌉,(a,b)=(sr,t−j⁢sr).

The inequalities r−s<t−j⁢s≤r show that (a,b)∈Ω. Also 1−s<t≤1, so ⌊(r−1−b)/a⌋=j. This proves the inverse formula. On each piece of (2), the Jacobian is r2; hence (ϕr)∗⁢m=r−2⁢m|Yr=mr.

On {a+b>r−1}, the integer j is zero and ϕr⁢(a,b)=r⁡(a,b). The measure of this set tends to one, proving convergence in measure. Finally,

hu⁢gr=gr⁢hr2⁢u.

Thus gr preserves the order of section returns and multiplies their flow times by r−2. This proves both the conjugacy and (3). ∎

An important consequence is that Birkhoff’s theorem can be applied without a uniform ergodic theorem for the changing sections. For any sequence rn∈(0,1) with rn→1, equations (1) and (3) give

Hrn,nn⟶π23in ⁢mrn⁢-probability.(4)

Indeed, its distribution is that of rn−2⁢Hn/n under the fixed measure m, and Hn/n→π2/3 almost everywhere by ergodicity.

Proposition 3 (Cheung–Quas [6]).

The BCZ map is weakly mixing with respect to m. Equivalently, B×B is ergodic with respect to m×m.

For completeness, Appendix A gives their counting and eigenfunction argument with the return-time conventions used here.

3 A mixing criterion from excess returns

For an invertible ergodic probability-preserving transformation T and a measurable set Y of positive measure, write

rY⁢(y)=min⁡{k≥1:Tk⁢y∈Y},TY⁢(y)=TrY⁢(y)⁢y,

and

RY(n)⁢(y)=∑i=0n−1rY⁢(TYi⁢y).

Thus RY(n) is the discrete time of the nth induced return, and RY(n)−n≥0 counts the extra ordinary iterates. These maps and return times are defined almost everywhere on Y.

Theorem 4 (Mixing from excess returns).

Let T be an invertible, probability-preserving, weakly mixing transformation of a compact metric space X with Borel probability measure μ. For each α>0 and all sufficiently large integers n, let Yn,α be a measurable set of measure ρn,α>0. Denote its induced map by Tn,α, its normalized measure by μn,α=ρn,α−1⁢μ|Yn,α, and its nth return time by Rn,α. Suppose that:

  1. (i)

    There are almost-everywhere bijections ϕn,α:X→Yn,α such that

    (ϕn,α)∗⁢μ=μn,α,Tn,α⁢ϕn,α=ϕn,α⁢T,

    and, for each fixed α, ϕn,α→id in μ-measure.

  2. (ii)

    For each fixed α, ρn,α→1 and

    lim supn→∞n⁡(ρn,α−1−1)<∞.
  3. (iii)

    The probability of zero excess satisfies

    limα→∞lim supn→∞μn,α⁢(Rn,α=n)=0.(5)

Then T is strongly mixing.

Proof.

Fix α and suppress it in the subscripts. Set

Dn=Rn−n,En,j={y∈Yn:Dn(y)=j},j=0,1,….

Kac’s formula [7] gives ∫YnrYn⁢dμ=1. Since the induced map preserves μn,

∫YnDn⁢d⁢μn=n⁡(ρn−1−1).(6)

By (ii), after discarding finitely many n these first moments are bounded by a constant Cα<∞. In particular,

μn⁢(Dn>J)≤CαJ+1(J≥0).(7)

We first check that the sets En,j are almost invariant under T. For any induced map TY, if

x∈Y,T⁢x∈Y,T⁢TYn⁢x∈Y,

then the first and the (n+1)st induced return each take one ordinary iterate. Consequently,

RY(n)⁢(T⁢x)=RY(n+1)⁢(x)−1=RY(n)⁢(x).

The complement of these three conditions has μ-measure at most 3⁢μ⁢(X∖Y). For the third condition, restricted to Y, this follows from preservation of μ|Y by TYn and μ⁡(Y∩T−1⁢(X∖Y))≤μ⁡(X∖Y). It follows that, for every j,

μ⁡(En,j△T−1⁢En,j)≤3⁢(1−ρn)⟶0.(8)

Let

νn=(id,Tn)∗⁢μ,Π=μ×μ,

and fix an arbitrary weakly convergent subsequence νnk⇒ν. Compactness permits passage to a further subsequence on which, simultaneously for all j≥0,

νn,j:=(id,Tn)∗⁢(μn|En,j)⇒νj.

We continue to write n for this subsequence, and put pj=νj⁢(X×X).

Both marginals of νn,j are bounded above by ρn−1⁢μ, so both marginals of νj are bounded above by μ. This domination also allows us to test weak convergence against fixed products of L2⁢(μ) functions. Indeed, if the marginals of a measure η are bounded above by C⁢μ, Cauchy–Schwarz gives

|∫(f⁡(x)⁢g⁢(y)−f0⁢(x)⁢g0⁢(y))⁢dη|≤C⁡(CLOSE‖f−f0‖2⁢‖g‖2
OPEN+‖f0‖2⁢‖g−g0‖2).

Approximating f,g by continuous f0,g0 proves the assertion. In particular, pushforwards by the measurable maps T×T and id×Tj, for fixed j, pass through these limits.

Put V=T×T and W=id×T. Equation (8) implies that V∗⁢νn,j−νn,j tends to zero in total variation, and hence V∗⁢νj=νj. Each marginal of νj is therefore a T-invariant measure dominated by μ. Ergodicity of T makes its Radon–Nikodym density constant, so both marginals equal pj⁢μ.

There are two ways to recover the limiting graph measure from these components. First,

∑j≥0νn,j=(id,Tn)∗⁢μn,

which differs from νn by a measure whose total variation tends to zero. Second, the return identity and the conjugacy give

∑j≥0W∗j⁢νn,j=(id,Tnn)∗⁢μn=(ϕn×ϕn)∗⁢νn.

The last expression also converges weakly to ν. To see this, let F be continuous on X×X. Uniform continuity and ϕn→id in measure imply

∫(F⁡(ϕn⁢x,ϕn⁢y)−F⁡(x,y))⁢d⁢νn⁢(x,y)⟶0,

since both marginals of νn equal μ. The tail bound (7) now permits passage to the limit in both sums. We obtain

ν=∑j≥0νj=∑j≥0W∗j⁢νj,∑j≥0pj=1,∑j≥1j⁢pj≤Cα.(9)

The last inequality follows by taking limits in finite partial sums of the first moment and then increasing the number of terms.

The nonnegativity of the excess counts allows us to turn these two identities into a finite invariant measure. Define

F=∑j≥1∑k=0j−1W∗k⁢νj,γ=F⁡(X×X)=∑j≥1j⁢pj<∞.(10)

Both marginals of F equal γ⁢μ. Since V and W commute, F is V-invariant. Moreover, telescoping gives

W∗⁢F−F=∑j≥1(W∗j⁢νj−νj)=0

by (9). All these series converge in total variation because F has finite mass.

We claim that F=γ⁢Π. For bounded f,g, its W-invariance gives, for every N≥1,

∫f⁡(x)⁢g⁢(y)⁢dF=∫f⁡(x)⁢(1N⁢∑k=0N−1g⁡(Tk⁢y))⁢dF.

By the mean ergodic theorem the average in parentheses converges in L1⁢(μ) to ∫g⁢dμ. Its integration error against f⁡(x)⁢d⁢F is at most γ⁢‖f‖∞ times this L1 error. The first marginal of F is γ⁢μ, so the claimed product identity follows.

For j≥1, the term with k=0 in (10) shows that νj≤F=γ⁢Π. The measure νj is V-invariant, and weak mixing says that V is ergodic for Π. Its density with respect to Π must therefore be constant. Thus

νj=pj⁢Π(j≥1),ν=ν0+(1−p0)⁢Π.(11)

This also covers γ=0, when all the positive-excess components vanish.

Finally, let

v⁡(α)=lim supn→∞μn,α⁢(Rn,α=n).

For every fixed α, the preceding construction yields p0≤v⁡(α) and hence

ν≥(1−v⁡(α))⁢Π.

The further subsequence and its components may depend on α, but the initially fixed limit ν does not. By (iii), ν≥Π; equality follows because both measures have mass one. Every subsequential limit of νn is therefore Π, proving νn⇒Π. The same continuous approximation argument, using the fixed marginals μ, gives convergence for all L2 product tests and in particular for indicators of measurable sets. This is strong mixing. ∎

4 Primitive lattice points and the mixing theorem

A primitive vector whose horizontal coordinate belongs to (r,1] records a return to the original section that is omitted from the smaller one. We estimate the probability that no such vector occurs within a height proportional to the number of returns.

Lemma 5 (Primitive-point void probability).

For α>0 and integers n>α, set ε=α/n and

Zn,α⁢(x)=#⁡{v∈Λx:v⁢ is primitive,v∈(1−ε,1]×(0,2n]}.

Then

limα→∞lim supn→∞m⁡(Zn,α=0)=0.(12)
Proof.

Use the coordinates

c=a−1≥1,θ=b/a(mod1)∈[0,1).

For fixed a, the ratio b/a ranges uniformly over (c−1,c]. Consequently,

dm=2c−3dcdθ,m(c>K)=K−2(K>1).(13)

The lattice points with positive second coordinate are

(q⁢θ−pc,q⁢c),p∈Z,q∈N.(14)

Replacing b/a by its representative modulo one changes p by an integer multiple of q, so primitivity is still equivalent to gcd⁡(p,q)=1.

Fix K>1, let Qn=⌊2⁢n/K⌋, and count only pairs satisfying

1≤q≤Qn,c−ε<q⁢θ−p≤c.(15)

If 1≤c≤K, their lattice vectors lie in the target rectangle:

1−ε≤1−ε/c<q⁢θ−pc≤1,q⁢c≤2⁢n.

The narrower band in (15) has width independent of c, which will allow an exact second-moment calculation.

Choose P≥2 such that

M=∏ℓ≤Pℓ⁢primeℓ≥K.

Let GM⁢(c,θ) count the pairs in (15) for which gcd⁡(p,q,M)=1, and let Gprim⁢(c,θ) count those with gcd⁡(p,q)=1. Thus GM imposes only that no prime at most P divide both coordinates. These counting functions make sense for every real c, not only for c≥1. Write

ϱM⁢(q)=∏ℓ|gcd⁡(q,M)ℓ⁢prime(1−ℓ−1),βn=ε⁢∑q≤QnϱM⁢(q).

Temporarily equip [0,1)×[0,M), with coordinates (θ,c), with normalized Lebesgue measure λM. Since ε<1, the contribution for each fixed q is either zero or one and equals

Iq(c,θ)=fq(qθ−c),fq(u)=∑p∈Zgcd⁡(p,q,M)=11(p−ε,p](u).

The function fq is M-periodic, and also satisfies fq⁢(u+q)=fq⁢(u) because addition of q preserves the coprimality condition. Thus Iq is 1-periodic in θ, as is every product Iq⁢Iq′. Since M is an integer, their means on [0,1)×[0,M) equal their means on the torus (R/M⁢Z)2.

For q≠q′, the map

(θ,c)⟼(q⁢θ−c,q′⁢θ−c)(modM)

is a surjective endomorphism of this torus: its integer matrix has nonzero determinant q′−q. It therefore pushes Haar probability measure to Haar probability measure. Its two output coordinates are independent and uniform, proving pairwise independence of Iq and Iq′ under λM. There are M⁢ϱM⁢(q) admissible residue classes for p modulo M, so EλM⁢Iq=ε⁢ϱM⁢(q). Hence

EλM⁢GM=βn,VarλM⁡(GM)=∑q≤QnVarλM⁡(Iq)≤βn.(16)

The function ϱM is M-periodic in q. By the Chinese remainder theorem its average over one period is

δM=∏ℓ≤Pℓ⁢prime(1−ℓ−2)≥ζ⁢(2)−1.

Indeed, for a prime ℓ|M, the factor is one for the ℓ−1 nonzero residues of q and 1−ℓ−1 for the zero residue, giving the average 1−ℓ−2. Therefore, with K,P,α fixed,

βn⟶2⁢αK⁢δM.(17)

On 1≤c≤K, the density in (13) is at most 2, whereas the density of λM is 1/M. Chebyshev’s inequality and (16) give

m⁡(c≤K,GM<βn/2)≤2⁢M⁢λM⁢(GM<βn/2)≤8⁢Mβn(18)

for all sufficiently large n.

It remains to control points surviving the finite sieve that are not primitive. Each such point has a prime divisor ℓ>P common to p and q. For fixed c and q=ℓ⁢q′, setting p=ℓ⁢p′ in (15) gives

c/ℓ−ε/ℓ<q′⁢θ−p′≤c/ℓ.

Since q′⁢θ(mod1) is uniform for θ∈[0,1), the mean number of such p′ is exactly ε/ℓ. With

SP=∑ℓ>Pℓ⁢primeℓ−2,

a union bound and integration against (13) yield

Em⁢(GM−Gprim)≤∑ℓ>Pℓ⁢prime⌊Qnℓ⌋⁢εℓ≤ε⁢Qn⁢SP.(19)

The estimate is uniform in c, so this integration introduces no additional factor.

If c≤K and Zn,α=0, then Gprim=0. Either GM<βn/2 or GM−Gprim≥βn/2. Equations (13), (18), and (19), together with Markov’s inequality, therefore give

m⁡(Zn,α=0)≤K−2+8⁢Mβn+2⁢ε⁢Qnβn⁢SP.(20)

Taking n→∞ and using (17),

lim supn→∞m⁡(Zn,α=0)≤K−2+4⁢M⁢Kα⁢δM+2⁢SPδM.(21)

Given a prescribed error, first choose K large and then P large so that M≥K and both K−2 and 2⁢ζ⁢(2)⁢SP are small. This is possible since SP≤∑k>Pk−2→0. Keep K,P fixed and let α→∞ to eliminate the middle term. This proves (12) in the stated order of limits. ∎

We now compare the height in Lemma 5 with the flow time of the nth return to the smaller section.

Proof of Theorem 1.

For fixed α>0 and n>α, take

rn=1−α/n,Yn,α=Yrn,Dn,α=Rrn,n−n.

Lemma 2 gives measure-preserving conjugacies to the induced systems that converge to the identity in measure. Also,

n⁡(m⁢(Yrn)−1−1)=n⁡((1−α/n)−2−1)⟶2⁢α.

Thus conditions (i) and (ii) of Theorem 4 hold, and Proposition 3 supplies weak mixing.

By (4) and π2/3>3,

mrn⁢(Hrn,n>3⁢n)⟶1.

For large n, one has rn>2/3, and every vector in (rn,1]×(0,2⁢n] has slope at most 2⁢n/rn<3⁢n. On the event Hrn,n>3⁢n, a primitive vector in this rectangle therefore gives a return to the original section strictly before the nth return to the smaller section, but is not itself a return to the smaller section. Consequently, on Yrn,

{Dn,α=0}⊂{Zn,α=0}∪{Hrn,n≤3n}.

Since mrn⁢(E)≤rn−2⁢m⁢(E) for every measurable E, Lemma 5 implies

limα→∞lim supn→∞mrn⁢(Dn,α=0)=0.

Condition (iii) holds as well, and Theorem 4 proves strong mixing of B. ∎

References

  • [1] A. Artiles, The return map of the cross section of horizontally short lattice surfaces is weakly mixing, arXiv:2510.15450 (2025). https://arxiv.org/abs/2510.15450.
  • [2] J. S. Athreya and Y. Cheung, A Poincaré section for the horocycle flow on the space of lattices, Int. Math. Res. Not. IMRN 2014 (2014), no. 10, 2643–2690. doi:10.1093/imrn/rnt003.
  • [3] V. Augustin, F. P. Boca, C. Cobeli, and A. Zaharescu, The h-spacing distribution between Farey points, Math. Proc. Cambridge Philos. Soc. 131 (2001), no. 1, 23–38. doi:10.1017/S0305004101005187.
  • [4] F. P. Boca, C. Cobeli, and A. Zaharescu, A conjecture of R. R. Hall on Farey points, J. Reine Angew. Math. 535 (2001), 207–236. doi:10.1515/crll.2001.049.
  • [5] F. P. Boca and A. Zaharescu, The correlations of Farey fractions, J. London Math. Soc. (2) 72 (2005), no. 1, 25–39. doi:10.1112/S0024610705006629.
  • [6] Y. Cheung and A. Quas, BCZ map is weakly mixing, arXiv:2403.14976 (2024). https://arxiv.org/abs/2403.14976.
  • [7] M. Kac, On the notion of recurrence in discrete stochastic processes, Bull. Amer. Math. Soc. 53 (1947), no. 10, 1002–1010. doi:10.1090/S0002-9904-1947-08927-8.

Appendix A The weak-mixing input

We give the Cheung–Quas argument [6] for Proposition 3, with explicit counting bounds and the time scaling from Lemma 2. The required geometric fact is that there are constants α0,η>0 such that, for rn=1−α0/n and all sufficiently large n,

m⁡{y∈Yrn:Rrn,n⁢(y)=n+1}≥η.(22)

Fix for now 0<α<1/32, put ε=α/n and r=1−ε, and let

Ar={(s,t)∈Ω:1/2≤s≤r}.

Let F1,F2 count primitive points of Λs,t in

(r,1]×(0,2⁢n],(r,1]×(0,4⁢n],

respectively.

To bound the first moment of F1 from below, restrict to pairs

n/6<p≤n/3,n/2≤q≤n,gcd⁡(p,q)=1.(23)

Their number is n2/(2⁢π2)+O⁡(n⁢log⁡n). Indeed, if μar denotes the Möbius function, the identity 1gcd⁡(p,q)=1=∑d|p,d|qμar⁢(d) gives this count as

∑d≤nμar⁢(d)⁢(⌊n3⁢d⌋−⌊n6⁢d⌋)⁢(⌊nd⌋−⌈n2⁢d⌉+1)
=n212⁢∑d≤nμar⁢(d)d2+O⁡(∑d≤n(nd+1))=n22⁢π2+O⁡(n⁢log⁡n).

Here ∑d≥1μar⁢(d)⁢d−2=ζ⁢(2)−1 and its tail is O⁡(n−1). In particular, there are at least n2/20 such pairs for all sufficiently large n.

For each pair in (23), consider

p⁢s+rq<t≤p⁢s+1q,6/7≤s≤r.

This strip is contained in Ar for large n. Its upper boundary is at most 2/3+2/n≤1 for n≥6, while p/q>1/6 ensures s+t>1. Its vertical width is ε/q, and its horizontal length is eventually at least 1/8. Moreover, q/s≤2⁢n, so every point of this strip contributes the primitive vector (−p⁢s+q⁢t,q/s) to F1. The normalized area is at least ε/(4⁢n), and hence

∫ArF1⁢dm≥n⁢ε80=α80.(24)

For the second moment, every vector counted by F2 is of the form (−p⁢s+q⁢t,q/s) with

1≤q≤4⁢n,0≤p<2⁢q,gcd⁡(p,q)=1.

Indeed, p≤−1 would give −p⁢s+q⁢t≥s+t>1, while the other bounds follow from s≥1/2, t≤1, and q/s≤4⁢n. Let Ap,q be the intersection of Ar with the strip

(p⁢s+r)/q<t≤(p⁢s+1)/q.

Dropping the further height restriction q/s≤4⁢n only increases the count, so intersections of these strips bound the factorial second moment of F2 from above.

For a fixed q, distinct values of p give disjoint strips, since s≥1/2>ε. For distinct primitive indices with q<q′, put Δ=q′−q and D=p′⁢q−p⁢q′. Coprimality implies D≠0. The two full strips intersect in a parallelogram of area ε2/|D| and horizontal width

ε⁡(q+q′)|D|≤8⁢n⁢ε=8⁢α<1/4.

The intersection of their upper boundaries has horizontal coordinate s0=Δ/D. If the parallelogram meets Ar, then s0∈[1/4,5/4]. Therefore

45⁢Δ≤D≤4⁢Δ,m⁡(Ap,q∩Ap′,q′)≤5⁢ε22⁢Δ.(25)

Fix q<q′ and let d=gcd⁡(q,q′). The integer D is a positive multiple of d not exceeding 4⁢Δ, leaving at most 4⁢Δ/d possibilities. For each fixed D, all integer solutions are of the form

p=p0+(q/d)⁢k,p′=p0′+(q′/d)⁢k.

The interval 0≤p<2⁢q permits at most 2⁢d integer values of k. Thus at most 8⁢Δ pairs (p,p′) can contribute for these q,q′. At this point we may drop coprimality in the upper bound: it has already excluded parallel strips, so division by D is justified. Equation (25) gives

∑p,p′m⁡(Ap,q∩Ap′,q′)≤20⁢ε2,

where the sum is over the possible contributing primitive pairs. Summing over q<q′ and accounting for both orders yields

∫ArF2⁢(F2−1)⁢dm≤2⁢(4⁢n2)⁢20⁢ε2≤320⁢α2.(26)

Since F1≤F2, pointwise we have

F1≤1{F1=F2=1}+F21{F2>1},F21{F2>1}≤F2(F2−1).

Thus (24) and (26) imply

m⁡{(s,t)∈Ar:F1=F2=1}≥α/80−320⁢α2.

Choose α0=1/51200, so that this lower bound is at least α0/160. By (4) and 3<π2/3<4, the complement of

{y∈Yrn:3⁢n<Hrn,n⁢(y)<4⁢n}

has m-measure tending to zero. Restrict to points satisfying both F1=F2=1 and 3⁢n<Hrn,n<4⁢n. The unique point counted by F1 has slope less than 3⁢n for large n. Conversely, every outer-strip primitive vector whose slope is below Hrn,n<4⁢n has vertical coordinate less than 4⁢n and is counted by F2. There is therefore exactly one extra ordinary return. This proves (22), for example with η=α0/320.

To finish the proof of Proposition 3, suppose that f∘B=λ⁢f is a nonzero L2⁢(m) eigenfunction with λ≠1. Measure preservation gives |λ|=1, and ergodicity permits the normalization |f|=1 almost everywhere. Set fr=f∘ϕr−1 on Yr. The conjugacy gives

fr∘Br=λ⁢fr,‖fr−f|Yr‖L2⁢(mr)⟶0.

For the second assertion, change variables by ϕr and approximate f in L2⁢(m) by continuous functions. The error after composition with ϕr is controlled by (ϕr)∗⁢m=mr≤r−2⁢m, and the continuous part converges by ϕr→id in measure. Since Br preserves mr,

‖f∘Brn−λn⁢f‖L2⁢(mr)≤2⁢‖fr−f|Yr‖L2⁢(mr)⟶0

along r=rn, independently of the growing exponent n. On the set in (22), however, Brn=Bn+1, so the expression inside this norm has absolute value |1−λ|>0. That set has mr-measure at least η, a contradiction. Ergodicity already excludes nonconstant eigenfunctions with eigenvalue one. The absence of nonconstant L2 eigenfunctions proves weak mixing.