6
$\begingroup$

We say that a sequence $(x_n)_{n=1}^\infty \subseteq \mathbb{R}$ is "uniformly distributed in $[a,b]$", with $a < b$, if $(x_n)_{n=1}^\infty \cap [a,b] \neq \varnothing$ and $$\lim_{N \to \infty} \frac{\#\{n \leq N : x_n \in [c,d]\}}{\#\{n \leq N : x_n \in [a,b]\}} = \frac{d-c}{b-a}$$ for all $[c,d] \subseteq [a,b]$, with $c < d$, (here $\#S$ is the number of elements of a finite set $S$).

We say that a sequence $(x_n)_{n=1}^\infty \subseteq \mathbb{R}$ is "uniformly distributed in $\mathbb{R}$" if $(x_n)_{n=1}^\infty$ is uniformly distributed in any $[a,b]$, with $a < b$.

I have a construction for a sequence uniformly distributed in $\mathbb{R}$. Are there in the literature examples of uniformly distributed sequence in $\mathbb{R}$? References?

Thank you all for your help.

$\endgroup$
8
  • 4
    $\begingroup$ If a sequence is uniformly distributed in $[a,a]$ then, by your definition, it has to meet $[a,a]$, so it must contain $a$. Then, to be u.d. in $\bf R$, it must contain every $a$ in $\bf R$. This is manifestly impossible. $\endgroup$ Sep 14, 2013 at 10:48
  • 2
    $\begingroup$ OK, I forgot to mention that all my intervalls $[a,b]$, $[c,d]$ should be understood with $a < b$, $c < d$. $\endgroup$
    – Fry
    Sep 14, 2013 at 11:03
  • $\begingroup$ I don't have the Kuipers and Niederreiter book handy. If I did, it's the first place I'd look to see what has been done on this topic. $\endgroup$ Sep 14, 2013 at 11:12
  • 2
    $\begingroup$ Perhaps you have a defective copy of the book. In the index of my copy, under "Uniform distribution in $\bf R$", it lists pages 283, 284, 296, 301, and 303. $\endgroup$ Sep 15, 2013 at 23:36
  • 1
    $\begingroup$ Regarding $\mathbb{R}$, one can prove that $(x_n) \subseteq \mathbb{R}$ is KN-u.d. if and only if $(rx_n)$ is u.d. mod 1 for all real $r \neq 0$. So if $x_n := \alpha n^2 + \beta n$, with $\alpha,\beta \in \mathbb{R}$ linear indipendent on $\mathbb{Q}$, then $(x_n)$ is KN-u.d. in $\mathbb{R}$, but clearly $(x_n)$ is not u.d. in $\mathbb{R}$ in mine definition. $\endgroup$
    – user40023
    Sep 16, 2013 at 17:11

3 Answers 3

3
$\begingroup$

Yes definitely.

You can generate equidistributed sequences on $\bf R$ in the same fashion that you would do on $[0,1) \simeq {\bf R}/{\bf Z}$: by using an ergodic transformation preserving the Lebesgue measure. Note that the Lebesgue measure on $\bf R$ has infinite mass and thus the situation is slightly more subtle on $\bf R$ than on $[0,1)$.

The study of transformations preserving a measure of infinite mass is the topic of infinite measure theory. The standard reference is the book of J. Aaronson, an introduction to infinite measure theory edited by the AMS. The first example of a conservative ergodic transformation from $\bf R$ to $\bf R$ preserving the Lebesgue measure given in the book (and perhaps the simplest example) is the Boole transformation $$x \mapsto x - {1\over x}.$$

Applying the Hopf ratio ergodic theorem, we deduce that for almost all $x\in \bf R$, the sequence given by $x_{n+1} = x_n -{1\over x_n}$, $x_0=x$ is equidistributed according to your definition (which is almost the standard one).

Another way to generate an equidistributed sequence is to use a random walk on $\bf R$. So let $X_1$,...$X_k$... be an iid sequence of real valued random variables defined on some space $(\Omega, {\cal F}, P)$ which are both integrable and with zero expectation. We need a "non-arithmetic" assumption on the law of the $X_i$ because we don't want that the variables take values in a discrete subgroup of $\bf R$. $P_X = {1\over 1+\alpha}(\delta_{-\alpha}+\alpha \delta_1)$ with $\alpha$ positive irrational is ok.

Theorem the sequence $(S_n(\omega))$ is equidistributed on $\bf R$ for almost all $\omega$.

I think that this result is stronger than the CLT. Maybe this can be deduced from the local CLT. Anyway, this follows from the conservativity and ergodicity of the lift of the shift on the skew-product $\Omega\times \bf R$, the same argument as above applies. In addition to the previous reference, there are probably a few probability books where this is discussed but I can't remember any from the top of my head.

$\endgroup$
1
$\begingroup$

Let me guess ...
First: equally spaced points with difference $1$ going from $-1$ to $1$.
Then: equally spaced points with difference $1/2$ going from $-2$ to $2$.
Then: equally spaced points with difference $1/4$ going from $-4$ to $4$.
Then: equally spaced points with difference $1/8$ going from $-8$ to $8$.
And so on.

$\endgroup$
3
  • 7
    $\begingroup$ Except that you also need to specify the order in which you add them within each bunch. If you just go from left to right, you are in big trouble... :-). $\endgroup$
    – fedja
    Sep 14, 2013 at 14:52
  • 1
    $\begingroup$ This doesn't actually answer the question of whether there are any in the literature. $\endgroup$ Sep 14, 2013 at 22:53
  • $\begingroup$ Unlike Gerald's suggestion, the following variant seems to work. First: equally spaced points with difference 1 going from −1 to 1. Then: equally spaced points with difference 1/2 going from −2 to 2. Then: equally spaced points with difference 1/3 going from −3 to 3. Then: equally spaced points with difference 1/4 going from −4 to 4 (always from left to right). $\endgroup$ Sep 15, 2013 at 9:28
0
$\begingroup$

Another couple of recipes to build such sequences uniformly distributed on $\mathbb{R}$ (a kind of long comment).

1. Choose a sequence of integers $(k_n)_{n\in\mathbb{N}}$ which is uniformly distributed in $\mathbb{Z}$ (with the clear meaning), and define correspondingly $$\mu(n):=\#\{ 0\le j < n\,:\, k_j=k_n \}$$ (that is, for any $n\in\mathbb{N}$ the integer $k_n$ has already shown $\mu(n)$ times before). Let $(u_n)_{n\in\mathbb{N}}$ be any uniformly distibuted sequence in $[0,1]$. Then define $$x_n:= k_n + u_{\mu(n)}\, .$$ Therefore for any integer $k$, the terms of $(x_n)$ that belong to the interval $[k,k+1]$ are, in order of appearance, $k+u_0,k+u_1, k+u_2,k+u_3\dots$. As a consequence, the sequence $(x_n)$ verifies the wanted identities at least when $a$ and $b$ are a pair of consecutive integers. But this easily implies the identities for all $a < c < d < b $.

2. The following seems easy to show: if $(v_n)$ is uniformly distributed in $[-1,1]$, for some diverging sequence $(a_n)$ the sequence $a_n v_n$ is uniformly distributed in $\mathbb{R}$.

$\endgroup$
2
  • 2
    $\begingroup$ This doesn't actually answer the question of whether there are any in the literature. $\endgroup$ Sep 14, 2013 at 22:53
  • $\begingroup$ True... I've added the reference-request tag. $\endgroup$ Sep 15, 2013 at 19:39

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.