lect10_1 - Todays topics: Reflexive, symmetric and...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Today’s topics: Reflexive, symmetric and transitive closures of relations Equivalence relations
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Closures A closure “extends” a relation to satisfy some property. But extends it as little as possible. Definition. The closure of relation R with respect to property P is the relation S that i) contains R ii) satisfies property P iii) is contained in any relation satisfying i) and ii). That is S is the “smallest” relation satisfying i) and ii).
Background image of page 2
3 Just a reminder: reflexive: aRa symmetric: aRb bRa transitive: aRb bRc aRc anti-symmetric: aRb bRa a = b , i. e. 2200 a b , aRb ¬ bRa
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Lemma 1. The reflexive closure of R is S = R {( a , a ) | a A } =r ( R ) . S contains R and is reflexive by design. Furthermore, any relation satisfying i) must contain R , any satisfying ii) must contain the pairs ( a , a ), so any relation satisfying both i) and ii) must contain S Proof. In accordance to the definition of a closure, we need to prove three things to show that S is reflexive closure: i) S contains R ii) S is reflexive iii) S is the smallest relation satisfying i) and ii).
Background image of page 4
5 Example: R ={( a , b ), ( a , c ), ( b , d ), ( d , e )} a b c d e a 0 1 1 0 0 b 0 0 0 1 0 c 0 0 0 0 0 d 0 0 0 0 1 e 0 0 0 0 0 R a b c d e a 1 1 1 0 0 b 0 1 0 1 0 c 0 0 1 0 0 d 0 0 0 1 1 e 0 0 0 0 1 S = r ( R ) S ={( a , b ), ( a , c ), ( b , d ), ( d , e ), ( a , a ), ( b , b ), ( c , c ), ( d , d ), ( e , e )}
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 Sometimes the relation on A that consists of all loops is called identity relation on A , i. e. I A = {( a , a )| a A } Then reflexive closure of a relation R A × A is r ( R )= R I A Example of a reflexive closure. Let A be any set and consider the relation on Power( A ) R = {( x , y ) Power( A ) × Power( A ) | x y } The reflexive closure of R would be the relation: R I Power( A ) ={( x , y ) Power( A ) × Power( A )|( x , y ) R or ( x , y ) I Power( A ) } ={( x , y ) Power( A ) × Power( A )| x
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 07/14/2011.

Page1 / 18

lect10_1 - Todays topics: Reflexive, symmetric and...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online