Relations Between Sets 2/13/121. Relations 2/13/122 Sam MaryCS20 EC 10 Students Courses The “is-taking” relation A relation is a set of ordered pairs:

Slides:



Advertisements
Similar presentations
Functions Reading: Epp Chp 7.1, 7.2, 7.4
Advertisements

1.6 Functions. Chapter 1, section 6 Functions notation: f: A B x in A, y in B, f(x) = y. concepts: –domain of f, –codomain of f, –range of f, –f maps.
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.
Macroeconomic Themes: 121 ABC of Financial Markets.
5 Medium. CONTENT CONTAINER? CC: Olivander, Flickr.
Basic Probability: Outcomes and Events 4/6/121. Counting in Probability What is the probability of getting exactly two jacks in a poker hand? lec 13W.2.
Functions.
Directed Graphs 3/6/121. Normal Person’s Graph x y y = f(x) 3/6/122.
Jessie Zhao Course page: 1.
Uncountable Sets 2/22/121. Countably Infinite 2/13/122 There are as many natural numbers as integers … 0, -1, 1, -2, 2, -3, 3, -4, 4.
Basic Structures: Functions and Sequences
PH INDICATORS in chemistry and everyday life.
Chapter 2 The Basic Concepts of Set Theory
RELATIONRELATIONAA Age (years)Weight (kg) Consider the relationship between the weight of five students and their ages as shown.
Tue. Oct. 13, 2009Physics 208 Lecture 121 Last time… Begin circuits Resistor circuits Start resistor-capacitor circuits Today…
Functions, Pigeonhole Principle Lecture 14: Nov 4 A B f( ) =
Terminology Domain: set which holds the values to which we apply the function Co-domain: set which holds the possible values (results) of the function.
Discrete Mathematics Lecture 7 Alexander Bukharovich New York University.
Terminology Domain: set which holds the values to which we apply the function Co-domain: set which holds the possible values (results) of the function.
Functions f( ) = A B Lecture 15: Nov 4.
Functions Goals Introduce the concept of function Introduce injective, surjective, & bijective functions.
C241 PLTL SESSION – 3/1/2015 Functions & Relations.
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.
CS 2210 (22C:019) Discrete Structures Sets and Functions Spring 2015 Sukumar Ghosh.
RMIT University; Taylor's College
Chapter 7 Functions Dr. Curry Guinn. Outline of Today Section 7.1: Functions Defined on General Sets Section 7.2: One-to-One and Onto Section 7.3: The.
1 CMSC 250 Chapter 7, Functions. 2 CMSC 250 Function terminology l A relationship between elements of two sets such that no element of the first set is.
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
Cardinality of Sets Section 2.5.
CS355 - Theory of Computation Lecture 2: Mathematical Preliminaries.
2.1 Sets 2.2 Set Operations 2.3 Functions ‒Functions ‒ Injections, Surjections and Bijections ‒ Inverse Functions ‒Composition 2.4 Sequences and Summations.
Functions. Copyright © Peter Cappello2 Definition Let D and C be nonempty sets. A function f from D to C, for each element d  D, assigns exactly 1 element.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
1 Lecture 3 (part 3) Functions – Cardinality Reading: Epp Chp 7.6.
Week 7 - Friday.  What did we talk about last time?  Set disproofs  Russell’s paradox  Function basics.
Discrete Mathematics and Its Applications Sixth Edition By Kenneth Rosen Copyright  The McGraw-Hill Companies, Inc. Permission required for reproduction.
Discrete Mathematics CS 2610 September 12, Agenda Last class Functions  Vertical line rule  Ordered pairs  Graphical representation  Predicates.
Injective Function: a function f is said to be injective if and only if, for every element in the codomain, there is at most one element in the domain.
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
MAT 3749 Introduction to Analysis Section 1.3 Part I Countable Sets
Basic Structures: Sets, Functions, Sequences, and Sums CSC-2259 Discrete Structures Konstantin Busch - LSU1.
CSE 2353 – October 1 st 2003 Functions. For Real Numbers F: R->R –f(x) = 7x + 5 –f(x) = sin(x)
Agenda Week 10 Lecture coverage: –Functions –Types of Function –Composite function –Inverse of a function.
Mathematical Induction
2.1 Sets and Whole Numbers Remember to Silence Your Cell Phone and Put It In Your Bag!
Relations, Functions, and Countability
Sets 2/10/121. What is a Set? Informally, a collection of objects, determined by its members, treated as a single mathematical object Not a real definition:
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
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.
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 7 Functions Instructor: Hayk Melikyan Today we will review sections 7.3, 7.4 and 7.5.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 2.6 Infinite Sets.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
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.
Week 15 - Wednesday.  What did we talk about last time?  Review first third of course.
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
Functions Goals Introduce the concept of function
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
Discrete Mathematics CS 2610
CS 2210:0001 Discrete Structures Sets and Functions
Function Hubert Chan (Chapter 2.1, 2.2) [O1 Abstract Concepts]
2.6 Infinite Sets By the end of the class you will be able calculate the cardinality of infinite sets.
Discrete Math (2) Haiming Chen Associate Professor, PhD
Yet another important mathematical concept
Discrete Structures for Computer Science
Countable and Countably Infinite Sets
Functions Rosen 2.3, 2.5 f( ) = A B Lecture 5: Oct 1, 2.
Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007
Section 2.6 Infinite Sets.
Presentation transcript:

Relations Between Sets 2/13/121

Relations 2/13/122 Sam MaryCS20 EC 10 Students Courses The “is-taking” relation A relation is a set of ordered pairs: {(Sam,Ec10), (Sam, CS20), (Mary, CS20)}

Function: A → B 2/13/123 A B Each element of A is associated with at most one element of B. a b f(a) = b f AT MOST ONE ARROW OUT OF EACH ELEMENT OF A domain codomain

Total Function: A → B 2/13/124 A B Each element of A is associated with ONE AND ONLY one element of B. a b f(a) = b f EXACTLY ONE ARROW OUT OF EACH ELEMENT OF A domain codomain

A Function that is “Partial,” Not Total 2/13/125 R×R R f: R ×R → R f(x,y) = x/y Defined for all pairs (x,y) except when y=0! f domain codomain

A Function that is “Partial,” Not Total 2/13/126 R×R R f: R ×R → R f(x,y) = x/y Defined for all pairs (x,y) except when y=0! Or: f is a total function: R×(R-{0})→R f domain codomain

Injective Function 2/13/127 A B f domain codomain “at most one arrow in” ( ∀ b ∈ B)( ∃ ≤1 a ∈ A) f(a)=b

Surjective Function 2/13/128 A B f domain codomain “at least one arrow in” ( ∀ b ∈ B)( ∃ ≥1 a ∈ A) f(a)=b

Bijection = Total + Injective + Surjective 2/13/129 A B f domaincodomain “exactly one arrow out of each element of A and exactly one arrow in to each element of B” ( ∀ a ∈ A) f(a) is defined and ( ∀ b ∈ B)( ∃ =1 a ∈ A) f(a)=b

Cardinality or “Size” 2/13/1210 A B f domain codomain For finite sets, a bijection exists iff A and B have the same number of elements

Cardinality or “Size” 2/13/1211 Use the same as a definition of “same size” for infinite sets: Sets A and B have the same size iff there is a bijection between A and B Theorem: The set of even integers has the same size as the set of all integers [f(2n) = n] …, -4, -3, -2, -1, 0, 1, 2, 3, 4 … …, -8, -6, -4, -2, 0, 2, 4, 6, 8 …

Cardinality or “Size” 2/13/1212 There are as many natural numbers as integers … 0, -1, 1, -2, 2, -3, 3, -4, 4 … f(n) = n/2 if n is even, -(n+1)/2 if n is odd Defn: A set is countably infinite if it has the same size as the set of natural numbers

An Infinite Set May Have the Same Size as a Proper Subset! 2/13/ HiltonSheraton Every room of both hotels is full! Suppose the Sheraton has to be evacuated ⋮ ⋮

An Infinite Set May Have the Same Size as a Proper Subset! 2/13/ HiltonSheraton Step 1: Tell the resident of room n in the Hilton to go to room 2n This leaves all the odd- numbered rooms of the Hilton unoccupied ⋮ ⋮

An Infinite Set May Have the Same Size as a Proper Subset! 2/13/ HiltonSheraton Step 2: Tell the resident of room n in the Sheraton to go to room 2n+1 of the Hilton. Everyone gets a room! ⋮ ⋮