

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Cs173 discrete mathematical structures spring 2006 homework #12, focusing on relation basics and equivalence relations. Students are required to determine reflexivity, symmetry, and transitivity of various relations, as well as their transitive closures. Additionally, they must prove that a relation is an equivalence relation and find the number of equivalence classes. The document also covers poset and hasse diagrams.
Typology: Slides
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Relation Basics 1. Determine the reflexivity, symmetry, and transitivity of the following relations: a. (^) R = โ
on set S = {0,1, 2, 4, 6}. b. R = {(0,1), (1, 0), (2, 4), (4, 2), (4, 6), (6, 4)}on set S ={0,1, 2, 4, 6} i. Determine its reflexivity, symmetry, and transitivity ii. What is its transitive closure? c. xRy โ x โ y is a multiple of 3 on set S = ] d. xRy โ| x | |โ y |on set S ={1, 2,3, 4,5, 6, 7,8,9} e. ( x 1 (^) , y 1 (^) ) R x ( 2 (^) , y 2 (^) ) โ x 1 (^) โค x 2 (^) , y 1 (^) โฅ y 2 on set S = ร
Equivalence Relations 3. a. Prove that a relation R defined as ( , a b R c d ) ( , )โ a + d = b + c is an equivalence relation on ] ร]. b. Determine the number of equivalence classes for R under set {0,1, 2, โ โ โ , } n ร{0,1, 2, โ โ โ , } n.
POSET and Hasse Diagram 4. Consider the POSET P = ({โ ,{ },{{ }},{ , a a a โ },{{ , a โ }, โ },{ ,{ }, a a โ }}, โ) a. Draw the Hasse diagram for this POSET. b. What are the maximal elements? Is there a greatest element? If yes, whatis it? c. What is(are) the lower bound(s) of {{{ , a โ }, โ },{ ,{ }, a a โ }}? What is the greatest lower bound of {{{ }}} a?