|
In mathematics, a partial equivalence relation (often abbreviated as PER) R on a set X is a relation which is symmetric and transitive. In other words, it holds for all a, b and c in X that:
If R is reflexive, then R is an equivalence relation. On the other hand, R could be taken as the empty relation, so that there are PERs that are not equivalence relations. There is in fact a simple structure to the general PER R on X: it is an equivalence relation on some subset Y of X, such that in the complement of Y no element is related by R to any other. Concretely, let [edit] ExampleFor 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
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 [edit] UsesPER's are used mainly in computer science, 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 an analogue to the operations of subset and quotient in classical set-theoretic mathematics. [edit] See alsoPágina espejo de la WikipediaDirectorio de Enlaces Directorio dmoz Directorio espejo dmoz Pedro Bernardo |