Euclidean relation

File:Euclidean.PNG

A binary relation R on a set X is Euclidean (sometimes called right Euclidean) if it satisfies the following: for every a, b, c in X, if a is related to b and c, then b is related to c.{{citation|title=Reasoning About Knowledge|first=Ronald|last=Fagin|authorlink=Ronald Fagin|publisher=MIT Press|year=2003|isbn=978-0-262-56200-3|page=60|url=https://books.google.com/books?id=xHmlRamoszMC&pg=PA60}}. To write this in predicate logic:

:$\backslash forall\; a,\; b,\; c\backslash in\; X\backslash ,(a\backslash ,R\backslash ,\; b\; \backslash land\; a\; \backslash ,R\backslash ,\; c\; \backslash to\; b\; \backslash ,R\backslash ,\; c).$

Dually, a relation R on X is left Euclidean if for every a, b, c in X, if b is related to a and c is related to a, then b is related to c:

:$\backslash forall\; a,\; b,\; c\backslash in\; X\backslash ,(b\backslash ,R\backslash ,\; a\; \backslash land\; c\; \backslash ,R\backslash ,\; a\; \backslash to\; b\; \backslash ,R\backslash ,\; c).$

File:Right Euclidean relation scheme svg.svg

1. Due to the commutativity of ∧ in the definition's antecedent, aRb ∧ aRc even implies bRc ∧ cRb when R is right Euclidean. Similarly, bRa ∧ cRa implies bRc ∧ cRb when R is left Euclidean.
2. The property of being Euclidean is different from transitivity. For example, ≤ is transitive, but not right Euclidean,e.g. 0 ≤ 2 and 0 ≤ 1, but not 2 ≤ 1 while xRy defined by 0 ≤ x ≤ y + 1 ≤ 2 is not transitive,e.g. 2R1 and 1R0, but not 2R0 but right Euclidean on natural numbers.
3. For symmetric relations, transitivity, right Euclideanness, and left Euclideanness all coincide. However, a non-symmetric relation can also be both transitive and right Euclidean, for example, xRy defined by y=0.
4. A relation that is both right Euclidean and reflexive is also symmetric and therefore an equivalence relation.xRy and xRx implies yRx. Similarly, each left Euclidean and reflexive relation is an equivalence.
5. The range of a right Euclidean relation is always a subsetEquality of domain and range isn't necessary: the relation xRy defined by y=min{x,2} is right Euclidean on the natural numbers, and its range, {0,1,2}, is a proper subset of its domain of the natural numbers. of its domain. The restriction of a right Euclidean relation to its range is always reflexive,If y is in the range of R, then xRy ∧ xRy implies yRy, for some suitable x. This also proves that y is in the domain of R. and therefore an equivalence. Similarly, the domain of a left Euclidean relation is a subset of its range, and the restriction of a left Euclidean relation to its domain is an equivalence. Therefore, a right Euclidean relation on X that is also right total (respectively a left Euclidean relation on X that is also left total) is an equivalence, since its range (respectively its domain) is X.{{citation|title=An Alternative Definition for Equivalence Relations|first=Charles|last=Buck|journal=The Mathematics Teacher|year=1967|volume=60|issue=2 |pages=124–125|doi=10.5951/MT.60.2.0124 |jstor=27957510 |url=https://www.jstor.org/stable/27957510}}.
6. A relation R is both left and right Euclidean, if, and only if, the domain and the range set of R agree, and R is an equivalence relation on that set.The only if direction follows from the previous paragraph. — For the if direction, assume aRb and aRc, then a,b,c are members of the domain and range of R, hence bRc by symmetry and transitivity; left Euclideanness of R follows similarly.
7. A right Euclidean relation is always quasitransitive,If xRy ∧ ¬yRx ∧ yRz ∧ ¬zRy holds, then both y and z are in the range of R. Since R is an equivalence on that set, yRz implies zRy. Hence the antecedent of the quasi-transitivity definition formula cannot be satisfied. as is a left Euclidean relation.A similar argument applies, observing that x,y are in the domain of R.
8. A connected right Euclidean relation is always transitive;If xRy ∧ yRz holds, then y and z are in the range of R. Since R is connected, xRz or zRx or x=z holds. In case 1, nothing remains to be shown. In cases 2 and 3, also x is in the range. Hence, xRz follows from the symmetry and reflexivity of R on its range, respectively. and so is a connected left Euclidean relation.Similar, using that x, y are in the domain of R.
9. If X has at least 3 elements, a connected right Euclidean relation R on X cannot be antisymmetric,Since R is connected, at least two distinct elements x,y are in its range, and xRy ∨ yRx holds. Since R is symmetric on its range, even xRy ∧ yRx holds. This contradicts the antisymmetry property. and neither can a connected left Euclidean relation on X.By a similar argument, using the domain of R. On the 2-element set X = { 0, 1 }, e.g. the relation xRy defined by y=1 is connected, right Euclidean, and antisymmetric, and xRy defined by x=1 is connected, left Euclidean, and antisymmetric.
10. A relation R on a set X is right Euclidean if, and only if, the restriction R{{prime}} := R{{!}}_ran(R) is an equivalence and for each x in X\ran(R), all elements to which x is related under R are equivalent under R{{prime}}.Only if: R{{prime}} is an equivalence as shown above. If x∈X\ran(R) and xR{{prime}}y₁ and xR{{prime}}y₂, then y₁Ry₂ by right Euclideaness, hence y₁R{{prime}}y₂. — If: if xRy ∧ xRz holds, then y,z∈ran(R). In case also x∈ran(R), even xR{{prime}}y ∧ xR{{prime}}z holds, hence yR{{prime}}z by symmetry and transitivity of R{{prime}}, hence yRz. In case x∈X\ran(R), the elements y and z must be equivalent under R{{prime}} by assumption, hence also yRz. Similarly, R on X is left Euclidean if, and only if, R{{prime}} := R{{!}}_dom(R) is an equivalence and for each x in X\dom(R), all elements that are related to x under R are equivalent under R{{prime}}.
11. A left Euclidean relation is left-unique if, and only if, it is antisymmetric. Similarly, a right Euclidean relation is right unique if, and only if, it is anti-symmetric.
12. A left Euclidean and left unique relation is vacuously transitive, and so is a right Euclidean and right unique relation.
13. A left Euclidean relation is left quasi-reflexive. For left-unique relations, the converse also holds. Dually, each right Euclidean relation is right quasi-reflexive, and each right unique and right quasi-reflexive relation is right Euclidean.{{cite report | arxiv=1806.05036v2 | author=Jochen Burghardt | title=Simple Laws about Nonprominent Properties of Binary Relations | type=Technical Report | date=Nov 2018 }} Lemma 44-46.

{{reflist}}

Category:Properties of binary relations

Relation