Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T10:28:35.586Z Has data issue: false hasContentIssue false

Decidability of the isomorphism problem for stationary AF-algebras and the associated ordered simple dimension groups

Published online by Cambridge University Press:  28 November 2001

OLA BRATTELI
Affiliation:
Department of Mathematics, University of Oslo, PB 1053—Blindern, N-0316 Oslo, Norway (e-mail: bratteli@math.uio.no)
PALLE E. T. JORGENSEN
Affiliation:
Department of Mathematics, The University of Iowa, 14 MacLean Hall, Iowa City, IA 52242-1419, USA (e-mail: jorgen@math.uiowa.edu)
KI HANG KIM
Affiliation:
Mathematics Research Group, Alabama State University, Montgomery AL 36101–0271, USA (e-mail: kkim,froush@asunet.alasu.edu)
FRED ROUSH
Affiliation:
Mathematics Research Group, Alabama State University, Montgomery AL 36101–0271, USA (e-mail: kkim,froush@asunet.alasu.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The notion of isomorphism on stable AF-C^{\ast}-algebras is considered in this paper in the case when the corresponding Bratteli diagram is stationary, i.e. is associated with a single square primitive incidence matrix. A C^{\ast}-isomorphism induces an equivalence relation on these matrices, called C^{\ast}-equivalence. We show that the associated isomorphism equivalence problem is decidable, i.e. there is an algorithm that can be used to check in a finite number of steps whether two given primitive matrices are C^{\ast}-equivalent or not. Special cases of this problem will be considered in a forthcoming paper.

Information

Type
Research Article
Copyright
2001 Cambridge University Press