A random von Neumann theorem for uniformly distributed sequences of partitions

: In this paper, we prove a theorem that con ﬁ rms, under a supplementary condition, a conjecture concerning random permutations of sequences of partitions of the unit interval.


Introduction
The general study of uniformly distributed sequences of partitions was initiated in [1], inspired by a beautiful construction and result from the study by Kakutani [2]. The subject is closely related to the theory of uniformly distributed sequences, initiated in [3]. There are two classical references for the subject: [4] and [5].
Kakutani took the interval [ ] = I 0, 1 , a number ] [ ∈ α 0, 1 and divided the interval in proportion − α α : 1 . Then, he divided the longest interval of this partition in the same proportion and iterated the procedure dividing always the longest interval of the nth partition, so as to obtain a sequence of partitions of ] [ 0, 1 . If at a certain step there were two or more intervals of maximal length, they were divided simultaneously.
Kakutani proved that this sequence of partitions (denote it by for every continuous function f. In other words, the discrete measure concentrated in the points t i k converges weakly to the Lebesgue measure on [ ] 0, 1 . The construction has been generalized in [1]. Let ρ be any non trivial finite partition of I . In the first step, the longest interval(s) of ρ is subdivided positively homothetically to ρ. The partition obtained in this manner is denoted by ρ I 2 . In the second step, the same procedure is repeated on the longest There are interesting connections between the theory of u.d. sequences of partitions and u.d. sequences of points. This connection is far reaching in the construction of a significant subclass of ρ-refinements, the so-called LS-sequences. The subject was initiated by the present author in [6], and it is connected with the van der Corput sequences of points.
LS-sequences are constructed starting from the partition ρ LS made of + L S intervals (L and S are positive integers) of length β and β 2 , respectively, where β is the positive solution of the equation The present paper is concerned with a result in the domain of uniformly distributed sequences of partitions, related to a proposition by von Neumann for uniformly sequences of points [7].
x n is a dense sequence of points in [ ] 0, 1 , then there exists a rearrangement of these points,

{ }
x nk , which is uniformly distributed.
One of the consequences of von Neumann's result is that there are many u.d. sequences of points.
We will now introduce the definitions we need. We will denote by ! π the set of all the ! N permutations of π.

Main results
In a previous paper [8], we proved the following result.
Proposition 3. If { } π n is a dense sequence of partitions, then there exists a sequence of partitions { } σ n , with ∈ ! σ π n n , which is uniformly distributed.
In the same paper, we made the following conjecture.
Conjecture. If { } π n is a dense sequence of partitions and we select at random a partition ∈ ! σ π k n , then { } σ k is uniformly distributed with probability 1.
We need some preliminary calculations. Let ] [ ∈ q 0, 1 and denote by ( ) N q k the integer such that It is easy to see that the second moment of η k m is uniformly bounded for any sequence of partitions.
This, together with the independence of the η k m 's (for ∈ k ), would allow us to apply the strong law of large numbers and to conclude that, when k tends to infinity, the sequence η k m tends to q m in the Cesàro mean (and nothing more, at least following this line of thought). But this is not what we were looking for. If we want to identify a class for which the conjecture is true, we have to make some assumptions on the sequence { } π k . A simple sufficient assumption is expressed as follows: Theorem 4. If the series of squares of diameters of { } π k is convergent, then its random permutations σ k are uniformly distributed with probability 1. Apply now the Čebišëv inequality. By our assumption, we have, for every > ε 0 (and every m),

Proof. We have
Var .  is an increasing function of q. Therefore, it follows that, almost surely, 0, 1 . In other words, the empirical distribution function F k of σ k tends almost surely to the distribution function of the random variable U uniformly distributed on [ ] 0, 1 . On the other hand, convergence in distribution is known to be equivalent to weak convergence, so the desired conclusion follows. □