有序群/有序交换群

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.

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+.

By the definition, we can reduce the partial order to a monadic property: a ≤ b if and only if 0 ≤ -a+b.
6 F# |1 ~% g0 _' Q' ]) ]
/ D1 q. ?; |9 AFor 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:
* k" K% U" X3 L" R+ I1 `! N
0 ∈ H
if a ∈ H and b ∈ H then a+b ∈ H
if a ∈ H then -x+a+x ∈ H for each x of G
* ]+ f* Q0 s$ ]; B& bif a ∈ H and -a ∈ H then a=0

孤寂冷逍遥

lilianjie

Examples
9 e: U: a3 b" a3 \An ordered vector space is a partially ordered group
; `8 [+ o6 K+ J4 ~3 k: ~A Riesz space is a lattice-ordered group
# m4 p, K' e2 B0 k9 F8 C5 }  [( y2 ]' \7 |2 sA 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.
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.
序线性空间是有序群
+ [, L( u& a1 }$ Q5 A, d& p
  f3 _6 P0 @' G2 u9 e) U- d% k. ?4 kZ/R/R*都是有序交换群

lilianjie

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

$ [# C$ J* C* O' e" f) f若 a < 0，则 − a > 0。
' ?5 R/ j5 D; ~& r  u. P+ |若 a,b > 0，则 a + b > 0。