ordering of self-adjoints
Let be a -algebra (http://planetmath.org/CAlgebra). Let denote the set of positive elements of and denote the set of self-adjoint elements
of .
Since is a proper convex cone (http://planetmath.org/Cone5) (see this entry (http://planetmath.org/PositiveElement3)), we can define a partial order on the set , by setting
if and only if , i.e. is positive.
Theorem - The relation is a partial order relation on . Moreover, turns into an ordered topological vector space.
0.0.1 Properties:
- •
for every .
- •
If and are invertible and , then .
- •
If has an identity element
, then for every .
- •
.
0.0.2 Remark:
The proof that is partial order makes no use of the self-adjointness . In fact, itself is an ordered topological vector space under the relation .
However, it turns out that this ordering relation provides its most usefulness when restricted to self-adjoint elements. For example, some of the above would not hold if we did not restrict to .