Homogeneous relation: Difference between revisions

Content deleted Content added

Inline

Revision as of 13:33, 12 June 2021

In mathematics, a homogeneous relation (also called endorelation) over a set X is a binary relation over X and itself, i.e. it is a subset of the Cartesian product $X \times X$ .^[1]^[2]^[3] It is also simply called a (binary) relation over X. An example of a homogeneous relation is the relation of kinship, where the relation is over people.

A homogeneous relation R over a set X may be identified with a directed simple graph permitting loops, or if it is symmetric, with an undirected simple graph permitting loops, where X is the vertex set and R is the edge set (there is an edge from a vertex x to a vertex y if and only if $xRy$ ). It is called the adjacency relation of the graph.

The set of all homogeneous relations ${\mathcal {B}}(X)$ over a set X is the set $2 X \times X$ which is a Boolean algebra augmented with the involution of mapping of a relation to its converse relation. Considering composition of relations as a binary operation on ${\mathcal {B}}(X)$ , it forms a semigroup with involution.

Particular homogeneous relations

Some important particular homogeneous relations over a set X are:

the empty relation $E = \emptyset \subseteq X \times X$ ;
the universal relation $U = X \times X$ ;
the identity relation $I = {(x, x) | x \in X}$ .

For arbitrary elements x and y of X:

$xEy$ holds never;
$xUy$ holds always;
$xIy$ holds if and only if $x = y$ .

Properties

Some important properties that a homogeneous relation $R$ over a set $X$ may have are:

Reflexive: for all $x \in X$ , $xRx$ . For example, ≥ is a reflexive relation but > is not.
Irreflexive (or strict): for all $x \in X$ , not $xRx$ . For example, > is an irreflexive relation, but ≥ is not.
Coreflexive: for all $x, y \in X$ , if $xRy$ then $x = y$ .^[4] For example, the relation over the integers in which each odd number is related to itself is a coreflexive relation. The equality relation is the only example of a both reflexive and coreflexive relation, and any coreflexive relation is a subset of the identity relation.
Left quasi-reflexive: for all $x, y \in X$ , if $xRy$ then $xRx$ .
Right quasi-reflexive: for all $x, y \in X$ , if $xRy$ then $yRy$ .
Quasi-reflexive: for all $x, y \in X$ , if $xRy$ then $xRx$ and $yRy$ . A relation is quasi-reflexive if, and only if, it is both left and right quasi-reflexive.

The previous 6 alternatives are far from being exhaustive; e.g., the red binary relation $y = x 2$ given in the section Special types of binary relations is neither irreflexive, nor coreflexive, nor reflexive, since it contains the pair $(0, 0)$ , and $(2, 4)$ , but not $(2, 2)$ , respectively. The latter two facts also rule out (any kind of) quasi-reflexivity.

Symmetric: for all $x, y \in X$ , if $xRy$ then $yRx$ . For example, "is a blood relative of" is a symmetric relation, because $x$ is a blood relative of $y$ if and only if $y$ is a blood relative of $x$ .
Antisymmetric: for all $x, y \in X$ , if $xRy$ and $yRx$ then $x = y$ . For example, ≥ is an antisymmetric relation; so is >, but vacuously (the condition in the definition is always false).^[5]
Asymmetric: for all $x, y \in X$ , if $xRy$ then not $yRx$ . A relation is asymmetric if and only if it is both antisymmetric and irreflexive.^[6] For example, > is an asymmetric relation, but ≥ is not.

Again, the previous 3 alternatives are far from being exhaustive; as an example over the natural numbers, the relation $xRy$ defined by $x > 2$ is neither symmetric nor antisymmetric, let alone asymmetric.

Transitive: for all $x, y, z \in X$ , if $xRy$ and $yRz$ then $xRz$ . A transitive relation is irreflexive if and only if it is asymmetric.^[7] For example, "is ancestor of" is a transitive relation, while "is parent of" is not.
Antitransitive: for all $x, y, z \in X$ , if $xRy$ and $yRz$ then never $xRz$ .
Co-transitive: if the complement of R is transitive. That is, for all $x, y, z \in X$ , if $xRz$ , then $xRy$ or $yRz$ . This is used in pseudo-orders in constructive mathematics.
Quasitransitive: for all $x, y, z \in X$ , if $xRy$ and $yRz$ but neither $yRx$ nor $zRy$ , then $xRz$ but not $zRx$ .
Transitivity of incomparability: for all $x, y, z \in X$ , if $x$ and $y$ are incomparable with respect to $R$ and if the same is true of $y$ and $z$ , then $x$ and $z$ are also incomparable with respect to $R$ . This is used in weak orderings.

Again, the previous 5 alternatives are not exhaustive. For example, the relation $xRy$ if ( $y = 0$ or $y = x +1$ ) satisfies none of these properties. On the other hand, the empty relation trivially satisfies all of them.

Dense: for all $x, y \in X$ such that $xRy$ , there exists some $z \in X$ such that $xRz$ and $zRy$ . This is used in dense orders.
Connected: for all $x, y \in X$ , if $x \neq y$ then $xRy$ or $yRx$ . This property is sometimes called "total", which is distinct from the definitions of "total" given in the section Special types of binary relations.
Strongly connected: for all $x, y \in X$ , $xRy$ or $yRx$ . This property is sometimes called "total", which is distinct from the definitions of "total" given in the section Special types of binary relations.
Trichotomous: for all $x, y \in X$ , exactly one of $xRy$ , $yRx$ or $x = y$ holds. For example, > is a trichotomous relation, while the relation "divides" over the natural numbers is not.^[8]
Right Euclidean (or just Euclidean): for all $x, y, z \in X$ , if $xRy$ and $xRz$ then $yRz$ . For example, = is a Euclidean relation because if $x = y$ and $x = z$ then $y = z$ .
Left Euclidean: for all $x, y, z \in X$ , if $yRx$ and $zRx$ then $yRz$ .
Serial (or left-total): for all $x \in X$ , there exists some $y \in X$ such that $xRy$ . For example, > is a serial relation over the integers. But it is not a serial relation over the positive integers, because there is no $y$ in the positive integers such that $1 > y$ .^[9] However, < is a serial relation over the positive integers, the rational numbers and the real numbers. Every reflexive relation is serial: for a given $x$ , choose $y = x$ .
Set-like^{[citation needed]} (or local): ^{[citation needed]} for all $x \in X$ , the class of all $y$ such that $yRx$ is a set. (This makes sense only if relations over proper classes are allowed.) For example, the usual ordering < over the class of ordinal numbers is a set-like relation, while its inverse > is not.
Well-founded: every nonempty subset $S$ of $X$ contains a minimal element with respect to $R$ . Well-foundedness implies the descending chain condition (that is, no infinite chain ... $x n R ... Rx 3 Rx 2 Rx 1$ can exist). If the axiom of dependent choice is assumed, both conditions are equivalent.^[10]^[11]

A preorder is a relation that is reflexive and transitive. A total preorder, also called linear preorder or weak order, is a relation that is reflexive, transitive, and connected.

A partial order, also called order,^{[citation needed]} is a relation that is reflexive, antisymmetric, and transitive. A strict partial order, also called strict order,^{[citation needed]} is a relation that is irreflexive, antisymmetric, and transitive. A total order, also called linear order, simple order, or chain, is a relation that is reflexive, antisymmetric, transitive and connected.^[12] A strict total order, also called strict linear order, strict simple order, or strict chain, is a relation that is irreflexive, antisymmetric, transitive and connected.

A partial equivalence relation is a relation that is symmetric and transitive. An equivalence relation is a relation that is reflexive, symmetric, and transitive. It is also a relation that is symmetric, transitive, and serial, since these properties imply reflexivity.

Implications and conflicts between properties of homogeneous binary relations
Implications (blue) and conflicts (red) between properties (yellow) of homogeneous binary relations. For example, every asymmetric relation is irreflexive ("ASym ⇒ Irrefl"), and no relation on a non-empty set can be both irreflexive and reflexive ("Irrefl # Refl"). Omitting the red edges results in a Hasse diagram.

Operations

If R is a homogeneous relation over a set X then each of the following is a homogeneous relation over X:

Reflexive closure: R⁼, defined as $R = = {(x, x) | x \in X} \cup R$ or the smallest reflexive relation over X containing R. This can be proven to be equal to the intersection of all reflexive relations containing R.
Reflexive reduction: R^≠, defined as $R≠ = R \ {(x, x) | x ∈ X}$ or the largest irreflexive relation over X contained in R.
Transitive closure: R⁺, defined as the smallest transitive relation over X containing R. This can be seen to be equal to the intersection of all transitive relations containing R.
Reflexive transitive closure: R*, defined as $R * = (R +) =$ , the smallest preorder containing R.
Reflexive transitive symmetric closure: R^≡, defined as the smallest equivalence relation over X containing R.

All operations defined in the section Operations on binary relations also apply to homogeneous relations.

Homogeneous relations by property
	Reflexivity	Symmetry	Transitivity	Connectedness	Symbol	Example
Directed graph					→
Undirected graph		Symmetric
Dependency	Reflexive	Symmetric
Tournament	Irreflexive	Antisymmetric				Pecking order
Preorder	Reflexive		Yes		≤	Preference
Total preorder	Reflexive		Yes	Yes	≤
Partial order	Reflexive	Antisymmetric	Yes		≤	Subset
Strict partial order	Irreflexive	Antisymmetric	Yes		<	Strict subset
Total order	Reflexive	Antisymmetric	Yes	Yes	≤	Alphabetical order
Strict total order	Irreflexive	Antisymmetric	Yes	Yes	<	Strict alphabetical order
Partial equivalence relation		Symmetric	Yes
Equivalence relation	Reflexive	Symmetric	Yes		∼, ≡	Equality

Enumeration

The number of distinct homogeneous relations over an n-element set is $2 n 2$ (sequence A002416 in the OEIS):

Number of n-element binary relations of different types
Elements	Any	Transitive	Reflexive	Symmetric	Preorder	Partial order	Total preorder	Total order	Equivalence relation
0	1	1	1	1	1	1	1	1	1
1	2	2	1	2	1	1	1	1	1
2	16	13	4	8	4	3	3	2	2
3	512	171	64	64	29	19	13	6	5
4	65,536	3,994	4,096	1,024	355	219	75	24	15
n	2^n²		2ⁿ⁽ⁿ⁻¹⁾	2^n(n+1)/2			∑ⁿ _k=0 k!S(n, k)	n!	∑ⁿ _k=0 S(n, k)
OEIS	A002416	A006905	A053763	A006125	A000798	A001035	A000670	A000142	A000110

Note that S(n, k) refers to Stirling numbers of the second kind.

Notes:

The number of irreflexive relations is the same as that of reflexive relations.
The number of strict partial orders (irreflexive transitive relations) is the same as that of partial orders.
The number of strict weak orders is the same as that of total preorders.
The total orders are the partial orders that are also total preorders. The number of preorders that are neither a partial order nor a total preorder is, therefore, the number of preorders, minus the number of partial orders, minus the number of total preorders, plus the number of total orders: 0, 0, 0, 3, and 85, respectively.
The number of equivalence relations is the number of partitions, which is the Bell number.

The homogeneous relations can be grouped into pairs (relation, complement), except that for $n = 0$ the relation is its own complement. The non-symmetric ones can be grouped into quadruples (relation, complement, inverse, inverse complement).

Examples

Order relations, including strict orders:
- Greater than
- Greater than or equal to
- Less than
- Less than or equal to
- Divides (evenly)
- Subset of
Equivalence relations:
- Equality
- Parallel with (for affine spaces)
- Is in bijection with
- Isomorphic
Tolerance relation, a reflexive and symmetric relation:
- Dependency relation, a finite tolerance relation
- Independency relation, the complement of some dependency relation
Kinship relations

References

^ Michael Winter (2007). Goguen Categories: A Categorical Approach to L-fuzzy Relations. Springer. pp. x–xi. ISBN 978-1-4020-6164-6.
^ M. E. Müller (2012). Relational Knowledge Discovery. Cambridge University Press. p. 22. ISBN 978-0-521-19021-3.
^ Peter J. Pahl; Rudolf Damrath (2001). Mathematical Foundations of Computational Engineering: A Handbook. Springer Science & Business Media. p. 496. ISBN 978-3-540-67995-0.
^ Fonseca de Oliveira, J. N., & Pereira Cunha Rodrigues, C. D. J. (2004). Transposing Relations: From Maybe Functions to Hash Tables. In Mathematics of Program Construction (p. 337).
^ Smith, Douglas; Eggen, Maurice; St. Andre, Richard (2006), A Transition to Advanced Mathematics (6th ed.), Brooks/Cole, p. 160, ISBN 0-534-39900-2
^ Nievergelt, Yves (2002), Foundations of Logic and Mathematics: Applications to Computer Science and Cryptography, Springer-Verlag, p. 158.
^ Flaška, V.; Ježek, J.; Kepka, T.; Kortelainen, J. (2007). Transitive Closures of Binary Relations I (PDF). Prague: School of Mathematics – Physics Charles University. p. 1. Archived from the original (PDF) on 2013-11-02. Lemma 1.1 (iv). This source refers to asymmetric relations as "strictly antisymmetric".
^ Since neither 5 divides 3, nor 3 divides 5, nor 3=5.
^ Yao, Y.Y.; Wong, S.K.M. (1995). "Generalization of rough sets using relationships between attribute values" (PDF). Proceedings of the 2nd Annual Joint Conference on Information Sciences: 30–33..
^ "Condition for Well-Foundedness". ProofWiki. Archived from the original on 20 February 2019. Retrieved 20 February 2019.
^ Fraisse, R. (15 December 2000). Theory of Relations, Volume 145 - 1st Edition (1st ed.). Elsevier. p. 46. ISBN 9780444505422. Retrieved 20 February 2019.
^ Joseph G. Rosenstein, Linear orderings, Academic Press, 1982, ISBN 0-12-597680-1, p. 4

[Winter2007-1] Michael Winter (2007). Goguen Categories: A Categorical Approach to L-fuzzy Relations. Springer. pp. x–xi. ISBN 978-1-4020-6164-6.

[Müller2012-2] M. E. Müller (2012). Relational Knowledge Discovery. Cambridge University Press. p. 22. ISBN 978-0-521-19021-3.

[PahlDamrath2001-p496-3] Peter J. Pahl; Rudolf Damrath (2001). Mathematical Foundations of Computational Engineering: A Handbook. Springer Science & Business Media. p. 496. ISBN 978-3-540-67995-0.

[4] Fonseca de Oliveira, J. N., & Pereira Cunha Rodrigues, C. D. J. (2004). Transposing Relations: From Maybe Functions to Hash Tables. In Mathematics of Program Construction (p. 337).

[5] Smith, Douglas; Eggen, Maurice; St. Andre, Richard (2006), A Transition to Advanced Mathematics (6th ed.), Brooks/Cole, p. 160, ISBN 0-534-39900-2

[6] Nievergelt, Yves (2002), Foundations of Logic and Mathematics: Applications to Computer Science and Cryptography, Springer-Verlag, p. 158.

[7] Flaška, V.; Ježek, J.; Kepka, T.; Kortelainen, J. (2007). Transitive Closures of Binary Relations I (PDF). Prague: School of Mathematics – Physics Charles University. p. 1. Archived from the original (PDF) on 2013-11-02. Lemma 1.1 (iv). This source refers to asymmetric relations as "strictly antisymmetric".

[8] Since neither 5 divides 3, nor 3 divides 5, nor 3=5.

[9] Yao, Y.Y.; Wong, S.K.M. (1995). "Generalization of rough sets using relationships between attribute values" (PDF). Proceedings of the 2nd Annual Joint Conference on Information Sciences: 30–33..

[10] "Condition for Well-Foundedness". ProofWiki. Archived from the original on 20 February 2019. Retrieved 20 February 2019.

[11] Fraisse, R. (15 December 2000). Theory of Relations, Volume 145 - 1st Edition (1st ed.). Elsevier. p. 46. ISBN 9780444505422. Retrieved 20 February 2019.

[12] Joseph G. Rosenstein, Linear orderings, Academic Press, 1982, ISBN 0-12-597680-1, p. 4

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

@@ Line 1: / Line 1: @@
 {{under construction}}
-In [[mathematics]], a '''homogeneous relation'''<!---keep boldface: [[Homogeneous relation]] redirects to here---> (also called '''endorelation'''<!---[[endorelation]]--->) over a set ''X'' is a binary relation over ''X'' and itself, i.e. it is a subset of the Cartesian product {{math|''X'' × ''X''}}.<ref name="Winter2007"/><ref name="Müller2012">{{cite book|author=M. E. Müller|title=Relational Knowledge Discovery|year=2012|publisher=Cambridge University Press|isbn=978-0-521-19021-3|page=22}}</ref><ref name="PahlDamrath2001-p496">{{cite book|author1=Peter J. Pahl|author2=Rudolf Damrath|title=Mathematical Foundations of Computational Engineering: A Handbook|year=2001|publisher=Springer Science & Business Media|isbn=978-3-540-67995-0|page=496}}</ref> It is also simply called a (binary) relation over ''X''. An example of a homogeneous relation is the relation of [[kinship]], where the relation is over people.
+In [[mathematics]], a '''homogeneous relation'''<!---keep boldface: [[Homogeneous relation]] redirects to here---> (also called '''endorelation'''<!---[[endorelation]]--->) over a set ''X'' is a binary relation over ''X'' and itself, i.e. it is a subset of the Cartesian product {{math|''X'' × ''X''}}.<ref name="Winter2007">{{cite book|author=Michael Winter|title=Goguen Categories: A Categorical Approach to L-fuzzy Relations|year=2007|publisher=Springer|isbn=978-1-4020-6164-6|pages=x-xi}}</ref><ref name="Müller2012">{{cite book|author=M. E. Müller|title=Relational Knowledge Discovery|year=2012|publisher=Cambridge University Press|isbn=978-0-521-19021-3|page=22}}</ref><ref name="PahlDamrath2001-p496">{{cite book|author1=Peter J. Pahl|author2=Rudolf Damrath|title=Mathematical Foundations of Computational Engineering: A Handbook|year=2001|publisher=Springer Science & Business Media|isbn=978-3-540-67995-0|page=496}}</ref> It is also simply called a (binary) relation over ''X''. An example of a homogeneous relation is the relation of [[kinship]], where the relation is over people.
 A homogeneous relation ''R'' over a set ''X'' may be identified with a [[Graph theory#Directed graph|directed simple graph permitting loops]], or if it is [[Symmetric relation|symmetric]], with an [[Graph theory#Graph|undirected simple graph permitting loops]], where ''X'' is the vertex set and ''R'' is the edge set (there is an edge from a vertex ''x'' to a vertex ''y'' if and only if {{math|''xRy''}}). It is called the ''adjacency relation'' of the graph.