Lecture 4.1: Relations Basics

Slides:



Advertisements
Similar presentations
1 Section 7.1 Relations and their properties. 2 Binary relation A binary relation is a set of ordered pairs that expresses a relationship between elements.
Advertisements

Relations Chapter 9.
Lecture 4.5: POSets and Hasse Diagrams CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
9/8/2011Lecture Functions1 Lecture 2.4: Functions CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda.
Relation. Relations Recall the definition of the Cartesian (Cross) Product: The Cartesian Product of sets A and B, A x B, is the set A x B = { : x  A.
1 Relations Rosen 6 th ed., § Relations Re lationships between elements of sets occur in many contextsRe lationships between elements of sets occur.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Chapter 9. Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and.
Lecture 3.4: Recursive Algorithms CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Zeph Grunschlag.
Lecture 2.2: Set Theory* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda.
1 Lecture 3.3: Recursion CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
Lecture 4.3: Closures and Equivalence Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Lecture 2.1: Sets and Set Operations CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
CS 103 Discrete Structures Lecture 19 Relations. Chapter 9.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Lecture 4.1: Relations Basics CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Lecture 4.2: Relations Basics CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,
Lecture 2.2: Set Theory CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren.
Lecture 4.2: Relations CS 250, Discrete Structures, Fall 2013 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag.
Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda.
Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and B = {a,b} {( 0, a), (
Lecture 1.5: Proof Techniques CS 250, Discrete Structures, Fall 2012 Nitesh Saxena Adopted from previous lectures by Cinda Heeren 1.
Lecture 4.1: Relations Basics CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Section 9.3. Section Summary Representing Relations using Matrices Representing Relations using Digraphs.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
9/27/2011 Lecture Mathematical Induction1 Lecture 3.1: Mathematical Induction* CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from.
Lecture 3.4: Recursive Algorithms CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Zeph Grunschlag.
Chapter8 Relations 8.1: Relations and their properties.
Lecture 1.5: Proof Techniques
Lecture 5.4: Paths and Connectivity
Relations Chapter 9.
Representing Relations
Lecture 1.5: Proof Techniques
CS 173: Discrete Mathematical Structures
Lecture 4.3: Closures and Equivalence Relations
Lecture 3.2: Induction and Strong Induction (contd.)
Relations and Their Properties
Lecture 4.1: Relations Basics
Lecture 3.2: Induction, and Strong Induction
CS 250, Discrete Structures, Fall 2011 Nitesh Saxena
Lecture 3.2: Induction and Strong Induction (contd.)
CS 250, Discrete Structures, Fall 2014
Lecture 3.2: Induction, and Strong Induction
CS 250, Discrete Structures, Fall 2014
CS 250, Discrete Structures, Fall 2015
CS 250, Discrete Structures, Fall 2015
Lecture 4.3: Closures and Equivalence Relations
Relations and their Properties
Lecture 3.2: Induction, and Strong Induction
Lecture 1.6: Proof Techniques (contd)
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
Lecture 2.1: Sets and Set Operations*
CS 250, Discrete Structures, Fall 2013
CS 250, Discrete Structures, Fall 2013
Lecture 3.1: Mathematical Induction
Lecture 4.1: Relations Basics
CS 336/536: Computer Network Security Fall 2014 Nitesh Saxena
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
Lecture 1.6: Proof Techniques (contd)
Lecture 5.3: Graph Isomorphism and Paths
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
Lecture 2.3: Set Theory, and Functions
Lecture 3.1: Mathematical Induction
CS 336/536: Computer Network Security Fall 2015 Nitesh Saxena
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
CS 250, Discrete Structures, Fall 2012
Presentation transcript:

Lecture 4.1: Relations Basics CS 250, Discrete Structures, Fall 2014 Nitesh Saxena Adopted from previous lectures by Cinda Heeren

Course Admin Graded HW2 HW3 Due Will distribute today Covers “Induction and Recursion” (Chapter 5) Due 11am Nov 6 (Thursday) 7/2/2018

Course Admin Mid Term 2 Nov 6 (Thur) Covers “Induction and Recursion” (Chapter 5) Review Oct 30 (Thu) Study topics posted Sample practice exam will be given out soon 7/2/2018

Traveling Next Week At a conference (Nov 3-7): http://www.sigsac.org/ccs/CCS2014/ Mid-term proctored by TA No class next Tuesday (Nov 4) – prepare for exam Office hrs extended – 3-5pm Thursday. 7/2/2018

Outline Relation Definition and Examples Types of Relations Operations on Relations 7/2/2018

A x B = {<x,y> : xA and yB}. Relations Recall the definition of the Cartesian (Cross) Product: The Cartesian Product of sets A and B, A x B, is the set A x B = {<x,y> : xA and yB}. A relation is just any subset of the CP!! R  AxB Ex: A = students; B = courses. R = {(a,b) | student a is enrolled in class b} We often say: aRb if (a,b) belongs to R 7/2/2018

Relations vs. Functions Recall the definition of a function: f = {<a,b> : b = f(a) , aA and bB} Is every function a relation? Draw venn diagram of cross products, relations, functions Yes, a function is a special kind of relation. 7/2/2018

Properties of Relations Reflexivity: A relation R on AxA is reflexive if for all aA, (a,a) R. Symmetry: A relation R on AxA is symmetric if (a,b)  R implies (b,a)  R . 7/2/2018

Properties of Relations   7/2/2018

Properties of Relations - Techniques How can we check for the reflexive property? Draw a picture of the relation (called a “graph”). Vertex for every element of A Edge for every element of R Now, what’s R? {(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),(4,4)} 1 2 3 4 Loops must exist on EVERY vertex. 7/2/2018

Properties of Relations - Techniques How can we check for the symmetric property? Draw a picture of the relation (called a “graph”). Vertex for every element of A Edge for every element of R Now, what’s R? {(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),(4,4)} EVERY edge must have a return edge. 1 2 3 4 7/2/2018

Properties of Relations - Techniques How can we check for transitivity? Draw a picture of the relation (called a “graph”). Vertex for every element of A Edge for every element of R Now, what’s R? {(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),(4,4)} 1 2 3 4 A “short cut” must be present for EVERY path of length 2. 7/2/2018

Properties of Relations - Techniques How can we check for the anti-symmetric property? Draw a picture of the relation (called a “graph”). Vertex for every element of A Edge for every element of R Now, what’s R? {(1,1),(1,2),(1,3),(1,4),(2,2),(2,3),(2,4),(3,3),(3,4),(4,4)} No edge can have a return edge. 1 2 3 4

Properties of Relations - Examples Let R be a relation on People, R={(x,y): x and y have lived in the same country} 1 ? 1 2 ? 1 2 3 ? Is R transitive? No Is it symmetric? Yes Is it reflexive? Yes Is it anti-symmetric? No 7/2/2018

Properties of Relations - Examples Let R be a relation on positive integers, R={(x,y): 3|(x-y)} Suppose (x,y) and (y,z) are in R. Definition of “divides” Then we can write 3j = (x-y) and 3k = (y-z) Can we say 3m = (x-z)? Is (x,z) in R? Add prev eqn to get: 3j + 3k = (x-y) + (y-z) 3(j + k) = (x-z) Is R transitive? Yes 7/2/2018

Properties of Relations - Techniques Let R be a relation on positive integers, R={(x,y): 3|(x-y)} Is (x,x) in R, for all x? Definition of “divides” Does 3k = (x-x) for some k? Yes, for k=0. Is R transitive? Yes Is it reflexive? Yes 7/2/2018

Properties of Relations - Techniques Let R be a relation on positive integers, R={(x,y): 3|(x-y)} Suppose (x,y) is in R. Definition of “divides” Then 3j = (x-y) for some j. Does 3k = (y-x) for some k? Yes, for k=-j. Is R transitive? Yes Is it symmetric? Yes Is it reflexive? Yes 7/2/2018

Properties of Relations - Techniques Let R be a relation on positive integers, R={(x,y): 3|(x-y)} Suppose (x,y) is in R. Definition of “divides” Then 3j = (x-y) for some j. Does 3k = (y-x) for some k? Yes, for k=-j. Is R transitive? Yes Is it symmetric? Yes Is it reflexive? Yes Is it anti-symmetric? No 7/2/2018

More than one relation Suppose we have 2 relations, R1 and R2, and recall that relations are just sets! So we can take unions, intersections, complements, symmetric differences, etc. There are other things we can do as well… 7/2/2018

More than one relation SR = {(a,c):  bB, (a,b)  R, (b,c)  S} Let R be a relation from A to B (R  AxB), and let S be a relation from B to C (S  BxC). The composition of R and S is the relation from A to C (SR  AxC): SR = {(a,c):  bB, (a,b)  R, (b,c)  S} A B C 1 2 3 4 x y z s t u v R S SR = {(1,u),(1,v),(2,t),(3,t),(4,u)} 7/2/2018

R2 = R1R = {(1,1),(1,2),(1,3),(2,3),(3,3),(4,1), (4,2)} More than one relation Let R be a relation on A. Inductively define R1 = R Rn+1 = Rn  R A A A R R1 1 1 1 2 2 2 3 3 3 4 4 4 R2 = R1R = {(1,1),(1,2),(1,3),(2,3),(3,3),(4,1), (4,2)} 7/2/2018

R3 = R2R = {(1,1),(1,2),(1,3),(2,3),(3,3),(4,1),(4,2),(4,3)} More than one relation Let R be a relation on A. Inductively define R1 = R Rn+1 = Rn  R A A A R R2 1 1 1 2 2 2 3 3 3 … = R4 = R5 = R6… 4 4 4 R3 = R2R = {(1,1),(1,2),(1,3),(2,3),(3,3),(4,1),(4,2),(4,3)} 7/2/2018

Today’s Reading Rosen 9.1 7/2/2018