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 o- y: x4 G1 ~: A$ b2 ]4 L8 i
7 \" P3 i8 f( s# V3 tAn 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+. 1 C5 _9 i' T5 ^9 J/ Q0 P4 Z+ A0 m& J: i9 }% ?7 Y
By the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. ( y/ A' | y6 F. ~3 r0 N _2 L+ I& w8 r# A8 cFor 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: : C9 L5 L; r. R3 l5 L; N7 l8 S$ F7 w6 {
0 ∈ H : Q3 t" ?9 v: C7 W0 ^! J2 `if a ∈ H and b ∈ H then a+b ∈ H . a& i4 c/ a4 X, j+ ?5 b' R" Zif a ∈ H then -x+a+x ∈ H for each x of G 0 o5 O ]3 @0 J1 o: A
if a ∈ H and -a ∈ H then a=0 0 P9 X2 |! u5 U. S
Examples - |9 |( c2 Y0 A: T* NAn ordered vector space is a partially ordered group ' H G& {1 h; Z" j
A Riesz space is a lattice-ordered group # a* e7 A5 E. B/ U' C! ?: z( H0 n
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. 1 N; {/ E/ x/ G% k! W( l; i; VMore 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. 9 }1 f9 ~* r k! c' h9 I" m3 u
序线性空间是有序群 - u8 B$ E& y& T" U7 ] . t" G+ v2 u3 z/ D' o% aZ/R/R*都是有序交换群