CHAPTER (6) RELATIONS. RELATIONS : - Let A and B be sets. A binary relation from A to B is subset of A* B …

Slides:



Advertisements
Similar presentations
Representing Relations
Advertisements

Representing Relations Rosen 7.3. Using Matrices For finite sets we can use zero-one matrices. Elements of each set A and B must be listed in some particular.
CSE115/ENGR160 Discrete Mathematics 04/26/12 Ming-Hsuan Yang UC Merced 1.
8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
Relations.
Discrete Mathematics Lecture # 16 Inverse of Relations.
Relations & Their Properties. Copyright © Peter Cappello2 Introduction Let A & B be sets. A binary relation from A to B is a subset of A x B. Let R be.
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.
Discrete Mathematics Lecture#11.
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.
Relations Chapter 9.
Chapter 9 1. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing.
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.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 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.
Relations Relations between sets are like functions, but with a more general definition (given later). presentations: a set, a binary matrix, a graph…
Lecture 4.4: Equivalence Classes and Partially Ordered Sets CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda.
Discrete Mathematics Relation.
§ 每周五交作业,作业成绩占总成绩的 10% ; § 平时不定期的进行小测验,占总成绩的 20% ; § 期中考试成绩占总成绩的 20% ;期终考 试成绩占总成绩的 50% § 每周五下午 1 ; 00—3 : 00 ,答疑 § 地点:软件楼 301.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Section 4.4 Properties of Relations. Order Relations Draw an arrow diagram for the relation R defined on the set {1,2,3,4} such that
Relations. Important Definitions We covered all of these definitions on the board on Monday, November 7 th. Definition 1 Definition 2 Definition 3 Definition.
Discrete Mathematics Lecture # 15 Types of Relations (contd.)
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
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,
Chapter Relations and Their Properties
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
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.
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.
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), (
Section 9.3. Section Summary Representing Relations using Matrices Representing Relations using Digraphs.
The Basic Concepts of Set Theory. Chapter 1 Set Operations and Cartesian Products.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Lecture 7: Relations Dr Andrew Purkiss-Trew Cancer Research UK Mathematics for Computing.
Chapter8 Relations 8.1: Relations and their properties.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Discrete Mathematical
Relations and Their Properties
Citra Noviyasari, S.Si, MT
Relations.
Atmiya Institute of Technology & Science
Relations Chapter 9.
Representing Relations
Dr. Ameria Eldosoky Discrete mathematics
Lecture 4.3: Closures and Equivalence Relations
Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 9 Relations Slides are adopted from.
Applied Discrete Mathematics Week 9: Equivalence Relations
Relations and Their Properties
8.1 Relations and Their Properties
Xuan Guo Lab 12 Xuan Guo
8.1 Relations and Their Properties
Applied Discrete Mathematics Week 5: Boolean Algebra
Introduction to Relations and Functions
{(1, 1), (2, 4), (3, 9), (4, 16)} one-to-one
Discrete Math (2) Haiming Chen Associate Professor, PhD
9.5 Equivalence Relations
Equivalence relations
Basics of Relations.
REVISION Relation. REVISION Relation Introduction to Relations and Functions.
Ordered Pair – (11 - 2) CS-708.
Chapter 8 (Part 2): Relations
Agenda Lecture Content: Relations (Relasi)
Lecture # 16 Inverse of Relations
Ø Let the universe set U={1,2,3,...,10}.
Relations 12/7/2019.
Presentation transcript:

CHAPTER (6) RELATIONS

RELATIONS : - Let A and B be sets. A binary relation from A to B is subset of A* B …

EXAMPLE : Let A be the set of student in your school and let B be the set of courses, let R be the relation that consists of those pairs (a,b) A) Fine the pair from this relation B) The pair (arabic,haya) relation from(a,b) !? Solution : (1) (MONA,ENGLISH).. (2) (ARABIC,HAYA) is not in R..

INVERSE Relation : Let R be any relation from a set A to set B, R=(a,b), R=(b,a) The inverse of R denoted by R

EXAMPLE : Let A = [1,2,3] and B=[x,y,z] Fine the inverse relation … Solution : ] R=[ (1,y),(1,z),(3,y) R=[ (y,1),(z,1),(y,3) ] Directed graphs of relation on sets

EXAMPLE : Draw the directed graph of relation on the set : A=[1,2,3] (Fine 7 pairs) Solution : R=[(1,2),(2,2),(2,4),(3,2),(3,4),(4,1),(4,3)] 12 34

PICTURES OF RELATIONS SETS :’’ Suppose A and B are set, there are two ways of picturing A relation R from A to B 1) Matrix of the relation 2) Arrow diagram

EXAMPLE : Let A=[1,2,3] AND B=[x,y,z] Fine A R B and draw pictures of it (fine 3 pairs) Solution : R=[(1,y),(1,z),(3,y)] Picture of R

ZYXA MATRIX OF R XYZXYZ ARROW OF DIAGRAM

TYPE OF RELATIONS : 1- REFLIXUE : X R X 2- SYMMETRIC : a R b b R a 3- anti-symmetric : arb ^ brc a=b 4- transitive : a R b ^ b R a a R b

EXAMPLE : Given X breather of Y, C breather of Y, -WHAT IS THE TYPE OF THIS RELATION ? Solution : X breather Y Y breather C Then C breather X this transitive relation

EXAMPLE : Given A=[1,2,3] AND B =[1,2], R=[(2,1),(3,1),(3,2)] FINE MATRIX FOR R.. Solution : MR =

EXAMPLE : Let A=[a1,a2,a3] and B=[b1,b2,b3,bn,b5] Which order pairs are in the relation R represent By matrix Mr =

Solution : R=[(A1,B2),(A2,B1),(A2,B3),(A2,B4),(A3,B1),(A3,B3),(A3, B5)]

THANKS FOR ALL