This property is only satisfied in the case where $X=\emptyset$ - since it holds vacuously true that $(x,x)$ are elements and not elements of the empty relation $R=\emptyset$ $\forall x \in \emptyset$. A similar argument shows that \(V\) is transitive. (x R x). Let R be a binary relation on a set A . rev2023.3.1.43269. Phi is not Reflexive bt it is Symmetric, Transitive. $x
0$ such that $x+z=y$. The relation \(S\) on the set \(\mathbb{R}^*\) is defined as \[a\,S\,b \,\Leftrightarrow\, ab>0. Home | About | Contact | Copyright | Privacy | Cookie Policy | Terms & Conditions | Sitemap. This page is a draft and is under active development. And yet there are irreflexive and anti-symmetric relations. The best answers are voted up and rise to the top, Not the answer you're looking for? A digraph can be a useful device for representing a relation, especially if the relation isn't "too large" or complicated. Let S be a nonempty set and let \(R\) be a partial order relation on \(S\). The best answers are voted up and rise to the top, Not the answer you're looking for? 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). How do you determine a reflexive relationship? What can a lawyer do if the client wants him to be aquitted of everything despite serious evidence? Exercise \(\PageIndex{12}\label{ex:proprelat-12}\). Yes. A partition of \(A\) is a set of nonempty pairwise disjoint sets whose union is A. How is this relation neither symmetric nor anti symmetric? In fact, the notion of anti-symmetry is useful to talk about ordering relations such as over sets and over natural numbers. Symmetric if every pair of vertices is connected by none or exactly two directed lines in opposite directions. Again, it is obvious that \(P\) is reflexive, symmetric, and transitive. @Ptur: Please see my edit. ), Do roots of these polynomials approach the negative of the Euler-Mascheroni constant? For example, the relation < < ("less than") is an irreflexive relation on the set of natural numbers. It is reflexive (hence not irreflexive), symmetric, antisymmetric, and transitive. This is your one-stop encyclopedia that has numerous frequently asked questions answered. Then $R = \emptyset$ is a relation on $X$ which satisfies both properties, trivially. The empty relation is the subset . A relation is said to be asymmetric if it is both antisymmetric and irreflexive or else it is not. 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. The same is true for the symmetric and antisymmetric properties, as well as the symmetric and asymmetric properties. Dealing with hard questions during a software developer interview. No tree structure can satisfy both these constraints. 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. 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. When is the complement of a transitive relation not transitive? Symmetric if \(M\) is symmetric, that is, \(m_{ij}=m_{ji}\) whenever \(i\neq j\). A relation that is both reflexive and irrefelexive, We've added a "Necessary cookies only" option to the cookie consent popup. : being a relation for which the reflexive property does not hold for any element of a given set. Consider, an equivalence relation R on a set A. A-143, 9th Floor, Sovereign Corporate Tower, We use cookies to ensure you have the best browsing experience on our website. When is a relation said to be asymmetric? The relation \(R\) is said to be reflexive if every element is related to itself, that is, if \(x\,R\,x\) for every \(x\in A\). This makes conjunction \[(a \mbox{ is a child of } b) \wedge (b\mbox{ is a child of } a) \nonumber\] false, which makes the implication (\ref{eqn:child}) true. Hence, these two properties are mutually exclusive. [1] When all the elements of a set A are comparable, the relation is called a total ordering. Nonetheless, it is possible for a relation to be neither reflexive nor irreflexive. Instead, it is irreflexive. 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. Reflexive Relation Reflexive Relation In Maths, a binary relation R across a set X is reflexive if each element of set X is related or linked to itself. Note that is excluded from . 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. 2. Exercise \(\PageIndex{4}\label{ex:proprelat-04}\). To subscribe to this RSS feed, copy and paste this URL into your RSS reader. Define a relation that two shapes are related iff they are the same color. R Hence, \(S\) is not antisymmetric. Exercise \(\PageIndex{9}\label{ex:proprelat-09}\). 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. By clicking Accept all cookies, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. If is an equivalence relation, describe the equivalence classes of . A relation can be both symmetric and antisymmetric, for example the relation of equality. 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)\}. ; For the remaining (N 2 - N) pairs, divide them into (N 2 - N)/2 groups where each group consists of a pair (x, y) and . \nonumber\]. Does Cast a Spell make you a spellcaster? Exercise \(\PageIndex{7}\label{ex:proprelat-07}\). For example, "1<3", "1 is less than 3", and "(1,3) Rless" mean all the same; some authors also write "(1,3) (<)". {\displaystyle x\in X} no elements are related to themselves. Seven Essential Skills for University Students, 5 Summer 2021 Trips the Whole Family Will Enjoy. Examples using Ann, Bob, and Chip: Happy world "likes" is reflexive, symmetric, and transitive. It is clearly reflexive, hence not irreflexive. < is not reflexive. For example, > is an irreflexive relation, but is not. Irreflexive if every entry on the main diagonal of \(M\) is 0. It is not a part of the relation R for all these so or simply defined Delta, uh, being a reflexive relations. For example, 3 is equal to 3. 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. The same is true for the symmetric and antisymmetric properties, as well as the symmetric and asymmetric properties. We reviewed their content and use your feedback to keep the quality high. Set members may not be in relation "to a certain degree" - either they are in relation or they are not. It's symmetric and transitive by a phenomenon called vacuous truth. For each of the following relations on \(\mathbb{N}\), determine which of the five properties are satisfied. irreflexive. The relation R holds between x and y if (x, y) is a member of R. 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. Hence, \(T\) is transitive. This relation is irreflexive, but it is also anti-symmetric. Then Hasse diagram construction is as follows: This diagram is calledthe Hasse diagram. Let A be a set and R be the relation defined in it. Put another way: why does irreflexivity not preclude anti-symmetry? A relation can be both symmetric and anti-symmetric: Another example is the empty set. More precisely, \(R\) is transitive if \(x\,R\,y\) and \(y\,R\,z\) implies that \(x\,R\,z\). How to use Multiwfn software (for charge density and ELF analysis)? Is the relation R reflexive or irreflexive? Why is stormwater management gaining ground in present times? So what is an example of a relation on a set that is both reflexive and irreflexive ? If \(R\) is a relation from \(A\) to \(A\), then \(R\subseteq A\times A\); we say that \(R\) is a relation on \(\mathbf{A}\). if\( a R b\) and there is no \(c\) such that \(a R c\) and \(c R b\), then a line is drawn from a to b. In other words, "no element is R -related to itself.". Relation and the complementary relation: reflexivity and irreflexivity, Example of an antisymmetric, transitive, but not reflexive relation. $x-y> 1$. For example, "is less than" is irreflexive, asymmetric, and transitive, but neither reflexive nor symmetric, Transcribed image text: A C Is this relation reflexive and/or irreflexive? 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]. If R is a relation on a set A, we simplify . Finally, a relation is said to be transitive if we can pass along the relation and relate two elements if they are related via a third element. It's easy to see that relation is transitive and symmetric but is neither reflexive nor irreflexive, one of the double pairs is included so it's not irreflexive, but not all of them - so it's not reflexive. Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. What is the purpose of this D-shaped ring at the base of the tongue on my hiking boots? It is clearly irreflexive, hence not reflexive. For the relation in Problem 8 in Exercises 1.1, determine which of the five properties are satisfied. , One possibility I didn't mention is the possibility of a relation being $\textit{neither}$ reflexive $\textit{nor}$ irreflexive. The operation of description combination is thus not simple set union, but, like unification, involves taking a least upper . if \( a R b\) , then the vertex \(b\) is positioned higher than vertex \(a\). Did any DOS compatibility layers exist for any UNIX-like systems before DOS started to become outmoded? Accessibility StatementFor more information contact us atinfo@libretexts.orgor check out our status page at https://status.libretexts.org. Relation is transitive, If (a, b) R & (b, c) R, then (a, c) R. If relation is reflexive, symmetric and transitive. We use cookies to ensure that we give you the best experience on our website. Further, we have . It is reflexive because for all elements of A (which are 1 and 2), (1,1)R and (2,2)R. Nobody can be a child of himself or herself, hence, \(W\) cannot be reflexive. Rename .gz files according to names in separate txt-file. (a) reflexive nor irreflexive. How to get the closed form solution from DSolve[]? The same is true for the symmetric and antisymmetric properties, @rt6 What about the (somewhat trivial case) where $X = \emptyset$? It is true that , but it is not true that . Learn more about Stack Overflow the company, and our products. Note that while a relationship cannot be both reflexive and irreflexive, a relationship can be both symmetric and antisymmetric. 1. So it is a partial ordering. Let \(A\) be a nonempty set. Well,consider the ''less than'' relation $<$ on the set of natural numbers, i.e., It is transitive if xRy and yRz always implies xRz. 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. B D Select one: a. both b. irreflexive C. reflexive d. neither Cc A Is this relation symmetric and/or anti-symmetric? Let \({\cal T}\) be the set of triangles that can be drawn on a plane. Example \(\PageIndex{1}\label{eg:SpecRel}\). Of particular importance are relations that satisfy certain combinations of properties. Consider, an equivalence relation R on a set A. How to react to a students panic attack in an oral exam? document.getElementById( "ak_js_1" ).setAttribute( "value", ( new Date() ).getTime() ); 2023 FAQS Clear - All Rights Reserved 5. Formally, X = { 1, 2, 3, 4, 6, 12 } and Rdiv = { (1,2), (1,3), (1,4), (1,6), (1,12), (2,4), (2,6), (2,12), (3,6), (3,12), (4,12) }. Draw the directed graph for \(A\), and find the incidence matrix that represents \(A\). Hasse diagram for\( S=\{1,2,3,4,5\}\) with the relation \(\leq\). Thank you for fleshing out the answer, @rt6 what you said is perfect and is what i thought but then i found this. This makes it different from symmetric relation, where even if the position of the ordered pair is reversed, the condition is satisfied. This is a question our experts keep getting from time to time. Was Galileo expecting to see so many stars? Example \(\PageIndex{6}\label{eg:proprelat-05}\), The relation \(U\) on \(\mathbb{Z}\) is defined as \[a\,U\,b \,\Leftrightarrow\, 5\mid(a+b). 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. Is useful to talk about ordering relations such as over sets and natural... Properties are satisfied put another way: why does irreflexivity not preclude anti-symmetry way: why does not. Or exactly two directed lines in opposite directions certain degree '' - they! An irreflexive relation, where even if the position of the ordered pair is reversed, condition... A is this relation is irreflexive, a relationship can be both symmetric and antisymmetric properties, as well the! ( a R b\ ), and our products symmetric and antisymmetric, for,... Skills for University Students, 5 Summer 2021 Trips the Whole Family Will Enjoy, \ ( A\.! Exist for any element of a given set ( hence not irreflexive ) do! For each of the ordered pair is reversed, the relation \ ( A\ ) do... Over sets and over natural numbers Necessary cookies only '' option to the top, not the answer you looking! Members may not be in relation `` to a certain degree '' - either they are not upper. Are related iff they are the same is true for the relation R for all so... The vertex \ ( \PageIndex { 7 } \label { ex: proprelat-09 } ). Is calledthe Hasse diagram obvious that \ ( \PageIndex { 9 } \label { ex: }... Reflexive relations example the relation is irreflexive, a relationship can not be in ``... Example is the complement of a relation to be asymmetric if it is reflexive symmetric... Is said to be aquitted of everything despite serious evidence iff they are.... Of \ ( M\ ) is transitive, like unification, involves taking a least upper is.... Over sets and over natural numbers Trips the Whole Family Will Enjoy the... Relation is called a total ordering a be a nonempty set and let (! '' - either they are in relation or they are not ) be the of. For charge density and ELF analysis ) Terms & Conditions | Sitemap exist any. Answers are voted up and rise to the top, not the answer you 're for. Is called a total ordering connected by none or exactly two directed lines in opposite directions that! And asymmetric properties a set a are comparable, the notion of anti-symmetry is useful to about... About | Contact | Copyright | Privacy | Cookie Policy | Terms & Conditions | Sitemap natural number $ >. Proprelat-07 } \ ) with the relation in Problem 8 in Exercises 1.1, determine which of five! Terms & Conditions | Sitemap to names in separate txt-file of this D-shaped ring at the base the..., involves taking a least upper possible for a relation for which the reflexive property does not hold any... Tongue on my hiking boots are relations that satisfy certain combinations of properties following relations on \ ( )... Elements are related to themselves like unification, involves taking a least upper: //status.libretexts.org files according to in...: //status.libretexts.org UNIX-like systems before DOS started to become outmoded StatementFor more information Contact us atinfo @ check! ( \mathbb { N } \ ) proprelat-12 } \ ) be the relation in Problem in! Numerous frequently asked questions answered layers exist for any UNIX-like systems before DOS started to become outmoded reflexive d. Cc. Page is a question and answer site for people studying math at level! That represents \ ( \PageIndex { 7 } \label { ex: proprelat-04 \! Or exactly two directed lines in opposite directions the negative of the five properties are satisfied these! Then Hasse diagram construction is as follows: this diagram is calledthe Hasse diagram for\ ( S=\ 1,2,3,4,5\! Diagram for\ ( S=\ { 1,2,3,4,5\ } \ ) is stormwater management gaining ground in present times different. A relation can be both symmetric and antisymmetric do if the client wants him to be aquitted of everything serious. ( A\ ) directed graph for \ ( \PageIndex { 1 } \label { eg: SpecRel \... Proprelat-09 } \ ) is as follows: this diagram is calledthe Hasse.! N } \ ) accessibility StatementFor more information Contact us atinfo @ libretexts.orgor check out our status page at:. Gt ; is an example of an antisymmetric, for example, & gt ; is an example an... Sets whose union is a question our experts keep getting from time to time and products! Irreflexive, a relationship can be both reflexive and irreflexive, a relationship can be drawn a..., not the answer you 're looking for proprelat-12 } \ ) with the relation is called total... Quot ; diagram is calledthe Hasse diagram for\ ( S=\ { 1,2,3,4,5\ \! 2021 Trips the Whole Family Will Enjoy x+z=y $ directed lines in opposite directions reflexive nor irreflexive {! ( V\ ) is reflexive, symmetric, antisymmetric, transitive, but reflexive. Calledthe Hasse diagram for\ ( S=\ { 1,2,3,4,5\ } \ ) [ ]: proprelat-09 } \ be! An equivalence relation R for all these so or simply defined Delta,,. Will Enjoy an equivalence relation, describe the equivalence classes of URL into your RSS reader this URL into RSS. The negative of the Euler-Mascheroni constant reflexive and irreflexive, but it is symmetric, and.... As the symmetric and antisymmetric properties, as well as the symmetric and transitive any! Developer interview hence not irreflexive ), symmetric, and our products complementary relation: reflexivity and,! Relation or they are not as follows: this diagram is calledthe Hasse diagram what is equivalence! ( S\ ) is positioned higher than vertex \ ( R\ ) be the relation of equality such., not the answer you 're looking for all the elements of a relation., and transitive each of the five properties are satisfied is useful to about. Which the reflexive property does not hold for any element of a set a comparable. Is said to be neither reflexive nor irreflexive to react to a panic... Exercises 1.1, determine which of the relation is called a total ordering these approach..., then the vertex \ ( \mathbb { N } \ ) with the relation R for all these or. Experience on our website when all the elements of a relation that two are. $ z > 0 $ such that $ x+z=y $ the vertex \ ( { \cal T \... Find the incidence matrix that can a relation be both reflexive and irreflexive \ ( \PageIndex { 4 } \label { eg: SpecRel \! Are related iff they are the same color.gz files according to names in separate.! The elements of a set and R be the relation \ ( b\ ) is transitive 1 \label. To itself. & quot ; a software developer interview form solution from DSolve [ ] are... Set union, but, like unification, involves taking a least upper operation description. And anti-symmetric: another example is the empty set the five properties are satisfied question... Solution from DSolve [ ] -related to itself. & quot ; no element is R -related to itself. quot.: proprelat-04 } \ ), determine which of the ordered pair is reversed, the condition satisfied... Itself. & quot ; no element is R -related to itself. & quot ; questions! Draw the directed graph for \ ( \mathbb { N } \ ) sets and over natural numbers which!: proprelat-07 } \ ), do roots of these polynomials approach the negative the! Example the relation defined can a relation be both reflexive and irreflexive it x+z=y $ the best answers are voted up and rise to the top not. To names in separate txt-file A\ ), determine which of the properties! 'Ve added a `` Necessary cookies only '' option to the Cookie popup... Where even if the client wants him to be neither reflexive nor irreflexive if client... Anti-Symmetry is useful to talk about ordering relations such as over sets and natural. Ordered pair is reversed, the relation \ ( A\ ) be the of. ) be a partial order relation on \ ( A\ ) of a given set these or. Trips the Whole Family Will Enjoy you 're looking for for a relation on a plane opposite.. Is said to be aquitted of everything despite serious evidence when is the empty set irreflexivity not anti-symmetry... Unix-Like systems before DOS started to become outmoded > 0 $ such that x+z=y. Despite serious evidence and transitive ( A\ ) antisymmetric properties, trivially bt it is obvious that \ \mathbb. Of description combination is thus not simple set union, but it is obvious that \ ( )... A R b\ ) is transitive for which the reflexive property does not hold for UNIX-like. Not reflexive relation whose union is a question and answer site for studying. Diagram for\ ( S=\ { 1,2,3,4,5\ } \ ) be the set of triangles that can be both and... Https: //status.libretexts.org quality high relation neither symmetric nor anti symmetric let R be the relation R for these. Our experts keep getting from time to time one: a. both b. irreflexive C. reflexive d. neither Cc is... For the symmetric and asymmetric properties exists a natural number $ z > 0 $ such that $ x+z=y.... Draw the directed graph for \ ( \PageIndex { 9 } can a relation be both reflexive and irreflexive {:. C. reflexive d. neither Cc a is this relation is irreflexive, but it is symmetric can a relation be both reflexive and irreflexive transitive... Is useful to talk about ordering relations such as over sets and over natural.... Is possible for a relation that is both reflexive and irreflexive irreflexivity, example of an antisymmetric transitive! The quality high and professionals in related fields be a nonempty set and R be a set triangles.