REVIEW 3 major objections 4 minor 12 references
Quasi-Isometric Bounded Generation by ${\mathbb Q}$-Rank-One Subgroups
T0 review · 3 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Every arithmetic lattice is a bounded product of rank-1 subgroups.
desk verdict The theorem is likely true and the ordering idea is genuine, but the key computation in Lemma 4.1 is algebraically invalid, so the proof as written does not go through. 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 load-bearing mechanism is the ordered annihilation of root components inside the big cell of the algebraic group. With $\operatorname{rank}_{\mathbb{Q}} G \ge 2$, the paper fixes a maximal $\mathbb{Q}$-split torus $T$ and a generic $\mathbb{R}$-linear map $\eta$ from the character space to $\mathbb{C}$ that sends no root to a real number; the images of the positive roots under $\eta$ are then placed in clockwise order. Each equivalence class $\Phi_i$ of positive roots (scalar multiples) defines a standard $\mathbb{Q}$-rank-1 subgroup $G_i$, and the central lemma (Lemma 4.1) shows that multiplying by an element of $G_i$ of controlled norm moves the $\Phi_i$-component of the current element into a prescribed finite set without disturbing already cleaned components. Finite correction sets come from the reduction-theory decomposition $G_i(\mathbb{Q}) = \Gamma_i F_0 P_i^-(\mathbb{Q})$, and norm control comes from regular functions $\omega_\alpha$ on $G$ whose integer values on the arithmetic group control the size of the parabolic part. A separate induction step (Lemma 3.7) decomposes the Levi factor of a minimal parabolic into lower-$\mathbb{Q}$-rank pieces, and it is here that the isotropy assumption is used.
What would settle it
Find a sequence $\gamma_n$ in an arithmetic subgroup (for instance, in $\mathrm{SL}(3,\mathbb{Z})$ with its natural $\mathrm{SL}(2,\mathbb{Z})$ subgroups) whose minimal number of standard rank-1 factors, or the minimal constant $C$ in the factor-size bound, grows with $n$; the theorem predicts a fixed maximum number of factors and a fixed exponent, so any unboundedness in either quantity would refute it.
Extended reading notes
Core claim
The paper proves Theorem 1.2: every arithmetic subgroup of an isotropic, almost-simple $\mathbb{Q}$-group is quasi-isometrically boundedly generated by standard $\mathbb{Q}$-rank-1 subgroups. A standard $\mathbb{Q}$-rank-1 subgroup is a connected, almost $\mathbb{Q}$-simple subgroup of $\mathbb{Q}$-rank 1 whose Lie algebra is generated by the root spaces belonging to a single root class (the roots $\pm\alpha$, $\pm 2\alpha$, $\pm \tfrac{1}{2}\alpha$). The quasi-isometric bound means the number of factors is bounded independently of the element, and the norm of each factor is bounded by a constant times the norm of the element raised to a fixed power; equivalently, after passing to a finite-index subgroup, the word length of each factor is bounded by a constant times the word length of the whole element. The proof follows the strategy of an earlier argument for arithmetic lattices, but with a new ordering of the positive roots that ensures each root is annihilated only once, so the number of correction steps is bounded rather than growing with the element. The same argument gives an $S$-arithmetic generalization over number fields and implies the statement for noncocompact irreducible lattices in semisimple Lie groups.
Load-bearing premise
The proof assumes that in each rank-1 rational building block, the rational points can be covered by finitely many double cosets of an arithmetic subgroup and a parabolic subgroup; if this finiteness failed, cleaning each root component would require an unbounded number of correction factors.
Editorial extensions
If this is right
- Every noncocompact irreducible lattice in a connected semisimple Lie group with finite center is quasi-isometrically boundedly generated by $\mathbb{Q}$-rank-1 subgroups (Corollary 1.4).
- The $S$-arithmetic generalization holds: any $S$-arithmetic subgroup of an isotropic almost-simple group over $\mathbb{Q}$, or over a number field when $S$ contains all archimedean places, is quasi-isometrically boundedly generated by standard $\mathbb{Q}$- or $K$-rank-1 subgroups (Propositions 5.1 and 5.2).
- Lattices in semisimple Lie groups with no compact factors, possibly with infinite center, also have the property (Corollary 6.2).
- In the $\mathbb{R}$-rank at least 2 case, the word length of an element is comparable to $\log\|\gamma\|$, so the sum of the word lengths of the factors is bounded by a constant times the word length of the whole element, making the statement genuinely quasi-isometric (Remark 1.3.2).
Reading between the lines
- The one-pass root annihilation suggests a general recipe: any group with a big-cell decomposition and a finite height function may admit analogous bounded generation by rank-1 subgroups; a natural test is positive-characteristic function fields, which the paper explicitly leaves open.
- The finite-correction arguments produce non-explicit constants; extracting effective bounds for groups beyond $\mathrm{SL}(n,\mathbb{Z})$ (where the factor count is $n^2-n$) would be a natural computational extension.
- The ordering of roots by a generic linear functional resembles choosing a generic direction in the spherical building, hinting at a geometric interpretation of the factorization as a walk around an apartment; this connection is not explored in the paper.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a notion of quasi-isometric bounded generation by standard Q-rank-1 subgroups and states Theorem 1.2: every arithmetic subgroup of an isotropic, almost-simple Q-group is quasi-isometrically boundedly generated by standard Q-rank-1 subgroups. The proof follows the strategy of Lubotzky–Mozes–Raghunathan, with the claimed new idea that a suitable ordering of positive roots lets each root be annihilated exactly once. The paper also states S-arithmetic generalizations (Propositions 5.1, 5.2) and applies the main theorem to lattices in semisimple Lie groups with infinite center (Section 6).
Significance. If the main theorem were established, it would be a substantial extension of the 1993 LMR result on SL(n,Z) and would provide a conceptually cleaner proof by avoiding repeated annihilation of roots. The paper is clearly written, and the standard algebraic-group reductions (Borel density, reduction theory, Bruhat decomposition) are handled carefully. However, the central lemma of the proof, Lemma 4.1, contains an algebraic error that invalidates the proof as written; the existence of the finite sets that drive the induction is not established by the argument given.
major comments (3)
- [Section 4, Lemma 4.1] The displayed computation in the proof of Lemma 4.1 is algebraically invalid. After writing u = ←u · û · →u and û = x f q, the paper claims the chain ←u x^{-1} u = ←u x^{-1} ←u û →u = ←u x^{-1}(x f q) →u = ←u f q →u q. The middle equality silently deletes the second ←u: substituting û = x f q into the left-hand side of that equality gives ←u x^{-1} ←u (x f q) →u, not ←u x^{-1}(x f q) →u. There is no justification that x^{-1} commutes with ←u, and commuting them introduces a non-trivial conjugation factor x^{-1} ←u x, which is generally not in ←U_i^+. This step is load-bearing because it is used to conclude that the left component of x_i γ is ←u f, which lies in the finite set F_i F_0. Without this equality, the induction in Theorem 1.2 has no control over components that have already been annihilated.
- [Section 4, Lemma 4.1 (also §2 and Theorem 1.2)] A concrete computation in SL(3,Z) shows that the specific construction in the proof of Lemma 4.1 cannot achieve the stated finiteness. Take Φ_i^+ = {E_{23}}, ←u = E_{13}(1), and for each q ≥ 2 let γ_q = E_{13}(1) E_{23}(1/q) p, where p ∈ P^-. In the decomposition û = E_{23}(1/q) = x f q, taking f = e forces x to have the form [[a,1],[a q - 1,q]] in the (2,3) block for some integer a. For the proof's choice x_i = ←u x^{-1}, direct matrix multiplication shows that the U^+-component of x_i γ_q has E_{13}-coefficient q+1 (up to the right factor in P^-), which is unbounded as q varies. Hence no fixed finite set F_{i+1} can contain the left component claimed in the lemma. This is not a minor typo; it is a substantive gap in the annihilation argument.
- [Sections 4–5, Theorem 1.2 and Proposition 5.2] Because Theorem 1.2 is proved by repeated application of Lemma 4.1, the flaw in that lemma leaves the main theorem unproved. The same computation is also used in the sketched S-arithmetic generalization (Section 5, Proposition 5.2), so those advertised results are likewise unsupported without a corrected proof of the annihilation step. The author should either provide a valid proof of Lemma 4.1 or supply a different argument that does not rely on the erroneous commutation.
minor comments (4)
- [Remark 1.5(3)] The word "Dedinition" should be "Definition".
- [Lemma 3.7] The citation in the proof contains a placeholder: "[11, ???? 2.5.4, p. 41]". The missing reference should be completed.
- [Section 5] The paper's abstract and title advertise S-arithmetic and K-rank-1 generalizations, but Propositions 5.1 and 5.2 are only sketched. The sketch is short and relies on the same flawed Lemma 4.1; the reader cannot verify the generalization from the text as written.
- [Notation 2.1] The notation s ≺ t is introduced with the phrase "s is bounded by a polynomial function of t" but then written as s ≤ t^C + C, which is ambiguous for small t. The intended meaning is clear from the equivalent logarithmic form, but the display could be cleaned up.
Circularity Check
No significant circularity: the proof is self-contained, with all load-bearing inputs from external theorems.
full rationale
The paper's main theorem is proved by induction on Q-rank. The base case is immediate, and the inductive step uses Lemma 3.7, whose proof invokes standard structure theory of reductive groups (root subgroups, Tits indices) and reduces the Levi factor to proper Q-subgroups of smaller rank. Lemma 4.1, the engine of the induction, is an explicit constructive calculation: it factors û = x f q with x in Γ_i, f in a fixed finite set F0 supplied by Borel's reduction theory [1, Prop. 15.6], and q in P_i^-(Q), and then defines Fi+1 = Fi F0. None of these inputs is the bounded-generation conclusion; the finite double-coset decomposition is a standard arithmetic reduction fact that is structurally different from the theorem and is cited from Borel, not from the author's own work. The length and norm bounds are derived from estimates on the regular functions ω_α and from cocompactness of lattices, not from an assumed fit. The only self-reference is the use of the author's own book [7] as a citation for Margulis arithmeticity and Q-rank definitions in the corollary sections; Margulis arithmeticity is an external theorem, it is not loaded with the target result, and the proof of Theorem 1.2 itself does not depend on [7]. No equation in the paper is defined in terms of the quantity it claims to prove, and no fitted parameter is renamed as a prediction. Thus there is no circular step.
Assumptions & free parameters
assumptions (4)
- domain assumption G may be reduced to a simply connected, Q-isotropic, absolutely almost-simple group with Γ = G(Z).
- standard math Finite double-coset decomposition Gi(Q) = Γ_i F0 P_i^-(Q) for Q-rank-one Gi.
- standard math Standard structure theory of reductive groups: Bruhat decomposition, big cell U^+P^-, Borel density theorem, and the UFD property of Q[G] for simply connected semisimple G.
- standard math A generic R-linear map η exists yielding a positive root system with the left/right half-plane closure properties used in Lemma 4.1.
Cite this review
Pith. "Pith review of Quasi-Isometric Bounded Generation by ${\mathbb Q}$-Rank-One Subgroups." pith.science (2026). https://pith.science/paper/26CM4NRN
@misc{pith2026190802365,
author = {Pith},
title = {Pith review of: Quasi-Isometric Bounded Generation by $\mathbb Q$-Rank-One Subgroups},
year = {2026},
howpublished = {\url{https://pith.science/paper/26CM4NRN}},
note = {Machine review of arXiv:1908.02365}
}
abstract
We say that a subset $X$ quasi-isometrically boundedly generates a finitely generated group $\Gamma$ if each element $\gamma$ of a finite-index subgroup of $\Gamma$ can be written as a product $\gamma = x_1 x_2 \cdots x_r$ of a bounded number of elements of $X$, such that the word length of each $x_i$ is bounded by a constant times the word length of $\gamma$. A. Lubotzky, S. Mozes, and M.S. Raghunathan observed in 1993 that ${\rm SL}(n,{\mathbb Z})$ is quasi-isometrically boundedly generated by the elements of its natural ${\rm SL}(2,{\mathbb Z})$ subgroups. We generalize (a slightly weakened version of) this by showing that every $S$-arithmetic subgroup of an isotropic, almost-simple ${\mathbb Q}$-group is quasi-isometrically boundedly generated by standard ${\mathbb Q}$-rank-1 subgroups.
Reference graph
Works this paper leans on
-
[6]
Lubotzky A., Mozes S., Raghunathan M.S., The word and Riemannian metrics on lattices of semisimple groups, Inst. Hautes ´Etudes Sci. Publ. Math. 91 (2000), 5–53. Quasi-Isometric Bounded Generation by Q-Rank-One Subgroups 17
work page 2000
-
[1]
Borel A., Introduction to arithmetic groups, Amer. Math. Soc., Providence, RI, 2019
work page 2019
-
[2]
Borel A., Tits J., Groupes r´ eductifs, Inst. Hautes ´Etudes Sci. Publ. Math. 27 (1965), 55–150
work page 1965
-
[3]
80, Academic Press, Inc., New York – London, 1978
Helgason S., Differential geometry, Lie groups, and symmetric spaces, Pure and Applied Mathematics , Vol. 80, Academic Press, Inc., New York – London, 1978
work page 1978
-
[4]
140, Birkh¨ auser Boston, Inc., Boston, MA, 2002
Knapp A.W., Lie groups beyond an introduction, 2nd ed., Progress in Mathematics , Vol. 140, Birkh¨ auser Boston, Inc., Boston, MA, 2002
work page 2002
-
[5]
Lubotzky A., Mozes S., Raghunathan M.S., Cyclic subgroups of exponential growth and metrics on discrete groups, C. R. Acad. Sci. Paris S´ er. I Math. 317 (1993), 735–740
work page 1993
- [7]
-
[8]
139, Academic Press, Inc., Boston, MA, 1994
Platonov V., Rapinchuk A., Algebraic groups and number theory, Pure and Applied Mathematics , Vol. 139, Academic Press, Inc., Boston, MA, 1994
work page 1994
Show all 12 references
-
[9]
USSR Izv
Popov V.L., Picard groups of homogeneous spaces of linear algebraic groups and one-dimensional homoge- neous vector fiberings, Math. USSR Izv. 8 (1974), 301–327
1974
-
[10]
Rosengarten Z., Picard groups of linear algebraic groups, arXiv:1806.10292
-
[11]
Tits J., Classification of algebraic semisimple groups, in Algebraic Groups and Discontinuous Subgroups (Proc. Sympos. Pure Math., Boulder, Colo., 1965), Amer. Math. Soc., Providence, R.I., 1966, 33–62
1965
-
[12]
Reine Angew
Tits J., Repr´ esentations lin´ eaires irr´ eductibles d’un groupe r´ eductif sur un corps quelconque,J. Reine Angew. Math. 247 (1971), 196–220
1971
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.