What is the computational substance of the axiom of choice?

According to LessWrong, the axiom of choice is a foundational mathematical principle that lets mathematicians construct functions from sets without explicit selection rules. An essay explores this axiom's computational substance through a concrete example: proving rational numbers can have well-defined numerator and denominator functions. The proof works, but it's non-constructive. We know such functions must exist and stay self-consistent, but we cannot determine which specific numerators or denominators the axiom picks. Simpler rules—reducing fractions to lowest terms—would make explicit choices; the axiom of choice works without any rule at all. However, Diaconescu's theorem reveals the cost. It proves that if the axiom of choice holds, there must exist a function capable of solving any mathematical problem, including ones we know are unsolvable, like the halting problem. For mathematicians who prioritize computability, that creates a fundamental tension: mathematical convenience versus computational decidability. You cannot have both.

Listen to this story

Hear this and more stories in a personalized audio briefing.

Open The Chonkerton