Given a subset of a regular uncountable cardinal , (read: “the uniformization property holds for ”) asserts that for every sequence satisfying for all :
- is a 2-valued function;
- is a cofinal subset of of minimal order-type,
there exists a function such that for every limit , the set is bounded in . Idea: we think of as a coloring “uniformizing” the sequence of local colorings .
In a previous post, we proved that entails . The same proof shows that entails . In this post, we shall focus on for . More specifically, we shall provide a proof to Shelah’s ZFC theorem that fails.
We commence with a simple observation.
Observation. Suppose that holds for a given stationary subset . Then
(a) CH holds, and
(b) for every sequence satisfying for all :
- is an -valued function;
- is a cofinal subset of of order-type ,
there exists a function such that for every , the set is bounded in .
Proof. Suppose that we are given a sequence of local colorings with each being a cofinal subset of of order-type . Since holds, we get that for every , there exists a function such that for every , the set is bounded in . Define by stipulating that . Then, for every , we have , and hence the set is bounded in .
Since , the above establishes (b).
Now, to see that (a) holds, assume towards a contradiction that CH fails. In particular, , and the sequence of constant functions must have a uniformization, . As is stationary, let us pick some such that . Then , contradicting the assumption that is a uniformizing function for .
Main Theorem (Shelah). fails.
Proof. Suppose not. Then by the above observation, CH holds. In particular, . Denote . For every , pick an increasing and continuous function whose range is cofinal in . It then follows from the previous observation that for every sequence , there exists a function together with a function such that for every we have whenever .
Fix a large enough regular cardinal , and put , where is some well-ordering of . For every , , and , let denote the Skolem hull of in .
Let denote the collapsing function from to a transitive model . Put:
By CH and a result from a previous post, we may fix a function with the property that entails the existence of an order-preserving isomorphism which is the identity on .
Next, we define a sequence by recursion, as follows.
- let ;
- let ;
- let be such that for all :
- let and be such that whenever .
Define , by stipulating that .
Subclaim. There exists and for which the following set is non-empty:
Proof. Fix , such that is stationary. Then, by CH, the set has size , and hence we can find in such that . Clearly, .
Let , and then . Put . Since and are continuous, is a successor ordinal. Denote . Then , and hence .
For all , by definition of , we have and hence .
So , and , are elementary submodels of .
Subclaim. There exists an isomorphism such that is the identity function, , and for all : is an isomorphism from to .
Proof. By and , we have for every , and hence
So is an isomorphism that satisfies:
As well-ordering is a rigid relation, the last property implies that is unique (though, we could have used the relation for that). In particular, , and then the fact that implies that is the identity function.
Let . Then is an isomorphism from to , and is the identity function.
Let , and .
Evidently, and . Note that , because otherwise, , in which case, for the least such that , there would have existed a countable set which is cofinal in . Recalling that is the identity function, we would have then get that , and then would have been an element of (note that and ), contradicting the fact that .
So and are distinct elements of . Since , we get that and . Consequently, and .
Denote . As and are countable isomorphic models, we have , and .
Since and is the identity function, we get for all that . So, continuity now tells us that . In particular, . By the minimality condition in the definitions of , we then infer that and . Altogether, we got that , and hence . On the other hand, , and hence . This is a contradiction.
