Theorem (Engelking-Karlowicz, 1965). For cardinals , the following are equivalent:
- ;
- there exists a collection of functions, , such that for every and every function , there exists some with .
Proof. (2)(1) Suppose is a given collection. Then
so there must exists some with for all .
(1)(2) We follow a proof due to Shelah. Put:
Then , and we may fix an enumeration
By , let be a sequence of distinct subsets of .
For all , we now define , by letting for all :
Finally, suppose that a set and a function are given.
For all distinct , pick .
Put . Then, and for all distinct , we have .
It follows that , where . It also follows that we may well-define a function by letting:
Pick such that . Then, .
Corollary (folklore). Assume CH.
Then there exists a function with the property that if , then have the same order-type, and their intersection is an initial segment of and of .
In particular, entails the existence of an order-preserving isomorphism , which is the identity on .
Proof. For all , fix a bijection . By and the Engelking-Karlowicz theorem, we may also fix a sequence of functions such that for every and , there exists some such that .
We now define , as follows.
Given , let be the least ordinal such that the order-preserving isomorphism is extended by , and put:
Next, suppose that , for distinct . It follows that:
- ;
- , for ;
- if , then , and one of the following holds:
, and ;
, and .
So is an initial segment of and of .
Let . Then is an order-preserving isomorphism, and is the identity function, since is simply the collapsing function from to .
Pingback: The uniformization property for | Assaf Rinot
There is a typo in the definition of . It should not be but (where denotes the power set of ).
Right. Thank you very much!
This is a very helpful post. (2) gives, independent of (1), that there is a collection of functions (note the power ) satisfying (2).
One easy (but practical) observation: the proof of (1)
Thank you, Diego!