The Reduction Theorem for Leavitt Path Algebras of Labeled Graphs and Its Applications

ABSTRACT We introduce a notion of labeled cycle for normal labeled spaces and prove a reduction theorem for Leavitt path algebras associated with labeled graphs. We show that every nonzero element can be reduced, by suitable left and right multiplication, either to a nonzero scalar multiple of a projection or to a polynomial supported on a labeled cycle without exits. This extends the classical reduction theorem for Leavitt path algebras of directed graphs and its analogues for ultragraph Leavitt path algebras and subshift algebras. As applications, we prove the graded uniqueness theorem and the Cuntz–Krieger uniqueness theorem for Leavitt path algebras associated with labeled graphs, and show that these algebras are semiprime and semiprimitive over fields.