[Paper Review] Kumjian-Pask algebras of higher-rank graphs

Gonzalo Aranda Pino, John Clark+2 more|arXiv (Cornell University)|Jun 22, 2011

Advanced Operator Algebra Research17 references4 citations

TL;DR

This paper introduces Kumjian-Pask algebras as algebraic analogues of higher-rank graph C*-algebras for row-finite k-graphs without sources. It establishes graded and Cuntz-Krieger uniqueness theorems, characterizes the ideal structure via saturated hereditary subsets, and proves that simplicity in the algebraic sense corresponds to aperiodicity and cofinality, extending results from Leavitt path algebras to higher-rank graphs.

ABSTRACT

We introduce higher-rank analogues of the Leavitt path algebras, which we call the Kumjian-Pask algebras. We prove graded and Cuntz-Krieger uniqueness theorems for these algebras, and analyze their ideal structure.

Motivation & Objective

• To develop an algebraic analogue of higher-rank graph C*-algebras, extending Leavitt path algebras to k-graphs.
• To establish graded and Cuntz-Krieger uniqueness theorems for these algebras over arbitrary commutative rings with identity.
• To characterize the ideal structure of Kumjian-Pask algebras using saturated hereditary subsets of vertices.
• To determine necessary and sufficient conditions for the algebra to be simple in the conventional algebraic sense.

Proposed method

• Construct the Kumjian-Pask algebra KP_R(Λ) as a quotient of the free R-algebra on the paths of a row-finite k-graph Λ without sources.
• Define the Kumjian-Pask relations that generalize the Leavitt path algebra relations to higher-rank graphs.
• Prove a graded-uniqueness theorem using a common approach to both uniqueness theorems, avoiding complex induction arguments.
• Use the finite-path formulation of aperiodicity (due to Robertson and Sims) as the key hypothesis in the Cuntz-Krieger uniqueness theorem.
• Characterize graded ideals in terms of saturated hereditary subsets of vertices, following the Cuntz–Krieger and Tomforde framework.
• Establish conditions under which the algebra is simple, relying on cofinality and aperiodicity, and prove that simplicity implies the absence of nontrivial ideals.

Experimental results

Research questions

• RQ1 How can Leavitt path algebras be generalized to higher-rank graphs, and what relations define the resulting algebras?
• RQ2 What uniqueness theorems hold for the new algebras, and how do they compare to those in the C*-algebraic setting?
• RQ3 How is the ideal structure of the Kumjian-Pask algebra related to the combinatorics of the underlying k-graph?
• RQ4 Under what conditions is the Kumjian-Pask algebra simple, and how does this differ from the C*-algebraic case?
• RQ5 Can the dichotomy between purely infinite and locally matricial algebras fail in the algebraic setting, as it does in the C*-algebraic case?

Key findings

• The graded-uniqueness theorem holds for Kumjian-Pask algebras of row-finite k-graphs without sources, ensuring injectivity of representations that are nonzero on the unit of the algebra.
• The Cuntz-Krieger uniqueness theorem applies under the finite-path formulation of aperiodicity, guaranteeing injectivity of representations when the algebra is generated by a universal family satisfying the Kumjian-Pask relations.
• The ideal structure of KP_R(Λ) is fully described via saturated hereditary subsets of vertices, with every basic ideal being graded if and only if the graph satisfies a condition analogous to Condition (K) for 1-graphs.
• The algebra KP_C(Λ) is simple if and only if the k-graph Λ is cofinal and aperiodic, extending the simplicity criterion from 1-graph Leavitt path algebras.
• There exist simple Kumjian-Pask algebras that are neither purely infinite nor locally matricial, demonstrating that the dichotomy observed in Leavitt path algebras does not extend to higher-rank graphs.