Inverse relation
From Wikipedia, the free encyclopedia
In mathematics, the inverse relation of a binary relation is the relation taken 'backwards', as in changing the relation 'child of' to 'parent of'. In formal terms, if
- is a binary relation with
then the inverse relation is
- defined by ,
i.e. with .
The inverse relation is also called the converse relation and may be written as LC, LT (in view of its similarity with the transpose of a matrix), or .
Contents |
[edit] Properties
A relation equal to its inverse is a symmetric relation.
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.
[edit] Examples
For usual (maybe strict or partial) order relations, the converse is the naively expected "opposite" order, e.g. , etc. (Parentheses would not be needed here but have been added for clarity.)
[edit] Inverse relation of a 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 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, i.e. if f is bijective, f - 1 may be called the inverse function of f.