Let ρ be a relation on a set A. Define ρ^−1 = {(b, a) | (a, b) ∈ ρ}. Also, for two relations ρ, σ on A, define the composite relation ρ ◦ σ as (a, c) ∈ ρ ◦ σ if and only if there exists b ∈ A such that (a, b) ∈ ρ and (b, c) ∈ σ. Prove the following assertions. i.) If ρ is non-empty, then ρ is an equivalence relation if and only if ρ^−1 ◦ ρ = ρ.
The Answer to the Question
is below this banner.
Can't find a solution anywhere?
NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?
Get the Answers Now!You will get a detailed answer to your question or assignment in the shortest time possible.
Here's the Solution to this Question
If , then can be not an equivalence relation. Indeed, if and , then , but , so is not an equivalence relation on .
We prove that if , then is an equivalence relation on .
Indeed,
1)Let . Since , there is such that , that is , and .
Since , we have , so . And since , we similarly obtain .
So is reflexive on .
2)Let . Then and by point 1) we have , so . So is symmetric on .
3)Let . By point 2) we have , that is . So since , we have .
So is transitive on .
We obtain that is an equivalence relation on .
Now let be an equivalence relation on a set . Note that then . Prove that .
Since is symmetric, we have , so . Since is transtitive, we have , that is .
Now prove that .
Indeed, let . We have , so , that is . Then . So we obtain .
We have .
So we proved that if and only if is an equivalence relation on