Apartness relation

In constructive mathematics, an apartness relation is a constructive form of inequality, and is often taken to be more basic than equality. It is often written as # to distinguish from the negation of equality (the denial inequality) ≠, which is weaker.

Description

An apartness relation is a symmetric irreflexive binary relation with the additional condition that if two elements are apart, then any other element is apart from at least one of them (this last property is often called co-transitivity or comparison).

That is, a binary relation # is an apartness relation if it satisfies:[1]

$\neg \;(x\#x)$
$x\#y\;\to \;y\#x$
$x\#y\;\to \;(x\#z\;\vee \;y\#z)$

The complement of an apartness relation is an equivalence relation, as the above three conditions become reflexivity, symmetry, and transitivity. If this equivalence relation is in fact equality, then the apartness relation is called tight. That is, # is a tight apartness relation if it additionally satisfies:

4.

\neg \;(x\#y)\;\to \;x=y

In classical mathematics, it also follows that every apartness relation is the complement of an equivalence relation, and the only tight apartness relation on a given set is the complement of equality. So in that domain, the concept is not useful. In constructive mathematics, however, this is not the case.

The prototypical apartness relation is that of the real numbers: two real numbers are said to be apart if there exists (one can construct) a rational number between them. In other words, real numbers x and y are apart if there exists a rational number z such that x < z < y or y < z < x. The natural apartness relation of the real numbers is then the disjunction of its natural pseudo-order. The complex numbers, real vector spaces, and indeed any metric space then naturally inherit the apartness relation of the real numbers, even though they do not come equipped with any natural ordering.

If there is no rational number between two real numbers, then the two real numbers are equal. Classically, then, if two real numbers are not equal, one would conclude that there exists a rational number between them. However it does not follow that one can actually construct such a number. Thus to say two real numbers are apart is a stronger statement, constructively, than to say that they are not equal, and while equality of real numbers is definable in terms of their apartness, the apartness of real numbers cannot be defined in terms of their equality. For this reason, in constructive topology especially, the apartness relation over a set is often taken as primitive, and equality is a defined relation.

A set endowed with an apartness relation is known as a constructive setoid. A function $f:A\rightarrow B$ where A and B are constructive setoids is called a morphism for #_A and #_B if $\forall x,\,y:A.\,f(x)\;\#_{B}\;f(y)\Rightarrow x\;\#_{A}\;y$ .

gollark: There are licensing bees and it's too much for some bad computers to do in software.

gollark: H.264 is fairly universal, YouTube likes VP9 and occasionally AV1, and some people like H.265.

gollark: Codecs are rather complex now, so containers generally support many different ones and codecs can go in different containers.

gollark: No.

gollark: Since nowadays codecs and containers are pretty orthogonal.

References

Troelstra, A. S.; Schwichtenberg, H. (2000), Basic proof theory, Cambridge Tracts in Theoretical Computer Science, 43 (2nd ed.), Cambridge University Press, Cambridge, p. 136, doi:10.1017/CBO9781139168717, ISBN 0-521-77911-1, MR 1776976.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Troelstra, A. S.; Schwichtenberg, H. (2000), Basic proof theory, Cambridge Tracts in Theoretical Computer Science, 43 (2nd ed.), Cambridge University Press, Cambridge, p. 136, doi:10.1017/CBO9781139168717, ISBN 0-521-77911-1, MR 1776976.