in Combinatory
10,589 views
3 votes
3 votes

How many relations are reflexive or symmetric on set of n element?

in Combinatory
10.6k views

3 Answers

19 votes
19 votes
Best answer

Let's Take a Example

A={1,2,3}

A $\times$ A ={ (1,1)(2,2)(3,3)(1,2)(2,1)(1,3)(3,1)(2,3)(3,2) } 

Reflexive Relation :- A relation R on a set A is said to be Reflexive if  (xRx)∀x∈A  

$\underbrace{(1,1)(2,2)(3,3) }_{n}$$\underbrace{(1,2)(2,1)(1,3)(3,1)(2,3)(3,2) }_{n^{2}-n}$

Now For Reflexive relation there are only one choices for diagonal elements (1,1)(2,2)(3,3)

and For remaining n2-n elements there are 2 choices for each.Either it can include in relation or it can't include in relation.

Total number of reflexive relation = $1*2^{n^{2}-n} =2^{n^{2}-n}$

Symmetric Relation:- A relation 'R' on set A is said to be symmetric if (xRy)   then   (yRx) ∀x,y∈A

 

$\underbrace{(1,1)(2,2)(3,3) }_{n}$$\underbrace{(1,2)(2,1)(1,3)(3,1)(2,3)(3,2) }_{n^{2}-n}$

 

For n diagonal elements (1,1)(2,2)(3,3) there are 2 choices for each.Either it can include in relation or it can't include in relation.

For remaining n2-n elements according to definition of symmetric relation we can form pairs of(1,2)(2,1) and (1,3)(3,1)and (2,3)(3,2).For each pair there are 2 choices.Either it can include in relation or it can't not include in relation.

 

Hence,Total Number of Symmetric Relation= 2n*$2^{\frac{(n^{2}-n)}{2}}$=$2^{\frac{n(n+1)}{2}}$

 

 

Now For Reflexive and Symmetric relation there are only one choices for diagonal elements (1,1)(2,2)(3,3) and

for remaining.we can form pairs of(1,2)(2,1) and (1,3)(3,1)and (2,3)(3,2).For each pair there are 2 choices.Either it can include in relation or it can't not include in relation.

 
Hence,Total Number of Reflexive and Symmetric Relation = $2^{\frac{(n^{2}-n)}{2}}$=$2^{\frac{n(n-1)}{2}}$
 
 
n(R)=$2^{n^{2}-n}$
n(S)=$2^{\frac{n(n+1)}{2}}$
n(R∩S)=$2^{\frac{n(n-1)}{2}}$
Total number of relation which is Reflexive or Symmetric n(R∪S)= n(R) +n(S)-n(R∩S)
 
                                     = $2^{\frac{n(n+1)}{2}}+2^{n^{2}-n}-2^{\frac{n(n-1)}{2}}$
                                                                                         
 
selected by

3 Comments

thank you...very well explain
0
0
really helpful. Thanks
0
0
edited by
That's a precise explanation. Thanks.
0
0
0 votes
0 votes

Number of reflexive relations with n element set $2^{n^{2}-n}$

Number of symmetric relations 2n⨉$2^{\frac{n^{2}-n}{2}}$

4 Comments

Set A contains (1,2,3) elements 

Then total no of elements in A*A = 9 ie n2

(1,1) (1,2) (1,3) (2,1) (2,2) (2,3) (3,1) (3,2) (3,3) 

Relation to be reflexive it must have (1,1)(2,2)(3,3) after that it may contain other elements or not 

remaining relations are 9-3 =6 

These 6 may or may not be present so 2ways to select 

Therefore total reflective relations are : 1* 26

Please check my approach 

1
1
@Anjali yes, correct..
0
0
thanku sir:)
1
1
0 votes
0 votes

Reflexive relation::

A relation is called as refleive if and only if aRa or bRb where a and b both belong to relation R.

Let us assume we have set A={1,2,3}

Relation R=AxA={(1,1)(1,2),(1,3)

                          (2,1)(2,2)(2,3)

                          (3,1)(3,2)(3,3)}

Min Cardinality of reflexive relation =Number of diagonal element here=3 and max=9(3x3)

Suppose |A|=n

Min cardinality=n and max=nxn

Thene number of reflexive relation=1*2^n^2-n=2^n^2-n

For symmetric relation::

relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n nodes.

Number of Symmetric relation=2^n x 2^n^2-n/2

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