We can define a binary relation on the complex numbers as follows.
- $z \leq z'$ iff there exists $x \in [0,\infty)$ with $z+x=z'.$
Equivalently,
- $z \leq z'$ iff $\mathrm{Re}(z) \leq \mathrm{Re}(z')$ and $\mathrm{Im}(z) = \mathrm{Im}(z')$.
It is straightforward to show that $\leq$ is a partial order on $\mathbb{C}$, extending the usual (total) order on $\mathbb{R},$ and that the following holds for all $z,z' \in \mathbb{C}.$
If $z \leq z',$ then:
- Given $w \in \mathbb{C}$, we have $w+z \leq w+z'$.
- Given $r \in [0,\infty)$, we have $rz \leq rz'.$
- $-z' \leq -z$.
- $\bar{z} \leq \bar{z'}$
Despite these formulae, I find it hard to believe that the relation $\leq$ could actually be useful. There just aren't enough points comparable to each other.
Conjecture. The partial order $\leq$ on $\mathbb{C}$ lacks a (non-trivial) use or application.
Question. Does anyone know of a counterexample to this "conjecture"?