20
$\begingroup$

Let $\mathbb{R}$ act on itself by translation. Then there is no finite decomposition of a unit interval into pieces which, when translated, yields two distinct unit intervals.

More formally does there exist a partition of the unit interval $[0,1]$ into finitely many sets $S_1,...,S_n$ and a collection of finitely many constants ${r_1,...r_n} \in \mathbb{R}$ such that the the union of $S_a+r_a$ is the set $[0,1]\cup [2,3]$. Where $S_a+r_a$ is the set $S_a$ shifted to the right by $r_a$.

The only proofs I know of this crucially use the invariant mean-characterization of amenability for $\mathbb{R}$. The standard proofs of this characterization use the ultrafilter lemma and are therefore not in ZF+DC.

Is it possible in ZF or (more strongly) ZF+DC for there to be finite decomposition of the unit interval into two pieces. Can we put a bound on how many pieces you would need? (i.e. could you do it with 3 or 4 pieces)?

$\endgroup$
4
  • 7
    $\begingroup$ Might I suggest writing $S_\alpha + r_\alpha$ instead of $r_\alpha(S_\alpha)$? $\endgroup$ Commented Apr 19, 2018 at 13:29
  • $\begingroup$ Even with ZFC, the invariant mean characterization of $\mathbf{R}$ does not apply, since $[0,1]$ has mean zero for any invariant mean. One can use that $\mathbf{R}$ is supramenable, or use the trick of pushing forward such a paradoxical decomposition to a large enough circle. $\endgroup$
    – YCor
    Commented Apr 19, 2018 at 14:18
  • $\begingroup$ I added the fa tag, because it's very likely to be provable with no choice, with a little functional analysis. $\endgroup$
    – YCor
    Commented Apr 19, 2018 at 14:19
  • $\begingroup$ The argument I had in mind directly using the invariant mean characterization of amenability was decomposition $R$ into countable many copies of unit intervals. $\endgroup$
    – Josh F
    Commented Apr 19, 2018 at 18:17

2 Answers 2

16
$\begingroup$

No. Let $A$ be the free abelian group generated by the $r_a$s. We can view this as a lattice in the real vector space $A \otimes \mathbb R$. Let $n$ be the rank of this group / the dimension of this vector space.

There is a natural evaluation map $f: A \otimes \mathbb R \to \mathbb R$ from this vector space to $\mathbb R$. Applying the assumed bijection between $[2,3] \cup [0,1] $ and $[0,1]$, which is obtained by at each point by subtracting one of the $r_a$s and hence preserved the property of lying in $A$, we obtain a bijection between $A \cap f^{-1} ( [2,3] \cup [0,1])$ and $ A \cap f^{-1} ([0,1])$.

In the case $n=1$, this is already impossible as soon as the lattice intersects $[2,3]$, which we can guarantee if necessary by adding additional $r_a$s.

Otherwise, this bijection involves moving in the lattice a distance at most $1$. Hence for $B_R$ a ball of radius $R$, we obtain an injection $B_R \cap A \cap f^{-1} ([2,3] \cup [0,1]) \to B_{R+1} \cap A \cap f^{-1} ([0,1])$.

We now simply apply lattice point counting to check that the number of lattice points in these sets are asymptotic to the volumes of $B_R \cap f^{-1} ([2,3] \cup [0,1]) $ and $ B_{R+1} \cap f^{-1} ([0,1])$ respectively, which are asymptotic to $2 C R^{n-1}$ and $C R^{n-1}$ respectively, contradicting the claimed existence of an injection.

The only subtlety in the lattice point counting is whether the images of the lattice points under $f$ are equidistributed. However, by Weyl equidistribution, it suffices that $A$ is a dense subset of $\mathbb R$, which is automatic as $n>1$.


Here is a more general version of my and YCor's argument:

Let $\Gamma$ be a group acting by measurable, volume-preserving transformations on a space $X$. Suppose that $\Gamma$ is amenable, in the sense that for each finite set $F$ and each $\epsilon>0$, there is a subset $S$ of $\Gamma$ such that $| FS| < (1+ \epsilon) |S|$ (Følner subsets).

Let $I$ and $J$ be two measurable subsets of $X$ such that can each be decomposed into finitely many pieces such that each piece of $I$ is a translate under an element of $\Gamma$ of a corresponding piece of $J$. Then the measure of $I$ equals the measure of $J$.

Proof: Let $F$ be the set of elements of $\Gamma$ that appear in the bijection between $I$ and $J$.

Let $f_I(x)$ be the number of $\gamma \in F S$ such that $\gamma(f) \in I$, and let $f_J(x)$ be the number of $\gamma \in S$ such that $\gamma(f) \in J$. Then $f_J(x) \leq f_I(x)$ because for each $\gamma$ with $\gamma(f) \in J$, we have chosen a $g\in F$ with $g \gamma(f) \in I$, and for distinct $\gamma(f)$, these give distinct elements of $I$ and hence distinct pairs $g \gamma$. (For distinct $\gamma$ that give the same $\gamma(f)$, we have the same $g$, and so $g \gamma$ remains distinct.)

So $\int f_J \leq \int f_I$. But exchanging the order of summation, $\int f_I = |FS| \mu(I)$ and $\int f_J = |S| \mu(J)$. Because so $(1+\epsilon) \mu(I) \leq \mu(J)$. Taking $\epsilon$ to $0$, $\mu(I) \leq \mu(J)$.

By symmetry, $\mu(I)=\mu(J)$.

$\endgroup$
5
  • $\begingroup$ One can simplify the lattice point counting a little by averaging over translates of $A$, which is allowed as soon as we are averaging measurable functions like the counts of lattice points in some ball, and not potentially non-measurable functions. $\endgroup$
    – Will Sawin
    Commented Apr 19, 2018 at 14:35
  • $\begingroup$ Neat! This should work for translations in any dimension, and should probably work for any solvable group of volume preserving symmetries, yes? $\endgroup$ Commented Apr 19, 2018 at 14:37
  • $\begingroup$ @DavidESpeyer That's right. The only subtlety in the general situation is dealing with the "contained in an interval" step, which doesn't play so nicely with the abstract Følner subset property. I don't think passing to a circle works in general for this, as the circle may not be preserved by the solvable group action, but a simple averaging trick seems to work. I've added it to the answer. $\endgroup$
    – Will Sawin
    Commented Apr 19, 2018 at 15:29
  • $\begingroup$ Beware that "for any $F$ there exists a sequence..." and "for every $F$ and every $\varepsilon>0$ there exists..." are a priori not equivalent in ZF (without dependent countable choice). But the existence of a sequence is not really needed. Independently, I chose the $\ell^1$ version, because it's more flexible (it can be pushed forward freely), while Følner sequence cannot be pushed forward under taking quotients (as I did from $\mathbf{Z}^n$ to $\Gamma$). $\endgroup$
    – YCor
    Commented Apr 19, 2018 at 15:47
  • $\begingroup$ @YCor Good point with regards to avoiding the assumption of a sequence. The flexibility of the $\ell^1$ notion is also a good point, although I don't think it's necessary here - I have removed the assumption on fixed points of $\Gamma$, and I don't think my adjusted argument can be simplified using the more general functions. $\endgroup$
    – Will Sawin
    Commented Apr 19, 2018 at 16:25
12
$\begingroup$

No choice is needed.

First, assuming such a paradoxical decomposition, we get another one in a large circle $C=\mathbf{R}/k\mathbf{Z}$. Now we have, on the subgroup $\Gamma$ generated by the $r_i$ (and by $x\mapsto x+1$), an explicit sequence of Følner subsets, and corresponding normalized $\ell^1$-functions $f_m$.

Start from any Dirac measure on $C$, average it by $f_m$ to have a sequence of (finitely supported) measures $\mu_m$. Then $\mu_m$ is approximately invariant, in the sense that for every $g\in\ell^\infty(C)$ and $s\in\Gamma$, we have $\mu_m(g-sg)\to 0$. Indeed, $$\mu_m(g-sg)=(\mu_m-s\mu_m)g,$$ which tends to 0.

Split $C$ into $k$ intervals $C_1,\dots,C_k$ of length 1 (say, half-open). Then $\mu_m(C_i)-\mu_m(C_j)\to 0$. In particular, we do not have $\mu_m(C_1)\to 0$, since this would force $\mu_m(C_i)\to 0$ for each fixed $i$ and would entail the contradiction $1=\mu_m(C)=\sum_i\mu_m(C_i)\to 0$.

The proof is finished, since the paradoxical decomposition yields a decomposition of the form $\sum_{i=1}^nu_i-r_iu_i=1_{[2,3]}$, and applying $\mu_m$, the left-hand term tends to 0 and not the second one.

$\endgroup$
1
  • $\begingroup$ (I saw Will's answer while I was writing this one. The argument are not essentially different, I think, although with different point of view.) $\endgroup$
    – YCor
    Commented Apr 19, 2018 at 14:46

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .