Lemma 2.1.1 (Natural Ordering ≤) In any inverse semigroup (M, •, _ *), the following conditions are equivalent: (i) vu * = uu * (iii) u v = u (v) u * v = u * u (ii) uv * = uu * (iv) v u * = u (vi) v * u = u * u and each one implies any of the following (vii) uv * = vu * (viii) u * v = v * u The natural ordering ≤ on M is defined as u ≤ v if any of the equivalent conditions (i)-(vi) holds. This makes (M, ≤) a partial order, such that multiplication and inverse are monotonic. Proof. Clearly (i) and (ii) are equivalent, and (v) and (vi) are equivalent: apply _ * to both sides of the equations. We now show: * since u 0 ⌢ ⌣0 v 0 So u 0 u 1 ⌢ ⌣0 v 0 v 1. The result on ⌢ ⌣1 follows by taking inverses. ⊓ ⊔ The converse, that if uv * = vu * and u * v = v * u then u ⌢ ⌣ v, fails. In PI(N), take the identity for v, and u the bijection mapping 2n to 2n + 1 and 2n + 1 to 2n for each n. Then uv * = vu * , u * v = v * u, and all are equal to u = u * , but clearly u and v are not coherent. A very simple case of coherence is given in the following lemma. Lemma 2.1.10 Let M be an inverse semigroup with a zero element 0 for multiplication. If uv * = 0 then u ⌢ ⌣0 v; if u * v = 0 then u ⌢ ⌣1 v *. In particular, if uv * = u * v = 0, then u ⌢ ⌣ v. Proof. If uv * = 0, then by taking inverses vu * = 0 *. Now 0 * = 0 * 00 * = 0 since 0 is a zero, so vu * = 0 = uv * , whence u v * = uv * v = 0 = vu * u = v u * , so u ⌢ ⌣0 v. Similarly for ⌢ ⌣1. ⊓ ⊔ In later issues, we shall prove u ⌢ ⌣ v always by proving that u ≤ v, or that uv * = vu * = 0 as mentioned in Lemma 2.1.10. Lemma 2.1.11 Let M be an inverse semigroup. If u ⌢ ⌣0 v in M , then uv * = vu * is an idempotent; and u * v = v * u is an idempotent if u ⌢ ⌣1 v. Both equalities hold if u ⌢ ⌣ v.