This question is about the proof of Example 62 (d) on Page 27 of these notes. The statement is that there is no total order $\leq$ on $\mathbb{C}$ with the algebraic property $0\leq z_1\land0\leq z_2\Rightarrow0\leq z_1+z_2\land0\leq z_1z_2$.
The statement is wrong; Thomas Andrews's answer below shows that there is a total order on $\mathbb{C}$ such that $0\leq z_1\land0\leq > z_2\Rightarrow0\leq z_1+z_2\land0\leq z_1z_2$.
My attempt goes as follows:
- Any total order $\leq$ has the following properties:
- $\forall _{z_1\in \mathbb{C}}(z_1\leq z_1)$ (reflexive)
- $\forall _{z_1,z_2\in \mathbb{C}}\left(z_1\leq z_2\land z_2\leq z_1\Rightarrow z_1=z_2\right)$ (anti-symmetric)
- $\forall_{z_1,z_2,z_3\in \mathbb{C}}\left(z_1\leq z_2\land z_2\leq z_3\Rightarrow z_1\leq z_3\right)$ (transitive)
- $\forall _{z_1,z_2\in \mathbb{C}}\left(z_1\leq \ z_2\lor z_2\leq z_1\right)$ (total order)
- The question proposes a further algebraic property:
- $\forall _{z_1,z_2\in \mathbb{C}}\left(0\leq z_1\land \ 0\leq z_2\Rightarrow 0\leq z_1+z_2\land 0\leq z_1 z_2\right)$
- We need to prove that there is no relation with all five properties.
- The partial order $z_1\leq z_2\Leftrightarrow\left(z_1=z_2\lor\left|z_1\right|<\left| z_2\right|\right)$ has properties 1, 2, 3 and 5.
- Hence, the most straightforward possible proofs are $4\Rightarrow\neg 5$ or $5\Rightarrow\neg4$.
An attempt at $4\Rightarrow\neg 5$:
Either $0\leq i$ or $i\leq 0$ but not both as $i\neq 0$ (due to anti-symmetry).
If $0\leq i$, then using $z_1=z_2=i$ in property 5 gives $0\leq 2i$ and $0\leq -1$.
Using $z_1=2i$ and $z_2=-1$ in property 5 gives $0\leq -1+2i$ and $0\leq -2i$
Alternatively, using $z_1=z_2=-1$ in property 5 gives $0\leq -2$ and $0\leq 1$
In general, we generate $0\leq a+bi$ for various integer $a$ and $b$.
If $i\leq 0$, then property 5 gives no results.
Regardless of the initial $0\leq z$, property 5 only gives $0\leq P(z)$, where $P(z)$ are integer coefficient polynomials in $z$. How does this provide a contradiction? Furthermore, the $z\leq 0$ case seems entirely intractable.
An attempt at $5\Rightarrow\neg 4$:
- Any violation of 4 requires $\neg 0\leq z\land \neg z\leq 0$
- The contrapositive of 5 only generates $\neg 0\leq P(z)$ starting with $\neg 0\leq z$ and hence does not violate 4.
- Starting with $\neg z\leq 0$ ends with nothing further and thus does not negate 4.
It seems that the two most straightforward approaches are not going to work. I have no idea how to proceed with the more complicated options.
I can give you a total order like your $4,$ but extended. Write all non-zero complex numbers as $z=re^{i\theta}$ where $r>0$ and $0\leq \theta <2\pi.$ Then $z_1\leq z_2$ is defined to be true if $r_1<r_2$ or if $r_1=r_2$ and $\theta_1\leq \theta_2.$ Add that $0\leq z$ for all $z\in \mathbb C.$ This is then a total order, and since $0$ is the minimal element of the order, (2) is satisfied by default.
One condition you can add is that $z_1\leq z_2$ if and only if $0\leq z_2-z_1.$ This gives you translation invariance since it means $z_1\leq z_2$ if and only if $z_1+w\leq z_2+w.$