e an example to show that ifRandSare bothn-ary relations, then
Want to see the full answer?
Check out a sample textbook solutionChapter 9 Solutions
DISCRETE MATHEMATICS+ITS APPL. (LL)-W/A
- Let and be lines in a plane. Decide in each case whether or not is an equivalence relation, and justify your decisions. if and only ifand are parallel. if and only ifand are perpendicular.arrow_forwardFor determine which of the following relations onare mappings from to, and justify your answer. b. d. f.arrow_forwardIn Exercises , prove the statements concerning the relation on the set of all integers. 18. If and , then .arrow_forward
- 7. (Relations) Consider the set A = (1,2,3, 4, 5}, and a relation R defined by zRy - 2-y is an integer multiple of 3. (a) List all elements y for which 1Ry is true. (b) Is R reflexive? Justify. (c) Is R symmetric? Justify. (d) Is R antisymmetric? Justify. (e) Is R transitive? Justify.arrow_forward7. (Relations) Consider the set A = {1,2,3, 4, 5), and a relation R defined by zRy - 2-y is an integer multiple of 3. (a) List all elements y for which LRy is true. (b) Is R reflexive? Justify. (e) Is R symmetric? Justify. (d) Is Rantisymmetrie? Justify. (e) Is R transitive? Justify.arrow_forward7. (Relations) Consider the set A= {1,2, 3, 4, 5}, and a relation R defined by x Ry x2 – y is an integer multiple of 3. (a) List all elements y for which 1Ry is true. (b) Is R reflexive? Justify. (c) Is R symmetric? Justify. (d) Is R antisymmetric? Justify. (e) Is R transitive? Justify.arrow_forward
- 15 Part 2 of 4 Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the following relations: R₁ = {(a, b) = R² | a> b), the greater than relation R₂ = {(a, b) ER² | a2 b), the greater than or equal to relation R3 = {(a, b) ER² | a< b), the less than relation R₁ = {(a, b) ER² | a ≤ b), the less than or equal to relation R₁ = {(a, b) = R² | a = b), the equal to relation R6 = {(a, b) ER² | a b), the unequal to relation For these relations on the set of real numbers, find R₁⁰ R₁. Multiple Choice O O R₁ O R4arrow_forwardFor each of the relations on A = {0, 1, 2, 3} belowR = {(0, 0),(0, 1),(0, 3),(1, 0),(1, 1),(2, 2),(3, 0),(3, 3)},S = {(0, 0),(0, 2),(0, 3),(2, 3)},T = {(0, 1),(2, 3)}determine whether they are reflexive, symmetric or transitive. List all that apply andjustify your answers.arrow_forward8 Part 4 of 4 Required information NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Consider the following relations: R₁ = {(a, b) = R² | a> b), the greater than relation R₂ = [(a, b) E R² | a² b), the greater than or equal to relation R3 = {(a, b) ER² | a< b), the less than relation R₁ = {(a, b) ER² | a ≤ b), the less than or equal to relation R₁ = {(a, b) = R² | a = b), the equal to relation R6 = [(a, b) = R² | a b), the unequal to relation For these relations on the set of real numbers, find R3 Ⓒ R5. Multiple Choice O O O 0 R4 R₂ R₁arrow_forward
- Define relations R 1 , … , R 6 on { 1 , 2 , 3 , 4 } by R 1 = { ( 2 , 2 ) , ( 2 , 3 ) , ( 2 , 4 ) , ( 3 , 2 ) , ( 3 , 3 ) , ( 3 , 4 ) } , R 2 = { ( 1 , 1 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) } , R 3 = { ( 2 , 4 ) , ( 4 , 2 ) } , R 4 = { ( 1 , 2 ) , ( 2 , 3 ) , ( 3 , 4 ) } , R 5 = { ( 1 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) } , R 6 = { ( 1 , 3 ) , ( 1 , 4 ) , ( 2 , 3 ) , ( 2 , 4 ) , ( 3 , 1 ) , ( 3 , 4 ) } , Which of the following statements are correct? Check ALL correct answers below. A. R 2 is not transitive B. R 4 is antisymmetric C. R 5 is transitive D. R 6 is symmetric E. R 3 is transitive F. R 3 is reflexive G. R 3 is symmetric H. R 2 is reflexive I. R 4 is transitive J. R 5 is not reflexive K. R 4 is symmetric L. R 1 is not symmetric M. R 1 is reflexivearrow_forward13 - Let A={0,1,2,3} and R be the following relation on A: R= {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 2), (3, 3)} It is symmetric ?arrow_forwardVIII.1. Let A = {1,2, 3, 4} and let R, S, T and U be the following relations: R= {(1,3), (3, 2), (2, 1), (4, 4)}, S = {(2,1), (3, 3), (4, 2)}, T = {(4,1), (4, 2), (3, 1), (3, 2), (1, 2)}, U = {(x, y) | x > y}. (a) For each of R, S, T and U determine whether they are functional, reflexive, symmetric, anti-symmetric or transitive. Explain your answer in each case, showing why your answer is correct. (b) What is the transitive closure of R? (c) Explain why R", the transitive closure of R, is an equivalence relation. De- scribe the equivalence classes E, into which the relation partitions the set A. VIII.2. Prove or give a counterexample to the following statement: for any relation R both R and RoR always have the same transitive closure. VIII.3. Is there a mistake in the following proof that any transitive and symmetric relation Ris reflexive? If so, what is it? Let a Rb. By symmetry, bRa. By transitivity, if aRb and bRa, then aRa. This proves reflexivity. VIII.4. Determine for the…arrow_forward
- Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage LearningAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage