Table of Contents
Fetching ...

Diagonal-preserving Isomorphisms of Algebras from Infinite Graphs

Søren Eilers, Efren Ruiz

TL;DR

The paper studies diagonal-preserving isomorphisms among algebras arising from infinite graphs, linking $\mathcal{O}_\infty$, graph $C^*$-algebras, Leavitt path algebras, and their diagonals to topological full groups and groupoids through $K_0$-theory and zeroth groupoid homology. It extends Matsumoto's diagonal-normalizer framework to the infinite-graph setting by introducing diagonal-normalizer monoids $\mathcal{V}^*(A,D)$ and proving isomorphisms with the graph monoid $M_E$, across $\mathbb{Z}$, general fields, and $\mathbb{C}$-coefficients, via Steinberg algebras and groupoid techniques. A central result is that several diagonal-preserving isomorphism questions for $\mathcal{O}_\infty$, $C^*(E)$, $L_\mathsf{k}(E)$, and related groupoids are equivalent, and that solving these reduces to the existence of diagonal-preserving stable automorphisms inducing the nontrivial $K_0$-automorphism (or corresponding homology automorphism). The work provides a unifying framework—bridging operator algebras, graph algebras, and groupoid methods—that advances the classification program for diagonal-preserving isomorphisms in the infinite-graph regime and informs rigidity phenomena across these categories.

Abstract

We establish logical equivalence between statements involving * the Cuntz C*-algebra $\mathcal O_\infty$ with its canonical diagonal; * graph C*-algebras with their canonical diagonals; * Leavitt path algebras over general fields with their canonical diagonals; * Leavitt path algebras over $\mathbb Z$; * topological full groups; * groupoids; and * the automorphism $x\mapsto -x$ on certain $K_0$- and homology groups equal to $\mathbb Z$ Deciding whether these equivalent statements are true or false is of importance in studies of geometric classification of diagonal-preserving isomorphism between graph C*-algebras and Leavitt path algebras, mirroring a similar hindrance studied by Cuntz more than 40 years ago.

Diagonal-preserving Isomorphisms of Algebras from Infinite Graphs

TL;DR

The paper studies diagonal-preserving isomorphisms among algebras arising from infinite graphs, linking , graph -algebras, Leavitt path algebras, and their diagonals to topological full groups and groupoids through -theory and zeroth groupoid homology. It extends Matsumoto's diagonal-normalizer framework to the infinite-graph setting by introducing diagonal-normalizer monoids and proving isomorphisms with the graph monoid , across , general fields, and -coefficients, via Steinberg algebras and groupoid techniques. A central result is that several diagonal-preserving isomorphism questions for , , , and related groupoids are equivalent, and that solving these reduces to the existence of diagonal-preserving stable automorphisms inducing the nontrivial -automorphism (or corresponding homology automorphism). The work provides a unifying framework—bridging operator algebras, graph algebras, and groupoid methods—that advances the classification program for diagonal-preserving isomorphisms in the infinite-graph regime and informs rigidity phenomena across these categories.

Abstract

We establish logical equivalence between statements involving * the Cuntz C*-algebra with its canonical diagonal; * graph C*-algebras with their canonical diagonals; * Leavitt path algebras over general fields with their canonical diagonals; * Leavitt path algebras over ; * topological full groups; * groupoids; and * the automorphism on certain - and homology groups equal to Deciding whether these equivalent statements are true or false is of importance in studies of geometric classification of diagonal-preserving isomorphism between graph C*-algebras and Leavitt path algebras, mirroring a similar hindrance studied by Cuntz more than 40 years ago.

Paper Structure

This paper contains 2 sections, 7 theorems, 45 equations.

Key Result

Theorem A

The following are equivalent.

Theorems & Definitions (17)

  • Theorem A
  • Definition 2.1
  • Definition 2.2
  • Proposition 2.3
  • Lemma 2.4
  • proof
  • Definition 2.5
  • Lemma 2.6
  • proof
  • Lemma 2.7
  • ...and 7 more