Simple Modules over Leavitt Path Algebras Generated by Indicator Functions on Paths

arXiv:2611.08344 · math.RA · Submitted 2026-11-05 · Read on arXiv

Listen

Radio episode about this paper

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.

ELIZABETH PACHECO, KULUMANI M. RANGASWAMY

University of Oklahoma · University of Colorado, Colorado Springs

math.RA

Submitted: 2026-11-05

Updated: 2026-11-05

Comments: 29 pages

License: http://creativecommons.org/publicdomain/zero/1.0/

Importance score: 62/100

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…

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

Summary

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). A non-empty subset S ⊆ D that is strongly connected and closed under adding and deleting initial segments is called admissible. p. 1

Where the paper says it

Thus X is closed under adding and deleting initial segments. We call a non-empty subset S of D admissible if it satisfies (#) and is strongly connected, that is, any two vertices lying on paths in S are joined by a path (Definition 3.

For an admissible set S we consider the submodule NS = 1S · LK(E) generated by the indicator function of S. p. 0
Where the paper says it

The space KD of K-valued functions on D is a right module over the Leavitt path algebra LK(E). For a nonempty set S ⊆ D that is strongly connected and closed under adding and deleting initial segments, we study the submodule NS = 1S ·LK(E) generated by the indicator function of S.

The set S 0 of vertices lying on the paths in S and the hereditary saturated set H = E 0 / S 0 is defined. p. 0
Where the paper says it

Let S 0 be the set of vertices lying on the paths in S. We show that NS is simple if and only if S contains no breaking vertex of the hereditary saturated set H = E 0 \S 0 .

Simplicity Conditions for NS

The first main result states that NS is a simple module if and only if S contains no breaking vertex of H. In particular, NS is simple whenever S consists only of infinite paths or when E is row-finite. p. 1

Where the paper says it

5, states that NS is a simple module if and only if S contains no breaking vertex of H; equivalently, no finite path in S ends at a breaking vertex of H. In particular, NS is simple whenever S consists only of infinite paths or E is row-finite (Corollaries 4.

Up to isomorphism, the simple module NS depends only on the vertex set S 0 and not on the paths in S. p. 1
Where the paper says it

12 shows that the condition on breaking vertices cannot be dropped. Up to isomorphism, a simple module NS depends only on the vertex set S 0 and not on the paths in S (Proposition 4.

Structure and Properties of NS

If S is infinite and NS is simple, then the annihilator of NS is the graded primitive ideal I(H, BH). When S contains no breaking vertex of H, for every non-zero g ∈ NS there exist a finite path γ with r(γ) ∈ S 0 and a non-zero c ∈ K such that g · γ = c 1r(γ)S. p. 9

Where the paper says it

Let S be admissible, S ̸= {w} for every vertex w, and suppose that S contains no breaking vertex of H = E0 \S 0 . Then for every non-zero g ∈ NS there exist a finite path γ with r(γ) ∈ S 0 and a non-zero c ∈ K such that g · γ = c 1r(γ)S; in particular g(γy) = c for all y ∈ r(γ)S.

If S is not of the form one vertex w, NS is far from being graded, HomLK(E)(NS, M) = 0 for every Z-graded right LK(E)-module M. p. 2
Where the paper says it

5); in these cases NS is finite dimensional. Apart from the case of a single vertex, the module NS is far from being graded: HomLK(E) (NS, M) = 0 for every Z-graded right LK(E)-module M (Theorem 5.

Comparison with Left Modules and Finite Presentation

The left module LK(E)1S, 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. If S contains no breaking vertex of H and is not a single vertex, then NS is finitely presented if and only if S 0 is finite and only finitely many edges of E have both source and range in S 0. p. 2

Where the paper says it

Finite presentation. If S contains no breaking vertex of H and is not a single vertex, then NS is finitely presented if and only if S 0 is finite and only finitely many edges of E have both source and range in S 0 ; in that case we give an explicit presentation of NS (Theorem 5.

Over a finite graph every simple module NS is finitely presented. p. 0
Where the paper says it

For the rose graph Rn with n ≥ 2 petals, we show that LK(Rn)1S 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 NS is finitely presented when E is a finite graph.

Module Structure over Cohn Path Algebras

When considering the Cohn path algebra CK(E), the natural analogue of D is DC = D∞ ∪ Path(E). The simple right C-module NC S is simple if and only if S satisfies condition (B). p. 1

Where the paper says it

12 shows that the condition on breaking vertices cannot be dropped. Up to isomorphism, a simple module NS depends only on the vertex set S 0 and not on the paths in S (Proposition 4.

If E is a row-finite graph and S ⊆ DC is admissible, then NC S is simple if and only if either S ⊆ D∞, or S = w for a vertex w which is a source. p. 2
Where the paper says it

The case of a single vertex is settled in Proposition 5. As a consequence, over a finite graph every simple module NS is finitely presented, whereas, by [3], other simple modules over such a graph need not be; and over a row-finite graph every simple module NS is finitely presented if and only if S 0 is finite for every admissible set S which is not a single vertex (Corollary 5.

Isomorphism to Chen Modules

The simple left module LK(E)1S = (NS, ◦) is not isomorphic to any Chen simple left module V of type (C1), (C2) or (C3) when S is infinite and contains no breaking vertex of H. For the rose graph Rn with n ≥ 2 petals, LK(Rn)1S is isomorphic to one of the twisted Chen modules constructed by Nam, Srivastava and Vien. p. 0

Where the paper says it

The left module LK(E)1S, 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 Rn with n ≥ 2 petals, we show that LK(Rn)1S 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.

The simple module NS depends only on the vertex set S 0 and not on the paths connecting these vertices. p. 1
Where the paper says it

12 shows that the condition on breaking vertices cannot be dropped. Up to isomorphism, a simple module NS depends only on the vertex set S 0 and not on the paths in S (Proposition 4.

Finiteness Conditions

If E is a finite graph, every simple module NS is finitely presented. If E is a row-finite graph, every simple module NS is finitely presented if and only if S 0 is finite for every admissible set S which is not a single vertex. p. 2

Where the paper says it

The case of a single vertex is settled in Proposition 5. As a consequence, over a finite graph every simple module NS is finitely presented, whereas, by [3], other simple modules over such a graph need not be; and over a row-finite graph every simple module NS is finitely presented if and only if S 0 is finite for every admissible set S which is not a single vertex (Corollary 5.

The condition in Theorem 4. p. 1
Where the paper says it

7), and Example 4. 12 shows that the condition on breaking vertices cannot be dropped.

5 concerns the set of paths S, not the set of vertices S 0. p. 0
Where the paper says it

RANGASWAMY Abstract. 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.

Conclusion on Module Types

The simple module NS depends only on the set of vertices S 0 and not on the paths connecting these vertices. The simple module NS is finitely presented if and only if S 0 is finite and the number of edges e of E with both s(e) and r(e) belonging to S 0 is finite. p. 0

Where the paper says it

For the rose graph Rn with n ≥ 2 petals, we show that LK(Rn)1S 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 NS is finitely presented when E is a finite graph.

For the rose graph Rn, L1S is isomorphic to one of the twisted Chen modules constructed by Nam, Srivastava and Vien. p. 0
Where the paper says it

The left module LK(E)1S, 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 Rn with n ≥ 2 petals, we show that LK(Rn)1S 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.

The simple module NS when E is a finite graph is always finitely presented. p. 0
Where the paper says it

For the rose graph Rn with n ≥ 2 petals, we show that LK(Rn)1S 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 NS is finitely presented when E is a finite graph.

The simple module NC S are isomorphic to NS by Lemma 7. p. 0
Where the paper says it

When S is an infinite set of paths, the simple module NS is neither graded nor projective. The left module LK(E)1S, 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.

3. Up to isomorphism, the simple modules NC S are either NS or Kδw for a regular source vertex w. p. 2
Where the paper says it

SIMPLE MODULES GENERATED BY INDICATOR FUNCTIONS 3 Structure of NS. An admissible set S is finite only in two degenerate situations: either S is a single vertex, or S is the set of rotations of c∞ for a cycle c that no other edge enters (Lemma 3.

The simple module L1S is not isomorphic to any module of type (3). p. 0
Where the paper says it

When S is an infinite set of paths, the simple module NS is neither graded nor projective. The left module LK(E)1S, 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.

The statement about type (5) is part (a). p. 6
Where the paper says it

(e) If r(β) ∈ S 0 for a finite path β, then βS ̸= ∅; if r(β) ∈/ S 0 , then βS = ∅. (a) The first statement is (#) applied to α and p ′ .

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improved AI can determine if a right module NS generated by an indicator function on an admissible set S is simple by checking if S contains no breaking vertex of H, as stated in Theorem 4.5.

  2. The improved system can distinguish between the simple right module NS and its twisted left module LK(E)1S based on the condition that NS is simple exactly when NS is (Proposition 6.3).

  3. The AI can classify a simple left module LK(E)1S over a rose graph Rn by checking if it is isomorphic to one of the Chen simple modules, specifically distinguishing between L1S and other modules in the list [7, Theorem 4.7] (Theorem 6.9).

  4. The system can determine when a simple right module NS is finitely presented by verifying if S 0 is finite and only finitely many edges of E have both source and range in S 0 (Theorem 5.6).

  5. The AI can analyze the structure of the annihilation ideal ann(NS) for an infinite set S, concluding it equals I(H, BH), which is a graded primitive ideal (Proposition 5.4).

  6. The system can identify when a simple right module NS is not Z-graded or not projective by checking if S is not of the form w, with w a vertex (Corollary 5.2).

  7. For Cohn path algebras CK(E), the AI can determine simplicity by checking if S satisfies condition (B), which means either S = v for a vertex v, or sS(v) is infinite for every vertex w which is an element of S (Definition 7.5 and Lemma 7.6).

  8. The system can confirm that simple modules NC S over Cohn path algebras are isomorphic to NS if they satisfy the condition that S contains no breaking vertex of H (Corollary 7.8(i)).

Abstract

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.

Related papers