OrderedSemigroups

2 Semigroups

We follow the paper “On ordered semigroups” by N. G. Alimov.

We show that if a a linear ordered cancel semigroup does not have anomalous pairs, then there exists a larger Archimedean group containing it. Then from Holder’s theorem for groups, that larger group is isomorphic to a subgroup of \(\mathbb {R}\) and so the smaller semigroup is isomorphic to a subsemigroup of \(\mathbb {R}\).

2.1 Definitions

Definition 17
#

A left ordered semigroup \(S\) is a semigroup and a partial order such that for all \(x, y, z\in S\), if \(x \le y\), then \(z * x \le z * y\).

Definition 18
#

A right ordered semigroup \(S\) is a semigroup and a partial order such that for all \(x, y, z\in S\), if \(x \le y\), then \(x * z \le y * z\).

Definition 19
#

An ordered semigroup \(S\) is a left and right ordered semigroup.

Definition 20
#

An ordered cancel semigroup \(S\) is an ordered semigroup such that for all \(a,b,c\in S\), if \(a * b \le a * c\) then \(b \le c\) and if \(b * a \le c * a\) then \(b \le c\).

Definition 21
#

A linear ordered semigroup is an ordered semigroup where its partial order is a linear order.

Definition 22
#

A linear ordered cancel semigroup is an ordered cancel semigroup where its partial order is a linear order.

Definition 23
#

An anomalous pair in a left ordered semigroup \(S\) is a pair of elements \(a,b \in S\) such that for all positive \(n \in \mathbb {N}\), either

\[ a^n {\lt} b^n {\lt} a^{n+1} \]

or

\[ a^n {\gt} b^n {\gt} a^{n+1} \]

.

Intuitively, an anomalous pair represents a pair of elements that are infinitely close. If you have two real numbers \(s\) and \(r\) such that \(s {\lt} r\), then as \(n \in \mathbb {N}\) gets larger, \(n\cdot s\) and \(n\cdot r\) get farther apart. However, for an anomalous pair, the elements always remain close to each other.

Definition 24
#

An element \(a\) of a left ordered semigroup \(S\) is positive if for all \(x\in S\), \(a*x {\gt} x\).

Definition 25
#

An element \(a\) of a left ordered semigroup \(S\) is negative if for all \(x\in S\), \(a*x {\lt} x\).

Definition 26
#

An element \(a\) of a left ordered semigroup \(S\) is one if for all \(x\in S\), \(a*x = x\).

Definition 27
#

Let \(a\) and \(b\) be elements of a left ordered semigroup \(S\) that are not one.

Then \(a\) is said to be Archimedean with respect to \(b\) if there exists an \(N\in \mathbb {N}^+\) such that for \(n {\gt} N\), the inequality \(b {\lt} a^n\) holds if \(b\) is positive, and the inequality \(b {\gt} a^n\) holds if \(b\) is negative.

Definition 28
#

A left ordered semigroup is Archimedean if any two of its elements of the same sign are mutually Archimedean.

Definition 29

A left ordered semigroup \(S\) has large differences if for all \(a,b\in S\), the two following implications hold

  • if \(a\) is positive and \(a{\lt}b\), then there exists \(c\in S\) and \(n\in \mathbb {N}^+\) such that \(c\) is Archimedean with respect to \(a\) and \(a^n*c \le b^n\)

  • if \(a\) is negative and \(b {\lt} a\), then there exists \(c\in S\) and \(n\in \mathbb {N}^+\) such that \(c\) is Archimedean with respect to \(a\) and \(a^n*c \ge b^n\)

Intuitively, this is saying if \(a {\lt} b\) then eventually \(a^n\) is significantly smaller than \(b^n\). Here “significantly smaller” means that there is an element that is not infinitely small with respect to \(a\) that separates \(a^n\) and \(b\).

2.2 Anomalous Pairs

Theorem 30

Each element \(a\) of a linear ordered cancel semigroup \(S\) is either positive, negative, or one.

Proof

Let \(a\in S\) and \(b\in S\). Since the \(S\) is a linear order we have one of the following cases.

The first case is that \(b * a {\gt} b\). Then for all \(x\in S\) we have that \(b * a * x {\gt} b * x\) and so \(a * x {\gt} x\). Therefore, \(a\) is positive.

The second case is that \(b * a {\lt} b\). Then for all \(x\in S\) we have that \(b * a * x {\lt} b * x\) and so \(a * x {\lt} x\). Therefore, \(a\) is negative.

The last case is that \(b * a = b\). Then for all \(x\in S\) we have that \(b * a * x = b * x\) and so \(a * x = x\). Therefore, \(a\) is zero.

Theorem 31

If \(S\) is a non-Archimedean linear ordered cancel semigroup, then there exists an anomalous pair.

Proof

Since \(S\) is non-Archimedean, there exists \(a,b\in S\) such that \(a\) and \(b\) have the sign and are not mutually Archimedean.

First, we look at the case where \(a\) and \(b\) are positive. Then since they are not mutually Archimedean, without loss of generality, for all \(n\in \mathbb {N}^+\), \(a^n {\lt} b\).

Then we either have that \(a * b \le b * a\) or that \(b*a\le a * b\). In the first case, we have that

\[ a^n + b^n \le (a*b)^n \le b^n + a^n \]

which means that, since \(a^n {\lt} b\),

\[ b^n {\lt} (a*b)^n {\lt} b^{n+1} \]

And so \(b\) and \(a*b\) form an anomalous pair.

The other cases follow similarly.

Theorem 32

A linear ordered cancel semigroup without anomalous pairs is an Archimedean commutative semigroup.

Proof

Let \(a\) and \(b\) be elements of an ordered semigroup \(S\). If either \(a\) or \(b\) is one, then they commute.

We begin with the case that \(a\) and \(b\) are positive. If \(a * b {\lt} b * a\), then for all \(n\in \mathbb {N}^+\), we have that

\begin{align*} (a*b)^{n+1} & = a * (b*a)^n * b \\ & {\gt} (b*a)^n * b \\ & {\gt} (b*a)^n \\ & {\gt} (a*b)^n \end{align*}

And so \(a*b\) and \(b*a\) form an anomalous pair.

The same for the case that \(b * a {\lt} a * b\). Therefore, we must have that \(a*b = b*a\).

The case where \(a\) and \(b\) are negative follows similarly.

We now look at the case where \(a\) is negative and \(b\) is positive. If the element \(1\) exists and \(a*b = 1\), then \(a * b * a = a\) and so \(b*a = 1\). Therefore, \(a\) and \(b\) commute.

If \(a * b\) is positive, then

\begin{align*} (a*b) * (a*b) & {\gt} a * b \\ (b * a) * b & {\gt} b \\ b * a & {\gt} 0 \end{align*}

We already showed that positive elements commute and so

\[ (b*a) * b = b * (b * a) \]

Now we look at the case where \(a*b {\lt} b*a\). Then we have that

\begin{align*} (a * b)^2 & = a * ((b*a) * b) \\ & = a * (b * (b * a)) \\ & = (a * b) * (b * a) \\ & {\gt} (a * b) * (a * b) \\ & = (a * b)^2 \end{align*}

Which is a contradiction. We get a similar contradiction in the case that \(b*a {\lt} a*b\). Therefore, \(a*b = b*a\).

The case where \(a*b\) is negative follows similarly. The case where \(b\) is negative and \(a\) is positive is symmetric.

Theorem 33

In a linear ordered cancel semigroup \(S\), there are no anomalous pairs if and only if there are large differences.

Proof

(\(\Rightarrow \)) If \(a\) and \(b\) are positive and \(a {\lt} b\), then we have that \(a^n {\lt} b^n\) for all \(n\). Therefore, there must exist an \(n\) such that \(a^{n+1} \le b^n\) as otherwise \(a\) and \(b\) would form an anomalous pair. Thus, the theorem is satisfied with \(c = a\).

Similarly if \(a\) and \(b\) are negatiave.

(\(\Leftarrow \)) We look first at the case where \(a\) and \(b\) are positive and \(a {\lt} b\). Then we have \(c\in S\) Archimedean with respect to \(a\) and \(m\in \mathbb {N}^+\) such that \(a^m * c \le b^m\).

Therefore, for any \(n \in \mathbb {N}^+\), either

\[ (a^m)^n * c^n \le (a^m*c)^n \le (b^m)^n \]

or

\[ c^n * (a^m)^n \le (a^m*c)^n \le (b^m)^n \]

holds.

Since \(c\) is Archimedean with respect to \(a\), there exists an \(N\) such that for all \(n \ge N\), \(a {\lt} c^n\). Thus, for any \(n \ge N\), we get from the previous relations that

\[ a^{mn + 1} \le b^{mn} \]

and so \(a\) and \(b\) do not form an anomalous pair.

Similalry if \(a\) and \(b\) are negative.

2.3 Semigroup to Group

Theorem 34

If \(S\) is a linear ordered cancel semigroup without anomalous pairs, then there exists a linear ordered cancel commutative monoid \(M\) without anomalous pairs such that \(S\) is isomorphic to a subsemigroup of \(M\).

Proof

We do casework on whether or not \(S\) has an element that is one.

If \(S\) has an element that is one then it is already a monoid. Furthermore, since it has no anomalous pairs, by Theorem 32, it is commutative. And so we are done.

If \(S\) does not have an element that is one, then we let \(M\) be \(S\) with one added. We define one to be less than every positive element and greater than every negative element. By Theorem 32, we know that \(S\) is commutative and so \(M\) is too. Furthermore, it is clear that \(M\) has no anomalous pairs still. Then \(S\) is isomorphic to the subsemigroup of \(M\) that is all its elements except for the added one.

Theorem 35
#

Let \(S\) be a linear ordered cancel semigroup without anomalous pairs such that there exists a positive element of \(S\). Then for all \(x \in S\), there exists a \(y \in S\) such that \(y\) is positive and \(x*y\) is positive.

Similarly, if there exists a negative element of \(S\) then for all \(x \in S\) there exists a \(y \in S\) such that \(y\) is negative and \(x*y\) is negative.

Proof

We look at the positive case. If \(x\) is positive then we are done as \(x*x\) is positive.

Next we look at the case where \(x\) is negative. Assume for the sake of contradiction that for all \(y \in S\), if \(y\) is positive then \(x*y\) is negative. Let \(z\) be a positive element we assumed existed in \(S\). Then for all positive \(n \in \mathbb {N}\), we have that \(x * z^{n+2}\) is negative. Recall that from Theorem 32 we have commutativity. From there we have an anomalous pair:

\begin{align*} (x * z)^n & = x^n * z^n \ge x^n\\ & \ge x^n * (x * z^{n+2})\\ & = (x * z)^{n+1} * z {\gt} (x*z)^{n+1} \end{align*}

Contradiction. And similarly for the negative case.

Theorem 36
#

Let \(M\) be a linear ordered cancel commutative monoid without anomalous pairs and let \(G\) be its Grothendieck group. If \(M\) has a positive (negative) element, then for any element \(\frac{a}{b} \in G\) where \(a,b \in M\), there exist \(a', b' \in M\) such that \(a'\) and \(b'\) are positive (negative) and \(\frac{a}{b} = \frac{a'}{b'}\).

Proof

Let \(\frac{a}{b}\in G\) where \(a,b\in M\). Since \(M\) has a positive element, by Theorem 35, we have \(a_2, b_2\in M\) such that \(a*a_2\) and \(b*b_2\) are positive. Let \(a' = a*a_2\) and \(b' = b*b_2\). Then \(\frac{a}{b} = \frac{a'}{b'}\) and \(a'\) and \(b'\) are positive.

And similarly for the negative case.

Theorem 37
#

Let \(M\) be a linear ordered cancel commutative monoid. If \(M\) does not have anomalous pairs, then its Grothendieck group is Archimedean.

Proof

If \(M\) is trivial then we are done. Otherwise, it has a positive element of a negative element.

We look at the case where \(M\) has a positive element \(t\). We now want to show that the Grothendieck group \(G\) of \(M\) is Archimedean. It suffices to show that for any positive \(g, h \in G\), there exists an integer \(n\) such that \(g^n {\gt} h\). Since \(g, h \in G\), there exist \(g_1,g_2,h_1,h_2 \in M\) such that \(g = \frac{g_1}{g_2}\) and \(h = \frac{h_1}{h_2}\), and by Theorem 36, we can assume that \(g_1\), \(g_2\), \(h_1\), and \(h_2\) are positive.

Then since \(M\) does not have anomalous pairs, we have by Theorem 32 that \(M\) is Archimedean. Since \(g_1\) and \(h_1\) are positive and \(M\) is Archimedean, there exists a positive \(N \in \mathbb {N}\) such that for all \(n \ge N\), \(g_2^n {\gt} h_1\). So in particular, we have that \(g_2^N {\gt} h_1\).

Notice that since \(\frac{g_1}{g_2}\) positive, we have that \(g_2 {\lt} g_1\). And therefore, since \(M\) does not have anomalous pairs, there exists a positive natural number \(N_1\) such that \(g_2^{N_1+N} {\lt} g_1^{N_1}\).

We now claim that \(g^{N_1} {\gt} h\). This is equivalent to showing that \(g_2^{N_1}*h_1 {\lt} h_2*g_1^{N_1}\). And we have that

\begin{align*} g_2^{N_1} * h_1 & = h_1 * g_2^{N_1}\\ & {\lt} g_2^N * g_2^{N_1} = g_2^{N_1 + N}\\ & {\lt} g_1^{N_1} \\ & {\lt} h_1 * g_1^{N_1} \end{align*}

And so we are done.

The final case where \(M\) has a negative element follows similarly.

Theorem 38
#

If \(S\) is a linear ordered cancel semigroup that does not have anomalous pairs, then there exists a linear ordered commutative group \(G\) that is Archimedean such that \(S\) is isomorphic to a subsemigroup of \(G\).

Proof

By Theorem 34, we have that \(S\) is isomorphic to a subsemigroup of a linear ordered cancel commutative monoid \(M\) that does not have anomalous pairs.

We let \(G\) be the Grothendieck group of \(M\). Then by Theorem 37 we know that \(G\) is Archimedean. Since \(G\) is the Grothendieck group of \(M\), \(M\) is isomorphic to a submonoid of \(G\). Thus, we have that \(S\) is isomorphic to a subsemigroup of \(G\).

2.4 Holder’s Theorem

Theorem 39
#

Let \(S\) be a linear ordered cancel semigroup without anomalous pairs. Then \(S\) is isomorphic to a subsemigroup of the real numbers.

Proof

By Theorem 38, there exists a linear ordered commutative Archimedean group \(G\) such that \(S\) is isomorphic to a subsemigroup of \(G\). By Theorem 16, \(G\) is isomorphic to a subgroup of \(\mathbb {R}\). Therefore, \(S\) is isomorphic to a subsemigroup of \(\mathbb {R}\).