2.4k views

The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is

1. Neither reflexive nor symmetric
2. Symmetric and reflexive
3. Transitive and reflexive
4. Transitive and symmetric
edited | 2.4k views
0
+1
if set A is also empty set then in that case , set S will become Reflexive.
0
What is ϕ?

$S=\emptyset$ (empty set) on a set $A = \{1,2,3\}$ is Irreflexive, Symmetric, Anti Symmetric, Asymmetric, Transitive..
but it is not Reflexive.

edited
0
why it is not reflexive ?
+1
what is meaning of S= empty set on set A={1,2,3}  ??
+4

learncp A relation 'R' on set A said to be reflexive if  ( x R x ) ∀x ∈ A . It means all diagonal element should be present here .But here no (x,x) type relation is present in given empty set. thats why it is not reflexive.

+2
got it ...

@leaencp @LeenSharma

why it is not reflexive ??

Because ... S does not contain (1,1), (2,2) and (3,3) ordered pair.
+1
yes,Right . All (1,1) (2,2) and (3,3) should be present in the relation .
0
can anyone explain how it is Irreflexive, Symmetric, Anti Symmetric, Asymmetric, Transitive by giving example.
0

Ritesh Pratap Singh this question is the simplest example

0

@Digvijay Pandey  @Arjun sir

If set A=ϕ(empty set) and also  S=ϕ(empty set) then can we say S is reflexive on set A and hence S is an equivalence relation on set A ?

+1

Sourav Basu  here is a proof that "an empty relation on an empty set is equivalence."

https://proofwiki.org/wiki/Relation_on_Empty_Set_is_Equivalence

0
S=f(empty set) why??? { } same how?
A relation on a set A is by definition a subset R⊆(A×A). Then "a is related to b" means "(a,b)∈R. The empty relation is then just the empty set, so that "a is related to b" is always false.
Hence R= empty set implying it is symmetric,antisymmetric and transitive trivially but not reflexive since by definition any reflexive relation should contain all elements of the form (a,a) for all a in A

Relation S is defined as a set in which no element of A is related to any element.

This means that R is an empty relation.

Empty relation with empty set holds Reflexivity, Transitivity, Symmetric, Anti-Symmetric
This empty relation would match all conditions vacuously because there are no conditions to check(no elements)

Empty relation with non-empty set holds Transitivity, Symmetric, Anti-Symmetric but not reflexivity because set is non-empty and there are conditions to check for reflexive property.

In this particular question set A is non empty hence answer is D) Transitive and symmetric

0
best one

When it comes to working with ϕ, keep it in mind that there are two possibilities:

1. The Relation R (or S in the question) is a relation on set A which itself is empty, i.e R on A = { }.

2. The Relation R (or S in the question) is a relation on set A which is not empty, i.e. A have some elements.

Case 1:

Here the very set on which our relation is based, A,  is empty, so there is nothing to check, and if there is nothing to check, in mathematics and logic we take it to have all properties to be true for that. As it is, without any logical approval or explanation. And that is why we call it Vacuous Truth(wiki link), ( Vacuous means lack of intelligence! ).

So, here if any R = { }  is defined on A = { }, all the properties i.e  Reflexivity, Transitivity, Symmetric, Anti-Symmetric, hold true.

Case 2:

But as is asked in the question, the set A is not empty. So, there are elements which need to be checked.

So, lets take one by one...

a. Reflexivity: The only way Reflexivity is deemed true, is if the all the elements of must be related to each other and that is not the case here, so it is NOT reflexive.

b. Transitivity and Symmetry: These two properties are automatically implied True until and unless there is some reason for rejection. Here we have no elements at all, so there is no chance that someone can conjure up a reason to reject these. Hence, it is Symmetrical and Transitive.

Go to this link to have a detailed understanding.

1
2