Inverse relation

For inverse relationships in statistics, see negative relationship.

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 X and Y are sets and LX × Y is a relation from X to Y, then L−1 is the relation defined so that y L−1 x if and only if x L y. In set-builder notation, L−1 = {(y, x) ∈ Y × X | (x, y) ∈ L}.

The notation is analogous with that for an inverse function. Although many functions do not have an inverse, every relation does have a unique inverse. Despite the notation and terminology, the inverse relation is not an inverse in the sense of group inverse. However, the unary operation that maps a relation to the inverse relation is an involution, so it induces the structure of a semigroup with involution on the binary relations on a set, or, more generally, induces a dagger category on the category of relations as detailed below. As a unary operation, taking the inverse (sometimes called inversion) commutes with the order-related operations of relation algebra, i.e., it commutes with union, intersection, complement etc.

The inverse relation is also called the converse relation or transpose relation the latter in view of its similarity with the transpose of a matrix.[1] It has also been called the opposite or dual of the original relation.[2] Other notations for the inverse relation include LC, LT, L~ or or L° or L.


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.

For example, the function has the inverse function .


In the monoid of binary endorelations on a set (with the binary operation on relations being the composition of relations), the inverse relation does not satisfy the definition of an inverse from group theory, i.e. if L is an arbitrary relation on X, then does not equal the identity relation on X in general. The inverse relation does satisfy the (weaker) axioms of a semigroup with involution: and .[3]

Since one may generally consider relations between different sets (which form a category rather than a monoid, namely the category of relations Rel), in this context the inverse relation conforms to the axioms of a dagger category (aka category with involution).[3] A relation equal to its inverse is a symmetric relation; in the language of dagger categories, it is self-adjoint.

Furthermore, the semigroup of endorelations on a set is also a partially ordered structure (with inclusion of relations as sets), and actually an involutive quantale. Similarly, the category of heterogenous relations, Rel is also an ordered category.[3]

In relation algebra (which is an abstraction of the properties of the algebra of endorelations on a set), inversion (the operation of taking the inverse relation) commutes with other binary operations of union and intersection. Inversion also commutes with unary operation of complementation as well as with taking suprema and infima. Inversion is also compatible with the ordering of relations by inclusion.[1]

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.

See also


  1. 1 2 Gunther Schmidt; Thomas Ströhlein (1993). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Berlin Heidelberg. pp. 9–10. ISBN 978-3-642-77970-1.
  2. Celestina Cotti Ferrero; Giovanni Ferrero (2002). Nearrings: Some Developments Linked to Semigroups and Groups. Kluwer Academic Publishers. p. 3. ISBN 978-1-4613-0267-4.
  3. 1 2 3 Joachim Lambek (2001). "Relations Old and New". In Ewa Orlowska, Andrzej Szalas. Relational Methods for Computer Science Applications. Springer Science & Business Media. pp. 135–146. ISBN 978-3-7908-1365-4.
This article is issued from Wikipedia - version of the 10/9/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.