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 are sets and is a relation from X to Y then is the relation defined so that if and only if (Halmos 1975, p. 40). In another way, .
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 .
Note that, despite the notation, the converse relation is not an inverse in the sense of composition of relations: in general.
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.
For usual (maybe strict or partial) order relations, the converse is the naively expected "opposite" order, e.g. , 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.
The inverse relation of a function is the relation defined by .
This is not necessarily a function: One necessary condition is that f be injective, since else is multi-valued. This condition is sufficient for being a partial function, and it is clear that then is a (total) function if and only if f is surjective. In that case, i.e. if f is bijective, may be called the inverse function of f.