NOTES FOR 197, SPRING 2018

Transcription

1 NOTES FOR 197, SPRING 2018 We work in ZFDC, Zermelo-Frankel Theory with Dependent Choices, whose axioms are Zermelo s I - VII, the Replacement Axiom VIII and the axiom DC of dependent choices; when we need AC, we will list it among the hypotheses. 1. Ordinal numbers. Def. 1. A set α is an ordinal number if it is transitive, pure, grounded and connected, i.e., x = y x y y x (x, y α). #1. The class ON of all ordinals is transitive, α β ON = α ON. Def. 2. On each ordinal α we define the binary relation x α y df [x = y x y] #2. The relation α is a wellordering of α. When we say ordinal we will mean either the set α or the well ordered set (α, α ). #3. For each ordinal α and x α, seg α (x) = x. #4. Every well ordered set U = (Field(U), U ) is similar to a unique ordinal, ord(u) = the unique α ON)[U = o α]. Def. 3. For any two ordinals α, β, we put α β df (α, α ) o (β, β ) #5. For any two α, β ON, there is an order-preserving bijection of α with an initial segment of β. α β ( π : α β)[x y α = π(x) π(y)]. Notes for Math 197, 2018 Spring, Y. N. Moschovakis, May 2, 2018, 9:53.

2 2 NOTES FOR 197, SPRING 2018 #6 (Lemma in NST). For any two ordinals α, β, α β α = β α β α β α β; moreover, α < β α β. #7. The class ON is well ordered by the condition, i.e., α α, [α β γ] = α γ, [α β γ] = α = γ, α < β α = β β < α, ( α)p(α) = ( α)[p(α) &( β < α)[ P(β)]], where P(α) is any definite condition on ordinals. #8. If E is a (non-empty) set of ordinals, then sup E = the least β ( α E)[α β] = E, min E = E. #9. The class ON is not a set. #10. 0 = is the least ordinal; S(α) = α {α} is the successor of α, the least ordinal > α; and if λ is not 0 and not the successor of any α, than λ is a limit ordinal and λ = sup{α α < λ}. The least limit ordinal is called ω. #11 (Proof by ordinal induction). If P(α) is a definite condition on ordinals and for all α ON then P(α) is true for all α ON. ( β α)p(β) = P(α), #12 (Definition by ordinal recursion). For every definite operation H(w, α), there is exactly one definite operation F : ON ON such that F(α) = H(F α, α), where F α is the restriction of F to α, F (α) = {(ξ, F(ξ)) ξ α}. Similarly with a parameter: For every definite operation H(w, α, x), there is exactly one definite operation F(α, x) such that F(α, x) = H({(ξ, F(ξ, x) ξ < α}, α, x)). Notes for 197, Spring 2018, May 2, 2018, 9:53 2

3 NOTES FOR 197, SPRING Def. 4 (Addition of ordinals). By ordinal recursion with parameters, α + 0 = α, α + S(β) = S(α + β), α + λ = sup{α + β β < λ} (Limit(λ)). #13 (Ord addition is associative). For all α, β, γ ON, α + (β + γ) = (α + β) + γ. #14. There are ordinals α, β, such that α + β β + α. #15. Problem x12.7 in NST. #16. Problem x12.8 in NST. #17. Problem x12.9 in NST. Def. 5 (Multiplication of ordinals). By ordinal recursion with parameters, α 0 = 0, α S(β) = (α β) + α, α λ = sup{α β β < λ} (Limit(λ)). #18 (Ord multiplication is associative). For all α, β, γ ON, α (β γ) = (α β) γ. #19. There are ordinals α, β such that α β β α. #20. Problem x12.10 in NST. #21. Problem x12.11 in NST. #22 (Right distributive law). For all α, β, γ ON, α (β + γ) = α β + α γ. #23 (Failure of left distributivity). Give an example where (α + β) γ α γ + α γ. The first few ordinals are 0, 1,..., ω, ω + 1, ω + 2,...ω2, ω2 + 1,..., ω3..., ω4...,... ω 2, ω 2 + 1,...ω 3,... Ω 1 = the least uncountable ordinal, Ω 1 + 1,..... Notes for 197, Spring 2018, May 2, 2018, 9:53 3

4 4 NOTES FOR 197, SPRING Cardinal numbers. Def. 6. The cardinal number of a well-orderable set: #24. For any well-orderable set A, A = (µξ ON)[A = c ξ]. A = ord(a, ), where is any best wellordering of A. #25. For any well-orderable sets A, B, A = c A ; A = c B A = B. Def. 7. The class of cardinal numbers: Card(κ) ( A)[κ = A ]. #26. A set is a cardinal number if and only if it is an initial ordinal, Card(κ) α ON &( α κ)[α < c κ]. #27. The class Card is not a set. #28 (AC). Every set A is well-orderable, and so A is defined. Def. 8 (AC). Cardinal arithmetic: κ + λ = κ λ, κ λ = κ λ, κ λ = (λ κ), i I κ i = {(i, x) I i I κ i x κ i }, i I κ i = i I κ i, (disregarding the double use of the same notation in the last def.) #29 (AC). Cardinal addition and multiplication are associative and commutative; formulate and prove these laws for both the finite and infinite sums and products. #30 (The absorption laws, AC). (κ, λ 0&max(κ, λ) infinite) = κ + λ = κ λ = max(κ, λ). Def. 9 (The alephs). By ordinal recursion, we set ℵ 0 = N = ω = the least infinite cardinal, α β+1 = ℵ + β = the least cardinal > ℵ β, ℵ λ = sup{ℵ β β < λ} (Limit(λ)). Notes for 197, Spring 2018, May 2, 2018, 9:53 4

5 #31. Every ℵ α is a cardinal number. #32 (AC). Card = ω {ℵ α α ON}. NOTES FOR 197, SPRING (AC). The Continuum Hypothesis and the Generalized Continuum Hypothesis take the form 3. Universes. 2 ℵ 0 = ℵ 1 ; 2 ℵ α = ℵ α+1. Def. 10 (The cumulative hierarchy of pure, grounded sets). The partial von Neumann universes are defined by the ordinal recursion V 0 =, V α+1 = P(V α ), V λ = α<λ V α (Limit(λ). We also define the class V = α ON V α. #33. α < β = V α V β. #34. V ω comprises all the pure, grounded, hereditarily finite sets. #35. The class V = α ON V α comprises exactly all sets which are pure and grounded. #36. V satisfies all the axioms of ZFDC, and also the axioms of Purity and Foundation; and if we assume the Axiom of Choice, then it also satisfies AC. This means that if by set we understand set in V, then all the axioms of ZFDC are true; and if we also assume AC, then we can prove that V satisfies AC, the proposition For every set A V, there is a function ε : P(A) \ { } A such that ε V and ( x A)[x = ε(x) x]. Def. 11 (Zermelo universes, in NST). A transitive class M is s Zermelo universe if it satisfies Zermelo s Axioms I VI and DC and it contains Zermelo s set of natural numbers, N 0 = {, { }, {{ }},... }. Def. 12 (the least Zermelo universe); this is Z = n N Z n, Notes for 197, Spring 2018, May 2, 2018, 9:53 5

6 6 NOTES FOR 197, SPRING 2018 where Z 0 = N 0, Z n+1 = P(Z n ). #37. If λ is a limit ordinal, λ > ω, then V λ is a Zermelo universe. #38. V ω / Z. This proposition has many consequences about the strength of the Zermelo axioms, for example: #39. We cannot prove using only the Zermelo axioms I VII that there is a set whose members are exactly all the pure, hereditarily finite sets. (And making this precise is part of the problem.) 4. The Cantor-Bendixson Theorem. At this point we assume you have read the basic definitions about N and its topology, through 10.5 of Chapter 10. #40. Proposition 10.6 in the book. This is a list of the basic properties (1) (5) of the topology of Baire space N, and their presentation will be probably split among two or three students. (Try to think of how to prove each part before reading the proofs; you may end up with a better argument or presentation than what the book has.) #41. TFAE for a set F N: (a) F is closed. (b) There is a tree T on N such that F = [T] = the body of T. (c) There is a tree T on N such that F = [T] and T has no finite branches. #42. Every perfect, non-empty pointset P N has cardinality c = 2 ℵ 0. This is in NST; you may well think up a better solution than the one given there. Def. 13. Let A N be a pointset. A point x N is a limit point of A if every nbhd of x contains some point in A other than x, i.e., for every nbhd N u, x N u = there is some y x in (A N u ) A point x N is a condensation point of A if for every nbhd N u, x N u = (A N u ) is uncountable. Notice that every condensation point of A is a limit point of A. #43. If x is a limit point of some A N, then for every nbhd N u, x N u = (A N u ) is infinite. #44. A pointset F N is closed if and only if it contains all its limit points. Notes for 197, Spring 2018, May 2, 2018, 9:53 6

7 Def. 14. For any closed set F N, put NOTES FOR 197, SPRING kernel(f) = {x N x is a condensation point of F }. Notice that kernel(f) F. #45. Give an example where kernel(f) = F and another where F but kernel(f) =. #46. Suppose T is a pruned tree on N (no finite branches) with body [T] = F and let then kt = {u T [T u ] is uncountable}; kt is a tree and [kt] = kernel(f). #47 (existence of a Cantor-Bendixson decomposition). If F N is closed, then there exists a perfect set P and a countable set S such that F = P S, P S =. #48 (uniqueness of the Cantor-Bendixson decomposition). If F N is closed, P is perfect, S is countable and then P = kernel(f). F = P S, P S =, 5. Property P. A family Γ of pointsets has property P if every uncountable A Γ has a perfect subset. For example, the family F = {F N F is closed} has property P by the Cantor-Bendixson Theorem. #49. F = c N. #50 (AC). F can be indexed on c = 2 ℵ 0, so F = {F α α < c}. #51 (AC). There is a set A N such that A = c but A has no uncountable closed subset. #52 (AC). The family P(N) of all subsets of N does not have property P. Notes for 197, Spring 2018, May 2, 2018, 9:53 7

8 8 NOTES FOR 197, SPRING Another proof of the Cantor-Bendixson Theorem. The proof of #51 involves definition by transfinite (or ordinal) recursion, which can also be used to prove the Cantor-Bendixson Theorem as follows. Def. 15. A point x is an isolated point of a pointset A if x A but x is not a limit point of A. Def. 16. We define the derivative F of any closed pointset F by F = {x F x is a limit point of F } = F \ {x F x is isolated}. #53. For every closed F, F F and F is closed. #54. A closed set F is perfect if and only if F = F. Def. 17. For a given closed pointset F and every ordinal number ξ, we define F ξ by recursion as follows: F 0 = F, F ξ+1 = (F ξ ), (Limit(λ) F λ = ξ<λ F ξ. #55. Each F ξ is closed and η ξ = F η F ξ. #56 (Cantor-Bendixson existence). For each closed pointset F, there is an ordinal µ such that F µ+1 = F µ and µ is countable. It follows that (1) The set P = F µ is perfect (perhaps empty). (2) The set S = (F \ P) is countable. (3) F = P S. #57. Theorem in the book, the characterization of continuous functions f : N N in terms of functions on strings. #58. For each of the following functions on N, find a monotone string function τ : N N such that f 1 (x) = 0, 2, 7 x. f 2 (x) = tail(tail(tail(x))). f(x) = sup{τ(u) u x}. #59. Suppose f(x), g(x) are continuous functions on Baire space and let h(x) be their interweaving, h(x) = (f(x)(0), g(x)(0), f(x)(1), g(x)(1), ). Define a string representation of h(x) using given string representations of g(x) and h(x). (The idea is to explain neatly how to compute τ h (u) Notes for 197, Spring 2018, May 2, 2018, 9:53 8

9 NOTES FOR 197, SPRING using τ f and τ g ; don t look for a formula, it s really a program that is needed.) #60 (Problem in the book). Prove that the following are equivalent for a set K N: (1) K = [T] for a finitely branching tree T N. (2) For every family O of nbhds, if K O, then there is a finite subset N u1,..., N uk of O such that K N u1 N uk. The next two problems are the two parts of Theorem in the book; so solving them means to read and understand he proofs well enough so you can present them in class. #61. (1) of Theorem 10.19, that the continuous image of a compact set is compact. (You can do this using either of the two characterizations of compact sets in the preceding problem.) #62. (2) of Theorem 10.19, that the continuous, injective image of a compact and perfect pointset if compact and perfect. Def. 18. A pointset A N is analytic if it is empty or the continuous image of N. Again the next two problems together give us the Perfect Set Theorem 10.20, the second main goal of this class. #63. The Lemma in the proof of Theorem 10.20, that the tree defined by (10-18) is splitting. #64. Every uncountable analytic set has a perfect subset, assuming the Lemma. The remaining problems establish the basic closure properties of the family of analytic pointsets. #65 (Lemma of NST). Every closed pointset is analytic. #66 (Lemma of NST). The continuous image of an analytic pointset is analytic. #67 (Lemma of NST). If f, g : N N are continuous, ten the pointset is analytic. E = {x N f(x) = g(x)} #68. Countable unions of analytic sets are analytic. #69. Every open pointset is analytic. #70. Countable intersections of analytic sets are analytic. Notes for 197, Spring 2018, May 2, 2018, 9:53 9