2017
DOI: 10.1016/j.aim.2017.06.034
|View full text |Cite
|
Sign up to set email alerts
|

Semiprojectivity and properly infinite projections in graph C⁎-algebras

Abstract: We give a complete description of which unital graph C * -algebras are semiprojective, and use it to disprove two conjectures by Blackadar. To do so, we perform a detailed analysis of which projections are properly infinite in such C * -algebras.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0
1

Year Published

2018
2018
2018
2018

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 29 publications
0
6
0
1
Order By: Relevance
“…He showed in [6,Proposition 2.7] that a full unital corner of a semiprojective C * -algebra is semiprojective. Recently, S. Eilers and T. Katsura showed in [11] that a corner of a unital graph C * -algebra that is semiprojective is also semiprojective. Corollary 4.11 is a special case of their results since every Cuntz-Krieger algebra is isomorphic to a unital semiprojective graph C * -algebra.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…He showed in [6,Proposition 2.7] that a full unital corner of a semiprojective C * -algebra is semiprojective. Recently, S. Eilers and T. Katsura showed in [11] that a corner of a unital graph C * -algebra that is semiprojective is also semiprojective. Corollary 4.11 is a special case of their results since every Cuntz-Krieger algebra is isomorphic to a unital semiprojective graph C * -algebra.…”
Section: Introductionmentioning
confidence: 99%
“…Semiprojectivity is easy in our case since the graphs are finite. Thus we do not need any results from [11].…”
Section: Introductionmentioning
confidence: 99%
“…(2) A 1 = B 1 ⊗ K, where B 1 is a unital purely infinite graph algebra with exactly one non-trivial ideal. The fact that A 1 is semiprojective follows from the results in [4].…”
Section: Isomorphism Theoremmentioning
confidence: 86%
“…Set k = p s1 1 · · · p s ℓ ℓ . Let z ∈ H e1 n, 4 . Set x = h 1,n,out n,4,e1 (z) ∈ F e1 n, 5 and let x = β e1 n,5 (x) ∈ F e1 1,2 .…”
Section: Claimunclassified
See 1 more Smart Citation