Scribd
Upload
34 views3 pages

Discussion 10 Fall 2019 PDF

This document contains notes from Discrete Mathematics discussion 10 covering relations, equivalence relations, partial orders, and total orders. It includes definitions of these concepts and 10 problems examining properties of relations such as determining if they are equivalence relations, finding transitive closures, and analyzing partially ordered sets for maximal/minimal elements and least/greatest bounds.

Uploaded by

sam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views3 pages

Discussion 10 Fall 2019 PDF

This document contains notes from Discrete Mathematics discussion 10 covering relations, equivalence relations, partial orders, and total orders. It includes definitions of these concepts and 10 problems examining properties of relations such as determining if they are equivalence relations, finding transitive closures, and analyzing partially ordered sets for maximal/minimal elements and least/greatest bounds.

Uploaded by

sam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

EECS 203: Discrete Mathematics

Fall 2019
Discussion 10 Notes
1 Definitions
• Reflexive, Symmetric, Antisymmetric, and Transitive Relations:

• Composite of Two Relations:

• Power of a Relation:

• Closure of a Relation:

• Equivalence Relations

• Equivalence Class

• Partition

• Partial order

• Total order

1. Exercise 9.3.9
How many nonzero entries does the matrix representing the relation R on A = {1, 2, 3, ..., 100}
consisting of the first 100 positive integers have if R is:

a) {(a, b)|a > b}


b) {(a, b)|a 6= b}
d) {(a, b)|a = 1}
e) {(a, b)|ab = 1}

2. Exercise 9.3.31
Let R be a relation on a set A. Explain how to use the directed graph representing R to
obtain the directed graph representing the inverse relation R−1 .

1
3. Section 9.4 Problem 24
Suppose that the relation R is irreflexive. Is the relation R2 necessarily irreflexive?

4. Exercise 9.4.26 (b)


Use Algorithm 1 to find the transitive closure of these relations on {a, b, c, d, e}.
(b) {(b, c), (b, e), (c, e), (d, a), (e, b), (e, c)}

5. Section 9.4 Problem 28 (b)


Use Warshall’s Algorithm to find the transitive closure of these relations on {a, b, c, d, e}.
(b) {(b, c), (b, e), (c, e), (d, a), (e, b), (e, c)}

6. Section 9.5 Problem 15


Let R be the relation on the set of ordered pairs of positive integers such that ((a, b), (c, d)) ∈
R iff a + d = b + c. Show that R is an equivalence relation.

7. Section 9.5 Problem 58


Each bead on a bracelet with three beads is either red, white, or blue, as illustrated in the
figure shown. Define the relation R between bracelets as: (B1 , B2 ), where B1 and B2 are
bracelets, belongs to R if and only if B2 can be obtained from B1 by rotating it or rotating
it and then reflecting it.

(a) Show that R is an equivalence relation.

(b) What are the equivalence classes of R?

8. Modified Section 9 Review Problem 21


How many different equivalence relations with exactly five different equivalence classes are
there on a set with seven elements?

9. Section 9.6 Problem 34


Answer these questions for the poset ({2, 4, 6, 9, 12, 18, 27, 36, 48, 60, 72}, |).

a) Find the maximal elements.

b) Find the minimal elements.

c) Is there a greatest element?

2
d) Is there a least element?

e) Find all upper bounds of {2, 9}.

f) Find the least upper bound of {2, 9}, if it exists.

g) Find all lower bounds of {60, 72}.

h) Find the greatest lower bound of {60, 72}, if it exists.

10. Section 9.6 Problem 36


Give a poset that has

(a) a minimal element but no maximal element

(b) a maximal element but no minimal element

(c) neither a maximal nor a minimal element

You might also like