Partially ordered group

In abstract algebra, a partially ordered group is a special kind of group. It has a way to compare its elements while keeping the group's structure. Think of a group as a collection of actions you can combine, like moving steps forward or backward. You can also say whether one action is "greater than or equal to" another.

An element in the group is called positive if it is greater than or equal to zero. All positive elements form a set called the positive cone. This cone helps define the order in the group.

When the group’s order is also a linear order, it becomes a linearly ordered group. If any two elements have a smallest value that is still bigger than both, the group is a lattice-ordered group. There are also special groups called Riesz groups. Partially ordered groups are important in advanced math, especially in studying valuations of fields.

Examples

Some simple examples of partially ordered groups are the integers with their usual order and an ordered vector space. Another example is Zⁿ, where we add numbers together and compare them by looking at each part separately.

More generally, if you have a partially ordered group and a set of inputs, the set of all functions from those inputs to the group also forms a partially ordered group. Also, every subgroup of a partially ordered group keeps the same order.

Properties

The Archimedean property, well-known from real numbers, can also apply to partially ordered groups. A partially ordered group is called Archimedean if this happens: for any elements a and b in the group, if a repeated many times is always less than or equal to b, then a must be the identity element e.

This property makes the group behave in a way that is similar to the real numbers. For lattice-ordered groups, being Archimedean is closely related to being integrally closed. There is also a theorem stating that every integrally closed directed group is actually abelian.