Chapter 9: Q3E (page 581)
To determine for each of these relations on the set decide whether it is reflexive, whether it is symmetric, whether it is anti symmetric, and whether it is transitive .
Short Answer
It is none of the relations.
Chapter 9: Q3E (page 581)
To determine for each of these relations on the set decide whether it is reflexive, whether it is symmetric, whether it is anti symmetric, and whether it is transitive .
It is none of the relations.
All the tools & learning materials you need for study success - in one app.
Get started for freeFind the error in the "proof" of the following "theorem."
"Theorem": Let \(R\) be a relation on a set \(A\) that is symmetric and transitive. Then \(R\) is reflexive.
"Proof": Let \(a \in A\). Take an element \(b \in A\) such that \((a,b) \in R\). Because \(R\) is symmetric, we also have \((b,a) \in R\). Now using the transitive property, we can conclude that \((a,a) \in R\) because \((a,b) \in R\)and \((b,a) \in R\).
How many transitive relations are there on a set with \(n\) elements if
a) \(n = 1\) ?
b) \(n = 2\) ?
c) \(n = 3\) ?
To prove that the relation \(R\) on set \(A\) is anti-symmetric, if and only if \(R \cap {R^{ - 1}}\) is a subset of the diagonal relation \(\Delta = \{ (a,a)\mid a \in A\} \)
To determine an algorithm using the concept of interior vertices in a path to find the length of the shortest path between two vertices in a directed graph, if such a path exists.
Show that the relationon a non-empty set is symmetric and transitive, but not reflexive.
What do you think about this solution?
We value your feedback to improve our textbook solutions.