Inverse Relation

(Redirected from Inverse Function)
Jump to: navigation, search

An Inverse Relation is a Binary Relation between Binary Relations where the Variable order is switched.



  • (Wikipedia, 2015) ⇒ Retrieved:2015-12-30.
    • 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 [math] X \text{ and } Y [/math] are sets and [math] L \subseteq X \times Y [/math] is a relation from X to Y then [math] L^{-1} [/math] is the relation defined so that [math] y\,L^{-1}\,x [/math] if and only if [math] x\,L\,y [/math] . In set-builder notation, [math] L^{-1} = \{(y, x) \in Y \times X \mid (x, y) \in L \} [/math] .

      The notation comes by analogy 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; the unary operation that maps a relation to the inverse relation is however 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 however 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. Other notations for the inverse relation include LC, LT, L~ or [math] \breve{L} [/math] or L° or L.

  1. Cite error: Invalid <ref> tag; no text was provided for refs named SchmidtStröhlein1993