The Leavitt path algebra of a graph

Abstract

For any row-finite graph E and any field K we construct the Leavitt path algebra L(E) having coefficients in K. When K is the field of complex numbers, then L(E) is the algebraic analog of the Cuntz Krieger algebra C*(E) described in [8]. The matrix rings Mn(K) and the Leavitt algebras L(1,n) appear as algebras of the form L(E) for various graphs E. In our main result, we give necessary and sufficient conditions on E which imply that L(E) is simple.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…