# Inverse relation

{{#invoke:Hatnote|hatnote}}

In mathematics, the inverse relation of a binary relation is the relation that occurs when the order of the elements is switched in the relation. For example, the inverse of the relation 'child of' is the relation 'parent of'. In formal terms, if ${\displaystyle X{\text{ and }}Y}$ are sets and ${\displaystyle L\subseteq X\times Y}$ is a relation from X to Y then ${\displaystyle L^{-1}}$ is the relation defined so that ${\displaystyle y\,L^{-1}\,x}$ if and only if ${\displaystyle x\,L\,y}$ (Halmos 1975, p. 40). In another way, ${\displaystyle L^{-1}=\{(y,x)\in Y\times X\mid (x,y)\in L\}}$.

The notation comes by analogy with that for an inverse function. Though many functions do not have an inverse; every relation does.

The inverse relation is also called the converse relation or transpose relation (in view of its similarity with the transpose of a matrix: these are the most familiar examples of dagger categories), and may be written as LC, LT, L~ or ${\displaystyle {\breve {L}}}$.

Note that, despite the notation, the converse relation is not an inverse in the sense of composition of relations: ${\displaystyle L\circ L^{-1}\neq {\mathrm {id} }}$ in general.

## Properties

The set of all binary relations on a set is a semigroup with involution with the involution being the mapping of a relation to its inverse relation. More generally, the operation of taking a relation to its inverse gives the category of relations Rel the structure of a dagger category (aka category with involution).

A relation equal to its inverse is a symmetric relation (in the language of dagger categories, it is self-adjoint).

If a relation is reflexive, irreflexive, symmetric, antisymmetric, asymmetric, transitive, total, trichotomous, a partial order, total order, strict weak order, total preorder (weak order), or an equivalence relation, its inverse is too.

However, if a relation is extendable, this need not be the case for the inverse.

## Examples

For usual (maybe strict or partial) order relations, the converse is the naively expected "opposite" order, e.g. ${\displaystyle \leq ^{-1}=\ \geq ,~<^{-1}=\ >}$, etc.

## Inverse relation of a function

A function is invertible if and only if its inverse relation is a function, in which case the inverse relation is the inverse function.

This is not necessarily a function: One necessary condition is that f be injective, since else ${\displaystyle f^{-1}}$ is multi-valued. This condition is sufficient for ${\displaystyle f^{-1}}$ being a partial function, and it is clear that ${\displaystyle f^{-1}}$ then is a (total) function if and only if f is surjective. In that case, i.e. if f is bijective, ${\displaystyle f^{-1}}$ may be called the inverse function of f.