# reflexive relation example

In mathematical terms, it can be represented as (a, a) ∈ R ∀ a ∈ S (or) I ⊆ R. Here, a is an element, S is the set and R is the relation. So, as R is reflexive, symmetric and transitive, hence, R is an Equivalence Relation. The examples of reflexive relations are given in the table. Didn't find what you were looking for? A relation R is … Condition for reflexive : R is said to be reflexive, if a is related to a for a ∈ S. let x = y. x + 2x = 1. A matrix for the relation R on a set A will be a square matrix. Or want to know more information Reflexive relation on set is a binary element in which every In mathematics, a binary relation R over a set X is reflexive if every element of X is related to itself. R is reflexive. Table 1 will help you to distinguish between the notions of reflexivity and reflection. An empty relation can be … In English grammar, a reflexive pronoun indicates that the person who is realizing the action of the verb is also the recipient of the action. 2. Example: She cut herself. We define relation R on set A as R = {(a, b): a and b are brothers} R’ = {(a, b): height of a & b is greater than 10 cm} Now, R R = {(a, b): a and b are brothers} It is a girls school, so there are no boys in the school. The n diagonal entries are fixed. Which is (i) Symmetric but neither reflexive nor transitive. Definition. REFLEXIVE RELATION:IRREFLEXIVE RELATION, ANTISYMMETRIC RELATION Elementary Mathematics Formal Sciences Mathematics Relation between Reflexive and Emphatic Pronouns - definition Reflexive pronouns show that the action of the subject reflects upon the doer. (iv) Reflexive and transitive but not symmetric. Number of reflexive relations on a set with ‘n’ number of elements is given by; Suppose, a relation has ordered pairs (a,b). Let us consider an example to understand the difference between the two relations reflexive and identity. This page was last changed on 20 June 2014, at 22:45. The relation R 1 = { (p, p), (p, r), (q, q), (r, r), (r, s), (s, s)} in A is reflexive, since every element in A is R 1 -related to itself. Let us assume that R be a relation on the set of ordered pairs of positive integers such that ((a, b), (c, d))∈ R if and only if ad=bc. The given set R is an empty relation. Example 3: The relation > (or <) on the set of integers {1, 2, 3} is irreflexive. In mathematics, a binary relation R over a set X is reflexive if it relates every element of X to itself. Condition for reflexive : R is said to be reflexive, if a is related to a for a ∈ S. let x = y. x + 2x = 1. A reflexive relation is said to have the reflexive property or is meant to possess reflexivity. In mathematical terms, it can be represented as (a, a) ∈ R ∀ a ∈ S (or) I ⊆ R. Here, a is an element, S is the set and R is the relation. The relation is reflexive as 1=1. element is related to itself. Check if R is a reflexive relation on A. Solution: The relation is not reflexive if a = -2 ∈ R. But |a – a| = 0 which is not less than -2(= a). Example: A = {1, 2, 3} A relation R is irreflexive iff, nothing bears R to itself. Therefore For example, we consider the setting, those performing the action and how team dynamics shape the outcomes of a research study. Here is an example of a non-reflexive, non-irreflexive relation “in nature.” A subgroup in a group is said to be self-normalizing if it is equal to its own normalizer. But the relation R$$_{2}$$ = {(p, p), (p, r), (q, r), (q, s), (r, s)} is not reflexive in A since q, r, s â A but (q, q) â R$$_{2}$$, (r, r) â R$$_{2}$$ and (s, s) â R$$_{2}$$. All Rights Reserved. Identity : Every element is related to itself only. This post covers in detail understanding of allthese Click hereto get an answer to your question ️ Given an example of a relation. for all a in Z i.e. In fact it is irreflexive for any set of numbers. Example. In fact relation on any collection of sets is reflexive. Universal Relation: A relation R: A →B such that R = A x B (⊆ A x B) is a universal relation. 1/3 is not related to 1/3, because 1/3 is not a natural number and it is not in the relation.R is not symmetric. [where, "I" is Identity Relation] So,from the above example we can notice that :- Reflexive relation- is a kind of relation which contains the elements related to itself as well as can contain other pairs too. In this problem, we are asked to find what x equals. However, an emphatic pronoun simply emphasizes the action of the subject. For example, consider a set A = {1, 2,}. Check if R is a reflexive relation … Which is (i) Symmetric but neither reflexive nor transitive. if |x â y| â¤ y, for x, y â R. Show that the Ï is not reflexive relation. Example. A relation R on set A is called Reflexive if ∀ a ∈ A is related to a (aRa holds) Example − The relation R = { (a, a), (b, b) } on set X = { a, b } is reflexive. and it is reflexive. If we really think about it, a relation defined upon “is equal to” on the set of real numbers is a reflexive relation example since every real number comes out equal to itself. Reflexive Relation Examples Example 1: A relation R on set A (set of integers) is defined by “x R y if 5x + 9x is divisible by 7x” for all x, y ∈ A. Q.1: A relation R is on set A (set of all integers) is defined by “x R y if and only if 2x + 3y is divisible by 5”, for all x, y ∈ A. aRa holds for all a in Z i.e. R is reflexive. Let us take an example Let A = Set of all students in a girls school. Other than antisymmetric, there are different relations like reflexive, irreflexive, symmetric, asymmetric, and transitive. The example just given exhibits a trend quite typical of a substantial part of Recursion Theory: given a reflexive and transitive relation ⩽ r on the set of reals, one steps to the equivalence relation ≡ r generated by it, and partitions the reals into r-degrees (usually indicated by boldface letters such as … The reflexive relation is used on a binary set of numbers, where all the numbers are related to each other. Therefore, the total number of reflexive relations here is 2n(n-1). A relation R is reflexive if the matrix diagonal elements are 1. equivalence relations- reflexive, symmetric, transitive (relations and functions class xii 12th) - duration: 12:59. ∴ R has no elements 2010 - 2020. Universal Relation from A →B is reflexive, symmetric and transitive. exists, then relation M is called a Reflexive relation. A binary relationship is a reflexive relationship if every element in a set S is linked to itself. From Reflexive Relation on Set to HOME PAGE. So there are total 2 n 2 – n ways of filling the matrix. I is the identity relation on A. Note1: If R 1 and R 2 are equivalence relation then R 1 ∩ R 2 is also an equivalence relation. The ancestor-descendant relation is an example of the closure of a relation, in particular the transitive closure of the parent-child relation. For example, for the set A, which only includes the ordered pair (1,1). This post covers in detail understanding of allthese For remaining n 2 – n entries, we have choice to either fill 0 or 1. (iii) Reflexive and symmetric but not transitive. Hence, there cannot be a brother. For example, when every real number is equal to itself, the relation “is equal to” is used on the set of real numbers. Now 2a + 3a = 5a, which is divisible by 5. Reflexive Relation Examples. The statements consisting of these relations show reflexivity. The given set R is an empty relation. Example − The relation … Hence, a number of ordered pairs here will be n2-n pairs. on setZ. Check if R follows reflexive property and is a reflexive relation on A. Table 1 will help you to distinguish between the notions of reflexivity and reflection. A relation Ï is defined on the set of all real numbers R by âxÏyâ if and only The relation is reflexive as 1=1. Click hereto get an answer to your question ️ Given an example of a relation. For example, we consider the setting, those performing the action and how team dynamics shape the outcomes of a research study. Let us assume that R be a relation on the set of ordered pairs of positive integers such that ((a, b), (c, d))∈ R if and only if ad=bc. Or want to know more information In general, the closure of a relation is the smallest extension of the relation that has a certain specific property such as the reflexivity, symmetry or transitivity. In fact it is irreflexive for any set of numbers. If is an equivalence relation, describe the equivalence classes of . The relation $$\equiv$$ on by $$a \equiv b$$ if and only if , is an equivalence relations. The difference between reflexive and identity relation can be described in simple words as given below. Universal Relation from A →B is reflexive, symmetric and transitive. Irreflexive is a related term of reflexive. Reflexive relation example: Let’s take any set K =(2,8,9} If Relation M ={(2,2), (8,8),(9,9), ……….} Equivalence. Example − The relation … The digraph of a reflexive relation has a loop from each node to itself. Reflexive : Every element is related to itself. And there will be total n pairs of (a,a), so number of ordered pairs will be n 2-n pairs. which is not less than -2(= x). Use this Google Search to find what you need. The example just given exhibits a trend quite typical of a substantial part of Recursion Theory: given a reflexive and transitive relation ⩽ r on the set of reals, one steps to the equivalence relation ≡ r generated by it, and partitions the reals into r-degrees (usually indicated by boldface letters such as … if 2a + 3b is divisible by 5â, for all a, b â Z. If a relation has a certain property, prove this is so; otherwise, provide a counterexample to show that it does not. Let … For the following examples, determine whether or not each of the following binary relations on the given set is reflexive, symmetric, antisymmetric, or transitive. Q:-Show that the relation R in the set R of real numbers, defined as R = {(a, b): a ≤ b 2} is neither reflexive nor symmetric nor transitive. Reflexive relation example: Let’s take any set K = (2,8,9} If Relation M = { (2,2), (8,8), (9,9), ……….} A binary relation is called irreflexive, or anti-reflexive, if it doesn't relate any element to itself.An example is the "greater than" relation (x > y) on the real numbers.Not every relation which is not reflexive is irreflexive; it is possible to define relations where some elements are related to themselves but others are not (i.e., neither all nor none are). Let … Consider the set Z in which a relation R is defined by âaRb if and only if a + Now, the reflexive relation will be R = { (1, 1), (2, 2), (1, 2), (2, 1)}. I is the identity relation on A. For example, being taller than is an irreflexive relation: nothing is taller than itself. Study and determine the property of reflexive relation using reflexive property of equality definition, example … The difference between reflexive and identity relation can be described in simple words as given below. A binary relation from A to B is a subset of a Cartesian product A x B. R t•Le A x B means R is a set of ordered pairs of the form (a,b) where a A and b B. For example, let us consider a set C = {7,9}. In order to prove that R is an equivalence relation, we must show that R is reflexive, symmetric and transitive. (ii) Transitive but neither reflexive nor symmetric. As an example, if = {,,,} = {(,), (,), (,), (,)} then the relation is already reflexive by itself, so it doesn't differ from its reflexive closure.. Irreflexive Relation. The relation “is parallel to” (symbolized by ∥) has the property that, if an object bears the relation to a second object, then… Read More Here is an equivalence relation example to prove the properties. Also, there will be a total of n pairs of (a, a). Examine if R is a reflexive about. 5. 6, 10 … we consider the setting, those performing the action and how team dynamics shape the outcomes of a research study. Now 2x + 3x = 5x, which is divisible by 5. Q.1: A relation R is on set A (set of all integers) is defined by “x R y if and only if 2x + 3y is divisible by 5”, for all x, y ∈ A. exists, then relation M is called a Reflexive relation. Definition(irreflexive relation): A relation R on a set A is called irreflexive if and only if R for every element a of A. A relation is said to be reflexive when for all members of the relations R, x=x. Because reflexive essays center on your perspective of a particular experience, teachers often assign a journal, log, or diary to record your intellectual journey with the assignment. 3. Identity : Every element is related to itself only. 6.3. (iii) Reflexive and symmetric but not transitive. While this might seem strange at first glance, the following examples of reflexive pronouns and the accompanying list of reflexive … Now a + 3a = 4a, which is divisible by 4. Unless otherwise directed, you should write reflexive essays in the first person and past tense, and frame them in a logical order. If a relation is Reflexive symmetric and transitive then it is called equivalence relation. (v) Symmetric and transitive but not reflexive. For example, let us consider a set C = {7,9}. Example 1: A relation R on set A (set of integers) is defined by “x R y if 5x + 9x is divisible by 7x” for all x, y ∈ A. For a group G, define a relation ℛ on the set of all subgroups of G by declaring H ⁢ ℛ ⁢ K if and only if H is the normalizer of K. R is reflexive. A relation R in a set A is not reflexive if there be at least one element a â A such that (a, a) â R. Consider, for example, a set A = {p, q, r, s}. 2 CS 441 Discrete mathematics for CS M. Hauskrecht Binary relation Definition: Let A and B be two sets. The ordering relation “less than or equal to” (symbolized by ≤) is reflexive, but “less than” (symbolized by <) is not. The ancestor-descendant relation is an example of the closure of a relation, in particular the transitive closure of the parent-child relation. We see that x = 3 + 5. Therefore Examine if R is a reflexive relation on Z. Reflexive : Every element is related to itself. The relation Ï is not reflexive as x = -2 â R but |x â x| = 0 Let us consider an example to understand the difference between the two relations reflexive and identity. Popular Questions of Class 12th mathematics. Let us define Relation R on Set A = {1, 2, 3} We will check reflexive, symmetric and transitive R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)} Check Reflexive If the relation is reflexive, then (a, a) ∈ R for every a ∈ {1,2,3} Since (1, 1) ∈ R ,(2, 2) ∈ R & (3, 3) ∈ R ∴ R is reflexive We define relation R on set A as R = {(a, b): a and b are brothers} R’ = {(a, b): height of a & b is greater than 10 cm} Now, R R = {(a, b): a and b are brothers} It is a girls school, so there are no boys in the school. A relation R is an equivalence iff R is transitive, symmetric and reflexive. Symmetric Property The Symmetric Property states that for all real numbers x and y , if x = y , then y = x . Q.3: A relation R on the set A by “x R y if x – y is divisible by 5” for x, y ∈ A. Reflexive Relation Example. For example, for the set A, which only includes the ordered pair (1,1). Reflexive relations are always represented by a matrix that has $$1$$ on the main diagonal. 1/3 is not related to 1/3, because 1/3 is not a natural number and it is not in the relation.R is not symmetric. A relation R in a set A is not reflexive if there be at least one element a ∈ A such that (a, a) ∉ R. Consider, for example, a set A = {p, q, r, s}. A relation R on a set A is called Irreflexive if no a ∈ A is related to an (aRa does not hold). Q.2: A relation R is defined on the set of all real numbers N by ‘a R b’ if and only if |a-b| ≤ b, for a, b ∈ N. Show that the R is not reflexive relation. A relation R is non-reflexive iff it is neither reflexive nor irreflexive. Check if R is a reflexive relation on A. relation on Z. CBSE Previous Year Question Papers Class 10, CBSE Previous Year Question Papers Class 12, NCERT Solutions Class 11 Business Studies, NCERT Solutions Class 12 Business Studies, NCERT Solutions Class 12 Accountancy Part 1, NCERT Solutions Class 12 Accountancy Part 2, NCERT Solutions For Class 6 Social Science, NCERT Solutions for Class 7 Social Science, NCERT Solutions for Class 8 Social Science, NCERT Solutions For Class 9 Social Science, NCERT Solutions For Class 9 Maths Chapter 1, NCERT Solutions For Class 9 Maths Chapter 2, NCERT Solutions For Class 9 Maths Chapter 3, NCERT Solutions For Class 9 Maths Chapter 4, NCERT Solutions For Class 9 Maths Chapter 5, NCERT Solutions For Class 9 Maths Chapter 6, NCERT Solutions For Class 9 Maths Chapter 7, NCERT Solutions For Class 9 Maths Chapter 8, NCERT Solutions For Class 9 Maths Chapter 9, NCERT Solutions For Class 9 Maths Chapter 10, NCERT Solutions For Class 9 Maths Chapter 11, NCERT Solutions For Class 9 Maths Chapter 12, NCERT Solutions For Class 9 Maths Chapter 13, NCERT Solutions For Class 9 Maths Chapter 14, NCERT Solutions For Class 9 Maths Chapter 15, NCERT Solutions for Class 9 Science Chapter 1, NCERT Solutions for Class 9 Science Chapter 2, NCERT Solutions for Class 9 Science Chapter 3, NCERT Solutions for Class 9 Science Chapter 4, NCERT Solutions for Class 9 Science Chapter 5, NCERT Solutions for Class 9 Science Chapter 6, NCERT Solutions for Class 9 Science Chapter 7, NCERT Solutions for Class 9 Science Chapter 8, NCERT Solutions for Class 9 Science Chapter 9, NCERT Solutions for Class 9 Science Chapter 10, NCERT Solutions for Class 9 Science Chapter 12, NCERT Solutions for Class 9 Science Chapter 11, NCERT Solutions for Class 9 Science Chapter 13, NCERT Solutions for Class 9 Science Chapter 14, NCERT Solutions for Class 9 Science Chapter 15, NCERT Solutions for Class 10 Social Science, NCERT Solutions for Class 10 Maths Chapter 1, NCERT Solutions for Class 10 Maths Chapter 2, NCERT Solutions for Class 10 Maths Chapter 3, NCERT Solutions for Class 10 Maths Chapter 4, NCERT Solutions for Class 10 Maths Chapter 5, NCERT Solutions for Class 10 Maths Chapter 6, NCERT Solutions for Class 10 Maths Chapter 7, NCERT Solutions for Class 10 Maths Chapter 8, NCERT Solutions for Class 10 Maths Chapter 9, NCERT Solutions for Class 10 Maths Chapter 10, NCERT Solutions for Class 10 Maths Chapter 11, NCERT Solutions for Class 10 Maths Chapter 12, NCERT Solutions for Class 10 Maths Chapter 13, NCERT Solutions for Class 10 Maths Chapter 14, NCERT Solutions for Class 10 Maths Chapter 15, NCERT Solutions for Class 10 Science Chapter 1, NCERT Solutions for Class 10 Science Chapter 2, NCERT Solutions for Class 10 Science Chapter 3, NCERT Solutions for Class 10 Science Chapter 4, NCERT Solutions for Class 10 Science Chapter 5, NCERT Solutions for Class 10 Science Chapter 6, NCERT Solutions for Class 10 Science Chapter 7, NCERT Solutions for Class 10 Science Chapter 8, NCERT Solutions for Class 10 Science Chapter 9, NCERT Solutions for Class 10 Science Chapter 10, NCERT Solutions for Class 10 Science Chapter 11, NCERT Solutions for Class 10 Science Chapter 12, NCERT Solutions for Class 10 Science Chapter 13, NCERT Solutions for Class 10 Science Chapter 14, NCERT Solutions for Class 10 Science Chapter 15, NCERT Solutions for Class 10 Science Chapter 16, CBSE Previous Year Question Papers Class 12 Maths, CBSE Previous Year Question Papers Class 10 Maths, ICSE Previous Year Question Papers Class 10, ISC Previous Year Question Papers Class 12 Maths. Didn't find what you were looking for? REFLEXIVE RELATION:IRREFLEXIVE RELATION, ANTISYMMETRIC RELATION Elementary Mathematics Formal Sciences Mathematics Q:-Determine whether each of the following relations are reflexive, symmetric and transitive:(i) Relation R in the set A = {1, 2, 3,13, 14} defined as R = {(x, y): 3x − y = 0} (ii) Relation R in the set N of natural numbers defined as However, an emphatic pronoun simply emphasizes the action of the subject. An empty relation can be … Therefore aRa holds Symmetry, transitivity and reflexivity are the three properties representing equivalence relations. Reflexive Relation Definition. 4. For example, consider a set A = {1, 2,}. Example: She cut herself. A relation becomes an antisymmetric relation for a binary relation R on a set A. Show that R is a reflexive relation on Hence, a relation is reflexive if: Where a is the element, A is the set and R is the relation. Relation between Reflexive and Emphatic Pronouns - definition Reflexive pronouns show that the action of the subject reflects upon the doer. about Math Only Math. The reflexive closure S of a relation R on a set X is given by = ∪ {(,): ∈} In English, the reflexive closure of R is the union of R with the identity relation on X.. In relation and functions, a reflexive relation is the one in which every element maps to itself. Let’s take an example. Is R an equivalence relation? Definition(irreflexive relation): A relation R on a set A is called irreflexive if and only if R for every element a of A. Hence, a relation is reflexive if: (a, a) ∈ R ∀ a ∈ A. In relation and functions, a reflexive relation is the one in which every element maps to itself. Reflexive Questions. Formally, this may be written ∀x ∈ X : x R x.. An example of a reflexive relation is the relation "is equal to" on the set of real numbers, since every real number is equal to itself.A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Thus, it has a reflexive property and is said to hold reflexivity. Here is an equivalence relation example to prove the properties. If we take a closer look the matrix, we can notice that the size of matrix is n 2. A binary relation is called irreflexive, or anti-reflexive, if it doesn't relate any element to itself.An example is the "greater than" relation (x > y) on the real numbers.Not every relation which is not reflexive is irreflexive; it is possible to define relations where some elements are related to themselves but others are not (i.e., neither all nor none are). Required fields are marked *. Show that R is a reflexive relation on set A. 6, 10 … we consider the setting, those performing the action and how team dynamics shape the outcomes of a research study. Universal Relation: A relation R: A →B such that R = A x B (⊆ A x B) is a universal relation. Â© and â¢ math-only-math.com. Universal Relation from A →B is reflexive, symmetric and transitive. Here the element ‘a’ can be chosen in ‘n’ ways and same for element ‘b’. Reflexive is a related term of irreflexive. Now for a reflexive relation, (a,a) must be present in these ordered pairs. Q:- Let L be the set of all lines in XY plane and R be the relation in L defined as R = {(L1, L2): L1 is parallel to L2}. Definition. As per the definition of reflexive relation, (a, a) must be included in these ordered pairs. It is impossible for a reflexive relationship on a non-empty set A to be anti-reflective, asymmetric, or anti-transitive. In Maths, a binary relation R across a set X is reflexive if each element of set X is related or linked to itself. Let a â Z. If is an equivalence relation, describe the equivalence classes of . The relation $$\equiv$$ on by $$a \equiv b$$ if and only if , is an equivalence relations. (iv) Reflexive and transitive but not symmetric. Check if R is a reflexive relation on set A. Q.4: Consider the set A in which a relation R is defined by ‘x R y if and only if x + 3y is divisible by 4, for x, y ∈ A. Solved aRa holds for all a in Z i.e. The reflexive closure S of a relation R on a set X is given by = ∪ {(,): ∈} In English, the reflexive closure of R is the union of R with the identity relation on X.. Your email address will not be published. Let a â Z. A reflexive relation on a non-empty set A can neither be irreflexive, nor asymmetric, nor anti-transitive. In fact relation on any collection of sets is reflexive. â Venn Diagrams in Different Situations, â Relationship in Sets using Venn Diagram, 8th Grade Math Practice Now, the reflexive relation will be R = {(1, 1), (2, 2), (1, 2), (2, 1)}. Therefore, the relation R is not reflexive. In that, there is no pair of distinct elements of A, each of which gets related by R to the other. For the following examples, determine whether or not each of the following binary relations on the given set is reflexive, symmetric, antisymmetric, or transitive. The equality relation is the only example of a both reflexive and coreflexive relation, and any coreflexive relation is a subset of the identity relation. Hence, there cannot be a brother. A relation R on set A is called Reflexive if ∀ a ∈ A is related to a (aRa holds) Example − The relation R = { (a, a), (b, b) } on set X = { a, b } is reflexive. Use this Google Search to find what you need. Let a â Z. (v) Symmetric and transitive but not reflexive. Matrices for reflexive, symmetric and antisymmetric relations. In general, the closure of a relation is the smallest extension of the relation that has a certain specific property such as the reflexivity, symmetry or transitivity. Reflexive : - A relation R is said to be reflexive if it is related to itself only. A relation R on a set A is called Irreflexive if no a ∈ A is related to an (aRa does not hold). Universal Relation from A →B is reflexive, symmetric and transitive. 3b is divisible by 4, for a, b â Z. Note1: If R 1 and R 2 are equivalence relation then R 1 ∩ R 2 is also an equivalence relation. Your email address will not be published. A binary relationship is a reflexive relationship if every element in a set S is linked to itself. The ordering relation “less than or equal to” (symbolized by ≤) is reflexive, but “less than” (symbolized by <) is not. If we really think about it, a relation defined upon “is equal to” on the set of real numbers is a reflexive relation example since every real number comes out equal to itself. …relations are said to be reflexive. Then a â a is divisible by 5. 3x = 1 ==> x = 1/3. The Classes of have the following equivalence classes: Example of writing equivalence classes: Is R an equivalence relation? 3x = 1 ==> x = 1/3. Number of Symmetric Relations on a set with n elements : 2 n(n+1)/2. Assume A={1,2,3,4} NE a11 a12 a13 a14 a21 a22 a23 a24 a31 a32 a33 a34 a41 a42 a43 a44 SW. R is reflexive iff all the diagonal elements (a11, a22, a33, a44) are 1. So, the set of ordered pairs comprises n2 pairs. So, we can use the reflexive property of equality and figure out what 3 + 5 equals. In order to prove that R is an equivalence relation, we must show that R is reflexive, symmetric and transitive. Let us take an example Let A = Set of all students in a girls school. …relations are said to be reflexive. The relation “is parallel to” (symbolized by ∥) has the property that, if an object bears the relation to a second object, then… Read More If a relation is Reflexive symmetric and transitive then it is called equivalence relation. R is set to be reflexive, if (a, a) â R for all a â A that is, every element of A is R-related to itself, in other words aRa for every a â A. In terms of relations, this can be defined as (a, a) ∈ R ∀ a ∈ X or as I ⊆ R where I is the identity relation on A. A relation R is defined on the set Z by âaRb if a â b is divisible by 5â for a, A relation is said to be reflexive when for all members of the relations R, x=x. So total number of reflexive relations is equal to 2 n(n-1). and it is reflexive. Reflexive, Symmetric, Transitive, and Substitution Properties Reflexive Property The Reflexive Property states that for every real number x , x = x .