Let be an infinite set endowed with a partial ordering. Let such that if and only if and are comparable. Then an infinite homogeneous set for is either a chain or a set of mutually incomparable elements
Let be an infinite set endowed with a total ordering. Let an enumeration of and define as follows: for all , if and only if . Then an infinite homogeneous set provides an increasing or decreasing sequence .
Let be an infinite cardinal. Define and for all , . For all , we shall prove the partition property For we get and in particular . We will denote .
Let and . Define for all the function on by .
First we construct by induction on a sequence of sets of size . is arbitrary and at limit step . If is defined then for all the sets of such that is of size at most . Let of size such that and define . We have .
Now define , which is of size at most . In particular, there exists . We shall define by induction a set . Let be arbitrary. Suppose is defined. . So there is such that . We have so there is such that .
Now for any elements of , we have where is defined by . By construction .
If then and regular. So by there is of size such that is constant on . If and if the result is true for then applying this to also gives an homogeneous of size . Finally, is constant on .
Let be a partition of . For all let be a maximal subset of such that . Suppose that one of the is infinite. Then extract an -sequence in . Then is of order type and .
Otherwise, all the are finite and we can write the element of . Consider the stationary set . Then for all we have . By Fodor’s theorem, there exists a stationary set and such that for all . Similarly, because we can find a stationary set and such that for all , we have . And by induction we get and stationary such that for all we have .
Now let . By maximality of we have . But and the two first sets are included in so that is . is unbounded so we can construct by induction for all . Then is of order type and .
In this exercise, for any infinite set of ordinal and ordinal , denotes the set of all increasing -sequence in . Let be an infinite cardinal. For all , let if and only if is finite. Pick a representative for each equivalence class. Define a function on by if differs from the representative in its class at an even number of places and otherwise. Let of order-type . Define by induction on an increasing sequence of ordinal by . Define an increasing -sequence of elements of by . Let be the representative of . Consider the finite set and pick . Define if and . Then the set is still an increasing -sequence of elements of . We have finite so . Moreover, and . So and is not constant on .
Let be a tree of height such that all levels are finite. For all , let be the successors of . We construct by induction a sequence such that and is infinite.
is infinite and level is finite so we can find so at level such that is infinite. If is constructed, then is infinite and level is finite so we can find at level such that is infinite.
If is a maximal chain containing then is an infinite branch of
Let be a normal -tree. Given , let’s denote the predecessor of at level . Define the application on by and . If are such that then in particular . We show that for all , any two at level such that satisfy . If is a successor ordinal then gives . If is a limit ordinal then only gives for all successor ordinals . Suppose is the least limit ordinal such that . Then for all we have and so the predecessors of and are the same. Because is a normal tree and is limit we have , a contradiction. Hence for all and again, because is normal, we get .
We got a bijection . Let’s show that it is actually an order isomorphism . If then and for all , we have . Hence . Conversely, if then and for all successor ordinal . As above, we get that this is true for all ordinal and in particular .
Finally, is a normal -tree. If then and so the -th level is . Suppose where and let such that . We have Then so .
Let be a normal tree that has an uncountable branch . Each has infinitely many immediate successor and only one in so we can pick immediate successor of . Let two elements of . Then so is impossible. Suppose . We also have . If then and if we get . Both cases are impossible and so are incomparable predecessors of , a contradiction. Finally, are incomparable and so is an uncountable antichain of .
We let and we define for all , If and then there are such that and . We have and so . By construction, and so .
…
Let be an uncountable set of finite sets. Let . We have . So we may assume . For all , we have . As in exercise 9.2, we can find a stationary set and a finie set such that for all we have .
We define by induction on a sequence . If is defined for all then since and . Because is unbounded, we can find taking .
If then by construction and so . Hence is a -system.
Let be an infinite cardinal such that . So if we have . For all we define . If are functions from to then there is such that . We have . So is a family of almost disjoint subsets of .
Let be a family of almost disjoint functions . Each is regressive on so there is a stationary set such that is constant on with value . We get an application by . Because there is of size and such that for all we have . Then for all distinct , we have .
So is an almost disjoint family of stationary sets. Let an enumeration of . We construct by induction on a family of pairwise disjoint stationary sets .
Let and suppose we have constructed the pairwise disjoint stationary sets for all . is closed unbounded so is stationary. Let . By induction hypothesis, there is at most one such that . Let if and if does not belong to any . Then is regressive on and so is constant with value on some stationary set . If then and , contradicting the fact that is stationary. So and is disjoint from all the , as wanted.
For all define if and otherwise. Let be an infinite set. Let and such that and . Then and so is not constant on . Thus .