Silting-discrete graded path algebras
Pith reviewed 2026-05-25 02:33 UTC · model grok-4.3
The pith
Graded path algebras kQ are silting-discrete if and only if their underlying graphs are ADE or à with unequal degree sums.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For a connected finite acyclic graded quiver Q, the graded path algebra kQ is silting-discrete if and only if it is derived-discrete, and both conditions are equivalent to the underlying graph being of type ADE or of type à with unequal clockwise and counter-clockwise total degrees. The key step is an explicit construction of an infinite pre-simple-minded collection in pvd kQ that rules out discreteness in all other cases.
What carries the argument
The explicit construction of an infinite pre-simple-minded collection in pvd kQ, which demonstrates non-discreteness precisely when the degree condition on à fails.
If this is right
- Silting-discreteness and derived-discreteness coincide for these graded path algebras.
- The discreteness property reduces entirely to a graph-theoretic condition on the underlying quiver.
- Infinite pre-simple-minded collections exist in pvd kQ exactly when the degree sums are equal in the à case.
- The classification covers all connected finite acyclic graded quivers.
Where Pith is reading between the lines
- Discreteness properties in derived categories of dg algebras may be detectable from combinatorial data on the quiver alone.
- Analogous classifications could be attempted for non-acyclic quivers or for other classes of dg algebras with similar finiteness conditions.
- The result may connect to questions about the number of silting objects or the structure of the silting quiver in these categories.
Load-bearing premise
The explicit construction of the infinite pre-simple-minded collection succeeds exactly when the clockwise and counter-clockwise total degrees are equal on à graphs, and this construction is enough to show non-silting-discreteness in every remaining case.
What would settle it
An explicit finite pre-simple-minded collection in pvd kQ for some à quiver with equal clockwise and counter-clockwise degrees, or the failure of the infinite collection construction for an unequal-degree à quiver, would falsify the claimed classification.
read the original abstract
We classify connected finite acyclic graded quivers $Q$ for which the graded path algebra $kQ$, regarded as a formal dg algebra, is silting-discrete. We prove that $kQ$ is silting-discrete if and only if it is derived-discrete, and that both conditions are equivalent to the underlying graph of $Q$ being of type ADE, or of type $\widetilde{A}$ with unequal clockwise and counter-clockwise total degrees. The key ingredient is an explicit construction of an infinite pre-simple-minded collection in $\\text{pvd } kQ$ in the non-discrete case.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript classifies connected finite acyclic graded quivers Q such that the graded path algebra kQ, viewed as a formal dg algebra, is silting-discrete. It proves that kQ is silting-discrete if and only if it is derived-discrete, with both properties equivalent to the underlying graph of Q being of ADE type or of type à with unequal clockwise and counter-clockwise total degrees. The non-discrete direction is established via an explicit construction of an infinite pre-simple-minded collection in pvd kQ.
Significance. If the classification and the supporting construction hold, the result supplies a precise graph-theoretic criterion for silting-discreteness in this class of dg algebras and directly links it to derived-discreteness. The explicit, uniform construction of the infinite pre-simple-minded collection is a concrete strength that could be reusable in related settings in silting theory and graded representation theory.
major comments (1)
- [the construction in the proof of the non-discrete case] The non-discrete direction of the main classification rests on the explicit construction of an infinite pre-simple-minded collection in pvd kQ. It must be verified that this construction applies uniformly to every graded quiver whose underlying graph is not ADE or à with unequal total degrees (including all possible gradings on à that violate the degree condition), without hidden restrictions on the base field or the grading.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript and for the positive evaluation of its significance. We address the single major comment below.
read point-by-point responses
-
Referee: [the construction in the proof of the non-discrete case] The non-discrete direction of the main classification rests on the explicit construction of an infinite pre-simple-minded collection in pvd kQ. It must be verified that this construction applies uniformly to every graded quiver whose underlying graph is not ADE or à with unequal total degrees (including all possible gradings on à that violate the degree condition), without hidden restrictions on the base field or the grading.
Authors: The explicit construction of the infinite pre-simple-minded collection is given in Section 4 and is stated for an arbitrary field k and for any grading on a connected finite acyclic quiver whose underlying graph fails to be of ADE type or of type à with unequal total degrees. The argument proceeds by cases on the underlying graph (non-ADE or à with equal total degrees) and uses only the existence of a cycle whose total degree is zero or the presence of a non-ADE configuration; no further restrictions on the grading or on k appear in the proof. The same construction therefore covers every grading on à that violates the unequal-degree condition. To make this uniformity fully explicit we will insert a short clarifying paragraph at the beginning of Section 4. revision: partial
Circularity Check
No circularity: classification via explicit construction and equivalences is self-contained
full rationale
The paper establishes an iff between silting-discreteness and derived-discreteness for graded path algebras kQ, with both equivalent to the underlying graph being ADE or à with unequal total degrees. The non-discrete direction rests on an explicit construction of an infinite pre-simple-minded collection in pvd kQ. No quoted step reduces a claimed prediction or uniqueness result to a fitted parameter, self-definition, or load-bearing self-citation chain; the derivation supplies independent constructions and equivalences rather than renaming or smuggling inputs. This is a standard mathematical classification with no reduction by construction visible in the provided abstract or description.
Axiom & Free-Parameter Ledger
Reference graph
Works this paper leans on
-
[1]
Journal of the London Mathematical Society , volume=
Silting mutation in triangulated categories , author=. Journal of the London Mathematical Society , volume=
-
[2]
Adachi, Takahide and Iyama, Osamu and Reiten, Idun , TITLE =. Compos. Math. , VOLUME =. 2014 , NUMBER =
work page 2014
-
[3]
When is the silting-discreteness inherited? , volume=
Aihara, Takuma and Honma, Takahiro , year=. When is the silting-discreteness inherited? , volume=. doi:10.1017/nmj.2024.8 , journal=
-
[4]
Algebra Number Theory , VOLUME =
Aihara, Takuma and Mizuno, Yuya , TITLE =. Algebra Number Theory , VOLUME =. 2017 , NUMBER =
work page 2017
-
[5]
Adachi, Takahide and Mizuno, Yuya and Yang, Dong , TITLE =. Proc. Lond. Math. Soc. (3) , VOLUME =. 2019 , NUMBER =
work page 2019
-
[6]
Hara, Wahei and Wemyss, Michael , TITLE =. J. Eur. Math. Soc. (JEMS) , VOLUME =. 2026 , NUMBER =
work page 2026
-
[7]
Keller, Bernhard , TITLE =. Ann. Sci. \'Ecole Norm. Sup. (4) , VOLUME =. 1994 , NUMBER =
work page 1994
-
[8]
Aisles in derived categories , author=. Bull. Soc. Math. Belg. S
-
[9]
Koenig, Steffen and Yang, Dong , TITLE =. Doc. Math. , VOLUME =. 2014 , PAGES =
work page 2014
-
[10]
Kalck, Martin and Yang, Dong , TITLE =. J. Pure Appl. Algebra , VOLUME =. 2018 , NUMBER =
work page 2018
-
[11]
Vossieck, Dieter , TITLE =. J. Algebra , VOLUME =. 2001 , NUMBER =
work page 2001
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.