CS723 - Probability and Stochastic Processes Lecture 02

Slides:



Advertisements
Similar presentations
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Advertisements

Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
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.
EE1J2 – Discrete Maths Lecture 7
Sets 1.
Sets 1.
modified from UCI ICS/Math 6D, Fall Sets+Functions-1 Sets “Set”=Unordered collection of Objects “Set Elements”
Sets. Copyright © Peter Cappello Definition Visualize a dictionary as a directed graph. Nodes represent words If word w is defined in terms of word.
CSC 2300 Data Structures & Algorithms January 16, 2007 Chapter 1. Introduction.
Discrete Math 6A Max Welling. Recap 1. Proposition: statement that is true or false. 2. Logical operators: NOT, AND, OR, XOR, ,  3. Compound proposition:
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
Discrete Maths Objective to re-introduce basic set ideas, set operations, set identities , Semester 2, Set Basics 1.
2.1 – Symbols and Terminology Definitions: Set: A collection of objects. Elements: The objects that belong to the set. Set Designations (3 types): Word.
Chapter 2 The Basic Concepts of Set Theory © 2008 Pearson Addison-Wesley. All rights reserved.
Sets.
SECTION 5.1a Linear Functions and Graphs. A ________ is a set of __________________. relationordered pairs Relation = { (3,5),(-2,8),(-3,8),(0,-6) } The.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
2.1 – Sets. Examples: Set-Builder Notation Using Set-Builder Notation to Make Domains Explicit Examples.
(2-1) Relations and Functions. Cartesian Coordinate Plane Def: Composed of the x-axis (horizontal) and the y-axis (vertical) which meet at the origin.
Standard: M8A3 c. Distinguish between relations that are functions and those that are not functions. Relations and Functions.
R. Johnsonbaugh, Discrete Mathematics 5 th edition, 2001 Chapter 2 The Language of Mathematics.
CS 103 Discrete Structures Lecture 10 Basic Structures: Sets (1)
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
VENN DIAGRAM INDEX 1. DEFINATION OF VENN DIAGRAM. 2. VENN DIAGRAM OF A U B. 3. VENN DIAGRAM OF A  B. 4. VENN DIAGRAM OF A – B (ONLY A). 5. VENN DIAGRAM.
Mathematical Proofs. Chapter 1 Sets 1.1 Describing a Set 1.2 Subsets 1.3 Set Operations 1.4 Indexed Collections of Sets 1.5 Partitions of Sets.
Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1)
MATH 224 – Discrete Mathematics
Lecture V Probability theory. Lecture questions Classical definition of probability Frequency probability Discrete variable and probability distribution.
Sets. Definitions (I) Collection of elements such that: There are no duplicates There is no order Special sets Universe (U or E): all elements under consideration.
Mathematical Preliminaries
Sets Goal: Introduce the basic terminology of set theory.
Basic Structures: Sets, Functions, Sequences, and Sums.
(CSC 102) Lecture 13 Discrete Structures. Previous Lectures Summary  Direct Proof  Indirect Proof  Proof by Contradiction  Proof by Contra positive.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Lecture 5: Set Theory 1 Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
Discrete Mathematics. Set Theory - Definitions and notation A set is an unordered collection of elements. Some examples: {1, 2, 3} is the set containing.
Discrete Mathematics Set.
2-1 Relations and Functions Objective: To graph a relation, state its domain and range, and determine if it is a function, and to find values of functions.
Section 1.2 – 1.3 Outline Intersection  Disjoint Sets (A  B=  ) AND Union  OR Universe The set of items that are possible for membership Venn Diagrams.
Fr: Discrete Mathematics by Washburn, Marlowe, and Ryan.
Introduction to Graph Theory & its Applications
Discrete Mathematics CS 2610 August 31, Agenda Set Theory Set Builder Notation Universal Set Power Set and Cardinality Set Operations Set Identities.
Section 2.1. Sets A set is an unordered collection of objects. the students in this class the chairs in this room The objects in a set are called the.
Drill #10 List the relation (set of ordered pairs) and the domain and range of the following mapping: 1. Find the value of the following if f(x) = 2.f(
Review Functions. Function A function is a special type of relation in which each element of the domain is paired with exactly one element of the range.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
Chapter 2 1. Chapter Summary Sets (This Slide) The Language of Sets - Sec 2.1 – Lecture 8 Set Operations and Set Identities - Sec 2.2 – Lecture 9 Functions.
ICS 253: Discrete Structures I
Sets.
Applied Discrete Mathematics Week 1: Logic and Sets
CS723 - Probability and Stochastic Processes Lecture 03
Set, Combinatorics, Probability & Number Theory
CS 2210:0001 Discrete Structures Sets and Functions
What is Probability? Quantification of uncertainty.
MATH 224 – Discrete Mathematics
CS723 - Probability and Stochastic Processes Lecture 01
CS 3630 Database Design and Implementation
Time to take notes. So have paper and pen in front of you
Discrete Math (2) Haiming Chen Associate Professor, PhD
Identifying functions and using function notation
2.1 Sets Dr. Halimah Alshehri.
Sets 2 – Learning Outcomes
Chapter Sets &Venn Diagrams.
Discrete Mathematics CS 2610
Discrete Mathematics Lecture 6: Set and Function
Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007
FUNCTIONS.
2.1 – Symbols and Terminology
Lecture Sets 2.2 Set Operations.
Ordered Pair – (11 - 2) CS-708.
Presentation transcript:

CS723 - Probability and Stochastic Processes Lecture 02

In Previous Lecture Unpredictable World Zero/Partial Knowledge Complicated Model Mathematical Analysis

Venn Diagram U A B

Venn Diagram A = { 1, 2, 3 } U 1 2 3 A

Ac = { 7, a, b, c, lion, elephant, stray dog} Complement of a Set A = { 1, 2, 3, 4, 5 } Ac = { 7, a, b, c, lion, elephant, stray dog} ? Ac = U – A = { 6, 7, 8, 9, 10 } where U = { 1, 2, 3, … , 10 }

Venn Diagram Complement of a set U 7 8 6 10 4 1 2 5 3 A 9

Power Set A = { 1, 2 } Pow (A) = { { }, {1}, {2}, {1, 2} } A = { 1, 2, 3 } = { a2 , a1 , a0 } Pow (B) = { b: b = (b2b1b0)2 0 ≤ b < 7, bi = 1 ai is in the subset }

Cardinality of Power Set P = Cardinality of set A, P < ∞ Q = 2P = Cardinality of Pow (A) , Q < ∞ A = { 1, 2, 3, … } = Natural Numbers Q = 2P = ? Pow (A) = { b: b = (0.b1b2b3…)2 0 ≤ b < 1, bi = 1 Number i is in the subset }

Power Set of Infinite Set P = Cardinality of infinite set e.g. N P = ∞, the countable type Q = 2P = Cardinality of Pow (N) Q = ∞, the uncountable type R = 2N Cardinality of Pow (R) = 2R = ? = ∞ ?

Cartesian Product Ordered collection of elements from sets A = { x, y, z } B = { 1, 2, 3 } A x B = { (x,1), (x,2), (x,3), (y,1), (y,2), (y,3), (z,1), (z,2), (z,3) } Cardinality of Cartesian product If | A | = P < ∞ and | B | = Q < ∞ , then | A x B | = PQ < ∞

Cartesian Product If A = Z and B = Z , then A x B = Z2 = { (x1 , x2), x1 in Z, x2 in Z} | A | = | B | = | A x B | = Countably infinite Use If A = R and B = R , then A x B = R2 = { (x1 , x2), x1 in R, x2 in R} | A | = | B | = Uncountably infinite | A x B | = ? R x R x R = (R x R) x R = R x (R x R) = R3

Sets and Vectors Sets : Unordered collection of objects Vectors : Ordered collection of objects A = { x, y } B = { 1, 2 } A x B = { (x ,1) , (x , 2) , (y ,1) , (y , 2)} = {(y ,1) , (x , 2) , (y , 2) , (x ,1)} (x ,1) (A x B) but (1, x) (A x B)

Sets and Vectors A = set of your uncles = { u1, u2, u3, u4 , u5 } = { u4, u5, u1, u2 , u3 } = { u1, u4, u3, u5 , u2 } b = vector of your male ancestors = ( f, gf, ggf, gggf , … , Adam ) ≠ ( f, gggf, Adam,ggf, … , gf ) B = set of your male ancestors = { f, gggf, Adam,ggf, … , gf }

Relation Subset of a Cartesian Product A x B All pairs that satisfy some criterion Domain = Subset of A, set of starting points in pairs in a relation Range = Subset of B, set of terminating points is pair in a relation All possible pairs formed from entries of Domain and Range are not required to be in a relation

Relations Relations in R2 r1 = { (x,y) s.t. -5 < x < 5 , 0 < x+y < 10 } r2 = { (x,y) s.t. -5 < x < 5 , x2 + y2 < 25 } r3 = { (x,y) s.t. 0 < x < 9 , sin(x) < 0.5 } Other relations in R2

Relations in daily life A = Set of all adult living human males B = Set of all adult living human females A x B = { (a,b), a is a male, b is a female } r1 = { (a,b), a has same religion as b } r2 = { (a,b), a lives in same city as b } r3 = { (a,b), a has met b, at least once } r4 = { (a,b), a wants to marry b } r5 = { (a,b), a can marry b, realistically } r6 = { (a,b), a is husband of b }

Function Special type of relation For every domain element, there is only one unique element of the range A functions is also called a mapping Functions in R2 , a subset of R x R f1 = { (x,y) 0 < x < 10 , y = 3x + 2 } also f1: R → R = x → 3x+2

Function Graphs of functions in R2

Examples of Functions Function of two variables ( R x R ) x R Surface over plane ( R x R ) → R Complex valued function R x ( R x R ) Complex exponential R → ( R x R )

Functions in daily life A = Set of all human males B = Set of all human females A x B = { (a,b), a is a male, b is a female } f1 = { (a,b), a is a son of b } r = { (a,b), a is husband of b } f3 = { (b,a) (B x A), b is wife of a }