# How do you tell if a relation is reflexive symmetric Antisymmetric or transitive?

## How do you tell if a relation is reflexive symmetric Antisymmetric or transitive?

Solution: Since a ≥ a, this relation is reflexive. If a ≥ b and b ≥ a, then a = b which shows this relation is antisymmetric. If a ≥ b and b ≥ c, then a ≥ c so this relation is transitive.

**What is reflexive symmetric antisymmetric transitive?**

Reflexive because we have (a, a) for every a = 1,2,3,4. Symmetric because we do not have a case where (a, b) and a = b. Antisymmetric because we do not have a case where (a, b) and a = b. Transitive because we can satisfy (a, b) and (b, c) when a = b = c. f {(1,3),(1,4),(2,3),(2,4),(3,1),(3,4)}

### What are the 3 types of relation?

The types of relations are nothing but their properties. There are different types of relations namely reflexive, symmetric, transitive and anti symmetric which are defined and explained as follows through real life examples.

**Can there be a relation that is reflexive symmetric but not transitive?**

So we can say that the relation R is a symmetric relation. If a, b, c ∈A such that (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R so this is called a transitive relation. So, R is not a transitive relation. Hence R is a reflexive and symmetric but not transitive.

## What is difference between antisymmetric and reflexive relation?

Antisymmetric relations may or may not be reflexive. < is antisymmetric and not reflexive, while the relation “x divides y” is antisymmetric and reflexive, on the set of positive integers. A reflexive relation R on a set A, on the other hand, tells us that we always have (x,x)∈R; everything is related to itself.

**What is a void relation?**

As we know the definition of void relation is that if A be a set, then ϕ ⊆ A× A and so it is a relation on A. This relation is called void relation or empty relation on A. In other words, a relation R on set A is called an empty relation, if no element of A is related to any other element of A.

### Can something be symmetric and not transitive?

symmetric and reflexive but not transitive: It is clearly not transitive since (a,b)∈R and (b,c)∈R whilst (a,c)∉R. On the other hand, it is reflexive since (x,x)∈R for all cases of x: x=a, x=b, and x=c. Likewise, it is symmetric since (a,b)∈R and (b,a)∈R and (b,c)∈R and (c,b)∈R. However, this doesn’t satisfy me.

**How can a set be transitive?**

In set theory, a branch of mathematics, a set A is called transitive if either of the following equivalent conditions hold: whenever x ∈ A, and y ∈ x, then y ∈ A. whenever x ∈ A, and x is not an urelement, then x is a subset of A.

## What are the types of relations in set theory?

As part of set theory, relations are manipulated with the algebra of sets, including complementation. Furthermore, the two sets are considered symmetrically by introduction of the converse relation which exchanges their places. Another operation is composition of relations.

**Can a relation be both symmetric and antisymmetric?**

A relation can be both symmetric and antisymmetric (e.g., the equality relation), and there are relations which are neither symmetric nor antisymmetric (e.g., the “preys on” relation on biological species). Antisymmetry is different from asymmetry, which requires both antisymmetry and irreflexivity.

### What is an example of a symmetrical relationship?

A symmetric relation is a type of binary relation. An example is the relation “is equal to”, because if a = b is true then b = a is also true.