An inner model is projectively well-ordered when some projective relation well-orders the real numbers of . The ordinal is the least ordinal that regards as uncountable; equivalently, it is the supremum of the order types of the well-order codes in .
Assume for contradiction that is uncountable in the ambient universe. Use the projective well-order of the reals of to choose, for each , the least -real coding a well-order of type . Standard closure properties of the projective hierarchy make the resulting set projective. It is uncountable because it contains one distinct code for every .
The set has no perfect subset. Indeed, a perfect subset is closed and therefore analytic. The boundedness theorem for well-order codes bounds the ranks of its members below one countable ordinal . Since contains at most one code of each rank, would then be countable, whereas every nonempty perfect set of reals is uncountable.
If every projective set is determined, projective determinacy holds and gives the perfect set property to every projective set. Applying it to the uncountable projective set yields a perfect subset, a contradiction. Therefore
This is projective determinacy collapses the inner-model omega-one.
Suppose ZFC proved that every -Suslin set is determined. The assumed consistency of ZFC and the relative consistency of the Continuum hypothesis would then give a model of
In that model . By Every set of reals is continuum-Suslin, every subset of is therefore -Suslin and hence determined. This is the axiom of determinacy.
But the axiom of choice produces an undetermined set of reals, so ZFC and the axiom of determinacy are incompatible. The displayed theory cannot have a model, contradicting the relative consistency of ZFC plus the continuum hypothesis. Hence ZFC cannot prove that all -Suslin sets are determined.

Articles by others on the same topic (0)

There are currently no matching articles.