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. 6 [* L3 B: d9 ~6 X2 N2 B 1 `6 x3 O# W) A# b: n8 |+ C3 MAn 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+.3 n' s8 r: k" S
- Q. ~7 \. J+ ~; ^/ aBy the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. : [% E% q* \- z* D1 M# B1 m/ e8 d, {' l0 Y5 U' 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: ! U" I8 Q' @& p: [' O% S9 ~" G8 v4 F1 G/ e+ J
0 ∈ H * G& ?3 b# m: O; i% a! u) t
if a ∈ H and b ∈ H then a+b ∈ H , k) F2 M( S' z; |; |if a ∈ H then -x+a+x ∈ H for each x of G & V4 r$ U; N0 g- ^. fif a ∈ H and -a ∈ H then a=0 . H9 |6 u3 x/ r+ y
Examples B% G+ @1 K3 E6 X5 S
An ordered vector space is a partially ordered group % e+ _: f8 X% ^3 i
A Riesz space is a lattice-ordered group 5 L5 ?, ^/ G* f! b" iA 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. * W/ W& q+ | I4 G) Z+ O: }
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 F9 F8 f' v5 b# I: {: D) w& ]
序线性空间是有序群0 X2 d& l8 a" u% P0 j: b