Axiom of determinacy

In mathematics, the axiom of determinacy (abbreviated as AD) is a possible axiom for set theory introduced by Jan Mycielski and Hugo Steinhaus in 1962. It refers to certain two-person topological games of length ω. AD states that every game of a certain type is determined; that is, one of the two players has a winning strategy.

Steinhaus and Mycielski's motivation for AD was its interesting consequences, and suggested that AD could be true in the smallest natural model L(R) of a set theory, which accepts only a weak form of the axiom of choice (AC) but contains all real and all ordinal numbers. Some consequences of AD followed from theorems proved earlier by Stefan Banach and Stanisław Mazur, and Morton Davis. Mycielski and Stanisław Świerczkowski contributed another one: AD implies that all sets of real numbers are Lebesgue measurable. Later Donald A. Martin and others proved more important consequences, especially in descriptive set theory. In 1988, John R. Steel and W. Hugh Woodin concluded a long line of research. Assuming the existence of some uncountable cardinal numbers analogous to $\alef_0$, they proved the original conjecture of Mycielski and Steinhaus that AD is true in L(R).

Types of game that are determined

The axiom of determinacy refers to games of the following specific form:
Consider a subset ''A'' of the Baire space ''ω^ω'' of all infinite sequences of natural numbers. Two players, I and II, alternately pick natural numbers
:''n''₀, ''n''₁, ''n''₂, ''n''₃, ...
After infinitely many moves, a sequence $(n_i)_$ is generated. Player I wins the game if and only if the sequence generated is an element of ''A''. The axiom of determinacy is the statement that all such games are determined.

Not all games require the axiom of determinacy to prove them determined. If the set ''A'' is clopen, the game is essentially a finite game, and is therefore determined. Similarly, if ''A'' is a closed set, then the game is determined. It was shown in 1975 by Donald A. Martin that games whose winning set is a Borel set are determined. It follows from the existence of sufficiently large cardinals that all games with winning set a projective set are determined (see Projective determinacy), and that AD holds in L(R).

The axiom of determinacy implies that for every subspace ''X'' of the real numbers, the Banach–Mazur game ''BM''(''X'') is determined (and therefore that every set of reals has the property of Baire).

Incompatibility of the axiom of determinacy with the axiom of choice

Under assumption of the axiom of choice, we create a counterexample to the axiom of determinacy. The set S1 of all first player strategies in an ω-game ''G'' has the same cardinality as the continuum. The same is true for the set S2 of all second player strategies. Let ''SG'' be the set of all possible sequences in ''G'', and A be the subset of sequences of ''SG'' that make the first player win. With the axiom of choice we can well order the continuum, and we can do so in such a way that any proper initial portion has lower cardinality than the continuum. We use the obtained well ordered set J to index both S1 and S2, and construct A such that it will be a counterexample.

We start with empty sets A and B. Let α $\in$ J be the index of the strategies in S1 and S2. We need to consider all strategies S1 = of the first player and all strategies S2 = of the second player to make sure that for every strategy there is a strategy of the other player that wins against it. For every strategy of the player considered we will generate a sequence that gives the other player a win. Let t be the time whose axis has length ℵ₀ and which is used during each game sequence. We create the counterexample A by transfinite recursion on α:

# Consider the strategy s1(α) of the first player.
#Apply this strategy on an ω-game, generating (together with the first player's strategy s1(α)) a sequence , which does not belong to A. This is possible, because the number of choices for has the same cardinality as the continuum, which is larger than the cardinality of the proper initial portion of J.
#Add this sequence to B (if it is not already in B), to indicate that s1(α) loses (on ).
#Consider the strategy s2(α) of the second player.
#Apply this strategy on an ω-game, generating (together with the second player's strategy s2(α)) a sequence , which does not belong to B. This is possible, because the number of choices for has the same cardinality as the continuum, which is larger than the cardinality of the proper initial portion of J.
#Add this sequence to A (if it is not already in A), to indicate that s2(α) loses (on ).
#Process all possible strategies of S1 and S2 with transfinite induction on α. For all sequences that are not in A or B after that, decide arbitrarily whether they belong to A or to B. So B is the complement of A.

Once this has been done, prepare for an ω-game ''G''. If you give me a strategy s1 of the first player, then there is an α $\in$ J such that s1 = s1(α), and we constructed A such that s1(α) fails (on certain choices of the second player). Hence s1 fails. Similarly, any other strategy of either player fails. Hence the axiom of determinacy and the axiom of choice are incompatible.

Infinitary logic and the axiom of determinacy

Many different versions of infinitary logic were proposed in the late 20th century. One reason that has been given for believing in the axiom of determinacy is that it can be written as follows (in a version of infinite logic):

$\forall G \subseteq Seq(S):$

$\forall a \in S: \exists a' \in S: \forall b \in S: \exists b' \in S: \forall c \in S: \exists c' \in S ... : (a,a',b,b',c,c'...) \in G$ OR

$\exists a \in S: \forall a' \in S: \exists b \in S: \forall b' \in S: \exists c \in S: \forall c' \in S ... :(a,a',b,b',c,c'...) \notin G$

Note: Seq(''S'') is the set of all $\omega$-sequences of ''S''. The sentences here are infinitely long with a countably infinite list of quantifiers where the ellipses appear.

Large cardinals and the axiom of determinacy

The consistency of the axiom of determinacy is closely related to the question of the consistency of large cardinal axioms. By a theorem of Woodin, the consistency of Zermelo–Fraenkel set theory without choice (ZF) together with the axiom of determinacy is equivalent to the consistency of Zermelo–Fraenkel set theory with choice (ZFC) together with the existence of infinitely many Woodin cardinals. Since Woodin cardinals are strongly inaccessible, if AD is consistent, then so are an infinity of inaccessible cardinals.

Moreover, if to the hypothesis of an infinite set of Woodin cardinals is added the existence of a measurable cardinal larger than all of them, a very strong theory of Lebesgue measurable sets of reals emerges, as it is then provable that the axiom of determinacy is true in L(R), and therefore that ''every'' set of real numbers in L(R) is determined.

See also

* Axiom of real determinacy (AD_R)
* Borel determinacy theorem
* Martin measure
* Topological game

References

*
*
*
*
*
*
*

Further reading

* Philipp Rohde, ''On Extensions of the Axiom of Determinacy'', Thesis, Department of Mathematics, University of Bonn, Germany, 2001
* Telgársky, R.J.br>''Topological Games: On the 50th Anniversary of the Banach-Mazur Game''
Rocky Mountain J. Math. 17 (1987), pp. 227–276. (3.19 MB)

"Large Cardinals and Determinacy"
at the Stanford Encyclopedia of Philosophy

{{Set theory

Axioms of set theory
Determinacy
Large cardinals