2. The ultrapower construction

Transcription

1 2. The ultrapower construction The study of ultrapowers originates in model theory, although it has found applications both in algebra and in analysis. However, it is accurate to say that it is mainly exploited in set theory. Here I present the basic idea, showing its close connection to the study of measurable cardinals, defined last lecture. Suppose first that U is an ultrafilter over a set X. We want to define the ultrapower of the universe V of sets by U. The basic idea is to consider the product of X many copies of the structure (V, ). We want to amalgamate them somehow into a new structure (Ṽ, ). For this, we look for the typical properties of the elements {f(x) : x X} of each thread f : X V, and add an element f to Ṽ whose properties in (Ṽ, ) are precisely these typical properties. We use U to make this precise, by saying that a property ϕ is typical of the range of f iff {x X : ϕ(f(x))} U. This leads us to the following definition, due to Dana Scott, that adapts the ultrapower construction to the context of proper classes: Definition 1 Let U be an ultrafilter over a nonempty set X. We define the ultrapower (V X /U, ˆ ) of V by U as follows: For f, g : X V, say that f = U g iff {x X : f(x) = g(x)} U. This is easily seen to be an equivalence relation. We would like to make the elements of V X /U to be the equivalence classes of this relation. Unfortunately, these are all proper classes except for the trivial case when X is a singleton, so we cannot within the context of our formal theory form the collection of all equivalence classes. Scott s trick solves this problem by replacing the class of f with [f] := {g : X V : g = U f and rk(g) is least possible}. Here, as usual, rk(g) = min{α : g V α+1 } = sup{rk(x) + 1 : x g}. All the classes [f] are now sets, and we set V X /U = {[f] : f : X V }. We define ˆ by saying that for f, g : X V we have [f]ˆ [g] iff {x X : f(x) g(x)} U. (It is easy to see that ˆ is indeed well defined, i.e., if f = U f and g = U g then {x X : f(x) g(x)} U iff {x X : f (x) g (x)} U.) (The ultrapower construction is more general than as just defined; what I have presented is the particular case of interest to us.) The remarkable observation, due to Loś, is that this definition indeed captures the typical properties of each thread in the sense described above: 1

2 Lemma 2 ( Loś) Let ϕ(x 1,..., x n ) be a formula in the language of set theory, and let f 1,..., f n : X V. Then V X /U = ϕ([f 1 ],..., [f n ]) iff {x X : ϕ(f 1 (x),..., f n (x)} U. Proof: We argue by induction in the complexity of ϕ. If ϕ is atomic, the result holds by definition. Assume the result for φ, ψ. Suppose that ϕ φ ψ. Then the result also holds for ϕ, since U is both upwards closed and closed under intersections. Assume the result holds for φ. Suppose that ϕ φ. Then the result also holds for ϕ, since for any Y X, either Y U or else X \ Y U. Finally, assume the result holds for φ(x, x 1,..., x n ) and ϕ x φ(x, x 1,..., x n ). Let f 1,..., f n : X V. Then we have, by definition, that V X /U = ϕ([f 1 ],..., [f n ]) iff there is some g : X V such that V X /U = φ([g], [f 1 ],..., [f n ]). This is equivalent, by assumption, to the statement that there is some g : X V such that {x X : φ(g(x), f 1 (x),..., f n (x))} U. But this last statement is equivalent to {x X : ϕ(f 1 (x),..., f n (x))} U : In one direction, note that {x X : φ(g(x), f(x))} {x X : ϕ( f(x))} for any g. In the other, for each x such that ϕ( f(x)) holds pick a witness ι x. Define a function g : X V by g(x) = ι x if ϕ( f(x)) holds, and g(x) = 0 otherwise. Then {x X : ϕ( f(x))} = {x X : φ(g(x), f(x))}, and we are done. This completes the proof. Corollary 3 V X /U V. In particular, V X /U is a (proper class) model of set theory. We arrive at the first connection between the ultrapower construction and measurable cardinals. By Corollary 3, if U is an ultrafilter over X, then V X /U satisfies the axiom of foundation, and therefore it believes that ˆ is a well-founded relation. However, this may actually be false in V, since a witnessing ˆ -decreasing sequence may fail to be an element of V X /U. Recall that, by Homework problem 10, if a nonprincipal ultrafilter is σ-complete, then there is a measurable cardinal. Theorem 4 Let U be an ultrafilter over a set X, and form the ultrapower (V X /U, ˆ ). Then ˆ is well-founded iff U is σ-complete. 2

3 Proof: Suppose first that U is σ-complete. If there is a ˆ -decreasing sequence ([f n ] : n ω), let A n = {x X : f n+1 (x) f n (x)}. Then A n U for all n and therefore n A n (since it is in fact an element of U. If x is in this intersection, then (f n (x) : n < ω) is an -decreasing sequence of sets, contradiction. (This is just the proof of Lemma 14 in lecture II.6.) Suppose now that U is not σ-complete. Then there is a sequence (X n : n ω) of sets not in U whose union is in U. We may assume that the sets X n are pairwise disjoint and that their union is in fact all of X. Define g n : X V by g n (x) = max(m n, 0), where m is the unique number such that x X m. Then {x X : g n+1 (x) g n (x)} = m>n X m U, since m n X m is a finite union of sets not in U and is therefore not in U. This shows that ([g n ] : n ω) is a ˆ -decreasing sequence of elements of V X /U. Lemma 5 Let U be an ultrafilter over a set X, and let f : X V. Then {[g] : [g]ˆ [f]} is a set. Proof: Let ˆf = {[g] : [g]ˆ [f]}. If {x : f(x) = 0} U, then ˆf =. Otherwise, given [g]ˆ [f] let g : X V be given by g (x) = g(x) if g(x) f(x) and g (x) = 0 otherwise. Then g = U g and if Y = {x : f(x) } then g (x) = 0 outside of Y and the restriction of g to Y is in x Y f(x). Since the map that assigns to g its restriction to Y is injective, it follows that ˆf injects into the set x Y f(x) and is therefore a set. Suppose that U is a σ-complete ultrafilter over a set X (for example, U could be principal). Then (V X /U, ˆ ) is a well-founded structure by Theorem 4. Lemma 5 says that it is also set-like. Under these conditions, we can apply Mostowski s collapsing lemma and replace (V X /U, ˆ ) with an isomorphic, transitive structure M: Lemma 6 (Mostowski) Suppose (A, E) is a (possibly proper class) structure where E A A and the following conditions hold: 1. (A, E) = Extensionality, i.e., for any a, b A, a = b iff c A (cea ceb). 2. E is set-like, i.e., for all a A, â = {b A : bea} is a set. 3. E is well-founded (in V ). Then there is a unique (possibly proper) class M that is transitive (i.e., for all a M, a M), and a unique isomorphism π : (A, E) (M, ). The unique M as in Lemma 6 is the Mostowski (or transitive) collapse of A and the unique π is the Mostowski collapsing function. 3

4 Proof: Notice first that the E-rank of any a A is defined. As usual, a E = sup{ b E : bea}; that E is set-like is used to justify that a E is an ordinal if b E is an ordinal for all bea. Hence, if a E is not defined, then b E is not defined for some bea, and we obtain an E-decreasing sequence, against well-foundedness. This is just as the argument following Definition 15 in lecture II.6. Now define π : A V by π(a) = {π(b) : bea}. This is well-defined since otherwise, one immediately arrives at a contradiction by considering an a of least E-rank for which π(a) is undefined. Let M = π[a]. Notice that for any a, b A, if aeb then π(a) π(b). Also, M is transitive, by definition and, by induction on a E, rk(π(a)) = a E for any a A. It follows that π is injective. Otherwise, π(a) = π(b) for some a b. By extensionality, there is some c such that exactly one of cea and ceb holds. Without loss, say that cea. Then there is some d such that π(c) = π(d) and deb. We thus arrive at a contradiction by considering the least possible rank of an x M with more than one preimage under π. This implies that π is an isomorphism, since if π(a) π(b) then there is some ceb such that π(a) = π(c). But then a = c so aeb. Finally, suppose that M is some transitive class and π is a map such that π : (A, E) (M, ) is an isomorphism. By considering again a possible counterexample of least E-rank, it follows that π (a) = π(a) for all a A. This shows that M and π are unique, and we are done. Hence, if U is σ-complete, there is a transitive structure isomorphic to V X /U. We denote this structure by Ult(V, U). (Sometimes, V X /U is denoted Ult (V, U).) Since Ult(V, U) is transitive and a model of set theory, there is certain resemblance between V and Ult(V, U). In the background, we are using that 1 formulas are absolute between transitive structures that satisfy a modicum of set theory. For example, if x Ult(V, U) and Ult(V, U) = x is a function, then x is indeed a function. Similarly, since each element of V ω is (easily) definable, then V ω Ult(V, U). It would take us too long to give a detailed presentation of absoluteness, and it is a standard part of any introductory course, so I will take it for granted. See for example Chapter IV of Kenneth Kunen, Set Theory: An introduction to independence proofs, North-Holland (1980). Consider now an arbitrary set t. Continuing with the motivation indicated at the beginning of the lecture, it should be clear that if c t : X V denotes the function constantly equal to t, then the typical properties of the elements in the range of c t are just the properties of t, and it is natural to consider the following map: 4

5 Definition 7 Let U be an ultrafilter over a set X and, for each t V, denote by c t : X V the map constantly equal to t. The map is defined by i U (t) = [c t ]. i U : V V X /U i U is an example of a class of maps very important in the study of large cardinals. Definition 8 An elementary embedding j : M N between two structures (in the same language L) is a function j from the universe of M to the universe of N such that for any formula ϕ(x 1,..., x n ) in language L and any a 1,..., a n M, M = ϕ(a 1,..., a n ) iff N = ϕ(j(a 1 ),..., j(a n )). Lemma 9 For any ultrafilter U over a set X, the map i U : V V X /U is an elementary embedding. Proof: This is an immediate corollary of Loś s Lemma 2: Given any formula ϕ( x) and elements a V, we have that ϕ( a) holds iff {x X : ϕ( a)} U since this set is either X if ϕ( a) holds, or otherwise. But {x : ϕ(a 1,..., a n )} = {x : ϕ(c a1 (x),..., c an (x))}, and Loś s lemma concludes the proof. Let U be an ultrafilter over a set X, and let κ be its additivity, i.e., κ is the least cardinal such that U is not closed under intersections of length κ. We can then define, by means of a projection, a nonprincipal ultrafilter W over κ as follows: There is a sequence (X α : α < κ) of sets not in U whose union is in U. We can modify this sequence slightly, if necessary, so they are pairwise disjoint and their union is X; this uses that U is κ-complete. Now set, for A κ, A W iff α A X α U. This is clearly an ultrafilter, and it is nonprincipal since otherwise one of the sets X α would be in U. (This is just like the projection used to define µ from λ in the remark before Theorem 2 from last lecture.) Define k : V κ /W V X /U by setting k([f] W ) = [g f ] U where g f : X V is the function given by g f (x) = f(α) for all x X α and all α κ. Here, I have added subscripts to the classes [ ] to clarify with respect to which ultrafilter they are being formed. It follows from the definition of W that k is well defined. 5

6 It is also immediate from the definition that whenever we have Ult (V, W) = [f 1 ]ˆ [f 2 ], then Ult (V, U) = k([f 1 ])ˆ k([f 2 ]), so k is an embedding. Lemma 10 With notation as above, k is elementary and the diagram commutes, i.e., k i W = i U. Proof: Given any x and A, let c A X denote the constant function with domain A and value x. Then k i W (x) = k(i W (x)) = k([c κ x] W ) = [c X x ] U = i U (x), by definition of k. This proves commutativity. Elementarity is also straightforward: Using notation as above, suppose that Ult (V, U) = x ϕ(x, [g f1 ],..., [g fn ]) for some formula ϕ(x, x 1,..., x n ). Let f : X V be a witness, in the sense that Y f = {a X : α < κ (a X α ϕ(f(a), f 1 (α),..., f n (α)))} U. Pick an a α X α Y f for each α < κ such that X α Y f, and define a function g : X V by g(a) = f(a α ) where α is such that a X α and X α Y f. If a α is not defined, set g(a) = 0. Then g = g h for some h : κ V, and Y g U, where Y g is defined using g exactly as Y f was defined from f. By definition of W, Ult (V, W) = ϕ([h], [f 1 ],..., [f n ]), and the elementarity of k follows from the Tarski-Vaught criterion. Consider again the case where U is σ-complete, so Ult(V, U) is defined. Let j = π i U, so j : V Ult(V, U) is an elementary embedding. Suppose that U is principal, say U = {Y X : x 0 Y } for some fixed x 0 X. Then, for any function f : X V, we have [f] = [c f(x0 )]. Also, by induction on the ˆ -rank of f, we have that π([f]) = f(x 0 ), since π([f]) = {π[g] : gef} = {g(x 0 ) : g(x 0 ) f(x 0 )} = f(x 0 ). But then, with j as above, j(t) = π i U (t) = π([c t ]) = t and we have that j is the identity. 6

7 If, on the other hand, (there is a measurable cardinal and) U is nonprincipal, then j is not the identity. We say that j is non-trivial. Now we can deduce information about V by using that there are two sources of resemblance between V and Ult(V, U): The latter is transitive, and j is an elementary embedding. Note that by elementarity, j(α) is an ordinal for all ordinals α. Hence, j : ORD ORD is order preserving, and it follows that j(α) α for all α. Corollary 11 (Scott) If there is a measurable cardinal, then there is a nontrivial elementary embedding j : V M from V into some transitive class M. Proof: Let κ be measurable and let U be a κ-complete nonprincipal ultrafilter over κ. Let j : V Ult(V, U) be as above. I will show that j is not the identity by arguing that, in fact, j(κ) > κ. For this, notice that in V κ /U we have [c α ]ˆ [id]ˆ [c κ ] for all α < κ, where id is the identity map from κ to itself. This uses that bounded subsets of κ are not in U, a consequence of κ-completeness and U being nonprincipal. Then, in Ult(V, U), α j(α) < π([id]) < j(κ) for all α < κ. Hence, π([id]) κ and j(κ) > κ. The fact that some ordinal is moved is not an artifact of the proof but a general fact about elementary embeddings. Lemma 12 Suppose M is a transitive class and j : V M is elementary. If j = id is the identity map from V to itself, then M = V. If j is non-trivial, then there is an ordinal α such that j(α) α. Note that it is not automatic that the fact that j is the identity implies that M = V. For example, consider a countable elementary substructure of L ω1, and let M be its transitive collapse. By the condensation lemma, M = L α for some countable α and we have L α L ω1. Proof: j(v ) = j( α V α) α j(v α). If j is the identity, then j(v α ) = V α for all α, and M V. Suppose now that j is not the identity, so there is some x such that j(x) x. Pick such a set x of least possible rank. Since y x implies that rk(y) < rk(x), it follows that j(y) = y, so x j(x), and there must be some y j(x) \ x. Assume now that j is the identity on the ordinals. Since rk(t) is an ordinal for all t, it follows that rk(j(x)) = j(rk(x)) = rk(x). Thus rk(y) < rk(x) and y = j(y). Since y j(x) then j(y) j(x) and, by elementarity, y x, contradiction. 7

8 Definition 13 Let j : V M be a non-trivial elementary embedding from V into some transitive class M. (We will simply say that j : V M is a nontrivial elementary embedding, or even, that j : V M is elementary.) The smallest α such that j(α) > α is called the critical point of j, and denoted cp(j) or crit(j). Lemma 14 Let j : V M be elementary. Then κ = cp(j) is a strongly inaccessible cardinal. It follows from the lemma that the existence of elementary embeddings is not provable in ZFC. The argument to follow should probably remind the reader of Theorem 2 from last lecture. Proof: κ is a regular cardinal. Suppose that f : α κ where α < κ. Then, by elementarity, j(f) : j(α) j(κ). But j(α) = α since α < κ, and j(f)(β) = j(f)(j(β)) = j(f(β)) = f(β) for all β < α since both β and f(β) are smaller than κ. This shows that j(f) = f. In particular, sup f[α] = sup j(f)[α], so it is an ordinal fixed by j, and f is not cofinal in κ. κ is uncountable. This is because ω and each natural number are definable, so they are fixed by j. κ is limit. Otherwise, κ = λ + for some λ, but j(κ) = (j(λ) + ) M, the ordinal that, from the point of view of M, is the successor of j(λ). Since M V, (j(λ) + ) M j(λ) +. Since λ < κ, j(λ) = λ, and it follows that j(κ) λ + = κ, contradicting that j(κ) > κ. In fact, κ is strong limit. Suppose otherwise, and let ρ < κ be such that 2 ρ κ. So we can find A P(ρ) and a bijection f : A κ. Note that j(a) P M (j(ρ)) = P M (ρ) P(ρ). Suppose that x j(a). Then x ρ and j(x) ρ and for any β < ρ, β x iff j(β) = β j(x), so x = j(x). It follows that x A and j(a) A. On the other hand, if y A, then y = j(y) j(a), and we have shown that j(a) = A. Also, j(f)(x) = j(f)(j(x)) = j(f(x)) = f(x) for any x A, since f(x) < κ. It follows that j(f) = f, and we have shown that κ = ran(f) is fixed by j, contradiction. This is how things stood up for a while: We have shown that the critical point of any embedding is inaccessible, and that any measurable is inaccessible. Now the key idea of reflection shows up, and we can prove significantly more. Theorem 15 Let j : V M be elementary and let κ = cp(j). Then κ is the κ-th strongly inaccessible cardinal. Proof: κ is strongly inaccessible in V by Lemma 14 and therefore in M since M V. It follows that, for any α < κ, there is in M some inaccessible larger than α and below j(κ), namely, κ. By elementarity, the inaccessibles below κ are unbounded in κ. 8

9 The argument gives much more. For example, κ is inaccessible and limit of inaccessibles, so the same proof shows that κ is limit of inaccessibles that are limit of inaccessibles that are limit of inaccessibles... Even more is true, i.e., we can diagonalize and continue. This requires a new key idea. Theorem 16 (Keisler) If j : V M is elementary, then κ = cp(j) is measurable. Proof: Let U = {X κ : κ j(x)}. Then U is a nonprincipal ultrafilter over κ: 1. If X Y κ and X U then Y U since j(x) j(y ). 2. U is closed under intersections since j(a B) = j(a) j(b). 3. = j( ), so / U. 4. If A κ then j(κ) = j(a) j(κ \ A), so either A or κ \ A is in U. 5. If α < κ, then κ / {α} = j({α}) so U is nonprincipal. In fact, U is κ-closed: Let γ < κ and let f : γ U. Then j( α<γ f(α)) = α<j(γ) j(f)(α). But γ = j(γ) and therefore j(f)(α) = j(f)(j(α) = j(f(α)) for all such α. It follows that κ j( α<γ f(α)). The ultrafilter found by Keisler is particularly nice, since it is normal: Using the same notation as above, suppose that (X α : α < κ) is a sequence of elements of U. Let f : κ U be the map f(α) = X α. Recall that α X α = {β < κ : α < β (β X α )}. Then κ j( α X α ) iff for all α < κ, κ j(f)(α). But j(f)(α) = j(f(α)) = j(x α ), and we are done. Notice that U extends the club filter. This follows either from general arguments about normal filters, or simply by noticing that if C κ is club, then κ j(c) because j(c) κ = C is unbounded in κ and j(c) is closed. (To see that if F is a normal filter on κ, that contains the cobounded sets then it is κ-complete, given γ < κ and a sequence (X α : α < γ) extend it to a κ-sequence by setting X α = κ for all α γ, and notice that α<κ X α = A α<γ X α, where A γ. Since κ \ A F, it follows that α<γ X α F as claimed.) Corollary 17 If κ is measurable, then there is a nonprincipal normal ultrafilter on κ (extending the filter of cobounded sets). 9

10 Recall: Definition 18 A cardinal κ of uncountable cofinality is Mahlo iff the set of inaccessible cardinals below κ is stationary. It follows from the definition that if κ is Mahlo then it is regular: Suppose that X κ is unbounded and X < κ. Let C be the club of limit points of X \ X. Then C contains no inaccessibles, in fact, it contains no regular cardinals, contradiction. It also follows that κ is strong limit, since it is a limit of strong limit (in fact, inaccessible) cardinals. This, κ is the κ-th inaccessible, and an easy diagonal argument shows it is limit of inaccessibles that are limits of inaccessibles, etc. Corollary 19 If κ is measurable then it is the κ-th Mahlo cardinal. Proof: If j : V M is elementary and cp(j) = κ, then κ j(c) for any club C κ. It follows by elementarity that C contains an inaccessible. Hence, κ is Mahlo. By elementarity, C contains a Mahlo, etc. Stronger conclusions can be derived by taking j : V Ult(V, U), where U is normal. This is because of the following observation: Lemma 20 Let U be a nonprincipal κ-complete ultrafilter over the measurable cardinal κ. Then the following are equivalent: 1. U is normal. 2. Whenever X U and f : X κ is regressive, then there is ξ < κ such that {α < κ : f(α) = ξ} U. 3. π([id]) = κ where [ ] denotes (Scott) classes in V κ /U. Proof: From normality of U we get a version of Fodor s lemma just as before, so 1 implies 2. 2 implies 3, since 2 says that if [f]ˆ [id] then [f] = [c ξ ] for some ξ < κ. 3 implies 1, because given any X κ, we have that κ i U (X) iff [id]ˆ [c X ] iff {α < κ : id(α) c X (α)} U iff X U, so U is the ulrafilter derived from the embedding j : V Ult(V, U), which is normal by the remark following Keisler s Theorem 16. I close with a list of structural fact about (well-founded) ultrapower embeddings; I concentrate on the particular case of ultrafilters, although essentially this suffices by Lemma 10: 10

11 Lemma 21 Let U be a κ-complete nonpricipal ultrafilter over the measurable cardinal κ, and let j : V Ult(V, U) be the corresponding ultrapower embedding. To ease notation, write M instead of Ult(V, U). Then: 1. cp(j) = κ. 2. κ M M, V κ+1 M, and (κ + ) M = κ κ+ M M. 4. U / M so V κ+2 M κ (2 κ ) M < j(κ) < (2 κ ) +. This result indicates that there are limits to the embeddings that can be represented by means of ulrapowers. For example, even though there is a great deal of resemblance between V and M = Ult(V, U), M is not closed under κ + -sequences and does not contain V κ+2, and j(κ) is not really a cardinal. Any embedding with these additional properties would necessarily capture stronger large cardinal properties and would produce stronger reflection arguments than those once can do in our setting. (For example, if V κ+2 M for some elementary j : V M with cp(j) = κ, then κ is measurable in M and therefore there is a normal ultrafilter V over κ that concentrates on measurable cardinals, i.e., {α < κ : α is measurable} V.) The modern template for defining large cardinals stipulates the existence of embeddings j : V M with large resemblance between V and M and stronger correctness of j. It is natural to wonder how much resemblance can be asked. Kunen showed, for example, that M = V is impossible. Proof: We already know from Corollary 11 that cp(j) κ. If α = cp(j) < κ, let f : κ V be such that π([f]) = α. Then {β < κ : f(β) < c α (β)} = {β : f(β) < α)} U. By κ-completeness, f = U c β for some β < α, so j(β) = π([f]) = α, and cp(j) β, contradiction. This proves 1. If A V κ, then an easy argument as in the proof of Lemma 14 gives that A = j(a), so V κ = Vκ M. If A V κ, then it follows that A = j(a) V κ and therefore V κ+1 = Vκ+1 M M. Note that any well-ordering of κ is a subset of κ κ and can be identified with a subset of κ. Since V κ+1 M, all these subsets are in M, and M computes κ + correctly. To show that κ M M, suppose more generally that j[x] := {j(a) : a x} M for some x and that y M, where y x, and conclude that y M. This gives the result, since j[κ] = κ. To see the claim, say y = {π([f z ]) : z x} and let h : j[x] y be the map h(j(z)) = π([f z ]). It is easy to see that h is well defined. If h M, then y M 11

12 also, since y = ran(h). To see that h M, we find some F such that h = π([f ]). To do this, note that since j[x] M, there is some f such that π([f]) = j[x], and set F : κ V to be the function such that, for all α < κ, F (α) : f(α) V is the map F (α)(z) = f z (α), whenever this makes sense, and F (α) = otherwise. It is easy to check that, indeed, π([f ]) = h. This proves 2. On the other hand, j[κ + ] / M, which proves 3. To see this, note that if π([f]) < j(κ + ), then f = U f for some f : κ κ +. By regularity of κ +, f is bounded, so there is some α < κ + such that π([f]) < j(α). This shows that j[κ + ] is cofinal in j(κ + ), so cf(j(κ + )) = κ +. But j(κ + ) > j(κ) and j(κ) > κ is a limit cardinal of M, so in fact j(κ) > κ +, since κ + = (κ + ) M. Hence, j(κ + ) > κ +. We are done, since j(κ + ) is regular from the point of view of M, by elementarity. Now we prove 5: First, P(κ) = P M (κ). Since M V, it follows that 2 κ (2 κ ) M. Since j(κ) is, from the point of view of M, a strong limit cardinal larger than κ, we must have (2 κ ) M < j(κ). On the other hand, if π([f]) < j(κ), then f = U f for some f : κ κ, and there are only κ κ = 2 κ many such functions f, so only 2 κ many ordinals below j(κ). Therefore, j(κ) < (2 κ ) +, and 5 follows. This gives us 4: Since κ M M, we have κ κ = ( κ κ) M. If U M, then we could correctly compute, in M, the value of j(κ), which would prove that (2 κ ) M < j(κ) < ((2 κ ) + ) M, contradicting the fact that j(κ) is a cardinal in M. The results in this lecture are all classical, although I don t remember ever seen Lemma 10 (and its preceeding remarks) explicitly stated. It is certainly part of the folklore. A good reference is Akihiro Kanamori, The Higher Infinite, Springer (1994). For the few model theoretic results we need, any standard reference would work, for example, Chen-Chung Chang, H. Jerome Keisler, Model theory, North- Holland (1990). Typeset using LaTeX2WP. 12