Freiling's axiom of symmetry (${\displaystyle {\texttt {AX}}}$) is a set-theoretic axiom proposed by Chris Freiling. It is based on intuition of Stuart Davidson but the mathematics behind it goes back to Wacław Sierpiński.

Let ${\displaystyle A\subseteq {\mathcal {P}}([0,1])^{[0,1]}}$ denote the set of all functions from ${\displaystyle [0,1]}$ to countable subsets of ${\displaystyle [0,1]}$. (In other words, ${\displaystyle A={\big [}[0,1]{\big ]}^{\leq \omega }}$.) The axiom ${\displaystyle {\texttt {AX}}}$ states:

For every ${\displaystyle f\in A}$, there exist ${\displaystyle x,y\in [0,1]}$ such that ${\displaystyle x\not \in f(y)}$ and ${\displaystyle y\not \in f(x)}$.

A theorem of Sierpiński says that under the assumptions of ZFC set theory, ${\displaystyle {\texttt {AX}}}$ is equivalent to the negation of the continuum hypothesis (CH). Sierpiński's theorem answered a question of Hugo Steinhaus and was proved long before the independence of CH had been established by Kurt Gödel and Paul Cohen.

Freiling claims that probabilistic intuition strongly supports this proposition while others disagree. There are several versions of the axiom, some of which are discussed below.

Fix a function f in A. We will consider a thought experiment that involves throwing two darts at the unit interval. We are not able to physically determine with infinite accuracy the actual values of the numbers x and y that are hit. Likewise, the question of whether "y is in f(x)" cannot actually be physically computed. Nevertheless, if f really is a function, then this question is a meaningful one and will have a definite "yes" or "no" answer.

Now wait until after the first dart, x, is thrown and then assess the chances that the second dart y will be in f(x). Since x is now fixed, f(x) is a fixed countable set and has Lebesgue measure zero. Therefore, this event, with x fixed, has probability zero. Freiling now makes two generalizations:

• Since we can predict with virtual certainty that "y is not in f(x)" after the first dart is thrown, and since this prediction is valid no matter what the first dart does, we should be able to make this prediction before the first dart is thrown. This is not to say that we still have a measurable event, rather it is an intuition about the nature of being predictable.
• Since "y is not in f(x)" is predictably true, by the symmetry of the order in which the darts were thrown (hence the name "axiom of symmetry") we should also be able to predict with virtual certainty that "x is not in f(y)".

The axiom ${\displaystyle {\texttt {AX}}}$ is now justified based on the principle that what will predictably happen every time this experiment is performed, should at the very least be possible. Hence there should exist two real numbers x, y such that x is not in f(y) and y is not in f(x).

Fix ${\displaystyle \kappa \,}$ an infinite cardinal (e.g. ${\displaystyle \aleph _{0}\,}$). Let ${\displaystyle {\texttt {AX}}_{\kappa }.\,}$ be the statement: there is no map ${\displaystyle f:{\mathcal {P}}(\kappa )\to {\mathcal {P}}({\mathcal {P}}(\kappa ))\,}$ from sets to sets of size ${\displaystyle \leq \kappa }$ for which ${\displaystyle (\forall {x,y\in {\mathcal {P}}(\kappa )})\,}$ either ${\displaystyle x\in f(y)\,}$ or ${\displaystyle y\in f(x)\,}$.

Claim: ${\displaystyle {\texttt {ZFC}}\vdash 2^{\kappa }=\kappa ^{+}\leftrightarrow \neg {\texttt {AX}}_{\kappa }\,}$.

Proof: Part I (${\displaystyle \Rightarrow \,}$):

Suppose ${\displaystyle 2^{\kappa }=\kappa ^{+}\,}$. Then there exists a bijection ${\displaystyle \sigma :\kappa ^{+}\to {\mathcal {P}}(\kappa )\,}$. Setting ${\displaystyle f:{\mathcal {P}}(\kappa )\to {\mathcal {P}}({\mathcal {P}}(\kappa ))\,}$ defined via ${\displaystyle \sigma (\alpha )\mapsto \{\sigma (\beta ):\beta \preceq \alpha \}\,}$, it is easy to see that this demonstrates the failure of Freiling's axiom.

Part II (${\displaystyle \Leftarrow \,}$):

Suppose that Freiling's axiom fails. Then fix some ${\displaystyle f\,}$ to verify this fact. Define an order relation on ${\displaystyle {\mathcal {P}}(\kappa )\,}$ by ${\displaystyle A\leq _{f}B}$ iff ${\displaystyle A\in f(B)}$. This relation is total and every point has ${\displaystyle \leq \kappa }$ many predecessors. Define now a strictly increasing chain ${\displaystyle (A_{\alpha }\in {\mathcal {P}}(\kappa ))_{\alpha <\kappa ^{+}}}$ as follows: at each stage choose ${\displaystyle A_{\alpha }\in {\mathcal {P}}(\kappa )\setminus \bigcup _{\xi <\alpha }f(A_{\xi })}$. This process can be carried out since for every ordinal ${\displaystyle \alpha <\kappa ^{+}\,}$, ${\displaystyle \bigcup _{\xi <\alpha }f(A_{\xi })\,}$ is a union of ${\displaystyle \leq \kappa \,}$ many sets of size ${\displaystyle \leq \kappa \,}$; thus is of size ${\displaystyle \leq \kappa <2^{\kappa }\,}$ and so is a strict subset of ${\displaystyle {\mathcal {P}}(\kappa )\,}$. We also have that this sequence is cofinal in the order defined, i.e. every member of ${\displaystyle {\mathcal {P}}(\kappa )\,}$ is ${\displaystyle \leq _{f}\,}$ some ${\displaystyle A_{\alpha }\,}$. (For otherwise if ${\displaystyle B\in {\mathcal {P}}(\kappa )\,}$ is not ${\displaystyle \leq _{f}\,}$ some ${\displaystyle A_{\alpha }}$, then since the order is total ${\displaystyle (\forall {\alpha <\kappa ^{+}})A_{\alpha }\leq _{f}B\,}$; implying ${\displaystyle B\,}$ has ${\displaystyle \geq \kappa ^{+}>\kappa \,}$ many predecessors; a contradiction.) Thus we may well-define a map ${\displaystyle g:{\mathcal {P}}(\kappa )\to \kappa ^{+}\,}$ by ${\displaystyle B\mapsto \operatorname {min} \{\alpha <\kappa ^{+}:B\in f(A_{\alpha })\}}$.

So ${\displaystyle {\mathcal {P}}(\kappa )=\bigcup _{\alpha <\kappa ^{+}}g^{-1}\{\alpha \}=\bigcup _{\alpha <\kappa ^{+}}f(A_{\alpha })\,}$ which is union of ${\displaystyle \kappa ^{+}\,}$ many sets each of size ${\displaystyle \leq \kappa \,}$. Hence ${\displaystyle 2^{\kappa }\leq \kappa ^{+}\cdot \kappa =\kappa ^{+}\,}$.

${\displaystyle \blacksquare }$ (Claim)

Note that ${\displaystyle |[0,1]|=|{\mathcal {P}}(\aleph _{0})|\,}$ so we can easily rearrange things to obtain that ${\displaystyle \neg {\texttt {CH}}\Leftrightarrow \,}$ the above-mentioned form of Freiling's axiom.

The above can be made more precise: ${\displaystyle {\texttt {ZF}}\vdash ({\texttt {AC}}_{{\mathcal {P}}(\kappa )}+\neg {\texttt {AX}}_{\kappa })\leftrightarrow {\texttt {CH}}_{\kappa }\,}$. This shows (together with the fact that the continuum hypothesis is independent of choice) a precise way in which the (generalised) continuum hypothesis is an extension of the axiom of choice.

Freiling's argument is not widely accepted because of the following two problems with it (which Freiling was well aware of and discussed in his paper).

• The naive probabilistic intuition used by Freiling tacitly assumes that there is a well-behaved way to associate a probability to any subset of the reals. But the mathematical formalization of the notion of probability uses the notion of measure, yet the axiom of choice implies the existence of non-measurable subsets, even of the unit interval. Some examples of this are the Banach–Tarski paradox and the existence of Vitali sets.
• A minor variation of his argument gives a contradiction with the axiom of choice whether or not one accepts the continuum hypothesis, if one replaces countable additivity of probability by additivity for cardinals less than the continuum. (Freiling used a similar argument to claim that Martin's axiom is false.) It is not clear why Freiling's intuition should be any less applicable in this instance, if it applies at all. (Maddy 1988, p. 500) So Freiling's argument seems to be more an argument against the possibility of well ordering the reals than against the continuum hypothesis.

Using the fact that in ZFC, we have ${\displaystyle 2^{\kappa }=\kappa ^{+}\Leftrightarrow \neg {\texttt {AX}}_{\kappa }\,}$ (see above), it is not hard to see that the failure of the axiom of symmetry — and thus the success of ${\displaystyle 2^{\kappa }=\kappa ^{+}\,}$ — is equivalent to the following combinatorial principle for graphs:

• The complete graph on ${\displaystyle {\mathcal {P}}(\kappa )\,}$ can be so directed, that every node leads to at most ${\displaystyle \kappa \,}$-many nodes.

In the case of ${\displaystyle \kappa =\aleph _{0}\,}$, this translates to:

• The complete graph on the unit circle (or any set of the same size as the reals) can be so directed, that every node has a path to at most countably-many nodes.

Thus in the context of ZFC, the failure of a Freiling axiom is equivalent to the existence of a specific kind of choice function.