February 11, 2009
2. Silver’s theorem.
From the results of the previous lectures, we know that any power can be computed from the cofinality and gimel functions (see the Remark at the end of lecture II.2). What we can say about the numbers varies greatly depending on whether is regular or not. If is regular, then As mentioned on lecture II.2, forcing provides us with a great deal of freedom to manipulate the exponential function at least for regular. In fact, the following holds:
Theorem 1. (Easton). If holds, then for any definable function from the class of infinite cardinals to itself such that:
- whenever and
- for all
there is a class forcing that preserves cofinalities and such that in the extension by it holds that for all regular cardinals here, is the function as computed prior to the forcing extension.
For example, it is consistent that for all regular cardinals (as mentioned last lecture, the same result is consistent for all cardinals, as shown by Foreman and Woodin, although their argument is significantly more elaborate that Easton’s). There is almost no limit to the combinations that the theorem allows: We could have whenever is regular and is an even ordinal, and whenever for some odd ordinal Or, if there is a proper class of weakly inaccessible cardinals (regular cardinals such that ) then we could have the third weakly inaccessible strictly larger than for all regular cardinals etc.
Morally, Easton’s theorem says that there is nothing else to say about the gimel function on regular cardinals, and all that is left to be explored is the behavior of for singular In this section we begin this exploration. However, it is perhaps sobering to point out that there are several weaknesses in Easton’s result.
Read the rest of this entry »
3 Comments | 580: Topics in set theory | Tagged: bpfa, club, Menachem Magidor, mm, sch, Silver's theorem, Stevo Todorcevic, Tarski's conjecture | Permalink
Posted by andrescaicedo