In set theory, a paradoxical set is a set that has a paradoxical decomposition. A paradoxical decomposition of a set is two families of disjoint subsets, along with appropriate group actions that act on some universe (of which the set in question is a subset), such that each partition can be mapped back onto the entire set using only finitely many distinct functions (or compositions thereof) to accomplish the mapping. A set that admits such a paradoxical decomposition where the actions belong to a group
G
G
G
Paradoxical sets exist as a consequence of the Axiom of Infinity. Admitting infinite classes as sets is sufficient to allow paradoxical sets.
Suppose a group
G
A
A
G
A1,...,An,B1,...,Bm\subseteqA
g1,...,gn,h1,...,hm\inG
A=
n | |
cup | |
i=1 |
gi(Ai)
A=
m | |
cup | |
i=1 |
hi(Bi)
The Free group F on two generators a,b has the decomposition
F=\{e\}\cupX(a)\cupX(a-1)\cupX(b)\cupX(b-1)
X(i)
X(a)\cupaX(a-1)=F=X(b)\cupbX(b-1).
See main article: Banach–Tarski paradox.
The most famous example of paradoxical sets is the Banach–Tarski paradox, which divides the sphere into paradoxical sets for the special orthogonal group. This result depends on the axiom of choice.