Cardinality of Sets. P. Danziger

Size: px
Start display at page:

Download "Cardinality of Sets. P. Danziger"

Transcription

1 MTH Cardinality of Sets P Danziger Cardinal vs Ordinal Numbers If we look closely at our notions of number we will see that in fact we have two different ways of conceiving of numbers The first is as an order relation (ordinality), the second is as method of counting (cardinality) When we count a set of n objects we assign to each object an integer in sequence, starting from one So each object is assigned a unique number from to n Such an assignment is called a one to one correspondence (or in mathematical parlance a bijection) Definition A one to one correspondence, or bijection is a function, f, which maps a set S to a set T (we write f : S T ) in such a way that Each element of S is mapped to a unique element of T Every element of T is the image of some element of S In a similar way we use such bijections to measure distance, by putting space in one to one correspondence with the real numbers Each distance corresponds to exactly one unique real number Of course we are ignoring any imprecisions of the physical act of measurement, in our ideal mathematical world this is the way things would be This kind of view of number is known as cardinality The other notion of number is ordinality, in this notion we are only concerned with statements like x is bigger than y This is actually the notion of number seen in the discussion of limits Nowhere do we consider actual magnitudes, only relations of magnitudes While this distinction may seem pedantic it has two important ramifications The first is in the field of measurement, If we are not able to give quantitative measure to an object of study we can still get some information from an ordinal measure, this is often the case in the social sciences Thus we may say John is more emotional than Mary, though we may not quantify by how much, since we have no scale of measurement The second ramification is in the notion of infinity With an ordinal representation of infinity we may only talk about infinity representing an unbounded quantity, as in the discussion of limits The ordinal interpretation of infinity has a safety valve for dealing with the infinite The infinities encountered when considering limits are potential infinities, meaning that they represent potentially unbounded quantities A function never actually equals infinity, it merely gets larger and larger At the point where it would become infinite it actually becomes undefined Thus calculus avoids dealing directly with infinity On the other hand with a cardinal viewpoint we may consider a bijection between two infinite sets, the existence of such a bijection would imply that they have the same size Thus we may

2 MTH Cardinality of Sets P Danziger consider sets with infinite cardinality, for example the set of natural numbers, or the set of real numbers between 0 and This gives a much finer representation of the notion of infinity than an ordinal representation The notion of an actual infinity has always been contentious Definition We say that two sets X and Y have the same cardinality if there exists a bijection f : X Y If Y = {,,, n}, for some fixed n Z +, and there exists a bijection f : X Y, then we say that X is of size n, and write X = n Note that there exists a bijection f : X Y if and only if there exists a bijection g : Y X (g = f ) What happens if we extend the first part of this definition to infinite (unbounded) sets? Cantor and Countable Infinity The first person to really consider the notion of infinity in this way was Georg Cantor (845-98) Cantor was born in St Petersburg, Russia, but moved to Berlin when he was Cantor studied mathematics at Zurich, and ended up teaching at Halle university in Germany Cantor never gained the recognition he felt he deserved, and during his life his ideas were ridiculed by the mathematical community This effected him deeply and he spent much of his life in and out of mental institutions, suffering repeated breakdowns However by the time of his death in 98 his ideas were becoming widely accepted and his genius started to be recognised Cantor s basic idea was to use cardinality as a definition of infinity Thus we may talk about the number of natural numbers, or the number of rational numbers and so on If two infinite sets can be put into one to one correspondence with each other, then they represent the same infinity, just as any two sets which can be put into one to one correspondence with each other represent the same number Definition A set X is said to be countably infinite, or countable, if it has the same cardinality as Z + Thus a set is countable if and only if there is a bijection from it to Z + Note that compositions of bijections are bijections So once we know a set, X, is countable finding a bijection from another set, Y to X shows that Y is countable as well

3 MTH Cardinality of Sets P Danziger Even Numbers As an illustration of Cantorean arguments, consider the set of positive even numbers, E = {, 4, 6, 8, } Consider f : Z E, f(n) = n f is a bijection (Exercise) Natural Numbers Even Numbers Thus the conclusion is that the number of natural numbers has the same cardinality as the positive even numbers, very strange Thus the positive even numbers are countable This leads to strange phenomena, such as Hilbert s hotel: Hilbert s hotel is a hotel with an infinite number of rooms, numbered,, 3, One day the hotel is full, with an infinite number of guests That day an infinite number of buses arrive carrying an infinite number of new guests No problem, says the manager, we can accommodate you all How does the manager accommodate the new guests? For each of the current guests the manager moves the person in room i to room i, thus freeing up an infinite number of rooms for the new guests Z What about the number of integers? { n Consider the function, f : Z + Z, f(n) = n The output of this function goes as follows: if n is odd if n is even n f(n) 0 f is a bijection (Exercise) Thus the integers have the same cardinality as the positive integers, they are countable 3 Q What about the rational numbers, Q? In order to count the rational numbers we create an infinite table on which to count, the denominator increases as we move to the right, and the numerator increases as we move down (see figure ) This enumerates all possible values of numerator and denominator 3

4 MTH Cardinality of Sets P Danziger Figure : Cantor s Counting of the Rationals We now count diagonally starting at the top left, starting at the top left Every time we reach the top we move right, and every time we reach the left hand side we move down This assigns a unique natural number to each rational number n f(n) 3 3 Thus the rational numbers are countable, ie they have the same cardinality as the natural numbers 4 [0, ] We have seen that the natural numbers, the even numbers, the integers and the rational numbers are all countable, ie are the same size of infinity What about the real numbers R? We can simplify things by only considering those real numbers between 0 and, there are certainly an infinite number of them We claim that this infinity is different than the previous ones, that is the set of real numbers between 0 and is not countable This means that there is no one to one correspondence between this set and the set of natural numbers We are thus faced with the problem of showing that something does not exist, always much harder than showing that something does The answer is Cantor s diagonalisation proof This method of proof has been adapted to many circumstances, including the proof that the 4

5 MTH Cardinality of Sets P Danziger problem of deciding whether a machine (computer) will eventually halt on any input is insoluble (the halting problem) Theorem There is no bijection f : Z + [0, ] Proof: (By contradiction) Suppose not, that is suppose that there is a bijection f : Z + [0, ] That is, to each real number between 0 and we can assign a unique positive integer If this were so we could take an infinitely large sheet of paper and write out the positive integers, n corresponding to the real numbers x An example of how part of such a table might look is shown below n x Now we will create a real number between 0 and which cannot be on the table On the ith row we identify the ith digit after the decimal point In the example above this gives the digits, 5, 3, 4, 5, 9, We can consider this as a number between 0 and, namely Now, for each identified digit we change it to something else, for example we might add, changing 9 to 0 (add mod 0) This gives a new number, in this case This number, which lies between 0 and, cannot be on the list The reason is that it differs from the first number on the list in the first position after the decimal point, from the second number on the list in the second position after the decimal point, from the third number on the list in the third position after the decimal point, and so on In general it differs from the ith number on the list in the ith position after the decimal point, since we started with that digit and then changed it Thus we have created a number between 0 and which does not have a natural number assigned to it, if it did it would be on the list 3 The Continuum and Beyond This shows that the number of real numbers between 0 and is not countable, this is a different infinity! This infinity is called the continuum While it was surprising that seemingly different 5

6 MTH Cardinality of Sets P Danziger sized sets have the same infinite number of elements, once we have accepted this fact, it is even more surprising that there should be more than one type of infinity It should be noted that it can be shown that the set of real numbers has the same cardinality as the set of real numbers from 0 to, thus the set of real numbers, R, also has the size of the continuum This naturally raises the question of whether there are more infinities, indeed there are, a countably infinite number of them! For example, consider F = {f f : R R}, the set of functions from R to R It can be shown that F is neither countable, nor the continuum It is evident from the proof above that the size of the continuum is in some sense larger than countable, this raises the question of whether there are any infinities in between these two? Nobody has been able to find one, but nobody has been able to show that one does not exist In fact in 963 Paul Cohen (934 - ) showed that this question is undecidable, and so when dealing with transfinite numbers it is necessary to take as an axiom that there is no infinity between the countable and the continuum, this is known as the continuum hypothesis Of course we can equally well make the opposite assumption that there is such an infinity, each gives rise to a different mathematical system 6

Cantor and Infinite Sets

Cantor and Infinite Sets Cantor and Infinite Sets Galileo and the Infinite There are many whole numbers that are not perfect squares: 2, 3, 5, 6, 7, 8, 10, 11, and so it would seem that all numbers, including both squares and

More information

To Infinity and Beyond

To Infinity and Beyond University of Waterloo How do we count things? Suppose we have two bags filled with candy. In one bag we have blue candy and in the other bag we have red candy. How can we determine which bag has more

More information

One-to-one functions and onto functions

One-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 information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27

Discrete 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 information

The Different Sizes of Infinity

The Different Sizes of Infinity The Different Sizes of Infinity New York City College of Technology Cesar J. Rodriguez November 11, 2010 A Thought to Ponder At... Does Infinity Come in Varying Sizes? 2 Points of Marked Interest(s) General

More information

ECS 120 Lesson 18 Decidable Problems, the Halting Problem

ECS 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 information

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Math 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 information

Section 7.5: Cardinality

Section 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 information

Section Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence

Section 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 information

2 Exercises 1. The following represent graphs of functions from the real numbers R to R. Decide which are one-to-one, which are onto, which are neithe

2 Exercises 1. The following represent graphs of functions from the real numbers R to R. Decide which are one-to-one, which are onto, which are neithe Infinity and Counting 1 Peter Trapa September 28, 2005 There are 10 kinds of people in the world: those who understand binary, and those who don't. Welcome to the rst installment of the 2005 Utah Math

More information

The 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) 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 information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

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 information

CSE 20 Discrete Math. Winter, January 24 (Day 5) Number Theory. Instructor: Neil Rhodes. Proving Quantified Statements

CSE 20 Discrete Math. Winter, January 24 (Day 5) Number Theory. Instructor: Neil Rhodes. Proving Quantified Statements CSE 20 Discrete Math Proving Quantified Statements Prove universal statement: x D, P(x)Q(x) Exhaustive enumeration Generalizing from the generic particular Winter, 2006 Suppose x is in D and P(x) Therefore

More information

CITS2211 Discrete Structures (2017) Cardinality and Countability

CITS2211 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 information

1 Partitions and Equivalence Relations

1 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 information

Are All Infinities Created Equal?

Are All Infinities Created Equal? Are All Infinities Created Equal? Guram Bezhanishvili Georg Ferdinand Ludwig Philip Cantor (1845 1918), the founder of set theory, and considered by many as one of the most original minds in the history

More information

Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability.

Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability. Today. Wrapup of Polynomials...and modular arithmetic. Coutability and Uncountability. Reed-Solomon code. Problem: Communicate n packets m 1,...,m n on noisy channel that corrupts k packets. Reed-Solomon

More information

CSE 311: Foundations of Computing. Lecture 26: Cardinality

CSE 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 information

Space Complexity. then the space required by M on input x is. w i u i. F ) on. September 27, i=1

Space Complexity. then the space required by M on input x is. w i u i. F ) on. September 27, i=1 Space Complexity Consider a k-string TM M with input x. Assume non- is never written over by. a The purpose is not to artificially reduce the space needs (see below). If M halts in configuration (H, w

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 20. To Infinity And Beyond: Countability and Computability

Discrete 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 information

Reed-Solomon code. P(n + 2k)

Reed-Solomon code. P(n + 2k) Reed-Solomon code. Problem: Communicate n packets m 1,...,m n on noisy channel that corrupts k packets. Reed-Solomon Code: 1. Make a polynomial, P(x) of degree n 1, that encodes message: coefficients,

More information

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 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 information

Algorithms: Lecture 2

Algorithms: 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 information

We 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

We 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 information

Extended Essay - Mathematics

Extended 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 information

Undecidability. Andreas Klappenecker. [based on slides by Prof. Welch]

Undecidability. 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 information

CS 361 Meeting 26 11/10/17

CS 361 Meeting 26 11/10/17 CS 361 Meeting 26 11/10/17 1. Homework 8 due Announcements A Recognizable, but Undecidable Language 1. Last class, I presented a brief, somewhat inscrutable proof that the language A BT M = { M w M is

More information

CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides

CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given

More information

Turing Machines, diagonalization, the halting problem, reducibility

Turing 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 information

Definition: 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.

Definition: 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 information

Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely Important in Computer Science

Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely Important in Computer Science Little progress would be made in the world if we were always afraid of possible negative consequences. Georg Christoph Lichtenberg Chapter Infinity Is Not Equal to Infinity, or Why Infinity Is Infinitely

More information

1 Reals are Uncountable

1 Reals are Uncountable CS 30: Discrete Math in CS (Winter 2019): Lecture 6 Date: 11th January, 2019 (Friday) Topic: Uncountability and Undecidability Disclaimer: These notes have not gone through scrutiny and in all probability

More information

Most Merry and Illustrated Proof of Cantor's Theorem on the Countability of Integers (Concise Version)

Most 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 information

Let us first solve the midterm problem 4 before we bring up the related issues.

Let us first solve the midterm problem 4 before we bring up the related issues. Math 310 Class Notes 6: Countability Let us first solve the midterm problem 4 before we bring up the related issues. Theorem 1. Let I n := {k N : k n}. Let f : I n N be a one-toone function and let Im(f)

More information

Solutions to Tutorial for Week 4

Solutions to Tutorial for Week 4 The University of Sydney School of Mathematics and Statistics Solutions to Tutorial for Week 4 MATH191/1931: Calculus of One Variable (Advanced) Semester 1, 018 Web Page: sydneyeduau/science/maths/u/ug/jm/math191/

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In 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 information

Math.3336: Discrete Mathematics. Cardinality of Sets

Math.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 information

Discrete Mathematics 2007: Lecture 5 Infinite sets

Discrete 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 information

1 of 8 7/15/2009 3:43 PM Virtual Laboratories > 1. Foundations > 1 2 3 4 5 6 7 8 9 6. Cardinality Definitions and Preliminary Examples Suppose that S is a non-empty collection of sets. We define a relation

More information

Countability. 1 Motivation. 2 Counting

Countability. 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 information

Outside ZF - Set Cardinality, the Axiom of Choice, and the Continuum Hypothesis

Outside 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 information

Farewell (for now) to modular arithmetic...

Farewell (for now) to modular arithmetic... Today. Farewell to modular arithmetic. Until the midterm. And final. Coutability and Uncountability. Undecidability. How big are the reals or the integers? Farewell (for now) to modular arithmetic... Modular

More information

MATH 3300 Test 1. Name: Student Id:

MATH 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 information

Undecidability. We are not so much concerned if you are slow as when you come to a halt. (Chinese Proverb)

Undecidability. We are not so much concerned if you are slow as when you come to a halt. (Chinese Proverb) We are not so much concerned if you are slow as when you come to a halt. (Chinese Proverb) CS /55 Theory of Computation The is A TM = { M,w M is a TM and w L(M)} A TM is Turing-recognizable. Proof Sketch:

More information

Discrete 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 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 information

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs

Math /Foundations of Algebra/Fall 2017 Foundations of the Foundations: Proofs Math 4030-001/Foundations of Algebra/Fall 017 Foundations of the Foundations: Proofs A proof is a demonstration of the truth of a mathematical statement. We already know what a mathematical statement is.

More information

CSCI3390-Lecture 6: An Undecidable Problem

CSCI3390-Lecture 6: An Undecidable Problem CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or

More information

Great Theoretical Ideas in Computer Science. Lecture 5: Cantor s Legacy

Great 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 information

What is proof? Lesson 1

What is proof? Lesson 1 What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might

More information

MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets

MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets 1 Rational and Real Numbers Recall that a number is rational if it can be written in the form a/b where a, b Z and b 0, and a number

More information

CSE 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 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 information

CS 125 Section #10 (Un)decidability and Probability November 1, 2016

CS 125 Section #10 (Un)decidability and Probability November 1, 2016 CS 125 Section #10 (Un)decidability and Probability November 1, 2016 1 Countability Recall that a set S is countable (either finite or countably infinite) if and only if there exists a surjective mapping

More information

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.

Mathematics 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 information

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.

Announcements. 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 information

2 Computable and Computably Enumerable Sets

2 Computable and Computably Enumerable Sets Notes For CMSC 650- COMPUTABILITY by A.Amir and W.I. Gasarch 1 Introduction We take our model of computation to be Java Programs. Traditionally one defines Turing Machines and we will use that terminology,

More information

Finite and Infinite Sets

Finite 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 information

Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction

Basic 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 information

MA 301 Test 4, Spring 2007

MA 301 Test 4, Spring 2007 MA 0 Test 4, Spring 007 hours, calculator allowed, no notes. Provide paper for the students to do work on. Students should not write answers on test sheet. TA Grades, 5, 6, 7 All answers must be justified.

More information

Chapter 20. Countability The rationals and the reals. This chapter covers infinite sets and countability.

Chapter 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 information

CSE 311: Foundations of Computing. Lecture 26: Cardinality, Uncomputability

CSE 311: Foundations of Computing. Lecture 26: Cardinality, Uncomputability CSE 311: Foundations of Computing Lecture 26: Cardinality, Uncomputability Last time: Languages and Representations All 0*? Context-Free e.g. palindromes, balanced parens, {0 n 1 n :n 0} Regular Finite

More information

2.2 Lowenheim-Skolem-Tarski theorems

2.2 Lowenheim-Skolem-Tarski theorems Logic SEP: Day 1 July 15, 2013 1 Some references Syllabus: http://www.math.wisc.edu/graduate/guide-qe Previous years qualifying exams: http://www.math.wisc.edu/ miller/old/qual/index.html Miller s Moore

More information

CSE 20 DISCRETE MATH. Fall

CSE 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 information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In 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 information

Section 2.5 : The Completeness Axiom in R

Section 2.5 : The Completeness Axiom in R Section 2.5 : The Completeness Axiom in R The rational numbers and real numbers are closely related. The set Q of rational numbers is countable and the set R of real numbers is not, and in this sense there

More information

1.3. The Completeness Axiom.

1.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 information

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Sets 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 information

Undecibability. Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not.

Undecibability. Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not. Undecibability Hilbert's 10th Problem: Give an algorithm that given a polynomial decides if the polynomial has integer roots or not. The problem was posed in 1900. In 1970 it was proved that there can

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences

More information

Some. AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability

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 Probability 15-251 Some AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Infinity

More information

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible.

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible. Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 1.4.2, 1.4.4, 1.4.9, 1.4.11,

More information

Lecture Notes: The Halting Problem; Reductions

Lecture 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 information

TURING MAHINES

TURING MAHINES 15-453 TURING MAHINES TURING MACHINE FINITE STATE q 10 CONTROL AI N P U T INFINITE TAPE read write move 0 0, R, R q accept, R q reject 0 0, R 0 0, R, L read write move 0 0, R, R q accept, R 0 0, R 0 0,

More information

Undecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK

Undecidability COMS Ashley Montanaro 4 April Department of Computer Science, University of Bristol Bristol, UK COMS11700 Undecidability Department of Computer Science, University of Bristol Bristol, UK 4 April 2014 COMS11700: Undecidability Slide 1/29 Decidability We are particularly interested in Turing machines

More information

VISUALIZATION OF INTUITIVE SET THEORY

VISUALIZATION OF INTUITIVE SET THEORY VISUALIZATION OF INTUITIVE SET THEORY K K NAMBIAR Abstract Ackermann functions are used recursively to define the transfinite cardinals of Cantor Continuum Hypothesis and Axiom of Choice are derived from

More information

Solution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c])

Solution Set 2. Problem 1. [a] + [b] = [a + b] = [b + a] = [b] + [a] ([a] + [b]) + [c] = [a + b] + [c] = [a + b + c] = [a] + [b + c] = [a] + ([b + c]) Solution Set Problem 1 (1) Z/nZ is the set of equivalence classes of Z mod n. Equivalence is determined by the following rule: [a] = [b] if and only if b a = k n for some k Z. The operations + and are

More information

Study skills for mathematicians

Study skills for mathematicians PART I Study skills for mathematicians CHAPTER 1 Sets and functions Everything starts somewhere, although many physicists disagree. Terry Pratchett, Hogfather, 1996 To think like a mathematician requires

More information

Lecture 3: Sizes of Infinity

Lecture 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 information

FACTORIZATION AND THE PRIMES

FACTORIZATION AND THE PRIMES I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary

More information

Sets and Infinity. James Emery. Edited: 2/25/ Cardinal Numbers 1. 2 Ordinal Numbers 6. 3 The Peano Postulates for the Natural Numbers 7

Sets and Infinity. James Emery. Edited: 2/25/ Cardinal Numbers 1. 2 Ordinal Numbers 6. 3 The Peano Postulates for the Natural Numbers 7 Sets and Infinity James Emery Edited: 2/25/2017 Contents 1 Cardinal Numbers 1 2 Ordinal Numbers 6 3 The Peano Postulates for the Natural Numbers 7 4 Metric Spaces 8 5 Complete Metric Spaces 8 6 The Real

More information

LIMITS AND DERIVATIVES

LIMITS AND DERIVATIVES 2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES 2.2 The Limit of a Function In this section, we will learn: About limits in general and about numerical and graphical methods for computing them. THE LIMIT

More information

Obsevations, Truth and Logic

Obsevations, Truth and Logic Obsevations, Truth and Logic Jaap van Oosten Department of Mathematics Utrecht University Axioma, Groningen May 9, 2018 Art and Science have the same basic subject matter: Observations. Art (visual art):

More information

Solutions to Homework Assignment 2

Solutions 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 information

Assignment #2 COMP 3200 Spring 2012 Prof. Stucki

Assignment #2 COMP 3200 Spring 2012 Prof. Stucki Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII

More information

Chapter One. The Real Number System

Chapter One. The Real Number System Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and

More information

LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS

LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS 1. Introduction To end the course we will investigate various notions of size associated to subsets of R. The simplest example is that of cardinality - a very

More information

Functions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014

Functions 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 information

Cardinality of sets. Cardinality of sets

Cardinality 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 information

Computability, Undeciability and the Halting Problem

Computability, Undeciability and the Halting Problem Computability, Undeciability and the Halting Problem 12/01/16 http://www.michael-hogg.co.uk/game_of_life.php Discrete Structures (CS 173) Lecture B Gul Agha 1 Based on slides by Derek Hoiem, University

More information

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called

More information

Comparing Infinite Sets

Comparing Infinite Sets University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln MAT Exam Expository Papers Math in the Middle Institute Partnership 7-2006 Comparing Infinite Sets Julie M. Kreizel University

More information

MAT335H1F Lec0101 Burbulla

MAT335H1F Lec0101 Burbulla Fall 2011 Q 2 (x) = x 2 2 Q 2 has two repelling fixed points, p = 1 and p + = 2. Moreover, if I = [ p +, p + ] = [ 2, 2], it is easy to check that p I and Q 2 : I I. So for any seed x 0 I, the orbit of

More information

Hilbert s problems, Gödel, and the limits of computation

Hilbert s problems, Gödel, and the limits of computation Hilbert s problems, Gödel, and the limits of computation Logan Axon Gonzaga University November 14, 2013 Hilbert at the ICM At the 1900 International Congress of Mathematicians in Paris, David Hilbert

More information

INTRODUCTION TO CARDINAL NUMBERS

INTRODUCTION 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 information

Cardinality and ordinal numbers

Cardinality 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 information

To Infinity and Beyond. To Infinity and Beyond 1/43

To Infinity and Beyond. To Infinity and Beyond 1/43 To Infinity and Beyond To Infinity and Beyond 1/43 Infinity The concept of infinity has both fascinated and frustrated people for millennia. We will discuss some historical problems about infinity, some

More information

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

Functions. 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 information

Countable and uncountable sets. Matrices.

Countable and uncountable sets. Matrices. CS 441 Discrete Mathematics for CS Lecture 11 Countable and uncountable sets. Matrices. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Arithmetic series Definition: The sum of the terms of the

More information

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost

More information

14 Uncountable Sets(Denial of Self Recursion)

14 Uncountable Sets(Denial of Self Recursion) 14 Uncountable Sets(Denial of Self Recursion) 14.1 Countable sets Def. 1 Two sets A and B are isomorphic with respect to the bijective function f, iff a bijection f: A B, written A f B or for shorta B.

More information

QUESTION ONE (15 points each for 75 points total) For each of the following sets, say if the set is:

QUESTION ONE (15 points each for 75 points total) For each of the following sets, say if the set is: HW 6, CMSC 452. Morally DUE Mar 27 This HW is 200 points and counts twice as much as other HW This HW is THREE PAGES LONG (To make the midterm SHORTER, and to give you a break, there was NOT a question

More information