Banach-Tarski paradox
First stated by Stefan Banach and Alfred Tarski in 1924, the Banach-Tarski paradox is the famous "doubling the ball" paradox, which states that by using the axiom of choice it is possible to take a solid ball in 3-dimensional space, cut it up into finitely many pieces and, moving them using only rotation and translation, reassemble the pieces into two balls of the same radius as the original.Formally: Let A and B be two subsets of Euclidean space. We call them equi-decomposable if they can be represented as finite unions of disjoint subsets and such that, for any i, the subset is isometric to . Then, the paradox can be reformulated as follows:
The ball is equi-decomposable with two copies of itself.
For the ball, five pieces are sufficient to do this; it cannot be done with fewer than five. There is an even stronger version of the paradox:
Any two bounded subsets of 3-dimensional Euclidean space with non-empty interior are equi-decomposable.
In other words, a marble can be cut up into finitely many pieces and reassembled into a planet. Or you could disassemble a telephone and reassemble it to make a water lily. OK, you can't do this with a real marble or a real telephone, which are made up of atoms, but you can do it with their shapes.
It should be noted that, in general, it is well known that an infinite set (such as two spheres) can be transformed bijectively to a similarly infinite subset of itself (such as one sphere). However, such transformations in general are non-isometric or involve an uncountably infinite number of "pieces"—the surprising consequence of the Banach-Tarski paradox is that it can be done with only rotation and translation (isometric mapping) of a finite number of pieces (albeit infinitely convoluted/complicated pieces, which individually are not measurable).
Note that in the decomposition, the pieces won't be measurable, and so they will not have "reasonable" boundaries nor a "volume" in the ordinary sense. It is impossible to carry out such a disassembly physically because disassembly "with a knife" can create only measurable sets. This pure existence statement in mathematics points out that there are many more sets than just the measurable sets familiar to most people.
The paradox also holds in all dimensions starting with three, and it does not hold for subsets of Euclidean plane. (In three dimensions, a planar subset has an empty interior, therefore one can not apply the statement above.) Still, there are some paradoxical decompositions in the plane: a circle can be cut into finitely many pieces and reassembled to form a square of equal area; see Tarski's circle-squaring problem.
The paradox shows that it is impossible to define "volume" on all bounded subsets of Euclidean space such that equi-decomposable sets will have equal "volume". Its proof is based on the earlier work of Felix Hausdorff, who managed to "chop up" the unit interval into countably many pieces which (by translation only) can be reassembled into the interval of length 2. He did this construction in order to show that there can be no non-trivial translation invariant measure on the real line which assigns a size to all sets of real numbers. In fact, it is possible to define "area" for all bounded subsets in Euclidean plane (as well as "length" on real line) such that equi-decomposable sets will have equal "area", but one can only use finite decomposition, so this "area" is not at all a measure. In particular, it implies that if two measurable subsets of the plane (or real line) are equi-decomposable then they have equal Lebesgue measure.
Logicians most often use the term "paradox" for a statement in logic which creates problems because it causes contradictions, such as the Liar paradox or Russell's paradox. The Banach-Tarski paradox is not a paradox in this sense but rather a proven theorem; it is a paradox only in the sense of being counter-intuitive. Because its proof prominently uses the axiom of choice, this counter-intuitive conclusion has been presented as an argument against adoption of that axiom.
Essentially, the paradoxical decomposition of the ball is achieved in four steps:
The group G can be "paradoxically decomposed" as follows: let S(a) be the set of all strings that start with a and define S(a−1), S(b) and S(b−1) similarly. Clearly,
In order to find a group of rotations of 3-d space that behaves just like (or "isomorphic to") the group G, we take two orthogonal axes and let A be a rotation of arccos(1/3) about the first and B be a rotation of arccos(1/3) about the second.
(This step cannot be performed in two dimensions.)
It is somewhat messy but not too difficult to show that these two rotations behave just like the elements a and b in our group G. We'll skip it. The new group of rotations generated by A and B will be called H. Of course, we now also have a paradoxical decomposition of H.
Step number 3: The unit sphere S2 is partitioned into "orbits" by the action of our group H: two points belong to the same orbit if and only if there's a rotation in H which moves the first point into the second.
We can use the axiom of choice to pick exactly one point from every orbit; collect these points into a set M. Now (almost) every point in S2 can be reached in exactly one way by applying the proper rotation from H to the proper element from M, and because of this, the paradoxical decomposition of H then yields a paradoxical decomposition of S2.
Finally, connect every point on S2 with a ray to the origin; the paradoxical decomposition of S2 then yields a paradoxical decomposition of the solid unit ball. (The center of the ball needs bit more care, but we omit this part in the sketch)
NB. This sketch glosses over some details.
One has to be careful about the set of points on the sphere which happen to lie on an axis of rotation of some matrix in H. On the one hand, there are countably many such points so they "do not matter," and on the other hand it is possible to patch up even those points. The same applies to the center of the ball. The Banach-Tarski paradox is also a corollary of the Hausdorff paradox.
A sketch of the proof
The free group with two generators a and b consists of all finite strings that can be formed from the four symbols a, a−1, b and b−1 such that no a appears directly next to an a−1 and no b appears directly next to a b−1. Two such strings can be concatenated and converted into a string of this type by repeatedly replacing the "forbidden" substrings with the empty string. For instance: abab-1a-1 concatenated with abab-1a yields abab-1a-1abab−1a, which gets reduced to abaab−1a. One can check that the set of those strings with this operation forms a group with neutral element the empty string, here denoted ε. We will call this group G.
but also
(The notation a S(a−1) means: take all the strings in S(a−1) and concatenate them on the left with a.) Make sure that you understand this last line, because it is at the core of the proof.
Now look at this: we cut our group G into four pieces (forget about ε for now, it doesn't pose a problem), then "rotated" some of them by multiplying with a or b, then "reassembled" two of them to make G and reassembled the other two to make another copy of G. That's exactly what we want to do to the ball. This finishes step 1.Further reading