This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Sublacunary sets and interpolation sets for nilsequences

Anh N. Le Department of Mathematics
Ohio State University
231 W. 18th Ave., Columbus, OH 43210
[email protected]
Abstract.

A set EE\subset\mathbb{N} is an interpolation set for nilsequences if every bounded function on EE can be extended to a nilsequence on \mathbb{N}. Following a theorem of Strzelecki, every lacunary set is an interpolation set for nilsequences. We show that sublacunary sets are not interpolation sets for nilsequences. Furthermore, we prove that the union of an interpolation set for nilsequences and a finite set is an interpolation set for nilsequences. Lastly, we provide a new class of interpolation sets for Bohr almost periodic sequences, and as the result, obtain a new example of interpolation set for 22-step nilsequences which is not an interpolation set for Bohr almost periodic sequences.

1. Introduction

A Bohr almost periodic sequence is a uniform limit of trigonometric polynomials, i.e. the functions of the form ψ(n)=j=1kcje2πinαj\psi(n)=\sum_{j=1}^{k}c_{j}e^{2\pi in\alpha_{j}} where αj\alpha_{j}\in\mathbb{R} for nn\in\mathbb{N}. A subset EE of \mathbb{N} is an I0I_{0}-set (or interpolation set for Bohr almost periodic sequences) if every bounded function on EE can be extended to a Bohr almost periodic sequence. Equivalently, every bounded function on EE is the restriction of the Fourier transform of a discrete measure on the torus 𝕋=/\mathbb{T}=\mathbb{R}/\mathbb{Z}. The class of I0I_{0}-sets have been extensively studied in harmonic analysis since 1960s [12, 13, 21, 7]. One notable result is due to Strzelecki [23] where he showed that every lacunary set 111{rn}n\{r_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} with r1<r2<r_{1}<r_{2}<\ldots is lacunary if infnrn+1rn>1\inf_{n\in\mathbb{N}}\frac{r_{n+1}}{r_{n}}>1. is an I0I_{0}-set. Recently, the author [16] proved that sublacunary sets are not I0I_{0}-sets. Here {rn}n\{r_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} with r1<r2<r_{1}<r_{2}<\ldots is sublacunary if limn(logrn)/n=0\lim_{n\to\infty}(\log r_{n})/n=0.

Under the harmonic analytic point of view, Bohr almost periodic sequences are the Fourier transforms of discrete measures on 𝕋\mathbb{T}. On the other hand, from the dynamical systems perspective, Bohr almost periodic sequences are the evaluations of continuous functions on the orbits of toral rotations. With this standpoint, Bergelson, Host and Kra [2] introduced a generalization of Bohr almost periodic sequences and named them nilsequences (See Section 2.1 for definition). Under this generalization, Bohr almost periodic sequences coincide with 11-step nilsequences. Since their introduction, nilsequences have become important objects in ergodic theory, arithmetic combinatorics and number theory. They are indispensable ingredients in the recent development in ergodic Ramsey theory [17, 4]. They also played prominent roles in the programs of finding linear patterns in primes [8, 9, 10], and more recently in the progress of Chowla and Sarnak’s conjectures [22, 24, 5].

Roughly speaking, interpolation sets for a class of sequences tell us which coordinates of the sequences that are pairwise independent. Hence, understanding their interpolation sets can shed light on the inherent structures of the family of sequences we are studying. Because of this reason and since nilsequences are important objects in various areas of mathematics, it is of interest to study interpolation sets for nilsequences. Here is the precise definition.

Definition 1.1.

A set EE\subset\mathbb{N} is called an interpolation set for kk-step nilsequences (or kk-step interpolation set) if for every bounded function f:Ef:E\to\mathbb{C}, there exists a kk-step nilsequence ψ:\psi:\mathbb{N}\to\mathbb{C} such that ψ(n)=f(n)\psi(n)=f(n) for nEn\in E.

A set EE is called an interpolation set for nilsequences if EE is a kk-step interpolation set for some kk\in\mathbb{N}.

Since Bohr almost periodic sequences are 11-step nilsequences, every I0I_{0} set is an interpolation set for nilsequences. Therefore, following from Strzelecki’s result [23], lacunary set are interpolation sets for nilsequences. In [16], the author asked whether there is a sublacunary set that is an interpolation set for nilsequences. The main result of this paper give a negative answer to that question.

Theorem 1.2.

Sublacunary sets are not interpolation sets for nilsequences.

It was shown in [21] that the class of I0I_{0}-sets is closed under the unions with finite sets. Here we prove an analogous result regarding interpolation sets for nilsequences.

Theorem 1.3.

If EE\subset\mathbb{N} is a kk-step interpolation set and SS\subset\mathbb{N} is finite, then ESE\cup S is a kk-step interpolation set.

Known examples of I0I_{0}-sets include lacunary sets and some suitable unions of lacunary sets, like {2n}n{2n+1}n\{2^{n}\}_{n\in\mathbb{N}}\cup\{2^{n}+1\}_{n\in\mathbb{N}}. In the next proposition, we provide a new example of I0I_{0}-set.

Proposition 1.4.

Let {rn}n\{r_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} be lacunary and let {tn}n\{t_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} be such that limntn/rn=0\lim_{n\to\infty}t_{n}/r_{n}=0. Then E={rn}n{rn+tn}nE=\{r_{n}\}_{n\in\mathbb{N}}\cup\{r_{n}+t_{n}\}_{n\in\mathbb{N}} is an I0I_{0}-set if and only if {tn}n\{t_{n}\}_{n\in\mathbb{N}} is not a set of Bohr recurrence.222A set RR\subset\mathbb{N} is a set of Bohr recurrence if and only if for any finite dimensional torus 𝕋d\mathbb{T}^{d} and any α𝕋d\alpha\in\mathbb{T}^{d}, we have 0 is in the closure of Rα={nα:nR}R\alpha=\{n\alpha:n\in R\}. For example, the set of even natural numbers is a set of Bohr recurrence, but the set of odd natural numbers is not.

From Proposition 1.4, we have following examples of I0I_{0}-sets: {2n}n{2n+3n+1}n,{3n}n{3n+n2+2}n\{2^{n}\}_{n\in\mathbb{N}}\cup\{2^{n}+3n+1\}_{n\in\mathbb{N}},\{3^{n}\}_{n\in\mathbb{N}}\cup\{3^{n}+n^{2}+2\}_{n\in\mathbb{N}}, and {n!}n{n!+2n1}n\{n!\}_{n\in\mathbb{N}}\cup\{n!+2n-1\}_{n\in\mathbb{N}}. The class of Bohr almost periodic sequences is strictly contained in the class of 22-step nilsequences. In [16] we provided an example of 22-step interpolation set that is not an I0I_{0}-set. As a corollary of Proposition 1.4, we obtain another example for set of this type.

Corollary 1.5.

Let {rn}n\{r_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} be lacunary. Let {tn}n\{t_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} be such that limntn/rn=0\lim_{n\to\infty}t_{n}/r_{n}=0 and {tn}n\{t_{n}\}_{n\in\mathbb{N}} is a set of Bohr recurrence. Then {rn}n{rn+tn}n\{r_{n}\}_{n\in\mathbb{N}}\cup\{r_{n}+t_{n}\}_{n\in\mathbb{N}} is a 22-step interpolation set but not an I0I_{0}-set.

Using Proposition 1.4, we also derive a different proof of Corollary 2.7.9 in [7] which says that the sum of a lacunary set and a finite set is an I0I_{0}-set (Corollary 5.2).

2. Background

2.1. Nilsequences

Let GG be a kk-step nilpotent Lie group and ΓG\Gamma\subset G be a discrete, cocompact subgroup. The homogeneous space X=G/ΓX=G/\Gamma is called a kk-step nilmanifold. For any gGg\in G, the map g:XXg:X\to X defined by xgxx\mapsto gx is a diffeomorphism and the pair (X,g)(X,g) is called a kk-step nilsystem.

For xXx\in X and a continuous function FF on XX, the sequence (F(gnx))n(F(g^{n}x))_{n\in\mathbb{N}} is called a basic kk-step nilsequence. Examples of basic kk-step nilsequences include (e2πinkα)n(e^{2\pi in^{k}\alpha})_{n\in\mathbb{N}} where α\alpha\in\mathbb{R}, or more generally, (e2πiP(n))n(e^{2\pi iP(n)})_{n\in\mathbb{N}} where P[x]P\in\mathbb{R}[x] of degree not greater than kk.

A sequence ψ:\psi:\mathbb{N}\to\mathbb{C} is a kk-step nilsequence if for every ϵ>0\epsilon>0, there exists a basic kk-step nilsequence ψϵ:\psi_{\epsilon}:\mathbb{N}\to\mathbb{C} such that |ψ(n)ψϵ(n)|<ϵ|\psi(n)-\psi_{\epsilon}(n)|<\epsilon for all nn\in\mathbb{N}. In other words, a kk-step nilsequence is a uniform limit of basic kk-step nilsequences.

The space of kk-step nilsequences is closed under pointwise addition, multiplication, complex conjugation and uniform limits.

More details on nilsequences can be found in [2, Section 4.3.1] and [14, Section 11.3.2].

2.2. Special representations of nilsequences

We can always embed a kk-step nilmanifold X=G/ΓX=G/\Gamma into a kk-step nilmanifold X=G/ΓX^{\prime}=G^{\prime}/\Gamma^{\prime} where GG^{\prime} is connected and simply connected and every element of GG is represented in GG^{\prime} (for example, see [14, Corollary 26, Section 10.5.1]). Therefore, every kk-step nilsequence can be realized from a kk-step nilmanifold with a connected and simply connected Lie group.

2.3. Characterization of I0I_{0}-sets

For AA\subset\mathbb{N} and α𝕋d=d/d\alpha\in\mathbb{T}^{d}=\mathbb{R}^{d}/\mathbb{Z}^{d}, let Aα¯\overline{A\alpha} denote the closure of Aα:={aα:aA}A\alpha:=\{a\alpha:a\in A\} in 𝕋d\mathbb{T}^{d}.

Two sets A,BA,B\subset\mathbb{N} are said to be separable by a Bohr rotation if there exists a finite dimensional torus 𝕋d\mathbb{T}^{d} and an element α𝕋d\alpha\in\mathbb{T}^{d} such that Aα¯Bα¯=\overline{A\alpha}\cap\overline{B\alpha}=\varnothing.

Theorem 2.1 (Hartman-Ryll-Nardzewski [13]).

A set EE\subset\mathbb{N} is an I0I_{0}-set if and only if every two disjoint subsets of EE are separable by a Bohr rotation.

Strzelecki [23] proved that all lacunary sets are I0I_{0}-sets. By Hartman-Ryll-Nardzewski characterization [13], some unions of lacunary sets are I0I_{0}-sets, for example, {2n}n{2n+1}n\{2^{n}\}_{n\in\mathbb{N}}\cup\{2^{n}+1\}_{n\in\mathbb{N}}. In fact, it is shown in [7] that any finite union of shifts of lacunary sets is an I0I_{0}-set, for instance, i=1{2n+i}n\bigcup_{i=1}^{\ell}\{2^{n}+i\}_{n\in\mathbb{N}}. Grow [11] constructed a class of I0I_{0}-sets which are not finite unions of lacunary sets, for example, {3n2+3j:n1,(n1)2jn2}\{3^{n^{2}}+3^{j}:n\geq 1,(n-1)^{2}\leq j\leq n^{2}\} (see also Méla [19]). More information on I0I_{0}-sets can be found in the book [7] by Graham and Hare.

2.4. Characterization of interpolation sets for nilsequences

For AA\subset\mathbb{N}, for a kk-step nilsystem (X=G/Γ,g)(X=G/\Gamma,g) and xXx\in X, let gAxg^{A}x denote the set {gax:aA}\{g^{a}x:a\in A\} and let gAx¯\overline{g^{A}x} denote the closure of gAxg^{A}x in XX.

Definition.

Two sets A,BA,B\subset\mathbb{N} are said to be separable by a kk-step nilrotation if there exists a kk-step nilsystem (X=G/Γ,g)(X=G/\Gamma,g) and xXx\in X such that gAx¯gBx¯=\overline{g^{A}x}\cap\overline{g^{B}x}=\varnothing.

Analogous to Hartman-Ryll-Nardzewski’s criterion [13], we have a characterization of kk-step interpolation sets and its proof is identical to [16, Theorem 3.1].

Theorem 2.2.

The set EE\subset\mathbb{N} is a kk-step interpolation set if and only if every two disjoint subsets of EE are separable by a kk-step nilrotation.

2.5. Sets of pointwise nilrecurrence

Definition 2.3.

A set RR\subset\mathbb{N} is called a set of pointwise kk-step nilrecurrence if for any kk-step nilsystem (X=G/Γ,g)(X=G/\Gamma,g) and for any xXx\in X, we have xgRx¯x\in\overline{g^{R}x}.

Let π:GX\pi:G\to X be the natural quotient map π(g)=gΓ\pi(g)=g\Gamma. Let 1G1_{G} be the identity element of GG and 1X=π(1G)1_{X}=\pi(1_{G}). In Definition 2.3, by changing the base point to 1X1_{X}, we have an equivalent definition: RR\subset\mathbb{N} is a set of pointwise kk-step nilrecurrence if and only if for any kk-step nilsystem (X,g)(X,g), we have 1XgR1X¯1_{X}\in\overline{g^{R}1_{X}}.

For any kk\in\mathbb{N}, the set kk\mathbb{N} is a set of pointwise kk-step nilrecurrence. Other than that, little is known about sets of pointwise nilrecurrence. However, there is a related and better-studied notion called sets of topological kk-step nilrecurrence. A set RR\subset\mathbb{N} is called a set of topological kk-step nilrecurrence if for any kk-step nilsystem (X,g)(X,g) and for any UXU\subset X open, there exists rRr\in R such that UgrUU\cap g^{-r}U\neq\varnothing.333Usually when defining sets of topological recurrence, we restrict to minimal systems. However, as every orbit closure in nilsystems is minimal, we do not need this restriction here. It is proved in [15] that a set RR is a set of topological kk-step nilrecurrence if and only if it is a set of Bohr recurrence.

It is obvious that every set of pointwise kk-step nilrecurrence is a set of topological kk-step nilrecurrence. But the converse is probably false (See [20].) For example, while {n2}n\{n^{2}\}_{n\in\mathbb{N}} is a set of topological nilrecurrence, it is not clear whether it is a set of pointwise 22-step nilrecurrence or not.

2.6. Nilmanifolds and Mal’cev bases

Let X=G/ΓX=G/\Gamma be a kk-step nilmanifold with connected and simply connected GG. If mm is the dimension of GG and 𝒢\mathcal{G} is the Lie algebra of GG, then 𝒢\mathcal{G} admits a base (ξ1,,ξm)(\xi_{1},\ldots,\xi_{m}) satisfying the following properties:

  1. (1)

    The map ψ:mG\psi:\mathbb{R}^{m}\to G defined by

    ψ(t1,,tm)=exp(t1ξ1)exp(tmξm)\psi(t_{1},\ldots,t_{m})=\exp(t_{1}\xi_{1})\cdots\exp(t_{m}\xi_{m})

    is a diffeomorphism from m\mathbb{R}^{m} onto GG.

  2. (2)

    ψ(m)=Γ\psi(\mathbb{Z}^{m})=\Gamma.

The base (ξ1,,ξm)(\xi_{1},\ldots,\xi_{m}) is called a Mal’cev basis of GG. If g=ψ(t1,,tm)g=\psi(t_{1},\ldots,t_{m}), then t1,,tmt_{1},\ldots,t_{m} are called the Mal’cev coordinates of gg in the base (ξ1,,ξm)(\xi_{1},\ldots,\xi_{m}).

For s¯=(s1,,sm)\underline{s}=(s_{1},\ldots,s_{m}) and t¯=(t1,,tm)m\underline{t}=(t_{1},\ldots,t_{m})\in\mathbb{R}^{m}, write

s¯t¯=ψ1(ψ(s¯)ψ(t¯))\underline{s}*\underline{t}=\psi^{-1}(\psi(\underline{s})\psi(\underline{t}))

There exist m1m-1 polynomials P1,,Pm1P_{1},\ldots,P_{m-1} with Pi[s1,,si,t1,,ti]P_{i}\in\mathbb{Q}[s_{1},\ldots,s_{i},t_{1},\ldots,t_{i}] of degree at most k1k-1 such that for all s¯,t¯m\underline{s},\underline{t}\in\mathbb{R}^{m},

s¯t¯=(s1+t1,s2+t2+P1(s1,t1),,sm+tm+Pm1(s1,,sm1,t1,,tm1)))\underline{s}*\underline{t}=(s_{1}+t_{1},s_{2}+t_{2}+P_{1}(s_{1},t_{1}),\ldots,s_{m}+t_{m}+P_{m-1}(s_{1},\ldots,s_{m-1},t_{1},\ldots,t_{m-1})))

We have ψ([0,1)m)\psi([0,1)^{m}) is a fundamental domain for XX. Hence, we can identify XX with [0,1)m[0,1)^{m} through the diffeomorphism ψ~:X[0,1)m\widetilde{\psi}:X\to[0,1)^{m}.

We then have a chain of maps:

m𝜓G𝜋Xψ~[0,1)m,\mathbb{R}^{m}\xrightarrow{\psi}G\xrightarrow{\pi}X\xrightarrow{\tilde{\psi}}[0,1)^{m},

and define φ:m[0,1)m\varphi:\mathbb{R}^{m}\to[0,1)^{m} to be φ=ψ~πψ\varphi=\tilde{\psi}\circ\pi\circ\psi. Equivalently, for x¯m\underline{x}\in\mathbb{R}^{m}, there exists a unique z¯(x)m\underline{z}(x)\in\mathbb{Z}^{m} such that x¯z¯(x)[0,1)m\underline{x}*\underline{z}(x)\in[0,1)^{m}. Then we can see that φ(x¯)=x¯z¯(x)\varphi(\underline{x})=\underline{x}*\underline{z}(x). Further details on Mal’cev bases can be found in [18, 3] and [14, Chapter 10].

Definition 2.4.

For a real number xx, let x\lVert x\rVert denote the distance from xx to the nearest integer. For x¯=(x1,,xm)\underline{x}=(x_{1},\ldots,x_{m}) and y¯=(y1,,ym)m\underline{y}=(y_{1},\ldots,y_{m})\in\mathbb{R}^{m}, define

x¯y¯Tm=max1imxiyi.\lVert\underline{x}-\underline{y}\rVert_{T^{m}}=\max_{1\leq i\leq m}\lVert x_{i}-y_{i}\rVert.

We can see that 𝕋m\lVert\cdot\rVert_{\mathbb{T}^{m}} defines a metric on [0,1)m[0,1)^{m} which is compatible with the Euclidean metric. The reason we choose this metric only to make our computations later less cumbersome. We use dd to denote the metric on XX that comes from the metric 𝕋m\lVert\cdot\rVert_{\mathbb{T}^{m}} on [0,1)m[0,1)^{m} through the map ψ~1\widetilde{\psi}^{-1}.

2.7. Notation

We use \mathbb{N} to denote the set of positive integers {1,2,3,}\{1,2,3,\ldots\} and use 𝕋\mathbb{T} to denote the torus /\mathbb{R}/\mathbb{Z}. The notation (b(n))n(b(n))_{n\in\mathbb{N}} represents a sequence of complex numbers and {rn}n\{r_{n}\}_{n\in\mathbb{N}} represents a subset of \mathbb{N} with r1<r2<r_{1}<r_{2}<\ldots.

Let f,g:f,g:\mathbb{R}\to\mathbb{R}. By writing f(x)=Oa,b(g(x))f(x)=O_{a,b}(g(x)), we mean there exist positive constants CC and N0N_{0} that depend on aa and bb such that |f(x)|<Cg(x)|f(x)|<Cg(x) for every x>N0x>N_{0}.

3. Union of interpolation sets with finite sets

Lemma 3.1.

Let RR\subset\mathbb{N} be a set of pointwise kk-step nilrecurrence and ARA\subset R is a finite set. Then RAR\setminus A is still a set of pointwise kk-step nilrecurrence.

Proof.

By way of contradiction, assume RAR\setminus A is not a set of pointwise kk-step nilrecurrence. Then there exists a kk-step nilsystem (X=G/Γ,g)(X=G/\Gamma,g) such that

1XgRA1X¯.1_{X}\not\in\overline{g^{R\setminus A}1_{X}}.

Let α𝕋\alpha\in\mathbb{T} be an irrational number. Since AA is finite, we have 0Aα¯0\not\in\overline{A\alpha}. Consider the kk-step nilsystem (X×𝕋,(g,α))(X\times\mathbb{T},(g,\alpha)). It then follows that the closure

(g,α)R(1X,0)¯=(g,α)A(1X,0)¯(g,α)RA(1X,0)¯\overline{(g,\alpha)^{R}(1_{X},0)}=\overline{(g,\alpha)^{A}(1_{X},0)}\cup\overline{(g,\alpha)^{R\setminus A}(1_{X},0)}

does not contain (1X,0)(1_{X},0). Therefore RR is not a set of pointwise kk-step nilrecurrence, and this is a contradiction. ∎

Lemma 3.2.

Let RR be a set of pointwise kk-step nilrecurrence. Let X=G/ΓX=G/\Gamma be a kk-step nilmanifold with the corresponding metric dd. Suppose HH is a compact subset of GG. For every ϵ>0\epsilon>0, there exists a finite set RϵRR_{\epsilon}\subset R such that the following holds: For all hHh\in H, there exists rRϵr\in R_{\epsilon} for which d(hr1X,1X)<ϵd(h^{r}1_{X},1_{X})<\epsilon.

Proof.

Suppose R={rn}nR=\{r_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N}. By contradiction, assume there exists ϵ>0\epsilon>0 such that for all NN\in\mathbb{N}, there exists hNHh_{N}\in H satisfying

d(hNrn1X,1X)ϵ for all nN.d(h_{N}^{r_{n}}1_{X},1_{X})\geq\epsilon\text{ for all }n\leq N.

Since HH is compact, the sequence (hN)N(h_{N})_{N\in\mathbb{N}} has an accumulation point in GG, say gg. It follows that

d(grn1X,1X)ϵ for all n.d(g^{r_{n}}1_{X},1_{X})\geq\epsilon\text{ for all }n\in\mathbb{N}.

But this contradicts the hypothesis that RR is a set of pointwise kk-step nilrecurrence. ∎

Lemma 3.3.

A set of pointwise kk-step nilrecurrence can be partitioned into two sets of pointwise kk-step nilrecurrence.

Proof.

It is well-known that up to isomorphism, the set of pair (G,Γ)(G,\Gamma) where GG is a kk-step nilpotent Lie group and Γ\Gamma is a discrete, cocompact subgroup is countable (for example see [14, Section 10.5.2]). Let 𝒞\mathcal{C} be a set of representatives of those non-isomorphic pairs (G,Γ)(G,\Gamma). For each (G,Γ)𝒞(G,\Gamma)\in\mathcal{C}, we can partition GG into countably many compact subsets, say G=j=1HG,jG=\bigcup_{j=1}^{\infty}H_{G,j}. It follows that the set 𝒟={(G,Γ,HG,j,ϵ):(G,Γ)𝒞,j,ϵ{1/n:n}}\mathcal{D}=\{(G,\Gamma,H_{G,j},\epsilon):(G,\Gamma)\in\mathcal{C},j\in\mathbb{N},\epsilon\in\{1/n:n\in\mathbb{N}\}\} is countable. Enumerate 𝒟\mathcal{D} as {(Gn,Γn,Hn,ϵn):n}\{(G_{n},\Gamma_{n},H_{n},\epsilon_{n}):n\in\mathbb{N}\}.

Let RR be a set of pointwise kk-step nilrecurrence. Invoking Lemma 3.2, there exists a finite set A1RA_{1}\subset R such that for every hH1h\in H_{1}, there exists rA1r\in A_{1} for which

(1) d(hr1G1/Γ1,1G1/Γ1)<ϵ1.d(h^{r}1_{G_{1}/\Gamma_{1}},1_{G_{1}/\Gamma_{1}})<\epsilon_{1}.

Since A1A_{1} is finite, by Lemma 3.1, RA1R\setminus A_{1} is still a set of pointwise kk-step nilrecurrence. Using Lemma 3.2 again, we can find a finite set B1RA1B_{1}\subset R\setminus A_{1} for which for every hH1h\in H_{1}, there exists rB1r\in B_{1} satisfying (1).

Removing A1A_{1} and B1B_{1} from RR and applying above procedure repeatedly, we get two sequences of pairwise disjoint subsets of RR, say (An)n(A_{n})_{n\in\mathbb{N}} and (Bn)n(B_{n})_{n\in\mathbb{N}}, such that the following holds: For every hHnh\in H_{n}, there exists r1Anr_{1}\in A_{n} and r2Bnr_{2}\in B_{n} for which

d(hr11Gn/Γn,1Gn/Γn)<ϵnd(h^{r_{1}}1_{G_{n}/\Gamma_{n}},1_{G_{n}/\Gamma_{n}})<\epsilon_{n}

and

d(hr21Gn/Γn,1Gn/Γn)<ϵn.d(h^{r_{2}}1_{G_{n}/\Gamma_{n}},1_{G_{n}/\Gamma_{n}})<\epsilon_{n}.

Let A=nAnA=\bigcup_{n\in\mathbb{N}}A_{n} and B=nBnB=\bigcup_{n\in\mathbb{N}}B_{n}. By construction, AA and BB are disjoint subset of RR. It remains to show that AA and BB are sets of pointwise kk-step nilrecurrence.

By definition of 𝒟\mathcal{D}, for any kk-step nilmanifold X=G/ΓX=G/\Gamma, every gGg\in G and ϵ>0\epsilon>0, there is an nn\in\mathbb{N} such that (G,Γ)(G,\Gamma) is isomorphic to (Gn,Γn)(G_{n},\Gamma_{n}), and under this isomorphism gHng\in H_{n} and ϵn<ϵ\epsilon_{n}<\epsilon. Therefore, there exists rAnAr\in A_{n}\subset A such that d(gr1G/Γ,1G/Γ)<ϵn<ϵd(g^{r}1_{G/\Gamma},1_{G/\Gamma})<\epsilon_{n}<\epsilon. Because ϵ\epsilon is arbitrary, we deduce that AA is a set of pointwise recurrence for the system (G/Γ,g)(G/\Gamma,g). Since G,Γ,gGG,\Gamma,g\in G are arbitrary, we have AA is a set of pointwise kk-step nilrecurrence. Similar conclusion is true for BB. ∎

The following two lemmas are standard and their proofs are included for completeness.

Lemma 3.4.

Let A,B,CA,B,C\subset\mathbb{N}. Suppose that AA is separable by some kk-step nilrotations from BB and CC. Then AA is separable by a kk-step nilrotation from BCB\cup C.

Proof.

Let (X1=G1/Γ1,g1)(X_{1}=G_{1}/\Gamma_{1},g_{1}) be a kk-step nilsystem such that g1A1X1¯g1B1X1¯=\overline{g_{1}^{A}1_{X_{1}}}\cap\overline{g_{1}^{B}1_{X_{1}}}=\varnothing. Let (X2=G2/Γ2,g2)(X_{2}=G_{2}/\Gamma_{2},g_{2}) be a kk-step nilsystem such that g2A1X2¯g2C1X2¯=\overline{g_{2}^{A}1_{X_{2}}}\cap\overline{g_{2}^{C}1_{X_{2}}}=\varnothing. Considering the product system (X1×X2,(g1,g2))(X_{1}\times X_{2},(g_{1},g_{2})), we have

(g1,g2)A(1X1,1X2)¯(g1,g2)BC(1X1,1X2)¯=.\overline{(g_{1},g_{2})^{A}(1_{X_{1}},1_{X_{2}})}\cap\overline{(g_{1},g_{2})^{B\cup C}(1_{X_{1}},1_{X_{2}})}=\varnothing.

Therefore, AA and BCB\cup C are separable by a kk-step nilrotation. ∎

Lemma 3.5.

If EE and FF are kk-step interpolation sets and they are separable by a kk-step nilrotation, then EFE\cup F is a kk-step interpolation set.

Proof.

Let A,BA,B be two disjoint subsets of EFE\cup F. Then A=(AE)(AF)A=(A\cap E)\cup(A\cap F) and B=(BE)(BF)B=(B\cap E)\cup(B\cap F). Invoking Theorem 2.1, the sets AEA\cap E and BEB\cap E are separable by a kk-step nilrotation because they are disjoint subsets of a kk-step interpolation set EE. On the other hand, AFA\cap F and BEB\cap E are separable by a kk-step nilrotation because EE and FF are separable by a kk-step nilrotation. By Lemma 3.4, the sets AA and BEB\cap E are separable by a kk-step nilrotation. Similarly, AA and BFB\cap F are separable by a kk-step nilrotation. Invoking Lemma 3.4 again, we have AA and BB are separable by a kk-step nilrotation. Since AA and BB are two arbitrary disjoint subsets of EFE\cup F, we get EFE\cup F is a kk-step interpolation set by Theorem 2.1. ∎

We are ready to prove Theorem 1.3.

Proof of Theorem 1.3.

By induction, it suffices to assume S={a}S=\{a\} for some aa\in\mathbb{N}. By contradiction, suppose E{a}E\cup\{a\} is not kk-interpolation. Since both EE and {a}\{a\} are kk-interpolation, by Lemma 3.5, it follows that EE and {a}\{a\} are not separable by any kk-step nilrotation. Therefore, for every kk-step nilsystem (X=G/Γ,g)(X=G/\Gamma,g), ga1Xg^{a}1_{X} is in the closure of gE1Xg^{E}1_{X}. Or equivalently, 1X1_{X} is in the closure of gEa1Xg^{E-a}1_{X}. Since (X=G/Γ,g)(X=G/\Gamma,g) is an arbitrary kk-step nilsystem, we conclude that EaE-a is a set of pointwise kk-step nilrecurrence. In view of Lemma 3.3, the set EaE-a can be partitioned into two sets of pointwise kk-step nilrecurrence, say AA and BB. Hence, for every kk-step nilsystem (X=G/Γ,g)(X=G/\Gamma,g), we have

1XgA1X¯gB1X¯1_{X}\in\overline{g^{A}1_{X}}\cap\overline{g^{B}1_{X}}

Or equivalently,

ga1XgA+a1X¯gB+a1X¯g^{a}1_{X}\in\overline{g^{A+a}1_{X}}\cap\overline{g^{B+a}1_{X}}

In particular, gA+a1X¯gB+a1X¯\overline{g^{A+a}1_{X}}\cap\overline{g^{B+a}1_{X}} is non-empty. Since (X=G/Γ,g)(X=G/\Gamma,g) is an arbitrary kk-step nilsystem, we deduce that A+aA+a and B+aB+a are not separable by any kk-step nilrotation. Hence, by Theorem 2.1, the set E=(A+a)(B+a)E=(A+a)\cup(B+a) is not kk-step interpolation. This is a contradiction. ∎

4. Sublacunary sets and interpolation sets

4.1. Partitioning a compact set by a system of polynomial equations

Lemma 4.1.

Let m,b,m,b,\ell\in\mathbb{N} and Q1,,Q[x1,,xm]Q_{1},\ldots,Q_{\ell}\in\mathbb{R}[x_{1},\ldots,x_{m}] of degree at most bb. Then the union of the solutions sets of \ell equations Qi(x1,,xm)=0Q_{i}(x_{1},\ldots,x_{m})=0 for 1i1\leq i\leq\ell divides m\mathbb{R}^{m} into less than (2b)m(2b\ell)^{m} regions.

Remark 1.

As an illustration of the lemma above, let Q1,Q2[x1,x2]Q_{1},Q_{2}\in\mathbb{R}[x_{1},x_{2}] of degree at most 22. Then for each i{1,2}i\in\{1,2\} the solution set of Qi(x1,x2)=0Q_{i}(x_{1},x_{2})=0 is a conic section. It is easy to see that the number of regions that two conic sections divide 2\mathbb{R}^{2} into is not exceeding 1313, which is less than (222)2(2\cdot 2\cdot 2)^{2} (The maximum number 1313 is achieved when we have two hyperbolas.)

Proof.

On the boundary of every region, there is a point which is a solution to a system of the form

{Qi1(x1,,xm)=0Qim(x1,,xm)=0\begin{cases}Q_{i_{1}}(x_{1},\ldots,x_{m})=0\\ \ldots\\ Q_{i_{m}}(x_{1},\ldots,x_{m})=0\end{cases}

where i1,,im{1,,}i_{1},\ldots,i_{m}\in\{1,\ldots,\ell\} distinct. By Bézout’s theorem, each system has maximum dmd^{m} solutions counting with multiplicity and counting also \infty. There are (km)<km{k\choose m}<k^{m} such systems. Hence, there are less than (kd)m(kd)^{m} points in m\mathbb{R}^{m} that are solutions of one of those systems.

Each point is on the boundaries of at most 2m2^{m} regions where each region is corresponding to a choice of Qij>0Q_{i_{j}}>0 or Qij<0Q_{i_{j}}<0 for 1jm1\leq j\leq m. It follows that there are at most (2b)m(2b\ell)^{m} regions. ∎

For the rest of Section 4.1, we fix a kk-step nilmanifold X=G/ΓX=G/\Gamma with GG being connected and simply connected. Assume dimG=m\dim G=m and the multiplication rule on the Mal’cev coordinates is the following:

(2) s¯t¯=(s1+t1,s2+t2+P1(s1,t1),,sm+tm+Pm1(s1,,sm1,t1,,tm1)))\underline{s}*\underline{t}=(s_{1}+t_{1},s_{2}+t_{2}+P_{1}(s_{1},t_{1}),\ldots,s_{m}+t_{m}+P_{m-1}(s_{1},\ldots,s_{m-1},t_{1},\ldots,t_{m-1})))

where for 1im11\leq i\leq m-1, the polynomial Pi[s1,,si,t1,,ti]P_{i}\in\mathbb{Q}[s_{1},\ldots,s_{i},t_{1},\ldots,t_{i}] has degree at most k1k-1. We also fix the maps ψ,π,ψ~\psi,\pi,\widetilde{\psi} and φ\varphi accordingly as they are defined in Section 2.6.

All constants and big-O terms found in this section implicitly depend on G,ΓG,\Gamma, the choice of Mal’cev’s basis, maps ψ,π,ψ~,φ\psi,\pi,\widetilde{\psi},\varphi, and polynomials P1,,Pm1P_{1},\ldots,P_{m-1}.

Lemma 4.2.

There exists R[x]R\in\mathbb{R}[x] having all coefficients non-negative and for n,1imn\in\mathbb{N},1\leq i\leq m, there exist Qi,n[x1,,xm]Q_{i,n}\in\mathbb{Q}[x_{1},\ldots,x_{m}] satisfying the followings:

  1. (a)

    For every x¯=(x1,,xm)m\underline{x}=(x_{1},\ldots,x_{m})\in\mathbb{R}^{m},

    (3) x¯n=x¯x¯n=(Q1,n(x¯),,Qm,n(x¯)).\underline{x}^{*n}=\underbrace{\underline{x}*\cdots*\underline{x}}_{n}=(Q_{1,n}(\underline{x}),\ldots,Q_{m,n}(\underline{x})).
  2. (b)

    For 1im1\leq i\leq m and nn\in\mathbb{N}, the polynomial Qi,nQ_{i,n} has degree less than kmk^{m}.

  3. (c)

    For 1im1\leq i\leq m and nn\in\mathbb{N}, the sum of absolute values of coefficients of Qi,nQ_{i,n} is bounded above by R(n)R(n).

Proof.

The existence of Qi,nQ_{i,n} satisfying (3) follows from the multiplication rule on Mal’cev coordinates. By induction, we can compute Qi,nQ_{i,n} explicitly.

Q1,n(x¯)=nx1,Q_{1,n}(\underline{x})=nx_{1},
Q2,n(x¯)=nx2+j=1n1P1(x1,jx1).Q_{2,n}(\underline{x})=nx_{2}+\sum_{j=1}^{n-1}P_{1}(x_{1},jx_{1}).

In general, for 1im1\leq i\leq m and nn\in\mathbb{N},

Qi,n(x¯)=nxi+j=1n1Pi1(x1,,xi1,Q1,j(x¯),,Qi1,j(x¯))[x1,,xm].Q_{i,n}(\underline{x})=nx_{i}+\sum_{j=1}^{n-1}P_{i-1}(x_{1},\ldots,x_{i-1},Q_{1,j}(\underline{x}),\ldots,Q_{i-1,j}(\underline{x}))\in\mathbb{Q}[x_{1},\ldots,x_{m}].

It also follows that

degQi,nmax{1,degPi1×max1i1,1jn1{degQ,j}}.\deg Q_{i,n}\leq\max\{1,\deg P_{i-1}\times\max_{1\leq\ell\leq i-1,1\leq j\leq n-1}\{\deg Q_{\ell,j}\}\}.

By induction, we get degQi,nj=1i1(degPj+1)\deg Q_{i,n}\leq\prod_{j=1}^{i-1}(\deg P_{j}+1). Since degPjk1\deg P_{j}\leq k-1, we have

degQi,nki1<km.\deg Q_{i,n}\leq k^{i-1}<k^{m}.

It remains to prove (c)(c). Let P[s1,,sm1,t1,,tm1]P\in\mathbb{R}[s_{1},\ldots,s_{m-1},t_{1},\ldots,t_{m-1}] with the coefficients for any monomial being the maximum of the absolute values of coefficients for corresponding monomials in any of P1,,Pm1P_{1},\ldots,P_{m-1}. For i{1,,m}i\in\{1,\ldots,m\}, nn\in\mathbb{N}, define polynomials Q~i,n[x1,,xm]\tilde{Q}_{i,n}\in\mathbb{Q}[x_{1},\ldots,x_{m}] recursively as follows: Q~1,n(x¯)=nx1\tilde{Q}_{1,n}(\underline{x})=nx_{1}, and for i1i\geq 1,

Q~i,n(x¯)=nxi+j=1n1P(x1,,xi1,1,,1mi,Q~1,j(x¯),Q~2,j(x¯),Q~i1,j(x¯),1,,1mi).\tilde{Q}_{i,n}(\underline{x})=nx_{i}+\sum_{j=1}^{n-1}P(x_{1},\ldots,x_{i-1},\underbrace{1,\ldots,1}_{m-i},\tilde{Q}_{1,j}(\underline{x}),\tilde{Q}_{2,j}(\underline{x})\ldots,\tilde{Q}_{i-1,j}(\underline{x}),\underbrace{1,\ldots,1}_{m-i}).

Then all the coefficients of Q~i,n\tilde{Q}_{i,n} are non-negative and greater than or equal to the absolute value of the corresponding coefficients in Qi,nQ_{i,n}.

Now the sum of coefficients of Q~i,n\tilde{Q}_{i,n} is equal to

(4) Q~i,n(1¯)=n+j=1n1P(1,,1m1,Q~1,j(1¯),Q~2,j(1¯),,Q~i1,j(1¯),1,,1mi).\tilde{Q}_{i,n}(\underline{1})=n+\sum_{j=1}^{n-1}P(\underbrace{1,\ldots,1}_{m-1},\tilde{Q}_{1,j}(\underline{1}),\tilde{Q}_{2,j}(\underline{1}),\ldots,\tilde{Q}_{i-1,j}(\underline{1}),\underbrace{1,\ldots,1}_{m-i}).

From above formula, it is not hard to see that Q~i,n(1¯)Q~i,n+1(1¯)\tilde{Q}_{i,n}(\underline{1})\leq\tilde{Q}_{i,n+1}(\underline{1}) and Q~i,n(1¯)Q~i+1,n(1¯)\tilde{Q}_{i,n}(\underline{1})\leq\tilde{Q}_{i+1,n}(\underline{1}) for all imi\leq m and nn\in\mathbb{N}. Hence the right hand side of (4) is not greater than

n+(n1)P(1,,1m1,Q~i1,n(1¯),,Q~i1,n(1¯)m1).n+(n-1)P(\underbrace{1,\ldots,1}_{m-1},\underbrace{\tilde{Q}_{i-1,n}(\underline{1}),\ldots,\tilde{Q}_{i-1,n}(\underline{1})}_{m-1}).

Define S[x]S\in\mathbb{Q}[x] by S(x)=x+(x1)P(1,,1m1,x,,xm1)S(x)=x+(x-1)P(\underbrace{1,\ldots,1}_{m-1},\underbrace{x,\ldots,x}_{m-1}). We then have

Q~i,n(1¯)S(Q~i1,n(1¯))\tilde{Q}_{i,n}(\underline{1})\leq S(\tilde{Q}_{i-1,n}(\underline{1}))

for all 1im1\leq i\leq m and nn\in\mathbb{N}. By induction,

Q~i,n(1¯)S(S((S(Q~1,n(1¯))=S(S((S(n))\tilde{Q}_{i,n}(\underline{1})\leq S(S(\ldots(S(\tilde{Q}_{1,n}(\underline{1})\ldots)=S(S(\ldots(S(n)\ldots)

where the polynomial SS is repeated m1m-1 times. Let R(n)=S(S((S(n)))R(n)=S(S(\ldots(S(n)\ldots)) where polynomial SS is repeated m1m-1 times. Then we have Q~i,n(1¯)R(n)\tilde{Q}_{i,n}(\underline{1})\leq R(n). This finishes our proof. ∎

In the rest of Section 4.1, we fix polynomials Qi,nQ_{i,n} (for i{1,,m}i\in\{1,\ldots,m\} and nn\in\mathbb{N}) found in Lemma 4.2.

Proposition 4.3.

For x¯:=(x1,,xm)m\underline{x}:=(x_{1},\ldots,x_{m})\in\mathbb{R}^{m}, let z¯=z¯(x):=(z1(x),,zm(x))\underline{z}=\underline{z}(x):=(z_{1}(x),\ldots,z_{m}(x)) be the unique element in m\mathbb{Z}^{m} be such that x¯z¯(x)[0,1)m\underline{x}*\underline{z}(x)\in[0,1)^{m}. There exists a constant c1>0c_{1}>0 such that

|zi(x)|=O((max1im|xi|)c1)|z_{i}(x)|=O((\max_{1\leq i\leq m}|x_{i}|)^{c_{1}})

as x¯m\underline{x}\in\mathbb{R}^{m}.

Proof.

Using (2), we can compute z¯(x)\underline{z}(x) explicitly.

z1=x1,z_{1}=-\lfloor x_{1}\rfloor,
z2=x2+P1(x1,z1),z_{2}=-\lfloor x_{2}+P_{1}(x_{1},z_{1})\rfloor,
z3=x3+P2(x1,x2,z1,z2)z_{3}=-\lfloor x_{3}+P_{2}(x_{1},x_{2},z_{1},z_{2})\rfloor

where \lfloor\cdot\rfloor means taking integer parts. In general, for 2im2\leq i\leq m,

zi=xi+Pi1(x1,,xi1,z1,,zi1).z_{i}=-\lfloor x_{i}+P_{i-1}(x_{1},\ldots,x_{i-1},z_{1},\ldots,z_{i-1})\rfloor.

Let M=max1im|xi|M=\max_{1\leq i\leq m}|x_{i}|. Since degPi<k\deg P_{i}<k for every ii, it follows that

|z1||x1|M,|z_{1}|\leq|x_{1}|\leq M,
|z2||x2|+|P1(x1,z1)|M+O(Mk)=O(Mk),|z_{2}|\leq|x_{2}|+|P_{1}(x_{1},z_{1})|\leq M+O(M^{k})=O(M^{k}),
|z3||x3|+|P2(x1,z1,x2,z2)|M+O((Mk)k)=O(Mk2).|z_{3}|\leq|x_{3}|+|P_{2}(x_{1},z_{1},x_{2},z_{2})|\leq M+O((M^{k})^{k})=O(M^{k^{2}}).

Inductively, we can show that |zi|=O(Mki1)|z_{i}|=O(M^{k^{i-1}}) for 1im1\leq i\leq m. Letting c1=km1c_{1}=k^{m-1}, we have our conclusion. ∎

Corollary 4.4.

For x¯m\underline{x}\in\mathbb{R}^{m} and nn\in\mathbb{N}, let z¯n(x)=(z1,n,,zm,n)m\underline{z}_{n}(x)=(z_{1,n},\ldots,z_{m,n})\in\mathbb{Z}^{m} be such that x¯nz¯n(x)[0,1)m\underline{x}^{*n}*\underline{z}_{n}(x)\in[0,1)^{m}. Let M>0M>0. Then there exists a constant c2=c2(M)>0c_{2}=c_{2}(M)>0 such that the following is true: For x¯[M,M]m\underline{x}\in[-M,M]^{m} and 1im1\leq i\leq m,

|zi,n(x)|=OM(nc2).|z_{i,n}(x)|=O_{M}(n^{c_{2}}).
Proof.

By Lemma 4.2, there exists polynomial R[x]R\in\mathbb{R}[x] such that

x¯n=(Q1,n(x¯),,Qm,n(x¯))\underline{x}^{*n}=(Q_{1,n}(\underline{x}),\ldots,Q_{m,n}(\underline{x}))

where Qi,n[x1,,xm]Q_{i,n}\in\mathbb{Q}[x_{1},\ldots,x_{m}] of degree less than kmk^{m} and the sum of absolute values of coefficients of Qi,nQ_{i,n} is bounded above by R(n)R(n). It follows that if x¯[M,M]m\underline{x}\in[-M,M]^{m}, then

|Qi,n(x¯)|R(n)Mkm.|Q_{i,n}(\underline{x})|\leq R(n)M^{k^{m}}.

In view of Proposition 4.3, there exists a constant c1c_{1} such that for x¯[M,M]m\underline{x}\in[-M,M]^{m},

|zi,n(x¯)|=O((max1im|Qi,n(x¯)|)c1)=O((R(n)Mkm)c1)=OM(nc2)|z_{i,n}(\underline{x})|=O((\max_{1\leq i\leq m}|Q_{i,n}(\underline{x})|)^{c_{1}})=O\left(\left(R(n)M^{k^{m}}\right)^{c_{1}}\right)=O_{M}(n^{c_{2}})

where c2=c1degRc_{2}=c_{1}\deg R. ∎

Proposition 4.5.

Let M>0M>0. There exists constant c3=c3(M)c_{3}=c_{3}(M) such that the following holds: For every 0<ϵ<10<\epsilon<1, if 1n1<n2<<nn1\leq n_{1}<n_{2}<\ldots<n_{\ell}\leq n are natural numbers, then the union of solutions of (1)/2\ell(\ell-1)/2 equations

(5) φ(x¯ni)φ(x¯nj)𝕋m=ϵ(1i<j)\lVert\varphi(\underline{x}^{*n_{i}})-\varphi(\underline{x}^{*n_{j}})\rVert_{\mathbb{T}^{m}}=\epsilon\;\;\;(1\leq i<j\leq\ell)

partition [M,M]m[-M,M]^{m} into OM(nc3)O_{M}(n^{c_{3}}) regions.

Proof.

Suppose φ=(φ1,,φm)\varphi=(\varphi_{1},\ldots,\varphi_{m}) where φi:m[0,1)\varphi_{i}:\mathbb{R}^{m}\to[0,1) for 1im1\leq i\leq m. By definition of the metric 𝕋m\lVert\cdot\rVert_{\mathbb{T}^{m}}, for a,bna,b\leq n, solutions of the equation

φ(x¯a)φ(x¯b)𝕋m=ϵ\lVert\varphi(\underline{x}^{*a})-\varphi(\underline{x}^{*b})\rVert_{\mathbb{T}^{m}}=\epsilon

are solutions of at least one of mm equations

(6) φi(x¯a)φi(x¯b)𝕋=ϵ\lVert\varphi_{i}(\underline{x}^{*a})-\varphi_{i}(\underline{x}^{*b})\rVert_{\mathbb{T}}=\epsilon

for 1im1\leq i\leq m.

Since φi(x¯)[0,1)\varphi_{i}(\underline{x})\in[0,1) all x¯m\underline{x}\in\mathbb{R}^{m}, solutions of (6) are solutions of at least one of two equations:

(7) φi(x¯a)φi(x¯b)=±ϵ.\varphi_{i}(\underline{x}^{*a})-\varphi_{i}(\underline{x}^{*b})=\pm\epsilon.

Because φ(x¯)=x¯z¯(x)\varphi(\underline{x})=\underline{x}*\underline{z}(x), (7) is equivalent to

(8) Qi,a(x¯)+zi,a(x¯)+Pi1(Q1,a(x¯),,Qi1,a(x¯),z1,a(x¯),,zi1,a(x¯))Qi,b(x¯)zi,b(x¯)Pi1(Q1,b(x¯),,Qi1,b(x¯),z1,b(x¯),,zi1,b(x¯))=±ϵ.Q_{i,a}(\underline{x})+z_{i,a}(\underline{x})+P_{i-1}(Q_{1,a}(\underline{x}),\ldots,Q_{i-1,a}(\underline{x}),z_{1,a}(\underline{x}),\ldots,z_{i-1,a}(\underline{x}))\\ -Q_{i,b}(\underline{x})-z_{i,b}(\underline{x})-P_{i-1}(Q_{1,b}(\underline{x}),\ldots,Q_{i-1,b}(\underline{x}),z_{1,b}(\underline{x}),\ldots,z_{i-1,b}(\underline{x}))=\pm\epsilon.

By Corollary 4.4, there exists a constant c2=c2(M)c_{2}=c_{2}(M) such that for x¯[M,M]m\underline{x}\in[-M,M]^{m} and i{1,2,,m}i\in\{1,2,\ldots,m\}, we have

|zi,a(x¯)|=OM(ac2)|z_{i,a}(\underline{x})|=O_{M}(a^{c_{2}})

and

|zi,b(x¯)|=OM(bc2).|z_{i,b}(\underline{x})|=O_{M}(b^{c_{2}}).

By replacing zi,az_{i,a} and zi,bz_{i,b} with possible integer values that they can take, the solution set of (8) is a subset of the union of solutions of 2(2OM(ac2)+1)i(2OM(bc2)+1)i=OM((ab)mc2)=OM(n2mc2)2(2O_{M}(a^{c_{2}})+1)^{i}(2O_{M}(b^{c_{2}})+1)^{i}=O_{M}((ab)^{mc_{2}})=O_{M}(n^{2mc_{2}}) equations:

(9) Qi,a(x¯)+di,a+Pi1(Q1,a(x¯),,Qi1,a(x¯),d1,a,,di1,a)Qi,b(x¯)di,bPi1(Q1,b(x¯),,Qi1,b(x¯),d1,b,,di1,b)=±ϵQ_{i,a}(\underline{x})+d_{i,a}+P_{i-1}(Q_{1,a}(\underline{x}),\ldots,Q_{i-1,a}(\underline{x}),d_{1,a},\ldots,d_{i-1,a})\\ -Q_{i,b}(\underline{x})-d_{i,b}-P_{i-1}(Q_{1,b}(\underline{x}),\ldots,Q_{i-1,b}(\underline{x}),d_{1,b},\ldots,d_{i-1,b})=\pm\epsilon

where dj,a,dj,bd_{j,a},d_{j,b} are integers such that dj,a[OM(ac2),OM(ac2)]d_{j,a}\in[-O_{M}(a^{c_{2}}),O_{M}(a^{c_{2}})] and dj,b[OM(bc2),OM(bc2)]d_{j,b}\in[-O_{M}(b^{c_{2}}),O_{M}(b^{c_{2}})] for j=1,2,,ij=1,2,\ldots,i.

It follows that the union of solutions of (1)/2\ell(\ell-1)/2 equations in (5) is a subset of the union of solutions of (1)/2×OM(n2mc2)\ell(\ell-1)/2\times O_{M}(n^{2mc_{2}}) polynomial equations

(10) Qi,a(x¯)+di,a+Pi1(Q1,a(x¯),,Qi1,a(x¯),d1,a,,di1,a)Qi,b(x¯)di,bPi1(Q1,b(x¯),,Qi1,b(x¯),d1,b,,di1,b)=±ϵQ_{i,a}(\underline{x})+d_{i,a}+P_{i-1}(Q_{1,a}(\underline{x}),\ldots,Q_{i-1,a}(\underline{x}),d_{1,a},\ldots,d_{i-1,a})\\ -Q_{i,b}(\underline{x})-d_{i,b}-P_{i-1}(Q_{1,b}(\underline{x}),\ldots,Q_{i-1,b}(\underline{x}),d_{1,b},\ldots,d_{i-1,b})=\pm\epsilon

where

d1,nj1,,ci,nj1[OM(nj1c2),OM(nj1c2)],d_{1,{n_{j_{1}}}},\ldots,c_{i,{n_{j_{1}}}}\in[-O_{M}(n_{j_{1}}^{c_{2}}),O_{M}(n_{j_{1}}^{c_{2}})]\cap\mathbb{Z},

and

d1,nj2,,di,nj2[OM(nj2c2),OM(nj2c2)]d_{1,{n_{j_{2}}}},\ldots,d_{i,{n_{j_{2}}}}\in[-O_{M}(n_{j_{2}}^{c_{2}}),O_{M}(n_{j_{2}}^{c_{2}})]\cap\mathbb{Z}

for 1j1<j21\leq j_{1}<j_{2}\leq\ell.

Since n\ell\leq n, we have (1)/2×OM(n2mc2)=OM(n2mc2+2)\ell(\ell-1)/2\times O_{M}(n^{2mc_{2}})=O_{M}(n^{2mc_{2}+2}). Moreover, because every Pi1P_{i-1} has degree less than kk and every Qi,jQ_{i,j} has degree less than kmk^{m}, the left hand side of (10) is a polynomial of degree less than kkmk^{km}.

Observe that the number of regions that the union of solutions of (1)/2\ell(\ell-1)/2 equations in (5) partition [M,M]m[-M,M]^{m} is not greater than the following number: The number of regions that the union of solutions of (1)/2\ell(\ell-1)/2 equations that appear in (10) and of 2m2m equations xi=±Mx_{i}=\pm M for i{1,2,,m}i\in\{1,2,\ldots,m\} partition m\mathbb{R}^{m}. In total there are at most OM(n2mc2)+2m=OM(n2mc2)O_{M}(n^{2mc_{2}})+2m=O_{M}(n^{2mc_{2}}) polynomial equations in which the degree of each polynomial is less than kkmk^{km}. According to Lemma 4.1, the number of regions that the union of solutions of these equations partition m\mathbb{R}^{m} is less than

(2kkmOM(n2mc2))m=OM(n2c2m2).\left(2k^{km}O_{M}(n^{2mc_{2}})\right)^{m}=O_{M}(n^{2c_{2}m^{2}}).

Letting c3=2c2m2c_{3}=2c_{2}m^{2}, we have our conclusion. ∎

To state the next proposition, we need a definition.

Definition 4.6.

Let A,BA,B\subset\mathbb{N} and gGg\in G. For ϵ>0\epsilon>0, we say AA and BB are ϵ\epsilon-separable by gg if

d(gA1X,gB1X):=infaA,bBd(ga1X,gb1X)ϵ.d(g^{A}1_{X},g^{B}1_{X}):=\inf_{a\in A,b\in B}d(g^{a}1_{X},g^{b}1_{X})\geq\epsilon.
Proposition 4.7.

Let EE\subset\mathbb{N} be a sublacunary set. Then for every HGH\subset G compact and ϵ>0\epsilon>0, there exist two finite disjoint subsets A,BEA,B\subset E such that AA and BB are not ϵ\epsilon-separable by any gHg\in H.

Proof.

By contradiction, assume there exist HGH\subset G compact and ϵ>0\epsilon>0 such that every two finite disjoint subsets of EE are ϵ\epsilon-separable by some gHg\in H. Since HH is compact, it is contained inside ψ([M,M]m)\psi([-M,M]^{m}) for some MM sufficiently large. Without loss of generality, assume H=ψ([M,M]m)H=\psi([-M,M]^{m}).

Suppose E={rn}nE=\{r_{n}\}_{n\in\mathbb{N}}. For NN\in\mathbb{N}, let R=RN={r1,r2,,rN}R=R_{N}=\{r_{1},r_{2},\ldots,r_{N}\}. We say a subset ARA\subset R an RR-nice set if AA and RAR\setminus A are ϵ\epsilon-separable by some gHg\in H. By our assumption, every subset of RR is an RR-nice set. In other words, there are 2|R|=2N2^{|R|}=2^{N} RR-nice sets. We will show this is impossible when NN is sufficiently large.

For an RR-nice set AA, there exists gHg\in H such that d(gA1X,gRA1X)ϵd(g^{A}1_{X},g^{R\setminus A}1_{X})\geq\epsilon. Associate that gg to AA by saying gg creates AA. We will count number of RR-nice sets created by gg as gg ranges over HH.

For gHg\in H, the set gR1Xg^{R}1_{X} is a finite subset of XX. Connect two elements of gR1Xg^{R}1_{X} if their distance is less than ϵ\epsilon. Since the metric on XX comes from the metric 𝕋m\lVert\cdot\rVert_{\mathbb{T}^{m}} on [0,1)m[0,1)^{m}, the number of connected components is not greater than 1/ϵm1/\epsilon^{m}.

If AA is an RR-nice set created by gg, then AA must solely consist of some of those connected components. More precisely, if a,bRa,b\in R such that aAa\in A and ga1X,gb1Xg^{a}1_{X},g^{b}1_{X} are in the same connected component, then bb must also belong to AA. (Otherwise, if bRAb\in R\setminus A, then on the connected path from ga1Xg^{a}1_{X} to gb1Xg^{b}1_{X}, there would be two adjacent points whose distance is less than ϵ\epsilon but one belongs to gA1Xg^{A}1_{X} while the other belongs to gRA1Xg^{R\setminus A}1_{X}. This would contradict the assumption that d(gA1X,gRA1X)ϵd(g^{A}1_{X},g^{R\setminus A}1_{X})\geq\epsilon.) Therefore, the number of RR-nice sets created by a fixed gg is at most the number of ways to pick connected components of gR1Xg^{R}1_{X}, which is not greater than 2(1/ϵ)m2^{(1/\epsilon)^{m}}.

For g,hHg,h\in H, gg and hh create the same collection of RR-nice sets if for every a,bRa,b\in R,

d(ga1X,gb1X)ϵ if and only if d(ha1X,hb1X)ϵ.d(g^{a}1_{X},g^{b}1_{X})\geq\epsilon\text{ if and only if }d(h^{a}1_{X},h^{b}1_{X})\geq\epsilon.

Or equivalently,

ψ~(ga1X)ψ~(gb1X)𝕋mϵ if and only if ψ~(ha1X)ψ~(hb1X)𝕋mϵ.\lVert\tilde{\psi}(g^{a}1_{X})-\tilde{\psi}(g^{b}1_{X})\rVert_{\mathbb{T}^{m}}\geq\epsilon\text{ if and only if }\lVert\tilde{\psi}(h^{a}1_{X})-\tilde{\psi}(h^{b}1_{X})\rVert_{\mathbb{T}^{m}}\geq\epsilon.

Consider N(N1)/2N(N-1)/2 equations ψ~(ga1X)ψ~(gb1X)𝕋m=ϵ\lVert\tilde{\psi}(g^{a}1_{X})-\tilde{\psi}(g^{b}1_{X})\rVert_{\mathbb{T}^{m}}=\epsilon for a<bRa<b\in R (In these equations, the unknown is gg). The solutions of these equations partitions HH into disjoint regions. Note that the map gψ~(ga1X)ψ~(gb1X)𝕋mg\mapsto\lVert\tilde{\psi}(g^{a}1_{X})-\tilde{\psi}(g^{b}1_{X})\rVert_{\mathbb{T}^{m}} is continuous, and hence, every gg in the same region creates the same collection of RR-nice sets. It remains to count the number of regions.

Let x¯=ψ1(g)\underline{x}=\psi^{-1}(g). Then the equation ψ(ga)ψ(gb)𝕋m=ϵ\lVert\psi(g^{a})-\psi(g^{b})\rVert_{\mathbb{T}^{m}}=\epsilon becomes

(11) φ(x¯a)φ(x¯b)𝕋m=ϵ.\lVert\varphi(\underline{x}^{*a})-\varphi(\underline{x}^{*b})\rVert_{\mathbb{T}^{m}}=\epsilon.

Invoking Proposition 4.5, there is a constant c3=c3(M)c_{3}=c_{3}(M) such that the solutions of N(N1)/2N(N-1)/2 equations of the form (11) where a,bRa,b\in R with a<ba<b partition [M,M]m[-M,M]^{m} into OM(rNc3)O_{M}(r_{N}^{c_{3}}) regions.

Thus there are at most 2(1/ϵ)m×OM(rNc3)=Oϵ,M(rNc3)2^{(1/\epsilon)^{m}}\times O_{M}(r_{N}^{c_{3}})=O_{\epsilon,M}(r_{N}^{c_{3}}) distinct RR-nice sets created by some gHg\in H. Since EE is sublacunary (i.e. (logrN)/N0(\log r_{N})/N\to 0 as NN\to\infty),

limNlogrNc3log2N=0.\lim_{N\to\infty}\frac{\log r_{N}^{c_{3}}}{\log 2^{N}}=0.

It follows that Oϵ,M(rNc3)<2NO_{\epsilon,M}(r_{N}^{c_{3}})<2^{N} for sufficiently large NN. This contradicts our assumption that there are always 2N2^{N} RR-nice sets for every RER\subset E of the form R={r1,r2,,rN}R=\{r_{1},r_{2},\ldots,r_{N}\}. ∎

4.2. Proof of the main theorem

We are ready to prove Theorem 1.2.

Proof of Theorem 1.2.

Let E={rn}nE=\{r_{n}\}_{n\in\mathbb{N}} be a sublacunary set. By Theorem 2.1, it suffices to show that there exist two disjoint subset A,BEA,B\subset E that are not separabe by any kk-step nilrotation.

Similar to the proof of Lemma 3.3, we use the fact that up to isomorphism, the set of pair (G,Γ)(G,\Gamma) where GG is a kk-step nilpotent Lie group and Γ\Gamma is a discrete, cocompact subgroup is countable. Let 𝒞\mathcal{C} be a set of representatives of those non-isomorphic pairs (G,Γ)(G,\Gamma). For each (G,Γ)𝒞(G,\Gamma)\in\mathcal{C}, we can partition GG into countably many compact subsets, say G=j=1HG,jG=\bigcup_{j=1}^{\infty}H_{G,j}. It follows that the set 𝒟={(G,Γ,HG,j,ϵ):(G,Γ)𝒞,j,ϵ{1/n:n}}\mathcal{D}=\{(G,\Gamma,H_{G,j},\epsilon):(G,\Gamma)\in\mathcal{C},j\in\mathbb{N},\epsilon\in\{1/n:n\in\mathbb{N}\}\} is countable. Enumerate 𝒟\mathcal{D} as {(Gn,Γn,Hn,ϵn):n}\{(G_{n},\Gamma_{n},H_{n},\epsilon_{n}):n\in\mathbb{N}\}.

By Proposition 4.7, there exist A1,B1EA_{1},B_{1}\subset E finite and disjoint that are not ϵ1\epsilon_{1}-separable by any gH1g\in H_{1}. Let E2=E(A1B1)E_{2}=E\setminus(A_{1}\cup B_{1}). Since A1,B1A_{1},B_{1} are finite, E2E_{2} is still sublacunary. Hence there exist A2,B2E2A_{2},B_{2}\subset E_{2} finite and disjoint that are not ϵ2\epsilon_{2}-separable by any gH2g\in H_{2}. In general, by induction, we obtain two sequences of finite and pairwise disjoint sets {An}n\{A_{n}\}_{n\in\mathbb{N}} and {Bn}n\{B_{n}\}_{n\in\mathbb{N}} such that for each nn\in\mathbb{N}, AnA_{n} and BnB_{n} are not (ϵn)(\epsilon_{n})-separable by any gHng\in H_{n}. Let A=n=1AnA=\bigcup_{n=1}^{\infty}A_{n} and B=n=1BnB=\bigcup_{n=1}^{\infty}B_{n}. Then AA and BB are disjoint subsets of EE by construction.

Note that if AA and BB are separable by a kk-step nilrotation, there must be an ϵ>0\epsilon>0 and a kk-step nilsystem (X,g)(X,g) such that AA and BB are ϵ\epsilon-separable by gg. Since n=1Hn=n=1Gn\bigcup_{n=1}^{\infty}H_{n}=\bigcup_{n=1}^{\infty}G_{n} and limn1/n=0\lim_{n\to\infty}1/n=0, it follows from our construction that AA and BB are not separable by any nilrotation gn=1Gng\in\bigcup_{n=1}^{\infty}G_{n}. Because nilrotations on n=1Gn\bigcup_{n=1}^{\infty}G_{n} represent all possible kk-step nilrotations, our proof finishes. ∎

5. New interpolation sets for Bohr almost periodic sequences

In this section, we prove Proposition 1.4 about new examples of I0I_{0}-sets and the corresponding corollaries.

Proof of Proposition 1.4.

First of all, if {tn}n\{t_{n}\}_{n\in\mathbb{N}} is a set of Bohr recurrence, then {rn}n\{r_{n}\}_{n\in\mathbb{N}} and {rn+tn}n\{r_{n}+t_{n}\}_{n\in\mathbb{N}} are not separable by any Bohr rotation. Hence, in view of Theorem 2.1, the set E={rn}n{rn+tn}nE=\{r_{n}\}_{n\in\mathbb{N}}\cup\{r_{n}+t_{n}\}_{n\in\mathbb{N}} is not an I0I_{0}-set.

Suppose {tn}n\{t_{n}\}_{n\in\mathbb{N}} is not a set of Bohr recurrence. Then there exists α\alpha in some finite dimensional torus 𝕋d\mathbb{T}^{d} and ϵ>0\epsilon>0 such that tnα𝕋d>ϵ\lVert t_{n}\alpha\rVert_{\mathbb{T}^{d}}>\epsilon for all nn\in\mathbb{N}. Cover 𝕋d\mathbb{T}^{d} by finitely many balls of diameter ϵ/2\epsilon/2, say 𝕋d=i=1Bi\mathbb{T}^{d}=\bigcup_{i=1}^{\ell}B_{i}. Then for each nn\in\mathbb{N}, rnαr_{n}\alpha and (rn+tn)α(r_{n}+t_{n})\alpha must belong to two disjoint balls.

Partition EE into 22\ell sets Fi,FiF_{i},F_{i}^{\prime} for 1i1\leq i\leq\ell as follows. First, let F1={mE:mαB1}F_{1}=\{m\in E:m\alpha\in B_{1}\}. Then, for each nn\in\mathbb{N}, if rnF1r_{n}\in F_{1}, let rn+tnF1r_{n}+t_{n}\in F_{1}^{\prime}, and if rn+tnF1r_{n}+t_{n}\in F_{1} let rnF1r_{n}\in F_{1}^{\prime}. Inductively, for 2i12\leq i\leq\ell-1, let Ei+1=Ek=1i(FkFk)E_{i+1}=E\setminus\bigcup_{k=1}^{i}(F_{k}\cup F_{k}^{\prime}) and Fi+1={mEi+1:mαBi+1}F_{i+1}=\{m\in E_{i+1}:m\alpha\in B_{i+1}\}. For each nn\in\mathbb{N}, if rnFi+1r_{n}\in F_{i+1}, let rn+tnFi+1r_{n}+t_{n}\in F_{i+1}^{\prime}, and if rn+tnFi+1r_{n}+t_{n}\in F_{i+1}, let rnFi+1r_{n}\in F_{i+1}^{\prime}.

By construction, F1,,F,F1,,FF_{1},\ldots,F_{\ell},F_{1}^{\prime},\ldots,F_{\ell}^{\prime} are pairwise disjoint. Moreover, since 𝕋d=i=1Bi\mathbb{T}^{d}=\bigcup_{i=1}^{\ell}B_{i}, we have Eαi=1BiE\alpha\subset\bigcup_{i=1}^{\ell}B_{i}. It follows that E=i=1(FiFi)E=\bigcup_{i=1}^{\ell}(F_{i}\cup F_{i}^{\prime}). Furthermore, since for every nn\in\mathbb{N}, rnαr_{n}\alpha and (rn+tn)α(r_{n}+t_{n})\alpha belong to two disjoint balls, there are no nn\in\mathbb{N} and A{F1,,F,F1,,F}A\in\{F_{1},\ldots,F_{\ell},F_{1}^{\prime},\ldots,F_{\ell}^{\prime}\} such that both rnr_{n} and rn+tnr_{n}+t_{n} are elements of AA. Hence, from our hypothesis that {rn}n\{r_{n}\}_{n\in\mathbb{N}} is lacunary and limntn/rn=0\lim_{n\to\infty}t_{n}/r_{n}=0, each A{F1,,F,F1,,F}A\in\{F_{1},\ldots,F_{\ell},F_{1}^{\prime},\ldots,F_{\ell}^{\prime}\} is lacunary. In particular, AA is an I0I_{0}-set. To show that EE is I0I_{0}, it remains to show that for A,B{F1,,F,F1,,F}A,B\in\{F_{1},\ldots,F_{\ell},F_{1}^{\prime},\ldots,F_{\ell}^{\prime}\} distinct, AA and BB are separable by a Bohr rotation.

For i,j{1,,}i,j\in\{1,\ldots,\ell\} distinct, there does not exist any nn\in\mathbb{N} such that both rnr_{n} and rn+tnr_{n}+t_{n} belong to FiFjF_{i}\cup F_{j}. (Since if rnFir_{n}\in F_{i}, then from the construction, rn+tnr_{n}+t_{n} must belong to FiF_{i}^{\prime}, not FjF_{j}. Likewise, if rn+tnFir_{n}+t_{n}\in F_{i}, rnr_{n} must be in FiF_{i}^{\prime}, not FjF_{j}.) Hence, the set FiFjF_{i}\cup F_{j} is lacunary. Because every lacunary set is an I0I_{0}-set, Fi,FjF_{i},F_{j} are separable by a Bohr rotation according to Theorem 2.1. By the same reason, Fi,FjF_{i},F_{j}^{\prime} and Fi,FjF_{i}^{\prime},F_{j}^{\prime} are separable by Bohr rotations.

For i{1,,}i\in\{1,\ldots,\ell\}, FiαBiF_{i}\alpha\in B_{i} while FiαF_{i}^{\prime}\alpha is in the complement of the ball having the same center as BiB_{i} but with twice diameter. Hence, FiαF_{i}\alpha and FiαF_{i}^{\prime}\alpha have disjoint closures in 𝕋d\mathbb{T}^{d}. In particular, FiF_{i} and FiF_{i}^{\prime} are separable by α\alpha.

We conclude that every two sets in {F1,F,F1,,F}\{F_{1},\ldots F_{\ell},F_{1}^{\prime},\ldots,F_{\ell}^{\prime}\} are separable by a Bohr rotation. Therefore, EE is an I0I_{0}-set. ∎

Corollary 5.1.

Let {rn}n\{r_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} be lacunary and let {tn}n\{t_{n}\}_{n\in\mathbb{N}}\subset\mathbb{N} be such that limntn/rn=0\lim_{n\to\infty}t_{n}/r_{n}=0. Then {rn}n{rn+tn}n\{r_{n}\}_{n\in\mathbb{N}}\cup\{r_{n}+t_{n}\}_{n\in\mathbb{N}} is a 22-step interpolation set.

Proof.

Note that if (ψ(n))n(\psi(n))_{n\in\mathbb{N}} is an 11-step nilsequence, (ψ(n2))n(\psi(n^{2}))_{n\in\mathbb{N}} is a 22-step nilsequence. It follows that a set {sn}n\{s_{n}\}_{n\in\mathbb{N}} is a 22-step interpolation set if {sn2}n\{s_{n}^{2}\}_{n\in\mathbb{N}} is an 11-step interpolation set (See the proof of [16, Proposition 1.7]).

Let {rn}n\{r_{n}\}_{n\in\mathbb{N}} and {tn}n\{t_{n}\}_{n\in\mathbb{N}} satisfy the hypothesis of the corollary. Consider the set F={rn2}n{(rn+tn)2}n={rn2}n{rn2+2rntn+tn2}nF=\{r_{n}^{2}\}_{n\in\mathbb{N}}\cup\{(r_{n}+t_{n})^{2}\}_{n\in\mathbb{N}}=\{r_{n}^{2}\}_{n\in\mathbb{N}}\cup\{r_{n}^{2}+2r_{n}t_{n}+t_{n}^{2}\}_{n\in\mathbb{N}}. Since limntn/rn=0\lim_{n\to\infty}t_{n}/r_{n}=0 and {tn}n\{t_{n}\}_{n\in\mathbb{N}} is increasing, we have

lim infn2rn+1tn+1+tn+122rntn+tn2lim infn2rn+1+tn+12rn+tnlim infnrn+1rn.\liminf_{n\to\infty}\frac{2r_{n+1}t_{n+1}+t_{n+1}^{2}}{2r_{n}t_{n}+t_{n}^{2}}\geq\liminf_{n\to\infty}\frac{2r_{n+1}+t_{n+1}}{2r_{n}+t_{n}}\geq\liminf_{n\to\infty}\frac{r_{n+1}}{r_{n}}.

Because {rn}n\{r_{n}\}_{n\in\mathbb{N}} is lacunary, {2rntn+tn2}n\{2r_{n}t_{n}+t_{n}^{2}\}_{n\in\mathbb{N}} is also lacunary. Hence it is not a set of Bohr recurrence [6]. Furthermore, we also have

limn2rntn+tn2rn2=0.\lim_{n\to\infty}\frac{2r_{n}t_{n}+t_{n}^{2}}{r_{n}^{2}}=0.

In view of Proposition 1.4, the set FF is an I0I_{0}-set. From our discussion at the beginning, the set {rn}n{rn+tn}n\{r_{n}\}_{n\in\mathbb{N}}\cup\{r_{n}+t_{n}\}_{n\in\mathbb{N}} is a 22-step interpolation set. ∎

Corollary 1.5 now follows from Proposition 1.4 and Corollary 5.1. Next we obtain another corollary of Proposition 1.4.

Corollary 5.2 ([7, Corollary 2.7.9]).

Let EE\subset\mathbb{N} be lacunary and let F{0}F\subset\mathbb{N}\cup\{0\} be finite. Then E+F:={m+n:mE,nF}E+F:=\{m+n:m\in E,n\in F\} is an I0I_{0}-set.

Proof.

By Hartman-Ryll-Nardzewski criterion (Theorem 2.1), it suffices to show E+iE+i and E+jE+j are separable by a Bohr rotation for any ijFi\neq j\in F. But this follows from Proposition 1.4 with tn=jit_{n}=j-i for nn\in\mathbb{N}. ∎

Remark 2.

In contrast with Corollary 5.2, it is not true in general that the sum of an I0I_{0}-set and a finite set is an I0I_{0}-set. For example, let E={2n}n{2n+2n1}nE=\{2^{n}\}_{n\in\mathbb{N}}\cup\{2^{n}+2n-1\}_{n\in\mathbb{N}}. Then EE is an I0I_{0}-set. However, E+{0,1}={2n}n{2n+2n1}n{2n+1}n{2n+2n}nE+\{0,1\}=\{2^{n}\}_{n\in\mathbb{N}}\cup\{2^{n}+2n-1\}_{n\in\mathbb{N}}\cup\{2^{n}+1\}_{n\in\mathbb{N}}\cup\{2^{n}+2n\}_{n\in\mathbb{N}} is not an I0I_{0}-set because {2n}n\{2^{n}\}_{n\in\mathbb{N}} and {2n+2n}n\{2^{n}+2n\}_{n\in\mathbb{N}} are not separable by any Bohr rotation.

6. Open questions

As shown in [16] and also Corollary 1.5, there are 22-step interpolation sets that are not I0I_{0}-sets. It is natural to ask to what extent this feature holds for higher step nilsequences. The following question has been asked in [16] and is currently still open.

Question 6.1.

For kk\in\mathbb{N}, does there exist a (k+1)(k+1)-interpolation set that is not a kk-interpolations set?

A topological system (X,T)(X,T) with a metric dd on XX is called distal if for every x,yXx,y\in X distinct, infnd(Tnx,Tny)>0\inf_{n\in\mathbb{N}}d(T^{n}x,T^{n}y)>0. A distal sequence is a sequence of the form (F(Tnx))n(F(T^{n}x))_{n\in\mathbb{N}} for nn\in\mathbb{N} where FF is a continuous function on a distal system (X,T)(X,T) and xXx\in X. It is shown in [1] that nilsystems are distal, therefore every nilsequence is a distal sequence. It is then of interest to study the notion of interpolation sets to distal sequences.

Definition 6.2.

A set EE\subset\mathbb{N} is called an interpolation set for distal sequences if for every bounded function f:Ef:E\to\mathbb{C}, there exists a distal sequence ψ:\psi:\mathbb{N}\to\mathbb{C} such that ψ(n)=f(n)\psi(n)=f(n) for nEn\in E.

Based on Theorem 1.2 and Theorem 1.3, there are two questions we can ask.

Question 6.3.

Let EE\subset\mathbb{N} be an interpolation set for distal sequences and FF\subset\mathbb{N} finite. Is it true that EFE\cup F is an interpolation set for distal sequences?

Question 6.4.

Is it true that no sublacunary set is an interpolation set for distal sequences?

References

  • [1] L. Auslander, L. Green, and F. Hahn. Flows on homogeneous spaces. With the assistance of L. Markus and W. Massey, and an appendix by L. Greenberg. Annals of Mathematics Studies, No. 53. Princeton University Press, Princeton, N.J., 1963.
  • [2] V. Bergelson, B. Host, and B. Kra. Multiple recurrence and nilsequences. Invent. Math., 160(2):261–303, 2005. With an appendix by I. Ruzsa.
  • [3] L. Corwin and F. Greenleaf. Representations of nilpotent Lie groups and their applications. Cambridge University Press, Cambridge, 1990.
  • [4] N. Frantzikinakis and B. Host. Higher order Fourier analysis of multiplicative functions and applications. J. Amer. Math. Soc., 30(1):67–157, 2017.
  • [5] N. Frantzikinakis and B. Host. The logarithmic Sarnak conjecture for ergodic weights. Ann. of Math. (2), 187(3):869–931, 2018.
  • [6] H. Furstenberg. Poincaré recurrence and number theory. Bull. Amer. Math. Soc. (N.S.), 5(3):211–234, 1981.
  • [7] C. Graham and K. Hare. Interpolation and Sidon sets for compact groups. CMS Books in Mathematics. Boston, MA: Springer US, 2013.
  • [8] B. Green and T. Tao. Linear equations in primes. Ann. of Math., 171(3):1753–1850, 2010.
  • [9] B. Green and T. Tao. The quantitative behaviour of polynomial orbits on nilmanifolds. Ann. of Math. (2), 175(2):465–540, 2012.
  • [10] B. Green, T. Tao, and T. Ziegler. An inverse theorem for the Gowers Us+1[N]U^{s+1}[N]-norm. Ann. of Math., 176(2):1231–1372, 2012.
  • [11] D. Grow. A class of I0I_{0}-sets. Collog. Math., 53(1):111–124, 1987.
  • [12] S. Hartman. On interpolation by almost periodic functions. Colloq. Math., 8:99–101, 1961.
  • [13] S. Hartman and C. Ryll-Nardzewski. Almost periodic extensions of functions. Colloq. Math., 12:23–39, 1964.
  • [14] B. Host and B. Kra. Nilpotent structures in ergodic theory, volume 235 of Mathematical Surveys and Monographs. American Mathematical Society, 2018.
  • [15] B. Host, B. Kra, and A. Maass. Variations on topological recurrence. Monatsh. Math., 179(1):57–89, 2016.
  • [16] A. Le. Interpolation sets and nilsequences. Colloq. Math., 162(2):181–199, 2020.
  • [17] A. Leibman. Nilsequences, null-sequences, and multiple correlation sequences. Ergodic Theory Dynam. Systems, 35(1):176–191, 2015.
  • [18] A. Mal’cev. On a class of homogeneous spaces. Izvestiya Akad. Nauk. SSSR. Ser. Mat., 13:9–32, 1949.
  • [19] J.-F. Méla. Approximation diophantienne et ensembles lacunaires. Bull. Soc. Math. France, Mem. 19:26–54, 1969.
  • [20] R. Pavlov. Some counterexamples in topological dynamics. Ergodic Theory Dynam. Systems, 28(4):1291–1322, 2008.
  • [21] C. Ryll-Nardzewski. Concerning almost periodic extensions of functions. Colloq. Math., 12:235–237, 1964.
  • [22] P. Sarnak. Mobius randomness and dynamics. Not. S. Afr. Math. Soc., 43(2):89–97, 2012.
  • [23] E. Strzelecki. On a problem of interpolation by periodic and almost periodic functions. Colloq. Math., 11:91–99, 1963.
  • [24] T. Tao and J. Teräväinen. The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures. Duke Math. J., 168(11):1977–2027, 2019.