Algebraic orthogonality and commuting projections
in operator algebras
Anil Kumar Karn
School of Mathematical Science, National Institute of Science Education and
Research, HBNI, Bhubaneswar, At & Post - Jatni, PIN - 752050, India.
[email protected]; [email protected]
Abstract.
We provide an order-theoretic characterization of algebraic
orthogonality among positive elements of a general C*∗-algebra
by proving a statement conjectured in [12]. Generalizing this
idea, we describe absolutely ordered p-normed spaces, for
1≤p≤∞ which present a model for “non-commutative
vector lattices”. Thid notion includes order theoretic orthogonality. We
generalize algebraic orthogonality by introducing the notion of
absolute compatibility among positive elements in absolute order
unit spaces and relate it to symmetrized product in the case of a
C∗-algebra. In the latter case, whenever one of the elements is
a projection, the elements are absolutely compatible if and only if they
commute. We develop an order theoretic prototype of the results. For
this purpose, we introduce the notion of order projections and
extend the results related to projections in a unital C∗*-algebra
to order projections in an absolute order unit space. As an application,
we describe spectral decomposition theory for elements of an absolute
order unit space.
Key words and phrases:
Absolute ∞-orthogonality, absolute order unit space, absolute compatibility, order projection.
2010 Mathematics Subject Classification:
Primary 46B40; Secondary 46L05, 46L30.
1. Introduction
The order structure of a C*∗-algebra has been a point of
attraction since the inception of the theory. Kakutani’s characterization
of C(K) spaces (K a compact, Hausdorff space) as AM- spaces
[7] highlighted that the self-adjoint part of a commutative
C∗-algebra is a Banach lattice (with some additional norm
conditions). However, in a non-commutative C∗-algebra,
join and meet of two general self-adjoint elements may not even exist.
Thus it was natural to turn attention towards the non-commutative
case. In 1951, Kadison proved that the self-adjoint part of a unital
C∗*-algebra is an order unit space [6]. (However, this
was not a characterization as the converse is not true.) Its non-unital
version was studied by Ng [14]. (Also see [3].) The
non-self-adjoint version of Kadison’s work was introduced by Choi and
Effros as matrix order unit spaces [5] whose non-unital version
was presented by Karn and Vasudevan [13].
The author carried forward the work further in this direction with an
intuition that it may be possible to prove a non-commutative version
of Kakutani’s theorem. He characterized the (matrix) ordered normed
spaces that can be order embedded in C*∗-algebras [10]
and introduced the notion of order smooth ∞-normed spaces
(order smooth p-normed spaces in general, for 1≤p≤∞)
[9]. On such spaces, he studied a notion pf
∞-orthogonality (p-orthogonality in general, for 1≤p≤∞) [11]. In a subsequent paper, he characterized algebraic
orthogonality in some classes of C∗-algebras (that include
commutative C∗-algebras as well as von Neumann algebras) in
terms of absolute ∞-orthogonality (defined for order smooth
∞-normed spaces) [12]. In this paper, we extend it to an
arbitrary C∗*-algebra, thus proving Conjecture 4.4 of [12].
Following the above said characterization, the author introduced the
notion of an absolute order smooth p-normed space (1≤p≤∞). Thus the examples of an absolute order smooth
∞-normed space include the self-adjoint part of an arbitrary
C*∗*-algebra. It is important to note that an absolute order
smooth p-normed space exhibit a “vector lattice like” structure.
More precisely, this structure can be characterized as a vector lattice
under an extra condition [12]. In this paper, we shall present a
simplified version of this theory to propose a model of a
“non-commutative” vector-lattice theory.
Algebraic orthogonal (or equivalently, absolutely orthogonal) pair of
positive elements in a C*∗-algebra are by default commutative.
In this paper, we observe that absolutely orthogonal pair of (positive)
elements inherit another order theoretic relation which we term as
absolute compatibility. We show that for a pair of absolutely
compatible positive elements in a C∗-algebra, their
symmetrized product may be described order theoretically. More
precisely, we show that in a C∗*-algebra A, a and b are
mutually absolutely compatible positive elements of A if and
only if α(a∧˙b)=a∘b where α=max{∥a∥,∥b∥}. (Notions are defined later.) In particular,
if one of the elements is a projection, then these elements are
absolutely compatible if and only if they commute. These observations
indicate that absolute compatibility may be explored as a possible tool
to understand commutativity in operator algebras.
In this paper, we develop an order theoretic prototype of these results.
For this purpose, we introduce the notion of order projections
generalizing projections and extend some of the results related to
projections in unital C*∗*-algebras to order projections in
absolute order unit spaces. Order projections bear similarity with the
notion ‘projective units’ (defined in order unit spaces) studied in
[2] and also with the notion ‘projections’ (again defined in order
unit spaces) studied in [4, 1]. At the end of the paper, as an
application, we describe a spectral decomposition theory in an
absolute order unit space.
Now we propose the scheme of the paper. In Section 3, we describe
absolutely ordered p-normed spaces, for 1≤p≤∞ which
presents a model for “non-commutative” vector lattices and includes
order theoretic orthogonality. In section 4, we introduce absolute
compatibility between positive elements in an absolute order
unit space and relate this notion to symmetrized product in a unital
C*∗*-algebra. In Section 5, we introduce order projections as
a generalization of projections in operator algebras. We study absolute
compatibility of an order projection first, with another order projection
in Section 5, and then with general positive elements in Section 6. In
Section 7, we discuss a spectral decomposition theory in an absolute
order unit space.
2. Orthogonality in C*∗*-algebras
In [12], we proved that the algebraic orthogonality among
positive elements is equivalent to absolutely ∞-orthogonality
in a von Neumann algebra as well as in a commutative
C*∗-algebra. We begin the paper with proving the result for a general C∗*-algebra conjectured in [12].
Theorem 2.1**.**
[12, Conjecture 4.4]**
Let A be a C∗-algebra. Then for a,b∈A+∖{0}, we have ab=0 if and only if
∥∥c∥−1c+∥d∥−1d∥=1 whenever 0<c≤a and 0<d≤b in A+.
Let us recall the following result.
Proposition 2.2**.**
[12]**
Let A be a C∗-algebra and let a,b∈A+∖{0}.
Consider the following statements:
- (1)
ab=0,
2. (2)
0<c≤a* and 0<d≤b imply \big{\|}\|c\|^{-1}c+\|d\|^{-1}d\big{\|}=1,*
3. (3)
0≤c≤a* and c≤b imply c=0.*
Then (1) implies (2) and (2) implies (3). Further, if ab=ba, then (3) implies (1).
Proof.
[of Theorem 2.1]
( A. M. Peralta)
It suffices to show that a⊥∞ab implies ab=0. Further, without any loss of generality, we may assume that ∥a∥=1=∥b∥.
Let C∗(a) be the C*∗*-subalgebra of A generated by a. Then C∗(a)≅C(σ(a)) where σ(a) is the
spectrum of a. Since ∥a∥=1 we have σ(a)⊂[0,1].
For each n∈N, we define an:σ(a)→C as follows:
For t∈σ(a), we set
[TABLE]
Then an∈C(σ(a)) with an≤a for each n. By functional calculus, an∈A+. Thus by assumption, an⊥∞d
for any d∈A+ with d≤b.
Also, ∥an∥=n1 so that cn:=nan has norm one for each n and that
cn⊥∞d for any d∈A+ with d≤b.
Further we note that cn→[a] in A∗∗ in the weak*-topology where [a] is the
range projection of a in A∗∗.
As the norm in A∗∗ is weak*-lower semi-continuous we have
[TABLE]
for 0≤d≤b. Now as 0≤[a]≤[a]+∥d∥−1d we may conclude that ∥[a]+∥d∥−1d∥=1 we have
[a]⊥∞d whenever 0≤d≤b.
Now by a dual argument, we further get that [a]⊥∞[b].
As [a] and [b] are projections, we have
[a][b]=0 and consequently, ab=0.
∎
3. Orthogonality in ordered vector spaces
In this section, we recall few immediate definitions and facts discussed in [9, 11, 12]. we shall present these concepts
with a new orientation. This may be seen as a fresh start of the theory of absolutely ordered spaces. The first result is a
simpler (and weaker) form of [12, Theorem 4.11]. We include a proof as the order structure is proved under weaker assumptions and with a different set of arguments.
Theorem 3.1**.**
Let V be a real vector space. The following sets of conditions on V are equivalent:
- (1)
There exists a cone V+ in V and a mapping ∣⋅∣:V→V+ that satisfies the following conditions:
- (a)
∣v∣=v* if v∈V+.*
2. (b)
∣v∣±v∈V+.
3. (c)
∣kv∣=∣k∣∣v∣* for all v∈V and k∈R.*
2. (2)
There exists a mapping ∨˙:V×V→V that satisfies the following conditions:
- (a)
v∨˙v=v.
2. (b)
v∨˙w=w∨˙v* for all v,w∈V.*
3. (c)
(u∨˙v)+w=(u+w)∨˙(v+w)* for all u,v,w∈V.*
4. (d)
k(v∨˙w)=(kv)∨˙(kw)* for all v,w∈V and k≥0.*
5. (e)
If v∨˙w=v, then (u∨˙v)∨˙w=u∨˙(v∨˙w).
3. (3)
There exists a mapping ∧˙:V×V→V that satisfies the following conditions:
- (a)
v∧˙v=v.
2. (b)
v∧˙w=w∧˙v* for all v,w∈V.*
3. (c)
(u∧˙v)+w=(u+w)∧˙(v+w)* for all u,v,w∈V.*
4. (d)
k(v∧˙w)=(kv)∧˙(kw)* for all v,w∈V and k≥0.*
5. (e)
If v∧˙w=v, then (u∧˙v)∧˙w=u∧˙(v∧˙w).
4. (4)
There exists a cone V+ in V and a binary operation ⊥ in V+ that satisfies the following conditions:
- (a)
u⊥0* for all u∈V+.*
2. (b)
If u⊥v, then v⊥u.
3. (c)
If u⊥v, then ku⊥kv for all k∈R with k>0.
4. (d)
For each v∈V, there exist a unique pair v1,v2∈V+ such that v=v1−v2 with
v1⊥v2.
Proof.
First assume that the set of conditions (1) holds. For v,w∈V, we define
[TABLE]
Then ∨˙:V×V→V and (2) (a), (b), (c) and (d) follow in a routine way. Further note that v∨˙w=v if and only if
w≤v. Also, v≤u∨˙v. Now, we show that (2)(e) holds. Let u,v,w∈V with v∨˙w=v. Then w≤v≤u∨˙v so that (u∨˙v)∨˙w=u∨˙v=u∨˙(v∨˙w). Thus (1) implies (2).
Next, assume that the set of conditions (2) holds. Set v∧˙w:=v+w−(v∨˙w). Then ∧˙:V×V→V
is a binary mapping such that
[TABLE]
for all v,w∈V. Now conditions (3)(a) – (3)(e) hold by dual arguments.
Finally, assume the conditions in the set (3). Put
[TABLE]
Let v∈V+ and k≥0. Then v∧˙0=0 so that using (2)(d), we get 0=k(v∧˙0)=(kv)∧˙0. Thus kv∈V+. Next, note that by using (2)(c) and (2)(d) we can show that uinV+, that is, u∧˙0=0 if and only (−u)∧˙0=−u which is equivalent to u∧˙(−u)=−u. Now, let v,w∈V+. Then −v=v∧˙(−v) and
−w=w∧˙(−w)so that −v−w=(v−w)∧˙(−v−w) by (2)(c). Similarly, we get v−w=(v+w)∧˙(v−w).
Thus using (2)(e), we have
[TABLE]
Therefore, V+ is a cone in V. Now we define
[TABLE]
for all v∈V. Note that v∈V+ if and only if 0=2(v∧˙0)=(2v)∧˙0=−∣v∣+v so that (1)(a) holds.
To prove (1)(b), first we show that −(v∧˙0)∈V+ for all v∈V. For this, let v∈V and
set w=v∧˙0. Then
[TABLE]
by (2)(e) so that
[TABLE]
by (2)(c) and (2)(d). Thus
[TABLE]
and whence −(v∧˙0)=−w∈V+. Now (1)(b) follows from a straight forward observation
[TABLE]
Now, the proof of (1)(c) directly follows from (2)(d).
Finally, we show the equivalence of (1) and (4). First let the set of conditions (1) hold. For u,v∈V+, we define define u⊥v
if ∣u−v∣=u+v. Then conditions (4)(a) – (4)(d) directly follow from the definition of ⊥.
Conversely, assume that the set of conditions (4) hold. For each v, define ∣v∣:=v1+v2, using the uniqueness of (4)(d).
Then ∣⋅∣ maps V into V+. Let v∈V+. Since v⊥0 by (4)(a), we have ∣v∣=v. Also, by the definition of
∣⋅∣, we further see that ∣v∣±v∈V+. Now, let v∈V. Then by (4)(d), there exists a unique pair
v1,v2∈V+ with v1⊥v2 such that v=v1−v2. Then kv1⊥kv2 for any k∈R with
k>0 using condition (4)(c). Now by the definition
[TABLE]
Also, if k∈R with k<0, then
[TABLE]
Thus ∣kv∣=∣k∣∣v∣ for all k∈R.
∎
Next, we recall Theorem 4.12 of [12].
Theorem 3.2**.**
Let V satisfy the (equivalent sets of) conditions of Theorem 3.1. Then the following statements are equivalent:
- (i)
v∨˙w=sup{v,w}* for all v,w∈V.*
2. (ii)
∨˙* is associative in V.*
3. (iii)
u±v∈V+* implies ∣v∣≤u for all u,v∈V.*
4. (iv)
∣v+w∣≤∣v∣+∣w∣* for all v,w∈V.*
Thus V is a vector lattice if and only if one of the equivalent conditions of this result (in addition to the equivalent set of
conditions of Theorem 3.1) holds in V.
Remark 3.3*.*
In addition to the (equivalent sets of) conditions of Theorem 3.1, there are some other properties which hold both in a vector lattice
as well as in a C*∗*-algebra.
Let V be a vector lattice.
- (1)
If u,v,w∈V with u∧v=0 and u∧w=0, then u∧(v+w)=0. To see
this, first note that x∧y≤x for any x,y∈V so that u,v,w∈V+. Now, as u∧v=0, we get (u+w)∧(v+w)=w. Thus
[TABLE]
for u≤u+w.
2. (2)
Let u,v∈V with u∧v=0. If 0≤w≤v, then u∧w=0. In fact, w∧v=w so that
[TABLE]
In particular, if u,v,w∈V+ with u∧(v+w)=0, then u∧v and u∧w=0.
3. (3)
If u,v,w∈V with u∧v=0 and u∧w=0, then u∧∣v−w∣=0.
This follows from (1) and (2) as ∣v−w∣≤v+w.
Next, let A be a C*∗*-algebra.
4. (4)
For a∈A we define ∣a∣:=(a∗a)21. Then (Asa,A+,∣⋅∣) satisfies the set of conditions
(1) of Theorem 3.1. Also, (1), (2) and (3) hold in Asa as well when we replace ∧ by ∧˙. In fact, we have
a∧˙b=0 if and only if a,b∈A+ and ab=0. To see this, first we note that a∧˙b=0 if and only if
∣a−b∣=a+b. We show that ∣a−b∣=a+b if and only if a,b∈A+ with ab=0. First, let ∣a−b∣=a+b.
Then
[TABLE]
so that ab+ba=0. Also, in this case,
[TABLE]
so that a,b∈A+. Thus −a2b=aba∈A+ and consequently, a2b=ba2. Now, by the functional calculus in A, we
can conclude that ab=ba. Consequently, ab=0. Conversely, if a,b∈A+
with ab=0, then ab=ba and using the (commutative) C*∗*-algebra generated by a and b, we can show that
∣a−b∣=a+b so that a∧˙b=0.
5. (5)
We have not been able to prove whether (1), (2) and (3) (with ∧ replaced by ∧˙) will follow from the equivalent
conditions of Theorem 3.1 or not. Also, we find these properties useful for the develop the theory. Thus we shall include them in the
definition of an absolutely ordered space.
6. (6)
Let V satisfy the equivalent conditions of Theorem 3.1 and let u,v∈V. Then u∧˙v=0 if and only if
u,v∈V+ and ∣u−v∣=u+v (or equivalently, u⊥v). Further, ∣2u−v∣=v if and only if
0≤u≤v and u⊥(v−u).
Definition 3.4**.**
Let (V,V+) be a real ordered vector space and let ∣⋅∣:V→V+ be a mapping satisfying the following conditions:
- (1)
∣v∣=v if v∈V+;
2. (2)
∣v∣±v∈V+;
3. (3)
∣kv∣=∣k∣∣v∣ for all v∈V and k∈R;
4. (4)
If ∣u−v∣=u+v and 0≤w≤v, then ∣u−w∣=u+w; and
5. (5)
If ∣u−v∣=u+v and ∣u−w∣=u+w, then ∣u−(v±w)∣=u+∣v±w∣.
Then (V,V+,∣⋅∣) will be called an absolutely ordered space.
3.1. Norms on absolutely ordered vector spaces
Definition 3.5**.**
Let (V,V+) be a real ordered vector space such that V+ is proper and generating and
let ∥⋅∥ be a norm on V such that V+ is ∥⋅∥-closed. Let 1≤p≤∞.
For u,v∈V+, we say that u is p-orthogonal to v, (we write, u⊥pv), if
[TABLE]
Further, we say that u is absolutely p-orthogonal to v, (we write, u⊥pav), if u1⊥pv1
whenever 0≤u1≤u
and 0≤v1≤v.
The following observation describes the importance of ⊥p.
Proposition 3.6**.**
Let (V,V+,∣⋅∣) be an absolutely ordered vector space and assume that ∥⋅∥
is a norm on V such that V+ is ∥⋅∥-closed. Then for 1≤p≤∞, the following
conditions are equivalent:
For each v∈V, we have
[TABLE]
For u,v∈V+, we have u⊥pav whenever u⊥v;
For u,v∈V+, we have u⊥pv whenever u⊥v.
If ∥⋅∥ is an order unit norm determined by the order unit e, then the above conditions (with p=∞)
are also equivalent to:
For each v∈V with ±v≤e, we have ∣v∣≤e.
Proof.
First, assume that (A) holds. Let u,v∈V+ with u⊥v and suppose that 0≤u1≤u and
0≤v1≤v. Then for k,l∈R with k,l>0, we have ku1⊥lv1. If we set
w=ku1−lv1, then ∣w∣=ku1+lv1,w+=ku1 and w−=lv1. Thus by (A),
we have
[TABLE]
so that u⊥pav. Thus (A) implies (B). Now that (B) implies (C) is trivial.
Next, assume that (C) holds.
Let v∈V. Then v+⊥v−. Thus by assumption, v+⊥pv− so that
[TABLE]
Since v=v+−v− and ∣v∣=v++v−, we see that (A) holds.
Now, assume that ∥⋅∥ is an order unit norm
determined by the order unit e. First let (D) hold. Let u,v∈V+ with u⊥v. We show that
u⊥∞v. Without any loss of generality, we may assume that ∥u∥=1=∥v∥. Set w=u−v. As
−v≤w≤u, we have ∥w∥≤max{∥u∥,∥v∥}=1 so that ±w≤e. Now, by assumption,
u+v=∣w∣≤e. Thus 1=∥u∥≤∥u+v∥≤1 so that u⊥∞v.
Finally, assume that (A) holds. Let v∈V with ±v≤e. Then
∥v∥≤1. Now, by assumption, ∥∣v∣∥≤1 so that ∣v∣≤e. This completes the proof.
∎
Definition 3.7**.**
Let (V,V+,∣⋅∣) be an absolutely ordered vector space
and assume that ∥⋅∥ is a norm on V such that V+
is ∥⋅∥-closed. For 1≤p≤∞, we say that
(V,V+,∣⋅∣,∥⋅∥) is an absolutely order
smooth p-normed space, if it satisfies the following conditions.
For u≤v≤w we have
[TABLE]
- (O.⊥p.1):
For u,v∈V+ with u⊥v, we have u⊥pav.
- (O.⊥p.2):
For u,v∈V+ with u⊥pav, we have u⊥v.
If in addition, (for p=∞,) ∥⋅∥ is an order unit
norm on V determined by an order unit e, we say that (V,e) is
an absolute order unit space.
Remark 3.8*.*
- (1)
The self-adjoint part of every C*∗*-algebra is an absolutely order smooth ∞-normed space.
2. (2)
The self-adjoint part of the dual of any C*∗*-algebra is an absolutely order smooth 1-normed space.
3. (3)
In general, Tp(H)sa, the self-adjoint part of the space of trace class operators on a complex Hilbert space H is an absolutely
order smooth p-normed space.
4. (4)
Let (V,V+,∣⋅∣,∥⋅∥) is an absolutely order smooth p-normed space. Assume that u,v,w∈V+
with u⊥v and u⊥w. Then for α,β>0, we have u⊥αv and u⊥βw and consequently,
u⊥∣αv+βw∣. Thus u⊥p(αv+βw) for all α,β∈R.
5. (5)
Recall that an order smooth p-normed space is a real ordered vector space (V,V+) in which V+ is proper and
generating together with a norm ∥⋅∥ for which V+ is closed such that the space satisfies the conditions
(O.p.1) and
(O.p.2): For each v∈V and ϵ>0, there exist v1,v2∈V+ such that v=v1−v2 and
[TABLE]
Thus an absolutely order smmoth p-normed space is an order smooth p-normed space satisfying
(OS.p.2): For each v∈V, there exist v1,v2∈V+ such that v=v1−v2 and
[TABLE]
6. (6)
Let (V,V+,e) be an order unit space. Then, with the order unit norm ∥⋅∥e on V, (V,V+,∥⋅∥e)
is an order smooth ∞-normed space satisfying (OS.∞.2).
4. Absolute orthogonality and symmetrized product
By the definition, algebraic orthogonal pair of positive elements in a
C*∗-algebra commute. In this section, we introduce an order
theoretic notion, defined forpositive elements, which nearly imitates
commutativity when considered in a C∗*-algebra.
Proposition 4.1**.**
Let (V,e) be an absolute order unit space and assume that u,v∈[0,e]. Then u⊥v if and only if u+v≤e and
∣u−v∣+∣u+v−e∣=e.
Proof.
Let u⊥v. Then ∣u−v∣=u+v and ∥u+v∥=max{∥u∥,∣v∥}≤1. Thus u+v∈[0,e] so that
[TABLE]
Now, it follows that ∣u−v∣+∣u+v−e∣=e. Conversely, assume that u+v≤e and that ∣u−v∣+∣u+v−e∣=e. Then
[TABLE]
so that ∣u−v∣=u+v. In other words, u⊥v.
∎
Proposition 4.2**.**
Let (V,e) be an absolute order unit space. If ∣u−v∣+∣u+v−e∣=e, then u,v∈[0,e].
Proof.
Assume that α=1. Then ∣u−v∣+∣u+v−e∣=e. Thus we have
[TABLE]
Thus
[TABLE]
[TABLE]
[TABLE]
and
[TABLE]
Now, it follows that u,v∈[0,e].
∎
Definition 4.3**.**
Let (V,e) be an absolute order unit space. Then u,v∈[0,e] are said to be absolutely comparable, if
∣u−v∣+∣u+v−e∣=e.
Proposition 4.4**.**
Let (V,e) be an absolute order unit space. Then for u,v∈[0,e] the following statements are equivalent:
- (1)
u* is absolutely compatible with v;*
2. (2)
u∧˙v+u∧˙(e−v)=u;
3. (3)
u∧˙v+(e−u)∧˙v=v;
4. (4)
(e−u)∧˙v+(e−u)∧˙(e−v)=e−u;
5. (5)
u∧˙(e−v)+(e−u)∧˙(e−v)=e−v;
6. (6)
u∧˙v+u∧˙(e−v)+(e−u)∧˙v+(e−u)∧˙(e−v)=e.
Proof.
Using symmetry in the condition for absolute compatibility, we may conclude that u is absolutely compatible with v if and only if
{u,e−u} is absolutely compatible with {v,e−v}. Next, as
[TABLE]
we conclude that u and v are absolutely compatible with respect to p if and only if u∧˙v+u∧˙(e−v)=u.
Now combining the two observations, the proofs follow in a routine way.
∎
Proposition 4.5**.**
Let (V,e) be an absolute order unit space. Then for u,v∈[0,e] the following statements are equivalent:
- (1)
u* is absolutely compatible with v;*
2. (2)
u∧˙v,(e−u)∧˙(e−v)∈V+* with u∧˙v⊥(e−u)∧˙(e−v);*
3. (3)
u∧˙(e−v),(e−u)∧˙v∈V+* with u∧˙(e−v)⊥(e−u)∧˙v.*
Proof.
First, let us assume that u is absolutely compatible with v so that ∣u−v∣+∣u+v−e∣=e. Then
[TABLE]
In a similar manner, we can also show that
[TABLE]
[TABLE]
and
[TABLE]
Thus u∧˙v,u∧˙(e−v),(e−u)∧˙v,(e−u)∧˙(e−v)∈V+ with
[TABLE]
and
[TABLE]
Thus (1) implies (2) and (3).
Conversely, let u∧˙v,(e−u)∧˙(e−v)∈V+ with u∧˙v⊥(e−u)∧˙(e−v). Then by the definition, we have
[TABLE]
and
[TABLE]
Now, u∧˙v⊥(e−u)∧˙(e−v) implies that ∣u+v−e∣=e−∣u−v∣, that is, u is absolutely compatible with v.
Dually, u is absolutely compatible with v if and only if u∧˙(e−v),(e−u)∧˙v∈V+ with u∧˙(e−v)⊥(e−u)∧˙v.
∎
Remark 4.6*.*
Let u,v∈[0,e]. Since (e−u)∧˙(e−v)=e−(u∨˙v), it follows from Proposition 4.5 that u is absolutely compatible with v
if and only if u∧˙v,u∨˙v∈[0,e] with u∧˙v⊥(e−u∨˙v). Thus by Proposition 4.1, u is absolutely compatible
with v if and only if u∧˙v is absolutely compatible with u∨˙v. In particular, u is absolutely compatible to itself if and only if u⊥(e−u).
Let A be a C*∗*-algebra. For a,b∈A we shall write, a∘b:=21(ab+ba).
Proposition 4.7**.**
Let A be a unital C∗-algebra. Then for a,b∈Asa, we have ∣a−b∣+∣a+b−1∣=1 if and only if
a,b∈[0,1] with a∘b=a∧˙b.
Proof.
First let ∣a−b∣+∣a+b−1∣=1. Note that ∣x∣±x∈A+ for all x∈Asa. Thus
1±(a−b)±(a+b−1)∈A+ so that
a,b∈[0,1]. Now
[TABLE]
and
[TABLE]
Also, by assumption, we have ∣a+b−1∣=1−∣a−b∣ so that
[TABLE]
Thus 2(ab+ba)=2(a+b−∣a−b∣) so that a∘b=a∧˙b.
Conversely, let a,b∈[0,1] with a∘b=a∧˙b. Expanding a∘b=a∧˙b as above, we can show that
∣a+b−1∣2=(1−∣a−b∣)2. Now, as a,b∈[0,1], we have
[TABLE]
so that ∣a−b∣≤1. Thus ∣a+b−1∣=1−∣a−b∣.
∎
Corollary 4.8**.**
Let A be a unital C∗-algebra and a,b∈A+. Set α=max{∥a∥,∥b∥}. Then
a is absolutely comparable with b if and only if a∘b=α(a∧˙b).
For a projection, Proposition 4.7 takes the following form.
Proposition 4.9**.**
Let A be a unital C∗-algebra. Then for 0≤a≤1 in A and for a projection p in A, the following statements are equivalent:
- (1)
a* is absolutely comparable with p;*
2. (2)
a∧˙p=ap;
3. (3)
ap=pa.
In this case, inf{a,p} exists (in A+) and is equal to a∧˙p.
Proof.
(1)⟹(2):
First, assume that ∣a−p∣+∣a+p−1∣=1. Let a−p=x1−x2 and a+p−1=y1−y2
such that x1,x2,y1,y2∈A+ with x1x2=0 and y1y2=0. Then ∣a−p∣=x1+x2 and ∣a+p−1∣=y1+y2. Thus
x1+x2+y1+y2=1 and x1−x2+y1−y2=2a−1 so that a=x1+y1 and p=x2+y1 and consequently, 1−p=x1+y2.
As p and 1−p are projections with p(1−p)=0, it follows that x1y1=0 and x2y2=0. In particular, x1p=0 so that ap=y1. Thus
[TABLE]
As a∧˙p is self-adjoint, (2)⟹(3) is evident.
(3)⟹(1): Next, assume that ap=pa. Then ap=pap and a(1−p)=(1−p)a(1−p) so that a=pap+(1−p)a(1−p). As 0≤a≤1,
we see that 0≤pap≤p and 0≤(1−p)a(1−p)≤(1−p). Thus
[TABLE]
and
[TABLE]
Adding them, we get ∣a−p∣+∣a+p−1∣=1.
Finally, assume that ap=pa. Then ap=a21pa21≤a and ap=pap≤p. As a,p∈A+ and ap=pa, we have
ap∈A+. Next, let x∈A+ be such that x≤a and x≤p. As p is a projection, we get xp=px=x. Thus
[TABLE]
so that a∧˙p=ap=inf{a,p}.
∎
Corollary 4.10**.**
Let A be a unital C∗-algebra. Then for a∈A+ and for a projection p in A, the following statements are equivalent:
- (1)
a* is absolutely comparable with p;*
2. (2)
a∧˙p=ap;
3. (3)
ap=pa.
Commuting projections yield the following refinement of Proposition 4.9.
Proposition 4.11**.**
Let A be a unital C∗-algebra and let P(A) denote the set of projections in A. Then for p,q∈P(A),
we have pq=qp if and only if p∧˙q∈P(A). In this case, p∧˙q=pq=infP(A){p,q}.
Proof.
First let pq=qp:=r. Then r=infP(A){p,q}. We show that r=p∧˙q. Since p−r,q−r∈P(A)
with (p−r)(q−r)=0, we get
[TABLE]
Thus p∧˙q=21{p+q−∣p−q∣}=r.
Conversely, assume that p∧˙q∈P(A). Since p∧˙q≤p and p∧˙q≤q, we get
p(p∧˙q)=(p∧˙q)p=p∧˙q and q(p∧˙q)=(p∧˙q)q=p∧˙q. Also, then
[TABLE]
so that (p−p∧˙q)(q−p∧˙q)=0=(q−p∧˙q)(p−p∧˙q). Thus pq=qp=p∧˙q.
∎
5. Commuting projections
Now we shall present order theoretic replicas of Propositions 4.9 and 4.11.
Definition 5.1**.**
Let V be an ordered vector space. For u∈V+ we set
[TABLE]
If (V,e) is an order unit space, then u∈V+ is said to have the order unit property in V, if for any v∈Vu we have,
±v≤∥v∥u. In this case, (Vu,u) is also an order unit space and ∥v∥u=∥v∥e for each v∈Vu.
If (V,e) is an absolute order unit space, then u∈V+ is said to have the absolute order unit property in V, if for any
v∈Vu we have, ∣v∣≤∥v∥u. In this case, (Vu,u) is also an absolute order unit space and
∥v∥u=∥v∥e for each v∈Vu.
Definition 5.2**.**
Let (V,e,∣⋅∣) is an absolute order unit space. Consider the set
[TABLE]
Note that 0,e∈OP(V) and that e−p∈OP(V) if p∈OP(V). We shall write p′ for e−p∈OP(V).
Elements of OP(V) will be called order projections for the following reason.
Theorem 5.3**.**
Let A be a unital C∗-algebra. For a∈[0,1], these statements are equivalent:
- (1)
a* is a projection in A;*
2. (2)
a* is an extreme point of [0,1];*
3. (3)
a* has the order unit property in A;*
4. (4)
[0,a]∩[0,1−a]={0};
5. (5)
a⊥(1−a).
Proof.
Whereas the equivalence of (1) and (2) is a classical result of C*∗*-algebra theory, the
equivalence of (1) and (3) was observed in [8, Corollary 3.2 and Theorem 3.3]. Further, as
a and 1−a commute, the equivalence of (4) and (5) follows from [12, Proposition 4.1].
(1) implies (4): Assume that a2=a and let x∈[0,a]∩[0,1−a]. Then 0≤x≤a and
0≤x≤1−a. Thus
[TABLE]
so that (1−a)x(1−a)=0 and consequently, x=ax=xa=axa. Now as 0≤x≤1−a,
as above we get axa=0 so that x=0.
(4) implies (1): Finally, assume that [0,a]∩[0,1−a]={0}. As 0≤a≤1, we have
0≤a2≤a and consequently, 0≤a−a2≤a. Also,
[TABLE]
so that by assumption, a−a2=0. Thus a is a projection.
∎
Remark 5.4*.*
Note that a is a projection if and only if 1−a is also a projection. Thus we can replace a by 1−a
in (1), (2) and (3) of Theorem 5.3.
Throughout the section, V will be an absolute order unit space and OP(V) will denote the set of all order projections in V.
Proposition 5.5**.**
For p,q∈OP(V), the following statements are equivalent:
- (1)
p+q≤e;
2. (2)
p⊥q;
3. (3)
p+q∈OP(V), and
4. (4)
p⊥∞q.
Proof.
(1) implies (2): Let p+q≤e. Then 0≤p≤e−q so that p⊥q, by the definition.
(2) implies (4): By Proposition 3.6.
(4) imlies (1): Let p⊥∞q. Then ∥p+q∥=max{∥p∥,∣q∥}≤1 so that p+q≤e.
(1) implies (3): Let p+q≤e so that p≤e−q. As p,q∈OP(V), we have p⊥e−p and q⊥e−q. Now,
0≤e−(p+q)≤e−p and e−(p+q)≤e−q. Thus e−(p+q)⊥p and e−(p+q)⊥q. It follows from the additivity
of ⊥ that e−(p+q)⊥p+q so that p+q∈OP(V). Finally, (3) implies (1) by the definition of OP(V).
∎
Proposition 5.6**.**
Let u,v∈[0,e]. If u+v∈OP(V) with u⊥v, then u,v∈OP(V).
Proof.
Set p=u+v so that u⊥(p−u). Since p∈OP(V), we have p⊥(e−p). Since u≤p, we get u⊥(e−p). Now
by the additivity of ⊥, we get u⊥(e−u) so that u∈OP(V). Similarly, we can show that v∈OP(V).
∎
Corollary 5.7**.**
Let p,q∈OP(V) such that p≤q. Then q−p∈OP(V).
Proof.
Set q−p=r so that r∈[0,e]. Since 0≤r≤e−p and p⊥(e−p), we have p⊥r. Thus by Proposition 5.6,
r∈OP(V).
∎
Remark 5.8*.*
Let p,q∈OP(V) such that p≤q. Then p⊥(q−p).
Proposition 5.9**.**
Let u,v∈V. Then
- (1)
u∨˙v+u∧˙v=u+v;
2. (2)
u∨˙v−u∧˙v=∣u−v∣;
3. (3)
u−u∧˙v,v−u∧˙v∈V+; and
4. (4)
(u−u∧˙v)⊥(v−u∧˙v).
Proof.
The statements (1), (2) and (3) follow from the definitions of ∧˙ and ∨˙; and (4) follows from the fact that
[TABLE]
∎
Theorem 5.10**.**
Let V be an absolute order unit space and let p,q∈OP(V). Then the following statements are equivalent:
- (1)
p∧˙q∈OP(V).
2. (2)
p∨˙q∈OP(V).
3. (3)
p′∧˙q′∈OP(V).
4. (4)
p′∨˙q′∈OP(V).
Proof.
(1) implies (2): Let p∧˙q∈OP(V). By Proposition 5.9, p∧˙q≤p so that by Corollary 5.7,
p−(p∧˙q)∈OP(V). Now, (p∧˙q)+(p−p∧˙q)=p∈OP(V) so that by Proposition 5.5, we get
p∧˙q⊥(p−p∧˙q). Since (p−p∧˙q)⊥(q−p∧˙q) by Proposition 5.5, the
additivity of ⊥ yields, q⊥(p−p∧˙q). Again invoking Propositions 5.5 and 5.9, we may conclude that
p∨˙q=q+p−p∧˙q∈OP(V).
(2) implies (3): We have p′∧˙q′=e−(p∨˙q)∈OP(V), if p∨˙q∈OP(V).
Now, (3) implies (4) by step one and (4) implies (1) by step two.
∎
Theorem 5.11**.**
Let V be an absolute order unit space and let p,q∈OP(V). Then the following statements are equivalent:
- (1)
p∧˙q∈OP(V);
2. (2)
p* is absolutely compatible with q;*
3. (3)
p∧˙q,p∧˙q′∈OP(V).
Proof.
Note that
(3) is stronger than (1).
(1) implies (2): Let p∧˙q∈OP(V). Then by Theorem 5.10, p′∧˙q′∈OP(V). Now
[TABLE]
for p+p′=e,q+q′=e and p′−q′=e−p−e+q=q−p. Similarly,
[TABLE]
Since p∧˙q≤p and p′∧˙q′≤p′, and since p⊥p′, we have p∧˙q⊥p′∧˙q′.
Thus ∣p∧˙q−p′∧˙q′∣=p∧˙q+p′∧˙q′ so that ∣p+q−e∣=e−∣p−q∣.
(2) implies (3): Let ∣p−q∣+∣p−q′∣=e. Then
[TABLE]
Similarly, p∧˙q′∈V+. Further, as p∧˙q≤q, p∧˙q′≤q′ and q⊥q′, we get that
p∧˙q⊥p∧˙q′. Thus by Proposition 5.6, p∧˙q,p∧˙q′∈OP(V) for
[TABLE]
∎
Remark 5.12*.*
Let p,q∈OP(V) such that p∧˙q∈OP(V). Then r∧˙s,r∨˙s∈OP(V) whenever r,s∈{p,q,p′,q′}.
Proposition 5.13**.**
Let V be an absolute order unit space and let p,q∈OP(V). Then p∧˙q∈OP(V) if and only if ∣p−q∣∈OP(V) with ∣p−q∣≤p+q.
Proof.
First, let p∧˙q∈OP(V). Then p∨˙q∈OP(V) by Theorem 5.10. Also, p∧˙q≤p∨˙q with ∣p−q∣=p∨˙q−p∧˙q
by Proposition 5.9. Thus ∣p−q∣∈OP(V) by Corollary 5.7. Further, as p∧˙q≥0, we have ∣p−q∣≤p+q.
Conversely, let ∣p−q∣∈OP(V) with ∣p−q∣≤p+q. Then p∧˙q≥0 so that p∧˙q∈[0,e] for p∧˙q≤p≤e. Next, (p−p∧˙q)+(q−p∧˙q)=∣p−q∣∈OP(V). Also, by Proposition 5.9, we have
(p−p∧˙q)⊥(q−p∧˙q). Thus by Proposition 5.6, we get that (p−p∧˙q)∈OP(V). Since p∧˙q≥0,
we have (p−p∧˙q)≤p. Thus by Corollary 5.7, we have p∧˙q=p−(p−p∧˙q)∈OP(V).
∎
Theorem 5.14**.**
Let V be an absolute order unit space and let p,q∈OP(V) with p∧˙q∈OP(V). Then infOP(V){u,v} exists and is equal to
p∧˙q.
Proof.
Let r≤p and r≤q for some r∈OP(V). Then r⊥p′ and r⊥q′. Thus by the additivity of ⊥, we get
r⊥(p′+q′). Since p∧˙q∈OP(V), we have p′∧˙q′,p′∨˙q′∈OP(V)
by Theorem 5.10. Thus using Proposition 5.9, we see that 0≤p′∨˙q′=p′+q′−(p′∧˙q′)≤p′+q′ so that r⊥(p′∨˙q′). As r,p′∨˙q′∈OP(V), by Proposition
5.5, we have r+p′∨˙q′≤e. But p′∨˙q′=e−(p∧˙q) so that r≤p∧˙q.
Now as p∧˙q≤p,q, we conclude that infOP(V){u,v} exists and is equal to p∧˙q.
∎
Corollary 5.15**.**
Let V be an absolute order unit space and let p,q∈OP(V) with p∨˙q∈OP(V). Then supOP(V){p,q} exists and is equal to
p∨˙q.
Proposition 5.16**.**
Let V be an absolute order unit space and let p,q∈OP(V) with p∧˙q∈OP(V)
so that r=∣p−q∣∈OP(V). Then the set S:={0,e,p,q,r,p′,q′,r′} is closed under the binary operation (u,v)↦∣u−v∣.
Proof.
Since p∧˙q∈OP(V), we have that ∣e−p−q∣=e−∣p−q∣=e−r and
that p∧˙q′,p′∧˙q,p′∧˙q′∈OP(V).
Also p∧˙q+p∧˙q′=p. Since p∧˙q≤q and since
p∧˙q′≤q′, we have p∧˙q⊥p∧˙q′
so that ∣p∧˙q−p∧˙q′∣=p∧˙q+p∧˙q′=p. also
[TABLE]
so that p=∣q−r∣. Now, by symmetry we can get q=∣p−r∣. In a similar way,
we can calculate ∣u−v∣ for any u,v∈S to complete the proof.
∎
6. Expanding the scope
In this section, we shall examine absolute compatibility of an order projection with a general positive element. First we note that
order projections in an absolute order unit space have the following ‘norming’ property.
Proposition 6.1**.**
Let V be an absolute order unit space.
- (1)
If p∈OP(V), then p has the absolute order unit property in V. Dually, e−p also has the absolute order unit property in V.
2. (2)
*Let u∈[0,e] and assume that u and e−u have the absolute order unit property in V. Then u⊥∞a(e−u). *
Proof.
(1): First, assume that p∈OP(V). Let kp±v∈V+ for some k>0. Set v1=21(kp+v) and v2=21(kp−v). Then
v1,v2∈V+ with v1−v2=v and v1+v2=kp. As p∈OP(V), we have p⊥(e−p) and consequently, v1⊥(e−p) and
v2⊥(e−p). Thus ∣v∣=∣v1−v2∣⊥(e−p). Since V is an absolute order unit space, we further have ∣v∣⊥∞a(e−p) so that ∥∥∣v∣∥−1∣v∣+(e−p)∥=1. Now, for f∈S(V), we have
[TABLE]
Thus f(p−∥v∥−1∣v∣)≥0 for all f∈S(V) so that ∣v∣≤∥v∥p. In other words, p has the absolute order unit property
in V.
(2): Conversely, let u∈[0,e] and assume that u and e−u have the (absolute) order unit property in V. Let 0≤v≤u and 0≤w≤e−u.
By the order unit property of u and e−u we have v≤∥v∥u and w≤∥w∥(e−u). Thus
[TABLE]
so that ∥∥v∥−1v+∥w∥−1w∥≤1. Now
[TABLE]
so that u⊥∞a(e−u).
∎
Remark 6.2*.*
- (1)
Let an absolute order unit space (V,e) satisfy (O.⊥∞.2). Then p∈OP(V) if and only if p∈[0,e] and both p and e−p satisfy the
absolute order unit property.
2. (2)
Let (V,e) be an order unit space and let u∈V+ has the order unit property in V. Then (Vu,u) is an order unit space. In this case,
u and e determine the same norm in Vu.Thus (Vu,u) is an ‘order unit ideal’ of V.
3. (3)
Let (V,e) be an absolute order unit space and assume that u∈V+ has the absolute order unit property in V. Then (Vu,u) is an
absolute order unit space. In particular, if p∈OP(V), then (Vp,p) is an absolute order unit space and in this case,
[TABLE]
Proposition 6.3**.**
Let (V,e) be an order unit space and let u∈[0,e]. If u has the order unit property in V, then
it is an extreme point in [0,e].
Proof.
Let u=αv+(1−α)w for some v,w∈[0,e] and 0<α<1. Then 0≤αv≤u. Since u has the order unit property in V, we get, v≤∥v∥u≤u. Similarly,
0≤w≤u. Set u−v=v1 and u−w=w1. Then
[TABLE]
Since V+ is proper and 0<α<1, we get v1=0=w1 so that v=u=w.
∎
The absolute compatibility between an order projection p∈OP(V) and an arbitrary element u∈[0,e] is related to
Vp+Vp′ which we describe below.
Let (V1,e1) and (V2,e2) be any two absolute order unit spaces. Consider
[TABLE]
Then (V,e) becomes an absolute order unit space in a canonical way. Further, V is unitally and
isometrically order isomorphic to V1⊕∞V2.
Proposition 6.4**.**
Let (V,e) be an absolute order unit normed space and let p,q∈OP(V) with p+q≤e. Then
Vp+Vq is an absolute order smooth ∞-normed subspace of (V,e) and is isometrically
order isomorphic to Vp⊕∞Vq. In particular,for x∈Vp and y∈Vq, we have
(x+y)+=x++y+ and (x+y)−=x−+y− so that ∣x+y∣=∣x∣+∣y∣.
Proof.
Let u∈Vp and v∈Vq. Then u+,u−∈Vp+ and v+,v−∈Vq+. As p+q≤e,
we have p⊥∞aq and consequently, we may conclude that u+,u−,v+ and v− are
absolutely ∞-orthogonal to each other. Now, by the additivity, we have (u++v+)⊥∞a(u−+v−). Thus as u+v=(u++v+)−(u−+v−), we get that (u+v)+=u++v+;(u+v)−=u−+v− so that ∣u+v∣=∣u∣+∣v∣. Therefore, Vp+Vq
is an absolute ordered space. It also follows that Vp∩Vq={0}. Finally, for u∈Vp and
v∈Vq we note that
[TABLE]
which completes the proof.
∎
Theorem 6.5**.**
Let (V,e) be an absolute order unit normed space and let
p,q∈OP(V) with p+q≤e. Then for w∈V, the following statements are equivalent:
- (1)
w∈Vp++Vq+* with ∥w∥≤1;*
2. (2)
w=p∧˙w+q∧˙w;
3. (3)
∣p−w∣+∣q−w∣=p+q.
Proof.
(1) implies (2): Let w∈Vp++Vq+ with ∥w∥≤1. By Proposition 6.4, there exists
a unique pair wp∈Vp+ and wq∈Vq+ such that w=wp+wq. As ∥w∥≤1,
we get that wp≤p and wq≤q so that 0≤p−wp≤p. Since p+q≤e, we have
p⊥∞aq and consequently, (p−wp)⊥∞awq. Thus
[TABLE]
Therefore,
[TABLE]
Similarly, q∧˙w=wq so that w=p∧˙w+q∧˙w.
(2) implies (3): Let w=p∧˙w+q∧˙w. Then
[TABLE]
so that ∣p−w∣+∣q−w∣=p+q.
(3) implies (1): Finally, let ∣p−w∣+∣q−w∣=p+q. Consider the ⊥∞a-
decompositions p−w=u1−u2 and q−w=v1−v2 in V+. Then ∣p−w∣=u1+u2 and ∣q−w∣=v1+v2. Now it follows that
[TABLE]
and
[TABLE]
Therefore, w=u2+v2 and consequently, p=u1+v2 and q=v1+u2. Now, as
0≤v2≤p and 0≤u2≤q, we have w∈Vp++Vq+. Further as p⊥∞aq, we have u2⊥∞av2. Thus
[TABLE]
∎
Remark 6.6*.*
It follows from the proof of Theorem 6.5 that if p,q∈OP(V) with p+q≤e and if
w∈Vp++Vq+ with ∥w∥≤1, then the p and q “components” of w are
p∧˙w and q∧˙w respectively. More generally, if w∈Vp++Vq+, then
the p and q “components” of w are (kp)∧˙w=(∥w∥p)∧˙w and
(kq)∧˙w=(∥w∥q)∧˙w respectively for any k≥∥w∥.
We shall write AC(p):=Vp+Vp′ so that AC(p)+:=(Vp+Vp′)∩V+=Vp++Vp′+.
Corollary 6.7**.**
Let (V,e) be an absolute order unit normed space, p∈OP(V) and u∈[0,e]. Then u is absolutely compatible with p if and only if
u∈AC(p)+.
Proposition 6.8**.**
Let (V,e) be an absolute order unit normed space, p∈OP(V) and u∈[0,e] and assume that
u is absolutely compatible with p. Then
- (1)
inf{u,p}* exists in [0,e] and is equal to u∧˙p; and*
2. (2)
sup{u,p}* exists in [0,e] and is equal to u∨˙p.*
Proof.
(1): By the definition, we have u∧˙p≤u and u∧˙p≤p. As u is absolutely compatible
with p, we have u∧˙p,u∧˙p′∈V+ with u=u∧˙p+u∧˙p′.
Next, let w∈V+ such that w≤u and w≤p. Then w∈Vp+. Also, u∧˙p∈Vp+
so that u∧˙p−w∈Vp. Further u∧˙p′∈Vp′+. Thus by Theorem 6.5,
we get
[TABLE]
so that u∧˙p−w=∣u∧˙p−w∣∈V+. Hence u∧˙p=inf{u,p}.
(2): As u is absolutely compatible with p, we have e−u is absolutely compatible with e−p. Thus as in (1), we may
conclude that (e−u)∧˙(e−p)=inf{e−u,e−p}. Now it follows that
[TABLE]
∎
Theorem 6.9**.**
Let (V,e) be an absolute order unit normed space and let p∈OP(V). Then for u1,…,un∈AC(p)+, we have
[TABLE]
and
[TABLE]
Proof.
First, let u1,u2∈AC(p)+ with ∥ui∥≤1,i=1,2 and assume that α∈[0,1]. Then by Corollary 6.7,
we have ui=ui∧˙p+ui∧˙p′ with ui∧˙p,ui∧˙p′∈V+ for
i=1,2. Thus
[TABLE]
for
[TABLE]
[TABLE]
and p⊥∞ap′. On simplifying, we get
[TABLE]
Now it follows that
[TABLE]
and that
[TABLE]
By a standard technique, now we can now show that this fact also holds for n elements: For u1,…,un∈AC(p)+ with
∥ui∥≤1,i=1,…,n and positive real numbers α1,…,αn with ∑i=1nαi=1, we have
[TABLE]
and
[TABLE]
Finally, let u1,…,un∈AC(p)+∖{0}. Set wi=∥ui∥−1ui so that ∥wi∥=1,i=1,…,n.
Then for k=∑i=1n∥ui∥, using (!), we get
[TABLE]
which proves (1). Similarly, using (!!), we may get (2).
∎
Let (V,e) be an absolute order unit normed space and let
{pi:i∈I}⊂OP(V). We shall write AC(pi;i∈I) for ∩i∈IAC(pi).
Theorem 6.10**.**
Let (V,e) be an absolute order unit normed space and let v∈AC+(p,q) for some p,q∈OP(V) such that p+q≤e.
Set r=e−p−q so that r∈OP(V). Then v∈AC+(r) and v=v∧˙p+v∧˙q+v∧˙r.
Proof.
We may assume that ∥v∥≤1. As v∈AC+(p), we have
(i)v=v∧˙p+v∧˙p′.
Now, p≤e−q=q′ so that v∧˙p∈Vp+⊂Vq′⊂AC+(q). Also, v∈AC+(q)
so that v∧˙p′=v−v∧˙p∈AC(q). But v∧˙p′∈V+ so that v∧˙p′∈AC+(q). As ∥v∧˙p′∥≤∥v∥≤1 we get
(ii)v∧˙p′=(v∧˙p′)∧˙q+(v∧˙p′)∧˙q′.
We show that (v∧˙p′)∧˙q=v∧˙q. We have
[TABLE]
Now, as 0≤(v∧˙p′)∧˙q≤q, we have 0≤q−(v∧˙p′)∧˙q≤q. Thus, as
0≤v∧˙p≤p, 0≤(v∧˙p′)∧˙q′≤q′, q⊥p and q⊥q′; we get
{q−(v∧˙p′)∧˙q′}⊥v∧˙p and {q−(v∧˙p′)∧˙q′}⊥(v∧˙p′)∧˙q′. Now, by the additivity of ⊥, we get {q−(v∧˙p′)∧˙q′}⊥{v∧˙p+(v∧˙p′)∧˙q′}. Thus
[TABLE]
so that
[TABLE]
Thus by (i) and (ii), we have
(iii)v=v∧˙p+v∧˙q+(v∧˙p′)∧˙q′.
Now, interchanging p and q, we may conclude that
(iv)(v∧˙p′)∧˙q′=(v∧˙q′)∧˙p′.
Finally, we shall show that (v∧˙p′)∧˙q′=v∧˙r. Let us quickly note that v∧˙p≤p and
v∧˙q≤q so that v∧˙p+v∧˙q∈Vp+q+. Also, (v∧˙p′)∧˙q′≤p′
and (v∧˙p′)∧˙q′≤q′ so that (v∧˙p′)∧˙q′≤p′∧˙q′=(p+q)′=r. Thus (v∧˙p′)∧˙q′∈Vr+. Now, it follows from (iii) that
v∈AC+(r). Therefore,
(v)∣v−r∣+∣v+r−e∣=e.
Now,
[TABLE]
for 0≤(p−v∧˙p)+(q−v∧˙q)≤p+q and 0≤(v∧˙p′)∧˙q′≤(p+q)′. Thus
[TABLE]
Putting it in (iii), we get the result.
∎
Corollary 6.11**.**
Let (V,e) be an absolute order unit normed space and let w∈AC+(p,q) for some p,q∈OP(V).
- (1)
If p+q≤e, then w∈AC+(q+p).
2. (2)
If p≤q, then w∈AC+(q−p).
Remark 6.12*.*
Let (V,e) be an absolute order unit normed space and let
w∈AC+(pi;1≤i≤n) for some p1,…,pn∈OP(V). The results of Corollary 6.11
may be generalized in the following way.
- (1)
If p=p1+⋯+pn≤e so that p∈AP(V) and that p1,…,pn,p′ are
mutually ⊥∞a-orthogonal, we have w∈Vp1++Vp2++⋯+Vpn++Vp′+ and w∈AC+(∑i∈Ipi) whenever I⊂{1,…,n}.
2. (2)
If p1≤…,≤pn, then w∈Vp1++Vp2−p1++⋯+Vpn−pn−1++Vpn′+ and w∈AC+(pi+k−pi) whenever 1≤i,k≤n with i+k≤n.
Also, in this case, p1,p2−p1,…,pn−pn−1,pn′∈OP(V) are mutually
⊥∞a-orthogonal.
7. Spectral family of order projections
In this section we shall discuss spectral family of order projections for an element in an
absolute order unit space (V,e). For this purpose, we need the following concept.
7.1. A hypothesis for OP(V)
In general, a C*∗*-algebra may not have sufficiently many projections. However, in a von
Neumann algebra M, OP(M) always covers Msa in the following sense.
Definition 7.1**.**
Let (V,e) be an absolute order unit space. We say that p∈OP(V) covers an element v∈V,
if v∈Vp and Vp⊂Vq whenever v∈Vq.
In other words, p exists as the least element (with respect to OP(V)) in the set
[TABLE]
We say that OP(V) covers V, if every element v∈V has a cover in OP(V) and p1⊥∞ap2 whenever pi is the cover of vi∈V+ in OP(V) for i=1,2 with
v1⊥∞av2.
The covering property also determines a lattice structure in OP(V).
Proposition 7.2**.**
Let (V,e) be an absolute order unit space in which OP(V) covers V. Then OP(V) is a lattice in
the order structure of V restricted to OP(V).
Proof.
Let p1,p2∈OP(V) and let p∈OP(V) be the cover of p1+p2. Then p1+p2≤∥p1+p2∥p
so that p1≤p1+p2≤∥p1+p2∥p. Now, by the order unit property of p, we get
p1≤∥p1∥p≤p. Similarly we can show that p2≤p. Next, let pi≤q,i=1,2
for some q∈OP(V). Then pi⊥∞aq′,i=1,2 so that p1+p2⊥∞aq′
by the additivity of ⊥∞a. Now by Lemma 4.5, p1+p2≤∥p1+p2∥q.
Since p covers p1+p2, we get p≤q. Thus p=sup{p1,p2}. Next, as p1′,p2′∈OP(V), we have r=sup{p1′,p2′}∈OP(V). Now, by a well
known trick, we can show that inf{p1,p2}=r′. Hence OP(V) is a lattice.
∎
7.2. Construction of a spectral family
Definition 7.3**.**
Let (V,e) be an absolute order unit normed space and let p∈OP(V). Then every v∈AC(p) has a unique decomposition
[TABLE]
where vp∈Vp and vp′∈Vp′. This decomposition will be referred as
the p-decomposition of v and we shall write vp=Cp(v) and vp′=Cp′(v) for all v∈AC(p). In particular, for v∈AC(p)+, we have Cp(v)=w∧˙(∥w∥p)
for all p∈OP(V). By Proposition 6.4, Cp:AC(p)→Vp is a
∣⋅∣-preserving surjective linear projection of norm one. Further, Cp+Cp′ is
the identity operator on AC(u).
Proposition 7.4**.**
Let (V,e) be an absolute order unit space. If
p,q∈OP(V) with p≤q, then Cp,Cq,Cp′ and Cq′ commute mutually
when restricted to AC(p,q). In this case, CpCq=Cp and consequently, CpCq′=0, Cp′Cq=Cq−Cp and Cp′Cq′=Cq′ on AC(p,q).
Proof.
Let u∈AC(p,q). Then
[TABLE]
As p≤q, we have Vp⊂Vq⊂OC(q). Thus Cp(u)∈AC(q) and consequently,
Cp′(u)=u−Cq(u)∈OC(q). Now as AC(p′)=AC(p),AC(q′)=AC(q)
and q′≤p′ (for p≤q), we may conclude, by the dual arguments, that
Cp(u),Cq(u),Cp′(u),Cq′(u)∈AC(p,q) whenever u∈AC(p,q).
Next, note that for u∈AC(p,q) we have Cp(u)∈Vp⊂Vq so that Cq(Cp(u))=Cp(u). Dually, Cp′(Cq′(u))=Cq′(u) so that CqCp=Cp and
Cp′Cq′=Cq′ on AC(p,q). Now, if we recall that Cp′=I−Cp
and that Cq′=I−Cq on AC(p,q) where I is the identity operator on AC(p,q), the
remaining facts can be verified in a routine way.
∎
Throughout this subsection, we shall assume that (V,e) is an absolute order unit space in which OP(V)
covers V unless stated otherwise. We fix the following notations. Let v∈V and α∈R. We write
cp±(v,α) for the cover of (v−αp)± in OP(V) respectively, for any p∈OP(V). For
p=e, we shall simply write c±(v,α). Thus c+(v,α)⊥c−(v,α). When
α=0, we shall simply write c±(v) for c±(v,0). Also as (−v,−α)+=(v,α)−,
we have, c+(−v,−α)=c−(v,α).
Let c(v) be the cover of v in OP(V). Then
[TABLE]
and
[TABLE]
Thus
[TABLE]
and
[TABLE]
Now, it follows that
[TABLE]
and
[TABLE]
In a similar manner, we can further conclude that
[TABLE]
and
[TABLE]
Remark 7.5*.*
- (1)
For v∈V+, c+(v,α)=e whenever α<0. Dually, c−(v,α)=e
whenever v∈−V+ and α>0.
2. (2)
For v∈V+, c−(v,α)=0 whenever α≤0. Dually, c+(v,α)=0
whenever v∈−V+ and α≥0.
Now we prove some results which show that {c−(v,α):α∈R} and
{c+(v,α)′:α∈R} are “spectral” families of projections for v.
Proposition 7.6**.**
For v∈V,
the family {c−(v,α),c+(v,α):α∈R} has the following properties:
- (1)
For α<β, c−(v,α)≤c−(v,β) and c+(v,α)≥c+(v,β).
2. (2)
For α≤−∥v∥, c−(v,α)=0 and for α≥∥v∥, c+(v,α)=0.
3. (3)
For α>∥v∥, c−(v,α)=e and for α<−∥v∥, c+(v,α)=e.
4. (4)
v∈AC(c−(v,α),c+(v,α);α∈R).
5. (5)
Cα−(v)≤αc−(v,α)* and Cα−′(v)≥αc−(v,α)′; Cα+(v)≥αc+(v,α) and Cα+′(v)≤αc+(v,α)′ for each α∈R. Here Cα±:=Cc±(v,α).*
Proof.
Since c+(v,α)=c−(−v,−α), we need to prove results only related to c−(v,α).
(1). Let α<β and set λ=β−α>0. Put vβ=v−βe so
that
c−(v,β) is the cover of vβ−. As vβ−⊥∞avβ+, we
see that vβ+⊥∞ac−(v,β). Thus
[TABLE]
Therefore, c−(v,α)≤c−(v,β), if α<β.
(2). Let α≤−∥v∥. Then v−αe∈V+ so that (v−αe)−=0. Thus
c−(v,α)=0.
(3). Let α>∥v∥. Set k=(α−∥v∥)>0. Then
[TABLE]
As k>0, we conclude that e∈Vc−(v,α)+. Thus e≤c−(v,α) and consequently,
c−(v,α)=e.
(4). Fix α∈R. Then
[TABLE]
If α>0, then c−(v,α)=uˉα−+c(v)′ and c+(v,α)=uˉα+. As uˉα−,uˉα+ and c(v)′ are mutually absolutely
∞-orthogonal with uˉα−+uˉα++c(v)′≤e, we get that
uˉα+≤c−(v,α)′. Thus Vuˉα++Vuˉα−+Vc(v)′⊂Vc−(v,α)+Vc−(v,α)′ whence v−αe∈AC(c−(v,α)). As e∈AC(c−(v,α)) and as the later is a subspace of V, we further
conclude that v∈AC(c−(v,α)). The other cases may be proved in a similar way.
(5). Let α∈R. Then Cα−(v−αe)=−(v−αe)− and
Cα−(e)=c−(v,α). Thus Cα−(v)=−(v−αe)−+αc−(v,α)≤αc−(v,α). We can prove the other statements In a similar manner.
∎
Theorem 7.7**.**
Let v∈AC(p) for some p∈OP(V). Then for any α∈R, both c+(v,α) and c−(v,α) are absolutely compatible with p.
Proof.
First, let v∈V+ and α≥0. As v∈AC+(p), we have v=Cp(v)+Cp′(v)
with Cp(v)∈Vp+ and Cp′∈Vp′. Thus
[TABLE]
Also
[TABLE]
and
[TABLE]
Thus (Cp(v)−αe)+⊥∞a(Cp′(v)−αe)+ so that
c+(Cp(v),α)⊥∞ac+(Cp′(v),α) with c+(Cp(v),α)+c+(Cp′(v),α)=c+(v,α). Since c+(Cp(v),α)∈Vp+ and
c+(Cp′(v),α)∈Vp′+, we further see that c+(Cp(v),α)≤c+(v,α)∧p and that c+(Cp′(v),α)≤c+(v,α)∧p′. Thus
[TABLE]
Now, it follows that c+(v,α)∈AC+(p) and that c+(Cp(v),α)=c+(v,α)∧p
and c+(Cp′(v),α)=c+(v,α)∧p′. Now, as c+(v,α)=e
whenever v∈V+ and α<0, we get that c+(v,α)∈AC+(p) for any
v∈AC+(p) and α∈R. Now, since v−αe=(v+∥v∥e)−(α+∥v∥)e and (v+∥v∥e)∈AC+(p) whenever v∈AC(p), we further
conclude that c+(v,α)∈AC+(p) whenever v∈AC(p) and α∈R. Finally, as
c−(v,α)=c+(−v,−α), the result holds.
∎
Proposition 7.8**.**
Assume that
v∈AC(p) for some p∈OP(V) and that α∈R. Then Cp(v)≤αp and
Cp′(v)≥αp′ if and only if c−(v,α)≤p≤c+(v,α)′.
Also in this case, Cp(v−αe)=−(v−αe)− and Cp′(v−αe)=(v−αe)+.
Proof.
Find v1 and v2 in V+ such that Cp(v)+v1=αp and Cp′(v)−v2=αp′. Then v1∈Vp+ and v2∈Vp′+ so that v1⊥∞av2. Next, as v∈AC(p), we have
[TABLE]
Thus v−αe=v2−v1 and consequently, v2=(v−αe)+ and v1=(v−αe)−
for v2⊥∞av1. Now it follows that
[TABLE]
and
[TABLE]
Further, we see that (v−αe)+∈Vp′+ and that (v−αe)−∈Vp+. Thus
c+(v,α)≤p′ and c−(v,α)−≤p so that c−(v,α)≤p≤c+(v,α)′.
Conversely, assume that c−(v,α)≤p≤c+(v,α)′. Then by Proposition 7.4,
Cα+′Cp=Cp=CpCα+′ and Cα−′Cp′=Cp′=Cp′Cα−′. Thus
[TABLE]
so that Cp(v)≤αp and
[TABLE]
so that Cp′(v)≥αp′.
∎
Proposition 7.9**.**
Let (V,e) be a monotone complete absolute order unit space in which OP(V) covers V and let
v∈V. Set eα=c+(v,α)′ for each α∈R. Then ∧α>α0eα=eα0 for each α0∈R.
Proof.
First note that ∧α>α0eα exists in V as the later is monotone complete. We write
∧α>α0eα=v0 so that v0∈[0,e]. Let e0∈OP(V) be the cover of v0.
Then v0≤e0. Now, by the definition of the cover, e0≤eα for each α>α0 as
v0≤eα for such α. Thus e0≤v0 and we have e0=∧α>α0eα∈OP(V).
Also, then eα0≤e0≤eα if α>α0. Fix α>α0.
Then Ce0Ceα=CeαCe0=Ce0 so that
[TABLE]
Thus Ce0(v)≤α0e0. Similarly, as eα0≤e0, we have e0′≤eα0′.
Thus as above, we may get that Ce0′(v)≥α0e0′. Now, applying Proposition 7.8,
we can conclude that e0=c+(v,α0)′:=eα0.
∎
Theorem 7.10** (Spectral Resolution).**
Let (V,e) be a monotone complete absolute order unit space in which OP(V) covers V and let
v∈V. Then there exists a unique family {eα:α∈R}⊂OP(V) such that
- (1)
{eα:α∈R}* is increasing;*
2. (2)
eα=0* if α<−∥v∥ and eα=e if α≥∥v∥;*
3. (3)
v∈OC(eα;α∈R);
4. (4)
Ceα(v)≤αeα* and Ceα′(v)≥αeα′
for each α∈R;*
5. (5)
If v∈AC(p) for some p∈OP(V) and if Cp(v)≤αp and Cp′(v)≥αp′,
then p≤eα;
6. (6)
∧α>α0eα=eα0* for each α0∈R.*
Proof.
Set eα=c+(v,α)′ for each α∈R. Then (1), (2) and (3) follow from
Proposition 7.6; (4) and (5) follow from Proposition 7.8 and (6) follows from Proposition 7.9.
Conversely, assume that a family {eα:α∈R}⊂OP(V) satisfies conditions (1) – (6). Then
by Proposition 7.8, condition (4) yields c−(v,α)≤eα≤c+(v,α)′ and condition (5) yields
c+(v,α)′≤eα for each α∈R. This completes the proof.
∎
Definition 7.11**.**
Let (V,e) be a monotone complete absolute order unit space in which OP(V) covers V and let v∈V.
Then an increasing family {eα:α∈R}⊂OP(V) is called the spectral resolution of v in
OP(V) if the family satisfies conditions (1) – (6) of Theorem 7.10.
Theorem 7.12** (Spectral Decomposition).**
Let (V,e) be a monotone complete absolute order unit space in which OP(V) covers V and let v∈V.
Consider the spectral resolution {eα:α∈R} of v in OP(V). Then for any ϵ>0
and a finite increasing sequence α0<⋯<αn with α0<−∥v∥,αn>∥v∥ and
max{αi−αi−1:1≤i≤n}<ϵ, we have
[TABLE]
Proof.
Let α<β. Then eα≤eβ so that by Proposition 7.5(5), we get
[TABLE]
As Cα′ and Cβ are positive operators on OC(eα,eβ), we
get
[TABLE]
Since α<β, by Proposition 7.4, we see that
[TABLE]
and
[TABLE]
Thus we obtain
[TABLE]
Applying this for β=αi and α=αi−1, where 1≤i≤n and adding
together, we get
[TABLE]
Now, eαn=e and eα0=0 so that Cαn(v)=v and Cα0(v)=0. Also, (eαi−eαi−1)⊥∞a(eαj−eαj−1) if
i=j so that
[TABLE]
Thus
[TABLE]
∎