Freiling's axiom of symmetry explained

Freiling's axiom of symmetry (

tt{AX}

) is a set-theoretic axiom proposed by Chris Freiling. It is based on intuition of Stuart Davidsonbut the mathematics behind it goes back to Wacław Sierpiński.

Let

A\subseteql{P}([0,1])[0,1]

denote the set of all functions from

[0,1]

to countable subsets of

[0,1]

. (In other words,

A=[[0,1]]\leq\omega

.) The axiom

tt{AX}

states:

For every

f\inA

, there exist

x,y\in[0,1]

such that

x\not\inf(y)

and

y\not\inf(x)

.

A theorem of Sierpiński says that under the assumptions of ZFC set theory,

tt{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 byKurt 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.

Freiling's argument

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:

The axiom

tt{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).

Relation to the (Generalised) Continuum Hypothesis

Fix

\kappa

an infinite cardinal (e.g.

\aleph0

). Let

tt{AX}\kappa.

be the statement: there is no map

f:l{P}(\kappa)\tol{P}(l{P}(\kappa))

from sets to sets of size

\leq\kappa

for which

(\forall{x,y\inl{P}(\kappa)})

either

x\inf(y)

or

y\inf(x)

.

Claim:

tt{ZFC}\vdash2\kappa=\kappa+\leftrightarrow\negtt{AX}\kappa.

.

Proof:Part I (

):

Suppose

2\kappa=\kappa+

. Then there exists a bijection

\sigma:\kappa+\tol{P}(\kappa)

. Setting

f:l{P}(\kappa)\tol{P}(l{P}(\kappa))

defined via

\sigma(\alpha)\mapsto\{\sigma(\beta):\beta\preceq\alpha\}

, it is easy to see that this demonstrates the failure of Freiling's axiom.

Part II (

\Leftarrow

):

Suppose that Freiling's axiom fails. Then fix some

f

to verify this fact. Define an order relation on

l{P}(\kappa)

by

A\leqfB

iff

A\inf(B)

. This relation is total and every point has

\leq\kappa

many predecessors. Define now a strictly increasing chain

(A\alpha

\inl{P}(\kappa))
\alpha<\kappa+
as follows: at each stage choose

A\alpha\inl{P}(\kappa)\setminuscup\xi<\alphaf(A\xi)

. This process can be carried out since for every ordinal

\alpha<\kappa+

,

cup\xi<\alphaf(A\xi)

is a union of

\leq\kappa

many sets of size

\leq\kappa

; thus is of size

\leq\kappa<2\kappa

and so is a strict subset of

l{P}(\kappa)

. We also have that this sequence is cofinal in the order defined, i.e. every member of

l{P}(\kappa)

is

\leqf

some

A\alpha

. (For otherwise if

B\inl{P}(\kappa)

is not

\leqf

some

A\alpha

, then since the order is total

(\forall{\alpha<\kappa+

})A_\leq_ B\,; implying

B

has

\geq\kappa+>\kappa

many predecessors; a contradiction.) Thus we may well-define a map

g:l{P}(\kappa)\to\kappa+

by

B\mapsto\operatorname{min}\{\alpha<\kappa+:B\inf(A\alpha)\}

.So
l{P}(\kappa)=cup
\alpha<\kappa+

g-1

\{\alpha\}=cup
\alpha<\kappa+

f(A\alpha)

which is union of

\kappa+

many sets each of size

\leq\kappa

. Hence

2\kappa\leq\kappa+\kappa=\kappa+

.

Note that

|[0,1]|=|l{P}(\aleph0)|

so we can easily rearrange things to obtain that

\negtt{CH}\Leftrightarrow

the above-mentioned form of Freiling's axiom.

The above can be made more precise:

tt{ZF}\vdash(tt{AC}l{P(\kappa)}+\negtt{AX}\kappa)\leftrightarrowtt{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.

Objections to Freiling's argument

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).

Connection to graph theory

Using the fact that in ZFC, we have

2\kappa=\kappa+\Leftrightarrow\negtt{AX}\kappa

(see above), it is not hard to see that the failure of the axiom of symmetry — and thus the success of

2\kappa=\kappa+

 — is equivalent to the following combinatorial principle for graphs:

l{P}(\kappa)

can be so directed, that every node leads to at most

\kappa

-many nodes.

In the case of

\kappa=\aleph0

, this translates to:

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