What Is the Banach-Tarski Paradox? Can You Double a Sphere?

Cut a solid ball into a handful of pieces, move them around with no stretching, and get two solid balls, each the same size as the one you started with. It sounds impossible. It isn't. Here's the actual mechanism, one intuition at a time.

By Petrus Sheya

July 20, 2026 · 8 min read

Take a solid ball. Cut it into a handful of pieces. Move those pieces around, only rotating and sliding them, never stretching. Put them back together.

You now have two solid balls. Each one is exactly the same size as the ball you started with.

That's not a trick with mirrors or a rounding error. It's a real theorem, proven in 1924 by Stefan Banach and Alfred Tarski. You can double a solid ball using nothing but rotations, translations, and five pieces.

Here's the thing: it's not really about spheres. It's about what happens to "size" when you're allowed infinitely many, infinitely scattered points to work with. Let's build up to it.


Wait, doesn't this break math?

Your first reaction is probably: that can't be right. Volume is conserved. Cut a cake into five pieces and reassemble it, and you still have one cake, not two.

You're right, for cake. Cake is made of a finite number of crumbs, and every piece you cut has a well-defined volume that adds up. But the pieces in Banach-Tarski aren't cake crumbs. They're not solid chunks at all.

They're infinitely tangled clouds of points, so scattered and jagged that they don't have a volume to begin with. You can't measure them, so there's nothing for the "volume must be conserved" rule to apply to. That's the loophole. And to see why it exists, we need to spend a minute with infinity.


Warm-up: the hotel that's never full enough to turn a guest away

Imagine a hotel with infinitely many rooms, numbered 1, 2, 3, and so on forever. Every single room is occupied. A guest walks in and asks for a room.

Normally you'd say no vacancy. But here's what the manager does instead: she asks every guest to move from room nn to room 2n2n.

Guest 1 moves to room 2. Guest 2 moves to room 4. Guest 3 moves to room 6. Every guest still has a room; nobody got kicked out. But now every odd-numbered room is empty, and there are infinitely many of them. The new guest checks into room 1. So could seven more. So could infinitely many more.

Slide in new guests — every room stays full before and after, yet nobody gets evicted.

HOTEL STATUS: FULLGuest 1: room 1 → room 2Guest 2: room 2 → room 4Guest 3: room 3 → room 6Guest 4: room 4 → room 8Guest 5: room 5 → room 10Guest 6: room 6 → room 12Guest 7: room 7 → room 14Guest 8: room 8 → room 16Guest 9: room 9 → room 18Guest 10: room 10 → room 20Guest 11: room 11 → room 22Guest 12: room 12 → room 24New guest 1: seated in room 1New guest 2: seated in room 3New guest 3: seated in room 5
Guests already staying12
New guests seated3
Guests evicted0

Nothing was added, nothing was destroyed. Slide the guests over, and empty rooms just... appear. This is Hilbert's Hotel, and the lesson is the one we'll need for everything that follows: for infinite collections, "full" and "has room for more" aren't opposites. Banach-Tarski is this same trick, done to a sphere instead of a hallway.


The trick that makes it work: a group that duplicates itself

Now for the real engine. Forget spheres for a second and think about words.

Take two letters, aa and bb, plus their "undo" moves, a1a^{-1} and b1b^{-1}. Build every possible word by stringing these letters together, with one rule: never let a letter sit next to its own undo. So aabaab is fine, abb1abb^{-1} is not, because bb1bb^{-1} cancels to nothing.

This collection of words is called the free group on two generators, and it has a strange self-similar shape. Every word (except the empty one) starts with exactly one of aa, a1a^{-1}, bb, b1b^{-1}. Group all the words by their starting letter, and you get four buckets, plus the empty word, that together contain everything.

Every word branches into 3 new words, never 4 — because undoing the last step is never allowed. That single rule is what lets one branch regrow into a full copy of the whole tree.

e

F = S(a) ∪ S(a⁻¹) ∪ S(b) ∪ S(b⁻¹) ∪ {e}

Words drawn53
Branching factor3

Watch what happens when you switch to "Copy 1." Take just the words starting with aa, plus just the words starting with a1a^{-1}. Now apply aa to every word in that second bucket. Every word like a1xa^{-1}x becomes xx, so that whole bucket transforms into "everything that doesn't start with aa", meaning identity, and everything starting with a1a^{-1}, bb, or b1b^{-1}. Combine that with the original aa-bucket you kept untouched, and:

S(a)aS(a1)=FS(a) \cup a \cdot S(a^{-1}) = F

Two of the four buckets, one of them rotated, rebuild the entire group. And the other two buckets, S(b)S(b) and S(b1)S(b^{-1}), do the exact same thing with a rotation by bb. One set of words just produced two full copies of itself, out of pieces it already had. That's the paradox, in its purest form, no geometry required yet.


But a sphere isn't a group... or is it?

Here's the bridge. Take two rotations of a sphere, one around one axis, one around another, chosen so they never accidentally cancel out (this is provable, and holds for almost any two axes you'd pick). These two rotations, and their inverses, behave exactly like aa, a1a^{-1}, bb, b1b^{-1}: combining them the same way always produces a genuinely different rotation. No shortcuts, no coincidences.

Now pick a point on the sphere's surface. Apply every possible combination of those rotations to it, and you get an entire orbit, a countable, infinitely scattered set of points. Sort every point in every orbit by which rotation-word produced it, using the same four buckets from before, and you've just split the sphere's surface into four paradoxical pieces, the same way we split the group of words.

Rotate two of those pieces the way we rotated the word-buckets, and they rebuild the whole sphere. Rotate the other two, and they build a second, independent copy of the whole sphere. Two spheres, out of the material of one, no stretching involved.


Patching the leftover points

There's one loose end. A few points on the sphere sit exactly on a rotation axis, so rotating around that axis doesn't move them anywhere, it fixes them in place. Those fixed points don't fit neatly into any orbit, and there are only countably many of them, but they still need a home.

This is exactly the Hilbert's Hotel trick again, just dressed differently. Instead of doubling room numbers, we rotate a countable, infinitely long orbit of points by a fixed angle.

Rotate every point in this orbit forward by the same angle. One spot empties out, one new spot appears — the orbit absorbs a whole extra point for free.

p0 at angle 0.00 radp1 at angle 1.00 radp2 at angle 2.00 radp3 at angle 3.00 radp4 at angle 4.00 radp5 at angle 5.00 radp6 at angle 6.00 radp7 at angle 7.00 radp8 at angle 8.00 radp9 at angle 9.00 radp10 at angle 10.00 radp11 at angle 11.00 radp12 at angle 12.00 radp13 at angle 13.00 radp14 at angle 14.00 radp15 at angle 15.00 radp16 — gained after rotation
θ (rotation)1 rad
Original point p0occupied
Points in orbit1616

Rotate the whole orbit forward by that angle, and every point slides into the next point's old spot, except the very first one, whose spot empties out, and a brand new spot appears at the far end. The rotation absorbs exactly one extra point, for free, the same way the hotel absorbed one extra guest. Do this for the countable set of awkward fixed points, and they slot neatly into the construction. No leftovers.


From a hollow sphere to a solid ball

Everything so far duplicates the surface of the sphere, a hollow shell. But we started this whole thing wanting to double a solid ball.

The fix is almost anticlimactic: draw a straight line from the center of the ball to every point on the shell. Duplicating the shell drags an entire solid radius line along with it, and stacking up all those duplicated lines fills in a full, solid ball. The only snag is the center point itself, which every rotation leaves fixed, but that's a single point, and it slots into the construction the same way the leftover fixed points did.


Putting it all together: one ball becomes two

Here's the full picture. Split the solid ball into five pieces: four that rotate and reshuffle like the word-buckets, and one that handles the center point and the countable exceptional set. Move the pieces, purely with rotations and slides, no stretching, no shrinking.

These dots stand in for infinitely many scattered points, not solid chunks — watch them regroup from one ball into two, each the same radius as the original.

ORIGINAL BALLCOPY 1COPY 2
Original ball100%
Two new balls0%
Radius, each ballidentical

Two of the pieces regroup into a full ball. The other pieces regroup into a second full ball, the exact same radius as the one you began with. The dots in that animation aren't solid chunks, they're a stand-in for infinitely scattered dust. That distinction matters more than it looks like it should, and it's exactly why this doesn't work on your kitchen table.


Why this doesn't work with an actual orange

If you tried this with a real orange, you'd fail immediately, and not because you're bad with a knife. Every piece you could ever actually cut, with a knife, a laser, anything physical, has a well-defined volume. Cut an orange into five pieces and the volumes add up to the orange's original volume, always. There's no way around it.

The five pieces in Banach-Tarski don't have a well-defined volume at all. They're what mathematicians call non-measurable sets, infinitely intricate scatterings of points so pathological that the very concept of "volume" refuses to apply to them. You can't draw them, you can't approximate them, and you can't construct them by any step-by-step recipe.

In fact, you need the Axiom of Choice just to prove they exist, a foundational assumption in set theory that guarantees you can always make infinitely many simultaneous, unspecified selections, one from each of infinitely many buckets, even when there's no rule for how to pick. Banach-Tarski isn't a construction you could ever carry out. It's a proof that such a decomposition exists, using tools that are, quite deliberately, not constructive.

That's the resolution. Volume conservation isn't violated. It just never applied to these pieces in the first place, because "volume" was never defined for them to begin with.


The short version

Banach-Tarski works because infinite, non-measurable sets don't play by the rules that finite, measurable objects do. Hilbert's Hotel shows infinite collections can absorb extras without anyone noticing. The free group on two generators shows that a self-similar infinite structure can be split into pieces that each regrow into a full copy of the whole thing. Map that structure onto a sphere with two independent rotations, patch a countable set of leftover fixed points using the same absorb-for-free rotation trick, and extend from a hollow shell to a solid ball with straight radial lines.

The result: one solid ball, cut into five pieces nobody could ever actually cut, reassembles into two solid balls identical to the original. It's not a loophole in geometry. It's a reminder that "size" is a much more fragile idea than it feels like, the moment infinity gets involved.


All visualizations are interactive React components running entirely in your browser, animated with requestAnimationFrame. No libraries beyond React.