In mathematics, a partial equivalence relation (often abbreviated as PER) R on a set X is a relation that is symmetric and transitive. In other words, it holds for all
that:
- if aRb, then bRa (symmetry)
- if aRb and bRc, then aRc (transitivity)
If R is also reflexive, then R is an equivalence relation.
A simple example of a PER that is not an equivalence relation is the empty relation
(unless
, in which case the empty relation is an equivalence relation (and is the only relation on X)).
There is a simple structure to the general PER R on X: it is an equivalence relation on the subset
. (Y is the subset of X such that in the complement of Y (
) no element is related by R to any other.) By construction, R is reflexive on Y and therefore an equivalence relation on Y. Notice that R is actually only defined on elements of Y: if
, then there is no
for which zRw; if there were, then by symmetry we would have wRz, which would imply zRz by transitivity, which would contradict
.
Example
For an example of a PER, consider a set A and a partial function f that is defined on some elements of A but not all. Then the relation
defined by
if and only if f is defined at x, f is defined at y, and f(x) = f(y)
is a partial equivalence relation but not an equivalence relation. It possesses the symmetry and transitivity properties, but it is not reflexive since if f(x) is not defined then
— in fact, for such an x there is no
such that
. (It follows immediately that the subset of A for which
is an equivalence relation is precisely the subset on which f is defined.)
Uses
PERs are used mainly in computer science, particularly in type theory. It is also used in constructive mathematics to define setoids, sometimes called partial setoids. The action of forming one from a type and a PER is analogous to the operations of subset and quotient in classical set-theoretic mathematics.
See also
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)


