Appendix to Basic cardinal arithmetic
|
|
- Norman Stevens
- 5 years ago
- Views:
Transcription
1 Appendix to Basic cardinal arithmetic Notations 1.1. (a) For sets a and b define a+ set b:={0} a {1} b. (b) Let a (set b) :={f f : b a}. (c) Let α,β On. Then α+ ord β, α ord β and α (ord β) denote respectively their ordinal sum, their ordinal product and their ordinal exponentiaton. Note that if a b =, then a+ set b a b. The following theorem requires only ZF. The axiom of choice is not needed. Theorem 1.2. (Assume ZF) (a) ω + set ω ω ω ω. (b) For every a, 2 (set a) P(a). (c) For every a,b,c, (a b) (set c) a (set c) b (set c). (d) For every a,b,c, a (set b+setc) a (set b) a (set c). (e) For every a,b,c, (a (set b) ) (set c) a (set b c). (e) For every m,n ω, (i) m+ ord n m+ set n. (ii) m ord n m n. (iii) m (ord n) m (set n). Proof The proof is simple and is left to the students. The next proposition too, requires only ZF, and the Axiom of Choice is not needed. Proposition 1.3. (a) For every a the following conditions are equivalent. (1) ω < a; (2) a+ set 1 a; (3) for every n ω, a+ set n a; (4) a+ set ω a. (b) For every a the following conditions are equivalent. (1) a+ set a a; (2) a 2 a; (3) for every n ω \{0}, a n a; (4) a ω a. 1
2 Proof The proof is simple and is left to the students. Relying on AC, we wish to prove the following theorem. Theorem 1.4. (Assume ZFC) Let a be an infinite set and b < a. Then (a) a+ set b a. (b) If b, then a b a. Theorem 1.4 does not follow from ZF. In fact, there is a model of ZF and in this model an infinite set a such that a a + set 1. Since a, it follows that 1 < a. So in this model, Part (a) of Theorem 1.4 does not hold. The fact a a+ set 1 implies a a 2. So Part (b) is also refuted. If AC is not assumed, then still, the claims of Theorem 1.4 hold for sets a,b which can be well ordered. So at first we shall prove in ZF the version of Theorem 1.4 for well orderable sets. Since AC implies that every set is well orderable, Theorem 1.4 follows from ZFC. Theorem 1.5. (Assume ZF) Let α be an infinite ordinal. Then Proof α+ set α α+ ord α α. Every β On has a unique representation in the form β = β lim + ord β nat, where β lim is a limit ordinal or 0 and β nat ω. Let α be an infinite ordinal. We define f : α α + set α. Let β α. If β nat is an even number, then f(β) = 0,β lim ord βnat +. If β nat is an odd 2 number, then f(β) = 1,β lim + ord βnat 1. 2 It is easy to see that if α is a limit ordinal, then f is a bijection between α and α+ set α. (A bijection is a 1 1 onto function.) Assume now that α is a successor. Then α α lim α lim + set α lim α+ set α. Now we prove that α α+ ord α. Suppose that α is a limit ordinal. Define g : α α + ord α as follows: Let β α. If β nat is even define 2
3 g(β) = β lim ord βnat +. If 2 βnat is odd define g(β) = α+ ord β lim + ord βnat 1. It 2 is easy to see that g is a bijection between α and α+ ord α. Supposet now that α is a successor ordinal. Then α+ ord α = α lim + ord α lim + ord α nat (α lim + ord α lim )+ set α nat α lim + set α nat α lim + ord α nat = α. We prove an analogous result for multiplication. Theorem 1.6. (Assume ZF) Let α be an infinite ordinal. Then α α α ord α α. Proof Let us recall some facts from preceding exercises. Let a,< a and b,< b be linearly ordered sets. We define their product. It is linearly ordered set too, and it is denoted by a,< a lin b,< b. a,< a lin b,< b := a b,< [<a,< b], where < := < [<a,< b] is defined as follows: ( ) a 1,b 1 < a 2,b 2 if b 1 < b b 2 or (b 1 = b 2 and a 1 < a a 2 ). It was mentioned in an earlier exercise that for every α,β On, α, α lin β, β = α ord β, α ordβ. So α β α ord β, and in particular, α α α ord α. Next we show that α α α. We define a relation on On On. Let 3
4 α 1,β 1, α 2,β 2 On On. Then α 1,β 1 α 2,β 2 if ( ) (i) max(α 1,β 1 ) < max(α 2,β 2 ) or ( ) (ii) max(α 1,β 1 ) = max(α 1,β 1 ) and min(α 1,β 1 ) < min(α 2,β 2 ) or ) (iii) (max(α 1,β 1 )=max(α 1,β 1 ) and min(α 1,β 1 )=min(α 2,β 2 ) and α 1 <α 2 We state the following fact. On On, is a well ordered class structure. To check this is completely straight-forward, but let us check this anyway. Claim 1 On On, is a well ordered class structure. Proof Clearly is irreflexive and antisymmetric. Note the following fact. Let α,β On and denote max(α,β) by γ. Then { δ,ε δ,ε α,β } { δ,ε δ,ε γ,γ } = (γ+1) (γ+1)\{ γ,γ }. So is left-narrow. Next we check that is connected on On On. Let α,β, γ,δ On On be distinct. Suppose first that {α,β} {γ,δ} =. Then max(α,β) max(γ,δ). So α,β and γ,δ are -comparable. Next assume that {α,β} {γ,δ} has cardinality 2. Then {α,β} = {γ,δ}, α β and the second pair is equal to β,α. So the maxima and the minima of the two sets {α,β} and {γ,δ} are equal, and the first elements of α,β and γ,δ are unequal. So again, α,β and γ,δ are -comparable. Finally, we address the case that {α,β} and {γ,δ} have exactly one elementincommon. Callthiscommonelementε. Ifε = max(α,β) = max(γ,δ), then min(α,β) min(γ,δ). If, vice versa, ε = min(α,β) = min(γ,δ), then max(α,β) max(γ,δ). In both cases α,β and γ,δ are -comparable. Lastly assume without loss of generality that ε = max(α,β) and ε = min(γ,δ). Then α,β γ,δ. 4
5 We have shown that in all the different cases α,β and γ,δ are -comparable. So is connected on On On. We check that is transitive. Suppose that α,β γ,δ ε,ι. If among the maxima of the three sets {α,β}, {γ,δ} and {ε,ι} there are two which are different, then it may not happen that max(α,β) = max(ε,ι). Neithermayithappenthatmax(α,β) > max(ε,ι). Somax(α,β) < max(ε,ι) and hance α,β ε,ι. Assume now that the three maxima are equal. If two of the three minima are unequal, then an argument similar to the above shows that α,β ε,ι. It cannot happen that the three maxima are equal and the three minima are equal. Because this implies that {α,β} = {γ,δ} = {ε,ι}. And in that case either (i) α,β = γ,δ or (ii) γ,δ = ε,ι or (iii) α,β = ε,ι. (i) and (ii) cannot happen since is irreflexive, and (iii) cannot happen because is antisymmetric. We have shown that in the two possible cases that we dealt with α,β ε,ι. So is transitive. It remains to show that if a On On, then a has a -minimal element. Let γ = min({max(α,β) α,β a}) and b = { α,β a max(α,β) = γ}. Let δ = min({min(α,β) α,β b}) and c = { α,β b min(α,β) = δ}. Let ε = min({α there is β such that α,β c}) and d = { α,β c α = ε}. Then c has one or two elements, d is the singleton x = { γ,δ } or d is the the singleton x = { δ,γ }, and x is the -minimum of a. If r is a relation and a is a set, then r a denotes r (a a), namely, the two sided restriction of r to a. We prove the following claim by induction on cardinals. 5
6 Claim 2 If µ is an infinite cardinal, then µ µ, (µ µ) = µ,< µ. Let µ be an infinite cardinal and suppose that for every infinite cardinal λ < µ, λ λ, (λ λ) = λ,< λ. We abbreviate (λ λ) by. Suppose first that µ = ω. The set { n,n n ω} is unbounded in ω,, and for every n ω, the set { x,y x,y n,n } is equal to the set (n+1) (n+1)\{ n,n }, so it is finite. So every initial segment of ω ω, is finite, and ω ω is infinite. This implies that ω ω, = ω, ω. We prove this implication. The structures m:= ω ω, and n:= ω, ω are well ordered sets. So there are 3 possibilities: (i) m is isomorphic to a proper initial segment of n; (ii) n is isomorphic to a proper initial segment of m; (iii) m = n. Possibility (i) does not happen because every initial segment of n is finite, whereas the universe of m is infinite. Possibility (ii) does not happen because every initial segment of m is finite, but the universe of n is infinite. So possibility (iii) happens, and this is what we wished to prove. Now assume that µ > ω. Denote On On by Ond, and for every x Ond, let Ond x denote the set {y Ond y x}. We have not assumed AC. So there may be sets which are not well orderable. Hence a cannot be defined for all sets. Let WO denote the class of well orderable sets. For a WO we define a to be the first ordinal α such that there is a relation r on a such that a,r = α, α. The set D µ :={ α,α ω α < µ} is unbounded in µ µ,. Let α D µ and set λ = α. Then λ is infinite and λ < µ. Obviously, α α λ λ. By the induction hypothesis, λ λ, = λ, λ. In particular, λ λ λ. So α α λ. The following fact has been noted earlier in the proof. Ond α α = (α+1) (α+1)\{ α,α }. 6
7 Recall that α is an infinite ordinal. So ω < α. Hence α+1 α. Hence α α α (α+1) (α+1)\{ α,α } (α+1) (α+1) α α α. By Cantor Bernstein Theorem, λ α (α+1) (α+1)\{ α,α } = Ond α α. That is, Ond α α λ. It follows that for every α D µ, Ond α α < µ. And since D µ is unbounded in µ µ,, we also have that for every α < µ, Ond α α < µ. That is, every proper intial segment of µ µ, has cardinality less than µ. We have two well ordered sets: µ µ, and µ, µ. Either they are isomorphic, or one of them is isomorphic to a proper initial segment of the other. Clearly, µ, µ is not isomorphic to a proper initial segment of µ µ,. This is so, since proper initial segments of µ µ, have cardinality < µ, whereas the cardinality of µ is µ, and it is not less than µ. Now, the other direction. Since µ is a cardinal every proper intitial segment of µ, µ has cardinality less than µ. But the cardinality of µ µ is not less than µ. So µ µ, cannot be isomorphic to a proper intitial segment of µ, µ. The remaining possibility is µ µ, = µ, µ. We have proved Claim 1. Claim 1 implies in particular that for every infinite cardinal µ, (1) µ µ µ. Let α be an infinite ordinal. Then α is an infinite cardinal. So by (1), α α α α α α. 7
8 Corollary 1.7. (Assume ZF) Let a,b be well orderable sets. Suppose that a is infinite and that b < a. Then (a) a+ set b a. (b) If b, then a b a. Proof (a) By Theorem 1.5, a < a+ set b < a+ set a a. So by Cantor Bernstein Theorem, a+ set b < a. (b) By Theorem 1.6, a < a b < a a a. So by Cantor Bernstein Theorem, a b < a. Proof of Theorem 1.4 Theorem 1.4 follows from Theorem 1.6 and the fact that under the assumption of ZFC, every set is well orderable. Exercise 1.8. (Assume ZF) Let α,β On. Suppose that α 2 and α or β are infinite. Then α (ord β) = max( α, β ). 8
Two sets X, Y have the same cardinality (cardinal number, cardinal),
3. Cardinal Numbers Cardinality Two sets X, Y have the same cardinality (cardinal number, cardinal), (3.1) X = Y, if there exists a one-to-one mapping of X onto Y. The relation (3.1) is an equivalence
More informationWell Ordered Sets (continued)
Well Ordered Sets (continued) Theorem 8 Given any two well-ordered sets, either they are isomorphic, or one is isomorphic to an initial segment of the other. Proof Let a,< and b, be well-ordered sets.
More informationShort notes on Axioms of set theory, Well orderings and Ordinal Numbers
Short notes on Axioms of set theory, Well orderings and Ordinal Numbers August 29, 2013 1 Logic and Notation Any formula in Mathematics can be stated using the symbols and the variables,,,, =, (, ) v j
More informationNOTES ON WELL ORDERING AND ORDINAL NUMBERS. 1. Logic and Notation Any formula in Mathematics can be stated using the symbols
NOTES ON WELL ORDERING AND ORDINAL NUMBERS TH. SCHLUMPRECHT 1. Logic and Notation Any formula in Mathematics can be stated using the symbols,,,, =, (, ) and the variables v j : where j is a natural number.
More informationInitial Ordinals. Proposition 57 For every ordinal α there is an initial ordinal κ such that κ α and α κ.
Initial Ordinals We now return to ordinals in general and use them to give a more precise meaning to the notion of a cardinal. First we make some observations. Note that if there is an ordinal with a certain
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More information20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.
20 Definition 20.1. A set α is an ordinal iff: (i) α is transitive; and (ii) α is linearly ordered by. Example 20.2. (a) Each natural number n is an ordinal. (b) ω is an ordinal. (a) ω {ω} is an ordinal.
More informationCardinality and ordinal numbers
Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.
More informationSets, Logic and Categories Solutions to Exercises: Chapter 2
Sets, Logic and Categories Solutions to Exercises: Chapter 2 2.1 Prove that the ordered sum and lexicographic product of totally ordered (resp., well-ordered) sets is totally ordered (resp., well-ordered).
More informationOutside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis
Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis Tali Magidson June 6, 2017 Synopsis In June 2002, "Two Classical Surprises Concerning the Axiom of Choice and the Continuum
More informationWell-Ordered Sets, Ordinals and Cardinals Ali Nesin 1 July 2001
Well-Ordered Sets, Ordinals and Cardinals Ali Nesin 1 July 2001 Definitions. A set together with a binary relation < is called a partially ordered set (poset in short) if x (x < x) x y z ((x < y y < z)
More informationMath 455 Some notes on Cardinality and Transfinite Induction
Math 455 Some notes on Cardinality and Transfinite Induction (David Ross, UH-Manoa Dept. of Mathematics) 1 Cardinality Recall the following notions: function, relation, one-to-one, onto, on-to-one correspondence,
More informationEconomics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:
Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there
More informationIntroduction to Set Theory
Introduction to Set Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 400 George Voutsadakis (LSSU) Set Theory June 2014 1 / 67 Outline 1 Ordinal Numbers
More informationThe Absoluteness of Constructibility
Lecture: The Absoluteness of Constructibility We would like to show that L is a model of V = L, or, more precisely, that L is an interpretation of ZF + V = L in ZF. We have already verified that σ L holds
More informationBasic set-theoretic techniques in logic Part III, Transfinite recursion and induction
Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction Benedikt Löwe Universiteit van Amsterdam Grzegorz Plebanek Uniwersytet Wroc lawski ESSLLI 2011, Ljubljana, Slovenia
More information2 Ordinal arithmetic, Cantor normal form, Hessenberg sum, rank of On On,
2 Ordinal arithmetic, Cantor normal form, Hessenberg sum, rank of On On, In this lecture-note we deal with four matters. (1) Present more facts in ordinal arithmetic. (2) Present the Cantor normal form
More informationEcon Lecture 2. Outline
Econ 204 2010 Lecture 2 Outline 1. Cardinality (cont.) 2. Algebraic Structures: Fields and Vector Spaces 3. Axioms for R 4. Sup, Inf, and the Supremum Property 5. Intermediate Value Theorem 1 Cardinality
More informationSets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University
Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationThe constructible universe
The constructible universe In this set of notes I want to sketch Gödel s proof that CH is consistent with the other axioms of set theory. Gödel s argument goes well beyond this result; his identification
More informationAxioms of separation
Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationa 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2,
5.3. Pythagorean triples Definition. A Pythagorean triple is a set (a, b, c) of three integers such that (in order) a 2 + b 2 c 2. We may as well suppose that all of a, b, c are non-zero, and positive.
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationDO FIVE OUT OF SIX ON EACH SET PROBLEM SET
DO FIVE OUT OF SIX ON EACH SET PROBLEM SET 1. THE AXIOM OF FOUNDATION Early on in the book (page 6) it is indicated that throughout the formal development set is going to mean pure set, or set whose elements,
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationAxiomatic set theory. Chapter Why axiomatic set theory?
Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationAppendix to Lecture Notes on Linear Algebra I
Appendix to Lecture Notes on Linear Algebra I Peter Philip November 21, 2018 Contents A Axiomatic Set Theory 3 A.1 Motivation, Russell s Antinomy........................... 3 A.2 Set-Theoretic Formulas...............................
More informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationX = { X f X i A i : (œx, y 0 X)[x /= y œi[ x i /= y i ]]}.
CARDINALS II James T. Smith San Francisco State University These notes develop the part of cardinal arithmetic that depends on the axiom of choice. The first result is the comparability theorem: every
More informationFree Subgroups of the Fundamental Group of the Hawaiian Earring
Journal of Algebra 219, 598 605 (1999) Article ID jabr.1999.7912, available online at http://www.idealibrary.com on Free Subgroups of the Fundamental Group of the Hawaiian Earring Katsuya Eda School of
More informationPeter Kahn. Spring 2007
MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 1 The Natural Numbers 1 1.1 The Peano Axioms............................ 2 1.2 Proof by induction............................ 4 1.3
More informationMATH 220C Set Theory
MATH 220C Set Theory L A TEX by Kevin Matthews Spring 2017 (Updated January 7, 2018) Continuum Hypothesis Definition 0.0.1 (Same Cardinality). Two sets A, B have the same cardinality iff there is a bijection
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationSet Theory and the Foundation of Mathematics. June 19, 2018
1 Set Theory and the Foundation of Mathematics June 19, 2018 Basics Numbers 2 We have: Relations (subsets on their domain) Ordered pairs: The ordered pair x, y is the set {{x, y}, {x}}. Cartesian products
More informationInfinite constructions in set theory
VI : Infinite constructions in set theory In elementary accounts of set theory, examples of finite collections of objects receive a great deal of attention for several reasons. For example, they provide
More informationA topological set theory implied by ZF and GPK +
1 42 ISSN 1759-9008 1 A topological set theory implied by ZF and GPK + ANDREAS FACKLER Abstract: We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationMAGIC Set theory. lecture 6
MAGIC Set theory lecture 6 David Asperó Delivered by Jonathan Kirby University of East Anglia 19 November 2014 Recall: We defined (V : 2 Ord) by recursion on Ord: V 0 = ; V +1 = P(V ) V = S {V : < } if
More informationAbstract Algebra, HW6 Solutions. Chapter 5
Abstract Algebra, HW6 Solutions Chapter 5 6 We note that lcm(3,5)15 So, we need to come up with two disjoint cycles of lengths 3 and 5 The obvious choices are (13) and (45678) So if we consider the element
More informationReview 1. Andreas Klappenecker
Review 1 Andreas Klappenecker Summary Propositional Logic, Chapter 1 Predicate Logic, Chapter 1 Proofs, Chapter 1 Sets, Chapter 2 Functions, Chapter 2 Sequences and Sums, Chapter 2 Asymptotic Notations,
More informationParadox and Infinity Problem Set 6: Ordinal Arithmetic
24.118 Paradox and Infinity Problem Set 6: Ordinal Arithmetic You will be graded both on the basis of whether your answers are correct and on the basis of whether they are properly justified. There is
More informationThe natural numbers. Definition. Let X be any inductive set. We define the set of natural numbers as N = C(X).
The natural numbers As mentioned earlier in the course, the natural numbers can be constructed using the axioms of set theory. In this note we want to discuss the necessary details of this construction.
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationTHE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY. by arxiv: v1 [math.ca] 29 Jan 2017 MAGNUS D. LADUE
THE CANTOR GAME: WINNING STRATEGIES AND DETERMINACY by arxiv:170109087v1 [mathca] 9 Jan 017 MAGNUS D LADUE 0 Abstract In [1] Grossman Turett define the Cantor game In [] Matt Baker proves several results
More informationPMA603: Set Theory by P. G. Dixon
PMA603: Set Theory 1998-99 by P. G. Dixon Contents Page 1 Introduction.......................................................................... 1 2 The axioms of Zermelo Fraenkel set theory...........................................
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationEquivalent Forms of the Axiom of Infinity
Equivalent Forms of the Axiom of Infinity Axiom of Infinity 1. There is a set that contains each finite ordinal as an element. The Axiom of Infinity is the axiom of Set Theory that explicitly asserts that
More informationNOTES FOR 197, SPRING 2018
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
More informationProf. Ila Varma HW 8 Solutions MATH 109. A B, h(i) := g(i n) if i > n. h : Z + f((i + 1)/2) if i is odd, g(i/2) if i is even.
1. Show that if A and B are countable, then A B is also countable. Hence, prove by contradiction, that if X is uncountable and a subset A is countable, then X A is uncountable. Solution: Suppose A and
More informationShort Introduction to Admissible Recursion Theory
Short Introduction to Admissible Recursion Theory Rachael Alvir November 2016 1 Axioms of KP and Admissible Sets An admissible set is a transitive set A satisfying the axioms of Kripke-Platek Set Theory
More informationUnsolvable problems, the Continuum Hypothesis, and the nature of infinity
Unsolvable problems, the Continuum Hypothesis, and the nature of infinity W. Hugh Woodin Harvard University January 9, 2017 V : The Universe of Sets The power set Suppose X is a set. The powerset of X
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationThis paper is also taken by Combined Studies Students. Optional Subject (i): Set Theory and Further Logic
UNIVERSITY OF LONDON BA EXAMINATION for Internal Students This paper is also taken by Combined Studies Students PHILOSOPHY Optional Subject (i): Set Theory and Further Logic Answer THREE questions, at
More informationSpanning, linear dependence, dimension
Spanning, linear dependence, dimension In the crudest possible measure of these things, the real line R and the plane R have the same size (and so does 3-space, R 3 ) That is, there is a function between
More informationJónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy
Jónsson Properties for Non-Ordinal Sets Under the Axiom of Determinacy Fifth NY Graduate Student Logic Conference The Jónsson Property For κ a cardinal and n ω, [κ] n = {(α 1,, α n ) κ n : α 1 < < α n
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationCITS2211 Discrete Structures (2017) Cardinality and Countability
CITS2211 Discrete Structures (2017) Cardinality and Countability Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets Reading Sections 45 and 81 84 of Mathematics
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationScott processes. Paul B. Larson June 23, 2014
Scott processes Paul B. Larson June 23, 2014 Abstract The Scott process of a relational structure M is the sequence of sets of formulas given by the Scott analysis of M. We present axioms for the class
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationReal Analysis - Notes and After Notes Fall 2008
Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More information3 The language of proof
3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;
More informationMath 280A Fall Axioms of Set Theory
Math 280A Fall 2009 1. Axioms of Set Theory Let V be the collection of all sets and be a membership relation. We consider (V, ) as a mathematical structure. Analogy: A group is a mathematical structure
More informationSMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS
SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS MARCIN KYSIAK AND TOMASZ WEISS Abstract. We discuss the question which properties of smallness in the sense of measure and category (e.g. being a universally
More informationWell-foundedness of Countable Ordinals and the Hydra Game
Well-foundedness of Countable Ordinals and the Hydra Game Noah Schoem September 11, 2014 1 Abstract An argument involving the Hydra game shows why ACA 0 is insufficient for a theory of ordinals in which
More informationEconomics 204. Lecture 2, July 28, 2009
Economics 04 Lecture, July 8, 009 Section 14, Cardinality (Cont) Theorem 1 (Cantor) N, the set of all subsets of N, isnot countable Proof: Suppose N is countable Then there is a bijection f : N N Let A
More informationIteratively changing the heights of automorphism towers
Iteratively changing the heights of automorphism towers Gunter Fuchs The College of Staten Island/CUNY 28 Victory Blvd. Staten Island, NY 1314 Philipp Lücke Westfälische Wilhelms-Universität Münster Einsteinstraße
More informationFoundations of Mathematical Analysis
Foundations of Mathematical Analysis Fabio Bagagiolo Dipartimento di Matematica, Università di Trento email:fabio.bagagiolo@unitn.it Contents 1 Introduction 2 2 Basic concepts in mathematical analysis
More informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
More informationINTRODUCTION TO CARDINAL NUMBERS
INTRODUCTION TO CARDINAL NUMBERS TOM CUCHTA 1. Introduction This paper was written as a final project for the 2013 Summer Session of Mathematical Logic 1 at Missouri S&T. We intend to present a short discussion
More informationCORES OF ALEXANDROFF SPACES
CORES OF ALEXANDROFF SPACES XI CHEN Abstract. Following Kukie la, we show how to generalize some results from May s book [4] concerning cores of finite spaces to cores of Alexandroff spaces. It turns out
More informationNon-conglomerability for countably additive measures that are not -additive* Mark Schervish, Teddy Seidenfeld, and Joseph Kadane CMU
Non-conglomerability for countably additive measures that are not -additive* Mark Schervish, Teddy Seidenfeld, and Joseph Kadane CMU Abstract Let be an uncountable cardinal. Using the theory of conditional
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationA Note on Singular Cardinals in Set Theory without Choice
arxiv:0709.2436v1 [math.lo] 15 Sep 2007 A Note on Singular Cardinals in Set Theory without Choice Denis I. Saveliev 2007 August 11, Beijing Partially supported by grant 06-01-00608-a of Russian Foundation
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationMORE ON CONTINUOUS FUNCTIONS AND SETS
Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly
More informationCSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Review for the Final! Hyunyoung Lee! 1 Final Exam Section 501 (regular class time 8:00am) Friday, May 8, starting at 1:00pm in our classroom!! Section 502 (regular
More informationMath 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets
Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Notes on Cardinality of Sets Introduction In this short article, we will describe some basic notions on cardinality of sets. Given two
More informationTopological versus Bornological Concepts in Infinite Dimensions
Topological versus Bornological Concepts in Infinite Dimensions Diplomarbeit zur Erlangung des akademischen Grades Magister rerum naturalium an der Fakultät für Naturwissenschaften und Mathematik der Universität
More informationGeneralizing Gödel s Constructible Universe:
Generalizing Gödel s Constructible Universe: Ultimate L W. Hugh Woodin Harvard University IMS Graduate Summer School in Logic June 2018 Ordinals: the transfinite numbers is the smallest ordinal: this is
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationThe Exact Strength of the Class Forcing Theorem
The Exact Strength of the Class Forcing Theorem Peter Holy University of Bonn presenting joint work with Victoria Gitman, Joel Hamkins, Philipp Schlicht, and Kameryn Williams October 30, 2017 Peter Holy
More informationSupplement. Algebraic Closure of a Field
Supplement: Algebraic Closure of a Field 1 Supplement. Algebraic Closure of a Field Note. In this supplement, we give some background material which is used in the proof of Fraleigh s Theorem 31.17/31.22
More informationLINEAR ORDERS, DISCRETE, DENSE, AND CONTINUOUS
LINEAR ORDERS, DISCRETE, DENSE, AND CONTINUOUS THEOREM 1: If
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More information