1 Introduction
The question of which operator algebras are generated by a single element, or equivalently two self-adjoint elements, goes at least back to Kadison’s list of problems from 1967 (see [Reference Ge8]). He asked the question for separably acting
$\mathrm {II}_{1}$
factors, or more generally, separably acting von Neumann algebras. Kadison’s problem has been solved for all factors not of type
$\mathrm {II}_{1}$
[Reference Pearcy16, Reference Wogen26] and many classes of
$\mathrm {II}_{1}$
factors are also known to be singly generated (see for example [Reference Gao, Kunnawalkam Elayavalli, Patchell and Tan7, Reference Ge and Popa9, Reference Popa17]). The problem remains open in its full generality—for example, it is open for the free group factors
$L(\mathbb {F}_n)$
when
$n\geq 3$
.
In contrast to the von Neumann algebraic setting, it is too naive to ask if all separable
$C^*$
-algebras are singly generated—one does not need to look far to find counterexamples. For unital commutative
$C^*$
-algebras, it is known that
$C(X)$
is singly generated if and only if X embeds into the complex plane. Noncommutative counterexamples are also abundant. Algebras of the form
$C(X)\otimes M_n$
are not singly generated provided the matrix dimension n is sufficiently small compared with the dimension of X (see [Reference Nagisa14] for instance). Since the quotient of a singly generated
$C^*$
-algebra remains singly generated, more counterexamples can be constructed from extensions of these. For example, the full group
$C^*$
-algebra
$C^*(\mathbb {F}_2)$
of
$\mathbb {F}_2$
is not singly generated since it quotients onto
$C(\mathbb {T}^2)$
.
It is therefore unsurprising that the generator problem for
$C^*$
-algebras is often restricted to algebras that lack finite-dimensional representations (see [Reference Thiel and Winter23, Question 1.3] for instance), or sometimes even to simple algebras. To the best of our knowledge, the only known obstruction to single generation is the presence of homogeneous quotients that are not singly generated.
A natural class of
$C^*$
-algebras that do not admit problematic quotients is the class of graph
$C^*$
-algebras; see the decomposition described later. In this paper, we show that for any countable directed graph E, its graph
$C^*$
-algebra
$C^*(E)$
is singly generated.
Theorem 1. Let E be a countable directed graph. Then,
$C^*(E)$
is singly generated.
First introduced in [Reference Kumjian, Pask, Raeburn and Renault12] (see also [Reference Fowler, Laca and Raeburn6]), graph
$C^*$
-algebras have proven to be a class of algebras that often allow for explicit calculations [Reference Eilers, Katsura, Tomforde and West3, Reference Eilers, Restorff, Ruiz and Sørensen4, Reference Ruiz, Sims and Tomforde20], direct study of
$C^*$
-algebraic properties [Reference Eilers, Gabe, Katsura, Ruiz and Tomforde2], and testing of conjectures [Reference Suri and Tomforde21]. Even though these algebras are rarely simple, loosely speaking, they arise as iterated extensions of AF algebras, Kirchberg algebras and algebras of the form
$C(\mathbb {T})\otimes M_n$
[Reference Bates, Pask, Raeburn and Szymański1], all of which are known to be singly generated (see the following paragraph). Since single generation does not pass to extensions (see [Reference Thiel22]), Theorem 1 cannot be deduced directly from this fact. Nevertheless, this suggests that graph
$C^*$
-algebras are a natural class on which to consider the generator problem. Observe that Theorem 1 does not extend to
$C^*$
-algebras of higher-rank graphs in full generality—it is known that a k-graph can have
$C^*$
-algebra isomorphic to
$C(\mathbb {T}^k)$
(see [Reference Kumjian and Pask11, Example 1.7 (iii)]).
Let us give a brief overview of known single generation results in the
$C^*$
-setting. Early results [Reference Li and Shen13, Reference Olsen and Zame15, Reference Topping25] focused on algebras with suitable decomposition properties. This culminated with the work [Reference Thiel and Winter23] that showed that, in particular, any unital separable and
$\mathcal {Z}$
-stable
$C^*$
-algebra is singly generated. We also note that stabilisations of unital separable
$C^*$
-algebras are singly generated [Reference Olsen and Zame15, Theorem 8] and so are all AF algebras [Reference Thiel22]. In a different direction, an unpublished result, due to Kirchberg, states that any unital separable
$C^*$
-algebra containing two isometries with orthogonal ranges is singly generated (see [Reference Nagisa14, page 138] for the statement and [Reference Thiel and Winter23, Theorem 2.4] for a sketch of the proof in a special case). We also highlight that one of the major obstacles in proving single generation is a severe lack of permanence properties: single generation is not necessarily preserved by inductive limits, extensions nor stable isomorphisms. In fact, the stabilisation of a unital separable
$C^*$
-algebra is singly generated by [Reference Olsen and Zame15, Theorem 8].
The class of graph
$C^*$
-algebras contains algebras that are stable and/or
$\mathcal {Z}$
-stable (see [Reference Faurot5, Reference Tomforde24]). For the graph algebras falling into the classes above, our methods give an alternative proof for their single generation. The class also contains algebras covered by Kirchberg’s result, although those are necessarily unital. Note that the generator problem is often restricted to unital
$C^*$
-algebras, since a
$C^*$
-algebra is singly generated if and only if its minimal unitisation is. We do not make any unitality assumptions in this paper—indeed, a graph has unital
$C^*$
-algebra if and only if it has finitely many vertices.
Let us now illustrate the basic idea of our proof in the special case of a finite graph with no sinks. Let E be such a graph with edges
$e_1,\ldots ,e_m$
. Writing
$s_i$
for the corresponding partial isometries, note that
$C^*(E) = C^*(s_1,\ldots ,s_m)$
. It turns out that if E contains no sinks, the element
$d= ( \sum s_i )\, \zeta $
is a generator for
$C^*(E)$
for a suitable choice of weight
$\zeta $
belonging to the commutative subalgebra generated by all of the vertex projections and range projections of edge partial isometries. Using orthogonality of the ranges of the
$s_i$
, one finds that
$d^*d$
is a weighted sum of the range projections and, hence, they all belong to
$C^*(d)$
. Finally, multiplying d on the left by
$s_is_i^*$
shows that
$s_i$
also belongs to
$C^*(d)$
. We note that the idea of summing scalar multiples of isometries already appeared in the proof sketch of Kirchberg’s result in [Reference Thiel and Winter23, Theorem 2.4].
It turns out that the strategy described above makes no use of the unit and so extending to countable graphs without sinks is straightforward (see Corollary 3.2). The main obstacles are the sinks in E. More specifically, in the presence of sinks receiving infinitely many edges, the graph
$C^*$
-algebra is no longer generated by the edge partial isometries. We adjust the generator to be a sum of three terms, each designed to handle a different portion of the graph. The first captures the sinks and the edges terminating at them, the second captures all the edges ‘sufficiently far’ from the sinks, and the third takes care of the remaining edges and helps glue the first two terms together. A careful double induction argument lets us recover each edge partial isometry and vertex projection from the generator.
The paper is organised as follows. Section 2 recalls some basic facts about spectral theory and graph
$C^*$
-algebras, while Section 3 treats the special case of a graph E with no sinks. In Section 4, we construct the candidate generator for
$C^*(E)$
and then verify that it is indeed a generator in Section 5.
2 Preliminaries and basic facts—spectra
To fix notational conventions, let us recall the definition of a directed graph and its associated
$C^*$
-algebra.
Definition 2.1. A directed graph
$E = (E^0, E^1, r, s)$
is a quadruple consisting of countable vertex and edge sets
$E^0$
and
$E^1$
, along with range and source maps
$r,s\ \colon E^1 \to ~E^0$
.
Definition 2.2 [Reference Fowler, Laca and Raeburn6, Definition 1]
Let
$ E = (E^0, E^1, r, s)$
be a directed graph. A Cuntz–Krieger E-family in a
$C^*$
-algebra A consists of a family
$\{p_v\, \ \colon v \in E^0\} \subseteq A$
of mutually orthogonal projections and a family
$\{s_e \ \colon e \in E^1\} \subseteq A$
of partial isometries with mutually orthogonal ranges such that:
-
(i) $s_e^*s_e = p_{s(e)}$
for all
$e \in E^1$
; -
(ii) $s_e s_e^* \le p_{r(e)}$
for all
$e \in E^1$
; and -
(iii) $p_v = \sum _{r(e)=v} s_e s_e^*$
whenever
$0 < |r^{-1}(v)| < \infty $
.
The graph
$C^*$
-algebra
$C^*(E)$
is the universal
$C^*$
-algebra generated by a Cuntz–Krieger E-family.
We use the convention that edges and their associated partial isometries go in the same direction, following [Reference Raeburn18]. This is in contrast to [Reference Fowler, Laca and Raeburn6, Reference Rangaswamy and Tomforde19], for example, where the opposite convention is adopted. Universality of
$C^*(E)$
is not important for showing that it is singly generated; we prove directly that any
$C^*$
-algebra generated by a Cuntz–Krieger E-family is singly generated.
Let us introduce some notation for edges and vertices in a graph. The terms interior and boundary describe how far an edge or vertex is from a sink. The generator we construct in Section 4 has three components coming from interior edges, boundary edges and sinks.
Notation 2.3. Let
$E = (E^0, E^1, r, s)$
be a directed graph. A vertex
$v \in E^0$
is called a sink if
$s^{-1}(v) = \emptyset $
(that is, if v does not emit any edges); we denote by
$E^0_{\mathrm {sink}} \subseteq E^0$
the set of sinks. We call a vertex
$v \in E^0$
a boundary vertex if it is not a sink and
$r(s^{-1}(v)) \subseteq E^0_{\mathrm {sink}}$
(that is, if all edges emitted from v terminate at a sink); we denote by
$E^0_{\mathrm {bdry}} \subseteq E^0$
the set of boundary vertices. We call all other vertices interior vertices; we denote by
$E^0_{\mathrm {int}} \subseteq E^0$
the collection of interior vertices (so
$E^0 = E^0_{\mathrm {int}} \sqcup E^0_{\mathrm {bdry}} \sqcup E^0_{\mathrm {sink}}$
).
We call an edge
$e \in E^1$
a sink edge if
$r(e) \in E^0_{\mathrm {sink}}$
, a boundary edge if
$r(e) \in E^0_{\mathrm {bdry}}$
and an interior edge if
$r(e) \in E^0_{\mathrm {int}}$
. We denote by
$E^1_{\mathrm {sink}} \subseteq E^1$
the set of sink edges, by
$E^1_{\mathrm {bdry}} \subseteq E^1$
the set of boundary edges and by
$E^1_{\mathrm {int}} \subseteq E^1$
the set of interior edges.
Notation 2.4. Let E be a directed graph. For vertices
$v,w \in E^0$
, we denote by
$p_v, q_w \in C^*(E)$
the associated projections and for edges
$e,f \in E^1$
, we denote by
$s_e, t_f \in C^*(E)$
the associated partial isometries. We call
$s_e s_e^*$
the range projection associated with the edge e. From now on, w is exclusively used to denote a sink and f is exclusively be used to denote a sink edge.
2.1 Spectra
In this subsection, we record two basic facts about spectra. The first is a general fact about orthogonal normal elements in a
$C^*$
-algebra. The second states that certain self-adjoint elements in a graph
$C^*$
-algebra have countable spectra and is crucial for our construction of the generator in Section 4.
If A and B are singly generated
$C^*$
-algebras and A is unital (note that the direct sum of two nonunital singly generated
$C^*$
-algebras need not be singly generated. Consider
$C_0(X) \oplus C_0(X)$
, where X is the punctured disk, for example), then the direct sum
${A\oplus B}$
is also singly generated. To see this, let a and b be their respective generators and without loss of generality, assume that
$a, b < 1/2$
. After taking real and imaginary parts, an application of functional calculus reveals that
$(1_A + i1_A + a, b)$
is a generator for
$A \bigoplus B$
. We need the following simple variation of this fact in the commutative setting, where we drop the assumption that A is unital and instead ask for control over the spectra of the generators
$a \in A$
and
$b \in B$
.
Lemma 2.5. Let A be a
$C^*$
-algebra and
$a,b\in A$
two orthogonal normal elements with
Then,
$a,b\in C^*(a+b)$
.
Proof. By orthogonality,
Since
$\sigma (a)$
and
$\sigma (b)$
are compact, it follows from (2-1) that the disjoint union
$(\sigma (a) \setminus \{0\}) \sqcup (\sigma (b) \setminus \{0\} )$
is homeomorphic to
$U := (\sigma (a) \cup \sigma (b)) \setminus \{0\} \subseteq \mathbb {C}$
. Under the identification
$\Phi \ \colon C^*(a,b) \xrightarrow {\cong } C_0(U)$
, we find
Since
$\Phi (a+b)$
separates points and vanishes nowhere in U, it generates
$C_0(U)$
as a
$C^*$
-algebra (by the locally compact version of the Stone–Weierstrass theorem). Hence,
$a,b \in C^*(a+b)$
as desired.
To apply Lemma 2.5 in our setting, we need the following to control the spectra of certain self-adjoint elements in graph
$C^*$
-algebras.
Lemma 2.6. Let E be a directed graph. Let B be the
$C^*$
-subalgebra of
$C^*(E)$
generated by
$E^0_{\mathrm {sink}} \cup E^1_{\mathrm {sink}} \cup E^1_{\mathrm {bdry}}$
. Then, every self-adjoint element of B has countable spectrum.
Proof. Let F be the subgraph of E consisting only of the edges
$E^1_{\mathrm {sink}} \cup E^1_{\mathrm {bdry}}$
along with their ranges and sources, together with
$E^0_{\mathrm {sink}}$
. Since F is entrance complete (in the sense that for each edge
$e \in F^1$
, we have
$r_E^{-1}(r_E(e)) \subseteq F^1$
), the family
is a Cuntz–Krieger F-family in
$C^*(E)$
, so there is a
$*$
-homomorphism
${\varphi \ \colon \!C^*(F) \to B}$
. Clearly,
$\varphi $
is surjective; since F is acyclic, the Cuntz–Krieger uniqueness theorem [Reference Fowler, Laca and Raeburn6, Theorem 2] shows that
$\varphi $
is injective and hence an isomorphism. (As noted earlier, this paper uses the opposite convention for the direction of edge partial isometries to that used in [Reference Fowler, Laca and Raeburn6, Reference Rangaswamy and Tomforde19].)
Note that F is acyclic and has countably many paths, since the maximum path length in F is
$2$
. By [Reference Rangaswamy and Tomforde19, Theorem 6.5],
$C^*(F)$
has an elementary composition series (of countable length). It then follows from [Reference Huruya10] that every self-adjoint element of
${C^*(F) \cong B}$
has countable spectrum, as required.
3 Graphs with no sinks
In this section, we present a short proof that the
$C^*$
-algebra of a graph with no sinks is singly generated. As in Section 5, a key feature of graph
$C^*$
-algebras we use is that edge partial isometries have mutually orthogonal range projections. As remarked on in Section 1, a similar idea is used in the proof of [Reference Thiel and Winter23, Theorem 2.4].
The generator d in this section is of the form
$( \sum \epsilon _e {s_e} )\, \xi ^{\frac 12}$
, where
$\sum \epsilon _e {s_e}$
is a weighted sum of all edge partial isometries, and
$\xi $
is a positive element belonging to the (commutative)
$C^*$
-subalgebra generated by all vertex and range projections. The element
$\xi $
is chosen so that the
$C^*$
-subalgebra generated by
$d^*d$
contains all range projections
$s_e s_e^*$
. Range projections are pairwise orthogonal, so multiplying the generator d on the left by
$s_e s_e^*$
shows that
$s_e$
also belongs to
$C^*(d)$
. Since the
$C^*$
-algebra of a graph with no sinks is generated by its edge partial isometries, it follows that d generates
$C^*(E)$
.
The following lemma describes the construction of
$\xi $
and is also used in Section 4. Roughly speaking, the existence of an appropriate positive element
$\xi $
is guaranteed because any commutative
$C^*$
-algebra generated by a family of commuting projections has 0-dimensional spectrum and, in particular, is therefore singly generated.
Lemma 3.1. Let
$S \subseteq E^1$
be a set of edges in a directed graph E. Let
$V := s(S) \subseteq E^0$
be the set of sources of edges in S and let
$T := r^{-1}(V) \subseteq E^1$
be the set of all edges that have range in V. Define
Let
$(\epsilon _e)_{e \in S}$
be positive real numbers satisfying
$\sum _{e \in S} \epsilon _e < \infty $
. There exists a positive element
$\xi \in A$
of norm at most 1 for which
satisfies the following:
-
(i) $A = C^*(d^*d)$
; -
(ii) for any $v \in V$
, there exists
$h_v \in A$
such that
$p_v = \xi ^{\frac 12} h_v$
.
Moreover, given any countable compact set
$C \subseteq \mathbb {C}$
, the element
$\xi $
can be chosen so that
$d^*d$
has spectrum disjoint from
$C \setminus \{0\}$
.
Proof. Set
$\mu _v := \sum _{\substack {e \in S \cap s^{-1}(v)}} \epsilon _e^2$
for each
$v \in V$
. Note that each
$\mu _v$
is finite and strictly positive because the set
$S \cap s^{-1}(v)$
is nonempty for every
$v \in V$
. Let
$C \subseteq \mathbb {C}$
be countable and compact, so that for any
$\varepsilon>0$
, there exists an interval
$[\theta , \theta '] \subseteq (0,\varepsilon )$
of nonzero length such that
$C\cap [\theta ,\theta ']=\emptyset $
. Let
$\{[\theta _v,\theta '_v]\}_{v \in V} \subseteq (0, 1)$
be a set of pairwise disjoint intervals of nonzero length such that
$C\cap [\theta _v,\theta '_v]=\emptyset $
and
$({\theta _v'}/{\mu _v}) \le 1$
for all
$v \in V$
. If V is infinite, we also require that for any
$\varepsilon>0$
, there only exist finitely many
$v \in V$
for which
$({\theta _v'}/{\mu _v})> \varepsilon $
.
The algebra A is commutative with a 0-dimensional spectrum. Let
$\Omega $
denote its spectrum and let
$\Psi \ \colon A \xrightarrow {\cong } C_0(\Omega )$
be the canonical isomorphism. For each
$v \in V$
, let
$K_v \subseteq \Omega $
be the compact open subset satisfying
$\Psi (p_v) = \mathbb {1}_{K_v}$
. Note that
$\Omega $
is the disjoint union of the
$K_v$
. Let
$\xi \in A$
be such that for each
$v \in V$
, the restriction
$\Psi (\xi )|_{K_v}$
is injective and has range in
$[({\theta _v}/{\mu _v}), ({\theta _v'}/{\mu _v})].$
(This is possible because any second-countable 0-dimensional space embeds into the interval.) Note that
$\xi $
has norm at most 1.
Set
$ r := \sum _{e \in S} \, \epsilon _e^2 \, s_e^* s_e \in A $
and note that
$r\xi = d^*d$
by orthogonality of ranges of the partial isometries
$s_e$
. On each compact open set
$K_v$
, the function
$\Psi (r)$
takes constant value
$\mu _v$
, and therefore
$\Psi (d^*d)|_{K_v}$
is injective and takes values in
$[\theta _v, \theta _v']$
. The function
$\Psi (d^*d)$
is therefore strictly positive and injective on
$\Omega $
, and hence generates
$C_0(\Omega )$
as a
$C^*$
-algebra (by the locally compact version of the Stone–Weierstrass theorem). It follows that
$A = C^*(d^*d)$
. This proves part (i). Note also that
$\Psi (d^*d)$
has range disjoint from
$C \setminus \{0\}$
and, hence,
$d^*d$
has spectrum disjoint from
$C \setminus \{0\}$
.
We now prove part (ii). Let
$v \in V$
. The function
$\Psi (\xi )$
has range in
$[({\theta _{v}}/{\mu _{v}}), ({\theta _{v}'}/{\mu _{v}})]$
when restricted to the compact open set
$K_{v}$
. Since
$({\theta _{v}}/{\mu _{v}})>0 $
, there exists
$h_v \in A$
such that the function
$\Psi (h_v) \in C_0(\Omega )$
satisfies
$\Psi (\xi )^{\frac 12} \Psi (h_v) = \mathbb {1}_{K_{v}}$
. Therefore,
$\xi ^{\frac 12}h_v = p_v$
, as desired.
The following is now an immediate consequence of the preceding lemma.
Corollary 3.2. Let E be a directed graph with no sinks. Then,
$C^*(E)$
is singly generated.
Proof. Let
$S = E^1$
be the set of all edges in E. Let V and T be as in Lemma 3.1. Since E has no sinks, we have that
$V = E^0$
and
$T = E^1$
. Let
$(\epsilon _e)_{e \in E^1}$
be any sequence of positive real numbers satisfying
$\sum _{e \in E^1} \epsilon _e < \infty $
, and let A,
$\xi $
and d be as in Lemma 3.1. Take arbitrary
$e \in E^1$
and let
$h \in A = C^*(d^*d)$
be such that
$\xi ^{\frac 12}h = s_e^* s_e$
. Since
$s_e s_e^* \in A = C^*(d^*d)$
, we can use the definition of d to deduce that
belongs to
$C^*(d)$
. It follows that
$C^*(d) = C^*(E)$
because
$C^*(E)$
is generated by its edge partial isometries.
4 A generator for
$C^*(E)$
Let E be a countable directed graph. In this section, we construct an element
${g\in C^*(E)}$
, which turns out to be a generator of
$C^*(E)$
.
Notation 4.1. Let
$\{w_1, w_2, \ldots \} = E^0_{\mathrm {sink}}$
denote the set of sinks in E. For each sink
$w_m$
, let
$\{f_{m,1}, f_{m,2}, \ldots \} = r^{-1}(w_m)$
denote the set of edges terminating at
$w_m$
. Note that
$\{f_{m,n}\}_{m,n \ge 1}$
is equal to
$E^1_{\mathrm {sink}}$
, the set of all sink edges. For each sink
$w_m$
, let
${q_m := q_{w_{m}} \in C^*(E)}$
denote the associated projection and, for each sink edge
$f_{m,n}$
, let
$t_{m,n} := t_{f_{m,n}} \in C^*(E)$
denote the associated partial isometry.
For each
$v \in E^0_{\mathrm {bdry}}$
, let
$m(v) \in \mathbb {N}$
be the smallest positive integer for which there exists an edge f with
$s(f) = v$
and
$r(f) = w_{m(v)}$
. Write
$V_\ell := \{ v \in E^0_{\mathrm {bdry}} \ \colon m(v) = \ell \}$
for each
$\ell \in \mathbb {N}$
. Note that
$V_1, V_2, \ldots $
are pairwise disjoint and
$E^0_{\mathrm {bdry}}$
is equal to their union.
Set
$Y := s(E^1_{\mathrm {bdry}}) \subseteq E^0_{\mathrm {int}}$
, the set of (interior) vertices y for which there exists an edge
$e \in E^1_{\mathrm {bdry}}$
with
$s(e) = y$
. For each
$y \in Y$
, let
${\{e_{y, 1},e_{y, 2}, \ldots \} = E^1_{\mathrm {bdry}} \cap s^{-1}}$
$(y)$
be the set of all boundary edges with source equal to y. Note that
$\{e_{y,n}\}_{y \in Y, n \ge 1}$
is equal to
$E^1_{\mathrm {bdry}}$
, the set of all boundary edges. For each boundary edge
$e_{y,n}$
, let
$s_{y,n} := s_{e_{y,n}} \in C^*(E)$
denote the associated partial isometry. Note that any of the sets Y,
$V_\ell $
,
$\{w_1, w_2, \ldots \}, \ \{f_{m,1}, f_{m,2}, \ldots \}$
may be finite or empty. Given
$y \in Y$
, the set
$\{e_{y, 1},e_{y, 2}, \ldots \}$
may also be finite.
Let us comment on the labelling of edges and vertices. Our goal in Section 5 is to show that all edge partial isometries and sink projections belong to
$C^*(g)$
, where g denotes the candidate generator for
$C^*(E)$
. If a family of projections or partial isometries has been enumerated in Notation 4.1, then we use induction to show that all elements of this family belong to
$C^*(g)$
(see Lemma 5.2 and Proposition 5.5).
The following lemma is immediate by the Cuntz–Krieger relations in Definition 2.2.
Lemma 4.2. We have the following relations for all integers
$m,n,m',n',k \ge 1$
, edges
$e, e' \in E^1$
and vertices
$y \in Y = s(E^1_{\mathrm {bdry}})$
:
Moreover,
Choose a strictly decreasing sequence
$(\delta _m)_{m=1}^\infty \subseteq (0, 1)$
such that
$\sum _{m=1}^\infty \delta _m < \infty $
. Let
$(\alpha _{y,n})_{y \in Y,n \ge 1} \subseteq (0,1)$
satisfy
$\sum _{y \in Y, n \ge 1} \alpha _{y,n} < \infty $
and be such that
for all
$\ell $
. This implies that
Let the double sequence
$(\gamma _{m,n})_{m,n=1}^\infty $
be such that
$\sum _{m,n=1}^\infty (\gamma _{m,n}-\delta _m) < \infty $
, and such that
$(\gamma _{m,n})_{n=1}^\infty \subseteq (\delta _m, \delta _{m-1})$
is a strictly decreasing sequence for each
$m \in \mathbb {N}$
. Set
${\beta _{m,n} := (({\gamma _{m,n}-\delta _m})/{2})}$
for each
$m,n \in \mathbb {N}$
. Note that
$\sum _{m,n=1}^\infty \beta _{m,n}< \infty $
. Define
Note that all sums converge absolutely in norm, so that
$a,b$
and c are well-defined elements of
$C^*(E)$
. Let
$C \subseteq \mathbb {C}$
denote the spectrum of
$a^*a + (b+c)^* (b+c)$
. By Lemma 2.6, C is a countable compact set. Let S denote the set of edges
$E^1_{\mathrm {int}} \cup \{e_{y,1}\}_{y \in Y}$
and let
$(\epsilon _e)_{e \in E^1_{\mathrm {int}}}$
be a sequence of positive real numbers such that
$\sum _{e \in E^1_{\mathrm {int}}} \epsilon _e < \infty $
. Note that
$E^0_{\mathrm {int}}$
is equal to the set of sources of edges in S. Define
$A(E)$
to be the subalgebra
Applying Lemma 3.1 to the set S yields a positive element
$\xi \in A(E)$
of norm at most 1 such that
satisfies the following:
-
(i) $A(E) = C^*(d^*d)$
; -
(ii) for any $e \in S$
, there exists
$h \in A(E)$
such that
$s_e^*s_e = \xi ^{\frac 12} h$
; -
(iii) the spectrum of $d^*d$
is disjoint from
$C \setminus \{0\}$
.
We now define the candidate generator g for the graph
$C^*$
-algebra
$C^*(E)$
by
5 The proof
In this section, we show that the element g constructed in Section 4 generates
$C^*(E)$
. The strategy uses induction and goes broadly as follows. Our goal is to show that each edge partial isometry
$s_e$
and sink projection
$q_i$
belongs to
$C^*(g)$
. Once we have shown that
$s_e$
(respectively
$q_i$
) belongs to
$C^*(g)$
, we subtract all terms involving
$s_e$
(respectively
$q_i$
) from g to obtain a simplified generator (see (5-1) and (5-3)). The coefficients in the generator g are carefully arranged so that all edge partial isometries and sink projections can be extracted via an induction procedure using these simplified generators (see Lemma 5.4 and Proposition 5.5).
In Section 5.1, it is shown that all partial isometries associated with interior edges belong to
$C^*(g)$
. Similarly, Section 5.2 deals with boundary edges, and Section 5.3 deals with sinks and sink edges.
5.1 Interior edges
In the following proposition, we mirror the proof of Corollary 3.2 and show that all partial isometries associated with interior edges belong to
$C^*(g)$
.
Proposition 5.1. Let
$g \in C^*(E)$
be the candidate generator from (4-5) and let
$A(E)$
be as in (4-3). Then,
$A(E) \subseteq C^*(g)$
. Consequently, all partial isometries associated with interior edges belong to
$C^*(g)$
. In particular,
$( \sum _{e \in E^1_{\mathrm {int}}} \epsilon _e s_e )\, \xi ^{\frac 12}$
belongs to
$C^*(g)$
.
Proof. By orthogonality of range projections of edges and Lemma 4.2, we have that
${a^*d = a^*(b+c) = d^*(b+c) = 0}$
. (In (4-2), the sum defining a contains terms of the form
$\alpha _{y,k}s_{y,k}s^*_{y,k-1}$
for
$k \ge 2$
, so
$a^*d$
indeed vanishes.) Hence,
The positive elements
$a^*a + (b+c)^*(b+c)$
and
$d^*d$
are orthogonal, and, away from 0, they have disjoint spectra by condition (iii) above. Therefore,
$d^*d$
belongs to
$C^*(g)$
by Lemma 2.5. It follows that
$A(E) \subseteq C^*(g)$
by condition (i) above.
We now show that all partial isometries associated with interior edges belong to
$C^*(g)$
. Let
$e \in E^1_{\mathrm {int}}$
. Then,
$s_e s_e ^* \in A(E) \subseteq C^*(g)$
, so
$s_e s_e^* g \in C^*(g)$
. Observe that
by orthogonality of range projections. Next, by condition (ii) above, there exists
${h \in A(E) \subseteq C^*(g)}$
such that
$\xi ^{\frac 12}h =s_e^*s_e$
. So,
is an element of
$C^*(g)$
. Since
$\epsilon _e>0$
, we get that
$s_e \in C^*(g)$
, as desired.
5.2 Boundary edges
The previous subsection proves that all partial isometries associated with interior edges belong to
$C^*(g)$
. We subtract all terms involving interior edges from g to obtain a new element
$g_{1,1} \in C^*(g)$
defined in (5-1). All terms involving boundary edges are captured in a new element
$a_1$
defined in (5-2). In this subsection, we show that all partial isometries associated with boundary edges belong to the
$C^*$
-subalgebra jointly generated by g and
$a_1$
. In Section 5.3, it is shown that
$a_1 \in C^*(g)$
, so that all partial isometries associated with boundary edges belong to
$C^*(g)$
, as desired.
Define
where
Alternatively,
$a_1$
can be written as
$a_1 = d - ( \sum _{e \in E^1_{\mathrm {int}}} \epsilon _e s_e )\, \xi ^{\frac 12} + a$
. (The element
$a_1$
is the sum of a and the ‘leftover’ terms from d.) Note that
$g_{1,1} \in C^*(g)$
since
$( \sum _{e \in E^1_{\mathrm {int}}} \epsilon _e s_e )\, \xi ^{\frac 12} \in C^*(g)$
by Proposition 5.1.
Lemma 5.2. All partial isometries associated with boundary edges belong to
$C^*(g, a_1)$
.
Proof. Recall from Notation 4.1 that Y denotes the set of vertices
$s(E^1_{\mathrm {bdry}}) \subseteq E^0_{\mathrm {int}}$
and that the set of boundary edges is equal to
$\{e_{y,n}\}_{y \in Y, n \ge 1}$
. Our first claim is that for any
$y \in Y$
, the partial isometry
$s_{y,1}$
belongs to
$C^*(g, a_1)$
. By the construction of
$\xi $
and d in (4-4), there exists an element
$h \in A(E)$
such that
$\xi ^{\frac 12}h= s_{y,1}^* s_{y,1}$
. By Lemma 4.2,
Observe that
$a_1h$
belongs to
$C^*(g, a_1)$
by Proposition 5.1 and, therefore,
$s_{y,1}$
also belongs to
$C^*(g, a_1)$
since
$\alpha _{y,1}>0$
. This proves the first claim.
Next, since
$\xi \in A(E) \subseteq C^*(g)$
(Proposition 5.1), we deduce that
belongs to
$C^*(g, a_1)$
. Fix
$y \in Y$
and note that
${a s_{y,n} = \alpha _{y,n+1} s_{y,n+1}}$
for any
$n \ge 1$
by Lemma 4.2. It follows from the first claim that
$s_{y,2} \in C^*(g, a_1)$
since
$\alpha _{y,2}> 0$
. Continuing inductively, we deduce that
$s_{y,n} \in C^*(g, a_1)$
for any
$n \ge 1$
. Since
$y \in Y$
is arbitrary, we have shown that all partial isometries associated with boundary edges belong to
$C^*(g, a_1)$
, which finishes the proof.
The inequality in the following lemma is crucial in Lemma 5.4 and the associated induction procedure in Proposition 5.5.
Lemma 5.3. Let
$a_1$
be as in (5-2). Then,
$a_1 = \sum _{v \in E^0_{\mathrm {bdry}}} p_v a_1$
as a norm-convergent sum and the inequality
holds for any m.
Proof. For any
$v \in E^0_{\mathrm {bdry}}$
,
Therefore, by (4-1),
for any m, as desired. Taking
$m = 1$
gives that
$\sum _{v \in E^0_{\mathrm {bdry}}} \|p_v a_1\| \le \delta _1 < \infty $
. Hence, the sum
$\sum _{v \in E^0_{\mathrm {bdry}}} p_v a_1$
converges absolutely in norm. Since all edges in
$\{e_{y,n}\}_{y \in Y, n \ge 1}$
have range in
$E^0_{\mathrm {bdry}}$
, it is clear from (5-2) that this sum is equal to
$a_1$
.
5.3 Sinks and sink edges
In this subsection, we show that
$C^*(g)$
contains all sink projections and all partial isometries associated with sink edges. It then follows that the candidate generator g from (4-5) does indeed generate
$C^*(E)$
.
In Proposition 5.5, we show by induction (with respect to the lexicographic ordering on
$\mathbb {N} \times \mathbb {N}$
) that all sink edge partial isometries
$t_{M,N}$
belong to
$C^*(g)$
. Lemma 5.4 provides the inductive step. Simultaneously, we show by induction on M that all sink projections
$q_M$
belong to
$C^*(g)$
. Once we have shown that a given partial isometry
$t_{M,N}$
belongs to
$C^*(g)$
, we subtract all terms involving
$t_{M,N}$
from the generator to obtain a ‘modified generator’
$g_{M,N+1}$
(see (5-3)). Similarly, once we have shown that a given sink projection
$q_M$
belongs to
$C^*(g)$
, we subtract all terms involving
$q_{M}$
from the generator to obtain a ‘modified generator’
$g_{M+1,1}$
. Note that this also includes subtracting all terms involving boundary edges with range in
$V_M$
, so that
$a_M$
is replaced by
$a_{M+1}$
(see (5-4)).
We equip
$\mathbb {N} \times \mathbb {N}$
with the lexicographic ordering. That is, we write
$(m_1,n_1) \ge (m_2, n_2)$
if and only if
$m_1> m_2$
or
$n_1 \ge n_2$
and
$m_1 = m_2$
. For
$N,M \ge 1$
, we define
where
We have used Lemma 5.3 to show that the sum in (5-4) is absolutely convergent. Note that this notation agrees with
$g_{1,1}$
and
$a_1$
, as defined in (5-1) and (5-2).
Lemma 5.4. For any
$M,N \ge 1$
,
$t_{M,N} \in C^*(g_{M,N})$
and
$q_{M} \in C^*(g_{M+1,1} + \delta _M q_M)$
.
Proof. For
$k \ge 1$
, we have the following by Lemma 4.2:
By assumption, we have
$\delta _M < \gamma _{M,N}$
and
$\|a_M\| \le \delta _M$
by Lemma 5.3, so the first term converges to
$0$
as
$k \to \infty $
. The second term converges to 0 by the monotone convergence theorem, since
$\delta _m \le \delta _M < \gamma _{M,N}$
for all
$m \ge M$
. For the third and fourth terms, the sums over
$(m,n) \ge (M, N+1)$
converge to 0 as
$k \to \infty $
. Indeed,
since the projections
$t_{m,n}t_{m,n}^*$
are mutually orthogonal and the double sequence
$(\gamma _{m,n})$
is decreasing with respect to the lexicographic ordering. Note that
$\sum _{j=1}^\infty \gamma _{M,N+1}^{-j} \|a_M\|^{j-1}$
converges since
$\delta _M < \gamma _{M,N+1}$
. Then, for
$(m,n) \ge (M,N+1)$
,
where
$C_{M,N}$
is a constant independent of
$m,n$
and k. It is then clear that the sum of these terms over
$(m,n) \ge (M,N+1)$
converges to 0 as
$k \to \infty $
. Overall, when taking the limit
$k \to \infty $
in (5-5), all that remains is the limit of the summands
$(m,n) = (M,N)$
from the third and fourth terms. Therefore,
as
$k \to \infty $
, so
$y \in C^*(g_{M,N})$
. Write
so
$y = t_{M,N}t_{M,N}^* + t_{M,N} z$
. Then,
$ yy^* = t_{M,N}t_{M,N}^* + t_{M,N} z z^* t_{M,N}^*. $
Since
$\|a_M\| \le \delta _M$
and
$\beta _{M,N} = \tfrac 12 (\gamma _{M,N} - \delta _M)$
,
Hence,
$yy^*$
is a small perturbation of the projection
$t_{M,N}t_{M,N}^*$
, so that
$ \lim _{k\to \infty } (yy^*)^{1/k} = t_{M,N}t_{M,N}^*$
. Explicitly,
$yy^*$
is the sum of a projection
$t_{M,N}t_{M,N}^*$
and a positive element
${x := t_{M,N} z z^* t_{M,N}^*}$
that is contained in
$t_{M,N}t_{M,N}^*$
and has norm strictly less than 1. By working in the commutative
$C^*$
-algebra
$C^*(x, t_{M,N}t_{M,N}^*)$
, it is clear that
$(x + t_{M,N}t_{M,N}^*)^{1/k} \to t_{M,N}t_{M,N}^*$
as
$k \to \infty $
. Thus,
$t_{M,N}t_{M,N}^* \in C^*(g_{M,N})$
. Finally, note that
so
$t_{M,N} \in C^*(g_{M,N})$
, as claimed.
Next, consider the limit of
$({1}/{\delta _M^k})(g_{M+1,1} + \delta _M q_M)^k$
as
$k \to \infty $
. The elements
$g_{M+1,1}$
and
$q_M$
are orthogonal by Lemma 4.2; hence,
$(g_{M+1,1} + \delta _M q_M)^k = g_{M+1,1}^k + \delta _M^k q_M$
. By (5-6), the limit
$\lim _{k \to \infty }({1}/({\gamma _{M+1,1}^k}))g_{M+1,1}^k$
exists; hence,
$\lim _{k \to \infty }({1}/{\delta _{M}^k})g_{M+1,1}^k = 0$
since
$\gamma _{M+1,1} < \delta _M$
. It follows that
$\lim _{k \to \infty } ({1}/{\delta _M^k})(g_{M+1,1} + \delta _M q_M)^k = q_M$
. So, indeed
$q_m \in C^*(g_{M+1,1} + \delta _M q_M)$
, as claimed.
Proposition 5.5. Let
$g_{1,1}$
be as in (5-1). All projections and partial isometries associated with sinks and sink edges belong to
$C^*(g_{1,1})$
, and hence to
$C^*(g)$
. Also,
$a_1$
belongs to
$C^*(g_{1,1})$
and hence to
$C^*(g)$
, where
$a_1$
is as in (5-2).
Proof. Fix
$m \ge 1$
. Let us show, by induction on n, that
$t_{m,n} \in C^*(g_{m,1})$
for all
$n \ge 1$
. By Lemma 5.4, the partial isometry
$t_{m,1}$
belongs to
$C^*(g_{m,1})$
. Assume that
${t_{m,1}, \ldots , t_{m,N} \in C^*(g_{m,1})}$
for some
$N \ge 1$
. Then,
also belongs to
$C^*(g_{m,1})$
. By Lemma 5.4, the partial isometry
$t_{m,N+1}$
belongs to
$C^*(g_{m,N+1})$
and, hence, to
$C^*(g_{m,1})$
. Therefore, by induction on n, we have that
${t_{m,n} \in C^*(g_{m,1})}$
for all
$n \ge 1$
, as claimed.
Next, let us show, by induction on m, that
$q_m$
and
$g_{m,1}$
belong to
$C^*(g_{1,1})$
for any
$m \ge 1$
. Assume that
$g_{m,1} \in C^*(g_{1,1})$
for some
$m \ge 1$
. By the claim above, the partial isometry
$t_f$
belongs to
$C^*(g_{1,1})$
for any edge f terminating at the sink
$w_m$
. By considering
$t_f^* t_f$
for such edges, it follows that
$p_v$
belongs to
$C^*(g_{1,1})$
for any vertex
$v \in V_m$
(since for any vertex
$v \in V_m$
, there exists an edge whose source is equal to v and whose range is equal to
$w_m$
). By Lemma 4.2, we have
$p_v g_{1,1} = p_v a_1$
for any
$v \in E^0_{\mathrm {bdry}}$
and, therefore,
$\sum _{v \in V_m} p_v a_1 \in C^*(g_{1,1})$
, where we have used Lemma 5.3 to show that this sum converges. By the first claim, it then follows that
also belongs to
$C^*(g_{1,1})$
. By Lemma 5.4, the projection
$q_m$
belongs to the
$C^*$
-subalgebra
$C^*(g_{m+1,1} + \delta _m q_m)$
and, hence, to
$C^*(g_{1,1})$
. Subtracting
$\delta _m q_m$
from the expression above shows that
$g_{m+1,1}$
belongs to
$C^*(g_{1,1})$
. Therefore, by induction on m, the elements
$q_m$
and
$g_{m,1}$
belong to
$C^*(g_{1,1})$
for any
$m \ge 1$
. By the first claim, it follows that
${t_{m,n} \in C^*(g_{1,1})}$
for all
$m,n \ge 1$
.
We have shown that for any sink edge f, the partial isometry
$t_f$
lies in
$C^*(g_{1,1})$
. Therefore, by considering
$t_f^* t_f$
for such edges, it follows that
$p_v$
belongs to
$C^*(g_{1,1})$
for any boundary vertex v. By Lemma 4.2, we have
$p_v g_{1,1} = p_v a_1 \in C^*(g_{1,1})$
for any
$v \in E^0_{\mathrm {bdry}}$
and, therefore,
$a_1$
belongs to
$C^*(g_{1,1})$
since
$a_1 = \sum _{v \in E^0_{\mathrm {bdry}}} p_v a_1$
(Lemma 5.3). This completes the proof of the proposition.
Theorem 5.6. The element g from (4-5) generates
$C^*(E)$
as a
$C^*$
-algebra. Consequently, the
$C^*$
-algebra of any countable directed graph is singly generated.
Proof. By Proposition 5.1, all partial isometries associated with interior edges belong to
$C^*(g)$
. By Proposition 5.5, all projections and partial isometries associated with sinks and sink edges belong to
$C^*(g)$
. Also, the element
$a_1$
defined in (5-2) belongs to
$C^*(g)$
by Proposition 5.5 and, therefore, all partial isometries associated with boundary edges belong to
$C^*(g)$
by Lemma 5.2. To conclude, recall that every graph
$C^*$
-algebra is generated by its edge partial isometries and sink projections.
Remark 5.7. As hinted at in Section 1, the argument can be simplified considerably when no sink receives infinitely many edges or when there are no sinks at all.
The latter case is handled in Corollary 3.2. In this case, all edges are interior edges and the generator g (4-5) is equal to d (4-4).
If the graph E has no sinks receiving infinitely many edges, then the proof also simplifies since the
$C^*$
-algebra is generated only by the edge partial isometries in this case. More concretely, Section 5.3 becomes redundant and an element of the form
$\tilde {a}+\tilde {d}+\sum _{n} ({1}/{n^2})q_n$
generates
$C^*(E)$
, where
$\{q_1, q_2, \ldots \}$
is the set of projections corresponding to vertices that do not emit or receive any edges, and where
$\tilde {a}$
and
$\tilde {d}$
are as defined in (4-2) and (4-4), but with the modified definitions of boundary and interior edges described in the following. In this setting, one deletes the sets
$E^0_{\mathrm {sink}}$
and
$E^1_{\mathrm {sink}}$
, defines an edge
$e \in E^1$
to be a boundary edge if it terminates in a sink, and defines an edge to be an interior edge otherwise.
Acknowledgements
The authors would like to thank Brian Chan for helpful discussions about topics related to this paper. The authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme Topological groupoids and their
$C^{*}$
-algebras, where work on this paper was undertaken.
Funding
This work was supported by EPSRC grant EP/V521929/1. J.C. was supported by EPSRC grant EP/X026647/1. J.G. was supported by EPSRC grant EP/T517896/1. For the purpose of Open Access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript (AAM) version arising from this submission.



