REVIEW 5 minor 1 cited by
Matrix generators for the unit groups of $L_K(1,d)$
T0 review · 0 major / 5 minor · reviewed 2026-07-14 · grok-4.5
Pith's one-line read Leaf-set matrix units generate the full unit group of every Leavitt algebra L_K(1,d).
desk verdict Clean answer to Freeland’s generator question for Leavitt unit groups, with a usable finite-generation criterion and a clean reduction of presentability to unstable K2. 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 leaf-matrix units u(A,M,B) associated with ordered leaf sets of the rooted d-ary tree, together with the isomorphisms Θ_C that turn them into elementary matrices inside L_d; these units generate the elementary group E_n(L_d) and, via the GE-property and the computation of K_1(L_d), the whole unit group.
What would settle it
Exhibit a concrete field K and integer d≥2 for which some unit of L_d cannot be written as a product of leaf-matrix units u(A,M,B), or for which K_1(L_d) is larger than K^ imes/(K^ imes)^{d-1}.
Extended reading notes
Core claim
For every field K and every d≥2 the subgroup LGL_d(K) generated by the leaf-matrix elements u(A,M,B) equals the full unit group L_d^ imes. In the binary case this specialises to the explicit generation L_2^ imes=⟨1+e a f*,1+f b e*:a,b∈L_2⟩. The same leaf-set technology characterises finite generation, identifies the monomial-matrix subgroup, embeds GL_∞(K) into L_2^ imes, and equates finite presentability over a finite field with finite generation of the unstable groups K_2(n,L_d).
Load-bearing premise
The argument needs L_d to be a GE-ring whose abelianised unit group is exactly the image of the scalars K^ imes; if either the GE property or that K_1 calculation fails, the reduction of the full general linear group to elementary-plus-diagonal matrices collapses.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies the unit groups of the Leavitt path algebras L_d = L_K(R_d) ≅ L_K(1,d) for a field K and d ≥ 2. Ordered leaf sets of the rooted d-ary tree determine matrix units and hence copies of GL_n(K) inside L_d^ imes; the subgroup LGL_d(K) they generate is shown to equal the full unit group (Theorem 7.2). In the binary case this yields the explicit generation L_2^ imes = ⟨1 + e a f^*, 1 + f b e^* : a,b ∈ L_2⟩. Finite generation of L_d^ imes is characterized as equivalent to finiteness of K; the monomial-matrix subgroup is identified with a semidirect product C_lc({e,f}^N, K^ imes) times V; and GL_∞(K) is embedded into L_2^ imes. Over a finite field, finite presentability of L_d^ imes is shown equivalent to finite generation of the unstable groups K_2(n, L_d) for all n = 1 + r(d-1) ≥ 5, and the stable group K_2(L_d) is computed as the (d-1)-torsion in K^ imes.
Significance. The main generation theorem answers Freeland’s question for the binary Leavitt algebra and extends it to all d ≥ 2, giving a concrete matrix-unit description of L_d^ imes. The finite-generation criterion, the monomial-subgroup structure, and the embedding of GL_∞(K) are clean and useful. The reduction of finite presentability to finite generation of unstable K_2(n, L_d) is a natural and correctly executed application of the Steinberg universal central extension; the explicit computation of the stable K_2(L_d) is a welcome byproduct. The arguments rely on standard external results (purely infinite simple rings are GE-rings, graph K-theory exact sequences) that are applied correctly to the rose graphs, so the paper’s own contributions—leaf-set matrix units, elementary-transvection generation, and the reduction GL_n = E_n D_n(K)—are self-contained and free of hidden circularity.
minor comments (5)
- In the abstract and Introduction the isomorphism L_d ≅ L_K(1,d) is stated without a reference; a pointer to the standard identification of the rose algebra with the free Leavitt algebra would help non-specialists.
- Section 2, after Lemma 2.1: the three equivalent characterizations of leaf sets are clear, but a short remark that the same statements hold verbatim for d-ary trees (used later in §7) would avoid a minor jump.
- Proposition 3.7: the explicit counter-example x = 1 + (e + e^{2})f^* is useful; a one-line remark that the same phenomenon occurs for any d would make the non-closure of LM_d(K) uniform.
- Section 8, after Proposition 8.3: the observation that the usual Bass stable-rank stability theorem is unavailable (sr(L_d) = ∞) is important; it could be flagged already in the Introduction so that the reader anticipates the reduction to unstable K_2.
- Typographical: in the abstract “L_K(1,d)” appears both with and without a space after the comma; standardize throughout.
Circularity Check
No circularity: LGL_d(K)=L_d^ imes is proved by leaf-set embeddings of elementary matrices plus independent GE/K_1 results from the literature, not by definition or self-citation.
full rationale
This is a pure algebraic generation paper. LGL_d(K) is defined as the subgroup generated by leaf-matrix units u(A,M,B); the claim that it equals L_d^ imes is established by (i) proving 1+ ho a ho* lies in LGL for prefix-incomparable paths (Thm 3.6 / Prop 7.1), hence heta_C(E_n(L_d)) o LGL, and (ii) invoking that purely infinite simple rings are GE-rings with (R^ imes)_ab ≅ K_1(R) (Ara–Goodearl–Pardo) together with the graph K-theory sequence giving K_1(L_d)≅ K^ imes/(K^ imes)^{d-1} (Ara–Brustenga–Cortiñas), so the scalar map is surjective and GL_n=E_n D_n(K) with diagonals already in LM_d. Neither step is self-definitional: the elementary-transvection membership is proved from antichain extensions and nilpotence, and the K_1/GE facts are external theorems applied to rose graphs that satisfy their hypotheses. Authors Khanh–Thanh do not appear in the reference list; there are no self-citations, no fitted parameters, no uniqueness theorems imported from prior work by the same authors, and no renaming of known empirical patterns. Finite-generation, monomial-subgroup, GL_∞ embedding, and unstable-K_2 presentability arguments likewise reduce to standard ring/group-theoretic constructions (Zariski’s lemma, Steinberg presentations, universal central extensions) rather than to inputs that already encode the conclusions. Score 0 is therefore the correct honest finding.
Assumptions & free parameters
assumptions (4)
- domain assumption Every unital purely infinite simple ring is a GE-ring and R^ imes_ab ≅ K_1(R) (Ara–Goodearl–Pardo).
- domain assumption The graph K-theory exact sequence of Ara–Brustenga–Cortiñas applies to L_d and yields K_1(L_d)≅K^ imes/(K^ imes)^{d-1} and the stated K_2.
- standard math For n≥5 the Steinberg extension is the universal central extension of E_n(R).
- standard math Standard Cuntz–Krieger and matrix-unit relations in Leavitt path algebras.
Cite this review
Pith. "Pith review of Matrix generators for the unit groups of $L_K(1,d)$." pith.science (2026). https://pith.science/paper/YO73UQDW
@misc{pith2026260710351,
author = {Pith},
title = {Pith review of: Matrix generators for the unit groups of $L_K(1,d)$},
year = {2026},
howpublished = {\url{https://pith.science/paper/YO73UQDW}},
note = {Machine review of arXiv:2607.10351}
}
abstract
Let $K$ be a field and put $L_d=L_K(R_d)\cong L_K(1,d)$. Ordered leaf sets in the rooted $d$-ary tree determine copies of general linear groups over $K$ inside $L_d^\times$. We prove that these copies generate $L_d^\times$ for every $d\geq2$. In the binary case, $L_2^\times=\langle 1+eaf^*,1+fbe^*:a,b\in L_2\rangle$. We characterize finite generation of $L_d^\times$, determine the subgroup represented by monomial matrices, and embed $\GL_\infty(K)$ in $L_2^\times$. Over a finite field, finite presentability of $L_d^\times$ is equivalent to finite generation of the unstable $K_2$-group $K_2(n,L_d)$ for every $n=1+r(d-1)\geq5$, where $r\geq0$; we also compute $K_2(L_d)$.
Forward citations
Cited by 1 Pith paper
-
A torsion-free non-sofic group
Assuming OpenAI's soficity criterion, this paper constructs a finitely presented torsion-free non-sofic group.
Reference graph
Works this paper leans on
-
[1]
Abrams, P
G. Abrams, P. N. ´Anh, and E. Pardo, Isomorphisms between Leavitt algebras and their matrix rings,J. Reine Angew. Math.624(2008), 103–132
2008
-
[2]
Abrams and G
G. Abrams and G. Aranda Pino, Purely infinite simple Leavitt path algebras,J. Pure Appl. Algebra207(2006), 553–563
2006
-
[3]
Ara and E
P. Ara and E. Pardo, Stable rank of Leavitt path algebras,Proc. Amer. Math. Soc.136(2008), 2375–2386
2008
-
[4]
P. Ara, M. Brustenga, and G. Corti˜ nas,K-theory of Leavitt path algebras,M¨ unster J. Math. 2(2009), 5–34
2009
-
[5]
P. Ara, K. R. Goodearl, and E. Pardo,K 0 of purely infinite simple regular rings,K-Theory 26(2002), 69–100
2002
-
[6]
Brownlowe and A
N. Brownlowe and A. P. W. Sørensen, LeavittR-algebras over countable graphs embed into L2,R,J. Algebra454(2016), 334–356
2016
-
[7]
R. L. Freeland,Relating Thompson’s groupVto graphs of groups and Hecke algebras, Ph.D. thesis, University of Cambridge, 2019, doi:10.17863/CAM.52134
-
[8]
Krsti´ c and J
S. Krsti´ c and J. McCool, Presenting GLn(k⟨T⟩),J. Pure Appl. Algebra141(1999), 175–183
1999
Show all 11 references
-
[9]
Lopatkin and T
V. Lopatkin and T. G. Nam, On the homological dimensions of Leavitt path algebras with coefficients in commutative rings,J. Algebra481(2017), 273–292
2017
-
[10]
Pardo, The isomorphism problem for Higman–Thompson groups,J
E. Pardo, The isomorphism problem for Higman–Thompson groups,J. Algebra344(2011), 172–183
2011
-
[11]
C. A. Weibel,TheK-book: An introduction to algebraicK-theory, Graduate Studies in Math- ematics, vol. 145, American Mathematical Society, Providence, RI, 2013. 17
2013
Reviewed July 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.