Converse relation

For the usual (maybe strict or partial) order relations, the converse is the naively expected "opposite" order, for examples, {\leq^\operatorname{T}} = {\geq},\quad {}. A relation may be represented by a logical matrix such as \begin{pmatrix} 1 & 1 & 1 & 1 \\ 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix}. Then the converse relation is represented by its transpose matrix: \begin{pmatrix} 1 & 0 & 0 & 0 \\ 1 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 \\ 1 & 1 & 0 & 1 \end{pmatrix}. The converse of kinship relations are named: "A is a child of B" has converse "B is a parent of A". "A is a nephew or niece of B" has converse "B is an uncle or aunt of A". The relation "A is a sibling of B" is its own converse, since it is a symmetric relation. ==Properties==

In the monoid of binary endorelations on a set (with the binary operation on relations being the composition of relations), the converse relation does not satisfy the definition of an inverse from group theory, that is, if L is an arbitrary relation on X, then L \circ L^{\operatorname{T}} does equal the identity relation on X in general. The converse relation does satisfy the (weaker) axioms of a semigroup with involution: \left(L^{\operatorname{T}}\right)^{\operatorname{T}} = L and (L \circ R)^{\operatorname{T}} = R^{\operatorname{T}} \circ L^{\operatorname{T}}. In the calculus of relations, (the unary operation of taking the converse relation) commutes with other binary operations of union and intersection. Conversion also commutes with unary operation of complementation as well as with taking suprema and infima. Conversion is also compatible with the ordering of relations by inclusion. If a relation is reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, connected, trichotomous, a partial order, total order, strict weak order, total preorder (weak order), or an equivalence relation, its converse is too. ==Inverses==

If I represents the identity relation, then a relation R may have an inverse as follows: R is called ; :if there exists a relation X, called a '''''' of R, that satisfies R \circ X = I. ; :if there exists a relation Y, called a '''''' of R, that satisfies Y \circ R = I. ; :if it is both right-invertible and left-invertible. For an invertible homogeneous relation R, all right and left inverses coincide; this unique set is called its '''''' and it is denoted by R^{-1}. In this case, R^{-1} = R^{\operatorname{T}} holds. Converse relation of a function A function is invertible if and only if its converse relation is a function, in which case the converse relation is the inverse function. The converse relation of a function f : X \to Y is the relation f^{-1} \subseteq Y \times X defined by the \operatorname{graph}\, f^{-1} = \{ (y, x) \in Y \times X : y = f(x) \}. This is not necessarily a function: One necessary condition is that f be injective, since else f^{-1} is multi-valued. This condition is sufficient for f^{-1} being a partial function, and it is clear that f^{-1} then is a (total) function if and only if f is surjective. In that case, meaning if f is bijective, f^{-1} may be called the inverse function of f. For example, the function f(x) = 2x + 2 has the inverse function f^{-1}(x) = \frac{x}{2} - 1. However, the function g(x) = x^2 has the inverse relation g^{-1}(x) = \pm \sqrt{x}, which is not a function, being multi-valued. ==Composition with relation==

Using composition of relations, a relation can be composed with its converse. For the subset relation \subseteq on the power set \mathcal P(U) of a universe U, both compositions with its converse are the universal relation on \mathcal P(U): : (\subseteq)\circ(\supseteq)=\mathcal P(U)\times\mathcal P(U) \quad\text{and}\quad (\supseteq)\circ(\subseteq)=\mathcal P(U)\times\mathcal P(U). Indeed, for any A,C\subseteq U, : A\big((\subseteq)\circ(\supseteq)\big)C \iff \exists B\subseteq U:\ A\subseteq B \land C\subseteq B which holds by taking B=A\cup C; similarly, : A\big((\supseteq)\circ(\subseteq)\big)C \iff \exists B\subseteq U:\ B\subseteq A \land B\subseteq C, which holds by taking B=A\cap C. Now consider the set membership relation \in\; \subseteq\ U\times\mathcal P(U) and its converse \ni\; \subseteq\ \mathcal P(U)\times U. For sets A,B\subseteq U, : A\,(\ni\circ\in)\,B \iff \exists z\in U:\ z\in A \land z\in B \iff A\cap B\neq\emptyset, so \ni\circ\in is the "nonempty intersection" relation on \mathcal P(U). Conversely, for elements x,y\in U, : x\,(\in\circ\ni)\,y \iff \exists A\subseteq U:\ x\in A \land y\in A, which always holds (e.g. for A=\{x,y\}); hence \in\circ\ni = U\times U is the universal relation on U. The compositions are used to classify relations according to type: for a relation Q, when the identity relation on the range of Q contains QTQ, then Q is called univalent. When the identity relation on the domain of Q is contained in QQT, then Q is called total. When Q is both univalent and total then it is a function. When QT is univalent, then Q is termed injective. When QT is total, Q is termed surjective. If Q is univalent, then QQT is an equivalence relation on the domain of Q, see Transitive relation#Related properties. ==See also==