Let R and S be relations on a set A. Prove or give a counterexample for each of the following.
(a) If R and S are reflexive, then R ∩ S is reflexive.
(b) If R and S are reflexive, then R ∪ Sis reflexive.
(c) lf R and S are symmetric, then R ∩ S is symmetric.
(d) lf R and S are symmetric, then R ∪ S is symmetric.
(e) If R and S are transitive, then R ∩ S is transitive.
(f) If R and S are transitive, then R ∪ S is transitive.
(g) lf R and S are equivalence relations, then R ∩ S is an equivalence relation.
(h) lf R and S are equivalence relations, then R ∪ S is an equivalence relation.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.