If is a directed graph, is a field, and is a graded ideal of the Leavitt path algebra is completely determined by an admissible pair of two sets of vertices of . The ideal is graded isomorphic to the Leavitt path algebra of the {\em porcupine graph} of and the quotient is graded isomorphic to the Leavitt path algebra of the {\em quotient graph} of We present a construction which generalizes both constructions and enables one to consider quotients of graded ideals: if and are admissible pairs such that , we define the {\em porcupine-quotient graph} such that its Leavitt path algebra is graded isomorphic to the quotient Using the porcupine-quotient construction, the existence of a graded composition series of is equivalent to the existence of a finite chain of admissible pairs of starting with the trivial and ending with the improper pair, such that the quotient of two consecutive pairs is cofinal (a graph is cofinal exactly when its Leavitt path algebra is graded simple). We characterize the existence of such a composition series with a set of conditions which also provides an algorithm for obtaining such a series. The conditions are presented in terms of four types of vertices which are all ``terminal’’ in a certain sense. Three types are often referred to as the three primary colors and the fourth type is new. As a corollary, a unital Leavitt path algebra has a graded composition series. We show that the existence of a composition series of is equivalent to the existence of a composition series of the graph monoid as well as a composition series of the talented monoid An ideal of is minimal exactly when it is generated by the element of corresponding to a terminal vertex.

生成讲解博客的中文版本

生成AI智能校验的中文版本