Models of $AD$ different from $L(\mathbb{R})$ - MathOverflow

Models of $AD$ different from $L(\mathbb{R})$

2011-11-20T21:22:14Z

Today it is known that $AD$ (the axiom of determinacy of games played with integers) is true in $L(\mathbb{R})$. Has it been proven that this is the only model in which $AD$ is true? Have other models been identified in which $AD$ is true? Of course, I am asking about genuine models, since we can force over $L(\mathbb{R})$ and still keep enough $AD$. A related question is the following: how different from $L(\mathbb{R})$ is the universe $V$? Thx.

Answer by Andreas Blass for Models of $AD$ different from $L(\mathbb{R})$

2011-11-20T21:35:38Z

I'm not sure what you mean by "genuine models", but let me comment on how different $L(\mathbb R)$ is from $V$. They look very different to me. Partly this is because the axiom of choice holds in $V$ and fails rather spectacularly in $L(\mathbb R)$ . For example, AD implies that $\aleph_n$ is singular whenever $3\leq n\leq\omega$, so the cardinal structure of $L(\mathbb R)$ looks very different from that of $V$. Even where they agree, for example at $\aleph_1$ (which is the same in $L(\mathbb R)$ as in $V$), there's a big difference as to what subsets are present. AD implies that the club filter on $\aleph_1$ is an ultrafilter, so all of $V$'s stationary co-stationary subsets of $\aleph_1$ are missing from $L(\mathbb R)$ .

A more philosophical (by which I mean imprecise and not mathematical) reason to think $L(\mathbb R)$ differs greatly from $V$ is that it seems entirely implausible to me that the whole universe should be constructible from any single set. I expect to see more and more complexity the higher up I go in the cumulative hierarchy --- and not just complexity of ordinals.

Answer by Trevor Wilson for Models of $AD$ different from $L(\mathbb{R})$

2011-12-02T07:18:33Z

To answer the first question, like Andres mentioned, larger models $L(\Gamma,\mathbb{R})$ of AD can behave quite differently from $L(\mathbb{R})$. For example they can satisfy AD$_{\mathbb{R}}$, the axiom of determinacy for Gale-Stewart games played on $\mathbb{R}$, which fails in $L(\mathbb{R})$. (This is because it implies the Axiom of Uniformization, i.e., that every binary relation on $\mathbb{R}$ contains a function with the same domain, whereas in a model such as $L(\mathbb{R})$ where every set is ordinal-definable from a real, the set of pairs $(x,y)$ such that $y$ is not ordinal-definable from $x$ cannot be uniformized.)

To add to Andreas's answer to the second question, there is a $\Sigma_1$ statement in the parameter $\mathbb{R}$ that is true under ZFC but false under AD, namely the existence of an injection $\omega_1 \to \mathbb{R}$. (This is easily seen to be inconsistent with a countably complete nonprincipal ultrafilter on $\omega_1$.)