有序群/有序交换群

lilianjie

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.

/ F# q2 a/ |, x$ h' dAn 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+.

  r% V! S+ w. ?/ w- wBy the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b.

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:

0 ∈ H
; E/ j) |; `, t' P. m( ^if a ∈ H and b ∈ H then a+b ∈ H
. y8 i4 b/ l# p5 mif a ∈ H then -x+a+x ∈ H for each x of G
if a ∈ H and -a ∈ H then a=0
- L+ y& O+ X! m# W

lilianjie

有序交换群系指一对 (Γ, > )，其中 Γ 为交换群， > 为其上的一个二元关系，且满足如下条件：

1 I* q7 ^$ B" W7 Y( R' X若 a < 0，则 − a > 0。
若 a,b > 0，则 a + b > 0。
0 t) I+ j6 x8 s$ {6 P

lilianjie

Examples
An ordered vector space is a partially ordered group
A Riesz space is a lattice-ordered group
/ Y2 k  l0 v8 X. qA 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.
6 B# P, K, M& p5 Z4 ~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.
+ [2 w% b) k5 ]: ~# o/ x4 w- @序线性空间是有序群
6 p! J9 P5 [0 y  }; x2 N
Z/R/R*都是有序交换群

孤寂冷逍遥