t the ordered pairs in the equivalence relations produced by these partitions of { a , b , c , d , e , f , g } . a) { a , b } , { c , d } , { e , f , g } b) { a } , { b } , { c , d } , { e , f } , { g } c) { a , b , c , d } , { e , f , g } d) { a , c , e , g } , { b , d } , { f } A partition P 1 is called a refinement of the partition P 2 if every set in P 1 is a subset of one of the sets in P 2 .
t the ordered pairs in the equivalence relations produced by these partitions of { a , b , c , d , e , f , g } . a) { a , b } , { c , d } , { e , f , g } b) { a } , { b } , { c , d } , { e , f } , { g } c) { a , b , c , d } , { e , f , g } d) { a , c , e , g } , { b , d } , { f } A partition P 1 is called a refinement of the partition P 2 if every set in P 1 is a subset of one of the sets in P 2 .
Solution Summary: The author explains the equivalence relations produced by lefta,b,c,d,e,f,gright.
Which relation on the set {a, b, c, d} are equivalence relations and contain
(i) (b, c) and (c, d)
(ii) (a, b) and (b, d)
8. List the ordered pairs in the equivalence relations produced by these partitions of
{a, b, c, d, e, f, g}.
(a) {a,b}, {c, d}, {e, f, g}
(b) {a}, {b}.{c,d}, {e, f}, {g}
3. Let A = {1,2,3,4,5,6}. Given the equivalence relation
R =
{(1,1), (2,2), (3,3), (4,4), (5,5), (1,3), (3,1), (6,6), (2,4), (4,2), (4,5), (2,5), (5,4), (5,2)}
on A. Find the equivalence class of each element of A. How many distinct
equivalence classes are there on A.
Chapter 9 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
RELATIONS-DOMAIN, RANGE AND CO-DOMAIN (RELATIONS AND FUNCTIONS CBSE/ ISC MATHS); Author: Neha Agrawal Mathematically Inclined;https://www.youtube.com/watch?v=u4IQh46VoU4;License: Standard YouTube License, CC-BY