REVIEW 4 major objections 5 minor 22 references
Inducing spectral gaps for the cohomological Laplacians of $\operatorname{Sp}_{2n}(\mathbb{Z})$
T0 review · 4 major / 5 minor · reviewed 2026-08-16 · deepseek-v4-flash
Pith's one-line read The paper proves that a sum-of-squares certificate for one block of the cohomological Laplacian of the integral symplectic group at rank m induces a scaled certificate at every higher rank, turning a finite computation into uniform…
desk verdict A useful Adj-block induction for Sp_{2n}(Z), with an over-advertised main theorem that needs fixing before the paper is accepted. 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 object is the decomposition of $\Delta_1$ into four summands indexed by the size of the set of indices appearing in a generator or relator: $Mono$ (one index), $Sq$ (two), $Adj$ (three), and $Op$ (four). For the $Adj$ summand at rank $m$, the group of index permutations $\operatorname{Sym}_m$ acts on the triangles that index its entries, so the orbit-stabilizer theorem expresses the rank-$n$ block as an explicit normalized sum of the embedded rank-$m$ block over all $n!$ permutations. Lemma 4.2 computes the symmetrized identity matrix as a combination of the rank-$n$ identity split into its $Mono$ and $Sq$ diagonal blocks, with explicit combinatorial coefficients. Substituting these two identities into $Adj_m - \lambda I_m \ge 0$ produces the rank-$n$ certificate with an extra non-negative term, which is why the scaled margin has the factor $(n-2)/(m-2)$.
What would settle it
Recompute the two rank-3 quantities in exact rational arithmetic, or with a second independently written certifier, and check whether the sum-of-squares decompositions asserted in Lemma 5.2 are reproduced; a single negative eigenvalue in the certified matrix would refute the base case and, with it, the induced bounds for every quotient $H_n$.
Extended reading notes
Core claim
The central claim is Theorem 4.3. Write $RG$ for the group ring and interpret $M \ge 0$ to mean that $M$ is a sum of matrices of the form $N^*N$. The paper proves that whenever $Adj_m - \lambda I_m \ge 0$ in $M_{2m^2 \times 2m^2}(RG_m)$ for some $m \ge 2$, then $Adj_n - ((n-2)/(m-2))\lambda I_n \ge 0$ in $M_{2n^2 \times 2n^2}(RG_n)$ for every $n \ge m$. The proof averages the rank-$m$ identity over all permutations of the $n$ indices, using an orbit-stabilizer count that turns the symmetrized $Adj_m$ into $Adj_n$ and the symmetrized identity matrix into the identity plus an explicit positive correction term. A second statement shows that if only the partial certificate $Adj^-_m + \Delta^+_1 - \lambda I_m \ge 0$ is available, the same averaging gives $Adj^-_n + k\Delta^+_1 - ((n-2)/(m-2))\lambda I_n \ge 0$ for sufficiently large $k$. The paper couples this theorem with structural identities ($Mono^-_n$ and $Op^+_n + Op^-_n$ are always sums of squares) and with two certified rank-3 identities, deriving the uniform bounds for the quotients $H_n$ and the explicit constants $0.82$ and $0.99$ for $\operatorname{Sp}_4(\mathbb{Z})$ and $\operatorname{Sp}_6(\mathbb{Z})$.
Load-bearing premise
The load-bearing premise is that the two rank-3 computer certificates in Lemma 5.2—that $Adj^-+\Delta^+_1-0.24I_3$ and $Sq^-+\Delta^+_1-0.99I_3$ are sums of squares—are correct and that the interval-arithmetic certification turning numerical output into exact inequalities is sound; if either certificate fails, the induced bounds for all higher ranks collapse.
Editorial extensions
If this is right
- A rank-$m$ certificate for $Adj_m$ yields, for every $n \ge m$, a certified lower bound $((n-2)/(m-2))\lambda$ for $Adj_n$ without solving a new semidefinite program at rank $n$.
- The rank-3 certificates of Lemma 5.2 imply, for every $n \ge 2$, that $\Delta^-_1 + k\Delta^+_1 - ((n-2)0.24 + 0.99)I_n$ is a sum of squares in $M_{2n^2 \times 2n^2}(R H_n)$, with $k$ sufficiently large.
- Direct computations give $\Delta_1 - 0.82 I_2 \ge 0$ for $\operatorname{Sp}_4(\mathbb{Z})$ and $\Delta_1 - 0.99 I_3 \ge 0$ for $\operatorname{Sp}_6(\mathbb{Z})$.
- Via Remark 1.1, these direct certificates also give lower bounds $0.82$ and $0.99$ for the spectral gap in the Ozawa expression $\Delta^2 - \lambda\Delta$ for $\operatorname{Sp}_4(\mathbb{Z})$ and $\operatorname{Sp}_6(\mathbb{Z})$.
- The structural identities $Mono^-_n \ge 0$ and $Op^+_n + Op^-_n \ge 0$ hold for every $n$, so the computational burden is confined to the $Sq$ and $Adj$ summands.
Reading between the lines
- The symmetrization argument uses only the invariance of generators and relators under index permutations, not the specific arithmetic of $\operatorname{Sp}(2n,\mathbb{Z})$; the same orbit-stabilizer computation should transfer to any group family with a simplex-indexed presentation and an $Adj$-type summand. This is my inference, not a claim of the paper.
- The factor $(n-2)/(m-2)$ rewards larger base ranks: a certificate at $m=4$ or $5$ would improve the induced lower bound for all higher $n$ at no additional structural work, making the cost of the base semidefinite program the real bottleneck. This is an editorial consequence of the theorem.
- Because the certified bound grows linearly in $n$ while the generating set has size $2n^2$, the induced Kazhdan-constant lower bound decays roughly like $n^{-1/2}$; a natural testable extension is whether the true optimal gap decays at the same rate for the quotients $H_n$. This is my inference.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper develops an induction technique for the first cohomological Laplacian of Sp_{2n}(Z), seeking to infer a spectral gap at rank n from a sum-of-squares certificate at some smaller rank m. The main advertised result (Theorem 0.2) claims that a sum-of-squares decomposition for the summand Adj at rank m implies a spectral gap for the full Laplacian Δ1 at every rank n ≥ m. The actual proof in Section 4 establishes, at most, an induction statement for the Adj summand alone. The paper also contains a computer-assisted application: using base certificates for H3, it claims explicit lower bounds for the spectral gap of certain quotients H_n for all n ≥ 2. The computational material includes rigorous certification via interval arithmetic and a Wedderburn-decomposition acceleration.
Significance. If the induction were established in the advertised form, it would be a useful rank-reduction tool for cohomological Laplacians of symplectic groups, complementing the existing methods of Kaluba–Kielak and the first author's earlier work on SL_n(Z). The paper's strengths are its reproducible computational framework, the use of rigorous interval-arithmetic certificates, and the explicit constants. However, the significance is currently undermined because the main theorem as stated does not follow from the proof: the proof only concerns the Adj block, and the transition from Adj to Δ1 requires additional, separately certified summands. The corrected theorem would be narrower than the abstract claims, and the proof of the application still needs substantial justification.
major comments (4)
- [Section 4.4, proof of Theorem 4.3] The displayed identity after Lemma 4.2 is false. With C = (m−3)!/((n−3)!·m!), Lemma 4.2 gives C∑σ σ(I_m) = C[m(n−1)! I_n^Mono + m(m−1)(n−2)! I_n^Sq] = [(n−1)(n−2)/((m−1)(m−2))] I_n^Mono + [(n−2)/(m−2)] I_n^Sq. Therefore C∑σ σ(Adj_m − λI_m) differs from Adj_n − ((n−2)/(m−2))λI_n, and adding ((n−m)/(m−1))I_n^Mono does not repair the equality. For m = 3, n = 4, λ = 1 the coefficient of I_n^Mono in C∑σ σ(I_m) is 3, while the target identity requires coefficient 2. The induction step therefore is not proved as written. A corrected inequality appears to be salvageable for m ≥ 3 because the excess on I_n^Mono is nonnegative, but this needs to be derived explicitly.
- [Theorem 0.2 and Section 4.4] Theorem 0.2 and the abstract assert that a sum-of-squares certificate for Adj_m − λI_m implies that Δ1 − ((n−2)/(m−2))λI_n is a sum of squares for all n ≥ m. The proof of Theorem 4.3 establishes, at best, an inequality for the Adj_n summand; no argument in Section 4 controls Sq^−_n, Mono^−_n, or Op^±_n. The later application confirms this gap: Theorem 5.4 needs the additional computer-assisted certificate Sq^− + Δ1^+ − 0.99I_3 and Lemma 5.1 to assemble the full Δ1. If Theorem 0.2 were true as stated, those inputs would be redundant. The authors should either prove the full Δ1 statement or revise the abstract and introduction to announce the Adj-block induction that is actually shown.
- [Theorem 5.4, proof after Lemma 5.2] The assertion 'Similarly, by Lemmas 4.1 and 4.2 and Lemma 5.2, we get Sq^−_n + Δ1^+ − 0.99I_n ≥ 0' is not justified. Lemma 4.1 applies to a single summand such as Sq^− (where the simplex size is k = 2), while the expression Sq^−_3 + Δ1^+ − 0.99I_3 mixes terms of support sizes 1 through 4. Symmetrizing this whole expression is not covered by the stated lemmas, and the multiplicity of the Δ1^+ contribution under symmetrization is not computed. Consequently the proof of Theorem 5.4 does not follow from the displayed ingredients.
- [Theorem 5.4, range n ≥ 2] The induction base in Lemma 5.2 is at m = 3, and Theorem 4.3 supplies conclusions only for n ≥ m. The theorem therefore yields statements for n ≥ 3, not for n ≥ 2 as claimed. The case n = 2 would require a separate base at m = 2 for the relevant quotient, but the coefficient ((n−2)/(m−2)) is undefined at m = 2; this case is not treated in the proof. The authors should either prove the n = 2 case separately or restrict the range in Theorem 5.4.
minor comments (5)
- [Section 4.2, proof of Lemma 4.1] In the proof of Theorem 4.3 the formula for Adj_n is written with denominator (n−2)!; Lemma 4.1 with k = 3 gives (n−3)!. This is a typo in the displayed computation but should be corrected to avoid confusion.
- [Throughout] There are numerous typographical errors: 'summmands', 'intruduce', 'decompoisition', 'distungiuish', 'accalerate', 'a a usage'. These should be cleaned up in a revision.
- [Section 1, Remark 1.1] The notation Δ1 is used both for the full first cohomological Laplacian and, in the discussion of the Ozawa expression, for its components; a short notational reminder when switching between Δ1 and Δ±1 would improve readability.
- [Remark 5.3] Remark 5.3 says the computations were done 'over a subspace of the group ring RG_n' and then claims this implies the H_n statement because H_n is a quotient. The intended meaning is clear, but the wording should say the computation was done in the quotient or after verifying invariance, otherwise the implication is not immediate.
- [References] Reference [BS23] is cited as an arXiv preprint; if a published version is now available, it should be updated.
Circularity Check
No circularity: base cases are independent computer-assisted certificates and the induction is proved in-text; self-citations are technical, not conclusion-bearing.
full rationale
The paper's induction argument is self-contained. Lemma 4.1 and Lemma 4.2 are proved in the text by orbit�stabilizer and counting arguments, and Theorem 4.3 algebraically combines them to push an Adj-block sum-of-squares certificate from rank m to rank n. The base cases in Lemma 5.2 are independent computer-assisted certificates for H3, obtained with interval arithmetic and Wedderburn decomposition, not restatements of the target inequality. The use of [Miz24] and [KMN25] supplies the induction template and the certification method; these are prior technique results, not assumptions equivalent to the conclusion. No displayed equation defines Adj, Sq, Mono, or Op in terms of the desired inequality, and no parameter fitted to a subset is renamed as a prediction. I therefore find no circular step. Separately, Theorem 0.2 in the introduction states a capital-Delta_1 conclusion while Theorem 4.3 proves the Adj-block version; this is a statement/proof mismatch and a correctness risk, not a circularity.
Assumptions & free parameters
assumptions (4)
- standard math The Bader-Nowak and Bader-Sauer results equating a sum-of-squares decomposition of Δ_1 - λI with property (T) for finitely presented groups are valid.
- domain assumption The Steinberg presentation of Sp_{2n}(Z) with the listed generators and relators is correct.
- domain assumption The numerical SDP solutions obtained with SCS/JuMP can be rigorously certified using the interval arithmetic method of [KMN25] and the improved certification in Appendix B.
- domain assumption The Groups.jl package correctly implements the symplectic group Sp_{2n} and its relations.
Cite this review
Pith. "Pith review of Inducing spectral gaps for the cohomological Laplacians of $\operatorname{Sp}_{2n}(\mathbb{Z})$." pith.science (2026). https://pith.science/paper/AF4XPURM
@misc{pith2026250416625,
author = {Pith},
title = {Pith review of: Inducing spectral gaps for the cohomological Laplacians of $\operatornameSp_2n(\mathbbZ)$},
year = {2026},
howpublished = {\url{https://pith.science/paper/AF4XPURM}},
note = {Machine review of arXiv:2504.16625}
}
abstract
We show that the spectral gap of the first cohomological Laplacian $\Delta_1$ for $\operatorname{Sp}_{2n}(\mathbb{Z})$ follows once a slightly stronger assumption holds for some $\operatorname{Sp}_{2m}(\mathbb{Z})$, where $n\geq m$. As an application of this result, we provide explicit lower bounds for some quotients of $\operatorname{Sp}_{2n}(\mathbb{Z})$ for any $n\geq 2$.
Reference graph
Works this paper leans on
-
[1]
asentation von C hevalley-gruppen \
Helmut Behr. Explizite P r\"asentation von C hevalley-gruppen \"uber Z . Math. Z. , 141:235--241, 1975
work page 1975
-
[2]
Julia: A fresh approach to numerical computing
Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B Shah. Julia: A fresh approach to numerical computing. SIAM review , 59(1):65--98, 2017
2017
-
[3]
Uri Bader and Piotr W. Nowak. Group algebra criteria for vanishing of cohomology. J. Funct. Anal. , 279(11):108730, 18, 2020
2020
-
[4]
Higher kazhdan property and unitary cohomology of arithmetic groups
Uri Bader and Roman Sauer. Higher kazhdan property and unitary cohomology of arithmetic groups. https://arxiv.org/abs/2308.06517, 2023
arXiv 2023
-
[5]
Braid groups and symplectic S teinberg groups
Fran cois Digne and Christian Kassel. Braid groups and symplectic S teinberg groups. Ann. K-Theory , 8(4):669--692, 2023
work page 2023
-
[6]
Ralph H. Fox. Free differential calculus. I . D erivation in the free group ring. Ann. of Math. (2) , 57:547--560, 1953
1953
-
[7]
Ralph H. Fox. Free differential calculus. II . T he isomorphism problem of groups. Ann. of Math. (2) , 59:196--210, 1954
work page 1954
-
[8]
G. D. James. The representation theory of the symmetric groups , volume 682 of Lecture Notes in Mathematics . Springer, Berlin, 1978
1978
Show all 22 references
-
[9]
Kazhdan constants for chevalley groups over the integers
Marek Kaluba and Dawid Kielak. Kazhdan constants for chevalley groups over the integers. Revista Matemática Iberoamericana , November 2024
2024
-
[10]
Marek Kaluba, Dawid Kielak, and Piotr W. Nowak. On property ( T ) for Aut (F_n) and SL _n( Z ) . Ann. of Math. (2) , 193(2):539--562, 2021
2021
-
[11]
Marek Kaluba, Piotr Mizerka, and Piotr W. Nowak. Spectral G ap for the C ohomological L aplacian of SL _ 3 ( Z) . Exp. Math. , 34(1):53--58, 2025
2025
-
[12]
Nowak, and Narutaka Ozawa
Marek Kaluba, Piotr W. Nowak, and Narutaka Ozawa. Aut ( F_5) has property (T) . Math. Ann. , 375(3-4):1169--1191, 2019
2019
-
[13]
JuMP 1.0: R ecent improvements to a modeling language for mathematical optimization
Miles Lubin, Oscar Dowson, Joaquim Dias Garcia , Joey Huchette, Beno \^i t Legat, and Juan Pablo Vielma. JuMP 1.0: R ecent improvements to a modeling language for mathematical optimization. Mathematical Programming Computation , 15:581–589, 2023
2023
-
[14]
The product replacement algorithm and K azhdan's property ( T )
Alexander Lubotzky and Igor Pak. The product replacement algorithm and K azhdan's property ( T ). J. Amer. Math. Soc. , 14(2):347--363, 2001
2001
-
[15]
Roger C. Lyndon. Cohomology theory of groups with a single defining relation. Ann. of Math. (2) , 52:650--665, 1950
1950
-
[16]
Sur les sous-groupes arithm\'etiques des groupes semi-simples d\'eploy\'es
Hideya Matsumoto. Sur les sous-groupes arithm\'etiques des groupes semi-simples d\'eploy\'es. Ann. Sci. \'Ecole Norm. Sup. (4) , 2:1--62, 1969
1969
-
[17]
Inducing spectral gaps for the cohomological laplacians of SL _n( Z ) and SAut (f_n)
Piotr Mizerka. Inducing spectral gaps for the cohomological laplacians of SL _n( Z ) and SAut (f_n) . https://arxiv.org/abs/2404.10287, 2024
2024 arXiv
-
[18]
SP\_2N\_Cohomology
Piotr Mizerka and Jakub Szymański. SP\_2N\_Cohomology . https://github.com/jtszy/SP\_2N\_Cohomology, 2025
2025
-
[19]
Computer proofs for property ( T ), and sdp duality
Martin Nitsche. Computer proofs for property ( T ), and sdp duality. https://arxiv.org/abs/2009.05134, 2022
2009 arXiv
-
[20]
Conic optimization via operator splitting and homogeneous self-dual embedding
Brendan O'Donoghue, Eric Chu, Neal Parikh, and Stephen Boyd. Conic optimization via operator splitting and homogeneous self-dual embedding. Journal of Optimization Theory and Applications , 169(3):1042--1068, June 2016
2016
-
[21]
Noncommutative real algebraic geometry of K azhdan's property ( T )
Narutaka Ozawa. Noncommutative real algebraic geometry of K azhdan's property ( T ). J. Inst. Math. Jussieu , 15(1):85--90, 2016
2016
-
[22]
Sanders and Luis Benet
David P. Sanders and Luis Benet. Intervalarithmetic.jl. https://github.com/JuliaIntervals/IntervalArithmetic.jl, 2014
2014
Reviewed August 16, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.