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.; b4 z. O% [$ y" ^
- f- e9 ~ C0 R' v) E: EAn 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+. 5 d5 z8 f! y3 ` o ! R) M7 N0 a6 z# L" RBy the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. & T2 _% P4 `0 C % f; i$ g) T& ~7 a& S; ] qFor 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:0 I' \% n7 `, E0 t. F, t$ R/ ^
& d9 q4 X7 l9 N \ f+ m7 n5 B5 ]
0 ∈ H ! Z( S3 A' A& J' z* ?' O0 l
if a ∈ H and b ∈ H then a+b ∈ H 0 ~7 V% n7 l) G
if a ∈ H then -x+a+x ∈ H for each x of G 1 K8 b/ P9 i& Z& N# z' Fif a ∈ H and -a ∈ H then a=0 6 H& Q' V9 [& i$ I- v/ q4 m
Examples6 ]" y! T. C; c- j" s
An ordered vector space is a partially ordered group 8 R0 U! Z2 M- ^1 JA Riesz space is a lattice-ordered group 8 ^) e B6 X3 Q* cA 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. 2 _) F1 R- B7 v5 u: T6 A2 T: P
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. 9 K( x5 W) j3 D6 N) ^
序线性空间是有序群! n C6 Q7 c# @% @* ]; n* T+ y
8 ?& W9 E# Z; {6 j: a
Z/R/R*都是有序交换群