Weakly Simple-Minded System in Stable Categories

• Weakly simple-minded systems are families of orthogonal stable bricks that detect every nonzero object via nonzero morphisms.
• They delineate the gap between full extension-generation and a weaker generation condition in triangulated stable module categories.
• In domestic Brauer graph algebras, finite weakly simple-minded systems coincide with simple-minded systems through syzygy closure conditions.

A weakly simple-minded system is a family of objects in a triangulated or stable module category that satisfies the orthogonality condition of a simple-minded system but only a weaker form of generation. In the stable module category $A\text{-}\underline{\mathrm{mod}}$ of a self-injective algebra $A$, this means a family of stable bricks $\mathcal S$ such that every nonzero object receives a nonzero morphism from some member of $\mathcal S$, without a priori requiring $\mathcal S$ to generate the whole category by extensions. The notion is central in the comparison between orthogonality, generation, and stable equivalence invariants, and recent work shows that for domestic Brauer graph algebras the distinction between weakly simple-minded systems and simple-minded systems largely collapses in finite settings (Zhang, 20 Jun 2026, Zhang, 15 Jun 2026).

1. Definition in stable categories

Let $A$ be a finite dimensional algebra and let $A\text{-}\underline{\mathrm{mod}}$ denote its stable category, whose objects are finitely generated $A$-modules and whose morphisms are taken modulo those factoring through projectives. When $A$ is self-injective, this stable category is triangulated (Zhang, 15 Jun 2026).

In this setting, a simple-minded system $\mathcal S$ is a family of objects satisfying two conditions. First, it is an orthogonal system of stable bricks: each $A$0 has $A$1, and $A$2 for distinct $A$3. Second, its extension closure is the whole category: $A$4 where $A$5 and

$A$6

Here $A$7 is defined by successive extensions (Zhang, 15 Jun 2026).

A weakly simple-minded system replaces the extension-generating requirement by the weaker condition

$A$8

Thus, orthogonality is unchanged, but generation is tested by nonvanishing morphisms rather than by extension closure (Zhang, 20 Jun 2026).

This distinction is categorical rather than merely terminological. A simple-minded system encodes a filtration-theoretic generating set for the stable category, whereas a weakly simple-minded system only detects every nonzero object by a morphism from the system. The second condition is explicitly weaker than requiring $A$9 to generate the whole category under extensions (Zhang, 29 Sep 2025).

2. Relation to simple-minded systems

Every simple-minded system is weakly simple-minded, but the converse is not known in general. Earlier triangulated-category work emphasized the stronger notion of a simple-minded system and observed that every such system is a maximal system of orthogonal bricks, while the converse was not known in general (Dugas, 2012).

Later results refined this comparison for self-injective algebras. Over representation-finite self-injective algebras, simple-minded systems and weakly simple-minded systems coincide. By contrast, for representation-infinite self-injective algebras, a weakly simple-minded system may fail to be a simple-minded system (Zhang, 20 Jun 2026).

A general sufficient mechanism for upgrading weak generation to full generation is also available. If $\mathcal S$0 is self-injective and $\mathcal S$1 is a finite orthogonal system in $\mathcal S$2 such that $\mathcal S$3, and if $\mathcal S$4 is a weakly simple-minded system together with an additional technical condition, then $\mathcal S$5 is a simple-minded system (Zhang, 20 Jun 2026). This places the weakly simple-minded condition inside a broader program: identify structural hypotheses under which weak detection of nonzero objects forces extension-generation.

From the perspective of stable module categories, the problem is closely related to the Auslander–Reiten structure and to how syzygies interact with extension closure. This suggests that the gap between weakly simple-minded and simple-minded systems is often controlled not by orthogonality itself, but by whether the ambient category supplies enough closure properties to convert nonzero maps into extension-theoretic generation.

3. Domestic Brauer graph algebras

The sharpest positive results presently summarized here occur for domestic Brauer graph algebras. For these algebras, a concrete criterion identifies when an orthogonal system is a simple-minded system: $\mathcal S$6 Equivalently, the first condition forces the system to meet the non-periodic part of the stable category, and the second requires syzygies to remain inside the extension closure (Zhang, 20 Jun 2026).

This criterion is especially significant because domestic Brauer graph algebras have stable Auslander–Reiten quivers with at most two Euclidean components. In that environment, the distinction between periodic and non-periodic modules becomes decisive, and the syzygy condition can be checked against the geometry of the AR-quiver (Zhang, 20 Jun 2026).

A further consequence is that for domestic Brauer graph algebras, any finite weakly simple-minded system is a simple-minded system (Zhang, 15 Jun 2026). The same phenomenon had already been established in the 2-domestic case: for a 2-domestic Brauer graph algebra, if $\mathcal S$7 is a weakly simple-minded system with $\mathcal S$8, then $\mathcal S$9 is a simple-minded system (Zhang, 29 Sep 2025).

These results give one of the clearest known domains in which weak generation is not genuinely weaker once finiteness and domesticity are imposed. A plausible implication is that domesticity provides sufficient control over periodic components, Euclidean components, and syzygy behavior to force extension-generation.

4. Complete classification in the domestic Brauer graph setting

For 2-domestic Brauer graph algebras, simple-minded systems admit a complete combinatorial description. The stable AR-quiver consists of two Euclidean components, quasi-tubes, and infinitely many homogeneous tubes. Simple-minded systems are precisely maximal orthogonal systems containing at least one object from each Euclidean component, and no simple-minded system can contain a module from a homogeneous tube (Zhang, 29 Sep 2025).

For 1-domestic Brauer graph algebras, the corresponding classification is analogous but asymmetric. A Brauer graph algebra is 1-domestic when its Brauer graph is either a tree with exactly two vertices of multiplicity $\mathcal S$0 and all others of multiplicity $\mathcal S$1, or a connected graph with a single odd cycle and all vertices of multiplicity $\mathcal S$2. In this case the stable AR-quiver has one stable Euclidean component, exactly two quasi-tubes of ranks $\mathcal S$3 and $\mathcal S$4, and infinitely many homogeneous tubes (Zhang, 15 Jun 2026).

The complete classification states that every simple-minded system in $\mathcal S$5 is, and only is, a maximal orthogonal system containing at least one object from the Euclidean component. The modules appearing in such a system are chosen from the Euclidean and quasi-tube components, subject to orthogonality and maximality, while homogeneous-tube modules are excluded (Zhang, 15 Jun 2026).

In the 1-domestic case, covering theory is used to reduce the problem to the 2-domestic case. If

$\mathcal S$6

with $\mathcal S$7 the repetitive algebra of an exceptional Euclidean algebra of type $\mathcal S$8, then there is a dense exact covering functor

$\mathcal S$9

where $\mathcal S$0 is a 2-domestic Brauer graph algebra. Under the relevant stability conditions, $\mathcal S$1 lifts and descends simple-minded systems between $\mathcal S$2 and $\mathcal S$3 (Zhang, 15 Jun 2026).

Because any finite weakly simple-minded system is a simple-minded system in the domestic Brauer graph setting, these classification theorems also govern finite weakly simple-minded systems there. In particular, finite weakly simple-minded systems in the 1-domestic case are forced into the same maximal-orthogonal pattern, with obligatory representation of the unique Euclidean component.

5. Terminological extensions and higher analogues

The phrase weakly simple-minded is not entirely uniform across the literature. In the stable-category setting described above, it refers to orthogonal systems with the weak generating condition $\mathcal S$4 for every nonzero $\mathcal S$5. In another strand of the literature, the phrase sometimes appears near the theory of $\mathcal S$6-simple-minded systems, where the weakening concerns orthogonality across a bounded range of shifts rather than generation (Jorgensen, 2020).

A $\mathcal S$7-simple-minded system in a triangulated category is defined by $\mathcal S$8-orthogonality together with a bounded extension-generation condition. In one formulation,

$\mathcal S$9

and mutation theory is available under functorial finiteness and Hom-vanishing hypotheses (Broomhead et al., 2024). In negative Calabi–Yau settings, $A$0-simple-minded systems admit reduction procedures paralleling Iyama–Yoshino reduction, with a bijection between $A$1-simple-minded systems in the ambient category containing a chosen $A$2-orthogonal collection and those in the reduced category (Simoes et al., 2018).

The higher theory also has abelian and combinatorial aspects. For $A$3-simple-minded systems, the extension closure $A$4 can be abelian even when it is not the heart of a $A$5-structure, and this is presented as a negative counterpart to higher cluster tilting theory (Jorgensen, 2020). In negative cluster categories $A$6, $A$7-simple-minded systems correspond both to simple-minded collections in a fundamental domain of $A$8 and to positive $A$9-noncrossing partitions of the Weyl group $A\text{-}\underline{\mathrm{mod}}$0 (Simoes et al., 2020).

These developments do not identify the higher $A\text{-}\underline{\mathrm{mod}}$1-theory with the stable-category notion of a weakly simple-minded system. Instead, they show that the literature contains two nearby weakening procedures: one weakens generation, the other weakens orthogonality across shifts.

6. Conceptual role and unresolved issues

The modern theory places weakly simple-minded systems at the intersection of stable representation theory, AR-geometry, mutation theory, and reconstruction problems. In stable categories, they measure how far an orthogonal system of stable bricks is from being extension-generating. In domestic Brauer graph algebras, that gap is controlled strongly enough that finite weakly simple-minded systems become genuine simple-minded systems (Zhang, 15 Jun 2026).

At the same time, the general converse remains delicate. The earlier question of whether every maximal system of orthogonal bricks is a simple-minded system was explicitly left open in general triangulated settings (Dugas, 2012). Subsequent results supply positive answers only under additional hypotheses such as representation-finiteness, domesticity, finiteness of the system, syzygy-closure conditions, or explicit control of Euclidean components (Zhang, 20 Jun 2026).

In derived and dg contexts, stronger realization properties may require more than weak simple-mindedness. The study of complicial simple-minded collections shows that only collections satisfying $A\text{-}\underline{\mathrm{mod}}$2-compliciality correspond to the derived endomorphism algebras arising in the relevant Koszul-duality framework, and the paper explicitly states that $A\text{-}\underline{\mathrm{mod}}$3-compliciality provides the fine distinction between merely “weakly” simple-minded collections and those realizing the intended correspondences (Plogmann, 3 Mar 2026). This suggests that weak simple-mindedness is often a boundary notion: it records a minimal simple-like visibility condition, but further homological finiteness or generation properties are needed for classification, mutation, or reconstruction theorems.

Within current research, the concept therefore serves two roles. It is a genuine invariant in stable categories, where its comparison with simple-minded systems is subtle and representation-theoretically informative. It is also a reference point for broader simple-minded theories, where the central question is which extra conditions convert weak simple-likeness into a fully generative or reconstructive structure.