Chapter 9: Q24E (page 582)
To determine an example of an asymmetric relation on the set of all people.
Short Answer
Let be a relation on the set of all people such that if and only if a has one inch longer hair than .
Chapter 9: Q24E (page 582)
To determine an example of an asymmetric relation on the set of all people.
Let be a relation on the set of all people such that if and only if a has one inch longer hair than .
All the tools & learning materials you need for study success - in one app.
Get started for freeLet \(R\) be the relation \(\{ (a,b)\mid a \ne b\} \) on the set of integers. What is the reflexive closure of \(R\)?
Exercises 34–37 deal with these relations on the set of real numbers:
\({R_1} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a > b} \right\},\)the “greater than” relation,
\({R_2} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ge b} \right\},\)the “greater than or equal to” relation,
\({R_3} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a < b} \right\},\)the “less than” relation,
\({R_4} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \le b} \right\},\)the “less than or equal to” relation,
\({R_5} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a = b} \right\},\)the “equal to” relation,
\({R_6} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ne b} \right\},\)the “unequal to” relation.
34. Find
(a) \({R_1} \cup {R_3}\).
(b) \({R_1} \cup {R_5}\).
(c) \({R_2} \cap {R_4}\).
(d) \({R_3} \cap {R_5}\).
(e) \({R_1} - {R_2}\).
(f) \({R_2} - {R_1}\).
(g) \({R_1} \oplus {R_3}\).
(h) \({R_2} \oplus {R_4}\).
Assuming that no new \(n\)-tuples are added, find a composite key with two fields containing the Airline field for the database in Table 8.
How can the directed graph representing the reflexive closure of a relation on a finite set be constructed from the directed graph of the relation?
What is the covering relation of the partial ordering \(\{ (A,B)\mid A \subseteq B\} \) on the power set of \(S\), where \(S = \{ a,b,c\} \).
What do you think about this solution?
We value your feedback to improve our textbook solutions.