In abstract algebra, a partially ordered group is a group (G,+) equipped with a partial order "≤" that is translation-invariant; in other words, "≤" has the property that, for all a, b, and g in G, if a ≤ b then a+g ≤ b+g and g+a ≤ g+b. J, {0 F l: x! T9 p1 g 5 M1 s; o7 R8 a6 X4 YAn element x of G is called positive element if 0 ≤ x. The set of elements 0 ≤ x is often denoted with G+, and it is called the positive cone of G. So we have a ≤ b if and only if -a+b ∈ G+.+ |, r5 |! F/ S9 |% R
" F# Q9 g" N4 z
By the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. 6 y q: m8 l& v+ z6 N# m1 j' G 2 V, r: s y1 Q$ A! HFor the general group G, the existence of a positive cone specifies an order on G. A group G is a partially ordered group if and only if there exists a subset H (which is G+) of G such that: : z0 n5 I {1 n$ q' m# }- m9 Q: }2 I6 H- s, m: E. P
0 ∈ H 5 Y. M# D u% f# o+ Z9 vif a ∈ H and b ∈ H then a+b ∈ H $ }5 U. D* `1 x( P. [$ Rif a ∈ H then -x+a+x ∈ H for each x of G / r: D1 y5 R5 h; G; sif a ∈ H and -a ∈ H then a=0 % e `" g# N l3 I
Examples % I' R' A4 r- E( \: g0 qAn ordered vector space is a partially ordered group 2 H- S& }- g! `* K8 V5 {
A Riesz space is a lattice-ordered group 1 h }3 j& V- O U3 B
A typical example of a partially ordered group is Zn, where the group operation is componentwise addition, and we write (a1,...,an) ≤ (b1,...,bn) if and only if ai ≤ bi (in the usual order of integers) for all i=1,...,n. 3 p3 }% a' I. C! H3 Z$ W
More generally, if G is a partially ordered group and X is some set, then the set of all functions from X to G is again a partially ordered group: all operations are performed componentwise. Furthermore, every subgroup of G is a partially ordered group: it inherits the order from G. ( R" E0 M( ^7 E; U% _" l% u2 c9 l序线性空间是有序群" y& o* R/ v. V. `* I( o