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.. w1 W. n6 O, n# J5 K: V
+ t, {; S1 X& y% [* 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+.8 L9 t( h, K. K$ e q* O
1 I- N. u$ q- K, V+ z! J! \By the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. 0 G- D& w/ V# ]' N0 c& w$ |! ~9 ?3 e% @4 h
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:* q+ ~% o* P0 l/ [9 @3 S% t
: P9 f4 l1 k& N3 Y- N4 R
0 ∈ H - f0 C& l% H6 `, g2 m
if a ∈ H and b ∈ H then a+b ∈ H 2 \% s1 U. `0 n. Pif a ∈ H then -x+a+x ∈ H for each x of G * v" S; n: f, F! S
if a ∈ H and -a ∈ H then a=0 a; I9 K0 y5 O
Examples9 O1 i! m6 p& t* |5 r6 ~% q
An ordered vector space is a partially ordered group |. D' L" H' r g9 ~* s3 JA Riesz space is a lattice-ordered group 0 x. \: y5 S. V4 ?3 S, i! m; `+ r
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 I! G. q- |+ x, k" d4 C& M% N2 q( c( JMore 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. ! t4 V9 i( @6 n# A3 t序线性空间是有序群 ) B7 q0 J+ D8 W6 Y# K, M9 N: ~ ' Y2 [% ]8 Y2 G2 }- O8 A, HZ/R/R*都是有序交换群