Discrete Mathematics Homework 12: Relation Basics and Equivalence Relations, Slides of Discrete Mathematics

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

2012/2013

Uploaded on 04/27/2013

atmaja
atmaja ๐Ÿ‡ฎ๐Ÿ‡ณ

4.2

(45)

181 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CS173: Discrete Mathematical Structures
Spring 2006
Homework #12
Due 04/30/06, 8am
Relation Basics
1. Determine the reflexivity, symmetry, and transitivity of the following relations:
a. R=โˆ…on set {0,1,2,4,6}S=.
b. {(0,1),(1,0),(2,4),(4,2),(4,6),(6,4)}R=on set {0,1,2,4,6}S
=
i. Determine its reflexivity, symmetry, and transitivity
ii. What is its transitive closure?
c.
x
Ry x y
โ†”
โˆ’is a multiple of 3 on setS
=
๎™
d. ||||
x
R
y
x
y
โ†”
โ‰ on set {1,2,3,4,5,6,7,8,9}S
=
e. 11 2 2 1 21 2
(, )( , ) ,
xy
Rx
y
xx
yy
โ†”โ‰ค โ‰ฅon set S
ร—๎™ ๎™ 
2. 1
R
and 2
R
are two relations on a set S.
a. If 1
R
and 2
R
are reflexive, is 12
R
Rโˆฉreflexive? Is 12
R
Rโˆชreflexive? Explain
your answer.
b. If 1
R
and 2
R
are transitive, is 12
R
Rโˆฉtransitive? Is 12
R
Rโˆชtransitive? Explain
your answer.
c. Can 1
R
be symmetric and antisymmetric at the same time? Why or why
not?
d. Can 1
Rbe neither symmetric nor antisymmetric? Why or why not?
Equivalence Relations
3.
a. Prove that a relation R defined as (,) (, )abRcd a d b c
โ†”
+=+is an
equivalence relation on
ร—
๎™๎™
.
b. Determine the number of equivalence classes for R under set
{0, 1, 2 , , } {0, 1, 2, , }nnโ‹…โ‹…โ‹… ร— โ‹…โ‹…โ‹… .
Docsity.com
pf2

Partial preview of the text

Download Discrete Mathematics Homework 12: Relation Basics and Equivalence Relations and more Slides Discrete Mathematics in PDF only on Docsity!

CS173: Discrete Mathematical Structures

Spring 2006

Homework

Due 04/30/06, 8am

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 = ร—

  1. R 1 and R 2 are two relations on a set S. a. If R 1 and R 2 are reflexive, is R 1 (^) โˆฉ R 2 reflexive? Is R 1 (^) โˆช R 2 reflexive? Explain your answer. b. If R 1 and R 2 are transitive, is R 1 (^) โˆฉ R 2 transitive? Is R 1 (^) โˆช R 2 transitive? Explain your answer. c. Can R 1 be symmetric and antisymmetric at the same time? Why or why not? d. Can R 1 be neither symmetric nor antisymmetric? Why or why not?

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.

Docsity.com

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?

Docsity.com