This paper characterizes perfect, permutative, irreducible representations of ultragraph Leavitt path algebras, extending Chen's construction and linking representations to branching systems, with improved faithfulness criteria.
Contribution
It extends Chen's irreducible representation construction to ultragraph Leavitt path algebras and characterizes those from perfect branching systems.
Findings
01
Complete characterization of perfect, permutative, irreducible representations
02
Construction of representations from branching systems
03
Improved criteria for faithfulness of representations
Abstract
We completely characterize perfect, permutative, irreducible representations of an ultragraph Leavitt path algebra. For this we extend to ultragraph Leavitt path algebras Chen's construction of irreducible representations of Leavitt path algebras. We show that these representations can be built from branching system and characterize irreducible representations associated to perfect branching systems. Along the way we improve the characterization of faithfulness of Chen's irreducible representations.
Equations30
p∗={(α,v):α∈G∗,∣α∣≥1 and v∈r(α)∩Gs0}∪{(v,v):v∈Gs0}.
p∗={(α,v):α∈G∗,∣α∣≥1 and v∈r(α)∩Gs0}∪{(v,v):v∈Gs0}.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Irreducible and permutative representations of ultragraph Leavitt path algebras
Daniel Gonçalves111This author is partially supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico - CNPq and Capes-PrInt. and Danilo Royer
Abstract
We completely characterize perfect, permutative, irreducible representations of an ultragraph Leavitt path algebra. For this we extend to ultragraph Leavitt path algebras Chen’s construction of irreducible representations of Leavitt path algebras. We show that these representations can be built from branching system and characterize irreducible representations associated to perfect branching systems. Along the way we improve the characterization of faithfulness of Chen’s irreducible representations.
Ultragraphs (and their algebras) are generalizations of graphs (and their algebras) with applications in Symbolic Dynamics, Operator Algebras and Algebra, see for example [9, 15, 24, 25, 26, 27, 28, 29, 30, 33, 34, 36, 39, 40]. The Leavitt path algebra associated to an ultragraph was defined in [32], where it is shown that these algebras provide examples of algebras that can not be realized as the Leavitt path algebra of a graph. A key feature of an ultragraph path algebra is that it provides a unified approach to both Leavitt path algebras and Cuntz-Krieger algebras associated with infinite matrices (see [32] for the purely algebraic context and [39] in the C*-algebraic context). It is therefore interesting to extend known results of Leavitt path algebra theory to ultragraph Leavitt path algebras. Furthermore, since ultragraph Leavitt path algebras are algebraic analogues of ultragraph C*-algebras, which are well studied and play a key role in the study of infinite alphabet shift spaces (see [26, 27, 28, 29, 30]), it is important to deepen the understanding of these algebras.
Recently there has been intense activity on the study of representations of Leavitt path algebras. For example, in [2, 5, 6] it is shown that irreducible representations play an important role in the study of the socle series of Leavitt path algebras. The study of representations via branching systems was done in [19] and in [10] a key type of irreducible representation was constructed (which is now called a Chen module). The investigation of Leavitt path algebras with a special type of, or a specific number of, irreducible representations was done in [1, 3, 4, 31, 37, 38].
Our goal in this paper is to contribute to the study of representations of ultragraph Leavitt path algebras. In particular we will extend Chen’s results (see [10]) regarding irreducible representations of Leavitt path algebras to ultragraph algebras, improve some of them, and use our results to describe permutative, perfect, irreducible representations (a result that is new also in the context of graph algebras). Our interest in permutative representations come from the fact that they have applications to wavelets, continued fraction expansions, iterated function systems, higher rank graphs, among others, see [7, 12, 35].
The paper is organized as follows: after this introduction we include a brief sections of preliminaries, which is followed by Section 3, where we extend Chen’s representations to ultragraph Leavitt path algebras. In
Section 4 we show that the representations build in Section 3 can be obtained via branching systems, and use branching system theory to completely characterize faithfulness of the representations (this result improves known results for Leavitt path algebras of graphs). We focus on perfect representations and perfect branching systems in Section 5, where we completely characterize irreducible representations of ultragraph path algebras arising from perfect branching system as those of Section 3 (this extends results of [10]). Finally, in Section 6, we completely characterize perfect, permutative, irreducible representations of an ultragraph Leavitt path algebra (this is a new result also in the context of Leavitt path algebras of graphs).
2 Preliminaries
In this brief section we recall the definition of the Leavitt path algebra associated to an ultragraph and set notation. In particular, unless otherwise stated, we let R denote a unital commutative ring throughout the paper.
Definition 2.1
An ultragraph is a quadruple G=(G0,G1,r,s) consisting of two countable sets G0,G1, a map s:G1→G0, and a map r:G1→P(G0)∖{∅}, where P(G0) stands for the power set of G0.
Definition 2.2
Let G be an ultragraph. Define G0 to be the smallest subset of P(G0) that contains {v} for all v∈G0, contains r(e) for all e∈G1, and is closed under finite unions and non-empty finite intersections. Elements of G0 are called generalized vertices.
Definition 2.3
Let G be an ultragraph and R be a unital commutative ring. The Leavitt path algebra of G, denoted by LR(G), is the universal algebra with generators {se,se∗:e∈G1}∪{pA:A∈G0} and relations
p∅=0,pApB=pA∩B,pA∪B=pA+pB−pA∩B, for all A,B∈G0;
2. 2.
ps(e)se=sepr(e)=se* and pr(e)se∗=se∗ps(e)=se∗ for each e∈G1;*
3. 3.
se∗sf=δe,fpr(e)* for all e,f∈G;*
4. 4.
pv=s(e)=v∑sese∗* whenever 0<∣s−1(v)∣<∞.*
Let G be an ultragraph. A finite path is either an element of G0 or a sequence of edges e1...en, with length ∣e1...en∣=n, and such that s(ei+1)∈r(ei) for each i∈{0,...,n−1}. An infinite path is a sequence e1e2e3..., with length ∣e1e2...∣=∞, such that s(ei+1)∈r(ei) for each i≥0. The set of finite paths in G is denoted by G∗, and the set of infinite paths in G is denoted by p∞. We extend the source and range maps as follows: r(α)=r(α∣α∣), s(α)=s(α1) for α∈G∗ with 0<∣α∣<∞, s(α)=s(α1) for each α∈p∞, and r(A)=A=s(A) for each A∈G0. An element v∈G0 is a sink if s−1(v)=∅, and we denote the set of sinks in G0 by Gs0. We say that A∈G0 is a sink if each vertex in A is a sink. We also define the set p∗ by
[TABLE]
Remark 2.4
Notice that given a vertex v, the element (v,v) is an element of p∗ if, and only if, v is a sink.
Example 2.5
Let G be the ultragraph as follows:
u⋮v$$w_{1}$$w_{2}$$w_{3}$$e_{1}$$e_{2}$$>$$>*
In this ultragraph, G1={e1,e2}, s(e1)=u, r(e1)={v,w1,w2...}, v=s(e2)=r(e2), and each wi is a sink. In this case, p∞ contains two elements, e1e2e2... and e2e2..., and p∗={(e1,wi):i∈N}∪{(wi,wi):i∈N}.
Definition 2.6
For an element (α,v)∈p∗ we define the range and source maps by r(α,v)=v and s(α,v)=s(α). In particular, for a sink v, s(v,v)=v=r(v,v). We also extend the length map to the elements (α,v) by defining ∣(α,v)∣:=∣α∣.
3 A model for permutative, irreducible representations of LR(G)
In this section, motivated by result in [10] for Leavitt path algebras, we define an irreducible representation associated to any ultragraph algebra LR(G). As we will see later using branching system theory, this representations models permutative, perfect, and irreducible representations of LR(G).
Recall that, unless stated otherwise, R is a commutative unital ring.
Definition 3.1
Two elements α,β∈p∗∪p∞ are equivalent if:
α,β∈p∞* and there are i,j such that αi+k=βj+k for each k∈N, or*
2. 2.
α,β∈p∗, where α=(a,v) and β=(b,v).
Remark 3.2
For α∈p∗∪p∞, we denote by [α] the set of all the paths equivalent to α, and by p∞ and p∗ respectively the set of equivalent classes of p∞ and p∗. Notice that p∗∩p∞=∅. Moreover, each class in p∗ is given by a vertex which is a sink, so that the cardinality of p∗ and Gs0 is the same.
we have, for example, that ee2e3e4... and e7e8e9... are equivalent, and so are the elements (e,wi) and (wi,wi) for each i. There are only two classes in p∞, the class of e1e1e1... and the class of ee2e3e4.... The set p∗ contains infinitely many elements, more specifically, p∗={[(e,wi)]:i∈N}.
Definition 3.4
Let G be an ultragraph. We denote by P be the free R-module generated by the basis {bα:α∈p∗∪p∞}.
For an element α∈p∗∪p∞, we let Pα denote the submodule of P generated by bα, and P[α] denote the submodule of P generated by the elements bβ with β∈[α].
Notice that P[α]=β∈[α]⨁Pβ, and P=[α]∈p∞⨁P[α][β]∈p∗⨁P[β].
Example 3.5
For the ultragraph of Example 2.5 notice that p∞={[e1e2e2...]}. Since [e1e2e2...] contains exactly two elements, then P[e1e2e2...]=R2. Moreover, for each [(e1,wi)]∈p∗, since [(e,wi)] also contains exactly two elements, we have that P[(e1,wi)]=R2. Then
[TABLE]
Our aim is to define a representation π:LR(G)→EndR(P), where EndR(P) is the set of all R-endomorphism on P, which is an R-algebra. With this in mind, let us define some special elements in EndR(P) as follows:
for each element A∈G0 define PA:P→P by PA(bα)=[s(α)∈A]bα.
2. 2.
for each e∈G1 define Se:P→P by Se(bα)=[s(α)∈r(e)]beα.
3. 3.
for each e∗∈(G1)∗, define Se∗:P→PSe∗(bα)=[α1=e]bα2α3....
Remark 3.6
In the previous definition, the notation [q] means [q]=1 if the statement q is true and [q]=0 otherwise. In the second item, if α=(a,v)∈p∗ with s(α)∈r(e) then eα:=(ea,v). Particularly, if α=(v,v) and v∈s(e) then eα=(e,v). Finally, in the third item, if α=(a,v) with a1=e then Se∗(bα)=b(a2...a∣a∣,v). In particular, if α=(e,v) then Se∗(bα)=b(v,v), and if α=(v,v) then Se∗(bα)=0 .
The above endomorphisms induce a representation of LR(G) as described below.
Theorem 3.7
Let G be an ultragraph.
There exists a representation π:LR(G)→EndR(P) such that π(pA)=PA for all A∈G0, π(se)=Se for each edge e, and π(se∗)=Se∗ for each e∗∈(G1)∗.
**Proof. **The proof of this theorem follows from the universality of LR(G) and from the definitions of PA,Se and Se∗.
□
Remark 3.8
The representation π above is not always faithful. For example let G be the ultragraph of Example 3.3. Then for each x∈p∗∪p∞ we have that
π(pv0)(bx)=Pv0(bx)=[s(x)=v0]bx=[x=e1e1e1...]bx, and
[TABLE]
so that π(pv0)(bx)=π(se1)(bx). Therefore π(pv0)=π(se1), and so π is not faithful.
We will show later, in Theorem 4.7, a sufficient and necessary condition for faithfulness of the representation π of Theorem 3.7.
Notice that for each [p]∈p∗∪p∞, it holds that π(PA)(P[p])⊆P[p], π(Se)(P[p])⊆P[p] and π(Se∗)(P[p])⊆P[p], for each edge e and A∈G0. Therefore π(LR(G))(P[p])⊆P[p], and then we may consider the restriction of π to P[p], which is a new representation (that we still denote by π).
Proposition 3.9
Let R be a field. For each [p]∈p∗∪p∞ the representation π:LR(G)→EndR(P[p]) is irreducible.
**Proof. **First suppose that [p]∈p∞. Let x,z∈[p]. Then there are paths α,β∈G∗ such that x=αξ and z=βξ with ξ∈p∞ and so π(sα)π(sβ∗)(bz)=bx.
Let 0=Y⊆P[p] be an invariant subspace and let 0=y=∑λibxi∈Y with λi=0 for each i and xi=xj for each i=j. Since all the xi are distinct, there exists distinct αi, all of same length, such that xi=αixi′ for each i. Now, for a fixed j, we get
[TABLE]
Since R is a field then bxj′∈Y. By the first paragraph of this proof, we get that bx∈Y for each x∈[p].
Now let [p]∈p∗, and let 0=Y⊆P[p] be an invariant subspace. Let 0=y=i∑λibxi with each λi=0 and xi=(αi,v) for each i, with αi=αj for i=j. Fix an element αj0 such that ∣αj0∣≥∣αi∣ for each i. Note that π(sαj0∗)(y)=λj0b(v,v), and hence b(v,v)∈Y. Since for each (α,v)∈[p] we have that π(sα)(b(v,v))=b(α,v), we conclude that P[p]⊆Y. □
Notice that for each [p]∈p∗∪p∞, since P[p] is π-invariant, we can endow P[p] with a left LR(G) module structure, where the product is defined by a.b:=π(a)(b), for each a∈LR(G) and b∈P[p]. So we can consider EndLR(G)(P[p]), the R-module of all endomorphisms of the LR(G) module P[p]. We then have the following extension of the first items in Theorems 3.3 and 3.7 of [10] to ultragraph Leavitt path algebras.
Proposition 3.10
For each [p]∈p∗∪p∞, the R-module EndLR(G)(P[p]) is isomorphic to R.
**Proof. **Suppose first that [p]∈p∞, and let φ∈EndLR(G)(P[p]). Fix q∈[p]. Then φ(bq)=i=1∑nλibqi with λi=0 and qi=qj for each i,j. Suppose that qj=q for some j.
Chose an index m such that q1j...qmj=q1...qm and q1j...qmj=q1i...qmi for each i=j. Then
[TABLE]
which is impossible. Then qj=q for each j, and so φ(bq)=λqbq for all q∈[p].
Now, for r∈[p], write r=αx and p=βx, where α and β are finite paths. Then φ(Sα∗(br))=φ(bx)=λxbx, and so
[TABLE]
Similarly, (using Sβ and Sβ∗ instead of Sα and Sα∗) we get φ(bp)=λxbp. This implies that there exists λφ∈R such that φ(b)=λφb for each b∈P[p].
Suppose next that [p]∈p∗. Let φ∈EndLR(G) and let (α,v)∈[p]. Then φ(b(α,v))=i=1∑nλib(αi,v), where αi=αj. Notice that
Therefore ∣αi∣=∣α∣ for each i. If αj=α for some j then
[TABLE]
Then αi=α for each i and so φ(b(α,v))=λαb(α,v) for all (α,v)∈[p].
Now, for each (β,v)∈[p] it holds that λβb(β,v)=φ(b(β,v))=Sβ(φ(b(v,v)))=Sβ(λ(v,v))b(v,v)=λ(v,v)b(β,v), so that there exists λφ∈R such that φ(b)=λφb for each b∈P[p].
We leave to the reader the verification that the map EndLR(G)(P[p])∋φ↦λφ∈R is an isomorphism. □
Next we will extend the remainder items of Theorems 3.3 and 3.7 in [10] to ultragraph Leavitt paht algebras. Before we proceed we recall the notion of equivalence between representations.
Definition 3.11
Let π:LR(G)→HomK(M) and φ:LR(G)→HomR(N) be representations of LR(G), where M and N are R-modules. We say that π is equivalent to φ if there exists an R-module isomorphism U:M→N such that the diagram
[TABLE]
commutes, for each a∈LR(G).
Proposition 3.12
For each [p],[q]∈p∗∪p∞, with [p]=[q], the representations π:LR(G)→EndR(P[p]) and π:LR(G)→EndR(P[q]) are not equivalent.
**Proof. **Suppose that the representations are equivalent, that is, suppose there is an isomorphism U:P[p]→P[q] such that π(a)∘U=U∘π(a) for each a∈LR(G).
First we analyse the case [p]∈p∞ and [q]∈p∗. Let x∈[p]. Then U(bx)=i∑λib(αi,v). Let m>∣αi∣ for each i and let β=x1...xm. Then
[TABLE]
which is impossible since U is injective.
Now let [p]∈p∗ and [q]∈p∞. Proceeding similarly to the previous case, we get a contradiction for U−1.
Fix now [p],[q]∈p∞. Then U(bp)=i∑bqi. Since [p]=[q] then there exists an m such that p1...pm=q1i...qmi for each i. Let β=p1...pm. Then U(bpm+1pm+2...)=U(Sβ∗(bp))=Sβ∗(U(bp))=0, which is impossible, since U is injective.
Finally consider the case [p],[q]∈p∗. Let (α,u)∈[p]. Then U(b(α,u))=i∑b(βi,v) and, since [p]=[q], we have that u=v. Hence
where the last equality follows from the fact that u=v and, since u is a sink, Pu(bα′)=0 iff α′=(u,u). So U(b(v,v))=0,
which is impossible.
Therefore we have proved that if the representations π:LR(G)→EndR(P[p]) and π:LR(G)→EndR(P[q]) are equivalent then [p]=[q].
□
4 Branching systems
Iterated function systems and branching systems are widely used in the study of representations of algebras associated to combinatorial objects, see for example [8, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 25, 31]. Hence it is interesting to note that the representation π of Theorem 3.7 can be constructed via branching systems. This point of view will allow us to apply results in the theory of branching systems to characterize the representation π. For example, in this section we will completely characterize when π is faithful, a result for ultragraphs that also improves Proposition 4.4 in [10] regarding Leavitt path algebras. Before we proceed we recall the following relevant definitions (as in [25]).
Definition 4.1
Let G be an ultragraph, X be a set and let {Re,DA}e∈G1,A∈G0 be a family of subsets of X. Suppose that
Re∩Rf=∅, if e=f∈G1;
2. 2.
D∅=∅,DA∩DB=DA∩B, and DA∪DB=DA∪B* for all A,B∈G0;*
3. 3.
Re⊆Ds(e)* for all e∈G1;*
4. 4.
Dv=e∈s−1(v)⋃Re, if 0<∣s−1(v)∣<∞; and
5. 5.
for each e∈G1, there exist two bijective maps, fe:Dr(e)→Re and fe−1:Re→Dr(e), such that fe∘fe−1=IdRe and fe−1∘fe=IdDr(e).
We call {DA,Re,fe}e∈G1,A∈G0 a G-algebraic branching system on X or, shortly, a G-branching system, and use the notation X={DA,Re,fe}e∈G1,A∈G0 to denote this branching system.
Let M(X) be the R−module of all maps from X to R with finite support. In Proposition 4.5 of [25] it is shown that a branching system induces a representation of LR(G) in End(M(X)). For our purposes, we will consider the following branching system on p∗∪p∞.
•
For each A∈G0 let BA={x∈p∗∪p∞:s(x)∈A},
•
For each edge e define Le={x∈p∗∪p∞:x1=e},
•
For each edge e define fe:Br(e)→Le by fe(x)=ex.
Remark 4.2
In the previous definition, if x=(α,v) then fe(x)=(eα,v), and if x=(v,v) then fe(x)=(e,v). It is easy to see that fe is bijective, and that
{BA,Le,fe}e∈G1,A∈G0 is a G-branching system.
Remark 4.3
The above branching system can also be seen as a partial action of the free group on the edges of the ultragraph and be used to realized LR(G) as a partial skew group ring, see [8, 22, 24].
Next we make precise the representation φ of LR(G) induced by the branching system defined above on p∗∪p∞.
Proposition 4.4
There is a representation φ:LR(G)→EndR(M(p∗∪p∞)) such that:
φ(pA)(ϕ)=χBA.ϕ (where χBA is the characteristic map on BA), φ(se)(ϕ)=χLe.(ϕ∘fe−1),
and φ(se∗)(ϕ)=χBr(e).(ϕ∘fe).
**Proof. **First let N(p∗∪p∞) be the R-module of all the maps from p∗∪p∞ to R. Clearly M(p∗∪p∞) is a sub-module of N(p∗∪p∞). From Proposition 4.5 of [25] we get a representation π:LR(G)→EndR(N(p∗∪p∞)) such that φ(pA)(ϕ)=χBA.ϕ for each A∈G0, φ(se)(ϕ)=χLe.(ϕ∘fe−1)
and φ(se∗)(ϕ)=χBr(e).(ϕ∘fe) for each edge e and ϕ∈N(p∗∪p∞). Now, it is easy to see that M(p∗∪p∞) is π-invariant, and so we get the desired representation.
□
As we mentioned before, the representations φ and π of LR(G) are equivalent, a fact we prove after setting up a basis for M(p∗∪p∞) below.
For each x∈p∗∪p∞ define δx∈M(p∗∪p∞) by δx(y)=1 if y=x and δx(y)=0 if y=x. Notice that {δx:x∈p∗∪p∞} is a basis of M(p∗∪p∞).
Proposition 4.5
The representations π:LR(G)→EndR(P) of Theorem 3.7 and φ:LR(G)→EndR(M(p∗∪p∞)) of Proposition 4.4 are equivalent.
**Proof. **Define the isomorphism U:P→M(p∗∪p∞) by U(i∑λibxi)=i∑λiδxi. To show that π(a)=U−1∘φ(a)∘U for each a∈LR(G) it is enough to show that π(pA)=U−1∘φ(pA)∘U for each A∈G0, π(se)=U−1∘φ(se)∘U and π(se∗)=U−1∘φ(se∗)∘U for each e∈G1.
Analogously to what is done above one shows that U−1∘φ(se∗)∘U=π(se∗).
□
We are now ready to completely characterize faithfulness of the representation π in terms of combinatorial properties of the underlying ultragraph, but first we recall the following definitions.
Let G be an ultragraph. A closed path is a path
α∈G∗ with ∣α∣≥1 and s(α)∈r(α). A closed path α is a cycle if s(αi)=s(αj) for each i=j. An exit for a closed path is either an edge e∈G1 such that there exists an i for which s(e)∈r(αi) but e=αi+1, or a sink w such that w∈r(αi) for some i. We say that the ultragraph G satisfies Condition (L) if every closed path in G has an
exit.
In Proposition 4.4 of [10], the author shows that, for a row-finite graph E, Condition (L) is sufficient for faithfulness of the representation π of LR(E). We show in the next theorem that the row-finite assumption is not necessary to describe faithfulness of π. In fact, using branching system theory, we show that for any ultragraph Condition (L) is necessary and sufficient for faithfulness of π.
Theorem 4.7
Let G be an ultragraph. Then the representation π:LR(G)→EndR(P) of Theorem 3.7 is faithful if, and only if, G satisfies Condition (L).
**Proof. **By Proposition 4.5 it is enough to show that the representation φ:LR(G)→EndR(M(p∗∪p∞)) is faithful if, and only if, G satisfies Condition (L).
Suppose that G satisfies Condition (L). By Theorem 5.1 in [25] φ is faithful.
Now suppose that G does not satisfy Condition (L). Then there is a closed path c without exit. Notice that Br(c)={x}, where x is the infinite path x=ccc... and fcn(x)=x for each n∈N. Then, by Theorem 5.1 in [25], φ is not faithful. □
5 Perfect branching systems
In this section we focus on perfect branching systems. Intuitively speaking a perfect branching system is one such that the Cuntz-Krieger relations, translated to the sets that form the branching system, holds for each non-sink vertex, and such that the whole set X is the union of the ”projection” sets associated to the vertices. This type of branching systems arise naturally, as the constructions in [15, 17, 18, 19, 21, 23] show.
Our main goals in this section are to extend Lemma 5.4 and Theorem 5.6 in [10] to ultragraph Leavitt path algebras. In particular we show that there is always a morphism between a given branching system associated to an ultragraph and the branching system on p∗∪p∞ described in the previous section. Furthermore, we will use this last result to characterize irreducible representations arising from branching systems. We start with the definition of a morphism between branching systems.
Definition 5.1
Let G be an ultragraph. Let X={DA,Re,fe}A∈G0,e∈G1 and Y={BA,Le,ge}A∈G0,e∈G1 be two branching systems. A morphism from X to Y is a map T:X→Y such that T(Re)⊆Le for each e∈G1, T(DA)⊆BA for each A∈G0, and such that the diagram
[TABLE]
commutes for each e∈G1.
The branchyng systems are isomorphic if there are mutually inverse morphisms T:X→Y and T−1:Y→X.
Remark 5.2
From the previous definition we get that if T:X→Y is a morphism of branching systems then T∘fe=ge∘T. Now, composing this equality on the right with fe−1, and on the left with ge−1, we get ge−1∘T=T∘fe−1, so that the diagram
[TABLE]
also commutes, for each e∈G1.
Let G be an ultragraph and X be a branching sytem. We denote by N(X) the R-module of all the maps from X to R. For two branching systems X and Y as in Definition 5.1, let π:LR(G)→EndR(N(X)) and φ:LR(G)→EndR(N(Y)) be the representation induced by these branching systems, as in Proposition 4.5 of [25]. Recall that π(pA)(ϕ)=χDAϕ, π(se)(ϕ)=χRe(ϕ∘fe−1), π(se∗)(ϕ)=χDr(e)(ϕ∘fe), for each ϕ∈N(X), and analogous description holds for φ.
Next we notice that isomorphic branching systems induce equivalent representations of LR(G), a result that follows directly from the lemma below.
Lemma 5.3
Let G be an ultragraph, X={DA,Re,fe}A∈G0,e∈G1 and Y={BA,Le,ge}A∈G0,e∈G1 be two branching systems, T:X→Y be a morphism of branching systems, and let π:LR(G)→EndR(N(X)) and φ:LR(G)→EndR(N(Y)) be the induced representations as described above. Suppose that T−1(Le)=Re for each edge e and T−1(BA)=DA for each A∈G0, and let U:N(Y)→N(X) be defined by U(ϕ)=ϕ∘T. Then π(a)∘U=U∘φ(a) for each a∈LR(G).
**Proof. **To show that π(a)∘U=U∘φ(a) for each a∈LR(G) it is enough to verify this equality for a=se, a=se∗ and a=pA, for each edge e and A∈G0.
Let e∈G1. For each ϕ∈N(X),
[TABLE]
[TABLE]
and so π(se)∘U=U∘φ(se).
Analogously one shows that π(se∗)∘U=U∘φ(se∗) and π(pA)∘U=U∘φ(pA) for each edge e and A∈G0.
□
Corollary 5.4
Let G be an ultragraph, X,Y be two isomorphic branching systems, and let π:LR(G)→EndR(N(X)) and φ:LR(G)→EndR(N(Y)) be their induced representations. Then π and φ are equivalent.
Let X and Y be two isomorphic branching systems of an ultragraph G, with the branching system isomorphism T:X→Y. Let U:N(Y)→N(X) be the induced isomorphism of R-modules, defined by U(ϕ)=ϕ∘T (recall that N(Y) is the set of all the maps from Y to R). Notice that M(Y) (the set of all the maps from Y to R with finite support) is isomorphic to M(X) via U. Moreover, M(X) is π-invariant where π is as in the previous corollary, so that we may consider the restricted representation π:LR(G)→EndR(M(X)) and similarly we get φ:LR(G)→EndR(M(Y)). By combining those facts, we get the following:
Corollary 5.5
Let G be an ultragraph, X,Y be two isomorphic branching systems, and let π:LR(G)→EndR(M(X)) and φ:LR(G)→EndR(M(Y)) be their induced representations. Then π and φ are equivalent.
As we mentioned before our aim in this section is to study perfect branching systems. We make this definition precise below (notice that this generalizes the definition given in Section 5 of [10]).
Definition 5.6
Let G be an ultragraph, and X be a G−algebraic branching system. We say that X is perfect if X=v∈G0⋃Dv, and Xv=e∈s−1(v)⋃Xe for each non-sink v∈G0.
Example 5.7
The G-branching system on p∗∪p∞ of Section 4, namely {BA,Le,fe}A∈G0,e∈G1, where BA={x∈p∗∪p∞:s(x)∈A}, Le={x∈p∗∪p∞:x1=e} and fe:Br(e)→Le defined by fe(x)=ex is perfect.
Remark 5.8
If X={DA,Re,fe}e∈G1,A∈G0 is a perfect branching system then DA=v∈A⋃Dv. To see this, first note that, for each A∈G0, we have Dv∩DA=Dv for each v∈A, so that v∈A⋃Dv⊆DA. Moreover, if x∈DA then x∈Du for some u, since X=v∈G0⋃Dv. If we suppose that that u∈/A then we get that x∈Du∩DA=∅, which is impossible. Therefore DA=v∈A⋃Dv.
Morphisms from perfect branching systems have a special property, which we record below.
Lemma 5.9
Let X={DA,Re,fe}e∈G1,A∈G0 and Y={BA,Le,ge}e∈G1,A∈G0 be branching systems of an ultragraph G, let T:X→Y be a morphism, and suppose that X is perfect. Then T−1(Le)=Re and T−1(BA)=DA, for each edge e and A∈G0.
**Proof. **To see that T−1(Le)=Re, first note that, since T(Re)⊆Le then Re⊆T−1(Le). Moreover, if x∈T−1(Le)∖Re then, since X is perfect, x∈Dv for some vertex v. If s(e)=v then, since X is perfect, x∈Re0 for some e0=e, and so T(x)∈Le0. Since Le0∩Le=∅ then T(x)∈/Le, which is impossible since x∈T−1(Le). If s(e)=v then, since T(x)∈Bv and Bv∩Bs(e)=∅, we have T(x)∈/Le, which is also impossible. Therefore T−1(Le)=Re.
To verify that T−1(BA)=DA, note first that DA⊆T−1(BA). If x∈T−1(BA)∖DA, then x∈Dv for some vertex v (since X is perfect), and so T(x)∈Bv. If v∈/A then Bv∩BA=∅ and so T(x)∈/BA, which is impossible. If v∈A then, since X is perfect, we have that DA=v∈A⋃Dv and hence x∈DA, which is also impossible. Therefore T−1(BA)=DA.
□
Joining the lemma above and Lemma 5.3 we get the following.
Proposition 5.10
Let G be an ultragraph, X,Y be two branching systems, T:X→Y be a morphism of branching systems, and let π:LR(G)→EndR(N(X)) and φ:LR(G)→EndR(N(Y)) be the induced representations. Suppose that X is perfect and let U:N(Y)→N(X) be defined by U(ϕ)=ϕ∘T. Then π(a)∘U=U∘φ(a) for each a∈LR(G).
Remark 5.11
Notice that the above proposition does not necessarily imply that the representations are equivalent, since the map U may not be an isomorphism.
We now describe a relationship between perfect branching systems and the branching system on p∗∪p∞ from Example 5.7.
Proposition 5.12
Let G be an ultragraph and X={Re,DA,ge}e∈G1,A∈G0 be a perfect G-branching system. Then there exists a morphism from X to the branching system p∗∪p∞={Le,BA,fe}e∈G1,A∈G0 of Example 5.7.
**Proof. **First we define a map T:X→p∗∪p∞.
Let x∈X. Then x∈Dv1 for some vertex v1. If v1 is a sink define T(x)=(v1,v1). If v1 is not a sink then Dv1=e∈s−1(v1)⋃Re. Let e1∈s−1(v1) be such that x∈Re1, and consider the element ge1−1(x). Notice that ge1−1(x)∈Dv2 for some vertex v2∈r(e1). If v2 is a sink then define T(x)=(e1,v2), otherwise there exists an edge e2 such that ge1−1(x)∈Re2. Consider the element ge2−1(ge1−1(x)), which belongs to Dv3 for some vertex v3∈r(e2). If v3 is a sink define T(x)=(e1e2,v3), otherwise there is an edge e3 such that ge2−1(ge1−1(x))∈Re3. Proceeding recursively, we define T(x) either as the element (e1e2...en,vn+1)∈p∗ or the element e1e2e3...∈p∞.
Notice that from the definition of T we have T(Re)⊆Le for each edge e. Moreover, if v is a sink then T(Dv)={(v,v)}=Bv, and if v is not a sink then T(Dv)=T(⋃e∈s−1(v)Re)=⋃e∈s−1(v)T(Re)⊆⋃e∈s−1(v)Le=Bv. Now, for A∈G0, T(DA)=T(v∈A⋃Dv)=v∈A⋃T(Dv)⊆v∈A⋃Bv=BA.
Let e be an edge and x∈Le. Then, from the definition of T, we get that T(ge(x))=eT(x)=fe(T(x)), and so T is a morphism of branching systems.
□
The morphism T of the previous proposition is not always injective nor surjective. For example, let G be the ultragraph with one edge e and two vertices u,v, where s(e)=u and r(e)={u,v}.
u$$v$$>$$e
Let X=[0,2), define Re=[0,1)=Du, Dv=[1,2) and Dr(e)=[0,2), and let fe:Dr(e)→Re be any bijection. Then X is a perfect branching system and for this ultragraph, p∗∪p∞={eee...,(e,v)}. Since X is infinite and p∗∪p∞ is a finite set, the morphism T:X→p∗∪p∞ is not injective.
For an example where the morphism T is not surjective, let G be a graph with two loops e1 and e2 based on a vertex u.
>$$e_{1}$$<$$e_{2}
Let Re1 and Re2 be two infinite countable disjoint sets, X=Du=Re1∪Re2 and let fei:Du→Rei be a fixed bijection, for i∈{1,2}. Notice that this branching system is perfect. Moreover, p∗∪p∞=p∞ is not countable. Therefore the morphism T of the previous proposition is not surjective.
Although the morphism T is not always surjective, we get the following lemma, which will be used in the next theorem.
Lemma 5.13
Let G be an ultragraph, X={DA,Re,ge}e∈G1,A∈G0 be a perfect G-branching system, and let T:X→p∗∪p∞ be the morphism of Proposition 5.12. If p∈p∗∪p∞ belongs to T(X) then [p]⊆T(X).
**Proof. **Since T is a morphism we have that T∘ge=fe∘T and fe−1∘T=T∘ge−1 for each edge e, and therefore it holds that T∘gα=fα∘T and fα−1∘T=T∘gα−1, for each path α. Now suppose p∈p∞∩T(X), and write p=T(x) for some x∈X. Let y∈[p] and write y=αc, where p=βc and c∈p∞. Then c=fβ−1(p)=fβ−1(T(x))=T(gβ−1(x)) so that c∈T(X). Let c=T(d), where d∈X. Then y=αc=fα(c)=fα(T(d))=T(gα(d)), and so y∈T(X). Therefore T(X)=[q]. Similarly one shows that T(X)=[q] if q∈p∗.
□
Remark 5.14
Recall the branching system of Example 5.7. Notice that for each p∈p∗∪p∞ and e∈G1 it holds that fe−1(Le∩[p])⊆[p] and fe(Br(e)∩[p])⊆[p]. Therefore we get a new branching system in [p], by taking the intersections of Le and BA with [p].
We finish this section characterizing irreducible representations of LR(G) associated to perfect branching systems.
Theorem 5.15
Let G be an ultragraph, R be a field, X={DA,Re,ge}e∈G1,A∈G0 be a perfect G-branching system, and ψ:LR(G)→EndR(M(X)) be the associated representation. Then ψ is irreducible if, and only if, X is isomorphic to [p] for some [p]∈p∗∪p∞.
**Proof. **If the branching system X is isomorphic to the branching system [p] for some [p]∈p∗∪p∞ (where [p] is the branching system as in Remark 5.14) then ψ is irreducible by Proposition 3.9 and Corollary 5.5.
Suppose that ψ is irreducible. Denote by φ:LR(G)→EndR(M(p∗∪p∞)) the representation arising from the branching system on p∗∪p∞ defined on Example 5.7. Let T:X→p∗∪p∞ be the morphism of branching systems defined in the proof of Proposition 5.12. Notice that T induces a map V:M(X)→M(p∗∪p∞) that takes δx to δT(x), which is an R-homomorphism. We show that this map intertwines the representations, that is, V∘ψ(a)=φ(a)∘V for all a∈LR(G). It is enough to verify that (V∘ψ(a))(δx)=(φ(a)∘V)(δx) for each x∈X, and for a=se, a=se∗ and a=pA for each edge e and A∈G0.
Fix A∈G0, and x∈X. Then
[TABLE]
and
[TABLE]
Notice that [T(x)∈BA]=[x∈T−1(BA)]=[x∈DA], where the last equality follows from Lemma 5.9. Therefore V(ψ(pA)(δx))=φ(pA)(V(δx)).
where the last equality follows from Lemma 5.9.
So it follows that V(ψ(se))(δx)=φ(se)V(δx) for every x and hence V∘ψ(se)=φ(se)∘V for all e.
Similarly to what is done above one shows that V∘ψ(se∗)=φ(se∗)∘V, and hence we conclude that V∘ψ(a)=φ(a)∘V for each a∈LR(G).
Now, if V is not injective, its kernel is invariant under ψ (from the intertwining condition). Hence V is injective and so is T.
Finally, for each p∈p∗∪p∞ let Y[p]⊆M(p∗∪p∞) be the submodule generated by {δx:x∈[p]}. It is easy to see that Y[p] is φ-invariant. Then, V−1(Y[p]) is ψ-invariant. Notice that V(X)∩Y[q]=∅ for some [q]. Since ψ is irreducible we have that V−1(Y[q])=M(X), and so V(M(X))⊆Y[q]. Therefore T(X)⊆[q] and, from Lemma 5.13, we get T(X)=[q]. □
Remark 5.16
In fact, in the above theorem, the assumption that R is a field is only necessary to show the sufficient condition for irreducibility of ψ (since we use Proposition 3.9).
6 Permutative representations
Permutative representations of combinatorial algebras such as the Cuntz-Krieger, graph and ultragraph algebras have connections with the theory of operator algebras, dynamical systems, and pure algebra (see[7, 35, 19, 15, 13]), and therefore are a subject of much interest. In this section we characterize the perfect, irreducible and permutative representations of an ultragraph Leavitt path algebra.
Let ψ:LR(G)→EndR(M) be a representation, where M is an R−module. Define the submodules Me=ψ(sese∗)(M), for each edge e, and MA=ψ(pA)(M) for each A∈G0. Notice that:
for each edge e, ψ(se):Mr(e)→Me is invertible, with inverse ψ(se∗);
2. 2.
Mu∩Mv{0} and Me∩Mf=0 for each vertices u=v and edges e=f;
3. 3.
Mv⊇e∈s−1(v)⨁Me for each nonsink v and if 0<∣s−1(v)∣<∞ then Mv=e∈s−1(v)⨁Me;
4. 4.
MA⊇v∈A⨁Mv for each A∈G0.
Definition 6.1
A representation ψ:LR(G)→EndR(M) is called a perfect representation if Mv=e∈s−1(v)⨁Me for each nonsink v and M=v∈G0⨁Mv.
From now on we suppose that ψ is a perfect representation.
Our goal is to construct a branching system associated to ψ. Below we describe how to define the sets of this branching system.
For each edge e let Be be a basis of Me. For each nonsink v, let Bv=e∈s−1(v)⋃Be. Since ψ is perfect we have that Bv is a basis of Mv. For each sink v, let Bv be some basis of Mv.
Notice that B=v∈G0⋃Bv is a basis of M, since ψ is perfect, and write B={bx:x∈X}, where X is the index set of the basis B.
Remark 6.2
From the hypothesis that ψ is perfect it follows that BA=v∈A⋃Bv is a basis of MA, for each A∈G0.
Next we define the subsets of X that will form the desired branching system: For each edge e write Be={bx:x∈Re} where Re⊂X is the index set of the basis Be, and for each A∈G0 write BA={bx:x∈DA} where DA⊂X is the index set of the basis BA. Note that for edges e=f we have Re∩Rf=∅ (since Me∩Mf={0}), and similarly Du∩Dv=∅ for vertices u=v.
To define the bijections between the subsets defined above we need to restrict to permutative representations. We recall below Definition 6.1 of [25], already simplified to perfect representations.
Definition 6.3
Let ψ:LR(G)→EndR(M) be a perfect representation. We say that ψ is permutative if it is possible to choose basis Be and Bv as described above and such that ψ(se)(Br(e))=Be.
Remark 6.4
Notice that since ψ(se):Mr(e)→Me is invertible, with inverse ψ(se∗), we have that ψ(se)(Br(e))=Be is equivalent to ψ(se∗)(Be)=Br(e). So ψ is permutative if, and only if, for each edge e it holds that ψ(se∗)(Be)=Br(e).
For a general permutative representation ψ:LR(G)→EndR(M) we may define, for each edge e, the bijection fe:Dr(e)→Re by fe(x)=y, where ψ(se)(bx)=by. This leads us to the desired branching system, as we state below (and leave the proof to the reader).
Proposition 6.5
Let ψ:LR(G)→EndR(M) be a perfect permutative representation. Then {Re,DA,fe}e∈G1,A∈G0 defined as above is a perfect branching system in X.
A key example of a perfect permutative representation is the representation of Theorem 3.7, as we see below.
Example 6.6
The representation π:LR(G)→EndR(P) obtained in Theorem 3.7 is perfect and permutative. In fact, notice that in this case, for each edge e, Me is the submodule of P generated by {bα:α∈p∗∪p∞ and α1=e}, and for each A∈G0, MA is the submodule of P generated by {bα:α∈p∗∪p∞ and s(α)∈A}. It is easy to see that if v is not a sink then Mv=e∈s−1(v)⨁Me and that P=v∈G0⨁Mv, and hence π is perfect. To see that π is permutative, for each edge e, let Be⊆Me be defined by Be={bα:α∈p∗∪p∞ and α1=e} and let Br(e)⊆Mr(e) be the set Br(e)={bα:α∈p∗∪p∞ and s(α)∈r(e)}. Now, it follows from the definition of π(se) that π(se):Br(e)→Be is a bijection.
Representations induced by the branching system of Proposition 6.5 form a model for perfect, permutative representations, as we show below.
Proposition 6.7
Let ψ:LR(G)→EndR(M) be a perfect, permutative representation. Then ψ is equivalent to the representation φ:LR(G)→EndR(M(X)) induced by the branching system of Proposition 6.5.
**Proof. **Let B=v∈G0⋃Bv be a basis of M=v∈G0⨁Mv as in the definition of a permutative representation (see Definition 6.3).
Following Theorem 6.5 in [25], it is enough to verify that ψ(se∗)(b)=0 for each edge e and b∈B∖Be, and ψ(pA)(b)=0 for each b∈B∖BA for each A∈G0.
Fix an edge e and b∈B∖Be. Since ψ is perfect, there exists a vertex v∈G0 such that b∈Bv. If v is a sink then ψ(se∗)(b)=ψ(se∗)ψ(pv)(b)=ψ(se∗)ψ(ps(e))ψ(pv)(b)=0 since s(e)=v. If v is not a sink then Bv=f∈s−1(v)⋃Bf and so b∈Bf, for some f=e. Then b=ψ(sf)ψ(sf∗)(b) and so ψ(se∗)(b)=ψ(se∗)ψ(sfsf∗)(b)=0 since ψ(se)∗ψ(sf)=0.
Now let A∈G0 and b∈B∖BA. Since ψ is perfect then v∈G0⋃Bv is a basis of M and so there exists a vertex v∈G0 such that b∈Bv. Since b∈/BA then v∈/A, and hence ψ(pA)ψ(pv)=0. Since b=ψ(pv)(b) we have that ψ(pA)(b)=ψ(pA)ψ(pv)(b)=0. □
Remark 6.8
We recall from the proof of Theorem 6.5 in [25] that the isomorphism which intertwines the representations ψ and φ of the previous proposition is the isomorphism U:M→M(X) defined by U(bx)=δx, where bx is an element of the basis of M and δx is the characteristic map on the set {x}⊆X. For a perfect, permutative representation ψ:LR(G)→EndR(M), let X be the perfect branching system as in Proposition 6.5, and let T:X→p∗∪p∞ be the morphism of branching systems as in Proposition 5.12. This morphism T induces a R-homomorphism Ψ:M(X)→P defined by Ψ(δx)=dT(x), where P is the free R-module (as in Definition 3.4) generated by {dp:p∈p∗∪p∞}. So we get a homomorphism Φ=Ψ∘U:M→P, which takes bx∈M to dT(x) in P.
We end the paper characterizing perfect, permutative representations.
Theorem 6.9
Let R be a field and ψ:LR(G)→EndR(M) be a perfect permutative representation. Then ψ is irreducible if, and only if, M is isomorphic to P[p] via the homomorphism Ψ (as in the previous remark) for some p∈p∗∪p∞.
**Proof. **Let X be the branching system of Proposition 6.5 and φ:LR(G)→EndR(M(X)) be the representation induced by this branching system, which is equivalent to ψ, by Proposition 6.7. Since ψ and φ are equivalent then ψ is irreducible if and only if φ is irreducible.
Suppose that ψ is irreducible. Then φ is irreducible and it follows, from Theorem 5.15, that X is isomorphic to [p], for some p∈p∗∪p∞, via the morphism T described in the proof of Proposition 5.12. Therefore Ψ:M(X)→P[p] defined on each element δx of the basis of M(X) by Ψ(δx)=dT(x) is an isomorphism and hence Φ=Ψ∘U is an isomorphism from M to P[p]
For the converse, suppose that Φ:M→P[p] is an isomorphism. Then Ψ:M(X)→P[p] is an isomorphism, and hence T:X→[p] is a bijection. By the proof of Proposition 5.12, T is an isomorphism from the branchig system X to the branching system [p]. By Theorem 5.15φ is irreducible and hence ψ is irreducible.
□
Remark 6.10
In the above theorem, the assumption that R is a field is only necessary to show the sufficient condition for irreducibility of ψ.
Example 6.11
In the previous theorem, it is important that M is isomorphic to P[p] via the isomorphism Ψ. It is not enough to have M isomorphic to P[p] via some isomorphism different from Ψ. For example, let G be a directed graph with infinite edges {e,e1,e2,e3,...} and infinite vertices {u,w,v1,v2,v3,...} as follows:
Let π:LR(G)→EndR(P) be the representation obtained in Proposition 3.7. This representation is perfect and permutative, following Example 6.6. Moreover, P is isomorphic to P[(w,w)], since both P and P[(w,w)] are isomorphic to N⨁R. However π is not irreducible since, for example, P[(e,u)] is π-invariant.
Bibliography40
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] G. Abrams, F. Mantese, A. Tonolo, Extensions of simple modules over Leavitt path algebras , J. Algebra 431, 78-106, 2015.
2[2] G. Abrams, K.M. Rangaswamy, and M. Siles Molina, The socle series of a Leavitt path algebra , Israel J. Math. 184, 413-435, 2011.
3[3] P. Ara and K.M. Rangaswamy, Finitely presented simple modules over Leavitt path algebras , J. Algebra 417, 333-352, 2015.
4[4] P. Ara, K.M. Rangaswamy, Leavitt path algebras with at most countably many irreducible representations , Rev. Mat. Iberoam. 31 (4), 1263-1276, 2015.
5[5] G. Aranda Pino, D. Martín Barquero, C. Martín González and M. Siles Molina, The socle of a Leavitt path algebra , J. Pure Appl. Algebra 212 (3), 500-509, 2008.
6[6] G. Aranda Pino, D. Martín Barquero, C. Martín González, M. Siles Molina, Socle theory for Leavitt path algebras of arbitrary graphs , Rev. Mat. Iberoam. 26 (2), 611-638, 2010.
7[7] O. Bratteli and P. E. T. Jorgensen, Iterated function systems and permutation representations of the Cuntz algebra , Memoirs Amer. Math. Soc. 139 no.663, 1999.
8[8] C. G. Canto, D. Gonçalves, Representations of relative Cohn path algebras , ar Xiv:1806.03077 [math.RA], 2018.