2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA.

Slides:



Advertisements
Similar presentations
COUNTING AND PROBABILITY
Advertisements

Ch. 10: What is a number?. MAIN DEFINITION OF THE COURSE: A symmetry of an object (in the plane or space) means a rigid motion (of the plane or space)
1 COMP 382: Reasoning about algorithms Unit 9: Undecidability [Slides adapted from Amos Israeli’s]
Whiteboardmaths.com © 2004 All rights reserved
Section 1.6: Sets Sets are the most basic of discrete structures and also the most general. Several of the discrete structures we will study are built.
Copyright © Cengage Learning. All rights reserved.
Infinity and the Limits of Mathematics Manchester High School for Girls Friday 30 th September 2011 Dr Richard Elwes, University of Leeds.
Real Number System. The real number system evolved over time by expanding the notion of what we mean by the word “number.” At first, “number” meant something.
Functions, Pigeonhole Principle Lecture 14: Nov 4 A B f( ) =
Introduction to Computability Theory
Great Theoretical Ideas in Computer Science.
∞Exploring Infinity ∞ By Christopher Imm Johnson County Community College.
CSE115/ENGR160 Discrete Mathematics 02/07/12
CHAPTER 4 Decidability Contents Decidable Languages
Sequence A list of objects arranged in a particular order.
Lecture ,3.3 Sequences & Summations Proof by Induction.
1 Introduction to Computability Theory Lecture11: The Halting Problem Prof. Amos Israeli.
APPLICATIONS OF DIFFERENTIATION 4. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.
Converting Repeating Decimals to Fractions
The Real Number System. The natural numbers are the counting numbers, without _______. Whole numbers include the natural numbers and ____________. Integers.
Great Theoretical Ideas in Computer Science.
Cantor’s Legacy: Infinity And Diagonalization Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 25Apr 13, 2004Carnegie.
Classification of Numbers
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
Cardinality of Sets Section 2.5.
THE NATURE OF SETS Copyright © Cengage Learning. All rights reserved. 2.
Copyright © Cengage Learning. All rights reserved. 0 Precalculus Review.
Real Numbers Week 1 Topic 1. Real Numbers  Irrational Numbers  Numbers that cannot be written as a fraction  √2, π  Rational Numbers  Numbers that.
1 How Big Is Infinity? Some Mathematical Surprises Roger House Scientific Buzz Café French Garden Restaurant & Bistro Sebastopol, CA 2013 July 25 Copyright.
____________________ Examples:  All the numbers that can be written as fractions. Each fraction must have a nonzero denominator.  Rational numbers can.
Copyright © Cengage Learning. All rights reserved. 3 Applications of Differentiation.
MATH 224 – Discrete Mathematics
LIMITS AND DERIVATIVES 2. In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The.
APPLICATIONS OF DIFFERENTIATION 4. A polynomial behaves near infinity as its term of highest degree. The polynomial behaves like the polynomial Near infinity.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
In Sections 2.2 and 2.4, we investigated infinite limits and vertical asymptotes.  There, we let x approach a number.  The result was that the values.
Precalculus Complex Zeros V. J. Motto. Introduction We have already seen that an nth-degree polynomial can have at most n real zeros. In the complex number.
Paradoxes of the Infinite Kline XXV Pre-May Seminar March 14, 2011.
Cantor and Countability: A look at measuring infinities How BIG is big? = a Googol 10 googol = a Googolplex = one Tremilliomilliotrecentrecentre.
Copyright © Cengage Learning. All rights reserved. 2 Limits and Derivatives.
Copyright © Cengage Learning. All rights reserved. CHAPTER 7 FUNCTIONS.
Ch. 11: Cantor’s Infinity!. N = {1, 2, 3, 4, 5, 6, …} “the natural numbers” Z = {…, –3, –2, –1, 0, 1, 2, 3, …} “the integers” Q = {all quotients “a/b”
Limits and Derivatives
Copyright © 2014 Curt Hill Cardinality of Infinite Sets There be monsters here! At least serious weirdness!
Section 3.1 Beyond Numbers What Does Infinity Mean?
A Brief Introduction to Set Theory. How Many Things?
8.4 Mathematical Induction
Donald Byrd rev. 28 November 2012
COMPSCI 102 Introduction to Discrete Mathematics.
Aim: How can the word ‘infinite’ define a collection of elements?
NUMBER SYSTEMS TWSSP Wednesday. Wednesday Agenda Finish our work with decimal expansions Define irrational numbers Prove the existence of irrationals.
Activity 1-17: Infinity.
Stupid questions? Are there more integers than even integers?
I dare you not to get excited when you read Cantor’s Diagonal Proof: Georg Cantor was the most important mathematician no one has ever heard of. He did.
Great Theoretical Ideas in Computer Science.
Lecture 4 Infinite Cardinals. Some Philosophy: What is “2”? Definition 1: 2 = 1+1. This actually needs the definition of “1” and the definition of the.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
Copyright © Cengage Learning. All rights reserved. 3 Applications of Differentiation.
Great Theoretical Ideas in Computer Science about AWESOME Some Generating Functions Probability.
To Infinity And Beyond! CS Lecture 11 The Ideal Computer: no bound on amount of memory Whenever you run out of memory, the computer contacts the.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
CompSci Today’s Topics Computer Science Noncomputability Upcoming Special Topic: Enabled by Computer -- Decoding the Human Genome Reading Great.
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
The Acceptance Problem for TMs
Discrete Structures for Computer Science
Rational and Irrational
Activating Prior Knowledge –
Formal Languages, Automata and Models of Computation
Presentation transcript:

2, , and Beyond Debra S. Carney Mathematics Department University of Denver April 11, 2008 Sonya Kovalevsky Day - CCA

Dodge Ball Lets play Dodge Ball! Mathematical Dodge Ball, that is.

Rules of the Game Is there a winning strategy for Player 1? That is, can Player 1 always win the game if she plays by her strategy? How about Player 2?

Winning Strategy? Player 2 can always win Dodge Ball! Today, we will see how the winning strategy for Dodge Ball is related to sizes of infinity.

Same Size Do these two collections of smiley faces have the same size? ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ ☺ Notice that we can (quickly) say “yes” without having to count the number of smiley faces in each row. This exactly the idea of 1-1 correspondence. 1 2

1-1 Correspondence Two collections that can be paired evenly (with no leftovers) are said to be in 1-1 correspondence. {♠, ♣, ♥, ♦} {a, b, c, d} There may be many ways to make the pairing, however we only need to find one.

Same Size Oath We need to agree on the following. Two sets have the same size if there exists a 1-1 correspondence between both sets. Remember, we are not “counting”, we are making a pairing. If we can make the pairing then two sets must have the same size.

The Natural Numbers N N ={1, 2, 3, 4, 5, …….} is called the set of natural (or counting) numbers. This is an infinite set. We will ask do all infinite sets have the same size? We will compare the size of some infinite sets to the natural numbers and observe some interesting behavior along the way.

Finite Sets We will call a set A finite if there is a 1- 1 correspondence between A and the set {1, 2, 3, …., n} for some natural number n. Example: {♠, ♣, ♥, ♦} is finite due to the 1-1 correspondence with {1, 2, 3, 4} as seen previously.

Infinite Sets If a set is not finite we will call it infinite. We could ask: “Do all infinite sets have the same size?” We will compare the size of some infinite sets to the natural numbers and observe some interesting behavior along the way.

Examples with N ={1, 2, 3, 4, 5, …} Does {2, 3, 4, 5, 6, ……} have the same size as N ? Yes! We can find a 1-1 correspondence. {1, 2, 3, 4, 5, ……} {2, 3, 4, 5, 6, ……}

Examples with N ={1, 2, 3, 4, 5, …} Does {2, 4, 6, 8, ……} have the same size as N ? Yes! We can find a 1-1 correspondence. {1, 2, 3, 4, 5, ……} {2, 4, 6, 8, 10, ……}

The Integers Z ={…, -3, -2, -1, 0, 1, 2, 3, …} Do the Integers have the same size as N ? Is this a good 1-1 correspondence? { 1, 2, 3, 4, 5, ……} {…, -3, -2, -1, 0, 1, ……} No: There are (infinitely) many integers without a partner.

The Integers Z ={…, -3, -2, -1, 0, 1, 2, 3, …} Does that mean the integers are not the same size as N ? Not necessarily. Perhaps we did not find the correspondence yet and in fact that is happening here. Consider this “rearrangement” of the integers: Z ={0, 1, -1, 2, -2, 3, -3, …}

Can we know find a 1-1 correspondence between N and Z ? Yes! {1, 2, 3, 4, 5, ……} {0, 1, -1,2, -2, ……} Thus N and Z have the same size!

The Rational Numbers Q ={a/b : a,b are in Z and b≠0} The rational numbers are the infinite set of fractional numbers. Examples: 0/3, 99/7, -5/3, 15/-2, 5/5, … Do the rationals have the same size as N ? (Surprisingly?) Yes! To find the correspondence we need to “list” the rational numbers in the right way.

Q ={a/b : a,b are in N and b≠0} We have found a 1-1 correspondence between Q and N

Are all Infinities the same? So far it seems as if all infinite sets are the same size as the natural numbers. In 1891, Georg Cantor proved the contrary. He showed that the real numbers have larger size than the natural numbers

The Real Numbers ( R ) The set of real numbers refers to all possible infinite decimal representations. 5/1 = …… 7/11 = ….. 3/2 = ….  = …. Sqrt(2)= …..

Reals ( R ) versus Rationals ( Q ) The rational numbers correspond exactly to the decimals that repeat. For example: 7/11 and 3/2 are rational numbers (and real numbers as well). There are decimal expansions that do not repeat. Those numbers are real (but not rational) numbers. For example:  and Sqrt(2).

Cantor’s Theorem (1891): The size of the real numbers R is larger than that of the natural numbers N. At the time of its publication the idea was quite shocking to most mathematicians of the day.

Cantor’s Revolutionary Idea Assume that we do have a 1-1 correspondence between R and N. Then find a real number M that cannot appear on the list of real numbers. (M for “missing”)

Cantor’s Revolutionary Idea Since M cannot be on the list of real numbers, we cannot have a true 1-1 correspondence. (No leftovers!) Since this will work for any potential 1-1 pairing, then no such pairing can exist!

Cantor’s Diagonal Argument. Here is a potential 1-1 correspondence between N and R. Play “dodge ball” to find M.

Cantor’s Diagonal Argument M cannot be on the list of real numbers and thus we did not have a 1-1 correspondence. This is true of any potential 1-1 correspondence. Thus R is “bigger” than N

There is no limit to  There are sets that are “bigger” than R. Cantor in fact showed how given any infinite set to create a new set of a larger size of infinity. Conclusion: There are infinitely many sizes of infinity!   