I was just doing some fun reading, and I stumbled upon the following:
A total function $f: X \mapsto Y$ is a binary relation on $X \times Y$ that satisfies the following two properties:
- $\forall x \in X$, there is a $y \in Y$ such that $[x, y] \in f$
- if $[x, y_1] \in f$ and $[x,y_2] \in f$, then $y_1 = y_2$
That's all nice and dandy, however, the text then goes on to state
A relation on $\mathbb{N} \times \mathbb{N}$ representing greater than fails to satisfy either of the conditions.
I understand why it fails the second condition, but why does it fail the first condition? Isn't it a similar idea to $f: X \mapsto X : x \mapsto x+1$, which would pass the first condition. In other words, isn't there alwasy a number in $\mathbb{N}$ that is greater than the current one?
Cheers!