Recall that binary relations are merely sets of pairs of elements of some set. Therefore if R and Q are binary relations on a same set A, their union R ∪ Q as sets of pairs is also a binary relation on A. Is it true that if R and Q are antisymmetric then R ∪ Q is also antisymmetric? Prove that it is or give a counterexample.

Recall that binary relations are merely sets of pairs of elements of some set. Therefore if R and Q are binary relations on a same set A, their union R ∪ Q as sets of pairs is also a binary relation on A. Is it true that if R and Q are antisymmetric then R ∪ Q is also antisymmetric? Prove that it is or give a counterexample.

Algebra and Trigonometry (6th Edition)

6th Edition

ISBN:9780134463216

Author:Robert F. Blitzer

Publisher:Robert F. Blitzer

ChapterP: Prerequisites: Fundamental Concepts Of Algebra

Section: Chapter Questions

Problem 1MCCP: In Exercises 1-25, simplify the given expression or perform the indicated operation (and simplify,...

See similar textbooks

Similar questions

Assume R1 and R2 are reflective relations on a set A. Prove or disprove each of the following statements. (a) R1 U R2 is reflexive. (b) Rị N R2 is reflexive.
This question refers to unions and intersections of relations. Since relations are subsets of Cartesian products, their unions and intersections can be calculated as for any subsets. Given two relations R and S from a set A to a set B, RUS = {(x, y) E AXB I (x, y) ER or (x, y) E S} RNS = {(x, y)E AXB| (x, y) ER and (x, y) Es}. Let A = {-2, 2, 3, 5} and B = {2, 3} and define relations R and S from A to B as follows: For every (x, y) E Ax B, x R y - |x| = lyl and xsyex - y is even. Using set-roster notation, state explicitly which ordered pairs are in A x B, R, S, RU S, and RN s. (Enter your answers as comma-separated lists of ordered pairs.) AXB = R = S = RUS = ROS =
2. For each of these relations on the set {1, 2, 3, 4), decide whether it is reflexive, whether it is symmetric, whether it is antisymmetric, and whether it is transitive. a) {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)} b) {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4,4)} c) {(2, 4), (4, 2)} d) {(1, 2), (2, 3), (3, 4)} e) {(1, 1), (2, 2), (3, 3), (4,4)} f) {(1, 3), (1, 4), (2, 3), (2, 4), (3, 1), (3, 4)}
1. Let A = {1,2,3,4,5,6), and consider the following equivalence relation on A: R = {(1, 1), (2, 2), (3, 3), (4,4), (5,5), (6, 6), (2, 3), (3, 2), (4, 5), (5, 4), (4, 6), (6,4), (5,6), (6,5)} List the equivalence classes of R. 2. Let A = {a,bed el Suppose A is an equivalence relation on 4. Suppose R bes two equivaler.se alasses. Also wad, Re and aRd Write out R as a cot 3. Let A = {a,b,c,d,e}. Suppose R is an equivalence relation on A. Suppose R has three equivalence classes. Also aRd and bRc. Write out R as a set. 4. Let A {a,b,c,d,e). Suppose A is an equivalence relation on 4. Suppose also that anta and one, aRa and cite. How many equivalones classes dees At have! CIV 5. There are two different equivalence relations on the set A = {a,b}. Describe them. Diagrams will suffice.
In 1-8 a number of relations are defined on the set A = {0, 1, 2, 3}.For each relation: a.) Draw the directed graph.b.) Determine whether the relation is reflexive.c.) Determine whether the relation is symmetric.d.) Determine whether the relation is transitive. Give a counterexample in each case in which the relation does not satisfyone of the properties.
Solve in 10 min
Let R and S be reflexive relations over set A. Prove or disprove that RnS is reflexive
Let R and S be equivalence relations on a set A; recall that by definitionR, S ⊆ A × A. Prove that R ∩ S is an equivalence relation.