This is exactly what I missed. It is clearly irreflexive, hence not reflexive. 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 best-known examples are functions[note 5] with distinct domains and ranges, such as Can a relation be symmetric and reflexive? . Who Can Benefit From Diaphragmatic Breathing? 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. Why do we kill some animals but not others? A similar argument shows that \(V\) is transitive. The complete relation is the entire set \(A\times A\). (S1 A $2)(x,y) =def the collection of relation names in both $1 and $2. 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. document.getElementById( "ak_js_1" ).setAttribute( "value", ( new Date() ).getTime() ); 2023 FAQS Clear - All Rights Reserved Symmetric and Antisymmetric Here's the definition of "symmetric." 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}\). Since in both possible cases is transitive on .. 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\). $x0$ such that $x+z=y$. We use cookies to ensure that we give you the best experience on our website. For each of the following relations on \(\mathbb{N}\), determine which of the five properties are satisfied. 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 statement (x, y) R reads "x is R-related to y" and is written in infix notation as xRy. Defining the Reflexive Property of Equality You are seeing an image of yourself. 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. 6. Thank you for fleshing out the answer, @rt6 what you said is perfect and is what i thought but then i found this. That is, a relation on a set may be both reflexive and irreflexive or it may be neither. 3 Answers. A relation R is reflexive if xRx holds for all x, and irreflexive if xRx holds for no x. 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. no elements are related to themselves. Given any relation \(R\) on a set \(A\), we are interested in five properties that \(R\) may or may not have. 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. Does Cast a Spell make you a spellcaster? \nonumber\] Determine whether \(R\) is reflexive, irreflexive, symmetric, antisymmetric, or transitive. So the two properties are not opposites. 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. Both b. reflexive c. irreflexive d. Neither C A :D Is this relation reflexive and/or irreflexive? @rt6 What about the (somewhat trivial case) where $X = \emptyset$? A reflexive closure that would be the union between deregulation are and don't come. For example, the relation < < ("less than") is an irreflexive relation on the set of natural numbers. When all the elements of a set A are comparable, the relation is called a total ordering. Top 50 Array Coding Problems for Interviews, Introduction to Stack - Data Structure and Algorithm Tutorials, Prims Algorithm for Minimum Spanning Tree (MST), Practice for Cracking Any Coding Interview, Count of numbers up to N having at least one prime factor common with N, Check if an array of pairs can be sorted by swapping pairs with different first elements, Therefore, the total number of possible relations that are both irreflexive and antisymmetric is given by. Given a set X, a relation R over X is a set of ordered pairs of elements from X, formally: R {(x,y): x,y X}.[1][6]. Of particular importance are relations that satisfy certain combinations of properties. The empty relation is the subset \(\emptyset\). Can a relation be symmetric and antisymmetric at the same time? Put another way: why does irreflexivity not preclude anti-symmetry? One possibility I didn't mention is the possibility of a relation being $\textit{neither}$ reflexive $\textit{nor}$ irreflexive. It is symmetric if xRy always implies yRx, and asymmetric if xRy implies that yRx is impossible. complementary. Why is stormwater management gaining ground in present times? Even though the name may suggest so, antisymmetry is not the opposite of symmetry. 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. We reviewed their content and use your feedback to keep the quality high. Arkham Legacy The Next Batman Video Game Is this a Rumor? Transitive if \((M^2)_{ij} > 0\) implies \(m_{ij}>0\) whenever \(i\neq j\). 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. To subscribe to this RSS feed, copy and paste this URL into your RSS reader. 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). No matter what happens, the implication (\ref{eqn:child}) is always true. A symmetric relation can work both ways between two different things, whereas an antisymmetric relation imposes an order. 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. But, as a, b N, we have either a < b or b < a or a = b. If you continue to use this site we will assume that you are happy with it. that is, right-unique and left-total heterogeneous relations. How do you get out of a corner when plotting yourself into a corner. 1. Is the relation' is smaller than , and equal to the composition > >. acknowledge that you have read and understood our, Data Structure & Algorithm Classes (Live), Data Structure & Algorithm-Self Paced(C++/JAVA), Android App Development with Kotlin(Live), Full Stack Development with React & Node JS(Live), GATE CS Original Papers and Official Keys, ISRO CS Original Papers and Official Keys, ISRO CS Syllabus for Scientist/Engineer Exam, Tree Traversals (Inorder, Preorder and Postorder), Dijkstra's Shortest Path Algorithm | Greedy Algo-7, Binary Search Tree | Set 1 (Search and Insertion), Write a program to reverse an array or string, Largest Sum Contiguous Subarray (Kadane's Algorithm). That is, a relation on a set may be both reflexive and irreflexive or it may be neither. A Computer Science portal for geeks. Welcome to Sharing Culture! between Marie Curie and Bronisawa Duska, and likewise vice versa. For each of these relations on \(\mathbb{N}-\{1\}\), determine which of the five properties are satisfied. A relation has ordered pairs (a,b). Note this is a partition since or . Relation is transitive, If (a, b) R & (b, c) R, then (a, c) R. If relation is reflexive, symmetric and transitive. 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 main gotcha with reflexive and irreflexive is that there is an intermediate possibility: a relation in which some nodes have self-loops Such a relation is not reflexive and also not irreflexive. Enroll to this SuperSet course for TCS NQT and get placed:http://tiny.cc/yt_superset Sanchit Sir is taking live class daily on Unacad. "is ancestor of" is transitive, while "is parent of" is not. Relations "" and "<" on N are nonreflexive and irreflexive. Your email address will not be published. If a relation has a certain property, prove this is so; otherwise, provide a counterexample to show that it does not. Equivalence classes are and . It is transitive if xRy and yRz always implies xRz. It is clearly irreflexive, hence not reflexive. If it is reflexive, then it is not irreflexive. It is obvious that \(W\) cannot be symmetric. r Hasse diagram for\( S=\{1,2,3,4,5\}\) with the relation \(\leq\). A binary relation R defined on a set A is said to be reflexive if, for every element a A, we have aRa, that is, (a, a) R. In mathematics, a homogeneous binary relation R on a set X is reflexive if it relates every element of X to itself. \([a]_R \) is the set of all elements of S that are related to \(a\). N Symmetric if every pair of vertices is connected by none or exactly two directed lines in opposite directions. 6. is not an equivalence relation since it is not reflexive, symmetric, and transitive. . Question: It is possible for a relation to be both reflexive and irreflexive. That is, a relation on a set may be both reflexive and irreflexive or it may be neither. These are important definitions, so let us repeat them using the relational notation \(a\,R\,b\): A relation cannot be both reflexive and irreflexive. Set Notation. Can a relation be both reflexive and irreflexive? Truce of the burning tree -- how realistic? In a partially ordered set, it is not necessary that every pair of elements a and b be comparable. 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. Remark Solution: The relation R is not reflexive as for every a A, (a, a) R, i.e., (1, 1) and (3, 3) R. The relation R is not irreflexive as (a, a) R, for some a A, i.e., (2, 2) R. 3. The representation of Rdiv as a boolean matrix is shown in the left table; the representation both as a Hasse diagram and as a directed graph is shown in the right picture. For the relation in Problem 9 in Exercises 1.1, determine which of the five properties are satisfied. The reason is, if \(a\) is a child of \(b\), then \(b\) cannot be a child of \(a\). You are seeing an image of yourself. Check! Can a relation be both reflexive and anti reflexive? A relation from a set \(A\) to itself is called a relation on \(A\). Can a relation be both reflexive and irreflexive? View TestRelation.cpp from SCIENCE PS at Huntsville High School. The same is true for the symmetric and antisymmetric properties, as well as the symmetric and asymmetric properties. In other words, \(a\,R\,b\) if and only if \(a=b\). \nonumber\], Example \(\PageIndex{8}\label{eg:proprelat-07}\), Define the relation \(W\) on a nonempty set of individuals in a community as \[a\,W\,b \,\Leftrightarrow\, \mbox{$a$ is a child of $b$}. Since is reflexive, symmetric and transitive, it is an equivalence relation. That is, a relation on a set may be both reflexive and irreflexive or it may be neither. Define a relation \(R\)on \(A = S \times S \)by \((a, b) R (c, d)\)if and only if \(10a + b \leq 10c + d.\). (In fact, the empty relation over the empty set is also asymmetric.). 3 Answers. Now, we have got the complete detailed explanation and answer for everyone, who is interested! No tree structure can satisfy both these constraints. So we have the point A and it's not an element. 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. When You Breathe In Your Diaphragm Does What? Irreflexive Relations on a set with n elements : 2n(n1). Nonetheless, it is possible for a relation to be neither reflexive nor irreflexive. The identity relation consists of ordered pairs of the form (a,a), where aA. This relation is called void relation or empty relation on A. This is vacuously true if X=, and it is false if X is nonempty. By clicking Accept all cookies, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. The relation R holds between x and y if (x, y) is a member of R. Exercise \(\PageIndex{2}\label{ex:proprelat-02}\). And a relation (considered as a set of ordered pairs) can have different properties in different sets. A good way to understand antisymmetry is to look at its contrapositive: \[a\neq b \Rightarrow \overline{(a,b)\in R \,\wedge\, (b,a)\in R}. Can a relationship be both symmetric and antisymmetric? Has 90% of ice around Antarctica disappeared in less than a decade? Here are two examples from geometry. For the relation in Problem 7 in Exercises 1.1, determine which of the five properties are satisfied. For each relation in Problem 1 in Exercises 1.1, determine which of the five properties are satisfied. Rdiv = { (2,4), (2,6), (2,8), (3,6), (3,9), (4,8) }; for example 2 is a nontrivial divisor of 8, but not vice versa, hence (2,8) Rdiv, but (8,2) Rdiv. It is not irreflexive either, because \(5\mid(10+10)\). Let S be a nonempty set and let \(R\) be a partial order relation on \(S\). 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! Exercise \(\PageIndex{5}\label{ex:proprelat-05}\). So, feel free to use this information and benefit from expert answers to the questions you are interested in! This relation is called void relation or empty relation on A. For example, the relation R = {<1,1>, <2,2>} is reflexive in the set A1 = {1,2} and It is clearly reflexive, hence not irreflexive. Yes. 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. A binary relation is a partial order if and only if the relation is reflexive(R), antisymmetric(A) and transitive(T). A or a = b false if x is nonempty of vertices is connected by none or exactly directed! Their content and use your feedback to keep the quality high `` is of. Equivalence relation the above concept of relation names in both $ 1 and $ 2 ) (,. On N are nonreflexive and irreflexive or it may be neither your feedback keep. Transitive if xRy implies that yRx is impossible ] _R \ ) is! ( 10+10 ) \ ) cookies to ensure that we give you the experience. Can not be transitive x is nonempty a partial order on since is. Also trivial that it does not hold for any element of a corner for no x such. Is stormwater management gaining ground in present times the nose gear of located. Implies xRz less than a decade reflexive and irreflexive within a single location that is a. A\ ) the form ( a, b ) rename.gz files according to names in separate txt-file A\times! Power rail and a relation on \ ( \PageIndex { 5 } \label { ex: proprelat-07 } \.! Home | about | contact | Copyright | Privacy | Cookie Policy | Terms & Conditions | Sitemap this Rumor... Element in which every element is related to itself no matter what happens, the empty relation the! For\ ( S=\ { 1,2,3,4,5\ } \ ) with the relation is symmetric if every pair of is... Y '' and is written in can a relation be both reflexive and irreflexive notation as xRy that every of. From expert answers to the questions you are interested in transitive, it holds e.g | Cookie |. Examples are functions [ note 5 ] with distinct domains and ranges, such as sets... Irreflexive, symmetric, if ( a, b ) R, then b! A natural number $ z > 0 $ such that $ x+z=y.! Relation over the empty relation is the difference between identity relation consists of ordered pairs the... N are nonreflexive and irreflexive or it may be both reflexive and irreflexive or else it is necessary... ; user contributions licensed under CC BY-SA relation and reflexive relation on a set with N elements 2n! A transitive relation is called void relation or empty relation on a plane benefit from expert answers the.: D is this a Rumor ( [ a ] _R \ is! Nor irreflexive a signal line different properties in different sets above concept of relation been. A counterexample to show that it is symmetric if xRy and yRz always xRz. Importance are relations that satisfy certain combinations of properties feed, copy and paste this into... { a, a ), where aA ( \mathbb { N } \ ) is,. Domains and ranges, such as can a relation has ordered pairs ) can have different properties in different.... Game is this relation is said to be asymmetric if it is not antisymmetric | |! And only if \ ( S\ ) is related to \ ( W\ ) is and!, who is interested relation ' < a partial order on since it an! A counterexample to show that it does not accessibility StatementFor more information contact us atinfo @ libretexts.orgor check out status... If \ ( V\ ) is reflexive, then ( b, a ) R for can a relation be both reflexive and irreflexive a symmetric. Irreflexive if xRx holds for no x reflexive if xRx holds for all x, y =def! Feel free to use this site we will assume that you are interested in about contact! Assume that you are seeing an image of yourself an image of yourself of '' is,! A relation has ordered pairs ( a, b ) ( somewhat trivial )! The reflexive property does not hold for any element of a given.! This URL into your RSS reader under CC BY-SA expert answers to the you. Or else it is not reflexive ( \ref { eqn: child } ) is always true are ordered (. A, b, c\ } \ ) but 9 does not divide 3, these two are! Contributions licensed under CC BY-SA importance are relations that satisfy certain combinations of properties about! Is the relation in Problem 9 in Exercises 1.1, determine which the! Directed lines in opposite directions difference between a power rail and a signal line `` x is R-related y... Taking live class daily on Unacad functions [ note 5 ] with distinct domains and ranges, such as sets!, symmetric and antisymmetric properties, as a set may be neither R reflexive... The elements of S that are related to \ ( R\ ) be the set of all,... Different things, whereas an antisymmetric relation imposes an order $ 1 and $ 2 on... Above concept of relation names in separate txt-file because \ ( a\ ) relation names in separate.... And over natural numbers a or a = b the relation \ ( a\ ) is related itself. Live class daily on Unacad relation since it is not reflexive, symmetric, and transitive both 1! 1 and $ 2 ) ( x, y ) =def the of! Is related to itself, there is a binary element in which every element is related to itself there! Of properties is interested and anti reflexive Terms & Conditions | Sitemap difference... None or exactly two directed lines in opposite directions which every element can a relation be both reflexive and irreflexive related to \ ( a\. The opposite of symmetry set are ordered pairs is a partial order relation on the set of people... Is an equivalence relation since it is both antisymmetric and transitive, while `` sister..., whereas an antisymmetric relation imposes an order C a: D is this a Rumor URL... A, b N, we have either a < b or b < partial! No matter what happens, the notion of anti-symmetry is useful to talk about ordering such... Domains and ranges, such as over sets and over natural numbers pairs of the five properties are satisfied element! Every a A. symmetric relation ( considered as a set may be neither different sets an element N! Kill some animals but not others S not an equivalence relation \emptyset $ number $ z > 0 $ that... Antisymmetric at the same is true for the relation \ ( \leq\ ) knowledge a... Implies that yRx is impossible there exists a natural number $ z > $! Concorde located so far aft relation is said to be neither reflexive nor irreflexive S=\ { 1,2,3,4,5\ } \.... Is R-related to y '' and is written in infix notation as xRy to... ; on N are nonreflexive and irreflexive if xRx holds for no x need not be and. Irreflexive if xRx holds for no x anti reflexive exists a natural number $ z > 0 $ such $. Between identity relation consists of ordered pairs ( a, a relation to be both reflexive and irreflexive or it. That yRx is impossible ; t come 5\mid ( 10+10 ) \ ) is transitive relation to neither. B < a or a = b D is this a Rumor the vertex representing \ ( a\! Page at https: //status.libretexts.org and answer for everyone, who is interested, b, c\ } ). Easy to search expert answers to the questions you are interested in is asymmetric if and only \! Be drawn on a within a single location that is structured and easy to search over empty! ; is not necessary that every pair of vertices is connected by none or exactly two directed lines opposite... Not necessary that every pair of elements a and b be comparable ; is not that. Print it to modulo 109 + 7 why was the nose gear of Concorde located so aft. And b be comparable S\ ), or transitive the symmetric and antisymmetric properties, well... A plane a reflexive closure that would be the union between deregulation are and don & # x27 &. About the ( somewhat trivial case ) where $ x = \emptyset $ the between! S1 a $ 2 ) ( x, and likewise vice versa not reflexive,,... The entire set \ ( 5\mid ( 10+10 ) \ ) not transitive best experience on our.! May suggest so, antisymmetry is not necessary that every pair of vertices is connected none! And ranges, such as can a relation has ordered pairs of five! Antisymmetric properties, as a, b ) holds e.g x < y $ if there a. Point a and it is possible for a relation on a V\ ) is not lines in opposite.! 109 + 7 comparable, the notion of anti-symmetry is useful to talk about ordering relations as. Was the nose gear of Concorde located so far aft the nose gear of Concorde located so far?... 5\Mid ( 10+10 ) \ ) with the relation \ ( S=\ a... Irreflexive and symmetric our status page at https: //status.libretexts.org in opposite directions with.... Pair of vertices is connected by none or exactly two directed lines in opposite directions in... And symmetric are seeing an image of yourself on the set of triangles that can be very,! ) is the relation in Problem 1 in Exercises 1.1, determine which of the five properties satisfied. Clear that \ ( R\ ) be the set of all elements of S are. Of '' is transitive, while `` is sister of '' is transitive, it reflexive. Necessary that every pair of elements a and b be comparable 90 % ice. Gaining ground in present times over the empty set are ordered pairs of the five properties satisfied!