CITS2211 Discrete Structures (2017) Cardinality and Countability
|
|
- Kory Elliott
- 5 years ago
- Views:
Transcription
1 CITS2211 Discrete Structures (2017) Cardinality and Countability
2 Highlights What is cardinality? Is it the same as size? Types of cardinality and infinite sets
3 Reading Sections 45 and of Mathematics for Computer Scientists
4 Why We saw that counting is important related to that is determining the size of things, and cardinality is a generalization of size Infinite sets may seem to be of only theoretical interest, but they make many sorts of calculations more convenient (or give them a solid mathematical foundation) calculus, for one!
5 Cardinality Definition If A is a finite set, then its cardinality is defined to be the number of elements in A, and denoted A For example, and {0, 1, 2, 3} = 4 {0, 1, {0, 1}} = 3
6 Equal sized sets Two finite sets A and B have the same cardinality if they have the same number of elements For example, {0, 1, 2} = {a, b, c}
7 Disjoint sets Observation: If A and B are disjoint (that is, A B = ), then A B = A + B Exercise: Show that A B = A + B A B, when A and B are finite sets (Note this generalises the observation above)
8 Some observations We can use functions to compare cardinalities of two sets A B if and only if there is a surjection from A to B A A B if and only if there is an injection from A to B B A B
9 Some observations Thus A = B if and only if there is a bijection from A to B A B
10 Question But what about infinite sets?
11 Infinite sets why are they useful? Convenience applied sciences, engineering, calculus physics models modelling computations Limits on what s possible (even in theory)
12 Infinite sets can we describe their size? Cardinality arose out of the desire to be able to compare the sizes of infinite sets (Eg there seem to be more real numbers than integers, in some sense) There are multiple ways we could define the size of an infinite set but cardinality (based on the idea of pairing off members of two sets bijection) has proved most useful For finite sets, our intuitive idea of the size of a set matches up with the idea of cardinality For infinite sets, they differ
13 Infinite sets how can we define them? Definition A: A set A is called infinite iff there does not exist any k N such that there is a surjection: f : N k A Definition B: A set A is called infinite iff it has a proper subset with the same cardinality That is, A is infinite iff: B : (B A) ( A = B )
14 Infinite sets do any exist? ZFC does guarantee us the existence of certain sets In standard ZFC, there are 2 sets we re allowed to start with The axioms say: There is an empty set (We write this as )
15 Infinite sets do any exist? ZFC does guarantee us the existence of certain sets In standard ZFC, there are 2 sets we re allowed to start with The axioms say: There is an empty set (We write this as ) There is an infinite set (We can write it as I)
16 Infinite sets do any exist? (2) There are two rules about what s in the infinite set, I: The empty set is a member of the infinite set If we pick some set x which is a member of I, then the set {x} is also a member of I In first-order logic: I : ( I) (x I {x} I)
17 Infinite sets do any exist? (3) This means that the infinite set is the set I = {, { }, {{ }}, {{{ }}}, {{{{ }}}},, } If we re allowed to assume the existence of this set, there are ways of guaranteeing that the other infinite sets we would like to use (N, Z, R, and so on) all exist
18 Infinite sets Intuitively, a set B is infinite if B = k does not hold for any k We also have that B k does not hold for any k Recall that, for finite sets, B A if and only if there is a surjection from A to B Let N k denote the set {1, 2,, k}, so N k = k Definition A set B is called infinite if there does not exist any k such that there is a surjection f : N k B
19 Infinite sets We know lots of infinite sets already: N the natural numbers, like 1, 2, 450, Z the integers, like 1, 20, 52, Q the rational numbers, like 1 2, 2 30, 22 7, R the real numbers, like π, 2,
20 The key concept Recall that, for finite sets, A = B if and only if there is a bijection from A to B We extend this property to infinite sets Definition We define two sets, A and B to have the same cardinality and we write A = B if and only if there is a bijection between them While this seems uncontroversial, it has some counterintuitive consequences!
21 Which is bigger? Recall N denotes the set of all natural numbers and N >0 denotes the set of positive natural numbers Clearly N >0 N, but what can we say about the relationship between N >0 and N?
22 Which is bigger? Recall N denotes the set of all natural numbers and N >0 denotes the set of positive natural numbers Clearly N >0 N, but what can we say about the relationship between N >0 and N? Let f : N N >0 be given by the formula f (n) = n + 1 Then it is easy to see that f is injective (one-to-one) and surjective (onto) and therefore N >0 = N
23 Which is bigger? Let E denote the set of even natural numbers, so that E = {0, 2, 4, 6, } and let N denote the set of all natural numbers Clearly E N, but what can we say about the relationship between E and N?
24 Which is bigger? Let E denote the set of even natural numbers, so that E = {0, 2, 4, 6, } and let N denote the set of all natural numbers Clearly E N, but what can we say about the relationship between E and N? Let f : N E be given by the formula f (n) = 2n Then it is easy to see that f is injective (one-to-one) and surjective (onto) and therefore E = N
25 What about the integers? What is the relationship between N >0 and Z?
26 What about the integers? What is the relationship between N >0 and Z? If we define f : N >0 Z by { (n 1)/2 n is odd, f (n) = n/2 n is even then we see that f (1) = 0, f (2) = 1, f (3) = 1, f (4) = 2, f (5) = 2, and so this is a bijection and therefore N >0 = Z
27 N A Countability Definition A set A is called countable if either it is finite or if there is a bijection f : N >0 A So we ve demonstrated that the sets E and Z are both countable Intuitively, a set A is countable if you can list its elements in (some) order {a 1, a 2, a 3, } a 1 a 2 a 3 a 4
28 Z is countable We can visualise the ordering on Z as follows:
29 Z is countable We can visualise the ordering on Z as follows:
30 Z is countable We can visualise the ordering on Z as follows:
31 Z is countable We can visualise the ordering on Z as follows:
32 Z is countable We can visualise the ordering on Z as follows: We get the list {0, 1, 1, 2, 2, 3, 3, }
33 N >0 N >0 Consider the set N >0 N >0, whose elements are (p, q) where p, q N >0, and arrange them in the following infinite array (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6)
34 N >0 N >0 Consider the set N >0 N >0, whose elements are (p, q) where p, q N >0, and arrange them in the following infinite array (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6)
35 N >0 N >0 Consider the set N >0 N >0, whose elements are (p, q) where p, q N >0, and arrange them in the following infinite array (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6)
36 N >0 N >0 Consider the set N >0 N >0, whose elements are (p, q) where p, q N >0, and arrange them in the following infinite array (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6)
37 N >0 N >0 Consider the set N >0 N >0, whose elements are (p, q) where p, q N >0, and arrange them in the following infinite array (1, 1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (1, 2) (2, 2) (3, 2) (4, 2) (5, 2) (6, 2) (1, 3) (2, 3) (3, 3) (4, 3) (5, 3) (6, 3) (1, 4) (2, 4) (3, 4) (4, 4) (5, 4) (6, 4) (1, 5) (2, 5) (3, 5) (4, 5) (5, 5) (6, 5) (1, 6) (2, 6) (3, 6) (4, 6) (5, 6) (6, 6)
38 N N and the positive rationals So N >0 N >0 is countable, that is N >0 N >0 = N >0! Now we can define a surjection g : N >0 N >0 Q + (the positive rationals) by g(p, q) = p/q Hence Q + N >0 N >0 = N >0 Clearly N >0 Q + since N Q + Thus Q + = N >0 In other words the positive rationals are countable too
39 Countable rationals The positive rationals are countable, so clearly the negative rationals are countable Exercise: find a bijection between the positive rationals and the negative rationals Thus the rationals in their entirety are countable! Positive rationals a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 a 10 0 b 1 b 2 b 3 b 4 b 5 b 6 b 7 b 8 b 9 b 10 Negative rationals
40 What else is countable? We can use these ideas to show that The set of vectors (a, b) with a, b Z is countable (these are often called lattice points ) The set of binary strings of finite length (eg ) is countable The set of all legitimate Java programs is countable The set of all Turing machines is countable
41 What isn t countable? Cantor s famous diagonal argument shows that there exist sets which are not countable Consider the set of infinite sequences of the numbers 0 and 1 Is it countable? If it is, we can make a list of all those sequences
42 Cantor s Diagonal Argument Let s assume we have such a list
43 Cantor s Diagonal Argument We will prove that there is always a sequence of 0 s and 1 s that isn t in the list
44 Cantor s Diagonal Argument
45 Cantor s Diagonal Argument d =
46 Cantor s Diagonal Argument d = d =
47 Cantor s Diagonal Argument Now d the 1st sequence because they differ in the 1st number d the 2nd sequence because they differ in the 2nd number d the 3rd sequence because they differ in the 3rd number d the 4th sequence because they differ in the 4th number d the kth sequence because they differ in the kth number We assumed nothing about the list, except that it could be constructed; we ve reached a contradiction; so our assumption must be false Therefore, any listing must be incomplete the set of all 0-1-sequences is uncountable
48 Some obvious facts Two obvious facts If S T and T is countable, then so is S Any subset of a countable set is itself countable If S T and S is uncountable, then so is T Any superset of an uncountable set is itself uncountable
49 Cardinality of a countable set What is the common cardinality of N >0, N, Z, E, etc?
50 Cardinality of a countable set What is the common cardinality of N >0, N, Z, E, etc? There is a special symbol ℵ 0, pronounced aleph-null to refer to the size of a countably infinite set, so N >0 = ℵ 0, Q = ℵ 0 and Z = ℵ 0 However the real numbers are not countable and so R > ℵ 0
51 Larger and larger There is no limit to making larger and larger sets, even within the class of uncountable sets Theorem For any set A (finite or infinite, countable or uncountable), there is no function f : A P(A) that is a surjection Therefore A < P(A) < P(P(A)) < P(P(P(A))) and there is an infinite number of differently-sized infinities (See strange-but-true-infinity-comes-in-different-sizes/)
52 Cardinality of infinite sets consequences There are properties of finite sets that don t extend to infinite sets: Adding a finite set to an infinite set doesn t increase the size of the infinite set Eg N >0 = N {0} and N >0 = N
53 How many functions? How many functions from the set {a, b, c} to the set {T, F }?
54 How many functions? How many functions from the set {a, b, c} to the set {T, F }? Answer: = 2 3 = 8
55 How many functions? (2) How many functions from the set {0, 1} to the set N >0? Is the set of those functions countable?
56 How many functions? (2) How many functions from the set {0, 1} to the set N >0? Is the set of those functions countable?
57 How many functions? (3) How many functions from the set N to the set {0, 1}?
58 How many functions? (3) How many functions from the set N to the set {0, 1}? Answer: = 2 N = 2 ℵ 0
59 Impossible things be careful when doing them We ve seen, the number of functions from N to {T, F } is uncountable How many legal Java programs are there? What does these mean for functions from J, the set of all possible Java programs, to the set {T, F }?
ADVANCED 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 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 informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
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 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 informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationMathematics 220 Workshop Cardinality. Some harder problems on cardinality.
Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
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 informationDiscrete Mathematics 2007: Lecture 5 Infinite sets
Discrete Mathematics 2007: Lecture 5 Infinite sets Debrup Chakraborty 1 Countability The natural numbers originally arose from counting elements in sets. There are two very different possible sizes for
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 0 To Infinity And Beyond: Countability and Computability This note ties together two topics that might seem like they have
More informationCSE 311: Foundations of Computing. Lecture 26: Cardinality
CSE 311: Foundations of Computing Lecture 26: Cardinality Cardinality and Computability Computers as we know them grew out of a desire to avoid bugs in mathematical reasoning A brief history of reasoning
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
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 informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationMath.3336: Discrete Mathematics. Cardinality of Sets
Math.3336: Discrete Mathematics Cardinality of Sets Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
More informationSection Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence
Section 2.4 1 Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations 2 Introduction Sequences are ordered lists of
More informationGreat Theoretical Ideas in Computer Science. Lecture 5: Cantor s Legacy
15-251 Great Theoretical Ideas in Computer Science Lecture 5: Cantor s Legacy September 15th, 2015 Poll Select the ones that apply to you: - I know what an uncountable set means. - I know Cantor s diagonalization
More informationA Short Review of Cardinality
Christopher Heil A Short Review of Cardinality November 14, 2017 c 2017 Christopher Heil Chapter 1 Cardinality We will give a short review of the definition of cardinality and prove some facts about the
More informationAlgorithms: Lecture 2
1 Algorithms: Lecture 2 Basic Structures: Sets, Functions, Sequences, and Sums Jinwoo Kim jwkim@jjay.cuny.edu 2.1 Sets 2 1 2.1 Sets 3 2.1 Sets 4 2 2.1 Sets 5 2.1 Sets 6 3 2.1 Sets 7 2.2 Set Operations
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 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 informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationChapter 20. Countability The rationals and the reals. This chapter covers infinite sets and countability.
Chapter 20 Countability This chapter covers infinite sets and countability. 20.1 The rationals and the reals You re familiar with three basic sets of numbers: the integers, the rationals, and the reals.
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationMATH 13 FINAL EXAM SOLUTIONS
MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F
More informationCardinality of sets. Cardinality of sets
Cardinality of sets Two sets A and B have the same size, or cardinality, if and only if there is a bijection f : A Ñ B. Example: We know that set ta, b, cu has elements because we can count them: 1: a
More informationSome. AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability
15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability 15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Infinity
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 informationNotes on counting. James Aspnes. December 13, 2010
Notes on counting James Aspnes December 13, 2010 1 What counting is Recall that in set theory we formally defined each natural number as the set of all smaller natural numbers, so that n = {0, 1, 2,...,
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 informationAnnouncements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.
Announcements CS43: Discrete Structures Sequences, Summations, and Cardinality of Infinite Sets Işıl Dillig Homework is graded, scores on Blackboard Graded HW and sample solutions given at end of this
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More informationNOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.
EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one
More informationA Universal Turing Machine
A Universal Turing Machine A limitation of Turing Machines: Turing Machines are hardwired they execute only one program Real Computers are re-programmable Solution: Universal Turing Machine Attributes:
More informationMost Merry and Illustrated Proof of Cantor's Theorem on the Countability of Integers (Concise Version)
A Most Merry and Illustrated Proof of Cantor's Theorem on the Countability of Integers (Concise Version) ( 2012, Charles F. Cooper,) George said they both weighed the same. This is a brief (or at more
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. May 11/13, 2015 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More information6 Cosets & Factor Groups
6 Cosets & Factor Groups The course becomes markedly more abstract at this point. Our primary goal is to break apart a group into subsets such that the set of subsets inherits a natural group structure.
More informationCSE 311: Foundations of Computing. Lecture 26: More on Limits of FSMs, Cardinality
CSE 311: Foundations of Computing Lecture 26: More on Limits of FSMs, Cardinality Last time: Languages and Representations All Context-Free??? Prove there is Regular a context-free DFA language 0* NFA
More information0 Logical Background. 0.1 Sets
0 Logical Background 0.1 Sets In this course we will use the term set to simply mean a collection of things which have a common property such as the totality of positive integers or the collection of points
More informationSelected problems from past exams
Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence
More information0.1 Non-enumerable Sets
01 NON-ENUMERABLE SETS 1 01 Non-enumerable Sets Some sets, such as the set N of natural numbers, are infinite So far we ve seen examples of infinite sets which were all enumerable However, there are also
More informationMATH 201 Solutions: TEST 3-A (in class)
MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define
More informationECS 120 Lesson 18 Decidable Problems, the Halting Problem
ECS 120 Lesson 18 Decidable Problems, the Halting Problem Oliver Kreylos Friday, May 11th, 2001 In the last lecture, we had a look at a problem that we claimed was not solvable by an algorithm the problem
More informationLecture 3: Sizes of Infinity
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational
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 informationS15 MA 274: Exam 3 Study Questions
S15 MA 274: Exam 3 Study Questions You can find solutions to some of these problems on the next page. These questions only pertain to material covered since Exam 2. The final exam is cumulative, so you
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 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 informationTuring Machines, diagonalization, the halting problem, reducibility
Notes on Computer Theory Last updated: September, 015 Turing Machines, diagonalization, the halting problem, reducibility 1 Turing Machines A Turing machine is a state machine, similar to the ones we have
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Nachum Dershowitz & Yishay Mansour. Tel Aviv University. May 17 22, 2017 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationMeta-logic derivation rules
Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will
More informationThe cardinal comparison of sets
(B) The cardinal comparison of sets I think we can agree that there is some kind of fundamental difference between finite sets and infinite sets. For a finite set we can count its members and so give it
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 informationLecture Notes: The Halting Problem; Reductions
Lecture Notes: The Halting Problem; Reductions COMS W3261 Columbia University 20 Mar 2012 1 Review Key point. Turing machines can be encoded as strings, and other Turing machines can read those strings
More informationDiscrete Structures - CM0246 Cardinality
Discrete Structures - CM0246 Cardinality Andrés Sicard-Ramírez Universidad EAFIT Semester 2014-2 Cardinality Definition (Cardinality (finite sets)) Let A be a set. The number of (distinct) elements in
More information1 Partitions and Equivalence Relations
Today we re going to talk about partitions of sets, equivalence relations and how they are equivalent. Then we are going to talk about the size of a set and will see our first example of a diagonalisation
More information4.2 The Halting Problem
172 4.2 The Halting Problem The technique of diagonalization was discovered in 1873 by Georg Cantor who was concerned with the problem of measuring the sizes of infinite sets For finite sets we can simply
More informationMath 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
More informationChapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60
MATH 213 Chapter 2: Basic Structures Dr. Eric Bancroft Fall 2013 Dr. Eric Bancroft MATH 213 Fall 2013 1 / 60 Chapter 2 - Basics Structures 2.1 - Sets 2.2 - Set Operations 2.3 - Functions 2.4 - Sequences
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationComputational Models Lecture 8 1
Computational Models Lecture 8 1 Handout Mode Ronitt Rubinfeld and Iftach Haitner. Tel Aviv University. April 18/ May 2, 2016 1 Based on frames by Benny Chor, Tel Aviv University, modifying frames by Maurice
More informationChapter 2 - Basics Structures
Chapter 2 - Basics Structures 2.1 - Sets Definitions and Notation Definition 1 (Set). A set is an of. These are called the or of the set. We ll typically use uppercase letters to denote sets: S, A, B,...
More informationUndecidability. Andreas Klappenecker. [based on slides by Prof. Welch]
Undecidability Andreas Klappenecker [based on slides by Prof. Welch] 1 Sources Theory of Computing, A Gentle Introduction, by E. Kinber and C. Smith, Prentice-Hall, 2001 Automata Theory, Languages and
More informationFunctions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014
Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some
More informationExtended Essay - Mathematics
Extended Essay - Mathematics Creating a Model to Separate or Group Number Sets by their Cardinalities Pope John Paul II C.S.S. September 2009 Candidate Number: 001363-012 The conquest of the actual infinite
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationCSE 311: Foundations of Computing. Lecture 27: Undecidability
CSE 311: Foundations of Computing Lecture 27: Undecidability Last time: Countable sets A set is countable iff we can order the elements of as = {,,, Countable sets: N-the natural numbers Z - the integers
More informationEconomics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017
Economics 04 Summer/Fall 07 Lecture Monday July 7, 07 Section.. Methods of Proof We begin by looking at the notion of proof. What is a proof? Proof has a formal definition in mathematical logic, and a
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 informationIntro to Theory of Computation
Intro to Theory of Computation LECTURE 15 Last time Decidable languages Designing deciders Today Designing deciders Undecidable languages Diagonalization Sofya Raskhodnikova 3/1/2016 Sofya Raskhodnikova;
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
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 informationSolution. 1 Solutions of Homework 1. 2 Homework 2. Sangchul Lee. February 19, Problem 1.2
Solution Sangchul Lee February 19, 2018 1 Solutions of Homework 1 Problem 1.2 Let A and B be nonempty subsets of R + :: {x R : x > 0} which are bounded above. Let us define C = {xy : x A and y B} Show
More information1.3. The Completeness Axiom.
13 The Completeness Axiom 1 13 The Completeness Axiom Note In this section we give the final Axiom in the definition of the real numbers, R So far, the 8 axioms we have yield an ordered field We have seen
More informationA function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that. f (x) = y
Functions A function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that for all x A, there is exactly one y B s.t. (x, y) f. The set A is called the
More informationSolutions to Homework Assignment 2
Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems
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 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 informationPrinciples of Real Analysis I Fall I. The Real Number System
21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous
More informationPhilosophy of Religion. Notes on Infinity
Notes on Infinity Infinity in Classical and Medieval Philosophy Aristotle (Metaphysics 986 a 22) reports that limited (peras, πέρας) and unlimited or infinite (apeiron, ἄπειρον) occur as the first pairing
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 informationDate: October 24, 2008, Friday Time: 10:40-12:30. Math 123 Abstract Mathematics I Midterm Exam I Solutions TOTAL
Date: October 24, 2008, Friday Time: 10:40-12:30 Ali Sinan Sertöz Math 123 Abstract Mathematics I Midterm Exam I Solutions 1 2 3 4 5 TOTAL 20 20 20 20 20 100 Please do not write anything inside the above
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 informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
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 informationWarm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet.
Warm-Up Problem Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet Warm up: Given a program that accepts input, is there an
More informationWelcome to CS103! Two Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation
Welcome to CS103! Two Handouts Today: Course Overview Introduction to Set Theory The Limits of Computation Course Staff Keith Schwarz (htiek@cs.stanford.edu) Kyle Brogle (broglek@stanford.edu) Maurizio
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 informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationCountable and uncountable sets. Matrices.
Lecture 11 Countable and uncountable sets. Matrices. Instructor: Kangil Kim (CSE) E-mail: kikim01@konkuk.ac.kr Tel. : 02-450-3493 Room : New Milenium Bldg. 1103 Lab : New Engineering Bldg. 1202 Next topic:
More informationCOMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages
COMP/MATH 300 Topics for Spring 2017 June 5, 2017 Review and Regular Languages Exam I I. Introductory and review information from Chapter 0 II. Problems and Languages A. Computable problems can be expressed
More information