1.7k views

Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A

$\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$

1. List the ordered pairs of the equivalence relations induced by $\Pi_1$.

2. Draw the graph of the above equivalence relation.

3. Let $\Pi_2 = \left\{\left\{a\right\}, \left\{b\right\}, \left\{c\right\}, \left\{d\right\}\right\}$

$\Pi_3 = \left\{\left\{a, b, c, d\right\}\right\}$

and $\Pi_4 = \left\{\left\{a, b\right\}, \left\{c,d\right\}\right\}$

Draw a Poset diagram of the poset, $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.

recategorized | 1.7k views
+6

.

................................

Interchange

$\Pi_2\ <-> \Pi_4\\ \Pi_1\ <-> \Pi_3$

0

Tuhin Dutta $\prod$3 refines both $\prod$4 and $\prod$1

am i right?

0

a. For Calculating Ordered Pairs Just multiply the partition with itself.

$\{a,b,c\} * \{a,b,c\} = \{ (a,a),(a,b),(a,c),(b.a),(b,b),(b,c),(c,a),(c,b),(c,c)\}$

$\{d\}*\{d\} = \{(d,d)\}$

$\therefore$ The ordered pairs of the equivalence relations are $= \{ (a,a),(a,b), (a,c), (b,a), (b,b), (b,c), (c,a), (c,b), (c,c),(d,d) \}$

b. For each ordered pair $(a,b)$ in the equivalence relation just make a directed edge from a towards $b$.

c. Suppose we have two partitions of a set $S:P_1={A_1,A_2,A_3...}\ and\ P_2={B_1,B_2,B_3...}$

We say that $P_1$ is a refinement of $P_2$ if every $A_i$ is a subset of some $B_j$ . Or We can say that $P_1$ refines $P_2$

by Boss (17.2k points)
selected by
0
What's the relation between the graph in part B and Hasse diagram?
+1
The Graph in part B is not a partial order relation because it is not antisymmetric.

So we can't draw the Hasse Daigram for it because if we try to draw it then there will be edges present between the nodes which are at equal level which is not allowed in hasse daigram.
0

@Satbir

Can u tell me one thing, that why poset need to be antisymmetric always? I mean what is logic behind?

and Are we draw Hasse diagram with self loop always? Then how Hasse diagram maintain poset property?

0

@srestha Have you completed verbal ability portions for GATE? I mean have you solved all previous year questions in them?

+1
Hasse Daigram is made for Poset.
Poset are Reflexive, transitive and antisymmetric. Its the definition of a Poset.
If a relation is Reflexive, Symmetric and transitive then it is an equivalence relation.

When we convert a graph to a Hasse Daigram then we remove Self loops(i.e. reflexive property) and also transitive edges(i.e. transitive property) So the only property that configures the structure of hasse Daigam is the Antisymmetric property.
i.e. Hasse Daigram is mainly used to represent the antisymmetric property.

So if you the don't obey the Antisymmetric property then there is no meaning in making the Hasse Daigram.
0

@Arjun Sir

I have no book for it. Yes chked prev year ques once. but why?

@Satbir

When we convert a graph to a Hasse Daigram then we remove Self loops(i.e. reflexive property) and also transitive edges(i.e. transitive property) So the only property that configures the structure of hasse Daigam is the Antisymmetric property.
i.e. Hasse Daigram is mainly used to represent the antisymmetric property.

So if you the don't obey the Antisymmetric property then there is no meaning in making the Hasse Daigram.

from where u got this? yes, logic may be correct.

0
Logic is my own and the above i derived from the steps to convert a graph into hasse daigram.
0
ok yes correct.
(a) The ordered pairs of the equivalence relations induced $= \{ (a,a),(a,b), (a,c), (b,a), (b,b), (b,c), (c,a), (c,b), (c,c),(d,d) \}$

PS: equivalence relations = each partition in power set - $\phi$
by Active (2.6k points)
+20
we can find the same by { {a,b,c} ${\times }$ {a,b,c} , {d} ${\times }$  {d} }

= { (a,a), (a,b), (a,c), (b,a), (b,b), (b,c), (c,a), (c,b) ,(c,c), (d,d) }
0
what about (b) and (c) ?
0
c.) Make the graph according to the given connected vertices below.
PI1----->PI3
PI4----->PI3
PI2----->PI4
PI2----->PI1
+1

Equivalence relation is reflexive, symmetric and transitive.

But that does not means that all symmetric and transitive pairs should be there, right? We can just have
reflexive pairs also, right? Like this: $\{(a,a),(b,b),(c,c),(d,d)\}$

Will it make difference if we notice that the question does not at all make use of word "equivalence class", but use word "equivalence relation", what you say? I guess it makes difference if we think of the following three points:

1. "equivalence relation" has no such restriction that each elements in the set should be related to each other, which is the restriction put by "equivalence class".

2. Set of all "equivalence classes" form partition, but the converse is not true, that is

3. Partition is made of sets which may or may not be "equivalence classes". The only criteria is that they should be disjoint and their union should be original set.

I guess after considering these facts, we are allowed to have only reflexive pairs, or even some symmetric and transitive pairs, if not all, right?

+6

Hasse diagram

You can interchange $\prod_1$ and $\prod_4$ as they are unrelated

0
@Ayush I am not understanding the a) part of the question please explain it
+3
@Prince -You must be knowing the two way theorem

Every Equivalence relation induces a partition on a set if and only if Every partition of the set induces an equivalence relation on the set.

Now to find the ordered pairs from the partition, simply take cross product of the partitions among themselves.
+2

A partition α of a set X is a refinement of a partition ρ of X—and we say that α is finerthan ρ and that ρ is coarser than α—if every element of α is a subset of some element of ρ. Informally, this means that α is a further fragmentation of ρ. In that case, it is written that α ≤ ρ.

https://en.wikipedia.org/wiki/Partition_of_a_set#Refinement_of_partitions

0

@Ayush Upadhyaya you mean to say cross product of equivalence classes? coz equivalence relation divide set into disjoint classes.

0
Yes, and those classes form the biggest equivalence relation possible on the set.
0

,how we will draw part (b)

0

@codingo1234-Do you know what refines relation means?

0

@,earlier I was not knowing what "refines relation" means ,but I saw 's comment and came to know about when a partition is refinement of other

"A partition α of a set X is a refinement of a partition ρ of X—and we say that α is finer than ρ and that ρ is coarser than α—if every element of α is a subset of some element of ρ. Informally, this means that α is a further fragmentation of ρ. In that case, it is written that α ≤ ρ." ,

but I was confused regarding drawing graph of equivalence relation of part(a) and I was thinking about hasse digaram(god knows  why everything mixes up in mind),I think it will be directed graph,am i correct?

by Active (2.6k points)

1
2