REVIEW 3 major objections 4 minor 10 references
Global dimension of a string algebra
T0 review · 3 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash
Pith's one-line read The global dimension of a string algebra is the longest minimal relation chain starting at an arrow.
desk verdict Right result, missing proof for the key kernel calculation, and too quick to claim novelty over the monomial resolution literature. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the minimal relation chain, defined as a sequence w1·w2·...·wn of non-zero paths where each wi+1 is a shortest path killed by wi (its product with wi is zero in A). Its engine is a two-generator kernel structure: for any non-zero path w, the kernel of the multiplication map p(w) is generated by at most two paths — the 'short kernel' (an arrow) and the 'long kernel' (a longer path) — so each chain step branches into at most two continuations. The resolution (⋇) is assembled so that chains of length i index the i-th projective term; the kernel lemma is what makes the kernels of the block differentials equal the next layer of chains, giving the exact minimal resolution.
What would settle it
Find a string algebra and a non-zero path w for which ker p(w) is strictly larger than aA ⊕ b*A with a, b paths — for instance because aA ∩ b*A ≠ 0 — and compute the resolution (⋇) for the simple module at s(w); if any differential fails to be a projective cover, the equality gl.dim A = max l(W) is false. A second test: exhibit a string algebra whose minimal-chain tree has arbitrarily long finite chains but no infinite chain; the finitely-branching tree lemma says this cannot happen, so such an example would expose a gap in Proposition 2.7.
Extended reading notes
Core claim
The paper proves Theorem 2.6: for a string algebra A = kQ/I, gl.dim A = max_{α ∈ Q1, W ∈ Rel(α)} l(W), where Rel(α) is the set of minimal relation chains beginning with the arrow α. It also proves Proposition 2.7: gl.dim A = ∞ if and only if some chain in Rel(α) has infinite length. The proof constructs an explicit minimal projective resolution of each simple module S(v): the i-th projective term is a direct sum of projectives indexed by chains of length i starting from arrows out of v, and the differentials are block maps given by multiplication by the last path of each chain. Exactness and minimality of the resolution are what link chain length to the projective dimension of S(v), and henc
Load-bearing premise
Everything rests on an imported kernel lemma — Lemma 1.3, quoted without proof — asserting that multiplication by any path has kernel generated by at most two paths, together with an unstated assumption in the proof of Lemma 2.4 that the right multiples of those two generators never overlap (the assertion that 'u1m1 and u2m2 are linearly independent'); if either fails for some string algebra, the displayed resolution is not minimal and the chain-length formula does not follow
Editorial extensions
If this is right
- Computing the global dimension of a string algebra reduces to enumerating minimal relation chains: for each arrow, repeatedly append a shortest path that the current path kills; the longest such chain is the global dimension.
- A string algebra has infinite global dimension exactly when this chain-building process never terminates along some branch; if every branch terminates, the maximum chain length is finite and is attained.
- The projective dimension of the simple module at a vertex v equals the maximum chain length among arrows starting at v, so the global dimension is the largest of these vertex-level maxima.
- Each chain step has at most two continuations, so the i-th term of the minimal projective resolution of a simple module has at most 2^i summands (some possibly zero), which bounds the size of the resolution in terms of the quiver.
Reading between the lines
- The paper leaves implicit that its criterion makes infinite/global dimension decidable: the chain tree is finitely branching, and the standard tree lemma for such trees says it is infinite exactly when it has an infinite branch; a finite tree can be explored exhaustively, so gl.dim is computable by a terminating search.
- The same chain view suggests a direct algorithm for any monomial algebra satisfying the two-generator kernel property: build the directed graph whose nodes are non-zero paths and whose edges go from w to each minimal annihilator of w; the height of the components rooted at arrows is the global dimension.
- For gentle algebras, whose relations all have length two, the chains collapse to short local moves, so the formula should reproduce known geometric characterizations of global dimension for that class.
- If the two-generator kernel lemma fails outside the string-algebra setting, the construction pinpoints where to look for counterexamples: an algebra with a path whose multiplication kernel needs three or more generators, or where two kernel generators have overlapping right multiples.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes a combinatorial formula for the global dimension of a string algebra A = kQ/I: it claims that gl.dim A equals the maximum length of a minimal relation chain whose initial term is an arrow (Theorem 2.6), and that gl.dim A is infinite if and only if some such chain has infinite length (Proposition 2.7). The proof is based on an explicit projective resolution (⋇) of each simple module S(v), whose terms are direct sums of indecomposable projectives indexed by chains in Rel(α), and whose differentials are built from the short and long kernel paths of the morphisms p(w). The key technical step is Lemma 2.4, which asserts that this complex is a minimal projective resolution. The paper includes a worked example (Example 3.1) illustrating the computation.
Significance. If the main theorem is correct, it gives the first systematic combinatorial characterization of global dimension for arbitrary finite-dimensional string algebras, extending known results for gentle and almost gentle algebras. The proposed criterion is concrete and, because the branching in Rel is at most two at each step, it yields a finite decision procedure for finiteness of global dimension. The paper also ships a detailed example against which the formula can be checked. The main strengths are the explicit nature of the resolution and the absence of fitted parameters. The central gap, however, is that the proof of exactness of (⋇) relies on an unproved linear-independence assertion, and the passage from unbounded finite chains to an infinite chain in Proposition 2.7 uses an unstated König's-lemma argument. These are fixable but load-bearing.
major comments (3)
- [Lemma 2.4, proof of ker(∂^{-i})] The proof asserts 'Since u_1 m_1 and u_2 m_2 are linearly independent, we know u_1 m_1 = 0 and u_2 m_2 = 0.' This is exactly the claim that the right ideals u_1 A and u_2 A intersect trivially for the short and long kernels u_1, u_2 of p(L(W)). This is not proved. Without it, ker(∂^{-i}) need not equal ⊕ ker p(L(W)), and exactness of (⋇) collapses. In a monomial string algebra the claim is true because u_1 and u_2 begin with distinct arrows, so their images have disjoint path-basis supports; this argument should be supplied explicitly.
- [Proposition 2.7 / Theorem 2.6] The proof moves from max_{W∈Rel(α)} l(W) = ∞ to the existence of a single W with l(W) = ∞. Since Definition 2.1 defines W as a finite sequence w_1...w_n, the maximum in Theorem 2.6 is formally a supremum. The implication 'unbounded finite chain lengths ⇒ infinite chain' requires König's lemma on the finitely branching tree of minimal relation chains. This premise is not stated. Please either formulate the result with suprema or add the König's-lemma argument, which is essential for the 'if and only if' in Proposition 2.7.
- [Definition 2.2 and the differential ∂^{-i}] The displayed definition of ∂^{-i} is not well-formed as printed: the cases include the quantifiers 'α∈s^{-1}(v), W∈Rel(α)_i' inside the matrix entries, and the correspondence between the 2^{i-1} rows / 2^i columns and the chains W is left implicit. Since Lemma 2.4 and Theorem 2.6 depend on the exact indexing of the resolution, this needs to be rewritten with an explicit bijection between the summands of P^{-i} and P^{-i+1}, or a recursive definition of the differential.
minor comments (4)
- [Remark 2.3] 'contains 2k direct summands' should presumably read '2^i direct summands' (or 'at most 2^i'), since |Rel(α)_i| ≤ 2^i.
- [Acknowledgments] Typo: 'the refere' should be 'the referee'.
- [Notation in §§2.1–2.2] The notation Rel^α∈s^{-1}(v)(α) is confusing; write Rel(α) with α∈s^{-1}(v) or introduce a shorthand. Also clarify whether W ranges over finite chains only in Definition 2.1, and how the formula behaves when the supremum is ∞.
- [Example 3.1] The displayed quiver and the lists Rel(α) are consistent with the formula, and the computed global dimension 4 agrees with the theorem. However, the resolution for S(4) is hard to follow because zero summands are written as '0' but counted in the matrix dimensions; a cleaner table of nonzero summands would help.
Circularity Check
No significant circularity: the chain-length formula is derived, not assumed.
full rationale
Theorem 2.6 is not equivalent to its inputs. Definition 2.1 independently defines minimal relation chains via "minimal for the path w" (Definition 1.5), and Lemma 2.4 proves that the complex (⋇) built from those chains is a minimal projective resolution: it identifies ker(∂^{-i}) with ⊕_{W∈Rel_i} ker p(L(W)) = ⊕_{W∈Rel_{i+1}} L(W)A and then with Im(∂^{-(i+1)}). This identification is the content of Lemma 2.4, not a restatement of Definition 2.1. The kernel structure used in that proof is imported from [FGR21, Lemma 6] (Lemma 1.3), a published external result by different authors; it is parameter-free, has stated string-algebra hypotheses, and does not assume the global-dimension formula, so it is independent support and does not raise the circularity score. There are no fitted parameters, no data subsets, and no author-imposed uniqueness theorem. The proof does contain an unproved linear-independence assertion in Lemma 2.4 ("Since u_1m_1 and u_2m_2 are linearly independent") and Proposition 2.7 uses an unstated König's-lemma step, but those are proof gaps, not circular reductions: they do not make the conclusion an input of the derivation. The only author-adjacent citation, [C26], is contextual in the introduction and not load-bearing. The worked Example 3.1 also checks the formula on a concrete algebra.
Assumptions & free parameters
assumptions (5)
- standard math Lemma 1.7 (Weibel): gl.dim A = sup_v proj.dim S(v) for finite-dimensional algebras.
- domain assumption Lemma 1.3 (FGR21, Lemma 6): for every non-zero path w in a string algebra, ker p(w) = aA ⊕ b*A, generated by a short kernel (arrow) and a long kernel (path).
- domain assumption For the two kernel generators of p(w), the right ideals aA and b*A intersect trivially; equivalently, 'u_1 m_1 and u_2 m_2 are linearly independent' as asserted in the proof of Lemma 2.4.
- domain assumption König's lemma: in the finitely branching tree of minimal relation chains, unbounded finite lengths imply the existence of an infinite chain.
- domain assumption Lemma 1.2 (FGR21, Lemma 5): the right completion of an arrow is unique.
Cite this review
Pith. "Pith review of Global dimension of a string algebra." pith.science (2026). https://pith.science/paper/QVKRLGK5
@misc{pith2026260711552,
author = {Pith},
title = {Pith review of: Global dimension of a string algebra},
year = {2026},
howpublished = {\url{https://pith.science/paper/QVKRLGK5}},
note = {Machine review of arXiv:2607.11552}
}
read the original abstract
In this paper, we characterize the global dimension of a string algebra by using combinatorial methods. Moreover, we establish a necessary and sufficient condition for when the global dimension of a string algebra is infinite.
Reference graph
Works this paper leans on
-
[1]
Assem and A
I. Assem and A. Skowro\' n ski, Iterated tilted algebras of type affine A_n . Math. Z. 195 (1987), no. 2, 269-290
1987
-
[2]
M. C. R. Butler and C. M. Ringel, Auslander-Reiten sequences with few middle terms and applications to string algebras. Comm. Algebra 15 (1987), no. 1-2, 145-179
1987
-
[3]
Chang, Geometric models for the algebraic hearts in the derived category of a gentle algebra
W. Chang, Geometric models for the algebraic hearts in the derived category of a gentle algebra. Isr. J. Math. (2025). https://doi.org/10.1007/s11856-025-2801-7
-
[4]
(2024) Preprint https://arxiv.org/abs/2409.08333 arXiv:2409.08333
S.Ford, A.Oswald, and J.J.Zhang, Homological conditions on locally gentle algebras. (2024) Preprint https://arxiv.org/abs/2409.08333 arXiv:2409.08333
arXiv 2024
-
[5]
São Paulo J
A.Franco, H.Giraldo and P.Rizzo , Periodic string complexes over string algebras. São Paulo J. Math. Sci. 15 (2021), no. 2, 695-719
2021
-
[6]
A.Franco, H.Giraldo and P.Rizzo , String and band complexes over string almost gentle algebras. Appl. Categ. Struct. 30 (2022), no. 3, 417-452
2022
-
[7]
R.Hou, On global dimensions of tree type finite dimensional algebras. Canad. Math. Bull. 57 (2014), no. 4, 814-820
2014
-
[8]
Y.Liu, H.Gao and Z.Huang, Homological dimensions of gentle algebras via geometric models. Sci. China, Math. 67 (2024), no. 4, 733-766
2024
Show all 10 references
-
[9]
Cambridge University Press
C.A.Weibel, An introduction to homological algebra. Cambridge University Press. (2004)
2004
-
[10]
(2025) Preprint https://arxiv.org/abs/2503.04445 arXiv:2503.04445
D.Wang, Z.Huang and Y.Liu, Homological conditions over almost gentle algebras. (2025) Preprint https://arxiv.org/abs/2503.04445 arXiv:2503.04445
2025 arXiv
Reviewed August 2, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.