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.. y5 B. H4 @+ \1 h3 e) ?
: G: R' X1 |! OAn 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+. 4 n; r: ?+ |4 t0 Y5 v2 M) s) W; N% m: G# }
By the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. ) j8 a4 ], f/ J# \9 h8 K, }( G5 k3 b! |! t
For 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:8 x X y* `$ Y7 v/ b
! e- c9 j0 |6 A' L J0 ∈ H , j' T0 c/ p9 M- Q( p' n
if a ∈ H and b ∈ H then a+b ∈ H - C1 ^3 Z2 J4 U, ~# jif a ∈ H then -x+a+x ∈ H for each x of G % l2 _1 m2 i( O8 T7 z: Eif a ∈ H and -a ∈ H then a=0 7 r- L- E3 d2 y7 }& d2 m' ?2 v
Examples: V3 ]4 I' K0 Z8 h
An ordered vector space is a partially ordered group + D9 v; }* }7 o' j/ T3 [6 V& k# @A Riesz space is a lattice-ordered group 6 T- ]8 w# z; M4 h7 t( p* iA 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. + g1 C/ }/ M8 A
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. $ M0 R3 X6 n! q' u序线性空间是有序群 ( w4 i* g) E: U7 v4 K7 q$ x$ S V
Z/R/R*都是有序交换群