- Which of these relations on {0, 1, 2,3) are equivalence relations? Determine the properties of an equivalence relation that the others lack.
a) {(0, 0), (1, 1), (2, 2), (3, 3)}
b) {(0, 0), (0, 2), (2, 0), (2, 2), (2, 3), (3, 2), (3,3)}
c) {(0, 0), (1, 1), (1, 2), (2, 1), (2, 2), (3, 3)}
4) {(0, 0), (1, 1), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3,3)}
e) {(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 2), (3, 3)}
Want to see the full answer?
Check out a sample textbook solutionChapter 9 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Additional Math Textbook Solutions
Numerical Analysis
Algebra and Trigonometry: Graphs and Models (6th Edition)
Differential Equations: An Introduction to Modern Methods and Applications
A Problem Solving Approach to Mathematics for Elementary School Teachers (12th Edition)
Mathematics for Elementary Teachers with Activities (5th Edition)
Calculus for Business, Economics, Life Sciences, and Social Sciences (14th Edition)
- a. Let R be the equivalence relation defined on Z in Example 2, and write out the elements of the equivalence class [ 3 ]. b. Let R be the equivalence relation congruence modulo 4 that is defined on Z in Example 4. For this R, list five members of equivalence class [ 7 ].arrow_forwardDoes the relation is a brother of have a reflexive property consider one male? A symmetric property consider two males? A transitive property consider three males?arrow_forwardProve Theorem 1.40: If is an equivalence relation on the nonempty set , then the distinct equivalence classes of form a partition of .arrow_forward
- What are the equivalence classes of the equivalence relations on {0, 1, 2, 3}?arrow_forwardEquivalence relation of {0,1,2,3}arrow_forwardLet A = {0,1,2,3} and R a relation over A: R = {(0,0),(0,1),(0,3),(1,1),(1,0),(2,3),(3,3)} Check whether R is an equivalence relation or a partial order. Give a counterexample in each case in which the relation does not satisfy one of the properties of being an equivalence relation or a partial order.arrow_forward
- True or False? Let R be an equivalence relation on A = {w, x, y, z}. If wRx, yRz, and wRz, then xRy.arrow_forwardHow many equivalence relations on the set {1, 2, 3}?arrow_forwardEither show the following relations on {0, 1, 2, 3} is an equivalence relation, or show which qualities of an equivalence relation it lacks: a. {(0, 0), (1, 1), (1, 2), (2, 1), (2, 2), (3, 3)} b. { (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 2), (3, 3)}arrow_forward
- Let R ⊆ ℝ×ℝ with R={(x,y)|⌈x⌉=⌈y⌉}, that is, x and y round up to the same number. Characterize R in terms of whether it is reflexive, irreflexive, symmetric, anti-symmetric, transitive, complete, any sort of ordering relation, and/or an equivalence relation. This is not a formal proof but briefly explain your reasoning.arrow_forwardLet A = {1, 2, 3, 4, 5, 6, 7, 8}. How many possible symmetric relations over A contain the ordered pairs (2, 3), (3, 2), (4, 7), (5, 5) and (8, 7)?arrow_forwardDefine 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_forward
- Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,Elementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,