# Mathematics | Introduction and types of Relations

Relation or Binary relation R from set A to B is a subset of AxB which can be defined as

aRb ↔ (a,b) € R ↔ R(a,b).

A Binary relation R on a single set A is defined as a subset of AxA. For two distinct set, A and B with cardinalities m and n, the maximum cardinality of the relation R from A to B is mn.

**Domain and Range:**

if there are two sets A and B and Relation from A to B is R(a,b), then domain is defined as the set { a | (a,b) € R for some b in B} and Range is defined as the set {b | (a,b) € R for some a in A}.

## Types of Relation:

**Empty Relation:**A relation R on a set A is called Empty if the set A is empty set.**Full Relation:**A binary relation R on a set A and B is called full if AXB.**Reflexive Relation:**A relation R on a set A is called reflexive if (a,a) € R holds for every element a € A .i.e. if set A = {a,b} then R = {(a,a), (b,b)} is reflexive relation.**Irreflexive relation :**A relation R on a set A is called reflexive if no (a,a) € R holds for every element a € A.i.e. if set A = {a,b} then R = {(a,b), (b,a)} is irreflexive relation.**Symmetric Relation:**A relation R on a set A is called symmetric if (b,a) € R holds when (a,b) € R.i.e. The relation R={(4,5),(5,4),(6,5),(5,6)} on set A={4,5,6} is symmetric.**AntiSymmetric Relation:**A relation R on a set A is called antisymmetric if (a,b)€ R and (b,a) € R then a = b is called antisymmetric.i.e. The relation R = {(a,b)→ R|a ≤ b} is anti-symmetric since a ≤ b and b ≤ a implies a = b.**Transitive Relation:**A relation R on a set A is called transitive if (a,b) € R and (b,c) € R then (a,c) € R for all a,b,c € A.i.e. Relation R={(1,2),(2,3),(1,3)} on set A={1,2,3} is transitive.**Equivalence Relation:**A relation is an Equivalence Relation if it is reflexive, symmetric, and transitive. i.e. relation R={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2),(1,3),(3,1)} on set A={1,2,3} is equivalence relation as it is reflexive, symmetric, and transitive.**Asymmetric relation:**Asymmetric relation is opposite of symmetric relation. A relation R on a set A is called asymmetric if no (b,a) € R when (a,b) € R.- Discrete Mathematics | Types of Recurrence Relations - Set 2
- Mathematics | Closure of Relations and Equivalence Relations
- Discrete Mathematics | Representing Relations
- Different types of recurrence relations and their solutions
- Mathematics | Representations of Matrices and Graphs in Relations
- Mathematics | Matrix Introduction
- Mathematics | Introduction of Set theory
- Mathematics | Introduction to Proofs
- Mathematics | Introduction to Propositional Logic | Set 1
- Mathematics | Introduction to Propositional Logic | Set 2
- Practice Set for Recurrence Relations
- Number of possible Equivalence Relations on a finite set
- Minimum relations satisfying First Normal Form (1NF)
- Mathematics | Generalized PnC Set 2
- Mathematics | Probability

**Important Points:**

**1. **Symmetric and anti-symmetric relations are not opposite because a relation R can contain both the properties or may not.

**2.** A relation is asymmetric if and only if it is both anti-symmetric and irreflexive.

**3. Number of different relation from a set with n elements to a set with m elements is 2 ^{mn}**

Ex: if R ={r_{1}, r_{2}, r_{3}......r_{n}} and S ={s_{1}, s_{2}, s_{3}.....s_{m}} then Cartesian product of R and S is: R X S = {(r_{1}, s_{1}), (r_{1}, s_{2}), (r_{1}, s_{3})........., (r_{1}, s_{n}), (r_{2}, s_{1}), (r_{2}, s_{2}), (r_{2}, s_{3}).........., (r_{2}, s_{n}), ................. (r_{n}, s_{1}),(r_{n}, s_{2}), (r_{n}, s_{3}),........., (r_{n}, s_{n})} This set of ordered pairs contains mn pairs. Now these pairs can be present in R X S or can be absent. So total number of possible relation = 2^{mn}

**4. Number of Reflexive Relations on a set with n elements : 2 ^{n(n-1)}**.

A relation has ordered pairs (a,b). Now a can be chosen in n ways and same for b. So set of ordered pairs contains n^{2} pairs. Now for a reflexive relation, (a,a) must be present in these ordered pairs. And there will be total n pairs of (a,a), so number of ordered pairs will be n^{2}-n pairs. So total number of reflexive relations is equal to 2^{n(n-1)}.

**5. Number of Symmetric Relations on a set with n elements : 2 ^{n(n+1)/2}**.

A relation has ordered pairs (a,b). Now for a symmetric relation, if (a,b) is present in R, then (b,a) must be present in R.

In Matrix form, if a_{12} is present in relation, then a_{21} is also present in relation and As we know reflexive relation is part of symmetric relation.

So from total n^{2} pairs, only n(n+1)/2 pairs will be chosen for symmetric relation. So total number of symmetric relation will be 2^{n(n+1)/2}.

**6. Number of Anti-Symmetric Relations on a set with n elements: 2 ^{n} 3^{n(n-1)/2}**.

A relation has ordered pairs (a,b). For anti-symmetric relation, if (a,b) and (b,a) is present in relation R, then a = b.(That means a is in relation with itself for any a).

So for (a,a), total number of ordered pairs = n and total number of relation = 2^{n}.

if (a,b) and (b,a) both are not present in relation or Either (a,b) or (b,a) is not present in relation. So there are three possibilities and total number of ordered pairs for this condition is n(n-1)/2. (selecting a pair is same as selecting the two numbers from n without repetition) As we have to find number of ordered pairs where a ≠ b. it is like opposite of symmetric relation means total number of ordered pairs = (n^{2}) – symmetric ordered pairs(n(n+1)/2) = n(n-1)/2. So, total number of relation is 3^{n(n-1)/2}. So total number of anti-symmetric relation is 2^{n}.3^{n(n-1)/2}.

**7. Number of Asymmetric Relations on a set with n elements : 3 ^{n(n-1)/2}**.

In Asymmetric Relations, element a can not be in relation with itself. (i.e. there is no aRa ∀ a∈A relation.) And Then it is same as Anti-Symmetric Relations.(i.e. you have three choice for pairs (a,b) (b,a)). Therefore there are 3^{n(n-1)/2} Asymmetric Relations possible.

**8. Irreflexive Relations on a set with n elements : 2 ^{n(n-1)}**.

A relation has ordered pairs (a,b). For Irreflexive relation, no (a,a) holds for every element a in R. It is also opposite of reflexive relation.

Now for a Irreflexive relation, (a,a) must not be present in these ordered pairs means total n pairs of (a,a) is not present in R, So number of ordered pairs will be n^{2}-n pairs.

So total number of reflexive relations is equal to 2^{n(n-1)}.

**9. Reflexive and symmetric Relations on a set with n elements : 2 ^{n(n-1)/2}**.

A relation has ordered pairs (a,b). Reflexive and symmetric Relations means (a,a) is included in R and (a,b)(b,a) pairs can be included or not. (In Symmetric relation for pair (a,b)(b,a) (considered as a pair). whether it is included in relation or not) So total number of Reflexive and symmetric Relations is 2^{n(n-1)/2} .

This article is contributed by **Nitika Bansal**.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

**Related Articles:**

Relations and their representations