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. 4 {1 o j7 l, I6 t' Y1 ?0 G- d8 `; u7 y4 B' D, x
An 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+. 8 U; R. G- z# l9 f4 z4 z : R, G. a- @! N! ^+ A% xBy the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. + A1 m0 l9 I9 w- Q, w2 k" k2 x3 j" e7 P
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: 7 q! X; H: d7 i$ J+ V2 @( o( a, X ) Y. [( v- q+ K7 L+ ^0 k: R% q0 ∈ H . K$ ^4 M2 z1 e! j$ Rif a ∈ H and b ∈ H then a+b ∈ H 1 [, f G" d1 Lif a ∈ H then -x+a+x ∈ H for each x of G ; j" M! C+ t) R- t+ w5 Xif a ∈ H and -a ∈ H then a=0 ! m1 G5 A3 T9 b, n0 M5 z
Examples 9 @, M$ E% c5 Q! U. _An ordered vector space is a partially ordered group ) }1 f% h! B: ]" E4 }, ~3 KA Riesz space is a lattice-ordered group " N: b4 K, @ C" W9 pA 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. ) ]/ u. w3 L0 w P+ c
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. % r9 X4 c8 \' z9 N' `* r序线性空间是有序群5 W4 n% v" A$ `; h# ^; G- c
* @ F: M' n: b5 C T
Z/R/R*都是有序交换群