Lecture Notes On C - Algebras and K-Theory: N.P. Landsman
Lecture Notes On C - Algebras and K-Theory: N.P. Landsman
Lecture Notes On C - Algebras and K-Theory: N.P. Landsman
-algebras
and their associated K-groups in the light of noncommutative geometry. Part I is an introduc-
tion to C*-algebras, covering the philosophy of noncommutative geometry, Banach algebras and
C*-algebras, commutative C*-algebras, the original Gelfand-Naimark duality theorem, categories
and functors, natural transformations and equivalence of categories, the categorical version of
the Gelfand-Naimark duality theorem, the GNS-construction, the Gelfand-Naimark representa-
tion theorem, ideals and compact operators, the structure of nite-dimensional C
-algebras, and
applications to groupoids. Part II is an introduction to the K-theory of C*-algebras, covering
projections in C*-algebras, the denition of K
0
, vector bundles and topological K-theory, K
0
for nonunital C*-algebras, some explicit computations, properties of C*-algebraic K-theory (half-
exactness, excision, etc.), higher K-groups, the index map, and Bott periodicity.
0
Draft: December 14, 2003
2
1 Introduction
Noncommutative geometry was created by Alain Connes around 1980 in an eort to relate the
theory of algebras of operators on Hilbert spaces to dierential geometry and algebraic topology.
For example, one of his goals was to generalize the famous index theorems of Atiyah and Singer
to the setting of foliated manifolds. More generally, noncommutative geometry turned out to
be a powerful tool for the study of singular spaces. This program has eventually led to a huge
edice, described in [3]. Conness book is very advanced, partly because the underlying theory is
dicult, and also because his examples typically come from the frontiers of mathematics. Thus
many parts of [3] are dicult even for experts in noncommutative geometry. As an example of a
good introductory text, we mention [8].
Noncommutative geometry relies on a certain technical apparatus, which includes homological
algebra and the theory of C
: C(Y )
C(X) as the pullback, that is, for f C(Y ) one puts
E over X by
E = E
Y
X := (v, x) E X [ (v) = (x),
with projection (v, x) x. Thus a generator [E] of K
0
(Y ) is mapped into a generator [
E] of
K
0
(X), and since the pullback construction preserves direct sums, this induces a homomorphism
: K
0
(Y ) K
0
(X). For compact Hausdor spaces, the so-called topological K-theory K
0
(X)
(due to Atiyah and Hirzebruch) is an important example of the general strategy of algebraic
topology.
Here again, it should be possible to dene K
0
(X) in terms of C(X). This may indeed be done.
First, dene M
(C(X)) as the collection of all innite matrices with a nite number of entries in
C(X). This is an algebra through the usual matrix multiplication rule, where one now multiplies
functions within C(X) (i.e., pointwise). Dene an idempotent in M
(C(X)) as an element e
satisfying e
2
= e. Two idempotents can be added, like any two elements of M
(C(X)), but in
addition there is an operation of direct sum, viz.
e f =
_
e 0
0 f
_
.
We now dene an equivalence relation among all idempotents in M
(C(X)) by |f| :=
sup
xX
|f(x)|
n
, where | |
n
is the usual norm on M
n
(C):
|a|
n
= sup|az|, z C
n
, |z| = 1, (1)
4
Unless X is contractible.
5
Note that M
:= sup[f(x)[ [ x X,
in which it is a Banach space. This Banach space structure of C(X) is compatible with its structure
as commutative algebra by the property
|fg|
|f|
|g|
. (2)
Secondly, C(X) has an involution f f
, given by f
f| = |f|
2
. (3)
We summarize these properties by saying that C(X) is a commutative C
-algebra
A with unit is isomorphic to C(X) for some compact Hausdor space X. The isomorphism is
constructed as explained above: one takes X := (A), which turns out to be a compact Hausdor
space, and the map A C(X) is the so-called Gelfand transform a a, where a() := (a). It
is typical of commutative C
:= : A C on A.
Moreover, C and are inverses to each other up to isomorphism, that is, (C(X))
= X (as we
have seen), and C((A))
= A for any compact Hausdor space X and any unital commutative
C
-algebra A.
We now come to the third and decisive step of noncommutative geometry: whenever a def-
inition or construction works for commutative C
-algebras. The rst thing to do here is to make sense of the notion of a noncommutative
C
-algebra itself: this simply consists of omitting the word commutative in the denition of a
commutative C
-algebra! Thus a C
ij
= a
ji
(see Exercises). This is a special case of A = B(H),
the algebra of all bounded operators on a Hilbert space H (cf. the Appendix below), which is a
C
-algebra in the usual operator norm (83) and the usual adjoint or Hermitian conjugate as the
involution, i.e., (z, a
w) = (az, w).
6
Furthermore, any subalgebra of B(H) that is closed in the
norm-topology and closed under Hermitian conjugation is obviously a C
-algebra as well.
6
Here ( , ) is the inner product on H (taken linear in the second entry).
5
Similar to their characterization of commutative C
:= (a
. Then A acts on H
by means of
: A B(H
), given
by
(a)b := ab.
8
It is easy to see that
is injective: if
= (a
is a homomorphism of C
(a)
(b)c =
(a)bc = abc =
(ab)c
for all c, which implies
(a)
(b) =
(A) B(H
).
9
In general
A may not possess such strictly positive functionals, but it always has suciently many states.
For an arbitrary state the Hilbert space H
-algebras, whereas in general one deals with operators on a Hilbert space. This
unies part of point-set topology with functional analysis in a nontrivial way. Conness main idea
was to rst reformulate the constructions of algebraic topology and dierential geometry in terms
of commutative C
-
algebras. Since the latter are typically noncommutative, this explains the word noncommutative
in noncommutative geometry.
We have, in fact, already seen one such generalization, since the denition of K
0
(C(X)) may
be generalized to any (unital) C
on B(H) by
-subalgebra
of the algebra B(H) of all bounded operators on a Hilbert space H that contains the unit 1 and is
closed (i.e., sequentially complete) in the weak operator topology. This means that M is a unital
subalgebra of B(H) under operator mulitplication, that M is closed under the involution a a
,
and that if for some sequence a
n
M one has [(v, (a
n
a)w)[ 0 for all v, w H, then a M.
For example, B(H) is itself a von Neumann algebra. When H is nite-dimensional, any direct sum
of matrix algebras containing 1 is a von Neumann algebra.
Such a ring of operators is automatically closed also in the norm-topology, so that a von
Neumann algebra is a C
-algebras
Our rst goal is to prove a slight generalization of the rst theorem of Gelfand and Naimark quoted
above:
Theorem 2.1 Every commutative C
-algebra A is isomorphic to C
0
(X) for some locally compact
Hausdor space X. Here C
0
(X) is seen as a C
:= sup[f(x)[ [ x X,
and the involution f
(x) = f(x).
To explain the formulation of this theorem, we should clarify two issues. Firstly:
20
The passage from the unit vector v to the projection [v] loses the phase information in v, but this information
drops out of the expectation values (v, av) dened by v anyway.
8
Denition 2.2 A morphism between C
) = (a)
(5)
for all a, b A. An isomorphism is a bijective morphism. Two C
-algebra),
while an injective morphism (and hence an isomorphism) is automatically isometric. We will prove
this at a later stage; see section 10. For this reason the condition that an isomorphism be isometric
is not included in the denition. As a trivial example of this denition, note that the C
-algebra
given by all 2 2 matrices of the form
_
a 0
0 a
_
, a C,
is isomorphic to C.
Secondly, recall that a space X is called locally compact when each point has a compact
neighbourhood.
Denition 2.3 Let X be a locally compact Hausdor space X. The space C
0
(X) consists of all
continuous functions on X that vanish at innity in the sense that for each > 0 there is a
compact subset K X such that [f(x)[ < for all x outside K.
So when X is compact one trivially has C
0
(X) = C(X). When X is not compact, the sup-norm
can still be dened, as C
0
(X) C
b
(X), and just as for C(X) one easily checks that C
0
(X) is a
commutative C
(x) := f(x), but note that this norm does not satisfy (94), so that L
1
(R) is
not a C
p
(f) :=
f(p) =
_
R
dxf(x)e
ipx
;
9
since it is a well-known property of the Fourier transform that it diagonalizes the convolution
product, in that
fg =
f g (the product on the right-hand side being pointwise multiplication). In
particular, the Gelfand transform f
f, which we recall to be dened by
f() := (f), is nothing
but the Fourier transform on characters of the form
p
. In fact, all characters turn out to be of
this form, so that (L
1
(R))
= R.
By the RiemannLebesgue lemma, one has
f C
0
(R). Also, as is easily shown, |
f|
|f|
1
.
These are typical properties of the Gelfand transform dened on commutative Banach algebras.
For a C
-algebra, the Gelfand transform should be isometric. This is not the case for the norm
| |
1
in which, as we have already remarked L
1
(R) fails to be a C
f|
(R) as the
closure of L
1
(R) in the new norm | |, it follows that C
(R)
= C
0
(R). This is consistent with
Theorem 2.1, and the given argument is basically an outline of its proof in general.
Let us now turn to the proof of Theorem 2.1. The rst few steps are valid for general commu-
tative Banach algebras A. Recall
Denition 2.4 A character of a commutative (Banach) algebra A (over C) is a nonzero homo-
morphism : A C of algebras,
21
in particular,
(ab) = (a)(b). (6)
The set of all characters of A is called the structure space (A) of A.
22
This is a topological
space in the so-called Gelfand topology, dened as the weakest topology making all functions
(a), a A, continuous. In other words, the Gelfand topology is generated by all sets of the
form a
1
(O), a A, O C open.
It is easily shown that a neighbourhood base of the Gelfand topology is given by sets of the
form
O
a
1
,...,a
n
() := (A) [ [(a
i
) (a
i
)[ < i, (7)
where (A), > 0, n < , and a
i
A.
The relevance of the following result to the proof of Theorem 2.1 should be clear.
Proposition 2.5 If a commutative Banach algebra A has a unit 1, then (A) is a compact Haus-
dor space in the Gelfand topology.
23
The Hausdor property is an easy exercise. The compactness property is much harder. It relies
on the following lemma, which will be proved later on.
Lemma 2.6 Let A be a commutative Banach algebra with unit. Then each (A) is continu-
ous, with norm
|| = (1) = 1, (8)
so that (A) A
.
Let us note that, according to this lemma, (A) may not only be equipped with the Gelfand
topology, but also with the relative norm topology on A
-topology on
A
, are continuous;
a neighbourhood base is given by (7), where one now puts , A
-topology on A
.
21
Since (A) is a homomorphism, it is linear by denition.
22
It is not obvious that A has any character. We will show in Lemma 2.9 below that (A) is not empty when A
is a C
-algebra.
23
If A has no unit, (A) will merely be locally compact, as we shall see.
24
I.e., restricted from A
to (A).
10
Now, it is an easy exercise to show that if A has a unit, then (A) is a closed subspace of the
unit ball
25
of A
in the weak
-topology (and also in the norm topology). Combining this with the
basic Banach-Alaoglu theorem of functional analysis,
26
Proposition 2.5 follows.
Apart from such technicalities, the fundamental idea of the proof of Theorem 2.1 is very simple.
As mentioned before, it consists of the Gelfand transform.
Proposition 2.7 Let A be a commutative Banach algebra with unit, and let (A) carry the
Gelfand topology.
27
The Gelfand transform a a, dened by
a() := (a), a A, (A), (9)
is an algebra homomorphism from A to C((A)) (equipped with pointwise operations).
The homomorphism property is trivial, since
( a
b)() := a()
:= (A
, so
A A
, by the very same formula a a, with a() := (a). Hence the Gelfand transform is
simply the restriction of this embedding to (A) A
.
Once again, we evoke a basic result of functional analysis without proof (cf. [15]). Namely,
under this embedding, A is precisely the subset of elements of A
-topology.
28
Of course, elements of A A
-algebra.
Lemma 2.8 Let A be a commutative C
-algebras).
In view of Proposition 2.7 and Denition 2.2, we only need to show that
a
(b +it1)| = |b
2
+t
2
| |b|
2
+t
2
.
Combining the displayed equations yields
2
+ t |b|
2
for all t R. This is impossible unless
= 0, so that (a) is real when a = a
= sup
(A)
[(a)[ = |a|.
25
The unit ball is the set of all functionals A
for which 1.
26
This states that for any Banach space A the unit ball in A
.
29
Dont get confused: an isomorphism between two C
-algebras, we need to develop some spectral theory. The basics are valid for general Banach
algebras, so we briey return to this setting, specializing to the C
-case as appropriate.
3 Spectral theory for Banach algebras
Until further notice, let A be a Banach algebra with unit.
Denition 3.1 The resolvent (a) of a A is the set of all z C for which a z1 has a
(two-sided) inverse in A.
The spectrum (a) of a A is the complement of (a) in C; in other words, (a) is the set
of all z C for which a z1 has no (two-sided) inverse in A.
When A is the algebra of n n matrices, the spectrum is just the set of eigenvalues. For
A = B(H), Denition 3.1 reproduces the usual notion of the spectrum of an operator on a Hilbert
space. The third example, which we present as a lemma, is an easy exercise.
Lemma 3.2 For f A = C(X), one has (f) = f(x), x X.
These examples have a physical interpretation (also cf. the Introduction). In classical physics
the observables are real-valued functions on some phase space X, so the spectrum of an observable
is just the set of values it can assume. In quantum physics one assumes that the observables are
selfadjoint operators on a Hilbert space H, and one assumes that the values such an observable
can assume lie in its spectrum. Hence Denition 3.1 unies these to cases to some extent.
Theorem 3.3 The spectrum (a) of any element a A is
1. contained in the set z C[ [z[ |a|;
2. compact;
3. not empty.
The proof uses two lemmas. We assume that A is unital.
Lemma 3.4 When |a| < 1 the sum
n
k=0
a
k
converges to (1 a)
1
.
Hence (a z1)
1
always exists when [z[ > |a|.
30
This theorem is contained in elementary analysis courses for X = [0, 1]; for the general case see [15].
12
We rst show that the sum is a Cauchy sequence. Indeed, for n > m one has
|
n
k=0
a
k
k=0
a
k
| = |
n
k=m+1
a
k
|
n
k=m+1
|a
k
|
n
k=m+1
|a|
k
.
For n, m this goes to 0 by the theory of the geometric series. Since A is complete, the Cauchy
sequence
n
k=0
a
k
converges for n . Now compute
n
k=0
a
k
(1 a) =
n
k=0
(a
k
a
k+1
) = 1 a
n+1
.
Hence
|1
n
k=0
a
k
(1 a)| = |a
n+1
| |a|
n+1
,
which 0 for n , as |a| < 1 by assumption. Thus
lim
n
n
k=0
a
k
(1 a) = 1.
By a similar argument,
lim
n
(1 a)
n
k=0
a
k
= 1.
so that, by continuity of multiplication in a Banach algebra, one nally has
lim
n
n
k=0
a
k
= (1 a)
1
.
The second claim of the lemma follows because (a z)
1
= z
1
(1 a/z)
1
, which exists
because |a/z| < 1 when [z[ > |a|.
To prove that (a) is compact, it remains to be shown that it is closed.
Lemma 3.5 The set
G(A) := a A[ a
1
exists
of invertible elements in A is open in A.
Given a G(A), take a b A for which |b| < |a
1
|
1
. By (88) this implies
|a
1
b| |a
1
| |b| < 1. (10)
Hence a+b = a(1+a
1
b) has an inverse, namely (1+a
1
b)
1
a
1
, which exists by (10) and Lemma
3.4. It follows that all c A for which |a c| < lie in G(A), for |a
1
|
1
.
To resume the proof of Theorem 3.3, given a A we now dene a function f : C A by
f(z) := z a. Since |f(z +) f(z)| = , we see that f is continuous (take = in the denition
of continuity). Because G(A) is open in A by Lemma 3.5, it follows from the topological denition
of a continuous function that f
1
(G(A)) is open in C. But f
1
(G(A)) is the set of all z C where
z a has an inverse, so that f
1
(G(A)) = (a). This set being open, its complement (a) is closed.
Finally, dene g : (a) A by g(z) := (z a)
1
. For xed z
0
(a), choose z C such that
[z z
0
[ < |(az
0
)
1
|
1
. From the proof of Lemma 3.5, with a replaced by az
0
and c replaced
by a z, we see that z (a), as |a z
0
(a z)| = [z z
0
[. Moreover, the power series
1
z
0
a
n
k=0
_
z
0
z
z
0
a
_
k
13
converges for n by Lemma 3.4, because
|(z
0
z)(z
0
a)
1
| = [z
0
z[ |(z
0
a)
1
| < 1.
By Lemma 3.4, the limit n of this power series is
1
z
0
a
k=0
_
z
0
z
z
0
a
_
k
=
1
z
0
a
_
1
_
z
0
z
z
0
a
__
1
=
1
z a
= g(z).
Hence
g(z) =
k=0
(z
0
z)
k
(z
0
a)
k1
(11)
is a norm-convergent power series in z. For z ,= 0 we write |g(z)| = [z[
1
|(1a/z)
1
| and observe
that lim
z
1a/z = 1, since lim
z
|a/z| = 0 by Denition 11.9.3. Hence lim
z
(1a/z)
1
=
1, and
lim
z
|g(z)| = 0. (12)
Let A
: z (g(z))
is given by a convergent power series, and (12) implies that
lim
z
g
(z) = 0. (13)
Now suppose that (a) = , so that (a) = C. The function g, and hence g
, is then dened on
C, where it is analytic and vanishes at innity. In particular, g
, so that |a| = | a|
k=0
_
a
z
_
k
. (18)
On the other hand, we have seen that for any z (a) one may nd a z
0
(a) such that the power
series (11) converges. If [z[ > r(a) then z (a), so (11) converges for [z[ > r(a). At this point
the proof relies on the theory of analytic functions with values in a Banach space, which says that,
accordingly, (18) is norm-convergent for [z[ > r(a), uniformly in z. Comparing with (15), this
sharpens what we know from Lemma 3.4. The same theory says that (18) cannot norm-converge
uniformly in z unless |a
n
|/[z[
n
< 1 for large enough n. This is true for all z for which [z[ > r(a),
so that
lim sup
n
|a
n
|
1/n
r(a). (19)
To derive a second inequality we use the following polynomial spectral mapping property.
Lemma 3.7 For a polynomial p on C, dene p((a)) as p(z)[ z (a). Then
p((a)) = (p(a)). (20)
To prove this equality, choose z, C and compare the factorizations
p(z) = c
n
i=1
(z
i
());
p(a) 1 = c
n
i=1
(a
i
()1). (21)
Here the coecients c and
i
() are determined by p and . When (p(a)) then p(a) 1 is
invertible, which implies that all a
i
()1 must be invertible. Hence (p(a)) implies that
at least one of the a
i
()1 is not invertible, so that
i
() (a) for at least one i. Hence
p(
i
()) = 0, i.e., p((a)). This proves the inclusion (p(a)) p((a)).
Conversely, when p((a)) then = p(z) for some z (a), so that for some i one must
have
i
() = z for this particular z. Hence
i
() (a), so that a
i
() is not invertible,
implying that p(a) 1 is not invertible, so that (p(a)). This shows that p((a)) (p(a)),
and (20) follows.
To conclude the proof of (16), we note that since (a) is closed there is an (a) for
which [[ = r(a). Since
n
(a
n
) by Lemma 3.7, one has [
n
[ |a
n
| by (15). Hence
|a
n
|
1/n
[[ = r(a). Combining this with (19) yields
lim sup
n
|a
n
|
1/n
r(a) |a
n
|
1/n
.
Hence the limit must exist, and
lim
n
|a
n
|
1/n
= inf
n
|a
n
|
1/n
= r(a).
To prove (17), we need to develop the theory of ideals in commutative C
-algebras. We will do
this directly also for the general noncommutative case, specializing to the commutative situation
as appropriate.
4 Ideals in Banach algebras and C
-algebras
We proceed in two stages, rst discussing ideals in general Banach algebras, and subsequently
passing to the special case of C
-algebras.
15
Denition 4.1 Let A be a Banach algebra.
A left ideal (right ideal) in A is a closed linear subalgebra J for which a J implies ba J
(ab J) for all b A.
An ideal in A is a subspace that is both a left and a right ideal (i.e., a two-sided ideal).
A maximal ideal is a proper ideal
31
J A for which J
J A for some proper ideal
J
implies
J = J.
32
Note that an ideal is by denition two-sided. Compared to the purely algebraic denition, an
ideal in a Banach algebra has to be closed by denition. This turns out to make an enormous
dierence, restricting the possible ideals. In particular, an ideal in a Banach algebra is itself a
Banach algebra. An ideal J that contains an invertible element a must coincide with A, since
a
1
a = 1 must lie in J, so that all B = B1 must lie in J. This shows the need for considering
Banach algebras with and without unit; it is usually harmless to add a unit to a Banach algebra
A, but a given proper ideal J ,= A does not contain 1, and one cannot add 1 to J without ruining
the property that it is a proper ideal.
Denition 4.1 literally applies to C
-algebra
is required to be selfadjoint, but this is turns out to be a consequence of the given denition.
Proposition 4.2 Let J be an ideal in a C
-algebra A. If a J then a
-algebra is selfadjoint.
The proof of this theorem is surprisingly dicult, using techniques we have not yet discussed.
Hence we postpone it until section 10.
In the commutative case, left and right ideals are the same as ideals. For example, if A = C(X)
for a compact space X, then each closed subspace Y X denes an ideal
C(X, Y ) := f C(X) [ f(x) = 0 x Y . (22)
Note that C(X, Y ) is indeed closed by denition of the sup-norm, and that C(X, Y )
= C
0
(XY ).
In fact, it is an easy exercise that all ideals in C(X) are of this form. It is not necessary to assume
that Y is closed, but this assumption entails no loss of generality, since C(X, Y ) = C(X, Y ), where
Y is the closure of Y . We will see shortly that C(X, Y ) is maximal i Y is a point, and that all
maximal ideal in C(X) are of this form.
Proposition 4.3 If J is an ideal in a Banach algebra A then the quotient A/J is a Banach algebra
in the norm
|(a)| := inf
jJ
|a +j| (23)
and the multiplication
(a)(b) := (ab). (24)
Here : A A/J is the canonical projection. If A is unital and J is proper, then A/J is unital,
with unit (1).
We omit the standard proof that A/J is a Banach space in the norm (23). As far as the Banach
algebra structure is concerned, rst note that (24) is well dened: when j
1
, j
2
J one has
(a +j
1
)(b +j
2
) = (ab +aj
2
+j
1
b +j
1
j
2
) = (ab) = (a)(b),
since aj
2
+ j
1
b + j
1
j
2
J by denition of an ideal, and (j) = 0 for all j J. To prove (88),
observe that, by denition of the inmum, for given a A, for each > 0 there exists a j J such
that
|(a)| + |a +j|. (25)
31
A proper ideal of A is an ideal that is neither A nor 0.
32
Note that a maximal ideal J A dened in the purely algebraic sense is automatically closed. To prove this,
note that the closure J of J cannot be A, since J does not contain any invertible element of A (otherwise it would
coincide with A), and the set G(A) of all invertible elements in A is open (see Lemma 3.5). Since J J A and
J is maximal, J = J.
16
For if such a j would not exist, then |(a)| |a + j| for all j J, violating (23). On the
other hand, for any j J it is clear from (23) that
|(a)| = |(a +j)| |a +j|. (26)
For a, b A choose > 0 and j
1
, j
2
J such that (25) holds for a, b, and estimate
|(a)(b)| = |(a +j
1
)(b +j
2
)| = |((a +j
1
)(b +j
2
))|
|(a +j
1
)(b +j
2
)| |a +j
1
| |b +j
2
|
(|(a)| +)(|(b)| +). (27)
Letting 0 yields
|(a)(b)| |(a)| |(b)|. (28)
When A has a unit, it is obvious from (24) that (1) is a unit in A/J. By (26) with a = 1 and
j = 0 one has |(1)| |1| = 1. On the other hand, from (28) and (24) with b = 1 and a AJ
one derives |(1)| 1. Hence |(1)| = 1.
Like Proposition 4.2, the proof of the following C
-algebra with
respect to the norm (23), the multiplication (24), and the involution
(a)
= (a
). (29)
In the commutative case, the basic example (with X and Y compact, as above), is
C(X)/C(X, Y )
= C(Y ), (30)
as two elements f, g of C(X) are identied in C(X)/C(X, Y ) when f g C(X, Y ), i.e., when they
coincide on Y . If one looks at C(X, Y ) as the kernel of the restriction map r
Y
: C(X) C(Y ),
then elementary linear analysis shows that ran(r
Y
)
= C(X)/ ker(r
Y
), which is just (30).
We now return to the proof of Theorem 2.1, which was complete up to the proof of (17). This
hinges on the following key result.
Theorem 4.5 Let A be a unital commutative Banach algebra with structure space (A).
1. If (A) then J
1
= J
2
.
Hence there is a bijective correspondence between (A) and the set of all maximal ideals in A.
The rst and the third claim are easy exercises. Before demonstrating the second claim, let us
show how Theorem 4.5 implies (17). Namely, precisely the dicult second claim enters the proof
of a crucial lemma.
Lemma 4.6 One has (a) ,= 0 for all (A) i a G(A) (i.e., a is invertible).
If a G(A) then (a)(a
1
) = (aa
1
) = (1) = 1, so that (a) ,= 0. Conversely, assume
there exists a / G(A) such that (a) ,= 0 for all (A). The assumption a / G(A) implies that
the ideal
J
a
= ab [ b A
17
generated by a does not contain 1, so that J
a
,= A. By abstract nonsense
33
there must be a maximal
ideal J A containing J
a
. By Theorem 4.5.2, it must be that J = J
-algebras
are quite important whenever ideals play a role.
The discussion of general (not necessarily commutative) Banach algebras without unit is easier
than that of C
-algebras. When a Banach algebra A does not contain a unit, we can always add
one, as follows. Form the vector space AC, and turn this into an algebra by means of
(a +1)(b +1) := ab +b +a +1, (31)
where we have written a +1 for (a, ), etc. In other words, the number 1 in C is identied with
the unit 1. Furthermore, dene a norm on AC by
|a +1| := |a| +[[. (32)
In particular, |1| = 1. Using (93) in A, as well as 11.9.3, one sees from (31) and (32) that
|(a +1)(b +1)| |a| |b| +[[ |b| +[[ |a| +[[ [[ = |a +1| |b +1|,
so that AC is a Banach algebra with unit. Since by (32) the norm of a A in A coincides with
the norm of a + 01 in AC, we have shown the following.
Proposition 5.1 For every Banach algebra without unit there exists a unital Banach algebra
A,
the unitization of A, and an isometric (hence injective) morphism A
A, such that
A/A
= C.
The unitization of A with the given properties is not unique. Indeed, when A is a C
-algebra
it is natural to equip AC with the involution
(a +1)
:= a
+1. (33)
However, if AC is normed through (32) it fails to be a C
-algebra.
1. The map : A L(A) given by
(a)b := ab (34)
establishes an isomorphism between A and (A) L(A).
2. When A has no unit, dene a norm on AC by
|a +1| := |(a) +1|, (35)
where the norm on the right-hand side is the operator norm (82) in L(A), and 1 on the
right-hand side is the unit operator in L(A). With the operations (31) and (33), the norm
(35) turns AC into a C
|/|a| = |(a)
a
|a|
| |(a)|;
in the last step we used (84) and |(a
/|a|)| = 1. Hence
|(a)| = |a|. (36)
34
This may already be seen in the simplest of all examples A = C.
19
Being isometric, the map must be injective; it is clearly a homomorphism, so that we have proved
the rst claim of the proposition.
It is clear from (31) and (33) that the map a + 1 (a) + 1 (where the symbol 1 on the
left-hand side is dened below (31), and the 1 on the right-hand side is the unit in L(A)) is a
morphism. Hence the norm (35) satises (93), because (88) is satised in the Banach algebra
L(A). Moreover, in order to prove that the norm (35) satises (94), by Lemma 11.20 it suces to
prove that
|(a) +1|
2
|((a) +1)
(ab +b)|.
Here we used (94) in A. Using (34), the right-hand side may be rearranged as
|(b
)(a
)| |((a) +1)
)| = |b
| = |b| = 1 by (36) and (95), and |b| = 1 also in the last term, the inequality
(37) follows by letting 0.
Hence the C
-algebra
A and
an isometric (hence injective) morphism A
A, such that
A/A
= C.
The uniqueness of
A will follow from Corollary 8.5 below.
In the commutative case, the unitization procedure has a simple topological meaning, which
illustrates the general principle that the use of commutative C
A
= C(
X), where 1
A is identied with 1
X
C(
X). Conversely, removing C1
X
from C(
X)
corresponds to removing C from
A = AC (as a vector space), leaving one with C
0
(X).
Hence the unitization of C
0
(X) corresponds to the one-point compactication of X.
Lemma 5.5 Let A be a commutative C
on
A, dened by
(a +1) := , (39)
is a character of
A.
20
3. There are no other characters on
A.
4. (
A) is homeomorphic to the one-point compactication of (A).
In fact, this lemma is true for any commutative Banach algebra, with respect to any unitization.
We are now in a position to prove Theorem 2.1 also in the nonunital case. Applying the unital
case of Theorem 2.1 to
A and using Lemma 5.5, one nds
A
= C(
X) with X := (A). Removing
C from
A = AC precisely leaves one with C
0
(X) by Lemma 5.4, so that nally A
= C
0
(X).
Note that the Gelfand transform on a commutative C
) =
: C(Y ) C(X) of C
-algebras via
the pullback, that is, for f C(Y ) one puts
C
0 C
1
= (, ) C
1
C
1
[ s() = t() C
1
.
We write x
y when C
1
satises s() = x and t() = y, and or for m(, ).
These maps are subject to the following axioms:
1. s(i(x)) = t(i(x)) = x for all x C
0
;
2. If , C
2
then s() = s() and t() = t();
3. If (, ) C
2
and (, ) C
2
then () = ();
35
Recall Footnote 2; a map is continuous by denition.
36
We refrain from dening the concept of a class; this would lead us into logic and the foundations of mathematics.
We just mention that a class may be larger than a set.
21
4. i(t()) = i(s()) = for all C
1
.
We interpret as an arrow from s() to t(), so that i(x) is an arrow from x to x. The composition
of arrows is dened whenever s() = t() (so that on paper the direction of an arrow is
from right to left!). Arrow composition is associative whenever dened, and each i(x) acts as an
identity under this composition operation. The class of all arrows from x to y in a category C is
sometimes written as (x, y)
C
.
The simplest example of category is the category S of all sets, where S
0
consists of sets and S
1
consists of functions.
37
Of course, in the present context our basis examples are the category CH of
compact Hausdor spaces as objects and maps as arrows, and the category CC
1
A of commutative
C
-algebras with unit as objects and unital morphisms as arrows. The former is a subcategory (as
dened in the obvious way) of the category T of all topological spaces and maps, and the latter is
a subcategory of the category CA of all C
(X) = C
0
(X).
2. A set X denes another groupoid, called the pair groupoid over X. Here one takes G
1
=
X X and G
0
= X, with s(x, y) = y, t(x, y) = x, i(x) = (x, x), (x, y) (y, z) = (x, z), and
(x, y)
1
= (y, x). When X is nite with cardinality n, the associated C
(X X) = M
n
(C).
3. An equivalence relation on a set X denes a subgroupoid (X, ) of the pair groupoid
over X; here G
0
= X, while G
1
consists of those pairs (x, y) X X for which x y.
When x y for any (x, y) one recovers the pair groupoid over X; on the other hand, when
x x and nothing else the groupoid dened by the equivalence relation is X as a space. It
is a useful exercise that the axioms for an equivalence relation imply that the denition of a
groupoid is satised.
41
37
Here one sees that a class is larger than a set, since the set of all sets does not exist, whereas the category of all
sets does.
38
In algebraic topology one works in the homotopy category hT, in which the objects are topological spaces and
the arrows are homotopy classes of continuous maps. In that case, isomorphism of objects comes down to homotopy
equivalence of spaces.
39
It is often required that that this category is small, in that its class of arrows is a set.
40
Note, though, that the categories CC
1
A and CH fail to be groupoids by a long shot!
41
The fundamental idea of Connes, which underlies about half of noncommutative geometry, is as follows. When
X is a locally compact Hausdor space, the quotient X/ may be ill-behaved in being non-Hausdor; it may even
have no nontrivial open sets. In such cases, the space C
0
(X/ ) carries practically no information about X/ , not
even as a set. In such situations, Connes proposed to describe the quotient X/ by the C
-algebra C
(X, ) of
the groupoid dened by , which may have a rich structure. Note that a complication arises: the subset of X X
dened by often needs to be retopologized in order to dene C
-algebra.
22
4. A group G is a groupoid with G
1
= G and G
0
= e. When G is nite, C
fails
to be a functor, because in fact one has ( )
0
(x)
x
0
(x)
1
()
_
1
()
0
(y)
0
(y)
The given functors are called naturally isomorphic,
42
written
= , when there exists a natural
transformation between them for which all arrows
x
are invertible (i.e., are isomorphisms).
43
42
Or equivalent.
43
Hence a natural transformation of functors between groupoids automatically denes a natural isomorphism.
23
It follows that if and are naturally isomorphic, then (x)
= (x) for all x G
0
, but this
condition in itself is not sucient to render and naturally isomorphic; the isomorphisms
between (x) and (x) must be compatible with the arrows, as expressed by the diagram in the
denition.
The original motivation for this denition was to nd a way of expressing the fact that the dual
V
is
isomorphic to V in a natural way, namely through the Gelfand transform v v from V to V
,
where v() := (v) for V
0
(x)
_
1
()
y
0
(y)
(40)
for all x
y H, in which all arrows
x
are invertible, and similarly for G.
Theorem 6.6 The category CH of compact Hausdor spaces and continuous maps is dual to the
category CC
1
A of unital commutative C
B
C((B))
(41)
commutes for any unital morphism : A B, and isomorphisms
X
for any compact Hausdor
space X such that
X
X
(C(X))
Y
(C(Y ))
(42)
commutes for any map : X Y .
For
A
we take the Gelfand transform
A
(a) = a, with a() = (a), which we already know
to be an isomorphism by Theorem 2.1. Furthermore, it is an easy exercise that Diagram (41)
commutes. For
X
we take the evaluation map, i.e.,
X
(x) =
x
, where
x
(f) = f(x). Again it
is easy to show that Diagram (42) commutes. The only remaining step is to show that
X
is an
isomorphism in the category CH, which we now do. We rst prove injectivity, then surjectivity,
and nally continuity of
X
(the latter also of its inverse).
44
Similarly, G and H are isomorphic, G
= H, when = id
H
and = id
G
. This notion is rarely useful,
however. The natural notion of isomorphism in category theory is equivalence.
24
Since a compact Hausdor space is normal,
45
Urysohns lemma says that C(X) separates points
on X (i.e., for all x ,= y there is an f C(X) for which f(x) ,= f(y)). This immediately shows
that
X
is injective.
To prove surjectivity, suppose there is (C(X)) that is not of the form =
x
for some
x X. By Theorem 4.5, there then exists a maximal ideal J in C(X) such that J ,= ker(
x
) for
all x, in other words, for all x there is a f
x
J for which f
x
(x) ,= 0. For, if for some x there
would exist no such f
x
, then f(x) = 0 for all f J, so that J ker(
x
) and hence J = ker(
x
)
by maximality of J, contradicting the assumption. For each x, the set O
x
where f
x
is nonzero
is open, because f is continuous. This gives a covering O
x
xX
of X. By compactness, there
exists a nite subcovering O
x
i
i=1,...,N
. Then form the function g :=
N
i=1
[f
x
i
[
2
. This function
is strictly positive by construction, so that it is invertible.
46
But J is an ideal, so that, with all
f
x
i
J (since all f
x
J) also g J. But an ideal containing an invertible element must coincide
with C(X), contradicting the assumption that J is maximal. Hence
X
is surjective by reductio
ad absurdum.
The space X may be equipped with the new topology induced by
X
, in which the open sets
are of the form
1
X
(O), with O open in (C(X)) in the Gelfand topology. We claim that this
new topology on X is weaker than the original one.
47
Namely, for f C(X) one has
f
X
= f.
Therefore, since the Gelfand topology on (C(X)) is the weakest topology for which all Gelfand
transforms
f are continuous,
48
the new topology on X is the weakest topology for which all f are
continuous. But f was already continuous with respect to the given topology, so the claim follows.
Without proof we now state a result from topology.
Lemma 6.7 Let a set X be Hausdor in some topology T
1
and compact in a topology T
2
. If T
1
is
weaker than T
2
then T
1
= T
2
.
Since X is in fact compact and Hausdor in both topologies, we conclude from this lemma that
the new topology on X must coincide with the original one. In other words,
X
is a homeomor-
phism. This nishes the proof of Theorem 6.6.
Corollary 6.8 The space X in Theorem 2.1 is unique up to homeomorphism.
Firstly, it follows from the comment after Denition 6.3 that if A
= C(X) in CC
1
A for some
X CH
0
, then (A)
= (C(X)) in CH. But we have just seen that (C(X))
= X in CH, so
that (A)
= X, or X
= (A).
This conclusion would be invalid when X is not required to be Hausdor, in which case C(X)
=
C(Y ) in CC
1
A no longer implies X
= Y in CH.
We now examine the case of commutative C
: C
0
(Y ) C
0
(X).
For example, with Y equal to a point any f C(Y )
= C pulls back to a constant function on X,
which does not vanish at innity. Hence some restriction is necessary on the class of allowed maps
between locally compact Hausdor spaces.
Denition 6.9 A map : X Y between locally compact Hausdor spaces is proper when
1
(K) is compact for any compact set K Y . The category LCH consists of locally compact
Hausdor spaces as objects and proper maps as arrows.
49
Clearly, maps like c : R pt are not proper. We list some properties of proper maps : X
Y .
50
45
Recall that in a normal space any disjoint pair of closed sets is contained in a disjoint pair of open sets.
46
Recall that f C(X) is invertible i f(x) = 0 for all x X, in which case f
1
(x) = 1/f(x).
47
A topology T
1
is called weaker than a topology T
2
on the same set if any open set of T
1
contains an open set
of T
2
. This includes the possibility T
1
= T
2
.
48
Cf. Footnote 27.
49
This denition relies on the property that the composition of two proper maps is again proper.
50
See Bourbaki, General Topology Ch. 1-4, , 10.
25
1. A proper map is automatically closed.
51
2. is proper i it is closed and
1
(pt) is compact for any point pt Y .
3. If X is compact then any : X Y is proper.
4. is proper i its canonical extension :
X
Y , given by (
X
) =
Y
, is continuous.
52
5. The pullback
maps C
0
(Y ) into C
0
(X).
The algebraic counterpart of a proper map is as follows.
Denition 6.10 A morphism : A B between C
: C
0
(Y ) C
0
(X) of
a proper map : X Y is nondegenerate. This eventually leads to the following generalization
of Theorem 6.6:
Theorem 6.11 The category LCH of locally compact Hausdor spaces and proper continuous
maps is dual to the category CCA of commutative C
-algebras
Having said everything about commutative C
-algebra.
Our goal is to prove the converse, which is conveniently stated in terms of the following concept.
Denition 7.2 A representation of a C
) = (a)
.
If we just say representation of a C
-algebra); see
section 10 below. As an example of a representation, consider A = C
0
(R) and H = L
2
(R), with
51
That is, the image of any closed set is closed.
52
This is true even when X and/or Y are/is compact.
53
The same proof shows that A
n
= A for any n N.
26
given by (f)(x) = f(x)(x).
54
This representation is injective; an example of a representa-
tion of A = C
0
(R) that isnt is given by (f) = f(x) for some x R. As another example, we
just mention that the unitary representation theory of locally compact groups is a special case of
the representation theory of C
-algebra
C
(G) whose representations are in bijective correspondence with the unitary representations of
G, preserving direct sums, etc.
For later use, we dene the notion of equivalence of representations: two representations
1
(A)
and
2
(A) of a C
for all a A.
In the previous example, this notion reduces to the unitary equivalence of group representations
as it is usually dened.
We now state the structure of C
-algebras.
Theorem 7.3 Every C
-algebras, given by
Theorems 2.1 and 7.3. These are, of course, related by applying Theorem 7.3 to A = C
0
(X).
56
The proof of Theorem 7.3 uses a beautiful construction, which is important in its own right.
This construction, in turn, relies on a notion from quantum mechanics. Let A = B(H) and take
H with || = 1. The functional
(a
a) 0 for all a A
(positivity) and
on A by
-algebra algebra A without unit is a functional for which the canonical exten-
sion to the unitization
A, dened by
(a +1) := (a) +, (44)
is positive.
The main properties of states, which basically yield a number of equivalent denitions, are
summarized in the following results, whose proof is a straightforward exercise.
Proposition 7.5 Any positive functional on a C
-algebra is continuous.
A continuous functional on a unital C
-algebra is a state i || = 1.
A state on a C
to dene a state.
27
Conversely, the restriction of a state on
A to A is a state.
We now turn to the GNS-construction, initially assuming that A is unital. First, we call
a representation cyclic if its carrier space H contains a cyclic vector for ; this means
that the closure of (A) coincides with H. Such representation are the building blocks of any
representation.
58
The following theorem and its proof form the GNS-construction.
59
Theorem 7.6 Let be a state on a C
of A
on a Hilbert space H
such that
(a) = (
(a)
) a A. (45)
Using (43), we could somewhat cryptically write this as =
.
The idea of the proof is simple; the devil is in the details of step 4.
1. Given a state on A, dene a bilinear form (, )
0
on A by
(a, b)
0
:= (a
b). (46)
It is easily shown from the positivity property of that this form is positive semi-denite
60
and sesquilinear.
61
Hence (, )
0
denes a pre-inner product on A. Its null space
N
= a A[ (a
a) = 0 (47)
is a left-ideal in A.
2. The form (, )
0
projects to an inner product
62
(, )
. If p
: A
A/N
a, p
b)
:= (a, b)
0
. (48)
The Hilbert space H
b, b A, by
(a)p
b := p
ab. (49)
This is well dened because N
is linear
and satises
(ab) =
(a)
(b) and
(a)
(a
.
4. We will show that each
. Hence
by continuity.
63
It is easily shown that this extension still has the dening properties of
a representation.
5. The vector dened by
:= p
1 is cyclic, since
(a)
= p
a, hence
(A)
= A/N
,
which by construction is dense in H
.
6. Finally, (45) follows by a simple computation.
58
It may be shown that any non-degenerate representation is a direct sum of cyclic representations. Here one
says that a representation (A) is non-degenerate if (a)v = 0 for all a A implies v = 0.
59
For Gelfand-Naimark-Segal. This construction is very important in quantum eld theory and quantum statistical
mechanics.
60
This means that (a, a)
0
0 for all a A.
61
That is, (a, b)
0
= (b, a)
0
, which is equivalent to the property (a
) = (a).
62
Which by denition is a positive denite hermitian (=sequilinear) form.
63
This relies on a simple but important fact in functional analysis: if B
0
is a dense subspace of a Banach space B,
and a linear map a : B
0
B
0
is bounded, then a extends to a bounded operator a : B B by continuity. Namely,
if v
v in B with all v
B
0
, then {av
.
28
When A has no unit, we simply dene
(a)p
b|
2
, where a, b A. By (48) and (49) one
has |
(a)p
b|
2
= (b
ab) |a|
2
(b
b), (50)
whose proof we postpone until the end of section 9. But (b
b) = |p
b|
2
, so that |
(a)p
b|
|a| |p
b|, so that |
: A B(H
is indeed injective. The rst problem is resolved by the following lemma, which
we will prove once we have developed the theory of states.
Lemma 7.7 For any selfadjoint element a A (i.e., a
(a) = .
To prove this, assume that A has a unit; if not, pass to the unitization and use Proposition
7.5. Given a A and (a), dene a linear map
: Ca +C1 C by
(a +1) := +.
Since (a), one has + (a + 1); this easily follows from the denition of . Hence
(15) with a replaced by a + 1 implies [
(1) = 1, it
follows from Proposition 7.5 that | | = 1. By the Hahn-Banach Theorem 11.15, there exists an
extension
of
(a) =
(a) = .
To solve the second problem of the possible lack of injectivity of
, we proceed as follows.
First, note that if
1
and
2
are representations of A on Hilbert spaces H
1
and H
2
, respectively,
then there is an obvious notion of the direct sum
1
2
, which is a representation of A on H
1
H
2
;
one simply puts
(
1
2
)(a) :=
_
1
(a) 0
0
2
(a)
_
, a A.
This immediately extends to the direct sum of a nite number of Hilbert spaces and representations.
The direct sum of a countable number of Hilbert spaces H
i
is dened by
i
H
i
:=
_
v
i
H
i
[
i
|v
i
|
2
H
i
<
_
;
Similar to the proof of completeness of
2
, it is a simple exercise to prove that this space is complete
in the inner product
(v, w) :=
i
(v
i
, w
i
)
H
i
.
However, for the proof of Theorem 7.3 we unfortunately need uncountable direct sums, since
we wish to dene the direct sum of all GNS-representations of A, which is a huge number. To
detail, let S(A) be the state space of A, that is, the set of all states on A. We will need to make
sense of constructions such as
S(A)
H
and
S(A)
-topology of A
. In what
follows, we always regard S(A) as a topological space with respect to the latter.
64
Furthermore,
S(A) has the structure of a convex set in the vector space A
i
belongs to S(A) when all
p
i
0 and
i
p
i
= 1, and all
i
S(A). Combining the two structures, it follows from the
Banach-Alaoglu theorem that S(A) is a compact convex set when A is unital.
65
For example, for A = M
2
(C) one has S(A)
= B
3
, as compact convex sets, where the three-ball
is dened as B
3
= (x, y, z) R
3
[ x
2
+y
2
+z
2
1. Even this space is already uncountable! For
A = C(X) it follows from the Riesz theorem of measure theory that S(A) consists of all probability
measures on X.
Now, to dene
S(A)
H
F
f(),
where the supremum is taken over all nite subsets F of S. It is easy to show that if the left-hand
side is nite, then it can only have a countable number of nonzero terms. This gives meaning to
H
u
:=
S(A)
H
:=
_
_
_
v
S(A)
H
S(A)
|v
|
2
H
<
_
_
_
. (51)
One can show that H
u
is complete in the inner product
(v, w) :=
S(A)
(v
, w
)
H
;
note that this sum only has a countable number of terms. We then dene the universal repre-
sentation
u
(A) by
u
(A) :=
S(A)
(A); (52)
this means, of course, that
u
(a)v for v H
u
is dened by its components (
u
(a)v)
:=
(a)v
,
which again is a countable family. It is easy to see that this indeed is a representation.
The Hilbert space H
u
will be the H in the statement of Theorem 7.3. To prove that =
u
is injective, take some xed S(A), and dene the vector as having components
= 0 for
,= , and
equal to the cyclic vector of the GNS-construction for . This vector clearly lies in
H
u
. Then (
u
(a)) =
(a)
(a)
= 0, hence
|
(a)
|
2
= (a
a) = 0
by the GNS-construction. Taking =
a
a
, Lemma 7.7 implies
|a|
2
= |a
a| =
a
a
(a
a) = 0,
hence a = 0, so that
u
is injective. This concludes the proof of Theorem 7.3, up to the proof of
(50) and Lemma 7.7.
It should be noted that this proof relies on incredible overkill, in that H
u
is far larger than nec-
essary. For example, for A = M
n
(C) any vector state in C
n
gives rise to an injective representation,
namely the dening one.
To prove the inequality (50) and Lemma 7.7 we need to develop the theory of states, which
in turn relies on the notion of positivity in C
-algebras. All these topics are of great interest in their own right as
well, and no course in C
-subalgebra C
(a) of A that
contains a and 1, namely the closure of the linear span of 1 and all operators of the type a
1
. . . a
n
,
where a
i
is a or a
= a
(a) is
commutative. In particular, when a is selfadjoint, C
(a)
(a) of a in C
-algebra C
(a, a
1
, 1) generated by a, a
1
, and 1. One has (a
1
)
= (a
)
1
, and a, a
,
a
1
, (a
)
1
and 1 all commute with each other. Hence C
(a, a
1
, 1) is commutative; it is the
closure of the space of all polynomials in a, a
, a
1
, (a
)
1
, and 1. By Theorem 2.1 we have
C
(a, a
1
, 1)
= C(X) for some compact Hausdor space X. Since a is invertible and the Gelfand
transform (9) is an isomorphism, a is invertible in C(X). That is, a(x) ,= 0 for all x X. However,
for any f C(X) that is nonzero throughout X we have 0 < |f|
2
ff
1 pointwise, so that
0 1
X
|f|
2
< 1.
Here f
|f|
2
k=0
_
1
ff
|f|
2
_
k
. (53)
Hence a
1
is a norm-convergent limit of a sequence of polynomials in a and a
. Gelfand transform-
ing this result back to C
(a, a
1
, 1), we infer that a
1
is a norm-convergent limit of a sequence of
polynomials in a and a
. Hence a
1
lies in C
(a), and C
(a, a
1
, 1) = C
(a).
Now replace a by a z, where z C. If a is normal, then a z is normal. So if we assume
that a z G(A) the argument above applies, leading to the conclusion that the resolvent
A
(a)
in A coincides with the resolvent
C
(a)
(a) in C
A
(a) =
C
(a)
(a).
Corollary 8.2 If a
(a)
(a) is real, so that by the previous result (a) is real.
The commutative C
-algebra C
(a) is isomorphic to C((a)). Under this isomorphism the Gelfand transform a : (a) C
is the identity function id
(a)
: t t.
Given the isomorphism C
(a)
= C(X) of Theorem 2.1 (where X = (C
(a))), according to
(17) the function a is a surjective map from X to (a). We now prove injectivity. When
1
,
2
X
and
1
(a) =
2
(a), then, for all n N, we have
1
(a
n
) =
1
(a)
n
=
2
(a)
n
=
2
(a
n
)
31
by iterating (6) with b = a. Since also
1
(1) =
2
(1) = 1 by (8), we conclude by linearity that
1
=
2
on all polynomials in a. By continuity (cf. Lemma 2.6) this implies that
1
=
2
on
C
; (54)
(f(a)) = f((a)). (55)
In particular, the norm of f(a) in C
((a))
CFC
-
C
(a)
@
@
@
@
@
a
R
C(X)
GT
?
By Proposition 8.3, a
-algebras.
Corollary 8.5 The norm in a C
-algebra A there is no
other norm in which A is a C
-algebra).
First assume a = a
). (56)
Since a
a). (57)
Since the spectrum is determined by the algebraic structure alone, (57) shows that the norm is
determined by the algebraic structure as well.
66
For operators on a Hilbert space there exist holomorphic and measurable functional calculi as well.
32
Note that Corollary 8.5 does not imply that a given
-algebra can be normed only in one way
so as to be completed into a C
-algebras is isometric.
Let : A B an isomorphism (cf. Denition 2.2). Dene a map | |
: A R
+
by
|a|
:= |(a)|
B
. It easily follows that this is a norm on A, in which A is complete: a sequence
a
when (a
) is a Cauchy sequence in B.
The latter converges to some b B, so that a
converges to
1
(b). Furthermore, (4) and (5)
guarantee that the norm | |
-algebra in | |
, so that
| |
= | |
A
.
To close this section, we prove Lemma 6.12. It is enough to show that any selfadjoint a A is of
the form a = a
1
a
2
, where A has no unit (otherwise the claim is trivial). Embed A
A and consider
C
(a)
A. Now factorize the function t t on (a) R as t = f
1
(t)f
2
(t) for some f
i
C((a)),
so that a = a
1
a
2
by Proposition 8.3 for a
i
:= CFC(f
i
) C
(a)
A under CFC, so if f C((a)) then CFC(f f(0)1
(a)
) C
(a) A.
67
Imposing the additional condition f
i
(0) = 0 therefore guarantees that in fact the a
i
lie in A.
9 Positivity in C
-algebras
A bounded operator a on a Hilbert space H is called positive when (v, av) 0 for all v H.
68
This property is equivalent to a
= a and (a) R
+
, and clearly also applies to closed subalgebras
of B(H).
Classically, a function f on some space X is called positive when it is pointwise positive, that
is, when f(x) 0 for all x X. This applies, in particular, to elements of the commutative
C
-algebra C
0
(X) (where X is a locally compact Hausdor space).
These examples are not as dissimilar as they might seem. Let PH be the projective Hilbert
space dened by H; this space ist most easily dened as the quotient of the unit sphere H
1
:=
v H [ (v, v) = 1 by the equivalence relation v w when w = zv for some z C with [z[ = 1.
Now, an operator a B(H) denes a function a C(PH) by means of a([v]) := (v, av); the
continuity of this function is an easy exercise. Hence we see that a is real-valed i a is self-adjoint
as an operator on H, and that a is a positive operator precisely when a is positive as a function
on PH.
69
Hence we have a notion of positivity for certain concrete C
= a.
The rst property follows from (ta) = t(a), which is a special case of (55).
Since (a) [0, r(a)], we have [c t[ c for all t (a) and all c r(a). Hence
sup
t(a)
[c1
(a)
a[ c by (17) and Proposition 8.3, so that |c1
(a)
a|
c. Gelfand
transforming back to C
(a), this implies |c1 a| c for all c |a| by Theorem 8.4. Inverting
this argument, one sees that if |c1 a| c for some c |a|, then (a) R
+
.
Use this with a a +b and c = |a| +|b|; clearly c |a +b| by 11.9.4. Then
|c1 (a +b)| |(|a| a)| +|(|b| b)| c,
where in the last step we used the previous paragraph for a and for b separately. As we have seen,
this inequality implies a +b A
+
.
Finally, when a A
+
and a A
+
it must be that (a) = 0, hence a = 0 by (56) and
(14).
For example, when a = a
= a (60)
= a
a[ a A. (61)
When (a) R
+
and a = a
then
a A is dened by the continuous functional calculus for
f =
, and satises
a
2
= a. Hence A
+
a
2
[ a
, where a
+
, a
A
+
and a
+
a
= 0. Moreover, |a
| |a|.
Apply the continuous functional calculus with f = id
(a)
= f
+
f
, where id
(a)
(t), f
+
(t) =
maxt, 0, and f
.
We use this lemma to prove that a
a[ a A A
+
. Apply the lemma to a = b
b (noting that
a is selfadjoint). Then
(a
)
3
= a
(a
+
a
)a
= a
aa
= a
ba
= (ba
ba
.
Since (a
) R
+
because a
)
3
0. Hence
(ba
ba
0.
Lemma 9.7 If c
c A
+
for some c A then c = 0.
We can write c = d +ie, d and e selfadjoint, so that
c
c = 2d
2
+ 2e
2
cc
. (62)
Now for any a, b A one has
(ab) 0 = (ba) 0. (63)
This is because for z ,= 0 the invertibility of ab z implies the invertibility of ba z. Namely, one
computes that (ba z)
1
= b(ab z)
1
a z
1
1. Applying this with c instead of A and c
for
b, we see that the assumption (c
c) R
implies (cc
) R
, hence (cc
) R
+
. By (62),
(60), and Proposition 9.3 (applied to Denition 9.2.2) we see that c
c 0, i.e., (c
c) R
+
, so
that the assumption c
c A
+
now yields (c
= 0. As (a
)
3
= (ba
ba
= 0 we see
that (a
)
3
= 0, and nally a
b = a
+
, which lies in a
+
. This completes the proof of Theorem 9.5.
An important consequence of (61) is the fact that inequalities of the type a
1
a
2
for selfadjoint
a
1
, a
2
are stable under conjugation by arbitrary elements b A, so that a
1
a
2
implies b
a
1
b
b
a
2
b. This is because a
1
a
2
is the same as a
2
a
1
0; by (61) there is an a
3
A such that
a
2
a
1
= a
3
a
3
. But clearly (a
3
b)
a
3
b 0, and this is nothing but b
ab b
a
2
b. For example,
replace a in (58) by a
a |a|
2
1. Applying the above principle gives
b
ab |a|
2
b
b (64)
for all a, b A. The denition of a state easily implies that if a b, then (a) (b). Thus (50)
follows.
10 Approximate units
It remains to prove Propositions 4.2 and 4.4, as well as the comments after Denition 2.2. In fact,
these claims are closely related. The appropriate technical tool is the theory of approximate units.
For any noncompact space X, the C
-algebra C
0
(X) has no unit (the unit would be 1
X
, which
does not vanish at innity because it is constant). There is a certain substitute for the absent unit,
however. Taking X = R for simplicity, and pick a sequence of functions 1
n
, n N, that take the
value 1 on [n, n] and vanish for [x[ > n + 1. It is clear that one does not have 1
n
1
R
in the
sup-norm, but instead one has lim
n
|1
n
f f|
= 0 for all f C
0
(R). Such a construction
may be performed in any C
-algebra.
35
Denition 10.1 An approximate unit in a non-unital C
of selfadjoint
elements of A, such that
|1
| 1, (65)
and
lim
|1
a a| = lim
|a1
a| = 0 (66)
for all a A.
The following fact is very useful, though its proof is awful.
Proposition 10.2 Every non-unital C
:=
i
a
i
a
i
. Clearly
b
is selfadjoint, and according to Theorem 9.5 and Proposition 9.3 one has (b
) R
+
, so that
n
1
1 +b
:= b
(n
1
1 +b
)
1
. (67)
Since b
is selfadjoint and b
)
1
), one has
1
= 1
. Although (n
1
1 +b
)
1
is computed in
A, so that it is of the form c +1 for some c A
and C, one has I
= b
c + b
that (1
) [0, 1].
This implies (65) because of (56).
Putting c
i
:= 1
a
i
a
i
, a simple computation shows that
i
c
i
c
i
= n
2
b
(n
1
1 +b
)
2
. (68)
We now apply (54) with a replaced by b
and f(t) = n
2
t(n
1
+ t)
2
. Since f 0 and f
assumes its maximum at t = 1/n, one has sup
tR
+ [f(t)[ = 1/4n. As (b
) R
+
, it follows that
|f|
1/4n, hence |n
2
b
(n
1
1 + b
)
2
| 1/4n by (54), so that |
i
c
i
c
i
| 1/4n by (68).
Lemma 9.4 then shows that |c
i
c
i
| 1/4n for each i = 1, . . . , n. Since any a A sits in some
directed subset of with n , it follows from (94) that
lim
|1
a a|
2
= lim
|(1
a a)
a a| = lim
|c
i
c
i
| = 0.
The other equality in (66) follows analogously.
Finally, when A is separable one may draw all A
i
occurring as elements of from a
countable dense subset, so that is countable.
We are now in a position to prove Propositions 4.2. Let J A be the given ideal, and put
J
:= a
j J J
because J
is a C
= 1
, we estimate
|j
|
2
= |(j 1
j)(j
)| = |(jj
jj
) 1
(jj
jj
)|
|(jj
jj
)| +|1
(jj
jj
)| |(j
j j
j1
)| +|1
| |(jj
jj
)|.
As we have seen, j
j J J
|j
| = 0. But 1
lies in J J
, so certainly 1
J.
In view of Proposition 4.3, all we need to prove to establish Proposition 4.4 is the property
(94). This uses
36
Lemma 10.3 Let 1
|a a1
|. (69)
It is obvious from (23) that
|a a1
| |(a)|. (70)
To derive the opposite inequality, add a unit 1 to A if necessary, pick any j J, and write
|a a1
| = |(a +j)(1 1
) +j(1
1)| |a +j| |1 1
| +|j1
j|.
Note that
|1 1
| 1 (71)
by Denition 10.1 and the proof of Proposition 9.3. The second term on the right-hand side goes
to zero for , since j J. Hence
lim
|a a1
| |a +j|. (72)
For each > 0 we can choose j J so that (25) holds. For this specic j we combine (70), (72),
and (25) to nd
lim
|a a1
| |(a)| |a a1
|.
Letting 0 proves (69).
We now prove (94) in A/J. Successively using (69), (94) in
A, (71), (69), (24), and (29), we
nd
|(a)|
2
= lim
|a a1
|
2
= lim
|(a a1
(a a1
)|
= lim
|(1 1
)a
a(1 1
)| lim
|1 1
| |a
a(1 1
)| lim
|a
a(1 1
)|
= |(a
a)| = |(a)(a
)| = |(a)(a)
|.
Lemma 11.20 then implies (94). This nishes the proof of Proposition 4.4.
We now state and prove the key result about morphisms.
Theorem 10.4 Let : A B be a nonzero morphism between C
-algebras.
1. is continuous, with norm 1.
2. ker() is an ideal in A.
3. (A) is a C
(a) (C
b)| , = |b
b|. Put a := b
b, noting that a
= a. By (57) and
(14) we must have (a) ,= ((a)). Then (73) implies ((a)) (a). By Urysohns lemma there
is a nonzero f C((a)) which vanishes on ((a)), so that f((a)) = 0. By Lemma 10.5 below
we have (f(a)) = 0. This is a contradiction when is injective, in which case must therefore
be isometric.
Combining the second claim with Proposition 4.4, we see that A/ ker() is a C
-algebra. This
ts into a commutative triangle of C
-algebras:
A
-
A/ ker()
@
@
@
@
@
R
B
?
Here is the canonical projection and is dened by ([a]) = (a) (where [a] is the equivalence
class in a/ ker() of a A). By the theory of vector spaces, is a vector space isomorphism
between A/ ker() and (A). Since and are morphisms between C
-algebras, so is . Since
is injective, it is isometric, as we have just shown. Hence (A/ ker()) has closed range in B.
But (A/ ker()) = (A), so that has closed range in B. Since is a morphism, its image is a
-algebra in B, which by the preceding sentence is closed in the norm of B. Hence (A), inheriting
all operations in B, is a C
-algebra.
Finally, one trivially has || = 1 and || = 1 (because is an isometry). It then follows from
= that || = 1.
We have used the following fact:
Lemma 10.5 When : A B is a morphism and a = a
then
f((a)) = (f(a)) (74)
for all f C((a)) (here f(a) is dened by the continuous continuous functional calculus, and so
is f((a)) in view of (73)).
The property is true for polynomials by (4), since for those f has its naive meaning. For general
f the result then follows by continuity.
Note that Theorem 10.4.2 has a converse: every ideal in a C
-algebra M
n
(C) of n n matrices
to innite-dimensional Hilbert spaces H is the C
-algebra B
0
(H) of compact operators on H.
72
In noncommutative geometry elements
of B
0
(H) play the role of innitesimals. In K-theory, B
0
(H) is indistinguishable from C. In the
theory of operator algebras, B
0
(H) is a basic building block for C
-algebras.
72
In the literature, one often nds the notation K(H) for B
0
(H), but this is awkward in connection to K-theory.
38
Denition 11.1 Let H be a Hilbert space. A nite-rank operator on H is an operator a B(H)
for which aH := av[ v H is nite-dimensional. Equivalently, a is a nite linear combination
nite-dimensional projections on H.
A compact operator on H is an operator that can be approximated in norm by nite-rank
operators.
73
Lemma 11.2 The collection of all nite-rank operators on H is a
-algebra in B(H). Its norm-
closure B
0
(H) is a C
B
f
(H). The second claim is
trivial as well.
Proposition 11.3 1. The unit operator 1 lies in B
0
(H) i H is nite-dimensional.
2. The C
-algebra B
0
(H) is an ideal in B(H).
74
Firstly, for any sequence (or net) a
n
B
f
(H) we may choose a unit vector v
n
(a
n
H)
. Then
(a
n
1)v = v, so that |(a
n
1)v| = 1. Hence sup
v=1
|(a
n
1)v| 1, so that |a
n
1| 0
is impossible by denition of the norm (83) in B(H).
Secondly, when a B
f
(H) and b B(H) then ab B
f
(H), since abH aH. But since
ba = (a
, and B
f
(H) is a
-algebra, one has a
B
f
(H) and hence ba B
f
(H). Hence
B
f
(H) is an ideal in B(H), save for the fact that it is not norm-closed (unless H has nite
dimension). Now if a
n
a then a
n
b ab and ba
n
ba by continuity of multiplication in B(H).
Hence B
0
(H) is an ideal by virtue of its denition.
One has a complete characterization of compact operators.
Theorem 11.4 A self-adjoint operator a B(H) is compact i a =
iI
a
i
p
i
(norm-convergent
sum), where I is countable, a
i
R, each projection p
i
is nite-dimensional (so that each nonzero
eigenvalue of a has nite multiplicity), and the set of all eigenvalues of a only has 0 as a possible
accumulation point.
For a proof see, e.g., [15].
Unlike B(H), the state space of B
0
(H) can be explicitly computed. We just state the results,
referring to [15] for details. This involves the study of a number of algebraic ideals of B(H), which
are not closed.
Denition 11.5 The Hilbert-Schmidt norm |a|
2
of a B(H) is dened by
|a|
2
2
:=
i
|ae
i
|
2
, (75)
where e
i
i
is an arbitrary basis of H; the right-hand side is independent of the choice of the basis.
The Hilbert-Schmidt class B
2
(H) consists of all a B(H) for which |a|
2
< .
The trace norm |a|
1
of a B(H) is dened by
|a|
1
:= |(a
a)
1
4
|
2
2
, (76)
where (a
a)
1
4
is dened by the continuous functional calculus. The trace class B
1
(H) consists of
all a B(H) for which |a|
1
< .
73
If a is a compact operator then aB
1
is compact in H (with the norm-topology). Here B
1
is the unit ball in H,
i.e., the set of all v H with v 1.
74
The quotient C(H) := B(H)/B
0
(H) turns out to be a very interesting C
b. (77)
If a B
1
(H) then
Tr a :=
i
(e
i
, ae
i
) (78)
is nite and independent of the basis.
75
Proposition 11.6 One has the inclusions
B
f
(H) B
1
(H) B
2
(H) B
0
(H) B(H), (79)
with equalities i H is nite-dimensional.
This chain of inclusions is sometimes seen as the non-commutative analogue of
c
(X)
1
(X)
2
(X)
0
(X)
(X),
where X is an discrete set, with equalities i X is nite. Since
1
(X) =
0
(X)
and
(X) =
1
(X)
=
0
(X)
= B
1
(H) and B
1
(H)
= B
0
(H)
is identied with B
1
(H), and a B
1
(H)
j
(p
j
) for each pairwise orthogonal family of projections p
j
j
with
j
p
j
= p.
76
He then proved that a normal state on B(H) is necessarily of the form described in
Corollary 11.8. Thus the normal states on B(H) coincide with the states on B
0
(H). In fact, this
statement turns out to be equivalent to the claim B(H) = B
1
(H)
in Theorem 11.7.
75
When a / B
1
(H), it may happen that Tr a depends on the basis; it may even be nite in one basis and innite
in another.
76
Here the sum is dened as the least upper bound of all nite sums of the p
j
, with respect to the ordering of
projections dened by p q when pH qH.
40
Appendix: Basic denitions
All vector spaces will be dened over C, and all functions will be C-valued, unless we explicitly
state otherwise. The abbreviation i means if and only if, which is the same as the symbol .
An equation of the type a := b means that a is by denition equal to b.
Denition 11.9 A norm on a vector space V is a map | | : V R such that
1. |v| 0 for all v V ;
2. |v| = 0 i v = 0;
3. |v| = [[ |v| for all C and v V ;
4. |v +w| |v| +|w| (triangle inequality).
A norm on V denes a metric d on V by d(v, w) := |v w|. A vector space with a norm that is
complete in the associated metric (in the sense that every Cauchy sequence converges) is called a
Banach space. We will denote a generic Banach space by the symbol B.
The two main examples of Banach spaces we will encounter are Hilbert spaces and certain
collections of operators on Hilbert spaces.
Denition 11.10 A pre-inner product on a vector space V is a map ( , ) : V V C such
that
1. (
1
v
1
+
2
v
2
,
1
w
1
+
2
w
2
) =
1
1
(v
1
, w
1
) +
1
2
(v
1
, w
2
) +
2
1
(v
2
, w
1
) +
2
2
(v
2
, w
2
) for
all
1
,
2
,
1
,
2
C and v
1
, v
2
, w
1
, w
2
V ;
2. (v, v) 0 for all v V .
An equivalent set of conditions is
1. (v, w) = (w, v) for all v, w V ;
2. (v,
1
w
1
+
2
w
2
) =
1
(v, w
1
) +
2
(v, w
2
) for all
1
,
2
C and v, w
1
, w
2
V ;
3. (v, v) 0 for all v V .
A pre-inner product for which (v, v) = 0 i v = 0 is called an inner product.
The equivalence between the two denitions of a pre-inner product is elementary; in fact, to
derive the rst axiom of the second characterization from the rst set of conditions, it is enough
to assume that (v, v) R for all v (use this reality with v v +iw). Either way, one derives the
Cauchy-Schwarz inequality
[(v, w)[
2
(v, v)(w, w), (81)
for all v, w V . Note that this inequality is valid even when ( , ) is not an inner product, but
merely a pre-inner product.
It follows from these properties that an inner product on V denes a norm on V by |v| :=
_
(v, v); the triangle inequality is automatic.
Denition 11.11 A Hilbert space is a vector space with inner product that is complete in the
associated norm. We will usually denote Hilbert spaces by the symbol H.
A Hilbert space is completely characterized by its dimension (i.e., by the cardinality of an
arbitrary orthogonal basis). To obtain an interesting theory, one therefore studies operators on a
Hilbert space, rather than the Hilbert space itself. Although a satisfactory mathematical theory
of unbounded operators on a Hilbert space exists, we will restrict ourselves to bounded operators.
We recall this concept in the more general context of arbitrary Banach spaces.
41
Denition 11.12 A bounded operator on a Banach space B is a linear map a : B B for
which
|a| := sup |av| [ v B, |v| = 1 < . (82)
The space of all bounded operators on a Banach space B is called L(B).
The number |a| is the operator norm, or simply the norm, of a. This terminology is justied,
as it follows almost immediately from its denition (and from the properties of the the norm on
B) that the operator norm is indeed a norm.
(It is easily shown that a linear map on a Banach space is continuous i it is a bounded operator,
but we will never use this result. Indeed, in arguments involving continuous operators on a Banach
space one almost always uses boundedness rather than continuity.)
When B is a Hilbert space H the expression (82) becomes
|a| := sup (av, av)
1
2
[ v H, (v, v) = 1. (83)
When a is bounded, it follows that
|av| |a| |v| (84)
for all v B. Conversely, when for a 0 there is a C > 0 such that |av| C|v| for all v,
then a is bounded, with operator norm |a| equal to the smallest possible C for which the above
inequality holds.
Proposition 11.13 The space L(B) of all bounded operators on a Banach space B is itself a
Banach space in the operator norm.
In view of the comments following (83), it only remains to be shown that L(B) is complete in
the operator norm. Let a
n
be a Cauchy sequence in L(B). In other words, for any > 0 there
is a natural number N() such that |a
n
a
m
| < when n, m > N(). For arbitrary v B, the
sequence a
n
v is a Cauchy sequence in B, because
|a
n
v a
m
v| |a
n
a
m
| |v| |v| (85)
for n, m > N(). Since B is complete by assumption, the sequence a
n
v converges to some w B.
Now dene a map a on B by av := w = lim
n
a
n
v. This map is obviously linear. Taking n in
(85), we obtain
|av a
m
v| |v| (86)
for all m > N() and all v B. It now follows from (82) that a a
m
is bounded. Since
a = (a a
m
) + a
m
, and L(B) is a linear space, we infer that a is bounded. Moreover, (86) and
(82) imply that |a a
m
| for all m > N(), so that a
n
converges to a. Since we have just
seen that a L(B), this proves that L(B) is complete.
We dene a functional on a Banach space B as a linear map : B C that is continuous, in
that (v)[ C|v| for some C, and all v B. The smallest such C is the norm of :
|| := sup [(v)[, v B, |v| = 1. (87)
Denition 11.14 The dual B
then v = 0.
Recall that an algebra is a vector space with an associative bilinear operation (multiplication)
: A A A; we usually write ab for a b. We call A unital if there is an element 1 A, the
unit, such that 1a = a1 = a for all a A. It is easy to see that a unit is unique when it exists.
It is clear that L(B) is an algebra with unit under operator multiplication. One easily shows
that |ab| |a| |b|.
Denition 11.17 A Banach algebra is a Banach space A which is at the same time an algebra,
in which for all a, b A one has
|ab| |a| |b| . (88)
It follows that multiplication in a Banach algebra is separately continuous in each variable. In
a Banach algebra one needs a sharper denition of a unit than for general algebras: we require
that |1| = 1.
As we have just seen, for any Banach space B the space L(B) of all bounded operators on B is
a Banach algebra. In what follows, we will restrict ourselves to the case that B is a Hilbert space
H; this leads to the Banach algebra L(H). In the theory of C
= a; (89)
(ab)
= b
; (90)
(a)
= a
. (91)
A
-algebra is an algebra with an involution.
The operator adjoint a a
a| = |a|
2
for
all a B(H). motivates the following denition.
Denition 11.19 A C
a| = |a|
2
. (94)
For C
-algebras, the property |1| = 1 for a unit follows from the axioms, and does not need
to be imposed separately. It is clear that B(H) is a C
-algebra.
We note a very useful lemma, whose proof is an easy exercise.
Lemma 11.20 1. If an involution on a Banach algebra A satises |a|
2
|a
a|, then A is a
C
-algebra.
2. For any element a of a C
| = |a|. (95)
Bibliography
[1] W.B. Arveson and R.G. Douglas (eds.), Operator Theory, Operator Algebras and Applications,
Vols. 1&2 (AMS, Providence, 1990).
[2] B. Blackadar, K-theory for Operator Algebras, 2nd ed. (Cambridge University Press, Cam-
bridge, 1999).
[3] A. Connes, Noncommutative Geometry (Academic Press, San Diego, 1994).
[4] K.R. Davidson, C
-algebras and W