8.1 Relations and Their Properties

Slides:



Advertisements
Similar presentations
Reflexive example: AB = AB Symmetric example: AB = BA
Advertisements

Equivalence Relations
Chap6 Relations Def 1: Let A and B be sets. A binary relation from A
Basic Properties of Relations
Relations.
Discrete Mathematics Lecture # 16 Inverse of Relations.
8.4 Closures of Relations. Intro Consider the following example (telephone line, bus route,…) abc d Is R, defined above on the set A={a, b, c, d}, transitive?
Ch. 8: Relations 8.1 Relations and their Properties.
CSE115/ENGR160 Discrete Mathematics 04/24/12 Ming-Hsuan Yang UC Merced 1.
Relations. Binary Relations a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). Note the di ff erence between.
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.
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.
Relations (1) Rosen 6 th ed., ch. 8. Binary Relations Let A, B be any two sets. A binary relation R from A to B, written (with signature) R:A↔B, is a.
CS Discrete Mathematical Structures Mehdi Ghayoumi MSB rm 132 Ofc hr: Thur, 9:30-11:30a Fall 2002KSU - Discrete Structures1.
1 Relations Rosen 6 th ed., § Relations Re lationships between elements of sets occur in many contextsRe lationships between elements of sets occur.
CHAPTER (6) RELATIONS. RELATIONS : - Let A and B be sets. A binary relation from A to B is subset of A* B …
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.
Integers and Properties
HALVERSON – MIDWESTERN STATE UNIVERSITY CMPS 2433 Chapter 2 – Part 2 Functions & Relations.
Chapter 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs BY: MISS FARAH ADIBAH ADNAN IMK.
Sets Define sets in 2 ways  Enumeration  Set comprehension (predicate on membership), e.g., {n | n  N   k  k  N  n = 10  k  0  n  50} the set.
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
Properties and Mental Computation p. 80. Math talk What are some math properties that we use? Why do you think we have them? Do you ever use them?
Chapter 7: Relations Relations(7.1) Relations(7.1) n-any Relations & their Applications (7.2) n-any Relations & their Applications (7.2)
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Relations.
A Quick Math Overview (not the last one!) Section 1.4, you should it read carefully! Reading the corresponding material from the book is strongly encouraged.
CS 103 Discrete Structures Lecture 19 Relations. Chapter 9.
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
1.2 Field Axioms (Properties) Notes on a Handout.
Chapter 8 Equivalence Relations Let A and B be two sets. A relation R from A to B is a subset of AXB. That is, R is a set of ordered pairs, where the first.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Functions (Mappings). Definitions A function (or mapping)  from a set A to a set B is a rule that assigns to each element a of A exactly one element.
Properties of Algebra (aka all the rules that holds the math together!)
RelationsCSCE 235, Spring Introduction A relation between elements of two sets is a subset of their Cartesian products (set of all ordered pairs.
1 Equivalence relations Binary relations: –Let S1 and S2 be two sets, and R be a (binary relation) from S1 to S2 –Not every x in S1 and y in S2 have such.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
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), (
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Section 9.1. Section Summary Relations and Functions Properties of Relations Reflexive Relations Symmetric and Antisymmetric Relations Transitive Relations.
Chapter8 Relations 8.1: Relations and their properties.
2-1 Basic Assumptions Objective: To use number properties to simplify expressions.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Citra Noviyasari, S.Si, MT
3.8 Matrices L Al-zaid Math1101.
Applied Discrete Mathematics Week 10: Relations
Dr. Ameria Eldosoky Discrete mathematics
Cartesian product Given two sets A, B we define their Cartesian product is the set of all the pairs whose first element is in A and second in B. Note that.
Chapter 3 Relation and Function Homework 4 For each of the following relations on set A = { 1,2,3,4 }, check each of them whether they are reflexive, irreflexive,
Applied Discrete Mathematics Week 9: Equivalence Relations
Real Numbers and Number Operations
8.5 Equivalence Relations
Relations and Their Properties
8.1 Relations and Their Properties
Discrete Math (2) Haiming Chen Associate Professor, PhD
Applied Discrete Mathematics Week 5: Boolean Algebra
8.5 Equivalence Relations and 8.6 Partial Ordering
Relations and their Properties
Introduction to Relations and Functions
2.2 Set Operations L Al-zaid Math1101.
Mathematical Background
Discrete Math (2) Haiming Chen Associate Professor, PhD
9.5 Equivalence Relations
Equivalence Relations
Properties of Numbers Lesson 1-3.
Basics of Relations.
3.8 Matrices L Al-zaid Math1101.
Agenda Lecture Content: Relations (Relasi)
Lecture # 16 Inverse of Relations
Properties of Real Numbers
Ø Let the universe set U={1,2,3,...,10}.
Presentation transcript:

8.1 Relations and Their Properties L Al-zaid Math1101

The Binary Relation DEFINITION 1 Let A and B be sets. A binary relation from A to B is a subset of AxB. In other words, a binary relation from A to B is a set R of ordered pairs where the first element of each ordered pair comes from A and the second element comes from B. We use the notation a R b to denote that (a, b)ϵR and a R b to denote that (a, b)ɇR. Moreover, when (a, b)belongs to R, a is said to be related to b by R. L Al-zaid Math1101

Relations on a Set DEFINITION 2 A relation on the set A is a relation from A to A . In other words, a relation on a set A i s a subset o f A x A . L Al-zaid Math1101

Example: Let A={1,2,3} and B={4,5,6} Define R to be a relation from A to B such that: aRb ↔ a\b. Write the R as a set of ordered pairs then Find the domain and the range. Solution: L Al-zaid Math1101

EXAMPLE 3 Let A = {0,1 ,2} and B = {a,b} EXAMPLE 3 Let A = {0,1 ,2} and B = {a,b} . Then {(0,a), (0,b), (1,a), (2,b)} is a relation from A to B . L Al-zaid Math1101

EXAMPLE 4 Let A be the set {1,2,3,4} EXAMPLE 4 Let A be the set {1,2,3,4}. Which ordered pairs are in the relation R = {(a,b) | a divides b}? Solution: L Al-zaid Math1101

Properties of Relations L Al-zaid Math1101

Reflexive Relation DEFINITION 3 A relation R on a set A is called reflexive if (a,a)ϵR for every element aϵA. L Al-zaid Math1101

Symmetric DEFINITION 4 A relation R on a set A is called symmetric if (b,a) ϵ R whenever (a,b) ϵ R, for all a,bϵA . L Al-zaid Math1101

Transitive DEFINITION 5 A relation R on a set A is called transitive if whenever (a,b)ϵR and (b,c)ϵ R , then (a,c) ϵ R , for all a,b,c ϵA. L Al-zaid Math1101

Example 7 Consider the following relations on {1,2,3,4} : R1= {(1,1), (1,2), (2,1), (2,2), (3,4), (4,1) , (4,4)} , R2 = {(1,1), (1,2), (2,1) } , R3 = { (1,1) , (1,2) , (1,4), (2,1), (2,2),(3,3) ,(4,1) ,(4,4)}, R4 = {(2,1), (3,1) , (3,2), (4,1) , (4,2), (4,3)} , R5 = {(1,1) ,(1 ,2), (1,3), (1,4), (2,2), (2,3), (2,4), (3,3), (3,4), (4,4)} , R 6 = {(3,4)} . Which of these relations are reflexive, symmetric and transitive? L Al-zaid Math1101

Inverse relation: Inverse relation: L Al-zaid Math1101

Example: A={1,2,3} and R={(1,2),(1,3),(2,2),(3,2)} R-1 ={(2,1),(3,1),(2,2),(2,3)} L Al-zaid Math1101

The composition of two relations Let R be a relation from a set A to a set B and S a relation from B to a set C. The composite of R and S is the relation consisting of ordered pairs (a,c), where aϵA, cϵC , and for which there exists an element bϵB such that (a,b)ϵR and (b,c) ϵ S. We denote the composite of R and S by S◦R. L Al-zaid Math1101

EXAMPLE 20 What is the composite of the relations R and S, where R is the relation from {1,2,3} to {1,2,3,4} with R = {(1,1) , (1,4), (2,3), (3,1) , (3,4)} and S is the relation from {1,2,3,4} to {0,1,2} with S = {(1,0), (2,0), (3,1 ) ,(3,2), (4,1)}? Solution: L Al-zaid Math1101

Homework Page 527 1 (a,b,c) 3 (a,b,c,d,e,f) 24 (a,b) 25 (a,b) 30 L Al-zaid Math1101