Introduction to Measure Theory

Slides:



Advertisements
Similar presentations
Countability. The cardinality of the set A is equal to the cardinality of a set B if there exists a bijection from A to B cardinality? bijection? injection.
Advertisements

Chapter 2 The Basic Concepts of Set Theory
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
1 Diagonalization Fact: Many books exist. Fact: Some books contain the titles of other books within them. Fact: Some books contain their own titles within.
Computability and Complexity 4-1 Existence of Undecidable Problems Computability and Complexity Andrei Bulatov.
Introduction to Computability Theory
Courtesy Costas Busch - RPI1 A Universal Turing Machine.
Continued Fractions in Combinatorial Game Theory Mary A. Cox.
Sequence A list of objects arranged in a particular order.
Fall 2004COMP 3351 A Universal Turing Machine. Fall 2004COMP 3352 Turing Machines are “hardwired” they execute only one program A limitation of Turing.
Lecture ,3.3 Sequences & Summations Proof by Induction.
1 Lecture 6 Topics –Proof of the existence of unsolvable problems Problems/languages not in REC Proof Technique –There are more problems/languages than.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
ORDINAL NUMBERS VINAY SINGH MARCH 20, 2012 MAT 7670.
Vocabulary word (put this word on the back of the card.) THIS WILL BE THE DEFINITION – FILL IN THE BLANKS ON THE VOCABULARY CARDS PROVIDED.
Cardinality of Sets Section 2.5.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
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.
Real Numbers Week 1 Topic 1. Real Numbers  Irrational Numbers  Numbers that cannot be written as a fraction  √2, π  Rational Numbers  Numbers that.
Sequences and Summations
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 15-1 Mälardalen University 2012.
MAT 3749 Introduction to Analysis Section 1.3 Part I Countable Sets
A Universal Turing Machine
Relations, Functions, and Countability
CS201: Data Structures and Discrete Mathematics I
Aim: How can the word ‘infinite’ define a collection of elements?
INFIINITE SETS CSC 172 SPRING 2002 LECTURE 23. Cardinality and Counting The cardinality of a set is the number of elements in the set Two sets are equipotent.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 10/7/2008.
1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Database System Concepts, 5th Ed. ©Silberschatz, Korth and Sudarshan See for conditions on re-usewww.db-book.com ICOM 5016 – Introduction.
1 By Dr. Saqib Hussain Introduction to Measure Theory MTH 426.
Discrete Mathematics Set.
Math 51/COEN 19. Sequences and Summations - vocab An arithmetic progression is a sequence of the form a, a+d, a+2d, …, a+nd, … with fixed a, d in R and.
CS 285- Discrete Mathematics
Strings and Languages Denning, Section 2.7. Alphabet An alphabet V is a finite nonempty set of symbols. Each symbol is a non- divisible or atomic object.
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.
1 By Dr. Saqib Hussain Complex Analysis MTH The complex Number System Lecture # 1 MTH 324.
1 A Universal Turing Machine. 2 Turing Machines are “hardwired” they execute only one program A limitation of Turing Machines: Real Computers are re-programmable.
Department of Mathematics
Set Builder Notation. If you recall, a set is a collection of objects which we write using brackets and name using a capital letter. Remember also that:
1-1 Copyright © 2013, 2005, 2001 Pearson Education, Inc. Section 2.4, Slide 1 Chapter 2 Sets and Functions.
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Discrete Mathematics CS 2610
A Universal Turing Machine
Introduction to Measure Theory
Department of Mathematics
Cauchy’s theory for complex integrals
Polar Form and its Applications
MTH 324 Lecture # 18 Complex Integration.
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Sequences and Summations
MTH 324 Lecture # 23 Power Series.
Finite and Infinite Sets
Analytic Number Theory MTH 435
Countable or Uncountable…That is the question!
Countable and Countably Infinite Sets
ICS 253: Discrete Structures I
Nondeterministic Finite Automata
Formal Languages, Automata and Models of Computation
Chapter 2 The Basic Concepts of Set Theory
Real Numbers Natural Numbers Whole Numbers Integers Rational Numbers
Lecture 5 Number Theory & Proof Methods
Cardinality Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted |A| = |B|, if and only if there is a one-to-one correspondence.
ICOM 5016 – Introduction to Database Systems
Sets, Unions, Intersections, and Complements
Rational Numbers and Irrational Numbers
Presentation transcript:

Introduction to Measure Theory MTH 426 Introduction to Measure Theory By Dr. Saqib Hussain

MTH 426 Lecture # 5 Countable Sets

Previous Lecture’s Review Equivalent sets Infinite sets

Lecture’s Outline Countable sets Uncountable sets

Denumerable sets Set D is said to be denumerable if it is equivalent to the set of natural number N. Examples:

Example: Show that the set of integers is denumerable. Solution:

Example: Show that an infinite sequence of distinct elements is denumerable. Solution:

Theorem: If A and B are denumerable sets then A x B is denumerable. Proof:

Theorem: Every infinite set contains a subset which is denumerable Proof:

Theorem: A subset of a denumerable set is either finite or denumerable Proof:

Countable set A set is said to be countable if it is either finite or denumerable. Examples:

Remark: A subset of a countable set is countable

Theorem: Proof:

Example: Show that the set of rational numbers is denumerable. Solution:

Example: Show that the set [0, 1] is non-denumerable. Solution:

Example: Show that the set [a, b] is non-denumerable. Solution:

Example: Show that the set of irrational numbers is non-denumerable. Solution:

References: Set Theory and Related Topics by Seymour Lipschutz. Elements of Set Theory by Herbert B. Enderton