Banach–Tarski paradox
The Banach–Tarski paradox is a theorem that a solid ball can be partitioned into finitely many pieces and reassembled into two identical balls, using nonmeasurable sets and the axiom of choice.
The Banach–Tarski paradox is a theorem that a solid ball can be partitioned into finitely many pieces and reassembled into two identical balls, using nonmeasurable sets and the axiom of choice.