Chapter 9: Q15E (page 581)
Can a relation on a set be neither reflexive nor irreflexive?
Short Answer
For example, \(A = \{ 1,2,3,4\} \) has set as \(\{ (1,1),(1,2),(3,4),(4,4)\} \) which is neither reflexive nor irreflexive.
Chapter 9: Q15E (page 581)
Can a relation on a set be neither reflexive nor irreflexive?
For example, \(A = \{ 1,2,3,4\} \) has set as \(\{ (1,1),(1,2),(3,4),(4,4)\} \) which is neither reflexive nor irreflexive.
All the tools & learning materials you need for study success - in one app.
Get started for freeTo 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\} \)
What do you obtain when you apply the selection operator \({s_C}\), where \(C\) is the condition Destination = Detroit, to the database in Table 8?
Adapt Algorithm 1 to find the reflexive closure of the transitive closure of a relation on a set with \(n\) elements.
Suppose that \(R\) and \(S\) are reflexive relations on a set \(A\).
Prove or disprove each of these statements.
a) \(R \cup S\) is reflexive.
b) \(R \cap S\) is reflexive.
c) \(R \oplus S\) is irreflexive.
d) \(R - S\) is irreflexive.
e) \(S^\circ R\) is reflexive.
Display the table produced by applying the projection \({P_{1,2,4}}\) to Table 8.
What do you think about this solution?
We value your feedback to improve our textbook solutions.