Total relation

In mathematics, a binary relation R ⊆ X×Y between two sets X and Y is total (or left total) if the source set X equals the domain {x : there is a y with xRy }. Conversely, R is called right total if Y equals the range {y : there is an x with xRy }.

When f: X → Y is a function, the domain of f is all of X, hence f is a total relation. On the other hand, if f is a partial function, then the domain may be a proper subset of X, in which case f is not a total relation.

"A binary relation is said to be total with respect to a universe of discourse just in case everything in that universe of discourse stands in that relation to something else."^[1]

Algebraic characterization[edit]

Total relations can be characterized algebraically by equalities and inequalities involving compositions of relations. To this end, let $X,Y$ be two sets, and let $R\subseteq X\times Y.$ For any two sets $A,B,$ let $L_{A,B}=A\times B$ be the universal relation between $A$ and $B,$ and let $I_{A}=\{(a,a):a\in A\}$ be the identity relation on $A.$ We use the notation $R^{\top }$ for the converse relation of $R.$

$R$ is total iff for any set $W$ and any $S\subseteq W\times X,$ $S\neq \emptyset$ implies $SR\neq \emptyset .$ ^[2]^: 54
$R$ is total iff $I_{X}\subseteq RR^{\top }.$ ^[2]^: 54
If $R$ is total, then $L_{X,Y}=RL_{Y,Y}.$ The converse is true if $Y\neq \emptyset .$ ^{[note 1]}
If $R$ is total, then ${\overline {RL_{Y,Y}}}=\emptyset .$ The converse is true if $Y\neq \emptyset .$ ^{[note 2]}^[2]^: 63
If $R$ is total, then ${\overline {R}}\subseteq R{\overline {I_{Y}}}.$ The converse is true if $Y\neq \emptyset .$ ^[2]^: 54^[3]
More generally, if $R$ is total, then for any set $Z$ and any $S\subseteq Y\times Z,$ ${\overline {RS}}\subseteq R{\overline {S}}.$ The converse is true if $Y\neq \emptyset .$ ^{[note 3]}^[2]^: 57

Notes[edit]

^ If $Y=\emptyset \neq X,$ then $R$ will be not total.
^ Observe ${\overline {RL_{Y,Y}}}=\emptyset \Leftrightarrow RL_{Y,Y}=L_{X,Y},$ and apply the previous bullet.
^ Take $Z=Y,S=I_{Y}$ and appeal to the previous bullet.

References[edit]

^ Functions from Carnegie Mellon University
^ ^a ^b ^c ^d ^e Schmidt, Gunther; Ströhlein, Thomas (6 December 2012). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. ISBN 978-3-642-77968-8.
^ Gunther Schmidt (2011). Relational Mathematics. Cambridge University Press. doi:10.1017/CBO9780511778810. ISBN 9780511778810. Definition 5.8, page 57.

Gunther Schmidt & Michael Winter (2018) Relational Topology
C. Brink, W. Kahl, and G. Schmidt (1997) Relational Methods in Computer Science, Advances in Computer Science, page 5, ISBN 3-211-82971-7
Gunther Schmidt & Thomas Strohlein (2012)[1987] Relations and Graphs, p. 54, at Google Books
Gunther Schmidt (2011) Relational Mathematics, p. 57, at Google Books

[3] If $Y=\emptyset \neq X,$ then $R$ will be not total.

[4] Observe ${\overline {RL_{Y,Y}}}=\emptyset \Leftrightarrow RL_{Y,Y}=L_{X,Y},$ and apply the previous bullet.

[6] Take $Z=Y,S=I_{Y}$ and appeal to the previous bullet.

[1] Functions from Carnegie Mellon University

[R&G-2] Schmidt, Gunther; Ströhlein, Thomas (6 December 2012). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Science & Business Media. ISBN 978-3-642-77968-8.

[GS11-5] Gunther Schmidt (2011). Relational Mathematics. Cambridge University Press. doi:10.1017/CBO9780511778810. ISBN 9780511778810. Definition 5.8, page 57.

[1]

[2]

[note 1]

[note 2]

[3]

[note 3]

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

Algebraic characterization[edit]

See also[edit]

Notes[edit]

References[edit]