An inverse of Furstenberg’s correspondence principle and applications to van der Corput sets
Abstract
We obtain an inverse of Furstenberg’s correspondence principle in the setting of countable cancellative, amenable semigroups. Besides being of intrinsic interest on its own, this result allows us to answer a variety of questions concerning sets of recurrence and van der Corput (vdC) sets, which were posed by Bergelson and Lesigne [BL08], Bergelson and Ferré Moragues [BF21a], Kelly and Lê [KL18], and Moreira [Mor]. We also prove a spectral characterization of vdC sets and prove some of their basic properties in the context of countable amenable groups.
Several results in this article were independently found by Sohail Farhangi and Robin Tucker-Drob, see [FT24].
1 Introduction
In this article, we establish an inverse of Furstenberg’s correspondence principle in the framework of countable, discrete amenable semigroups. Beyond its intrinsic significance, this result enables us to answer a range of open questions posed by Bergelson and Lesigne [BL08], Bergelson and Ferré Moragues [BF21a], Kelly and Lê [KL18], and Moreira [Mor].
We first give some context for Furstenberg’s correspondence principle.
Definition 1.1.
Let be a countable group. A (left) Følner sequence in is a sequence of finite sets such that, for all , . We say is (left) amenable if it has a Følner sequence.111Throughout this article we will use only left amenability and left Følner sequences, so we will omit the adjective ‘left’.
Definition 1.2.
Let be a subset of a countable amenable group . The upper density of along a Følner sequence is defined by
If the is actually a limit, we call it , the density of along . The upper Banach density of , , is defined by
If , we denote by the upper density of with respect to the Følner sequence in .
Szemerédi’s theorem on arithmetic progressions states that any set of natural numbers with contains arithmetic progressions of length for all . Szemerédi proved this theorem in [Sze75] using combinatorial methods. In [Fur77], Furstenberg gave a new, ergodic proof of Szemerédi’s theorem, see Theorem 1.3 below. Throughout this article, we say that is a measure preserving system, m.p.s. for short, if is a probability space and is an action of a semigroup on by measure preserving maps (so ). Similarly, we say is a m.p.s. when is a measure preserving map of the probability space .
Theorem 1.3.
Let be a m.p.s. and let satisfy . Then for all there is some such that
The method that Furstenberg used to derive Szemerédi’s theorem from Theorem 1.3 is nowadays called Furstenberg’s correspondence principle. We state it in the setting of amenable groups:
Theorem 1.4 (Furstenberg’s correspondence principle, cf. [Ber96, Theorem 1.8]).
Let be a countable amenable group with a Følner sequence . For any there is a m.p.s. and with such that, for all and ,
and for all such that exists,
(1) |
In particular, when and , Theorem 1.4 and Theorem 1.3 imply the following result, which in turn implies Szemerédi’s theorem.
Theorem 1.5.
Let satisfy . Then for all there is some such that
Equation 1 naturally leads to the question of whether given a m.p.s. , a set and a Følner sequence in , there is some satisfying (1) for all . The answer is yes:
Theorem 1.6 (Inverse Furstenberg correspondence principle).
Let be a countably infinite amenable group with a Følner sequence . For every m.p.s. and every there exists a subset such that for all and we have
(2) |
In Section 3 we prove that Theorem 1.6 actually holds for cancellative amenable semigroups (see Theorem 3.20).
Remark 1.7.
A special case of Theorem 1.6, which deals with the case and , was obtained by Fish and Skinner in [FS24, Theorem 1.4]. Theorem 1.6 answers a question of Moreira [Mor, Section 6], which was formulated for countable abelian groups. Another special case of Theorem 1.6 is [BF21b, Theorem 5.1], where the authors assume that the action is ergodic and obtain a variant of Equation 2 by passing to a subsequence of . Farhangi and Tucker-Drob have independently obtained (by a different method) a version of Theorem 1.6, and its generalization, Theorem 2.7 (see [FT24, Theorem 1.2]).
Remark 1.8.
Due to the algebraic nature of Furstenberg’s correspondence principle, Theorem 1.6 admits a more general version where some of the involved sets are replaced by their complements, or some intersections are replaced by unions (a version of Furstenberg’s correspondence principle dealing with unions and complements was established in [BF21a, Theorem 2.3], see also [BBF10, Theorem 2.3]). See Theorems 3.14 and 3.15 for more details.
Our Theorem 1.6 was motivated by some open questions in the theory of van der Corput (vdC) sets, which Theorem 1.6 allows us to resolve. The notion of vdC set was introduced by Kamae and Mendès France in [KM78], in connection with the theory of uniform distribution of sequences in . Recall that a sequence in is uniformly distributed mod (u.d. mod ) if for any continuous function we have
where is Lebesgue measure.
Definition 1.9 ([KM78, Page 1]).
A set is a van der Corput set (vdC set) if, for any sequence in such that is u.d. mod for all , the sequence is itself u.d. mod .
Both the notions of u.d. mod and of vdC set naturally extend to more general averaging schemes and indeed to amenable semigroups, as suggested in [BL08, Section 4.2].
Definition 1.10.
Let be a Følner sequence in a countable amenable group . We say that a sequence in is -u.d. mod if for any continuous function we have
For general (not necessarily abelian) groups , we will denote their identity element by , or just if the group is clear from the context.
Definition 1.11 (cf. [BL08, Page 44]).
Let be a Følner sequence in a countable amenable group . We say a subset of is -vdC if any sequence in such that is -u.d. mod for all , is itself -u.d. mod .
In [BL08, Section 4.2] the authors posed the question whether, for any Følner sequence in , a subset is -vdC if and only if it is a vdC set. By using an amplified version of Theorem 1.6 (3.1) we show that the answer is yes by giving the following characterization of -vdC sets which does not depend on the Følner sequence:
Theorem 1.12.
Let be a countably infinite amenable group with a Følner sequence . A set is -vdC in if and only if for any m.p.s. and for any function ,
It is worth mentioning that the condition given in Theorem 1.12 makes sense for any countable (not necessarily amenable) group222The definition makes sense for any (discrete) group, even if it is not countable. We will not be interested in uncountable discrete groups in this article, but many of the properties of vdC sets generalize to this setting.. This leads to the following general definition:
Definition 1.13.
Let be a countable group. We will say that is vdC in if, for every m.p.s. and every ,
From Definition 1.13 it follows that any vdC set in a countable group is of (measurable) recurrence, in the sense that for every m.p.s. and for every such that , we have for some . Indeed, if instead of allowing any we restrict our attention to characteristic functions (or positive functions), Definition 1.13 becomes the definition of set of recurrence. This supports the idea implied by [BL08, Section 3.2] that sets of recurrence are a ‘positive version’ of vdC sets.
Taking definition Definition 1.13 as the starting point, we will prove in Section 6, with the help of Theorem 1.12, several properties of vdC sets. For example, we show that the family of vdC sets in a countable group has the partition regularity property, that is, if is a vdC set and , then either or is a vdC set. We also prove that any vdC set in an amenable group contains two disjoint vdC sets. And finally, we study the behaviour of vdC sets in subgroups and under group homomorphisms and give some (non-)examples of vdC sets. Some of the results of Section 6 are generalizations of results which were obtained for and in [Ruz81] and [BL08].
In Theorem 1.14, which will be presently formulated, we give a spectral characterization of vdC subsets of any countable abelian group (another, very elegant, proof of the result can be found in [FT24]). This provides a generalization of similar results obtained in [KM78, BL08, Ruz81] for vdC subsets of or for (see e.g. [BL08, Theorem 1.8.]). Spectral characterizations (in the setup of abelian groups) are useful both for proving properties of vdC sets and for finding (non-)examples of them. For example, Bourgain used in [Bou87] a version of Theorem 1.14 for to construct a set of recurrence which is not a vdC set.
Given a discrete, countable abelian group we denote by (instead of ) the identity element of and by its Pontryagin dual (which is compact and metrizable, see [Rud62, Theorems 1.2.5, 2.2.6]), with identity . For any Borel probability measure in we denote the Fourier coefficients of by .
Theorem 1.14 (cf. [BL08, Theorem 1.8]).
Let be a countable abelian group. A set is a vdC set in iff any Borel probability measure in with satisfies .
The structure of the article is as follows. In Section 2 we use Theorem 1.6 (and a more general version of it) to answer some questions from [BL08, BF21a, Mor]. In Section 3 we first prove 3.1, an amplified version of Theorem 1.6. We also obtain Theorem 3.20, a general version of Theorem 1.6 for cancellative amenable semigroups. In Section 4 we prove Theorem 4.1, an amplified version of Theorem 1.12 which contains several characterizations of vdC sets. In Section 5 we establish a spectral characterization of vdC sets in countable abelian groups, Theorem 1.14. In Section 6 we prove fundamental properties of vdC sets in amenable groups, such as for example partition regularity. The main result in Section 7 is 7.1, which concerns the relationship between the set of possible Cesaro averages of sequences taking values in a compact set , and in the convex hull of . We deduce several results from 7.1, including an affirmative answer to a question of Kelly and Lê.
Acknowledgements.
Thanks to Vitaly Bergelson for his guidance while writing this article, and for some interesting discussions and suggestions.
Several months before uploading this article, it came to our attention that Sohail Farhangi and Robin Tucker-Drob had been independently studying the topic of vdC sets. Their paper [FT24] contains a long list of characterizations of vdC sets, including the ones from Theorem 1.12 and Theorem 1.14.
We appreciate Farhangi’s input, suggestions, and quick review of the paper. He brought [DHZ19, Theorem 5.2] to our attention, which allowed us to simplify the proof of Theorem 1.14 and to state 3.1 for all amenable groups instead of only monotileable ones. He also noticed how 7.1 can be used to answer a question of Kelly and Lê.
We gratefully acknowledge support from the grants BSF 2020124 and NSF CCF AF 2310412.
2 Some applications of the inverse correspondence principle
In this section we use Theorem 1.6 (and a more general result, Theorem 2.7), to answer several questions from the literature. We first answer333S. Farhangi proved in his dissertation [Far22] that every nice vdC set is a set of nice recurrence for the Følner sequence , thereby addressing Bergelson and Lesigne’s original question. We give a different proof and generalize this result to amenable groups. a question of Bergelson and Lesigne in the general context of countable amenable groups, by proving that every nice vdC set is a set of nice recurrence. The second of these two notions was introduced in [Ber86] for subsets of , although we use the slightly different definition given in [BL08] (we check that both are equivalent in 2.10).
Definition 2.1 (cf. [Ber86, Definition 2.2]).
Let be a group. A subset of is a set of nice recurrence if for any m.p.s. and for any ,
In order to motivate the definition of nice vdC sets, we first state a theorem of Ruzsa which characterizes vdC sets in terms of Cesaro averages:
Theorem 2.2 (cf. [Ruz81, Theorem 1]).
A set is a vdC set iff for any sequence of complex numbers with for all ,
Definition 2.3 (cf. [BL08, Definition 10]).
Let be a countable amenable group with a Følner sequence . A subset of is nice -vdC if for any sequence in ,
Theorem 2.2 implies that in (or ), nice vdC sets are vdC sets. This result is true for any amenable group, as implied by Theorem 1.12 and 2.5 below. Note that Definition 2.3 and Definition 2.1 are expressed in different settings: Definition 2.3 is about Cesaro averages of sequences of complex numbers, while Definition 2.1 is about integrals. We now translate each of these definitions to the setting of the other one:
Proposition 2.4.
Let be a countable amenable group with a Følner sequence . Then a subset is a set of nice recurrence iff for any we have
Proposition 2.5.
Let be a countable amenable group with a Følner sequence . Then a subset of is nice -vdC iff for any m.p.s. and any we have
Remark 2.6.
2.5 implies that the notion of nice -vdC set is independent of the Følner sequence.
Proof of 2.4.
-
Suppose there is some set such that . Then there is a Følner subsequence of such that exists, exists for all and . But by Theorem 1.4 there is some m.p.s. and some such that and for all , thus .
-
Suppose there is a m.p.s. and some such that . By Theorem 1.6 there is some set such that and for all , thus .∎
The proof of 2.5 is completely analogous to that of 2.4, except that we will need to use a result slightly more general than Theorem 1.6. Note that the sets from Theorem 1.6 can be identified with their characteristic functions, that is, -valued functions. Theorem 1.6 corresponds to the specific case of Theorem 2.7 corresponding to and functions of the form .
Theorem 2.7.
Let be a countably infinite amenable group with a Følner sequence and let be compact. Then for any m.p.s. and any measurable function there is a sequence of complex numbers in such that, for all , and all continuous functions ,
(3) |
Conversely, given a sequence in there is a m.p.s. and a measurable function such that, for all and continuous, Equation 3 holds if the left hand side limit exists.
Theorem 2.7 pertains to sequences with values in a compact subset of , but in some cases one may adapt it to unbounded sequences, see [FT24, Theorem 3.3].
Proof of 2.5.
-
Suppose for contradiction that there is a m.p.s. and some measurable function such that
By Theorem 2.7 there is some sequence such that
so is not a nice -vdC set.
-
If is not nice -vdC then for an adequate sequence in and some subsequence of we have
Applying again Theorem 2.7, we obtain a m.p.s. and some measurable function such that
In [BL08, Question 8] it is asked whether there is any implication between the notions ‘nice vdC set’ and ‘set of nice recurrence’. It was also proved in [BL08] that if is a nice vdC set, then satisfies the following, weak version of nice recurrence: for any m.p.s. and for any , we have . Both 2.5 and 2.4 imply that nice vdC sets are sets of nice recurrence in any amenable group.
We now recall a combinatorial version of sets of nice recurrence:
Definition 2.8.
Let be a countable amenable group with a Følner sequence . A set is nicely -intersective if for all and there is some such that
In his blog post [Mor, Section 6], Moreira asked whether, for a given Følner sequence , every subset of the natural numbers is of nice recurrence iff it is nicely -intersective. Fish and Skinner very recently established this result in [FS24, Theorem 1.3] for the Følner sequence but left open the question of whether it holds for all Følner sequences in . We generalize the result to Følner sequences in amenable groups:
Proposition 2.9.
For any Følner sequence in a countable amenable group , a set is of nice recurrence iff it is nicely -intersective.
2.9 can be proved using Furstenberg’s correspondence principle, once we check the following characterization of sets of nice recurrence (a general version of [BL08, Proposition 3.8]):
Lemma 2.10.
Let be a countable group. A set is of nice recurrence iff for any m.p.s. , and there exists such that .
Proof.
The forward implication is clear. So suppose is not of nice recurrence. That means that there is a m.p.s. , and such that for all except finitely many elements we have .
Now consider the uniform Bernoulli shift , where is the product and . Letting be the identity in , the set satisfies that for all , and in particular for . Thus, in the product m.p.s. , we have for all , concluding the proof. ∎
Proof of 2.9.
If is not of nice recurrence, by 2.10 there is some m.p.s. , and such that, for all , . Thus, by Theorem 1.6 there is some subset of such that and for all , . So is not a nicely intersective set. The other implication can be proved similarly, using the usual Furstenberg correspondence principle instead of the inverse one. ∎
Bergelson and Moragues asked in [BF21a] (after Remark 3.6) whether for all countable amenable groups and all Følner sequences in there is a set such that but for all finite , . Well, if we apply a version of Theorem 1.6 with unions instead of intersections (Theorem 3.15) to a m.p.s. with for all and , we obtain the following:
Proposition 2.11.
Let be a countably infinite amenable group with a Følner sequence . Then there is a set such that, for all finite ,
3 Correspondence between Cesaro and integral averages
The main objective of this section is proving Theorem 2.7. It will be deduced from 3.1, a more technical version of Theorem 2.7 which also includes a finitistic criterion for the existence of sequences with given Cesaro averages. At the end of the section we prove Theorem 3.14, a general converse of the Furstenberg correspondence principle, and Theorem 3.20, a version of Theorem 1.6 for semigroups.
Proposition 3.1.
Let be a countably infinite amenable group with a Følner sequence , and let be compact. For each let , and let be continuous. Finally, let be a sequence of complex numbers. The following are equivalent:
-
1.
There exists a sequence of elements of such that, for all ,
(4) -
2.
There exists a m.p.s. and a measurable function such that, for all ,
(5) -
3.
(Finitistic criterion) For all finite and for all there exist some and sequences in , for , such that for all we have
(6)
Remark 3.2.
For the equivalence 13 to hold need not be compact, and can be any bounded function (not necessarily continuous). Indeed, all we will use in the proof of 31 is that the functions are bounded, and it is not hard to show 13 if the functions are bounded: suppose that satisfies 1 for some Følner sequence . Then one can check that given , for big enough , the constant and the sequences given by , for , satisfy Item 3.
Proof of Theorem 2.7 from 3.1.
Let and be as in Theorem 2.7.
Now, for each , the set is separable in the supremum norm. So we can consider for each elements and functions such that for any , for any continuous and for any there exists such that , and .
If we now apply 3.1 to the sequence
we obtain a sequence of elements of such that, for all ,
(7) |
This implies that Equation 3 holds for any and , so we are done proving the first implication.
The converse implication of Theorem 2.7 follows from standard proofs of the the Furstenberg correspondence principle, see e.g. [BF21a, Pages 922-923]. We give a short proof using 3.1. Given a sequence in , first choose a Følner subsequence such that the following limit exists for all .
So, by 3.1 there is a m.p.s. and a measurable function such that, for all , Equation 5 holds. In particular, Equation 3 holds if the left hand side limit exists (as the limit along the sequence is the same as along the sequence ), as we wanted. ∎
We will now prove 3.1. We will show 1231. The complicated implication is 31. During the rest of the proof we fix an amenable group , a Følner sequence and a compact set .
Proof of 12.
Let be as in 1. Consider the (compact, metrizable) product space of sequences in , with the Borel -algebra. We have an action of on by .
For each let be the average of Dirac measures . Let be the weak limit of some subsequence ; then is invariant by for all , because and for all ,
Finally, we define by (where is the identity). Then for all we have
Proof of 23.
Consider the function given by and let be the measure in . As a Borel probability measure on a compact metric space, can be weakly approximated by a sequence of finitely supported measures , which we may assume are of the form
For some finite index sets and some sequences , for . Now, the fact that weakly means that for all and finite we have
So for any and , Equation 6 will be satisfied for big enough . ∎
In order to prove 31, we will first need some lemmas about averages of sequences of complex numbers.
Proposition 3.3.
Let and . For any finite sets such that and any complex numbers with , we have
Proof.
The left hand side above is equal to
Definition 3.4.
Let be subsets of a group . We denote
Remark 3.5.
Note that if is a Følner sequence in and is finite, then , because for all . Also note that if , then . Finally, if , then for all we have .
The following lemma is a crucial part of the proof of 3.1. Intuitively, it says that if you have a finite set of bounded sequences defined in finite subsets of a group , you can reassemble them into a sequence defined in a bigger finite set which is a union of right translates of the sets , and the average value of will approximately be the weighted average of the average values of the .
Lemma 3.6.
Let be a group, and . Let be finite subsets of such that are pairwise disjoint, contained in and . For let be sequences of complex numbers in , and consider a sequence such that
Finally, let be finite with and let satisfy . If we have for all , then
Proof.
Considering sequences of complex numbers as functions , which we write during this proof as , we will denote
Note that, given , we will have whenever for all , which happens when for all , that is, when . Thus, for each we have
the last inequality being because and the summands have norm . Taking weighted averages over , we obtain
But applying 3.3 with , and the sequence we also have
So by the triangle inequality, we are done. ∎
The only non elementary fact that we will need in the proof of 31 is [DHZ19, Theorem 5.2]; in order to state it we first recall some definitions:
Definition 3.7 (cf. [DHZ19, Defs 3.1,3.2]).
A tiling of a group consists of two objects:
-
•
A finite family (the shapes) of finite subsets of containing the identity .
-
•
A finite collection of subsets of , the center sets, such that the family of right translates of form with and (such sets are the tiles of ) form a partition of .
Definition 3.8 (cf. [DHZ19, Page 17]).
We say a sequence of tilings of a group is congruent if every tile of equals a union of tiles of .
Definition 3.9.
If and are finite subsets of a group , we say that is -invariant if .555This is not the definition of -invariant used in [DHZ19], but it will be more convenient for our purposes.
We will need the following weak version of [DHZ19, Theorem 5.2]:
Theorem 3.10 (cf. [DHZ19, Theorem 5.2]).
For any countable amenable group there exists a congruent sequence of tilings such that, for every finite and , all the tiles of are -invariant for big enough .
The following notation will be useful.
Definition 3.11.
For any tiling of a group and any finite set , we let denote the union of all tiles of which intersect both and .
Remark 3.12.
Let be a countable amenable group with a tiling and a Følner sequence . As , Remark 3.5 implies that
Lemma 3.13.
Let be a countably infinite amenable group with a Følner sequence , and let be a congruent sequence of tilings of . Then there is a partition of into tiles of the tilings such that
-
•
For each , contains only finitely many tiles of .
-
•
If for each we let , then we have
Proof.
We can assume that , adding some Følner sets to the sequence if necessary. In the following, for each finite set and we will denote , so that for all ,
Now for each let be a big enough number that for all .
Let and for each let be the union of all tiles of intersecting some element of . Thus, for all , and is a union of tiles of . We define to be the partition of formed by all tiles of contained in , for all .
Now, fix and let be the smallest natural number such that (note that when ). Note that all tiles intersecting must be in for some . Thus, the set of all tiles of which are contained in must contain . But we have , so . So , and we are done.∎
Proof of Item 3Item 1.
Let and for all (we may assume and for all ). We prove first that 3 implies the following:
-
3’.
Let and . Then for any sufficiently left-invariant666By this we mean that there is a finite set and some such that the property stated below is satisfied for all -invariant sets. subset of there exists a sequence in such that, for all ,
In order to prove 3’. from 3, fix and consider a tiling of such that for all and . For each there is by 3 some and sequences in () satisfying
(8) |
Then any finite subset of such that and
(9) |
will satisfy 3’.; to see why, first note that the union of all tiles of contained in satisfies ; now obtain a set by removing finitely many tiles from in such a way that, for each , the number of tiles of shape contained in is a multiple of . Note that, due to Equation 9, this can be done in such a way that .
So letting be the set of tiles of contained in , we can define a function that associates for each translate some value in , and such that for each , the number of right-translates of having value is the same for all . Finally, define a sequence by
The rest of values of are not important, we can let them be some fixed value of . Then, by 3.6 applied to the set and the tiles of contained in , we obtain for all that
But as the sequences in () satisfy Equation 8, we have for all that
so we are done proving 3’. by the triangle inequality.
Now we use 3’. to prove 1. By 3’. and Theorem 3.10, there is a congruent sequence of tilings of (we may also assume if ) such that
-
1.
For all and for we have .
-
2.
For each there is a sequence such that for all ,
(10)
Now, letting be the Følner sequence of Item 1, we let and be as in 3.13, with () being finite sets of tiles of such that . We define the sequence by
All that is left is proving that satisfies 1 for all . So let and . Note that for big enough we have . Fix some natural number (also suppose ). Letting be obtained from by removing the (finitely many) tiles which are in for some , then for big enough we have . Thus, applying 3.6 to the set and to all the tiles contained in , and for each letting be the number of tiles of shape in which are contained in , we obtain
(11) |
However, the double sum in Equation 11 is at distance of (this follows from taking an affine combination of Equation 10 applied to the tiles of , with constant ). So by the triangle inequality, for big enough we have
As is arbitrary, we are done. ∎
As promised in the introduction, we now prove a converse to Furstenberg’s correspondence principle. Theorem 3.14 is a slight generalization of Theorem 1.6 in which we also allow intersections with complements of the sets . In the following, for any and , we denote , and .
Theorem 3.14.
Let be a countably infinite amenable group with a Følner sequence . For every m.p.s. and every there exists a subset such that, for all , and we have
(12) |
Reciprocally, for any subset there is a m.p.s. and satisfying Equation 12 for all as above such that the density in Equation 12 exists.
Proof.
Let be given by and . Note that for all we have
So by Theorem 2.7 applied to the polynomials of the form (for all ) and with , there exists some characteristic function such that for all and we have
The other implication is proved similarly, applying Theorem 2.7 in the other direction. ∎
Theorem 3.14 is a statement about densities of any sets in the algebra generated by the family . For example, using that for any the set is the union for all not all equal to of , we obtain a version of Furstenberg’s correspondence principle with unions:
Theorem 3.15 (Inverse Furstenberg correspondence principle with unions).
Let be a countably infinite amenable group with a Følner sequence . For every m.p.s. and every there exists a subset such that for all and we have
Remark 3.16.
It is possible to give a version of Theorem 1.6 that involves translates of several sets , as in [BF21b, Definition A.3], or even countably many sets . We will not do so as it falls outside the scope of this article and it would involve proving a modified version of 3.1.
We include a version of Theorem 1.6 for semigroups.
Definition 3.17.
Let be a semigroup. For and , we let . We say is (left) amenable777This definition is known to be equivalent to Definition 1.1 for countable groups. if there is a finitely additive probability measure such that for all . We say that is cancellative when for all , implies and implies . A Følner sequence in is a sequence of finite subsets of such that, for all , .
For the rest of the section we fix a countable, (left) amenable, (two-sided) cancellative semigroup . In particular, is left-reversible, that is, for all (in fact, for any left-invariant mean in ). An argument dating back to [Ore31] implies that can be imbedded into a group , the group of right quotients of , such that , see [CP61, Theorem 1.23].
We will use the fact that any -m.p.s. can be extended to a -m.p.s. Extensions of measure-theoretic and topological semigroup actions to groups have quite recently been studied in [FJM24, Don24, BBD25a, BBD25b].
Definition 3.18.
We say a measurable space is standard Borel if there is a metric on such that is a complete, separable metric space with Borel -algebra . We say a m.p.s. is standard Borel if is standard Borel.
Theorem 3.19 (See [Don24, Theorem 2.7.7] or [FJM24, Theorem 2.9]).
For any standard Borel m.p.s. there is a m.p.s. and a measure preserving map with for all .
Theorem 3.20.
Let be a countably infinite, amenable, cancellative semigroup with a Følner sequence 888Any amenable, (two-sided) cancellative semigroup has a Følner sequence: let be the group of right fractions of . Then from any Følner sequence in and any elements we obtain a Følner sequence in .. For every m.p.s. and every there exists a subset such that for all and we have
(13) |
Remark 3.21.
We only generalize Theorem 1.6 to semigroup actions, but the same argument can be used to generalize Theorem 2.7.
Proof.
Let be the group of right quotients of . Note that as generates and is a Følner sequence in , is also a Følner sequence in .
We first suppose that is standard Borel, so by Theorem 3.19 there is a m.p.s. and a measure preserving map such that for all . Letting , we have
for all . We finish the proof be applying Theorem 1.6 to obtain a set such that for all and we have
We now tackle the general case, where is an arbitrary measure space. Our construction is similar to the ones in [Par05, Chapter 5, Section 3]. We may assume that contains the identity (if not, we work with ). Consider the compact metric space with the product topology, and let be the Borel -algebra in , which is generated by the sets , . The map is measurable, and if we consider the continuous, measurable maps , then we have for all . Thus, the pushforward probability measure in is invariant by for all . Letting , for all we have . So for all ,
As is standard Borel, we are done. ∎
4 Characterizations of vdC sets in amenable groups
In this section we prove Theorem 4.1 below, our main characterization theorem for vdC sets in countable amenable groups. Theorem 4.1 gives a characterization of -vdC sets analogous to Theorem 2.2 but for any Følner sequence. In particular, it implies that the notion of -vdC set is independent of the Følner sequence, thus answering the question in [BL08, Section 4.2] of whether -vdC implies vdC. See 7.14 for yet another characterization of -vdC sets.
Theorem 4.1.
Let be a countably infinite amenable group with a Følner sequence . For a set , the following are equivalent:
-
1.
is an -vdC set.
-
2.
For all sequences of complex numbers in the unit disk ,
-
3.
For all sequences of complex numbers in ,
-
4.
is a vdC set in : for all m.p.s. and ,
(14) -
5.
(Finitistic characterization) For every there is and finite sets such that for any and sequences in , for , such that
we have
Remark 4.2.
It is an interesting question whether, if we change ‘’ by ‘’ in Definition 1.13, the resulting definition of vdC set in is equivalent. A similar question is posed in [FT24, Question 3.7], where they call the sets defined by the definition ‘sets of operatorial recurrence’.
The relationship between equidistribution and Cesaro averages is explained by 4.4 below, which was introduced by Weyl in [Wey16].
Definition 4.3.
Let be a countable amenable group with a Følner sequence . We say that a sequence , with for all , is -u.d. in if for every continuous function we have
where is the uniform probability measure in .
That is, a sequence in is -u.d. mod (as in Definition 1.10) iff is -u.d. in .
Proposition 4.4 (Weyl’s criterion for uniform distribution).
Let be a countable amenable group with a Følner sequence . A sequence in is -u.d. in iff for all (or equivalently, for all ) we have
Proof of Theorem 4.1.
Suppose a sequence does not satisfy 2. Taking a Følner subsequence if necessary, we can assume that we have
This contradicts 4 by Theorem 2.7 applied with to the Cesaro averages of and .
The contrapositive of this implication follows from Theorem 2.7 applied to Cesaro averages of the functions and , with . Indeed, if does not satisfy 4, then there is a m.p.s. and such that, for some
So by Theorem 2.7Item 2Item 3, for any finite sets there is and sequences in , for , such that
but
contradicting 4.
Suppose that 5 does not hold for some . So for any finite sets and and for any there exist and sequences in , for , such that
but (we can assume that the following average is a positive real number)
In fact, we can assume the even stronger
This can be achieved by adding some sequences () with for all .999It may also be necessary to change by a multiple of , by repeating each sequence () several times We will now prove the following:
-
5’
There is such that, for any finite sets and and for any and there exist and sequences in , for , such that
(15) but
(16)
First we note that 5’ implies 1, due to Theorem 2.7 applied to the Cesaro averages of and , for and , and Weyl’s criterion. Let us now prove 5’ using a probabilistic trick from [Ruz81, Section 6]
Let , , be as above, and let . We will consider a family of independent random variables supported in , with having density function . Then,
(17) |
Equation 17 can be proved when integrating, as we have and for , . For other values of one can change variables to . So we have
(18) |
Now, for each we define a sequence by choosing, independently for all and , a complex number according to the distribution of . Then the strong law of large numbers implies that with probability we will have, for all and ,
(19) |
So we can fix a family such that Equation 19 holds for all as above. Then, taking averages over all and , we obtain that for all and
Notice that, due to Equation 18, for the expression in the LHS is , and for it is , which has norm . So taking some big enough value , taking the sequences to be the sequences , for and , Equation 15 will be satisfied with for all and . We can check similarly that, for a big enough value of , Equation 16 will be satisfied by the sequences , for and , so we are done. ∎
We will need a finitistic criterion for the notion of vdC sets in order to prove a property of vdC sets (6.4). Letting , we have
Proposition 4.5.
Let be a countably infinite group, let . Then is a vdC set in if and only if for any there exists and a finite subset of such that, for any m.p.s. and any measurable we have
Proof.
A natural proof of this fact uses Loeb measures. In order to avoid using non-standard analysis, we will adapt the proof of [For90, Lemma 6.4].
Let be an increasing sequence of finite sets with . Suppose we have and a sequence of m.p.s.’s and measurable functions such that
We will prove that is not a vdC set by constructing a m.p.s. and some measurable such that
(20) |
To do it, first consider the (infinite) measure space with being the disjoint union , , and if . And let be given by .
Let be the smallest sub--algebra of containing and for all . Then by the Gelfand representation theorem there is a -algebra isomorphism , where is the spectrum of , a compact metrizable space whose elements are non-zero -homomorphisms . The isometry is given by .
We let be the Borel -algebra of . Now consider a Banach limit and define a norm positive functional by
This induces a probability measure on by . Also, the action of on induces an action of on by homeomorphisms by . is -preserving for all , as for any we have
We now let and we check Equation 20: for all ,
∎
5 Spectral Characterization of vdC sets in abelian groups
In this section we prove a spectral criterion for vdC sets in countable abelian groups (Theorem 1.14), which is a direct generalization of the spectral criterion obtained in [Ruz81, Theorem 1]; we state it in a fashion similar to [BL08, Theorem 8]. Theorem 1.14 implies that the notion of vdC set in defined in [BL08] is equivalent to our notion of vdC set, even if it is not defined in terms of a Følner sequence (their Definition 2 uses instead the Følner net of rectangles , , ordered by if and ). Also see [FT24, Theorem 4.3] for a different proof of Theorem 1.14, shorter than the one included here.
Theorem 1.14.
Let be a countable abelian group. A set is a vdC set in iff any Borel probability measure in with satisfies .
As in [BL08, Theorem 1.8] it follows from Theorem 1.14 that, if is a vdC set in and a Borel probability measure in satisfies for all , then for all .
Proof.
-
Suppose there is a probability measure in such that for all but .
Consider a sequence of finitely supported measures which converge weakly to ; we can suppose . Specifically, will be an average of Dirac measures
for some natural numbers and , so that iff . The fact that weakly implies that for all (seeing as a map ) we have
(21) We will prove that, letting , Item 5 of Theorem 4.1 is not satisfied. So let and be finite and let be a Følner sequence in . For each we consider the sequences for all and . It will be enough to prove that
(22) and for all ,
(23) Equation 23 is a direct consequence of Equation 21 and the fact that . To prove Equation 22 first note that, as is a Følner sequence, Equation 22 is equivalent to
(24) Now, let and consider a neighborhood of with . After a reordering, we can assume that for big enough the points are in for all .
Claim 5.1.
There exists such that, for all and for all , .
5.1 implies Equation 24, because is arbitrary and by 5.1 we have that for all , the average is exactly (as ), and for all and big enough , has norm at most .
-
The proof of [BL08, Theorem 1.8, S2S1] can be adapted to any countable abelian group; instead of [BL08, Lemma 1.9] one needs to prove a statement of the form
Lemma 5.2.
Let be a sequence of complex numbers in and let be a Følner sequence such that, for all , the value
is defined. Then there is a positive measure on such that for all , and
And the lemma can also be proved similarly to [BL08, Lemma 1.9], changing the functions from [BL08] by
and one also needs to check that [CKM77, Theorem 2] works for any countable abelian group:
Lemma 5.3 (Cf. [CKM77, Theorem 2]).
Let be a countable abelian group, let be its dual. Let be Borel probability measures in such that weakly, weakly. Then
where , the affinity between and , is given by, for any measure such that are absolutely continuous with respect to ,
The same proof of [CKM77, Theorem 2] is valid; the proof uses the existence of Radon-Nikodym derivatives and a countable partition of unity , for . These partitions of unity always exist for outer regular Radon measures (see [Rud87, Theorem 3.14]), so they exist for any Borel probability measure in .∎
6 Properties of vdC sets
In [BL08] and [Ruz81], several properties of the family of vdC subsets of were proved. In this section we check that many of these properties hold for vdC sets in any countable group. Some of the statements about vdC sets follow from statements about sets of recurrence and the fact that any vdC set is a set of recurrence. Other properties can be proved in the same way as their analogs for sets of recurrence, even if they are not directly implied by them.
Remark 6.1.
Proposition 6.2 (Partition regularity of vdC sets, cf. [Ruz81, Cor. 1]).
Let be a countably infinite group and let satisfy . If is a vdC set in , then either or are vdC sets in .
Proof.
Suppose that are not vdC sets in . Then for there are measure preserving systems , and functions such that
but
But then, considering the function , we have by Fubini’s theorem
but
so is not a vdC set in . ∎
We will need the following in order to prove 6.4.
Proposition 6.3.
Let be a countably infinite group, and let be finite. Then is not a set of recurrence in , so it is not vdC.
Proof.
Consider the -Bernoulli scheme in with the action of given by . Let and let . As is finite, has positive measure, but clearly for all , so we are done. ∎
The following generalizes [Ruz81, Cor. 3], and has a similar proof.
Proposition 6.4.
Let be a countably infinite group and let be a vdC set in . Then we can find infinitely many disjoint vdC subsets of .
Proof of 6.4.
It will be enough to prove that there are two disjoint vdC subsets of .
We will define a disjoint sequence of finite subsets of by recursion. Suppose are given; notice that is finite, so it is not a vdC set. So by 6.2, is a vdC set. Then by 4.5 we can then define to be a finite subset of such that for some constant and for any m.p.s. , we have
Now let and . It is then clear that both and satisfy the definition of vdC set in , so we are done. ∎
The following generalizes [BL08, Corollary 1.15.2] to countable amenable groups.
Theorem 6.5.
Let be a subgroup of a countable amenable group , let . Then is a vdC set in iff it is a vdC set in .
Proof.
If is not a vdC set in , then it is not a vdC set in , as any measure preserving action on a measure space restricts to a measure preserving action on the same measure space.
The fact that if is not a vdC set in then it is not a vdC set in can be deduced from Item 5 of Theorem 4.1: indeed, let be as in Item 5 (applied to the group ) and consider any and finite and any .
We can express , where the are pairwise disjoint and of the form , for some . Thus, for all .
Now, for each we know that there exist and -sequences in , for , such that
(25) |
but
(26) |
Note that we can assume are all equal to some number (e.g. taking to be the least common multiple of all of them) and that is a positive real number for all (multiplying the sequences by some complex number of norm if needed).
Finally, define for each a sequence by for and by elsewhere. This sequence will satisfy Item 5 of Theorem 4.1 (by taking averages of Equations 25 and 26 for ), so we are done. ∎
The following is proved in [BL08, Cor. 1.15.1] for vdC sets in using the spectral criterion; using Definition 1.13 instead we prove it for any countable group.
Proposition 6.6.
Let be a group homomorphism, let be a vdC set in . If , then is a vdC set in .
Proof.
The contra-positive of the claim follows easily from the fact that any measure preserving action on a probability space induces a measure preserving action on by . ∎
Remark 6.7.
The following generalizes [BL08, Corollary 1.16].
Corollary 6.8.
Let be a countable group and let be a finite index subgroup of . Then is not a set of recurrence in , so it is not a vdC set in .
Proof.
Consider the action of on the finite set of left-cosets of , where we give the uniform probability measure . The set has positive measure, but for all we have . ∎
We finally prove that difference sets are nice vdC sets (see e.g. [Far22, Lemma 5.2.8] for the case ). The proof of 6.9 is just the proof that any set of differences is a set of recurrence101010A slight modification of this proof shows that is a set of nice recurrence (see Definition 2.1), which is already found in [Fur81, Page 74] for the case .
Proposition 6.9.
Let be a countable group and let be infinite. Then the difference set is a nice vdC set in .
Proof.
Suppose that for some m.p.s. and some function we have
(27) |
So for some and some finite subset we have
Then for any , letting be a subset of with elements and denoting , we have
This is a contradiction for big enough , because . ∎
The corollary below was suggested by V. Bergelson. Before stating it, recall that a subset of a countable group is thick when for any finite , contains a right translate of . In particular, a subset of a countable amenable group has upper Banach density iff it is thick. Also note that a set is a vdC set in if and only if is a vdC set in ; this follows from the fact that for any m.p.s. and any we have .
Corollary 6.10.
If is a countable group and a subset is thick, then is a nice vdC set.
Proof.
If is thick, then there is an infinite set such that contains the set . Indeed, we can define be recursion by letting be such that , where .
Thus contains the set , so is a vdC set, so is a vdC set. ∎
7 Convexity and Cesaro averages
We prove in 7.1 below that there is a close relationship between the correlation functions of sequences taking values in a compact set , and in the convex hull of . We then explain several applications of this result, including an answer to a question by Kelly and Lê. The arguments involving the law of large numbers which we use to prove 7.1 are based on [Ruz81, Section 6].
Proposition 7.1.
Let be a countably infinite amenable group with a Følner sequence . Let be compact and let be the convex hull of . Then for any sequence of complex numbers in there is a sequence in such that, for any and any pairwise distinct elements , we have
whenever the right hand side is defined.
Proof.
Consider a list , , of all the finite sequences of pairwise distinct elements of , and let ; .
Consider a Følner subsequence of such that for all , the limit
is defined. Then by 3.1, for all finite and for all there exist some and some sequences in , for , such that for all we have
(28) |
Claim 7.2.
For every sequence taking values in , any finite and any there is some and sequences in , , such that for all and all we have
We prove 7.2 below. It follows from 7.2 and Equation 28 that for all finite, and there exist some and sequences in , for , such that for all we have
Thus, by 3.1 there exists a sequence of elements of such that, for all ,
so we are done.
It only remains to prove 7.2, so let take values in . Note that the set of extreme points of is contained in , so by Choquet’s theorem, for every there is a probability measure supported in and with average . So we can consider for each a random variable supported in and satisfying . Note that, if the variables are pairwise independent and are distinct, then we have
Now for each we will choose a sequence , where the variables are chosen pairwise independently and with distribution . Then, for all finite, and , by the strong law of large numbers we will have with probability that, for big enough ,
concluding the proof.∎
Applying 7.1 to the set gives the following result.
Proposition 7.3.
Let be a countably infinite amenable group with a Følner sequence . Then for any sequence of numbers in there is a set such that, for any and any pairwise distinct elements , we have
whenever the right hand side is defined.∎
It follows that, given a measurable function , we can obtain a function (that is, a measurable set) with the same correlation functions:
Proposition 7.4 (Turning functions into sets).
Let be a countably infinite amenable group. For every m.p.s. and every measurable there exists a m.p.s. and such that for all and all distinct we have
Proof.
Let be as in 7.4, and fix a Følner sequence in . Thanks to Theorem 1.6 there is a -valued sequence such that, for all and ,
Thus, by 7.3 there is a set such that, for all and ,
Applying Theorem 1.4 to the set , we are done. ∎
Remark 7.5.
The elements need to be distinct in 7.4; if we applied the result to , we would obtain , which only happens if is essentially a characteristic function.
Note that the statement of 7.4 makes sense for non-amenable groups. It seems plausible to us that 7.4 could be proved for any group using some purely measure-theoretic construction:
Question 7.6.
Is 7.4 true for any countable group ?
The last result in this section, which we prove after 7.1, is about sequences of norm which are ‘very well distributed’ in :
Proposition 7.7 (White noise).
Let be a countable amenable group with a Følner sequence . There is a sequence of complex numbers in such that, for all and distinct elements we have
(29) |
Proof.
By 3.1, 31, it is enough to prove that for all finite, and for all there is some and sequences in , for , such that we have
(30) |
Consider an independent sequence of random variables , such that is uniformly distributed in for all . Clearly, for all and distinct we have
So, as in the proof of 7.1, for each we choose a sequence , where the variables are chosen pairwise independently and with distribution . The strong law of large numbers then implies that for big enough , Equation 30 will be satisfied with high probability, concluding the proof. ∎
Remark 7.8.
Remark 7.9.
Let . If we consider only finitely many values of , then we can construct sequences which satisfy Equation 29 for all Følner sequences simultaneously. For example, letting , where , one can check that Equation 29 is satisfied for all , for all as above and, most importantly, for all Følner sequences . However, there is no sequence which satisfies Equation 29 for all and for all Følner sequences and as above. Indeed, suppose that such a sequence exists. Then for all , the sequence has to be u.d. in (see [KN74, Chapter 1, Theorem 6.2]). But that implies that for some , the numbers all have positive real part. Thus, letting , the sequence is not -u.d., a contradiction.
As was pointed out to us by S. Farhangi, we can use 7.1 to answer a question of Kelly and Lê. We first need some definitions.
Definition 7.10.
We say a sequence of elements of a compact topological group , with Haar measure , is u.d. in if
for all open sets with boundary of measure .
Definition 7.11.
Let be a compact topological group. We say a set is -u.d.vdC111111We use the notation ‘-u.d.vdC’ to avoid confusion with ‘vdC in ’, as in Definition 1.13. if for any sequence in such that is u.d. in for all , the sequence is also u.d. in .
In [KL18, Page 2] the authors mention that it is an interesting (and perhaps difficult) problem to determine whether all -u.d.vdC sets are vdC.
Proposition 7.12.
A set is vdC iff it is -u.d.vdC.
Proposition 7.13.
Let . is vdC iff for every sequence with for all we have
(31) |
Proof.
The following argument was provided by S. Farhangi. follows from Item 2 in Theorem 4.1. So let us prove that, if every sequence in satisfies Equation 31, then every sequence in satisfies Equation 31, with instead of (so is vdC by Theorem 4.1). Thanks to Theorem 2.7, it will be enough to prove the measure theoretic analog of our result: we will assume that for all m.p.s. and measurable we have
(32) |
and we will prove that Equation 32 holds true for all m.p.s. and measurable .
So, fix and such that for all . We let be the real and imaginary parts of respectively. Consider the set with the product -algebra , measure for , and action given by for .
Finally, let . Then for all ,
Equation 32 then implies , so . Similarly, we can conclude by applying the same reasoning to the function instead of . Thus, , so . ∎
Proposition 7.14.
A set is vdC iff for every sequence with for all we have
Proof.
follows from Item 2 in Theorem 4.1. So suppose is not vdC. Then by 7.13 there is a sequence in , some and some Følner subsequence of , such that
Thus, by 7.1 there is a sequence in such that
So by 3.1 (which implies that the set of correlation functions of sequences in a given compact set is independent of the Følner sequence), there is a sequence in such that
References
- [BBD25a] Raimundo Briceño, Álvaro BustosGajardo, and Miguel DonosoEchenique. Extensibility and denseness of periodic semigroup actions. arXiv preprint arXiv:2502.00312, 2025.
- [BBD25b] Raimundo Briceño, Álvaro BustosGajardo, and Miguel DonosoEchenique. Natural extensions of embeddable semigroup actions. arXiv preprint arXiv:2501.05536, 2025.
- [BBF10] Mathias Beiglböck, Vitaly Bergelson, and Alexander Fish. Sumset phenomenon in countable amenable groups. Advances in Mathematics, 223(2):416–432, 2010.
- [Ber86] Vitaly Bergelson. A density statement generalizing Schur’s theorem. Journal of Combinatorial Theory, Series A, 43(2):338–343, 1986.
- [Ber96] Vitaly Bergelson. Ergodic Ramsey theory—an update. Ergodic theory of actions, 228:1–61, 1996.
- [BF21a] Vitaly Bergelson and Andreu FerréMoragues. An ergodic correspondence principle, invariant means and applications. Israel Journal of Mathematics, pages 1–42, 2021.
- [BF21b] Vitaly Bergelson and Andreu FerréMoragues. Uniqueness of a Furstenberg system. Proceedings of the American Mathematical Society, 149(7):2983–2997, 2021.
- [BL08] Vitaly Bergelson and Emmanuel Lesigne. Van der Corput sets in . Colloquium Mathematicum, 110:1–49, 2008.
- [Bou87] Jean Bourgain. Ruzsa’s problem on sets of recurrence. Israel Journal of Mathematics, 59(2):150–166, 1987.
- [CKM77] Jean Coquet, Teturo Kamae, and Michel MendèsFrance. Sur la mesure spectrale de certaines suites arithmétiques. Bulletin de la Société Mathématique de France, 105:369–384, 1977.
- [CP61] Alfred H Clifford and Gordon B Preston. The algebraic theory of semigroups, vol. 1. American Mathematical Society, Providence, 2(7), 1961.
- [DHZ19] Tomasz Downarowicz, Dawid Huczek, and Guohua Zhang. Tilings of amenable groups. Journal für die reine und angewandte Mathematik, 2019(747):277–298, 2019.
- [Don24] Miguel DonosoEchenique. Natural extensions and periodic approximations of semigroup actions. Master Dissertation, Pontificia Universidad Católica de Chile, 2024.
- [Far22] Sohail Farhangi. Topics in ergodic theory and Ramsey theory. Doctoral dissertation, The Ohio State University, 2022.
- [FJM24] Sohail Farhangi, Steve Jackson, and Bill Mance. Undecidability in the ramsey theory of polynomial equations and hilbert’s tenth problem. arXiv preprint arXiv:2412.14917, 2024.
- [For90] Alan Hunter Forrest. Recurrence in dynamical systems: a combinatorial approach. Doctoral dissertation, The Ohio State University, 1990.
- [FS24] Alexander Fish and Sean Skinner. An inverse of Furstenberg’s correspondence principle and applications to nice recurrence. arXiv preprint arXiv:2407.19444, 2024.
- [FT24] Sohail Farhangi and Robin TuckerDrob. Asymptotic dynamics on amenable groups and van der Corput sets. arXiv preprint arXiv:2409.00806, 2024.
- [Fur77] Harry Furstenberg. Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions. Journal d’Analyse Mathématique, 31(1):204–256, 1977.
- [Fur81] Harry Furstenberg. Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, 1981.
- [KL18] Michael Kelly and Thái Hoang Lê. Van der Corput sets with respect to compact groups. Archiv der Mathematik, 110(4), 2018.
- [KM78] Teturo Kamae and Michel MendèsFrance. Van der Corput’s difference theorem. Israel Journal of Mathematics, 31:335–342, 1978.
- [KN74] Lauwerens Kuipers and Harald Niederreiter. Uniform Distribution of Sequences. John Wiley, 1974.
- [Mor] Joel Moreira. Sets of nice recurrence. I Can’t Believe It’s Not Random! https://joelmoreira.wordpress.com/2013/03/04/323/.
- [Ore31] Oystein Ore. Linear equations in non-commutative fields. Annals of Mathematics, 32(3):463–477, 1931.
- [Par05] Kalyanapuram Rangachari Parthasarathy. Probability measures on metric spaces, volume 352. American Mathematical Soc., 2005.
- [Rud62] Walter Rudin. Fourier analysis on groups. Interscience, 1962.
- [Rud87] Walter Rudin. Real and complex analysis. McGraw-Hill international editions: Mathematics series, 1987.
- [Ruz81] Imre Ruzsa. Connections between the uniform distribution of a sequence and its differences. Colloquia Mathematica Societatis János Bolyai, 34:1419–1443, 1981.
- [Sze75] Endre Szemerédi. On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica, 27(199-245):2, 1975.
- [Wey16] Hermann Weyl. Über die Gleichverteilung von Zahlen mod. Eins. Mathematische Annalen, 77(3):313–352, 1916.