Answer

Verified

474k+ views

Hint-Make use of the definitions of reflexive , symmetric, transitive functions and solve this.

A relation R on a set A is called reflexive if (a,a) $ \in $ R holds for every element a $ \in $ A .i.e. if set A = {a,b} then R = {(a,a), (b,b)} is reflexive relation.

A relation R on a set A is called symmetric if (b,a) $ \in $ R holds when (a,b) $ \in $ R.i.e. The relation R={(4,5),(5,4),(6,5),(5,6)} on set A={4,5,6} is symmetric

A relation R on a set A is called transitive if (a,b) $ \in $ R and (b,c) $ \in $ R then (a,c) $ \in $ R for all a,b,c $ \in $ A.i.e. Relation R={(1,2),(2,3),(1,3)} on set A={1,2,3} is transitive.

So, from these statements we can say that the given statement is false, Let us try to prove this, Let us prove it by taking a counter example

For example , take a relation R ={(1,1,),(1,2),(2,1),(2,2)} on A={1,2,3}

So, from this example we can clearly infer from the definition that the given relation is symmetric since(1,2),(2,1) $ \in $R and transitive since (1,2)(2,1) $ \in $R and also (1,1) $ \in $R but not reflexive since

(3,3) $ \notin $ R

So, from this we can write that the statement is given is false

Note: Only when the given statement is false, we can prove it by taking a counterexample else if the given statement is true , then we cannot solve it by taking a counter example.

A relation R on a set A is called reflexive if (a,a) $ \in $ R holds for every element a $ \in $ A .i.e. if set A = {a,b} then R = {(a,a), (b,b)} is reflexive relation.

A relation R on a set A is called symmetric if (b,a) $ \in $ R holds when (a,b) $ \in $ R.i.e. The relation R={(4,5),(5,4),(6,5),(5,6)} on set A={4,5,6} is symmetric

A relation R on a set A is called transitive if (a,b) $ \in $ R and (b,c) $ \in $ R then (a,c) $ \in $ R for all a,b,c $ \in $ A.i.e. Relation R={(1,2),(2,3),(1,3)} on set A={1,2,3} is transitive.

So, from these statements we can say that the given statement is false, Let us try to prove this, Let us prove it by taking a counter example

For example , take a relation R ={(1,1,),(1,2),(2,1),(2,2)} on A={1,2,3}

So, from this example we can clearly infer from the definition that the given relation is symmetric since(1,2),(2,1) $ \in $R and transitive since (1,2)(2,1) $ \in $R and also (1,1) $ \in $R but not reflexive since

(3,3) $ \notin $ R

So, from this we can write that the statement is given is false

Note: Only when the given statement is false, we can prove it by taking a counterexample else if the given statement is true , then we cannot solve it by taking a counter example.

Recently Updated Pages

How many sigma and pi bonds are present in HCequiv class 11 chemistry CBSE

Mark and label the given geoinformation on the outline class 11 social science CBSE

When people say No pun intended what does that mea class 8 english CBSE

Name the states which share their boundary with Indias class 9 social science CBSE

Give an account of the Northern Plains of India class 9 social science CBSE

Change the following sentences into negative and interrogative class 10 english CBSE

Trending doubts

Difference between Prokaryotic cell and Eukaryotic class 11 biology CBSE

Difference Between Plant Cell and Animal Cell

Fill the blanks with the suitable prepositions 1 The class 9 english CBSE

At which age domestication of animals started A Neolithic class 11 social science CBSE

Differentiate between homogeneous and heterogeneous class 12 chemistry CBSE

Summary of the poem Where the Mind is Without Fear class 8 english CBSE

One cusec is equal to how many liters class 8 maths CBSE

Give 10 examples for herbs , shrubs , climbers , creepers

Change the following sentences into negative and interrogative class 10 english CBSE