Math 2.0

Associative rings and algebras Definition

Leavitt path algebra

Builds on FieldDirected graphFree algebraTwo-sided idealPath algebraLaurent polynomial ringMatrix ring

Definition

Let KK be a field and let E=(E0,E1,s,r)E = (E^0, E^1, s, r) be a directed graph, with vertex set E0E^0, edge set E1E^1, and source and range maps s,r ⁣:E1→E0s, r \colon E^1 \to E^0. For each edge ee take a new symbol e∗e^*, called a ghost edge. The Leavitt path algebra LK(E)L_K(E) is the quotient of the free algebra over KK on the set E0∪E1∪{e∗:e∈E1}E^0 \cup E^1 \cup \set{e^* : e \in E^1} by the two-sided ideal of these relations:

  1. vw=δv,wvv w = \delta_{v, w} v for all v,w∈E0v, w \in E^0.
  2. s(e)e=e=e r(e)s(e) e = e = e \, r(e) for all e∈E1e \in E^1.
  3. r(e)e∗=e∗=e∗s(e)r(e) e^* = e^* = e^* s(e) for all e∈E1e \in E^1.
  4. e∗f=δe,f r(e)e^* f = \delta_{e, f} \, r(e) for all e,f∈E1e, f \in E^1.
  5. v=∑e∈E1, s(e)=vee∗v = \sum_{e \in E^1, \, s(e) = v} e e^* for every vertex vv that is the source of at least one and at most finitely many edges.

Here δa,b\delta_{a, b} is 11 if a=ba = b and 00 otherwise.

Remarks

Relations 4 and 5 are the Cuntz–Krieger relations. The algebra has an identity, ∑v∈E0v\sum_{v \in E^0} v, exactly when E0E^0 is finite. Relations 1 and 2 alone define the path algebra of EE, which maps into LK(E)L_K(E). Example: let EE have one vertex vv and one loop ee. Relation 4 gives e∗e=ve^* e = v and relation 5 gives ee∗=ve e^* = v, with vv the identity, so LK(E)L_K(E) is the Laurent polynomial ring K[x,x−1]K[x, x^{-1}] with x=ex = e and x−1=e∗x^{-1} = e^*. Example: if EE is u→vu \to v with one edge ee, then LK(E)L_K(E) is isomorphic to the matrix ring M2(K)M_2(K), via u↦E11u \mapsto E_{11}, v↦E22v \mapsto E_{22}, e↦E12e \mapsto E_{12} and e∗↦E21e^* \mapsto E_{21}. Example: one vertex with n≥2n \ge 2 loops gives the Leavitt algebra L(1,n)L(1, n), in which the free module of rank 11 is isomorphic to the free module of rank nn. Non-example: in the path algebra of the one-loop graph, the element ee has no inverse, since every product of ee with a combination of paths has no constant term. Relation 4 needs the ghost edge e∗e^*.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Directed graph concept
  2. Field concept
  3. Free algebra concept
  4. Laurent polynomial ring concept
  5. Matrix ring object
  6. Path algebra concept
  7. Two-sided ideal concept
  8. Leavitt path algebra definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Leavitt_path_algebra
About this page
Tag3S42WRMG9V
URIm2://3S42WRMG9V
Kinddefinition
WritingW0 stub
MSC16S88, 16S10
DefinesLeavitt path algebra
UsesField, Directed graph, Free algebra, Two-sided ideal, Path algebra, Laurent polynomial ring, Matrix ring

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.