in Set Theory & Algebra edited by
642 views
2 votes
2 votes

in Set Theory & Algebra edited by
642 views

4 Comments

@lakshman (3,4),(4,2)(4,3) would also be there
0
0
this relation will contain all the 16 order pair so 13 will be answer
0
0
sorry i miss some Transitive relation and Symmetric relation

$R=\left \{ (1,1),(2,2),(3,3),(4,4),(1,2),(1,4),(2,3),(2,1),(4,1),(3,2),(1,3),(3,1),(2,4),(4,2)(3,4),(4,3)\right \}$

So,answer is $13$
0
0

2 Answers

0 votes
0 votes
An easy way is by making a graph. We know an equivalence relation partitions the set into classes. Thus if u make a graph for this relation, it consists of only one partition P[1] = {1,2,3,4} = S1.

The no of ordered pairs contributed by a partiton is |S|^2. So total cardinality of R = |S1|^2  will be 4^2 = 16.

Given ordered pairs = 3

=> To be added = 16-3 = 13
0 votes
0 votes
In question it is clearly mention that it is equivalence relation and it is also given that (1,2) ,(1,4),(2,3) are pairs hence by concepts of equivalence classes you can directly see that equivalence classes of this relation will be [1,2,3,4] hence no. of ordered pairs=16 so, no. of pairs to be added is 16-3=13

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true