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.- W r( t$ K2 S) q: I3 H
* {/ F: p: c( v% J
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+. 7 ^( ~/ O1 _! U* _- j" c' L' Z. H, f. C5 [% h! v. q
By the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b. / z" x6 [# }$ U) i( a! b9 B7 u( t: K0 \1 s
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:$ a4 t9 n$ l! D$ c1 F' o
( l! j' H' n! W
0 ∈ H $ r9 k& c( J: {9 V P* Z s: b9 Pif a ∈ H and b ∈ H then a+b ∈ H + d, ^: T9 b/ T3 lif a ∈ H then -x+a+x ∈ H for each x of G " }5 }. ?9 q, H( e9 v2 A& m
if a ∈ H and -a ∈ H then a=0 ( o& U$ Z4 j" t8 V* A' [
Examples3 g( K1 a% ?6 m4 w6 q4 X: p% D
An ordered vector space is a partially ordered group t1 c; _# ^: j2 c9 KA Riesz space is a lattice-ordered group ' r2 B1 o3 V* S _
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. : t3 F; G8 _; ^1 F# s/ ]% K- zMore 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. 3 n/ {: E, h/ O8 k1 Y
序线性空间是有序群 6 Y: q- M. j& ]+ i1 u! ~* F/ _5 Y
Z/R/R*都是有序交换群