Slide 1

Slide 1 text

Class 17: Infinite Sets cs2102: Discrete Mathematics | F17 uvacs2102.github.io David Evans Mohammad Mahmoody University of Virginia

Slide 2

Slide 2 text

Plan for today – Defining Infinite Sets – How to compare size/cardinality of infinite sets. – Today: countable sets – [Thursday: uncountable sets]

Slide 3

Slide 3 text

Cardinality of Finite Sets 2 The cardinality of the set = ∈ ℕ ∧ < } is . If there is a bijection between two sets, they have the same cardinality. from Class 9:

Slide 4

Slide 4 text

Infinite Sets 3 The cardinality of the set ℕ = ∈ ℕ ∧ < } is . If there is a bijection between two sets, they have the same cardinality. A set is infinite, if there is no bijection between and any ℕ .

Slide 5

Slide 5 text

Infinities before 1800’s 4

Slide 6

Slide 6 text

Will Class Ever End? 5 1 2 + 1 4 + 1 8 + ⋯ =

Slide 7

Slide 7 text

Zeno’s Paradox 6 0 50m 100m

Slide 8

Slide 8 text

7 Newton’s Differential Calculus (1671, published 1742) Leibniz’s Calculus (1684)

Slide 9

Slide 9 text

8 Georg Cantor (1845-1918) “corruptor of youth” Leopold Kronecker “utter nonsense” Ludwig Wittgenstein “grave disease” Henri Poincaré

Slide 10

Slide 10 text

Cardinality of Finite Sets 9 The cardinality of the set ℕ = ∈ ℕ ∧ < } is . If there is a bijection between two sets, they have the same cardinality. from Class 9:

Slide 11

Slide 11 text

Infinite Sets 10 The cardinality of the set ℕ = ∈ ℕ ∧ < } is . If there is a bijection between two sets, they have the same cardinality. A set is infinite, if there is no bijection between and any ℕ .

Slide 12

Slide 12 text

11

Slide 13

Slide 13 text

How to talk about size of Infinite Sets? 12

Slide 14

Slide 14 text

Same Cardinality of Infinite Sets 13 If there exists a bijection between sets and , they have the same cardinality: || = ||

Slide 15

Slide 15 text

14

Slide 16

Slide 16 text

Also we can compare Cardinality of Infinite Sets 15 If there exists a surjective function from sets to , then we say ≤ ||

Slide 17

Slide 17 text

Two Useful Facts 1. || = || implies || ≤ || and ≤ || 2. If ≤ || and || ≤ || then = || proof? Not easy.. Schroder-Bernstein theorem.. 16

Slide 18

Slide 18 text

Dedekind’s Definition of Infinite Sets 17 Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. Standard Def. A set is infinite, if there is no bijection between and any ℕ .

Slide 19

Slide 19 text

18 Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. Is ℕ Dedekind-infinite?

Slide 20

Slide 20 text

19 Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. Is ℕ Dedekind-infinite for any arbitrary large ?

Slide 21

Slide 21 text

Definitions of Infinity 20 Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. Standard Def. A set is infinite, if there is no bijection between and any ℕ .

Slide 22

Slide 22 text

21 Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. Standard Def. A set is infinite, if there is no bijection between and any ℕ . Are these definitions equivalent?

Slide 23

Slide 23 text

22 1st : Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. 2nd : Standard Definition. A set is infinite, if there is no bijection between and any ℕ .

Slide 24

Slide 24 text

23 1st : Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. 2nd : Standard Definition. A set is infinite, if there is no bijection between and any ℕ .

Slide 25

Slide 25 text

24

Slide 26

Slide 26 text

25 1st : Definition. A set is Dedekind-infinite if and only if it has the same cardinality as some strict subset of itself. 2nd : Standard Definition. A set is infinite, if there is no bijection between and any ℕ . 3rd Definition. A set is 3rd def-infinite, if ℕ ≤ ||. Namely, there is a surjective function from to ℕ

Slide 27

Slide 27 text

Generalizing counting to infinite sets.. 26

Slide 28

Slide 28 text

Countable 27 Definition. A set is countable if and only if ≤ |ℕ| Namely, there is a surjective function from ℕ to .

Slide 29

Slide 29 text

Countably Infinite 28 A set is countable if and only if there exists a surjective function from ℕ to . A set is infinite, if there is no bijection between and any ℕ . A set is countably infinite if it is countable and it is infinite.

Slide 30

Slide 30 text

Countably Infinite 29 A set is countable if and only if there exists a surjective function from ℕ to . A set is infinite, if there is no bijection between and any ℕ . A set is countably infinite iff it is countable and it is infinite. Equivalent definition: A set is countably infinite iff there exists a bijection between and ℕ….. (prove this using Schroder-Bernstein theorem)