nLab
entire relation

A binary relation from a set $X$ to a set $Y$ is called entire if every element of $X$ is related to at least one element of $Y$. This includes most examples of what the pre-Bourbaki literature calls a (total) multi-valued function (although that term usually implied some continuity or analyticity properties as well). An entire relation is sometimes called total, although that has another meaning in the theory of partial orders; see total relation.

A function is precisely a relation that is both entire and functional.

Like any relation, an entire relation $r$ can be viewed as a span

$$\begin{array}{ccc}& & {\Gamma }_r\\ & {\swarrow }_{{\pi }_r}& & {\searrow }^{{\varphi }_r}\\ X& & & & Y\end{array}$$\array { & & \Gamma_r \\ & \swarrow_{\pi_r} & & \searrow^{\phi_r} \\ X & & & & Y }

Such a span is a relation iff the pairing map from the graph ${\Gamma }_r$ to $X\times Y$ is an injection, and such a relation is entire iff the projection map ${\pi }_r$ is a surjection.

The axiom of choice says precisely that every entire relation contains a function. Failing that, the COSHEP axiom may be interpreted to say that, given $X$, there is a single surjection ${\pi }_X:{\Gamma }_X\to X$ such that every entire relation from $X$ contains a relation given by a span whose left leg is ${\pi }_X$. In any case, entire relations may be preferable to functions in some contexts where the axiom of choice fails.

When internalising entire relations to a site, one may want to replace the projection map ${\pi }_r:{\Gamma }_r\to X$ by a covering family.