Amateur Topologist

Politics, programming, math, and science.

Vitali Sets: Sets Without Length

We’re all vaguely familiar with the notion of length when it comes to intervals; the interval [1,2] (meaning the set of all numbers between 1 and 2 inclusive) has length 1, as does the interval (1,2) (the set of all numbers between 1 and 2, exclusive). Even though the latter excludes its endpoints, the points have length zero. So the question is, how do we measure more complicated sets? For example, what is the ‘length’ of the set of all rational numbers between 0 and 1? The intuitive way is this: suppose we have a set S that we want to find the length of. Now, let T be a (countable) of intervals such that S is completely contained in the union of all the elements of T; mathematically speaking, we want
Misplaced alignment tab character &.
leading text: $S\subseteq\bigcup_k T_k&
Since S is contained in T, we obviously should have that the length of S is the length of T, which is itself less than or equal to the sum of the lengths of its constituent intervals:
Misplaced alignment tab character &.
leading text: $\lambda(S) \leq \sum_k \lambda(T_k)&
(where \lambda(S) signifies the length of S.
The fact that T is countable is significant; if we allowed T to be uncountable, then we could define T as T_x=\{x\}, T=\bigcup_x T_x for every x\in S and then every set would have length zero! Not exactly useful.
Obviously any S will have many such Ts; so we can simply define \lambda(S) to be the sum of the lengths of the smallest possible T that covers S; or, if there is no smallest T, the largest l such that for all l’ > l, there is a T that covers S such that \lambda(T) = l’. Again, written out, this becomes
Misplaced alignment tab character &.
leading text: $\lambda(S) = \inf \{ \lambda(T) \}&

This is what is known technically as the Lebesgue measure of a set, after Henri Lebesgue, the 19th century mathematician. This definition gives each set a Lebesgue measure and seems to behave normally under transformations such as translation; it’s not easy to construct a set that acts oddly under Lebesgue measure. But it is doable, and it was first found by a mathematician named Giuseppe Vitali. Let V be the set of irrational numbers in [0,1], restricted so that if x, y \in V, then x-y \notin \mathbb{Q}. Oh, and we also have to include 0 in V. In other words, V is a subset of [0,1] such that no two members differ by a rational number. Then V does not have a well-defined Lebesgue measure, and is called a Vitali set. To show this, first we order the rational numbers in the interval [-1,1], q_1, q_2, q_3, \ldots. We can do this since the rational numbers are all countable. Then, we define
Misplaced alignment tab character &.
leading text: $V_k=V+q_k=\{v+q_k|v\in V\}&
Each V_k is disjoint from each other one, since if v was in V_i and V_j, then we would have v_1+q_i=v_2+q_j, for some v_1, v_2 \in V or v_1-v-2=q_j-q_i, an impossibility by the definition of V. Let V’ = \bigcup_k V_k. Obviously, V’ \subseteq [-1,2], but we also have [0,1] \subseteq V’ To show this, pick some x \in [0,1]. If x \in V, then we’re done, else it was excluded since there is some v\in V such that x-v\in\mathbb{Q}. So we have
Misplaced alignment tab character &.
leading text: $[0,1]\subseteq V' \subseteq [-1,2]&

.
Now, consider what this implies for \lambda(V). We know that
\lambda(V’) = \sum _k \lambda(V_k). But since each V_k is just \lambda V moved around on the real line, we have \lambda(V’) = \sum_k \lambda(V), which will either be infinity or zero depending on whether V has zero measure or not. But by the above relation, we have
&
which directly contradicts what we derived about \lambda(V’). So therefore, \lambda(V) is not well-defined.

This naturally raises the question of how one can determine what sets can be assigned a measure. And here I have to turn to Wikipedia; according to them, what I’ve been calling the measure is actually the outer measure, and the actual measure, which I’ll call \mu, is defined by
\mu(S)=\lambda(S) whenever Misplaced alignment tab character &.
leading text: ...a(A)=\lambda(A \bigcap S) + \lambda(A - S)&

for all sets A
If this condition is not satisfied, then S doesn’t have a measure. To see that V fails this test, consider A=[0,1]. Then obviously \lambda(A)=1. Your homework for today is to prove that \lambda(A \bigcap S) + \lambda(A-S) \not= 1. It’s not enough to show that those two sets are uncountable; there exist uncountable sets of measure 0, such as the Cantor set.

One point that I glossed over in the construction of V is that you have to somehow pick which irrational numbers you’re leaving out and which you’re leaving in. This requires what is known as the axiom of choice; the axiom of choice is independent of standard set theory, and mathematicians are divided on whether they work in set theory with or without the axiom of choice (though the majority do work with it). But that’s a topic for another time.

Leave a Reply