Simple Modules over Leavitt Path Algebras Generated by Indicator Functions on Paths
summary
The gist
Simple modules over Leavitt path algebras generated by indicator functions on paths study simple right modules NS generated by an indicator function on a strongly connected admissible set S…
In short
This work studies simple right modules NS generated by indicator functions of strongly connected admissible sets S over Leavitt path algebras LK(E). The main result shows that NS is simple if and only if S contains no breaking vertex of the hereditary saturated set H. This determines the structure of these modules, linking them to other known simple module types like Chen modules.
Key concepts
- Admissible Set
- An admissible set S is a non-empty subset of vertices in a graph D that is strongly connected and closed under adding or removing initial segments. This property ensures that the submodule NS generated by its indicator function has specific structural properties relevant to simplicity.
- Breaking Vertex
- A breaking vertex relates to the structure of the hereditary saturated set H derived from an admissible set S. The condition that S contains no breaking vertex of H is crucial; it is the necessary and sufficient condition for the module NS generated by S to be simple.
- Hereditary Saturated Set
- The hereditary saturated set H is defined as the quotient E_0 / S_0, where E_0 are vertices and S_0 are vertices lying on paths within the admissible set. This set helps characterize the structure of NS; its absence of breaking vertices dictates whether NS is simple.
- Leavitt Path Algebra (LK(E))
- LK(E) is an algebra constructed from a graph E, where elements represent formal sums of paths in E. The paper investigates modules over this algebra, specifically the right module KD, which consists of K-valued functions on D.
Terminology used across episodes
This episode discusses
The paper
Simple Modules over Leavitt Path Algebras Generated by Indicator Functions on Paths · Read on arXiv
ELIZABETH PACHECO, KULUMANI M. RANGASWAMY
University of Oklahoma · University of Colorado, Colorado Springs
Let E be an arbitrary graph, K a field, and D the set of boundary paths of E consisting of both infinite paths and finite paths ending at singular vertices. The space KD of K-valued functions on D is a right module over the Leavitt path algebra LK(E). For a non- empty set S ? D that is strongly connected and closed under adding and deleting initial segments, we study the submodule N S = 1 S.LK(E) generated by the indicator function of S. Let S 0 be the set of vertices lying on the paths in S. We show that N S is simple if and only if S contains no breaking vertex of the hereditary saturated set H = E0 nS0. In particular, when S contains only infinite paths or when E is a row- finite graph, NS is a simple module. Up to isomorphism, the simple module NS depends only on S 0. When S is an infinite set of paths, the simple module NS is neither graded nor projective. The left module LK(E)1 S, obtained by twisting the action through the involution of LK(E), is simple exactly when NS is, and, when S is infinite, it is not isomorphic to any of the Chen simple modules. For the rose graph R n with n ? 2 petals, we show that LK(R n)1 S is isomorphic to one of the twisted Chen modules constructed by Nam, Srivastava and Vien, and to none of the other simple modules in their list. Moreover, when S is not a single vertex, the simple module NS is finitely presented if and only if only finitely many edges of E have both source and range in S 0; in particular, every simple module N S is finitely presented when E is a finite graph. Finally, we determine when the analogous module generated by an indicator function over the Cohn path algebra CK(E) is simple. 1.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Simple Modules over Leavitt Path Algebras Generated by Indicator Functions on Paths".
Emmy: Here's the gist of the paper. Simple modules over Leavitt path algebras generated by indicator functions on paths study simple right modules NS generated by an indicator function on a strongly connected admissible set S, showing that NS is simple if and only if S contains no breaking vertex of the hereditary saturated set H Defining the Setting and Admissibility Criteria The space KD of K-valued functions on D is a right module over the Leavitt path algebra LK(E).
Ada: A non-empty subset S ⊆ D that is strongly connected and closed under adding and deleting initial segments is called admissible.
Emmy: For an admissible set S we consider the submodule NS = 1S · LK(E) generated by the indicator function of S.
Ada: The set S 0 of vertices lying on the paths in S and the hereditary saturated set H = E 0 / S 0 is defined.
Paper summary: Emmy: So looking at this paper by Elizabet Pacheco and Kulumani Rangaswamy's work on Simple Modules over Leavitt Path Algebras Generated by Indicator Functions on Paths, the main point is that simplicity for the module NS comes down to checking if the set S contains no breaking vertex of the hereditary saturated set H >
Ada: That’s a very concise way to summarize it, and it moves us from an abstract algebraic definition of simplicity to a concrete combinatorial check on paths in S >
Kolya: And while they show that this holds for certain cases like infinite paths or row-finite graphs, the paper also gives us some context about what happens when we look at related modules like the left module LK(E) 1S > <ref:2611.08344#pg3>
Emmy: They explain that when S is infinite and has no breaking vertex of H, the left module LK(E) 1S is not isomorphic to any of the Chen simple modules, which ties this work into a broader family of simple modules > <ref:2611.08344#pg3>
Ada: So in simple terms, these modules generated by indicator functions on paths give us a way to classify simplicity based on the set S and its relationship with the hereditary saturated set H >
Kolya: The implication for someone who just listens to the show is that it shows that even when you introduce path information into your algebra, you can still get a clear picture of what’s going on by focusing on which vertices are involved >
Conclusion: Ada: So we're wrapping up this look at "Simple Modules over Leavitt Path Algebras Generated by Indicator Functions on Paths". The core idea is that simplicity for these modules, represented by NS generated on a set S, depends entirely on whether S has any breaking vertices in the hereditary saturated set H.
Emmy: Exactly. They show that this condition—no breaking vertex—is the precise way to determine if the module NS is simple within the Leavitt path algebra LK(E). It connects a purely geometric property of paths in S to a fundamental algebraic concept, simplicity.
Kolya: And when we look at those infinite sets S, they point out that even if the module NS is simple, it’s not graded or projective in this context. That means we have structural limits on how these modules behave algebraically.
Ada: It's important because it shows that simply picking a set of paths doesn't just define an arbitrary module; it defines one whose simplicity is governed by the structure of the underlying graph E through that set S.
Emmy: And when we look at related left modules, specifically LK(E) 1S, they show a deep connection. When NS is simple and S is infinite without breaking vertices in H, then LK(E) 1S isn't just similar to NS; it's not isomorphic to any of the Chen simple modules.
Kolya: For example, on a rose graph with at least two petals, they show that this left module LK(Rn) 1S actually turns out to be one of the twisted Chen modules constructed by Nam Srivastava and Vien.
Ada: So what this means for us is that the simple modules we find using path indicator functions can be mapped directly onto known structures in the Chen family under specific conditions. It shows that even when you introduce path information into your algebra, you're still dealing with a recognizable family of objects.
Emmy: It really highlights how different generating sets can lead to the same kinds of simple modules when you apply the right constraints.
Kolya: So next time you look at these path indicator modules, remember that checking those breaking vertices in H is your first step to figuring out if it's simple and what family of structures it belongs to.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors