Connected relation
Property of a relation on a set
- 3 min read
- 3 chapters
Related on Lably
Through Homogeneous relation and If and only if
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).
Some authors do however use the term connected with a much looser meaning, which applies to precisely those orders whose comparability graphs are connected graphs. This applies, for instance, to fences, of which none of the nontrivial examples are total orders.
Formal definition
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.
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. Thus, total is used more generally for relations that are connected or strongly connected. 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, although this, too, can lead to confusion: The universal relation is also called complete, and "complete" has several other meanings in order theory. Connected relations are also called connex or said to satisfy trichotomy (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, complete and strongly complete, total and complete, semiconnex and connex, or connex and strictly connex, respectively, as alternative names for the notions of connected and strongly connected as defined above.
Sign in to keep reading
2 more chapters are free with a Lably account.
Characterizations
Let be a homogeneous relation. The following are equivalent:
- is strongly connected;
- ;
- ;
- is asymmetric,
where is the universal relation and is the converse relation of
The following are equivalent:
- is connected;
- ;
- ;
- is antisymmetric,
where is the complementary relation of , is 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
Properties
- The edge relation 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.
- A connected relation on a set cannot be antitransitive, provided has at least 4 elements. 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 Similarly, all, or all but one, elements of are in the domain of

