Three-dimensional space can be partitioned into unit circles — every point in ℝ³ belongs to exactly one circle, and the circles are disjoint. The classical construction uses a well-ordering of the reals: enumerate all points, and at each step assign the current point to a circle that avoids all previously assigned circles. The well-ordering is essential to the argument — it provides the transfinite recursion that builds the partition.
Well-ordering the reals requires the axiom of choice. Without choice, the reals cannot be linearly ordered in a way that every subset has a least element. The partition construction, built on well-ordering, should therefore require choice as well.
The paper shows it does not. In models of ZF (set theory without the axiom of choice) where the reals cannot be well-ordered, the partition into unit circles can still exist. The specific models include the Cohen model and models satisfying the axiom of dependent choice — weaker than full choice but still ruling out a well-ordering of the reals.
The construction uses a different technique than transfinite recursion along a well-ordering. The partition exists not because points are processed one by one in order, but because the geometric constraints of unit circles in three dimensions are rich enough to force the existence of the partition through other means.
The structural point: the well-ordering was a sufficient construction method, not a necessary existence condition. The partition was attributed to the axiom of choice because the only known proof used choice. But the object itself lives in a weaker universe. The tool that built it was stronger than the object requires. The construction method was hiding the true logical strength of the result.