Definition

Let AA be a , and write AsaA_{\mathrm{sa}} for its self-adjoint part. The CC^*-algebra order on AsaA_{\mathrm{sa}} is defined by

abbaA+.a\leq b\quad\Longleftrightarrow\quad b-a\in A_+.

Here A+A_+ is the of AA. Equivalently, aba\leq b when ba=ccb-a=c^*c for some cAc\in A. This is a compatible with addition and multiplication by nonnegative real scalars. Positivity therefore supplies the order intrinsically; no external cone is chosen. The order is defined on self-adjoint elements; arbitrary elements of AA are not compared unless a separate convention is supplied.

Order-preserving operations

If aba\leq b, then xaxxbxx^*ax\leq x^*bx for every xAx\in A. Consequently, every is order-preserving on self-adjoint elements, and every *-homomorphism is positive. The also makes increasing operator-monotone functions order preserving on their domains Pedersen, treatment of positivity and order.

Examples and incomparability

For A=C0(X)A=C_0(X), the order is pointwise: fgf\leq g exactly when f(x)g(x)f(x)\leq g(x) for all xXx\in X. In M2(C)M_2(\mathbb C), the projections diag(1,0)\operatorname{diag}(1,0) and diag(0,1)\operatorname{diag}(0,1) are incomparable, since their difference has both a positive and a negative eigenvalue. Thus this order is usually not total.

Noncommutative caution

Multiplication need not preserve order. Even if 0ab0\leq a\leq b, the product xaxa need not be self-adjoint and hence need not be comparable with xbxb. The conjugated inequality xaxxbxx^*ax\leq x^*bx is the valid replacement. The order should also not be confused with an ordering of the complex AA; it lives on the real vector space AsaA_{\mathrm{sa}}.

References
  1. Gert K. Pedersen, CC^*-Algebras and Their Automorphism Groups, 2nd ed., Academic Press, 2018. DOI record. Relevant: the introductory chapters on positive elements and the order of the self-adjoint part.
  2. Gerard J. Murphy, CC^*-Algebras and Operator Theory, Academic Press, 1990. DOI record. Relevant: the chapter on positive elements and positive maps.