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. 7 i! B1 @7 c" ]# m {) |3 u; q& ?2 Y2 ?
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+. # Y l2 p% q: g 8 u8 o- U+ H9 X4 YBy the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. : N2 i7 U5 ]% Q( Y: u- m' G: q3 Q+ e: H* G3 L. 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: ( p/ `/ z, e4 R5 z. w9 g# Q. ^" j0 T& v& f3 z
0 ∈ H ( i0 n3 h6 F% i9 j
if a ∈ H and b ∈ H then a+b ∈ H ! ?* b/ N" M7 D7 c$ ^; q m8 |
if a ∈ H then -x+a+x ∈ H for each x of G 7 {7 a8 X0 f4 r& i7 ]$ }, d
if a ∈ H and -a ∈ H then a=0 0 a7 r0 T6 O+ r1 B" q. e
Examples+ \1 m/ B T( U2 `" o1 {" R9 R
An ordered vector space is a partially ordered group 6 f: c1 g5 q3 o) F( bA Riesz space is a lattice-ordered group . }# v' p$ p# {" M" ~% r* f1 `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. ! | b9 v. E9 n4 P5 [" U
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. ! p( S. {1 q8 H4 E2 Y% ~' D序线性空间是有序群 : {6 b) J3 f( s4 p % e+ V0 Z" c/ ~ o! T: }: nZ/R/R*都是有序交换群