A construction of simple-minded systems over domestic Brauer graph algebras II: the 1-domestic case
Abstract: Let A be a 1-domestic Brauer graph algebra. By covering theory and the characterization of simple-minded systems of 2-domestic Brauer graph algebras, we construct a family of objects in A-stmod to be a simple-minded system and our construction provides all simple-minded systems in A-stmod.
Sign up to identify related papers:
Summary
- The paper completes the 1-domestic case by proving that simple-minded systems correspond to stable, maximal orthogonal systems meeting the unique Euclidean component.
- The covering from a 2-domestic algebra transfers systems to the 1-domestic case, halving their size to the number of non-isomorphic simple modules and enabling explicit constructions.
- The paper develops stable-brick criteria and a finite greedy algorithm, illustrated by examples, while identifying extensions beyond domestic algebras as an open problem.
This paper, by Zhen Zhang, completes a classification programme for simple-minded systems over domestic Brauer graph algebras. A previous paper by the same author treated the 2-domestic case; the present work handles the 1-domestic case, and together the two results yield a full characterization and an explicit construction of simple-minded systems in the stable module categories of all domestic Brauer graph algebras (2606.16085).
Background and setup
Simple-minded systems, introduced by Koenig and Liu, are families S of objects in the stable module category A-mod​ of an artin algebra satisfying orthogonality (each object is a stable brick, with vanishing Hom between distinct members) and a generating condition (the extension closure F(S) equals the whole stable category). The paper works throughout over an algebraically closed field k, with A a basic indecomposable 1-domestic Brauer graph algebra.
The structural input is the Bocian–Skowroński description: a Brauer graph algebra is 1-domestic exactly when its Brauer graph is a tree with multiplicity m(i)=2 at precisely two vertices, or has a unique odd cycle with all multiplicities one. Equivalently, A is a symmetric algebra of Euclidean type Am​ with non-singular Cartan matrix, and A≅B/⟨φ⟩, where B is a representation-infinite tilted algebra of Euclidean type A-mod​0 (an exceptional Euclidean algebra) and A-mod​1 is a square root of the Nakayama automorphism A-mod​2 of the repetitive algebra A-mod​3. The 2-domestic case, by contrast, corresponds to the trivial extension A-mod​4 with A-mod​5 tilted of Euclidean type and singular Cartan matrix.
The covering functor from the 2-domestic case
The central technical observation is that the stable module category of a 1-domestic Brauer graph algebra admits a dense covering functor from that of a 2-domestic one. Specifically, since both A-mod​6 and A-mod​7 are admissible groups of automorphisms of A-mod​8, and A-mod​9, there is a Galois covering F(S)0 where F(S)1 is 2-domestic. Because F(S)2 is locally support-finite, the Dowbor–Skowroński theorem guarantees the pushdown functor is dense, and since F(S)3 preserves projectives, it descends to a dense covering functor F(S)4.
The combinatorial consequence is that the stable AR-quiver of F(S)5 contains exactly one stable Euclidean component F(S)6, whereas the stable AR-quiver of F(S)7 contains two; moreover F(S)8 is the number of non-isomorphic simple F(S)9-modules and k0 that of k1. This halving under the covering is what drives the main theorem.
Main theorem and its consequences
The main result is a two-way correspondence. If k2 is a k3-stable simple-minded system in k4 (i.e., k5, where k6 is the stable equivalence induced by the square root k7), then k8 is a simple-minded system in k9; conversely, the preimage A0 of any simple-minded system A1 in A2 is a A3-stable simple-minded system in A4. The proof of orthogonality uses the Galois covering isomorphism
A5
split via A6 into the A7-spaces for A8 and A9, which vanish or equal m(i)=20 by the orthogonality and brick property of m(i)=21 in m(i)=22. The key point is that m(i)=23 maps m(i)=24-periodic modules to m(i)=25-periodic ones and shifts Euclidean components and quasi-tube families by one, so the image m(i)=26 has exactly m(i)=27 elements and meets the unique Euclidean component of m(i)=28.
Two corollaries follow. First, any maximal orthogonal system in m(i)=29 containing at least one object from the Euclidean component is a simple-minded system, of cardinality equal to the number of non-projective non-isomorphic simple A0-modules. Second, combining with the 2-domestic characterization (Zhang, 29 Sep 2025), a family A1 in the stable module category of an arbitrary domestic Brauer graph algebra is a simple-minded system if and only if it is a maximal orthogonal system containing at least one object for each Euclidean component — a complete intrinsic characterization. A further corollary shows that a finite weakly simple-minded system over a domestic Brauer graph algebra is automatically a simple-minded system.
The action of A2 and stable bricks
The paper then analyzes the action of A3 on the stable AR-quiver of A4, which decomposes as A5 with Euclidean components A6 and A7-families of quasi-tubes, all components being stable generalized standard. Two cases emerge, and the dichotomy is structural:
- If A8 preserves the orientation of irreducible maps in the Euclidean components, then A9 and Am​0 are odd, and Am​1 acts on a Euclidean component as a half-rotation: for Am​2, Am​3. Consequently Am​4 on the quasi-tube of rank Am​5 and Am​6 on the rank-Am​7 tube, so each quasi-tube is Am​8-stable.
- If Am​9 inverts the orientation, the quasi-tubes are exchanged: A≅B/⟨φ⟩0 and A≅B/⟨φ⟩1, and necessarily A≅B/⟨φ⟩2.
The orientation-preserving case is forced to have odd A≅B/⟨φ⟩3: the argument shows that if the orientation were preserved with even parameters, the commutation A≅B/⟨φ⟩4 would fail. This is a genuine constraint, not an artifact of the labeling.
On stable bricks, the paper proves that every object in the stable Euclidean component of A≅B/⟨φ⟩5 is a stable brick — the covering-theoretic computation reduces A≅B/⟨φ⟩6 to A≅B/⟨φ⟩7 using the fact that A≅B/⟨φ⟩8 lies in the stable bi-perpendicular category of A≅B/⟨φ⟩9. For the quasi-tubes, a sharp dichotomy is established: if B0 for a quasi-simple B1 in a quasi-tube of rank B2 with B3, then a module B4 of quasi-length B5 is a stable brick if and only if B6; when B7, every object of quasi-length less than B8 is a stable brick. This brick criterion is what makes the subsequent construction effective, since simple-minded systems may only consist of stable bricks.
The construction
The construction proceeds by determining, for any candidate object, the intersection of its stable bi-perpendicular category B9 with each stable component. The key inputs are: (i) the formula expressing A-mod​00 as the complement of predecessors/successors of A-mod​01, A-mod​02, and A-mod​03 within A-mod​04, derived from covering theory and Serre duality; and (ii) the Erdmann–Kerner description of Hom-spaces from the Euclidean component into quasi-tubes via wings of quasi-simplices. These yield explicit descriptions: in the orientation-preserving case, A-mod​05 is a union of two rectangular regions in the A-mod​06-component, and A-mod​07 is a union of four triangle areas in the quasi-tubes. Since the bi-perpendicular intersection is finite at each stage, a greedy algorithm — repeatedly adding any stable brick from the current bi-perpendicular category — terminates in finitely many steps at a maximal orthogonal system, which by the main corollary is a simple-minded system.
Two worked examples illustrate the two orientation cases. In the first (a tree Brauer graph with four edges), the stable AR-quiver has a Euclidean component, a quasi-tube of rank 3 and one of rank 5; starting from the simple module 3, the algorithm terminates at maximal orthogonal systems of size 4, and the paper lists all five simple-minded systems containing that simple module. In the second (a Brauer graph with a 5-cycle, so A-mod​08 inverts orientation and A-mod​09), starting from the orthogonal system A-mod​10 the paper lists all four simple-minded systems containing it. In both examples the homogeneous tubes contribute nothing, consistent with the theorem of Chan–Liu–Zhang that no member of a simple-minded system over a self-injective algebra lies in a homogeneous tube or has quasi-length at least the rank of its quasi-tube.
Limitations and open questions
The paper is candid about the scope of its method. The construction relies on the covering A-mod​11 with A-mod​12 2-domestic, so it does not directly extend to non-domestic Brauer graph algebras, where the stable AR-quiver contains no Euclidean components and the covering reduction to a 2-domestic algebra is unavailable. The characterization via maximal orthogonal systems meeting each Euclidean component is specific to the domestic setting; whether an analogous intrinsic criterion holds for, say, periodic Brauer graph algebras is not addressed. The paper also leaves implicit the enumeration problem in general: the examples list all simple-minded systems containing a fixed starting system, but no closed formula for the total number of simple-minded systems over an arbitrary 1-domestic Brauer graph algebra is given, and the dependence of this count on the parameters A-mod​13 and A-mod​14 remains an open combinatorial question. Finally, the analysis of the orientation-inverting case is carried out only through examples; the general construction in that case is described at the same level of detail as the orientation-preserving case, but the corresponding explicit bi-perpendicular formulas analogous to those in the orientation-preserving subsection are not developed in full generality.
Conclusion
The paper establishes that simple-minded systems in the stable module category of a 1-domestic Brauer graph algebra are exactly the maximal orthogonal systems meeting the unique stable Euclidean component, via a covering correspondence with the 2-domestic case that halves the system size. Together with the earlier 2-domestic paper, this gives a complete characterization and an effective finite construction of all simple-minded systems over domestic Brauer graph algebras. The main open direction the paper leaves is the extension of these methods beyond the domestic class, where neither the Euclidean components nor the covering reduction are available.
Paper to Video (Beta)
No one has generated a video about this paper yet.
Whiteboard
No one has generated a whiteboard explanation for this paper yet.
Paper Prompts
Sign up for free to create and run prompts on this paper.
Top Community Prompts
Open Problems
We haven't generated a list of open problems mentioned in this paper yet.
Continue Learning
- How does the covering functor preserve orthogonality and the generating condition for simple-minded systems?
- Why does the stable Auslander–Reiten quiver of a 1-domestic Brauer graph algebra contain exactly one Euclidean component?
- How do orientation-preserving and orientation-inverting actions of the square-root Nakayama automorphism affect stable bricks?
- Can the greedy bi-perpendicular construction be used to count all simple-minded systems for arbitrary parameters p and q?
- Find recent papers about simple-minded systems over domestic Brauer graph algebras.
Tweets
Sign up for free to view the 1 tweet with 1 like about this paper.