MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Logarithmic Function

The relation ...

Question

The relation 'is a subset of' in a set of sets is not an equivalence relation. Prove.

Open in App

Solution

Let A be a set.
$A \subset A .$ every set is a subset of itself. So, R is reflexive on A.
For any two sets A, B. If $A \subset B$ . It is not necessary that $B \subset A .$ Hence not symmetric and therefore not an equivalence relation.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Is inclusion of a subset in another, in the context of a universal set, an equivalence relation in the family of subsets of the sets? Justify your answer.

Q. Prove that intersection of equivalence relations on a set is also an equivalence relation.

Q. In the set of triangles in a plane the relation 'is similar to' is an equivalence relation. Prove .

Q. Give a non-empty set

X

P (X)

, which is the set of all subsets of

X

. Define the relation

R

P (X)

as follows:
For subsets

A

B

P (X)

A R B

A \subset B

R

an equivalence relation on

P (X)

?
Justify your answer.

Given a non empty set X, consider P(X) which is the set of all subsets of X.

Define the relation R in P(X) as follows:

For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify you answer:

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Theoretical Probability

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Logarithmic Function

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon