HOMEWORK WEEK 1 1. Let Δ Be an Ordinal with Uncountable Cofinality

Total Page:16

File Type:pdf, Size:1020Kb

HOMEWORK WEEK 1 1. Let Δ Be an Ordinal with Uncountable Cofinality HOMEWORK WEEK 1 1. Let δ be an ordinal with uncountable cofinality and A ⊆ δ be an unbounded nonstationary subset of δ. Show that there is a function f : A → δ satisfying the following three conditions: (a) f is regressive, that is, f(η) < η for all η ∈ A; (b) f is monotonic, that is, η < η′ =⇒ f(η) ≤ f(η′) whenever η, η′ ∈ A (it is not required that f(η) <f(η′) here !); (c) f is unbounded in δ, that is, rng(f) is an unbounded subset of δ, or equivalently (∀ξ<δ)(∃η ∈ A)(f(η) > ξ). Hint. Recall that you have a club C ⊆ δ such that A ∩ C = ∅. 2. Let µ<κ be cardinals and µ be regular. Let κ Sµ = {ξ<κ | cf(ξ)= µ}. Prove the following: κ (a) If cf(κ) ≤ µ then Sµ is a nonstationary subset of κ. κ (b) If hαξ | ξ < µi is a strictly increasing sequence of elements of Sµ and κ κ α is its supremum then α<κ =⇒ α ∈ Sµ . We briefly say that Sµ is closed under limits of sequences of length µ. (Notice that this terminology involves some sloppiness.) Also: is it necessary to require that the ordinals κ αξ above are in Sµ ? (c) If cf(κ) > µ and S ⊆ κ is unbounded and closed under limits of sequences of length µ then S is stationary in κ. κ (d) If cf(κ) > µ then Sµ is a stationary subset of κ. κ (e) If cf(κ) ≤ µ then Sµ is an unbounded subset of κ. 3. Let κ be a regular cardinal. Prove: κ+ + + (a) Sκ is a stationary subset of κ and no α<κ is its reflection point. κ κ (b) If µ<λ<κ are regular then every α ∈ Sλ ∩ lim(Sµ ) is a reflection point κ of Sµ . 4. Given a function f : δ → δ, an ordinal ξ<δ is a fixpoint of f if and only if f(ξ)= ξ. Assume cf(δ) >ω. 1 (a) If f : δ → δ is a monotonic continuous function then the set of all fixpoints of f is a closed unbounded subset of δ. (b) If S ⊆ δ is stationary and f : S → δ is monotonic and continuous on S then N = {ξ ∈ S | ξ is not a fixpoint of f} is a nonstationary subset of δ. 5. Let κ be regular. Given a sequence hxξ | ξ<κi where xξ ⊆ κ, recall that α ∈ △ xξ ⇐⇒ α ∈ xξ. ξ<κ ξ<α\ Thus, the diagonal intersection △xξ is defined for sequences hxξ | ξ<κi, that is, its value depends on the order in which we list the sets xξ. This implies that there is some ambiguity in the definition of the diagonal intersection. However, this ambiguity is inessential, as the diagonal intersections of two different listings of the same family of sets differ only on “small set of points”: Prove that if ′ hxξ | ξ<κi and hxξ | ξ<κi are two enumerations of the same family of subsets of κ, that is, {xξ | ξ<κ} = {xξ | ξ<κ}, then there are only nonstationarily ′ many α<κ on which the diagonal intersections △xξ and △xξ disagree. In fact, ′ A = {α<κ | α ∈ ( △ xξ) ∩ ( △ xξ)} ξ<κ ξ<κ contains a closed unbounded subset of κ. However, notice that it is not clear that A itself is closed unbounded. Prove that the analogous conclusion holds for diagonal unions ▽ xξ. ξ<κ 6. The previous exercise tells us that the diagonal intersection and union should be considered as operations on the quotient Boolean algebra P(κ)/NSκ. Prove that this is true, that is, the operations {[xξ] | ξ<κ} 7→ [ △ xξ] ξ<κ and {[xξ] | ξ<κ} 7→ [ ▽ xξ] ξ<κ are well-defined operations on P(κ)/NSκ in the sense that they do not depend on the choice of representatives xξ and on the choice of the order in which we list the equivalence classes [xξ]. Also prove that the following is true in the Boolean algebra P(κ)/NSκ, which means that this algebra is κ+-complete: [ △ xξ]= [xξ] and [ △ xξ]= [xξ] ξ<κ ξ<κ^ ξ<κ ξ<κ_ 2 Notice that the conclusions of Exercises 5 and 6 are easy to generalize for any normal uniform ideal ℑ on κ in place of the nonstationary ideal NSκ. 7. Let κ be regular and S be a stationary subset of κ. Prove that all but nonstationarily many elements of S are limit points of S. 8. Let κ be regular. Prove that ther is a stationary set S ⊆ κ such that its complement κ − S is also stationary. Hint. It is not possible to give a definition of such a set explicitly, as it is known that this may false if AC fails. Use the theory from the lecture to give an indirect argument. 9. Let S ⊆ ω1 be stationary and α<ω1 be a countable limit ordinal. Prove that S contains a set of order type α. More generally, prove that the set Cα = {δ ∈ lim(S) | δ = sup(x) for some x ⊆ S with otp(x)= α} contains a club. Hint. First use Exercise 7 to get the result for α = ω. Then proceed by induction on α<ω1. This takes some work. 10. Let κ be regular. Define a binary relation ≺ on P(κ) by A ≺ B ⇐⇒ A ∩ β is stationary for all β ∈ B That is, A ≺ B if and only if every β ∈ B is a reflection point of A. (a) The relation ≺ is transitive. (b) The relation ≺ is well-founded. Hint. For (b), starting from an infinite descending sequence of sets under ≺ construct an infinite descending sequence of ordinals. Clause (a) should give you a clue how to pick these ordinals. 11. Prove that there is a ω-sequence. 12. ′ + ′ Let κ be a cardinal. A sequence hcα | α ∈ lim ∩(κ,κ )i is a κ-sequence if and only if the following are satisfied: ′ (a) Each cα is a closed subset of α. ′ (b) If cf(α) >ω then cα is unbounded in α. ′ ′ ′ (c) (Full coherency) Ifα ¯ ∈ cα then cα¯ = cα ∩ α¯. ′ (d) otp(cα) ≤ κ. 3 ′ Thus, the difference between a κ-sequence and κ-sequence is that in the case ′ of a κ-sequence we strengthen the coherency codition to full coherency, but relax the requirement on unboundedness. ′ Prove that for every cardinal κ, a κ-sequence exists if and only if a κ- sequence exists. Hint. ′ For the direction κ ⇒ κ: Look at sets of the form lim(cα). ′ Formulate the notion of a <λ-sequence and prove statement analogous to the above. + 13. Let κ be regular and hcα | α ∈ lim ∩(κ,κ )i be a κ-sequence. Prove that otp(cα)= κ if and only if cf(α)= κ for all α. 14. Let λ be regular and hcα | α ∈ Sing ∩ λi be a <λ-sequence. Let S ⊆ λ be a set such that S ∩ cα has at most one element. Let the unique ordinal in S ∩ cα if such an ordinal exists γα = 0 otherwise Then let ′ cα = cα − (γα + 1). ′ Prove that hcα | α ∈ Sing ∩ λi is again a <λ-sequence. 15. Combine the ideas from Exercises 12 and 14 to finish the proof of Proposi- tion 1.22 from the lecture. 16. Show that the following are equivalent: (i) There is a κ-sequence. (ii) There is a <κ+ -sequence. Hint. The nontrivial direction is from (ii) to (i). Let hcα | α ∈ Sing ∩ λi be + a <κ+ -sequence. Define a sequence hdα | α ∈ lim ∩(κ,κ )i by recursion on α as follows: Assuming dα¯ was constructed for allα ¯ < α, let δα = otp(cα). We have a unique normal function fα : δα → α enumerating cα. By assumption + δα < α, so dδα is defined. Let dα = fα[dδα ]. Show that hdα | α ∈ lim ∩(κ,κ )i is a κ-sequence. Remark. Notice that the above argument does not use the full length of + the <κ+ -sequence; it only uses the segment hcα | α ∈ lim ∩(κ,κ )i, because for α<κ we only need to know that otp(cα) <κ. So we could start the recursion ′ ′ ′ from the sequence hcα | α ∈ Sing ∩ λi where cα = α if α ≤ κ and cα = cα − κ if α>κ. 17. Let κ be a singular cardinal and hcα | α ∈ Sing∩λi be a κ-sequence. Show ′ ′ that there is a κ-sequence hcα | α ∈ Sing ∩ λi such that otp(cα) <κ for all α. Hint. Use an argument similar to that in the proof in Exercise 16. 4 18. Let κ be a regular cardinal and S ⊆ κ be a stationary set. Prove that the set S′ = {α ∈ S | α is not a reflection point of S} is stationary. (This is the lemma needed for the proof of splitting theorem at inaccessible κ.) Hint. Given a closed unbounded set C ⊆ κ, consider the first ordinal in S ∩ lim(C). 19. ω3 ω3 Prove that there are stationary sets S ⊆ Sω and T ⊆ Sω1 such that every α ∈ T is a non-reflection point of S. Hint. ω3 First, for each α ∈ Sω1 pick a closed unbounded subset cα of α with ω3 otp(cα)= ω1. Next split Sω into ω2 many disjoint stationary sets hAξ | ξ<ω2i. ω3 ∅ Notice that for each α ∈ Sω1 there is some ξ<ω2 such that Aξ ∩ cα = . Use this observation and the pigeonhole principle to obtain S and T . Remark. On the other hand, it is consistent with ZFC that every stationary ω2 ω2 S ⊆ Sω reflects at all but nonstationarily many α ∈ Sω1 .
Recommended publications
  • Even Ordinals and the Kunen Inconsistency∗
    Even ordinals and the Kunen inconsistency∗ Gabriel Goldberg Evans Hall University Drive Berkeley, CA 94720 July 23, 2021 Abstract This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity phenomenon: assuming choiceless large cardinal axioms, the properties of the cumulative hierarchy turn out to alternate between even and odd ranks. The second part of the paper explores the structure of ultrafilters under choiceless large cardinal axioms, exploiting the fact that these axioms imply a weak form of the author's Ultrapower Axiom [1]. The third and final part of the paper examines the consistency strength of choiceless large cardinals, including a proof that assuming DC, the existence of an elementary embedding j : Vλ+3 ! Vλ+3 implies the consistency of ZFC + I0. embedding j : Vλ+3 ! Vλ+3 implies that every subset of Vλ+1 has a sharp. We show that the existence of an elementary embedding from Vλ+2 to Vλ+2 is equiconsistent with the existence of an elementary embedding from L(Vλ+2) to L(Vλ+2) with critical point below λ. We show that assuming DC, the existence of an elementary embedding j : Vλ+3 ! Vλ+3 implies the consistency of ZFC + I0. By a recent result of Schlutzenberg [2], an elementary embedding from Vλ+2 to Vλ+2 does not suffice. 1 Introduction Assuming the Axiom of Choice, the large cardinal hierarchy comes to an abrupt halt in the vicinity of an !-huge cardinal.
    [Show full text]
  • Handout from Today's Lecture
    MA532 Lecture Timothy Kohl Boston University April 23, 2020 Timothy Kohl (Boston University) MA532 Lecture April 23, 2020 1 / 26 Cardinal Arithmetic Recall that one may define addition and multiplication of ordinals α = ot(A, A) β = ot(B, B ) α + β and α · β by constructing order relations on A ∪ B and B × A. For cardinal numbers the foundations are somewhat similar, but also somewhat simpler since one need not refer to orderings. Definition For sets A, B where |A| = α and |B| = β then α + β = |(A × {0}) ∪ (B × {1})|. Timothy Kohl (Boston University) MA532 Lecture April 23, 2020 2 / 26 The curious part of the definition is the two sets A × {0} and B × {1} which can be viewed as subsets of the direct product (A ∪ B) × {0, 1} which basically allows us to add |A| and |B|, in particular since, in the usual formula for the size of the union of two sets |A ∪ B| = |A| + |B| − |A ∩ B| which in this case is bypassed since, by construction, (A × {0}) ∩ (B × {1})= ∅ regardless of the nature of A ∩ B. Timothy Kohl (Boston University) MA532 Lecture April 23, 2020 3 / 26 Definition For sets A, B where |A| = α and |B| = β then α · β = |A × B|. One immediate consequence of these definitions is the following. Proposition If m, n are finite ordinals, then as cardinals one has |m| + |n| = |m + n|, (where the addition on the right is ordinal addition in ω) meaning that ordinal addition and cardinal addition agree. Proof. The simplest proof of this is to define a bijection f : (m × {0}) ∪ (n × {1}) → m + n by f (hr, 0i)= r for r ∈ m and f (hs, 1i)= m + s for s ∈ n.
    [Show full text]
  • Well-Orderings, Ordinals and Well-Founded Relations. an Ancient
    Well-orderings, ordinals and well-founded relations. An ancient principle of arithmetic, that if there is a non-negative integer with some property then there is a least such, is useful in two ways: as a source of proofs, which are then said to be \by induction" and as as a source of definitions, then said to be \by recursion." An early use of induction is in Euclid's proof that every integer > 2 is a product of primes, (where we take \prime" to mean \having no divisors other than itself and 1"): if some number is not, then let n¯ be the least counter-example. If not itself prime, it can be written as a product m1m2 of two strictly smaller numbers each > 2; but then each of those is a product of primes, by the minimality of n¯; putting those two products together expresses n¯ as a product of primes. Contradiction ! An example of definition by recursion: we set 0! = 1; (n + 1)! = n! × (n + 1): A function defined for all non-negative integers is thereby uniquely specified; in detail, we consider an attempt to be a function, defined on a finite initial segment of the non-negative integers, which agrees with the given definition as far as it goes; if some integer is not in the domain of any attempt, there will be a least such; it cannot be 0; if it is n + 1, the recursion equation tells us how to extend an attempt defined at n to one defined at n + 1. So no such failure exists; we check that if f and g are two attempts and both f(n) and g(n) are defined, then f(n) = g(n), by considering the least n where that might fail, and again reaching a contradiction; and so, there being no disagreement between any two attempts, the union of all attempts will be a well-defined function, which is familiar to us as the factorial function.
    [Show full text]
  • The Set of All Countable Ordinals: an Inquiry Into Its Construction, Properties, and a Proof Concerning Hereditary Subcompactness
    W&M ScholarWorks Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2009 The Set of All Countable Ordinals: An Inquiry into Its Construction, Properties, and a Proof Concerning Hereditary Subcompactness Jacob Hill College of William and Mary Follow this and additional works at: https://scholarworks.wm.edu/honorstheses Part of the Mathematics Commons Recommended Citation Hill, Jacob, "The Set of All Countable Ordinals: An Inquiry into Its Construction, Properties, and a Proof Concerning Hereditary Subcompactness" (2009). Undergraduate Honors Theses. Paper 255. https://scholarworks.wm.edu/honorstheses/255 This Honors Thesis is brought to you for free and open access by the Theses, Dissertations, & Master Projects at W&M ScholarWorks. It has been accepted for inclusion in Undergraduate Honors Theses by an authorized administrator of W&M ScholarWorks. For more information, please contact [email protected]. The Set of All Countable Ordinals: An Inquiry into Its Construction, Properties, and a Proof Concerning Hereditary Subcompactness A thesis submitted in partial fulfillment of the requirement for the degree of Bachelor of Science with Honors in Mathematics from the College of William and Mary in Virginia, by Jacob Hill Accepted for ____________________________ (Honors, High Honors, or Highest Honors) _______________________________________ Director, Professor David Lutzer _________________________________________ Professor Vladimir Bolotnikov _________________________________________ Professor George Rublein _________________________________________
    [Show full text]
  • A Translation Of" Die Normalfunktionen Und Das Problem
    1 Normal Functions and the Problem of the Distinguished Sequences of Ordinal Numbers A Translation of “Die Normalfunktionen und das Problem der ausgezeichneten Folgen von Ordnungszahlen” by Heinz Bachmann Vierteljahrsschrift der Naturforschenden Gesellschaft in Zurich (www.ngzh.ch) 1950(2), 115–147, MR 0036806 www.ngzh.ch/archiv/1950 95/95 2/95 14.pdf Translator’s note: Translated by Martin Dowd, with the assistance of Google translate, translate.google.com. Permission to post this translation has been granted by the editors of the journal. A typographical error in the original has been corrected, § 1 Introduction 1. In this essay we always move within the theory of Cantor’s ordinal numbers. We use the following notation: 1) Subtraction of ordinal numbers: If x and y are ordinals with y ≤ x, let x − y be the ordinal one gets by subtracting y from the front of x, so that y +(x − y)= x . 2) Multiplication of ordinals: For any ordinal numbers x and y the product x · y equals x added to itself y times. 3) The numbering of the number classes: The natural numbers including zero form the first number class, the countably infinite order types the second number class, etc.; for k ≥ 2 Ωk−2 is the initial ordinal of the kth number class. We also use the usual designations arXiv:1903.04609v1 [math.LO] 8 Mar 2019 ω0 = ω ω1 = Ω 4) The operation of the limit formation: Given a set of ordinal numbers, the smallest ordinal number x, for which y ≤ x for all ordinal numbers y of this set, is the limit of this set of ordinals.
    [Show full text]
  • Transfinite Induction
    Transfinite Induction G. Eric Moorhouse, University of Wyoming Notes for ACNT Seminar, 20 Jan 2009 Abstract Let X ⊂ R3 be the complement of a single point. We prove, by transfinite induction, that X can be partitioned into lines. This result is intended as an introduction to transfinite induction. 1 Cardinality Let A and B be sets. We write |A| = |B| (in words, A and B have the same cardinality) if there exists a bijection A → B; |A| à |B| if there exists an injection (a one-to-one map) A → B; |A| < |B| if |A| à |B| but there is no bijection from A to B. The Cantor-Bernstein-Schroeder Theorem asserts that if |A| à |B| and |B| à |A|, then |A| = |B|. (The proof is elementary but requires some thought.) So we may reasonably speak of the cardinality of a set, as a measure of its size, and compare any two sets according to their cardinalities. The cardinality of Z is denoted ℵ0. Every set A having |A| à ℵ0 is called countable; in this case either A is finite, or |A|=ℵ0 (countably infinite). Examples of countably infinite sets include {positive integers},2Z ={even integers}, and Q. Cantor showed that R is uncountable; we denote |R| = 2ℵ0. This cardinality, which we call the cardinality of the continuum, strictly exceeds ℵ0; it is also the cardinality of Rn for every positive integer n. In this context it is almost obligatory to mention the Continuum Hypothe- ℵ sis (CH), which is the assertion that there is no set A satisfying ℵ0 < |A| < 2 0.
    [Show full text]
  • On the Necessary Use of Abstract Set Theory
    ADVANCES IN MATHEMATICS 41, 209-280 (1981) On the Necessary Use of Abstract Set Theory HARVEY FRIEDMAN* Department of Mathematics, Ohio State University, Columbus, Ohio 43210 In this paper we present some independence results from the Zermelo-Frankel axioms of set theory with the axiom of choice (ZFC) which differ from earlier such independence results in three major respects. Firstly, these new propositions that are shown to be independent of ZFC (i.e., neither provable nor refutable from ZFC) form mathematically natural assertions about Bore1 functions of several variables from the Hilbert cube I” into the unit interval, or back into the Hilbert cube. As such, they are of a level of abstraction significantly below that of the earlier independence results. Secondly, these propositions are not only independent of ZFC, but also of ZFC together with the axiom of constructibility (V = L). The only earlier examples of intelligible statements independent of ZFC + V= L either express properties of formal systems such as ZFC (e.g., the consistency of ZFC), or assert the existence of very large cardinalities (e.g., inaccessible cardinals). The great bulk of independence results from ZFCLthe ones that involve standard mathematical concepts and constructions-are about sets of limited cardinality (most commonly, that of at most the continuum), and are obtained using the forcing method introduced by Paul J. Cohen (see [2]). It is now known in virtually every such case, that these independence results are eliminated if V= L is added to ZFC. Finally, some of our propositions can be proved in the theory of classes, as formalized by the Morse-Kelley class theory with the axiom of choice for sets (MKC), but not in ZFC.
    [Show full text]
  • Ordinal Rankings on Measures Annihilating Thin Sets
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 310, Number 2, December 1988 ORDINAL RANKINGS ON MEASURES ANNIHILATING THIN SETS ALEXANDER S. KECHRIS AND RUSSELL LYONS ABSTRACT. We assign a countable ordinal number to each probability mea- sure which annihilates all H-sets. The descriptive-set theoretic structure of this assignment allows us to show that this class of measures is coanalytic non-Borel. In addition, it allows us to quantify the failure of Rajchman's con- jecture. Similar results are obtained for measures annihilating Dirichlet sets. A closet subset E of the unit circle T = R/Z is called an H-set if there exists a sequence {n^} of positive integers tending to oo and an interval (i.e., a nonempty open arc) 7 C T such that for all k and all x € E, n^x ^ I. These sets play a fundamental role as examples of sets of uniqueness for trigonometric series [KL; Z, Chapters IX, XII]. A (Borel) probability measure fj, on T is called a Rajchman measure if fi(n) —*0 as \n\ —>oo, where jx(n) = fTe(—nx)dn(x), e(x) = e2wix. We denote by R the class of such measures. These measures have also been very important to the study of sets of uniqueness. In particular, every Rajchman measure annihilates every set of uniqueness, hence every H-set. After establishing these relationships [Rl, R2], Rajchman conjectured that, in fact, the only measures which annihilate all //"-sets are those in R. This, however, is false [LI, L2, L3, L5]. Here, we shall quantify how distant Rajchman's conjecture is from the truth.
    [Show full text]
  • SET THEORY for CATEGORY THEORY 3 the Category Is Well-Powered, Meaning That Each Object Has Only a Set of Iso- Morphism Classes of Subobjects
    SET THEORY FOR CATEGORY THEORY MICHAEL A. SHULMAN Abstract. Questions of set-theoretic size play an essential role in category theory, especially the distinction between sets and proper classes (or small sets and large sets). There are many different ways to formalize this, and which choice is made can have noticeable effects on what categorical constructions are permissible. In this expository paper we summarize and compare a num- ber of such “set-theoretic foundations for category theory,” and describe their implications for the everyday use of category theory. We assume the reader has some basic knowledge of category theory, but little or no prior experience with formal logic or set theory. 1. Introduction Since its earliest days, category theory has had to deal with set-theoretic ques- tions. This is because unlike in most fields of mathematics outside of set theory, questions of size play an essential role in category theory. A good example is Freyd’s Special Adjoint Functor Theorem: a functor from a complete, locally small, and well-powered category with a cogenerating set to a locally small category has a left adjoint if and only if it preserves small limits. This is always one of the first results I quote when people ask me “are there any real theorems in category theory?” So it is all the more striking that it involves in an essential way notions like ‘locally small’, ‘small limits’, and ‘cogenerating set’ which refer explicitly to the difference between sets and proper classes (or between small sets and large sets). Despite this, in my experience there is a certain amount of confusion among users and students of category theory about its foundations, and in particular about what constructions on large categories are or are not possible.
    [Show full text]
  • How Set Theory Impinges on Logic
    1 Jesús Mosterín HOW SET THEORY IMPINGES ON LOGIC The set-theoretical universe Reality often cannot be grasped and understood in its unfathomable richness and mind-blowing complexity. Think only of the trivial case of the shape of the Earth. Every time the wind blows, a bird flies, a tree drops a leave, every time it rains, a car moves or we get a haircut, the form of the Earth changes. No available or conceivable geometry can describe the ever changing form of the surface of our planet. Sometimes the best we can do is to apply the method of theoretical science: to pick up a mathematical structure from the set-theoretical universe, a structure that has some formal similarities with some features of the real world situation we are interested in, and to use that structure as a model of that parcel of the world. In the case of the Earth, the structure can be an Euclidean sphere, or a sphere flattened at the poles, or an ellipsoid, but of course these structures do not represent the car and the hair, and so are realistic only up to a point. The largest part of scientific activity results in data, in contributions to history (in a broad sense). Only exceptionally does scientific activity result in abstract schemata, in formulas, in theories. In history there is truth and falsity, but we are not sure whether it makes sense to apply these same categories to an abstract theory. We pick up a mathematical structure and construct a theory. We still have to determine its scope of application or validity, the range of its realizations.
    [Show full text]
  • An Introduction to Set Theory
    AN INTRODUCTION TO SET THEORY Professor William A. R. Weiss November 21, 2014 2 Contents 0 Introduction 7 1 LOST 11 2 FOUND 23 3 The Axioms of Set Theory 29 4 The Natural Numbers 37 5 The Ordinal Numbers 47 6 Relations and Orderings 59 7 Cardinality 69 8 What's So Real About The Real Numbers? 79 9 Ultrafilters Are Useful 87 3 4 CONTENTS 10 The Universe 97 11 Reflection 103 12 Elementary Submodels 123 13 Constructibility 139 14 Appendices 155 .1 The Axioms of ZFC . 155 .2 Tentative Axioms . 156 CONTENTS 5 Preface These notes for a graduate course in set theory are on their way to be- coming a book. They originated as handwritten notes in a course at the University of Toronto given by Prof. William Weiss. Cynthia Church pro- duced the first electronic copy in December 2002. James Talmage Adams produced a major revision in February 2005. The manuscript has seen many changes since then, often due to generous comments by students, each of whom I here thank. Chapters 1 to 11 are now close to final form. Chapters 12 and 13 are quite readable, but should not be considered as a final draft. One more chapter will be added. 6 CONTENTS Chapter 0 Introduction Set Theory is the true study of infinity. This alone assures the subject of a place prominent in human culture. But even more, Set Theory is the milieu in which mathematics takes place today. As such, it is expected to provide a firm foundation for all the rest of mathematics.
    [Show full text]
  • Ranked Structures and Arithmetic Transfinite Recursion
    RANKED STRUCTURES AND ARITHMETIC TRANSFINITE RECURSION NOAM GREENBERG AND ANTONIO MONTALBAN´ Abstract. ATR0 is the natural subsystem of second order arithmetic in which one can develop a decent theory of ordinals ([Sim99]). We investigate classes of structures which are in a sense the “well-founded part” of a larger, sim- pler class, for example, superatomic Boolean algebras (within the class of all Boolean algebras). The other classes we study are: well-founded trees, reduced Abelian p-groups, and countable, compact topological spaces. Using com- putable reductions between these classes, we show that Arithmetic Transfinite Recursion is the natural system for working with them: natural statements (such as comparability of structures in the class) are equivalent to ATR0. The reductions themselves are also objects of interest. 1. Introduction Classification of mathematical objects is often achieved by finding invariants for a class of objects - a method of representing the equivalence classes of some notion of sameness (such as isomorphism, elementary equivalence, bi-embeddability) by simple objects (such as natural numbers or ordinals). A related logical issue is the question of complexity: if the invariants exist, how complicated must they be; when does complexity of the class make the existence of invariants impossible; and how much information is implied by the statement that invariants of certain type exist. To mention a far from exhaustive list of examples: in descriptive set theory, Hjorth and Kechris ([HK95]) investigated the complexity of the existence of Ulm-type classification (and of the invariants themselves) in terms of the Borel and projective hierarchy; see also Camerlo and Gao ([CG01]) and Gao ([Gao04]).
    [Show full text]