Question
6.9.3:Equivalence relations and transitive closures. (a) Prove that the transitive closure of a symmetric relation is also symmetric. (b) Use the result from the previous
(a)
Prove that the transitive closure of a symmetric relation is also symmetric.
(b)
Use the result from the previous problem to argue that if P is reflexive and symmetric, then P+is an equivalence relation.
(c)
Is it possible to have a relation R that is symmetric but R+is not an equivalence relation?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
An Introduction to the Mathematics of Financial Derivatives
Authors: Ali Hirsa, Salih N. Neftci
3rd edition
012384682X, 978-0123846822
