Connected relation

Transitive binary relations

	Symmetric	Antisymmetric	Connected	Well-founded	Has joins	Has meets	Reflexive	Irreflexive	Asymmetric
			Total, Semiconnex					Anti- reflexive
Equivalence relation	Y	✗	✗	✗	✗	✗	Y	✗	✗
Preorder (Quasiorder)	✗	✗	✗	✗	✗	✗	Y	✗	✗
Partial order	✗	Y	✗	✗	✗	✗	Y	✗	✗
Total preorder	✗	✗	Y	✗	✗	✗	Y	✗	✗
Total order	✗	Y	Y	✗	✗	✗	Y	✗	✗
Prewellordering	✗	✗	Y	Y	✗	✗	Y	✗	✗
Well-quasi-ordering	✗	✗	✗	Y	✗	✗	Y	✗	✗
Well-ordering	✗	Y	Y	Y	✗	✗	Y	✗	✗
Lattice	✗	Y	✗	✗	Y	Y	Y	✗	✗
Join-semilattice	✗	Y	✗	✗	Y	✗	Y	✗	✗
Meet-semilattice	✗	Y	✗	✗	✗	Y	Y	✗	✗
Strict partial order	✗	Y	✗	✗	✗	✗	✗	Y	Y
Strict weak order	✗	Y	✗	✗	✗	✗	✗	Y	Y
Strict total order	✗	Y	Y	✗	✗	✗	✗	Y	Y
	Symmetric	Antisymmetric	Connected	Well-founded	Has joins	Has meets	Reflexive	Irreflexive	Asymmetric
Definitions, for all $a,b$ and $S\neq \varnothing :$	${\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}$	${\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}$	${\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}$	${\begin{aligned}\min S\\{\text{exists}}\end{aligned}}$	${\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}$	${\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}$	$aRa$	${\text{not }}aRa$	${\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}$

indicates that the column's property is always true the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by

in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively.

All definitions tacitly require the homogeneous relation $R$ be transitive: for all $a,b,c,$ if $aRb$ and $bRc$ then $aRc.$
A term's definition may require additional properties that are not listed in this table.

In mathematics, a relation on a set is called connected or complete or total if it relates (or "compares") all distinct pairs of elements of the set in one direction or the other while it is called strongly connected if it relates all pairs of elements. As described in the terminology section below, the terminology for these properties is not uniform. This notion of "total" should not be confused with that of a total relation in the sense that for all $x\in X$ there is a $y\in X$ so that $x\mathrel {R} y$ (see serial relation).

Connectedness features prominently in the definition of total orders: a total (or linear) order is a partial order in which any two elements are comparable; that is, the order relation is connected. Similarly, a strict partial order that is connected is a strict total order. A relation is a total order if and only if it is both a partial order and strongly connected. A relation is a strict total order if, and only if, it is a strict partial order and just connected. A strict total order can never be strongly connected (except on an empty domain).

Formal definition

A relation $R$ on a set $X$ is called connected when for all $x,y\in X,$ ${\text{ if }}x\neq y{\text{ then }}x\mathrel {R} y\quad {\text{or}}\quad y\mathrel {R} x,$ or, equivalently, when for all $x,y\in X,$ $x\mathrel {R} y\quad {\text{or}}\quad y\mathrel {R} x\quad {\text{or}}\quad x=y.$

A relation with the property that for all $x,y\in X,$ $x\mathrel {R} y\quad {\text{or}}\quad y\mathrel {R} x$ is called strongly connected.^[1]^[2]^[3]

Terminology

The main use of the notion of connected relation is in the context of orders, where it is used to define total, or linear, orders. In this context, the property is often not specifically named. Rather, total orders are defined as partial orders in which any two elements are comparable.^[4]^[5] Thus, total is used more generally for relations that are connected or strongly connected.^[6] However, this notion of "total relation" must be distinguished from the property of being serial, which is also called total. Similarly, connected relations are sometimes called complete,^[7] although this, too, can lead to confusion: The universal relation is also called complete,^[8] and "complete" has several other meanings in order theory. Connected relations are also called connex^[9]^[10] or said to satisfy trichotomy^[11] (although the more common definition of trichotomy is stronger in that exactly one of the three options $x\mathrel {R} y,y\mathrel {R} x,x=y$ must hold).

When the relations considered are not orders, being connected and being strongly connected are importantly different properties. Sources which define both then use pairs of terms such as weakly connected and connected,^[12] complete and strongly complete,^[13] total and complete,^[6] semiconnex and connex,^[14] or connex and strictly connex,^[15] respectively, as alternative names for the notions of connected and strongly connected as defined above.

Characterizations

Let $R$ be a homogeneous relation. The following are equivalent:^[14]

$R$ is strongly connected;
$U\subseteq R\cup R^{\top }$ ;
${\overline {R}}\subseteq R^{\top }$ ;
${\overline {R}}$ is asymmetric,

where $U$ is the universal relation and $R^{\top }$ is the converse relation of $R.$

The following are equivalent:^[14]

$R$ is connected;
${\overline {I}}\subseteq R\cup R^{\top }$ ;
${\overline {R}}\subseteq R^{\top }\cup I$ ;
${\overline {R}}$ is antisymmetric,

where ${\overline {I}}$ is the complementary relation of the identity relation $I$ and $R^{\top }$ is the converse relation of $R.$

Introducing progressions, Russell invoked the axiom of connection:

Whenever a series is originally given by a transitive asymmetrical relation, we can express connection by the condition that any two terms of our series are to have the generating relation.
— Bertrand Russell, The Principles of Mathematics, page 239

Properties

The edge relation^{[note 1]} $E$ of a tournament graph $G$ is always a connected relation on the set of $G$ 's vertices.
If a strongly connected relation is symmetric, it is the universal relation.
A relation is strongly connected if, and only if, it is connected and reflexive.^{[proof 1]}
A connected relation on a set $X$ cannot be antitransitive, provided $X$ has at least 4 elements.^[16] On a 3-element set $\{a,b,c\},$ for example, the relation $\{(a,b),(b,c),(c,a)\}$ has both properties.
If $R$ is a connected relation on $X,$ then all, or all but one, elements of $X$ are in the range of $R.$ ^{[proof 2]} Similarly, all, or all but one, elements of $X$ are in the domain of $R.$

Notes

^ Defined formally by $vEw$ if a graph edge leads from vertex $v$ to vertex $w$

Proofs

^ For the only if direction, both properties follow trivially. — For the if direction: when $x\neq y,$ then $x\mathrel {R} y\lor y\mathrel {R} x$ follows from connectedness; when $x=y,$ $x\mathrel {R} y$ follows from reflexivity.
^ If $x,y\in X\setminus \operatorname {ran} (R),$ then $x\mathrel {R} y$ and $y\mathrel {R} x$ are impossible, so $x=y$ follows from connectedness.

References

^ Clapham, Christopher; Nicholson, James (2014-09-18). "connected". The Concise Oxford Dictionary of Mathematics. Oxford University Press. ISBN 978-0-19-967959-1. Retrieved 2021-04-12.
^ Nievergelt, Yves (2015-10-13). Logic, Mathematics, and Computer Science: Modern Foundations with Practical Applications. Springer. p. 182. ISBN 978-1-4939-3223-8.
^ Causey, Robert L. (1994). Logic, Sets, and Recursion. Jones & Bartlett Learning. ISBN 0-86720-463-X., p. 135
^ Paul R. Halmos (1968). Naive Set Theory. Princeton: Nostrand. Here: Ch.14. Halmos gives the names of reflexivity, anti-symmetry, and transitivity, but not of connectedness.
^ Patrick Cousot (1990). "Methods and Logics for Proving Programs". In Jan van Leeuwen (ed.). Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 841–993. ISBN 0-444-88074-7. Here: Sect.6.3, p.878
^ ^a ^b Aliprantis, Charalambos D.; Border, Kim C. (2007-05-02). Infinite Dimensional Analysis: A Hitchhiker's Guide. Springer. ISBN 978-3-540-32696-0., p. 6
^ Makinson, David (2012-02-27). Sets, Logic and Maths for Computing. Springer. ISBN 978-1-4471-2500-6., p. 50
^ Whitehead, Alfred North; Russell, Bertrand (1910). Principia Mathematica. Cambridge: Cambridge University Press.{{cite book}}: CS1 maint: date and year (link)
^ Wall, Robert E. (1974). Introduction to Mathematical Linguistics. Prentice-Hall. page 114.
^ Carl Pollard. "Relations and Functions" (PDF). Ohio State University. Retrieved 2018-05-28. Page 7.
^ Kunen, Kenneth (2009). The Foundations of Mathematics. College Publications. ISBN 978-1-904987-14-7. p. 24
^ Fishburn, Peter C. (2015-03-08). The Theory of Social Choice. Princeton University Press. p. 72. ISBN 978-1-4008-6833-9.
^ Roberts, Fred S. (2009-03-12). Measurement Theory: Volume 7: With Applications to Decisionmaking, Utility, and the Social Sciences. Cambridge University Press. ISBN 978-0-521-10243-8. page 29
^ ^a ^b ^c Schmidt, Gunther; Ströhlein, Thomas (1993). Relations and Graphs: Discrete Mathematics for Computer Scientists. Berlin: Springer. ISBN 978-3-642-77970-1.
^ Ganter, Bernhard; Wille, Rudolf (2012-12-06). Formal Concept Analysis: Mathematical Foundations. Springer Science & Business Media. ISBN 978-3-642-59830-2. p. 86
^ Jochen Burghardt (Jun 2018). Simple Laws about Nonprominent Properties of Binary Relations (Technical Report). arXiv:1806.05036. Bibcode:2018arXiv180605036B. Lemma 8.2, p.8.

[16] Defined formally by $vEw$ if a graph edge leads from vertex $v$ to vertex $w$

[17] For the only if direction, both properties follow trivially. — For the if direction: when $x\neq y,$ then $x\mathrel {R} y\lor y\mathrel {R} x$ follows from connectedness; when $x=y,$ $x\mathrel {R} y$ follows from reflexivity.

[19] If $x,y\in X\setminus \operatorname {ran} (R),$ then $x\mathrel {R} y$ and $y\mathrel {R} x$ are impossible, so $x=y$ follows from connectedness.

[1] Clapham, Christopher; Nicholson, James (2014-09-18). "connected". The Concise Oxford Dictionary of Mathematics. Oxford University Press. ISBN 978-0-19-967959-1. Retrieved 2021-04-12.

[2] Nievergelt, Yves (2015-10-13). Logic, Mathematics, and Computer Science: Modern Foundations with Practical Applications. Springer. p. 182. ISBN 978-1-4939-3223-8.

[3] Causey, Robert L. (1994). Logic, Sets, and Recursion. Jones & Bartlett Learning. ISBN 0-86720-463-X., p. 135

[4] Paul R. Halmos (1968). Naive Set Theory. Princeton: Nostrand. Here: Ch.14. Halmos gives the names of reflexivity, anti-symmetry, and transitivity, but not of connectedness.

[5] Patrick Cousot (1990). "Methods and Logics for Proving Programs". In Jan van Leeuwen (ed.). Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 841–993. ISBN 0-444-88074-7. Here: Sect.6.3, p.878

[Aliprantis-6] Aliprantis, Charalambos D.; Border, Kim C. (2007-05-02). Infinite Dimensional Analysis: A Hitchhiker's Guide. Springer. ISBN 978-3-540-32696-0., p. 6

[7] Makinson, David (2012-02-27). Sets, Logic and Maths for Computing. Springer. ISBN 978-1-4471-2500-6., p. 50

[8] Whitehead, Alfred North; Russell, Bertrand (1910). Principia Mathematica. Cambridge: Cambridge University Press.{{cite book}}: CS1 maint: date and year (link)

[9] Wall, Robert E. (1974). Introduction to Mathematical Linguistics. Prentice-Hall. page 114.

[10] Carl Pollard. "Relations and Functions" (PDF). Ohio State University. Retrieved 2018-05-28. Page 7.

[11] Kunen, Kenneth (2009). The Foundations of Mathematics. College Publications. ISBN 978-1-904987-14-7. p. 24

[12] Fishburn, Peter C. (2015-03-08). The Theory of Social Choice. Princeton University Press. p. 72. ISBN 978-1-4008-6833-9.

[13] Roberts, Fred S. (2009-03-12). Measurement Theory: Volume 7: With Applications to Decisionmaking, Utility, and the Social Sciences. Cambridge University Press. ISBN 978-0-521-10243-8. page 29

[Schmidt-14] Schmidt, Gunther; Ströhlein, Thomas (1993). Relations and Graphs: Discrete Mathematics for Computer Scientists. Berlin: Springer. ISBN 978-3-642-77970-1.

[15] Ganter, Bernhard; Wille, Rudolf (2012-12-06). Formal Concept Analysis: Mathematical Foundations. Springer Science & Business Media. ISBN 978-3-642-59830-2. p. 86

[18] Jochen Burghardt (Jun 2018). Simple Laws about Nonprominent Properties of Binary Relations (Technical Report). arXiv:1806.05036. Bibcode:2018arXiv180605036B. Lemma 8.2, p.8.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[note 1]

[proof 1]

[16]

[proof 2]

v t e Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types (list)	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially ordered group Positive cone of a partially ordered group Upper set Young's lattice