But, as a, b N, we have either a < b or b < a or a = b. For example, the relation "is less than" on the natural numbers is an infinite set Rless of pairs of natural numbers that contains both (1,3) and (3,4), but neither (3,1) nor (4,4). Reflexive relation: A relation R defined over a set A is said to be reflexive if and only if aA(a,a)R. A relation R on a set A is called reflexive if no (a, a) R holds for every element a A.For Example: If set A = {a, b} then R = {(a, b), (b, a)} is irreflexive relation. Did any DOS compatibility layers exist for any UNIX-like systems before DOS started to become outmoded? Browse other questions tagged, Start here for a quick overview of the site, Detailed answers to any questions you might have, Discuss the workings and policies of this site. The definition of antisymmetry says nothing about whether actually holds or not for any .An antisymmetric relation on a set may be reflexive (that is, for all ), irreflexive (that is, for no ), or neither reflexive nor irreflexive.A relation is asymmetric if and only if it is both antisymmetric and irreflexive. However, since (1,3)R and 13, we have R is not an identity relation over A. Browse other questions tagged, Start here for a quick overview of the site, Detailed answers to any questions you might have, Discuss the workings and policies of this site. For each relation in Problem 3 in Exercises 1.1, determine which of the five properties are satisfied. This property tells us that any number is equal to itself. Beyond that, operations like the converse of a relation and the composition of relations are available, satisfying the laws of a calculus of relations.[3][4][5]. (c) is irreflexive but has none of the other four properties. Whether the empty relation is reflexive or not depends on the set on which you are defining this relation you can define the empty relation on any set X. How to get the closed form solution from DSolve[]? What does mean by awaiting reviewer scores? Symmetric and Antisymmetric Here's the definition of "symmetric." We use this property to help us solve problems where we need to make operations on just one side of the equation to find out what the other side equals. Note that is excluded from . Reflexive if there is a loop at every vertex of \(G\). Show that a relation is equivalent if it is both reflexive and cyclic. Remember that we always consider relations in some set. When is a subset relation defined in a partial order? A similar argument holds if \(b\) is a child of \(a\), and if neither \(a\) is a child of \(b\) nor \(b\) is a child of \(a\). B D Select one: a. both b. irreflexive C. reflexive d. neither Cc A Is this relation symmetric and/or anti-symmetric? This is the basic factor to differentiate between relation and function. Even though the name may suggest so, antisymmetry is not the opposite of symmetry. Can a set be both reflexive and irreflexive? Is the relation R reflexive or irreflexive? A relation defined over a set is set to be an identity relation of it maps every element of A to itself and only to itself, i.e. The same four definitions appear in the following: Relation (mathematics) Properties of (heterogeneous) relations, "A Relational Model of Data for Large Shared Data Banks", "Generalization of rough sets using relationships between attribute values", "Description of a Notation for the Logic of Relatives, Resulting from an Amplification of the Conceptions of Boole's Calculus of Logic", https://en.wikipedia.org/w/index.php?title=Relation_(mathematics)&oldid=1141916514, Short description with empty Wikidata description, Articles with unsourced statements from November 2022, Articles to be expanded from December 2022, Creative Commons Attribution-ShareAlike License 3.0, This page was last edited on 27 February 2023, at 14:55. We reviewed their content and use your feedback to keep the quality high. Welcome to Sharing Culture! For Irreflexive relation, no (a,a) holds for every element a in R. The difference between a relation and a function is that a relationship can have many outputs for a single input, but a function has a single input for a single output. 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. Symmetric Relation In other words, a relation R in a set A is said to be in a symmetric relationship only if every value of a,b A, (a, b) R then it should be (b, a) R. In mathematics, the reflexive closure of a binary relation R on a set X is the smallest reflexive relation on X that contains R. For example, if X is a set of distinct numbers and x R y means "x is less than y", then the reflexive closure of R is the relation "x is less than or equal to y". If you continue to use this site we will assume that you are happy with it. Since there is no such element, it follows that all the elements of the empty set are ordered pairs. Thus, it has a reflexive property and is said to hold reflexivity. (x R x). We've added a "Necessary cookies only" option to the cookie consent popup. The relation on is anti-symmetric. Defining the Reflexive Property of Equality You are seeing an image of yourself. We can't have two properties being applied to the same (non-trivial) set that simultaneously qualify $(x,x)$ being and not being in the relation. However, since (1,3)R and 13, we have R is not an identity relation over A. My mistake. That is, a relation on a set may be both reflexive and irreflexive or it may be neither. Let . no elements are related to themselves. In set theory, A relation R on a set A is called asymmetric if no (y,x) R when (x,y) R. Or we can say, the relation R on a set A is asymmetric if and only if, (x,y)R(y,x)R. We claim that \(U\) is not antisymmetric. Example \(\PageIndex{2}\): Less than or equal to. Y The divisibility relation, denoted by |, on the set of natural numbers N = {1,2,3,} is another classic example of a partial order relation. Consider, an equivalence relation R on a set A. For each relation in Problem 1 in Exercises 1.1, determine which of the five properties are satisfied. Since you are letting x and y be arbitrary members of A instead of choosing them from A, you do not need to observe that A is non-empty. Relationship between two sets, defined by a set of ordered pairs, This article is about basic notions of relations in mathematics. How do you get out of a corner when plotting yourself into a corner. When is the complement of a transitive relation not transitive? $x0$ such that $x+z=y$. True. We conclude that \(S\) is irreflexive and symmetric. Legal. status page at https://status.libretexts.org. It is also trivial that it is symmetric and transitive. "is ancestor of" is transitive, while "is parent of" is not. The same is true for the symmetric and antisymmetric properties, as well as the symmetric and asymmetric properties. The reflexive property and the irreflexive property are mutually exclusive, and it is possible for a relation to be neither reflexive nor irreflexive. \nonumber\], hands-on exercise \(\PageIndex{5}\label{he:proprelat-05}\), Determine whether the following relation \(V\) on some universal set \(\cal U\) is reflexive, irreflexive, symmetric, antisymmetric, or transitive: \[(S,T)\in V \,\Leftrightarrow\, S\subseteq T. \nonumber\], Example \(\PageIndex{7}\label{eg:proprelat-06}\), Consider the relation \(V\) on the set \(A=\{0,1\}\) is defined according to \[V = \{(0,0),(1,1)\}. Reflexive relation is an important concept in set theory. The same is true for the symmetric and antisymmetric properties, as well as the symmetric and asymmetric properties. Irreflexivity occurs where nothing is related to itself. Is Koestler's The Sleepwalkers still well regarded? If a relation \(R\) on \(A\) is both symmetric and antisymmetric, its off-diagonal entries are all zeros, so it is a subset of the identity relation. R is antisymmetric if for all x,y A, if xRy and yRx, then x=y . I didn't know that a relation could be both reflexive and irreflexive. It only takes a minute to sign up. This is a question our experts keep getting from time to time. N R This relation is called void relation or empty relation on A. Why was the nose gear of Concorde located so far aft? : \(A_1=\{(x,y)\mid x\) and \(y\) are relatively prime\(\}\), \(A_2=\{(x,y)\mid x\) and \(y\) are not relatively prime\(\}\), \(V_3=\{(x,y)\mid x\) is a multiple of \(y\}\). If a relation has a certain property, prove this is so; otherwise, provide a counterexample to show that it does not. Home | About | Contact | Copyright | Privacy | Cookie Policy | Terms & Conditions | Sitemap. Accessibility StatementFor more information contact us atinfo@libretexts.orgor check out our status page at https://status.libretexts.org. Hence, \(S\) is not antisymmetric. A binary relation is a partial order if and only if the relation is reflexive(R), antisymmetric(A) and transitive(T). Notice that the definitions of reflexive and irreflexive relations are not complementary. A reflexive closure that would be the union between deregulation are and don't come. The identity relation consists of ordered pairs of the form (a,a), where aA. Example \(\PageIndex{4}\label{eg:geomrelat}\). If (a, a) R for every a A. Symmetric. How do I fit an e-hub motor axle that is too big? For any \(a\neq b\), only one of the four possibilities \((a,b)\notin R\), \((b,a)\notin R\), \((a,b)\in R\), or \((b,a)\in R\) can occur, so \(R\) is antisymmetric. Learn more about Stack Overflow the company, and our products. As another example, "is sister of" is a relation on the set of all people, it holds e.g. View TestRelation.cpp from SCIENCE PS at Huntsville High School. Your email address will not be published. Does Cast a Spell make you a spellcaster? In other words, \(a\,R\,b\) if and only if \(a=b\). Why did the Soviets not shoot down US spy satellites during the Cold War? Transitive if for every unidirectional path joining three vertices \(a,b,c\), in that order, there is also a directed line joining \(a\) to \(c\). What is difference between relation and function? '<' is not reflexive. Since \(\sqrt{2}\;T\sqrt{18}\) and \(\sqrt{18}\;T\sqrt{2}\), yet \(\sqrt{2}\neq\sqrt{18}\), we conclude that \(T\) is not antisymmetric. $x-y> 1$. The previous 2 alternatives are not exhaustive; e.g., the red binary relation y = x 2 given in the section Special types of binary relations is neither irreflexive, nor reflexive, since it contains the pair (0, 0), but not (2, 2), respectively. A relation is said to be asymmetric if it is both antisymmetric and irreflexive or else it is not. Clearly since and a negative integer multiplied by a negative integer is a positive integer in . Transitive: A relation R on a set A is called transitive if whenever (a, b) R and (b, c) R, then (a, c) R, for all a, b, c A. Arkham Legacy The Next Batman Video Game Is this a Rumor? Can a relation on set a be both reflexive and transitive? A relation cannot be both reflexive and irreflexive. A-143, 9th Floor, Sovereign Corporate Tower, We use cookies to ensure you have the best browsing experience on our website. This is the basic factor to differentiate between relation and function. Example \(\PageIndex{2}\label{eg:proprelat-02}\), Consider the relation \(R\) on the set \(A=\{1,2,3,4\}\) defined by \[R = \{(1,1),(2,3),(2,4),(3,3),(3,4)\}. A digraph can be a useful device for representing a relation, especially if the relation isn't "too large" or complicated. Example \(\PageIndex{3}\): Equivalence relation. Nobody can be a child of himself or herself, hence, \(W\) cannot be reflexive. No tree structure can satisfy both these constraints. Yes, because it has ( 0, 0), ( 7, 7), ( 1, 1). More precisely, \(R\) is transitive if \(x\,R\,y\) and \(y\,R\,z\) implies that \(x\,R\,z\). Thus, \(U\) is symmetric. Android 10 visual changes: New Gestures, dark theme and more, Marvel The Eternals | Release Date, Plot, Trailer, and Cast Details, Married at First Sight Shock: Natasha Spencer Will Eat Mikey Alive!, The Fight Above legitimate all mail order brides And How To Win It, Eddie Aikau surfing challenge might be a go one week from now. We have both \((2,3)\in S\) and \((3,2)\in S\), but \(2\neq3\). 5. 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. This shows that \(R\) is transitive. For example, the relation < < ("less than") is an irreflexive relation on the set of natural numbers. The relation | is antisymmetric. Can a relation be both reflexive and irreflexive? That is, a relation on a set may be both reflexive and . Who Can Benefit From Diaphragmatic Breathing? I glazed over the fact that we were dealing with a logical implication and focused too much on the "plain English" translation we were given. If \(b\) is also related to \(a\), the two vertices will be joined by two directed lines, one in each direction. A Spiral Workbook for Discrete Mathematics (Kwong), { "7.01:_Denition_of_Relations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "7.02:_Properties_of_Relations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "7.03:_Equivalence_Relations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "7.04:_Partial_and_Total_Ordering" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()" }, { "00:_Front_Matter" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "01:_Introduction_to_Discrete_Mathematics" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "02:_Logic" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "03:_Proof_Techniques" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "04:_Sets" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "05:_Basic_Number_Theory" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "06:_Functions" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "07:_Relations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "08:_Combinatorics" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "09:_Appendices" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "zz:_Back_Matter" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()" }, [ "article:topic", "authorname:hkwong", "license:ccbyncsa", "showtoc:no", "empty relation", "complete relation", "identity relation", "antisymmetric", "symmetric", "irreflexive", "reflexive", "transitive" ], https://math.libretexts.org/@app/auth/3/login?returnto=https%3A%2F%2Fmath.libretexts.org%2FBookshelves%2FCombinatorics_and_Discrete_Mathematics%2FA_Spiral_Workbook_for_Discrete_Mathematics_(Kwong)%2F07%253A_Relations%2F7.02%253A_Properties_of_Relations, \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}}}\) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\), status page at https://status.libretexts.org. Approach: The given problem can be solved based on the following observations: A relation R on a set A is a subset of the Cartesian Product of a set, i.e., A * A with N 2 elements. Its symmetric and transitive by a phenomenon called vacuous truth. So, feel free to use this information and benefit from expert answers to the questions you are interested in! That is, a relation on a set may be both reflexive and irreflexive or it may be neither. Therefore the empty set is a relation. Question: It is possible for a relation to be both reflexive and irreflexive. Note this is a partition since or . , If you continue to use this site we will assume that you are happy with it. Draw a Hasse diagram for\( S=\{1,2,3,4,5,6\}\) with the relation \( | \). I admire the patience and clarity of this answer. Instead of using two rows of vertices in the digraph that represents a relation on a set \(A\), we can use just one set of vertices to represent the elements of \(A\). Let \(S=\{a,b,c\}\). When does a homogeneous relation need to be transitive? \nonumber\]. It is symmetric if xRy always implies yRx, and asymmetric if xRy implies that yRx is impossible. [1][16] If it is irreflexive, then it cannot be reflexive. There are three types of relationships, and each influences how we love each other and ourselves: traditional relationships, conscious relationships, and transcendent relationships. Phi is not Reflexive bt it is Symmetric, Transitive. Many students find the concept of symmetry and antisymmetry confusing. Why is stormwater management gaining ground in present times? By going through all the ordered pairs in \(R\), we verify that whether \((a,b)\in R\) and \((b,c)\in R\), we always have \((a,c)\in R\) as well. When does your become a partial order relation? Learn more about Stack Overflow the company, and our products. Then \(\frac{a}{c} = \frac{a}{b}\cdot\frac{b}{c} = \frac{mp}{nq} \in\mathbb{Q}\). For example, 3 is equal to 3. Symmetric for all x, y X, if xRy . Since \(\frac{a}{a}=1\in\mathbb{Q}\), the relation \(T\) is reflexive; it follows that \(T\) is not irreflexive. Let \({\cal T}\) be the set of triangles that can be drawn on a plane. For example, > is an irreflexive relation, but is not. Let \(S = \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\}\). Likewise, it is antisymmetric and transitive. Since is reflexive, symmetric and transitive, it is an equivalence relation. Since in both possible cases is transitive on .. Site design / logo 2023 Stack Exchange Inc; user contributions licensed under CC BY-SA. A relation has ordered pairs (a,b). rev2023.3.1.43269. 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. Given any relation \(R\) on a set \(A\), we are interested in five properties that \(R\) may or may not have. How do you determine a reflexive relationship? The relation R holds between x and y if (x, y) is a member of R. If \(5\mid(a+b)\), it is obvious that \(5\mid(b+a)\) because \(a+b=b+a\). That is, a relation on a set may be both reexive and irreexive or it may be neither. Why do we kill some animals but not others? That is, a relation on a set may be both reflexive and irreflexive or it may be neither. Legal. So what is an example of a relation on a set that is both reflexive and irreflexive ? What's the difference between a power rail and a signal line? Relations that satisfy certain combinations of the above properties are particularly useful, and thus have received names by their own. How is this relation neither symmetric nor anti symmetric? It is reflexive (hence not irreflexive), symmetric, antisymmetric, and transitive. The relation "is a nontrivial divisor of" on the set of one-digit natural numbers is sufficiently small to be shown here: Reflexive relation on set is a binary element in which every element is related to itself. Check! If a relation has a certain property, prove this is so; otherwise, provide a counterexample to show that it does not. It is transitive if xRy and yRz always implies xRz. hands-on exercise \(\PageIndex{4}\label{he:proprelat-04}\). Story Identification: Nanomachines Building Cities. For example: If R is a relation on set A = {12,6} then {12,6}R implies 12>6, but {6,12}R, since 6 is not greater than 12. You could look at the reflexive property of equality as when a number looks across an equal sign and sees a mirror image of itself! A relation R on a set A is called Antisymmetric if and only 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. It is possible for a relation to be both symmetric and antisymmetric, and it is also possible for a relation to be both non-symmetric and non-antisymmetric. if R is a subset of S, that is, for all Limitations and opposites of asymmetric relations are also asymmetric relations. Let . Input: N = 2Output: 3Explanation:Considering the set {a, b}, all possible relations that are both irreflexive and antisymmetric relations are: Approach: The given problem can be solved based on the following observations: Below is the implementation of the above approach: Time Complexity: O(log N)Auxiliary Space: O(1), since no extra space has been taken. is a partial order, since is reflexive, antisymmetric and transitive. Further, we have . Number of Antisymmetric Relations on a set of N elements, Number of relations that are neither Reflexive nor Irreflexive on a Set, Reduce Binary Array by replacing both 0s or both 1s pair with 0 and 10 or 01 pair with 1, Minimize operations to make both arrays equal by decrementing a value from either or both, Count of Pairs in given Array having both even or both odd or sum as K, Number of Asymmetric Relations on a set of N elements. A binary relation R on a set A A is said to be irreflexive (or antireflexive) if a A a A, aRa a a. Pierre Curie is not a sister of himself), symmetric nor asymmetric, while being irreflexive or not may be a matter of definition (is every woman a sister of herself? The relation \(S\) on the set \(\mathbb{R}^*\) is defined as \[a\,S\,b \,\Leftrightarrow\, ab>0. It is easy to check that \(S\) is reflexive, symmetric, and transitive. We use this property to help us solve problems where we need to make operations on just one side of the equation to find out what the other side equals. It is reflexive (hence not irreflexive), symmetric, antisymmetric, and transitive. : being a relation for which the reflexive property does not hold for any element of a given set. Relations are used, so those model concepts are formed. Yes. Let S be a nonempty set and let \(R\) be a partial order relation on \(S\). If it is reflexive, then it is not irreflexive. We find that \(R\) is. It is clearly symmetric, because \((a,b)\in V\) always implies \((b,a)\in V\). Can a relation be both reflexive and anti reflexive? Our team has collected thousands of questions that people keep asking in forums, blogs and in Google questions. . Symmetricity and transitivity are both formulated as "Whenever you have this, you can say that". Consequently, if we find distinct elements \(a\) and \(b\) such that \((a,b)\in R\) and \((b,a)\in R\), then \(R\) is not antisymmetric. + Consider, an equivalence relation R on a set A. That is, a relation on a set may be both reflexive and irreflexive or it may be neither. The same is true for the symmetric and antisymmetric properties, as well as the symmetric Exercise \(\PageIndex{2}\label{ex:proprelat-02}\). $\forall x, y \in A ((xR y \land yRx) \rightarrow x = y)$. This is vacuously true if X=, and it is false if X is nonempty. Some important properties that a relation R over a set X may have are: The previous 2 alternatives are not exhaustive; e.g., the red binary relation y = x2 given in the section Special types of binary relations is neither irreflexive, nor reflexive, since it contains the pair (0, 0), but not (2, 2), respectively. Given sets X and Y, a heterogeneous relation R over X and Y is a subset of { (x,y): xX, yY}. This property tells us that any number is equal to itself. 5. rev2023.3.1.43269. Now in this case there are no elements in the Relation and as A is non-empty no element is related to itself hence the empty relation is not reflexive. The LibreTexts libraries arePowered by NICE CXone Expertand are supported by the Department of Education Open Textbook Pilot Project, the UC Davis Office of the Provost, the UC Davis Library, the California State University Affordable Learning Solutions Program, and Merlot. At what point of what we watch as the MCU movies the branching started? "is sister of" is transitive, but neither reflexive (e.g. A relation on a finite set may be represented as: For example, on the set of all divisors of 12, define the relation Rdiv by. Example \(\PageIndex{6}\label{eg:proprelat-05}\), The relation \(U\) on \(\mathbb{Z}\) is defined as \[a\,U\,b \,\Leftrightarrow\, 5\mid(a+b). Jordan's line about intimate parties in The Great Gatsby? Set members may not be in relation "to a certain degree" - either they are in relation or they are not. 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. Define a relation that two shapes are related iff they are similar. In the case of the trivially false relation, you never have this, so the properties stand true, since there are no counterexamples. Your email address will not be published. 3 Answers. Accessibility StatementFor more information contact us atinfo@libretexts.orgor check out our status page at https://status.libretexts.org. It follows that \(V\) is also antisymmetric. When is a relation said to be asymmetric? True False. Relation is reflexive. If you have an irreflexive relation $S$ on a set $X\neq\emptyset$ then $(x,x)\not\in S\ \forall x\in X $, If you have an reflexive relation $T$ on a set $X\neq\emptyset$ then $(x,x)\in T\ \forall x\in X $.