Hostname: page-component-848d4c4894-75dct Total loading time: 0 Render date: 2024-05-03T14:00:49.080Z 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)

Abstract

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.

Type
Research Article
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)