Countability. Jason Filippou UMCP. Jason Filippou UMCP) Countability / 12

Similar documents
CSE 20 DISCRETE MATH. Fall

Cardinality and Bijections

Cardinality. Hebrew alphabet). We write S = ℵ 0 and say that S has cardinality aleph null.

Cardinality revisited

Finite and Infinite Sets

DVA325 Formal Languages, Automata and Models of Computation (FABER)

Beyond Infinity? Joel Feinstein. School of Mathematical Sciences University of Nottingham

1. Functions and set sizes 2. Infinite set sizes. ! Let X,Y be finite sets, f:x!y a function. ! Theorem: If f is injective then X Y.

Final exam. Question Points Score. Total: 150

MATHEMATICS 152, FALL 2004 METHODS OF DISCRETE MATHEMATICS Outline #10 (Sets and Probability)

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

CITS2211 Discrete Structures Turing Machines

29. Army Housing (a) (b) (c) (d) (e) (f ) Totals Totals (a) (b) (c) (d) (e) (f) Basketball Positions 32. Guard Forward Center

Göttlers Proof of the Collatz Conjecture

MC215: MATHEMATICAL REASONING AND DISCRETE STRUCTURES

Outline. Sets of Gluing Data. Constructing Manifolds. Lecture 3 - February 3, PM

The Real Number System and Pythagorean Theorem Unit 9 Part B

Theory of Probability - Brett Bernstein

Math 127: Equivalence Relations

Hausdorff dimension in groups acting on trees

Notes for Recitation 3

Section Summary. Permutations Combinations Combinatorial Proofs

ECS 20 (Spring 2013) Phillip Rogaway Lecture 1

Math 3560 HW Set 6. Kara. October 17, 2013

What is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?

CLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.

Counting integral solutions

MATHEMATICS ON THE CHESSBOARD

Cardinality of Accumulation Points of Infinite Sets

Modular Arithmetic. Kieran Cooney - February 18, 2016

Introduction to Computational Manifolds and Applications

Topics to be covered

Pattern Avoidance in Unimodal and V-unimodal Permutations

Sec$on Summary. Permutations Combinations Combinatorial Proofs

SOLUTIONS FOR PROBLEM SET 4

Rational Points On Elliptic Curves - Solutions. (i) Throughout, we ve been looking at elliptic curves in the general form. y 2 = x 3 + Ax + B

Sequential games. We may play the dating game as a sequential game. In this case, one player, say Connie, makes a choice before the other.

Sets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set

Math 232. Calculus III Limits and Continuity. Updated: January 13, 2016 Calculus III Section 14.2

5 Symmetric and alternating groups

Sheet 1: Introduction to prime numbers.

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

An elementary study of Goldbach Conjecture

University of British Columbia. Math 312, Midterm, 6th of June 2017

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

ALGEBRA: Chapter I: QUESTION BANK

TILLING A DEFICIENT RECTANGLE WITH T-TETROMINOES. 1. Introduction

Ma/CS 6a Class 16: Permutations

Monotone Sequences & Cauchy Sequences Philippe B. Laval

Which Rectangular Chessboards Have a Bishop s Tour?

Topology and its Applications

#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick

Halting Problem. Implement HALT? Today. Halt does not exist. Halt and Turing. Another view of proof: diagonalization. P - program I - input.

The Tilings of Deficient Squares by Ribbon L-Tetrominoes Are Diagonally Cracked

Permutation classes and infinite antichains

Permutation Groups. Definition and Notation

Colouring tiles. Paul Hunter. June 2010

and problem sheet 7

LECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.

Automorphisms of Graphs Math 381 Spring 2011

Senior Math Circles February 10, 2010 Game Theory II

Section 8.1. Sequences and Series

QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES

THE PIGEONHOLE PRINCIPLE. MARK FLANAGAN School of Electrical and Electronic Engineering University College Dublin

THE GAME CREATION OPERATOR

On Variants of Nim and Chomp

On uniquely k-determined permutations

Sets. Definition A set is an unordered collection of objects called elements or members of the set.

Solution: This is sampling without repetition and order matters. Therefore

18.204: CHIP FIRING GAMES

Pre-Test Unit 7: Real Numbers KEY

Counting. Chapter 6. With Question/Answer Animations

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions

Class 8 - Sets (Lecture Notes)

LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE

The pairing strategies of the 9-in-a-row game

Lecture 1, CS 2050, Intro Discrete Math for Computer Science

MUMS seminar 24 October 2008

X = {1, 2,...,n} n 1f 2f 3f... nf

Enumeration of Pin-Permutations

Equivalence classes of length-changing replacements of size-3 patterns

It is important that you show your work. The total value of this test is 220 points.

1111: Linear Algebra I

Discrete Mathematics. Spring 2017

G5212: Game Theory. Mark Dean. Spring 2017

Norman Do. The Art of Tiling with Rectangles. 1 Checkerboards and Dominoes

NOT QUITE NUMBER THEORY

Extensive Games with Perfect Information. Start by restricting attention to games without simultaneous moves and without nature (no randomness).

REU 2006 Discrete Math Lecture 3

An Aperiodic Tiling from a Dynamical System: An Exposition of An Example of Culik and Kari. S. Eigen J. Navarro V. Prasad

Math 454 Summer 2005 Due Wednesday 7/13/05 Homework #2. Counting problems:

THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL

Combinatorics in the group of parity alternating permutations

Reading 14 : Counting

Directed Towers of Hanoi

Grade 7/8 Math Circles Game Theory October 27/28, 2015

Ivan Guo. Broken bridges There are thirteen bridges connecting the banks of River Pluvia and its six piers, as shown in the diagram below:

Lecture 18 - Counting

Grade 7/8 Math Circles February 21 st /22 nd, Sets

Transcription:

Countability Jason Filippou CMSC250 @ UMCP 06-23-2016 Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 1 / 12

Outline 1 Infinity 2 Countability of integers and rationals 3 Uncountability of R Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 2 / 12

Infinity Infinity Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 3 / 12

Infinite sets Infinity Definition (Finite set) Let n N. A set A is called finite if and only if: 1 A =, or 2 There exists a bijection from the set {1, 2,..., n} to A. Definition (Infinite set) A set A is called infinite if, and only if, it is not finite. Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 4 / 12

Countable sets Infinity Definition (Countable set) Let A be any set. A is countable if, and only if: 1 A is finite, or 2 There exists a bijection from N to A. Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 5 / 12

Countable sets Infinity Definition (Countable set) Let A be any set. A is countable if, and only if: 1 A is finite, or 2 There exists a bijection from N to A. In the second case, A can also be called countably infinite. Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 5 / 12

Countable sets Infinity Definition (Countable set) Let A be any set. A is countable if, and only if: 1 A is finite, or 2 There exists a bijection from N to A. In the second case, A can also be called countably infinite. Definition (Uncountable set) A set A is called uncountable if, and only if, it is not countable. Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 5 / 12

Countability of integers and rationals Countability of integers and rationals Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 6 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3... Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3...... 7 5 3 1 2 4 6... Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3...... 7 5 3 1 2 4 6... Let s call this function f. We can make the following observations about f: Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3...... 7 5 3 1 2 4 6... Let s call this function f. We can make the following observations about f: 1 No integer is counted twice! So, f is...? Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3...... 7 5 3 1 2 4 6... Let s call this function f. We can make the following observations about f: 1 No integer is counted twice! So, f is...? 1-1. 2 All integers are (eventually) accounted for! So, f is...? ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3...... 7 5 3 1 2 4 6... Let s call this function f. We can make the following observations about f: 1 No integer is counted twice! So, f is...? 1-1. 2 All integers are (eventually) accounted for! So, f is...? onto. ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Z is countable Countability of integers and rationals... 3 2 1 0 1 2 3...... 7 5 3 1 2 4 6... Let s call this function f. We can make the following observations about f: 1 No integer is counted twice! So, f is...? 1-1. 2 All integers are (eventually) accounted for! So, f is...? onto. From (1) and (2) we can deduce that the function is a bijection, and Z is countable. ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 7 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6... ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6...... 3 2 1 0 1 2 3... ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6...... 3 2 1 0 1 2 3... Call this function g. ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6...... 3 2 1 0 1 2 3... Call this function g. Is g onto? ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6...... 3 2 1 0 1 2 3... Call this function g. Is g onto? Is g 1-1? ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6...... 3 2 1 0 1 2 3... Call this function g. Is g onto? Is g 1-1? Therefore, g is a bijection from Z to Z even. ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Z even is countable... 6 4 2 0 2 4 6...... 3 2 1 0 1 2 3... Call this function g. Is g onto? Is g 1-1? Therefore, g is a bijection from Z to Z even. So gof is a bijection from N to Z even (formally prove at home)! Therefore, Z even is countable. ason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 8 / 12

Countability of integers and rationals Is Q + countable? Reminder: Q + = { m n, m, N, n N } Discuss it with your neighbors for a while! Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 9 / 12

Uncountability of R Uncountability of R Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 10 / 12

Uncountability of R Cantor s diagonal argument Famous proof by contradiction. Method known as diagonalization, or the diagonal argument. Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 11 / 12

Uncountability of R The proof Theorem R is uncountable. By contradiction. Suppose that R is countable. This means that we can order all the reals in a list, as follows: 0.a 11 a 12 a 13... 0.a 21 a 22 a 23... 0.a 31 a 32 a 33.... Let us now create a real number r with decimal digits r i, which will be populated as follows: { 0, aii = 9 r i = a ii + 1, 0 a ii < 9 By construction, r is different from all real numbers that we listed, since it s guaranteed to be different from the i th number at the i th decimal digit, where i = 1, 2,.... Contradiction, because we assumed that we sequentially listed all the real numbers inside this very list. Therefore, R is uncountable. Jason Filippou (CMSC250 @ UMCP) Countability 06-23-2016 12 / 12