Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Slides:



Advertisements
Similar presentations
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Advertisements

Equivalence Relations
Relations Relations on a Set. Properties of Relations.
Representing Relations Using Matrices
Discrete Structures Chapter 5 Relations Nurul Amelina Nasharuddin Multimedia Department.
Discrete Structures Chapter 5 Relations and Functions Nurul Amelina Nasharuddin Multimedia Department.
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.
Properties refer to rules that indicate a standard procedure or method to be followed. A proof is a demonstration of the truth of a statement in mathematics.
Relations Chapter 9.
Chapter 9 1. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing.
Applied Discrete Mathematics Week 10: Equivalence Relations
Fall 2014 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation
 Let A and B be any sets A binary relation R from A to B is a subset of AxB Given an ordered pair (x, y), x is related to y by R iff (x, y) is in R. This.
Foundations of Discrete Mathematics Chapter 3 By Dr. Dalia M. Gil, Ph.D.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Unit Unit 04 Relations IT DisiciplineITD1111 Discrete Mathematics & Statistics STDTLP1 Unit 4 Relations.
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Reflexivity, Symmetry, and Transitivity Lecture 44 Section 10.2 Thu, Apr 7, 2005.
1 RELATIONS Learning outcomes Students are able to: a. determine the properties of relations – reflexive, symmetric, transitive, and antisymmetric b. determine.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
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.
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.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 1 Regular Languages Some slides are in courtesy.
Spring 2016 COMP 2300 Discrete Structures for Computation
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Copyright © Cengage Learning. All rights reserved. CHAPTER 8 RELATIONS.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.
Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 4 Decidability Some slides are in courtesy.
Spring 2016 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University.
Section 9.3. Section Summary Representing Relations using Matrices Representing Relations using Digraphs.
Identity and Equality Properties. Properties refer to rules that indicate a standard procedure or method to be followed. A proof is a demonstration of.
Week 8 - Monday.  What did we talk about last time?  Properties of functions  One-to-one  Onto  Inverses  Cardinality.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 41 May 7, 2008.
Module Code MA1032N: Logic Lecture for Week Autumn.
The Relation Induced by a Partition
Representing Relations Using Digraphs
Relations and Functions
Introduction to Relations
Lecture # 14 Types of Relations
Representing Relations
Reflexivity, Symmetry, and Transitivity
Lecture 4.3: Closures and Equivalence Relations
Chapter 2 Sets and Functions.
Applied Discrete Mathematics Week 10: Equivalence Relations
CS2210 Discrete Structures Relations
8.5 Equivalence Relations
Mathematical Background 1
Algebra 1 Section 4.1.
Presentation transcript:

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 8.2 Reflexivity, Symmetry, and Transitivity

Definitions Informally, a relation R is Reflexive: Each element is related to itself. 2 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Definitions – cont’ Informally, a relation R is Symmetric: If any one element is related to any other element, then the second element is related to the first. 3 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Definitions – cont’ Informally, a relation R is Transitive: If any one element is related to a second and that second element is related to a third, then the first element is related to the third. 4 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Definitions – cont’ Let R be a relation on a set A. R is reflexive if, and only if, for all R is symmetric if, and only if, for all, if then. R is transitive if, and only if, for all x, y, z in A, if and, then Or, equivalently, R is reflexive for all R is symmetric for all if then R is transitive for all, if and, then 5 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Definitions – cont’ Let R be a relation on a set A. R is NOT reflexive There is an element x in A such that R is NOT symmetric There are elements x and y in A such that but. R is NOT transitive There are elements x, y, and z in A such that and but. 6 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Finite Sets Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: a.Is R reflexive? Symmetric? Transitive? b.Is S reflexive? Symmetric? Transitive? c.Is T reflexive? Symmetric? Transitive? Use the directed graph of R, S, and T to answer the questions. 7 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Finite Sets – cont’ Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: a.Is R reflexive? Symmetric? Transitive? 8 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Finite Sets – cont’ Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: a.Is R reflexive? Symmetric? Transitive? 9 Reflexive, Symmetric, but not Transitive. Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Finite Sets – cont’ Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: b.Is S reflexive? Symmetric? Transitive? 10 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Finite Sets – cont’ Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: b.Is S reflexive? Symmetric? Transitive? 11 Not Reflexive, not Symmetric, but Transitive. Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Finite Sets – cont’ Let A = {0, 1, 2, 3} and define relations R, S, and T on A as follows: c.Is T reflexive? Symmetric? Transitive? 12 Not Reflexive, not Symmetric, but Transitive. Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Relations on Infinite Sets Suppose a relation R is defined on an infinite set A. To prove the relation is reflexive, symmetric, or transitive, first write down what is to be proved. For instance, for symmetry you need to prove that Then, use the definitions of A and R to rewrite the statement for the particular case in question. For instance, for the “equality” relation on the set of real numbers, the rewritten statement is Sometimes the truth of the rewritten statement will be immediately obvious. 13 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Equality Define a relation R on R as follows: For all real numbers x and y, a.Is R reflexive? b.Is R symmetric? c.IS R transitive? 14 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Equality – cont’ Define a relation R on R as follows: For all real numbers x and y, a.Is R reflexive? This is true since for all b.Is R symmetric? This is true since for all c.IS R transitive? This is true since for all 15 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Less Than Define a relation R on R as follows: For all real numbers x and y, a.Is R reflexive? b.Is R symmetric? c.IS R transitive? 16 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

Properties of Less Than Define a relation R on R as follows: For all real numbers x and y, a.Is R reflexive? This is NOT true since for all For example, b.Is R symmetric? This is NOT true since for all c.IS R transitive? This is true since for all 17 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

The Transitive Closure of a Relation Let A be a set and R a relation on A. The transitive closure of R is the relation on A that satisfies the following three properties: 1. is transitive If S is any other transitive relation that contains R, then 18 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

The Transitive Closure of a Relation – cont’ Q) Let A ={0,1,2,3} and consider the relation R defined on A as follows: Find the transitive closure of R. A) Every ordered pair in R is in, so Thus the directed graph of R contains the arrows shown below. 19 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University

The Transitive Closure of a Relation – cont’ 20 Fall 2015 COMP 2300 Department of Mathematics and Physics Donghyun (David) Kim North Carolina Central University