Associative rings and algebras Definition
Leavitt path algebra
Builds on FieldDirected graphFree algebraTwo-sided idealPath algebraLaurent polynomial ringMatrix ring
Definition
Let be a field and let be a directed graph, with vertex set , edge set , and source and range maps . For each edge take a new symbol , called a ghost edge. The Leavitt path algebra is the quotient of the free algebra over on the set by the two-sided ideal of these relations:
- for all .
- for all .
- for all .
- for all .
- for every vertex that is the source of at least one and at most finitely many edges.
Here is if and otherwise.
Remarks
Relations 4 and 5 are the Cuntz–Krieger relations. The algebra has an identity, , exactly when is finite. Relations 1 and 2 alone define the path algebra of , which maps into . Example: let have one vertex and one loop . Relation 4 gives and relation 5 gives , with the identity, so is the Laurent polynomial ring with and . Example: if is with one edge , then is isomorphic to the matrix ring , via , , and . Example: one vertex with loops gives the Leavitt algebra , in which the free module of rank is isomorphic to the free module of rank . Non-example: in the path algebra of the one-loop graph, the element has no inverse, since every product of with a combination of paths has no constant term. Relation 4 needs the ghost edge .
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
- no evidence level
- Directed graph concept
- Field concept
- Free algebra concept
- Laurent polynomial ring concept
- Matrix ring object
- Path algebra concept
- Two-sided ideal concept
- Leavitt path algebra definition
Further reading
About this page
| Tag | 3S42WRMG9V |
|---|---|
| URI | m2://3S42WRMG9V |
| Kind | definition |
| Writing | W0 stub |
| MSC | 16S88, 16S10 |
| Defines | Leavitt path algebra |
| Uses | Field, 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.