KNOWPIA
WELCOME TO KNOWPIA

Transitive binary relations | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||

indicates that the column's property is always true for 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 be transitive: for all if and then |

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 there is a so that (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).

A relation on a set is called ** connected** when for all
or, equivalently, when for all

A relation with the property that for all
is called ** strongly connected**.

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 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.

Let be a homogeneous relation. The following are equivalent:^{[14]}

- is strongly connected;
- ;
- ;
- is asymmetric,

where is the universal relation and is the converse relation of

The following are equivalent:^{[14]}

- is connected;
- ;
- ;
- is antisymmetric,

where is the complementary relation of the identity relation and is the converse relation of

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

- The
*edge*relation^{[note 1]}of a tournament graph is always a connected relation on the set of '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 cannot be antitransitive, provided has at least 4 elements.
^{[16]}On a 3-element set for example, the relation has both properties. - If is a connected relation on then all, or all but one, elements of are in the range of
^{[proof 2]}Similarly, all, or all but one, elements of are in the domain of

**^**Defined formally by if a graph edge leads from vertex to vertex

- Proofs

**^**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.