Lecture 5 Infinite Ordinals. Recall: What is “2”? Definition: 2 = {0,1}, where 1 = {0} and 0 = {}. (So 2 is a particular set of size 2.) In general, we.

Slides:



Advertisements
Similar presentations
Lecture ,3.3 Sequences & Summations Proof by Induction.
Advertisements

Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 10 Cardinality Uncountability of the real numbers.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Sequences Ordered Patterns. 8/31/2013 Sequences 2 The art of asking the right questions in mathematics is more important than the art of solving them.
Great Theoretical Ideas in Computer Science.
CSE115/ENGR160 Discrete Mathematics 02/21/12
Georg Cantor ( ) Founder of modern set theory.
Sequence A list of objects arranged in a particular order.
Cardinals Georg Cantor ( ) thought of a cardinal as a special represenative. Bertrand Russell ( ) and Gottlob Frege ( ) used the.
Lecture ,3.3 Sequences & Summations Proof by Induction.
CSE115/ENGR160 Discrete Mathematics 03/29/11 Ming-Hsuan Yang UC Merced 1.
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
2012: J Paul GibsonTSP: Mathematical FoundationsMAT7003/L5- CountingAndEnumeration.1 MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul.
ORDINAL NUMBERS VINAY SINGH MARCH 20, 2012 MAT 7670.
Cantor’s Legacy: Infinity And Diagonalization Great Theoretical Ideas In Computer Science Steven RudichCS Spring 2004 Lecture 25Apr 13, 2004Carnegie.
Arithmetic Series Additive Recursion. 7/15/2013 Arithmetic Series 2 The art of asking the right questions in mathematics is more important than the art.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
Recursive Definitions and Structural Induction
Sequences and Series 13.3 The arithmetic sequence
Sequences and Series (T) Students will know the form of an Arithmetic sequence.  Arithmetic Sequence: There exists a common difference (d) between each.
GPS – Sequences and Series  MA3A9. Students will use sequences and series  a. Use and find recursive and explicit formulae for the terms of sequences.
State whether the sequence below is arithmetic, geometric or neither and then write the explicit definition of the sequence. 3, 7, 11, 15...
Sequences & Summations CS 1050 Rosen 3.2. Sequence A sequence is a discrete structure used to represent an ordered list. A sequence is a function from.
Discrete Mathematics CS 2610 March 26, 2009 Skip: structural induction generalized induction Skip section 4.5.
Lecture 9. Arithmetic and geometric series and mathematical induction
Sequences and Summations
Numbers, Operations, and Quantitative Reasoning.
2.4 Sequences and Summations
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.
Mathematical Induction
CS201: Data Structures and Discrete Mathematics I
Discrete Mathematics R. Johnsonbaugh
Lecture V Probability theory. Lecture questions Classical definition of probability Frequency probability Discrete variable and probability distribution.
Copyright © Zeph Grunschlag, Induction Zeph Grunschlag.
COMPSCI 102 Introduction to Discrete Mathematics.
Based on Rosen, Discrete Mathematics & Its Applications, 5e Prepared by (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module.
Aim: How can the word ‘infinite’ define a collection of elements?
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
1 Recursive Definitions and Structural Induction CS 202 Epp section ??? Aaron Bloomfield.
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.
Classifications LanguageGrammarAutomaton Regular, right- linear Right-linear, left-linear DFA, NFA Context-free PDA Context- sensitive LBA Recursively.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
CS 285- Discrete Mathematics
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Discrete Structures Li Tak Sing( 李德成 ) mt263f ppt 1.
Mathematical Induction Thinking Skill: Develop Confidence in Reason Warm Up: Find the k+1 term (P k+1 ) 1) 2)
Week 8 - Wednesday.  What did we talk about last time?  Relations  Properties of relations  Reflexive  Symmetric  Transitive.
1 Recursive Definitions and Structural Induction CS/APMA 202 Rosen section 3.4 Aaron Bloomfield.
Sequences Lecture 11. L62 Sequences Sequences are a way of ordering lists of objects. Java arrays are a type of sequence of finite size. Usually, mathematical.
Chapter 5 1. Chapter Summary  Mathematical Induction  Strong Induction  Recursive Definitions  Structural Induction  Recursive Algorithms.
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Catie Baker Spring 2015.
2.4 Sequences and Summations
Young man, in mathematics you don't understand things
Lecture 7 Functions.
Introduction to Measure Theory
Discrete Structures for Computer Science
ICS 253: Discrete Structures I
Module #4.5, Topic #∞: Cardinality & Infinite Sets
Section 2.2 Subsets Objectives
Discrete Mathematics and its Applications
CHAPTER 2 Set Theory.
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
Module #4.5, Topic #∞: Cardinality & Infinite Sets
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
RAYAT SHIKSHAN SANSTHA’S S.M.JOSHI COLLEGE, HADAPSAR, PUNE
CHAPTER 2 Set Theory.
CHAPTER 2 Set Theory.
Presentation transcript:

Lecture 5 Infinite Ordinals

Recall: What is “2”? Definition: 2 = {0,1}, where 1 = {0} and 0 = {}. (So 2 is a particular set of size 2.) In general, we can define: n = {0,1,2,…,n  1} = {k  N: k < n} This is the so-called “von Neumann” notation. We actually achieved to define the natural numbers as sets. In fact, in mathematics, everything is a set!

A Recursive Definition Since n = {0,1,2,…,n  1}, n+1 = {0,1,2,…,n  1,n} = {0,1,2,…,n  1}  {n} = n  {n} Thus, we have the following recursive definition of the natural numbers: Base: 0 = {} Step: n+1 = n  {n}

The Infinite Ordinal  For n,m  N, (n  m  n < m) Thus, we actually defined the order structures: (n,<) = (n,  ) On each n,  is a transitive relation, i.e. (  i,j,k  N)(i  j  k  i  k) Also, 0  1  2  3  …  N Definition:  = {0,1,2,3,…} = N

Well Ordering Note that (N,<) = ( ,  ) is linearly ordered, i.e. (  n,m  N)(n < m or n = m or m < n) Moreover, the order (N,<) has the following nice feature: Every nonempty subset of N has a least element Equivalently: There is no infinite sequence x 0,x 1,x 2, x 3,…  N, such that … < x 3 < x 2 < x 1 < x 0. Any linear order < with this feature is called a well order.

But why stop at  ? Definition:  = {0,1,2,3,…} (= N) = 0  1  2  3  …  +1 =  {  } = {0,1,2,3,…,  }  +2 = (  +1)+1 = (  +1)  {  +1} = {0,1,2,3,…, ,  +1}  +3 = (  +2)+1 = (  +2)  {  +2} = {0,1,2,3,…, ,  +1,  +2}...  +  =  (  +1)  (  +2)  (  +3)  … = {0,1,2,3,…, ,  +1,  +2,  +3,…} =  2

And continue… Definition:  2 = {0,1,2,3,…, ,  +1,  +2,  +3,…}  2+1 = {0,1,2,3,…, ,  +1,  +2,  +3,…,  2}  2+2 = {0,1,2,…, ,  +1,  +2,…,  2,  2+1} …  2+  = {0,1,2,…, ,  +1,  +2,…,  2,  2+1,…} =  3 …  =  2 = {0,1,…, ,…,  2,…,  3,…}

And continue… Definition:  2 = {0,1,…, ,…,  2,…,  3,…}  2 +1 = {0,1,…, ,…,  2,…,  3,…,  2 } …  2 +  = {0,1,…,  2,  2 +1,…} …  2 +  2 = {0,…,  2,…,  2 + ,…,  2 +  2,…} =  2  2 …  2  = {0,…,  2,…,  2  2,…,  2  3,…} =  3

And continue… Definition:  3 = {0,1,…,  2,…,  2  2,…,  2  3,…}  3 +1 = {0,1,…,  2,…,  2  2,…,  2  3,…,  3 } …  3 +  = {0,1,…,  3,  3 +1,…} …  3 +  3 = {0,…,  3,…,  3 +  2,…,  3 +  2  2,…} =  3  2 …  4 ; … ;  5 ; … ;   ; … ;    ; … ;  0 =   ... ; …

Ordinals versus Cardinals Notes: Cardinals measure sizes of sets Ordinals measure lengths of well ordered sets All ordinals mentioned so far, e.g.    and  0 =   ... are actually countable sets. There are however uncountable ordinals,  1 is the least uncountable ordinal. In fact,  1 = the set of all countable ordinals. Need to define what ordinals really are.

More rigorously Definition: An ordinal is a set X such that: X is linearly ordered by , i.e. (  y,z,w  X)(y  z and z  w  y  w) and(  y,z  X)(y  z or y = z or z  y) X is transitive, i.e. (  y  X)(y  X) Notes: From the axiom of foundation, there is no infinite sequence of sets x 1,x 2,x 3,…, such that …  x 3  x 2  x 1 Thus, an ordinal is well ordered by 

The Class of Ordinals Definition: Ordinals can be classified into three classes: The ordinal 0 Successor ordinals  =  + 1 =  {  } Limit ordinals  = sup{  :  <  } =  {  :  <  } Definitions of ordinal functions according to this classification are said to use transfinite recursion. Proofs of ordinal statements according to this classification are said to use transfinite induction.

Ordinal Arithmetic: Addition Definition: We define the sum of two ordinals  +  by recursion on  : Base (  = 0):  + 0 =  Successor (  =  + 1):  + (  + 1) = (  +  ) + 1 = (  +  )  {(  +  )} Limit (  = sup{  :  <  }):  +  = sup{  +  :  <  } Note:. The definition generalizes the addition of natural numbers. Example: 1+  =  <  +1, so ordinal addition is not commutative, i.e.  +    + , in general.

Ordinal Arithmetic: Multiplication Definition: We define the product of two ordinals  by recursion on  : Base (  = 0):  0 = 0 Successor (  =  + 1):  (  + 1) = (  ) +  Limit (  = sup{  :  <  }):  +  = sup{  :  <  } Note:. The definition also generalizes the multiplication of natural numbers. Example: 2  =  <  2, so ordinal multiplication is not commutative, i.e.   , in general.

Ordinal Arithmetic: Exponentiation Definition: We define the exponentiation of two ordinals   by recursion on  : Base (  = 0):  0 = 1 Successor (  =  + 1):   + 1 =    Limit (  = sup{  :  <  }):   = sup{   :  <  } Note:. The definition also generalizes the exponentiation of natural numbers. Example: 2  = , so ordinal exponentiation is not the same as cardinal exponentiation.

Thank you for listening. Wafik