{"id":"90dd1b3e-820b-4ed7-94e9-495be07db418","arxiv_id":"2505.08479","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"Random degree-n covers of a closed hyperbolic surface have no new Laplacian eigenvalues below 1/4 - c n^{-b} with probability tending to 1 as n grows.","lead":"This paper proves that uniformly random finite covers of a fixed closed hyperbolic surface have a Laplacian spectral gap of size 1/4 minus a polynomial error in the cover degree, with high probability. It improves the known error rate from logarithmic to polynomial by applying the recent strong convergence theorem of Magee, Puder and van Handel.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Application of Theorem 2.2 is quantitatively unjustified: with ε=(r log n/n)^{1/b} and r=n^a (a<1), the quoted failure probability c_d n^{-ε b} tends to 1, not 0; the proof needs the exact [MPvH25, Thm 6.1] formulation to repair this.","rationale":"The reader identified the same weakest assumption: the quantitative use of Theorem 2.2. My reading goes slightly further and sharpens the concern. The quoted bound c_d n^{-ε b}, with the paper's own choices, does not merely have an unspecified constant; the entire factor n^{-ε b} tends to 1 in the regime ε=(r log n/n)^{1/b} with r=n^a and a<1. Therefore the proof's only probabilistic input cannot deliver the asserted o(1) failure probability. This is a genuinely load-bearing gap in the argument as written. However, the underlying statement of Theorem 1.1 may still be true, and the gap may be repairable if the actual theorem in [MPvH25] has a stronger quantitative form. The paper should be asked to state the precise theorem and recompute the probability, so I do not reject outright; the reader's conditional acceptance is the appropriate stance, with the condition being a correct justification of this probabilistic step.","tokens_in":8948,"tokens_out":18739,"duration_ms":195742,"concrete_test":"Consult the exact statement of [MPvH25, Theorem 6.1] in arXiv:2504.08988 and substitute d≈2r|S(1)|, ε=(r log n/n)^{1/b}, r=n^a with 0<a<1. Determine whether the stated failure probability is c_d n^{-ε b}, c_d n^{-ε^b}, or a bound exponential in n ε^b. In the first two cases the bound tends to 1 and the proof fails; only in the exponential-in-n case does the application give o(1). If the exact theorem is the weak one, the proof of Theorem 1.1 must be revised; if it is strong, the paper should quote that correct statement and re-derive the probability line.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3 applies Theorem 2.2 at ε=(r log n/n)^{1/b} and asserts failure probability O_X((log n)^{-1/b}). This does not follow from the theorem as stated. Substitute r=n^a with 0<a<1: then ε=n^{-(1-a)/b}(log n)^{1/b}, so n^{-ε b}=exp[-b n^{-(1-a)/b}(log n)^{1+1/b}], which tends to 1, not 0. Under the alternative reading n^{-ε^b}, one gets exp[-n^{a-1}(log n)^2], which also tends to 1. Thus even with a bounded constant c_d, the displayed probability bound on the bad event fails to vanish; with c_d growing in d it is worse. Consequently the high-probability event used to compare the finite-rank operator with the regular representation is not established, and the rest of the proof of Theorem 1.1 depends on that event. The issue is not cosmetic: the polynomial rate n^{-b} is exactly obtained by taking ε polynomial in n, which is the regime where the quoted theorem gives no control. Unless [MPvH25, Theorem 6.1] actually supplies a stronger dependence on ε, such as c_d exp(-c n ε^b), the central claim is unsupported as written.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims a polynomial-rate spectral gap for uniformly random degree-n covers of a fixed closed hyperbolic surface: for every such surface X there exist b,c>0 such that a uniformly random degree-n cover X_n has λ_1^new(X_n) ≥ 1/4 − c n^{-b} with probability tending to 1. The proof uses the Selberg transform of a ball kernel to convert the spectral gap question into an operator norm problem on the new subspace, approximates the relevant operators by finite-rank operators, and applies an effective strong-convergence theorem of Magee, Puder, and van Handel for random permutation representations of surface groups. If the high-probability comparison with the regular representation is valid, the final polynomial error rate follows from a simple lower bound on the Selberg transform.","tokens_in":9236,"tokens_out":12769,"duration_ms":139931,"significance":"A polynomial error rate for the new spectral gap of random covers would be a substantial quantitative improvement over the previously known rates of order log log n/log n, and it would move the study of these surfaces closer to the conjectured n^{-2/3+o(1)} fluctuation scale. The paper is concise and the reduction via the Selberg transform and finite-rank approximation is elegant. The main theorem is crisp and falsifiable, and the method is a natural application of the recent breakthrough in strong convergence. However, as written the central probability estimate is not justified: the quoted effective theorem, as stated, does not give a vanishing failure probability in the regime used in the proof, and the growth of the constant c_d with the matrix dimension is left uncontrolled. These issues are load-bearing for the proof of Theorem 1.1.","major_comments":[{"comment":"Theorem 2.2 is applied with ε = (r log n/n)^{1/b}, and the proof immediately asserts success with probability 1 − O_X((log n)^{-1/b}). This does not follow from the displayed bound P ≤ c_d n^{-ε b}. Indeed, with r = n^a one has n^{-ε b} = exp(−b n^{-(1-a)/b} (log n)^{1+1/b}), which tends to 1 as n → ∞, not to 0. Thus the displayed bound does not even tend to zero at the chosen ε, and it certainly does not imply the claimed O_X((log n)^{-1/b}) failure probability. This high-probability comparison is the step that connects the finite-rank operator to the regular representation and from which the polynomial rate is extracted, so Theorem 1.1 is unsupported as written. The authors need to quote the exact ε-dependence in [MPvH25, Theorem 6.1] (e.g., whether the failure probability is of the form c_d n^{-c ε^2}, c_d exp(−c n ε^b), or something else) and then verify that the chosen ε produces a vanishing failure probability.","section":"Section 3, paragraph beginning 'We now apply Theorem 2.2'"},{"comment":"The prefactor c_d is never quantified. In the same application, the matrix dimension satisfies d ≤ r|S(1)|, so d grows like n^a after the choice r = n^a, while Theorem 2.2 only states that c depends on g and the word length and writes c_d. If c_d grows rapidly with d, then even a corrected tail bound might not be o(1). A valid derivation must either specify the growth of c_d in d or impose a restriction on a that ensures c_d times the tail bound tends to zero. As the manuscript stands, the high-probability event is not established even if the exponent in Theorem 2.2 were corrected.","section":"Section 3, same paragraph"},{"comment":"The theorem and abstract claim that b,c depend only on the genus of X, but the proof records constants A, C, a diameter bound, and a word-length bound that depend on the specific base surface X, and the final 'const' is not argued to be uniform over all closed hyperbolic surfaces of a fixed genus. No argument is supplied that these constants can be bounded in terms of the genus alone. The authors should either weaken the statement to say the constants depend on X or provide the missing uniformity argument.","section":"Theorem 1.1 and final paragraph of Section 3"}],"minor_comments":[{"comment":"The symbol r is used both for the truncation rank in Lemma 3.3 and for the auxiliary parameter r = n^a. Since the rank must be an integer, the proof should take r = floor(n^a) and note that the estimates are unaffected.","section":"Section 3, proof of Theorem 1.1"},{"comment":"Both lemmas are only sketched, with details deferred to [Hid23, Lemmas 5.1 and 5.2]. Since the constants in these lemmas enter the main quantitative estimates, the paper would be more self-contained if the proofs were given in full or the precise constant dependencies were stated.","section":"Lemmas 3.2 and 3.3"},{"comment":"The displayed exponent in the denominator of the failure probability is written as ε b; because b also appears in the main theorem and the subsequent application, the authors should make the intended exponent unambiguous and check it against the source theorem.","section":"Theorem 2.2"}],"recommendation":"major_revision","confidential_remarks":"The paper is a short application of a recent breakthrough, and the main argument is plausible if the effective strong-convergence theorem is quoted correctly. The central issue is that the probability estimate as stated does not support the chosen polynomial ε, and the d-dependence of the constant is not addressed. I believe the result is likely salvageable by replacing Theorem 2.2 with the correct quantitative statement from [MPvH25] and choosing the parameter a in the allowable range. I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague,\n\nThis note aims to be the first to get a polynomial error rate n^{-b} for the spectral gap of random degree-n covers of a fixed closed hyperbolic surface, improving the previous log log n / log n rate. If the proof worked, it would be a nice quantitative advance. The setup is clean: use the Selberg transform of a ball cutoff, approximate the resulting operators by finite rank, and feed them into the effective strong convergence theorem of Magee–Puder–van Handel.\n\nThe problem is the one step where the theorem is used. The paper’s Theorem 2.2, quoted from MPvH, says the bad event has probability at most c_d n^{-ε b}. In Section 3 the authors set ε = (r log n / n)^{1/b} and claim failure probability O_X(1/(log n)^{1/b}). That does not follow. With any r = n^a, 0<a<1, ε = n^{-(1-a)/b} (log n)^{1/b}, so n^{-ε b} = exp(-b n^{-(1-a)/b} (log n)^{1+1/b}), which goes to 1, not 0. Even the alternative reading n^{-ε^b} gives exp(-n^{a-1} (log n)^2) → 1. So the high-probability comparison between the finite-rank operator and the regular representation is not established. The paper also doesn't track the dependence of c_d on d ~ n^a, but that's secondary.\n\nWhat is good: the Selberg-transform machinery is applied correctly; the finite-rank approximation lemmas are taken from the first author's earlier work and are used honestly; the introduction situates the result well. The structure of the proof is exactly what you'd want if the input theorem had the right quantitative form.\n\nThe central claim might be repairable if the actual MPvH paper contains a stronger estimate, for example a bound like c_d exp(-c n ε^b) or c_d n^{-c ε^b n^α} with the right regime. But as written, the quoted theorem cannot support the argument. The authors need to state the precise MPvH formulation and verify the asymptotics. This is not about constants; the exponent in the probability fails to vanish.\n\nMy recommendation: send to a referee, because the target result is significant and the flaw is identifiable and likely fixable, but the paper should not be accepted in this form.","headline":"The polynomial spectral gap claim is likely right in spirit, but the main probability estimate does not follow from the quoted theorem as stated.","tokens_in":9799,"tokens_out":4552,"would_cite":false,"duration_ms":39119,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["58J50","35P15"],"pacs":[],"model":"deepseek-v4-flash","headline":"A uniformly random degree-n cover of any closed hyperbolic surface has no new Laplacian eigenvalue below 1/4 - c n^{-b}, with probability tending to 1.","keywords":["random covering surfaces","hyperbolic surfaces","spectral gap","Laplacian eigenvalues","strong convergence","Selberg transform","polynomial error rate","permutation representations"],"falsifier":"Compute the precise dependence of $c_d$ and $b$ in the effective strong-convergence theorem quoted as Theorem 2.2 (the cited paper's Theorem 6.1), and evaluate the failure probability bound at $\\varepsilon = (r\\log n/n)^{1/b}$ with $r = n^a$ for some small $a>0$; if the only bound is $c_d n^{-\\varepsilon b}$, then $n^{-\\varepsilon b} = \\exp\\left(-b r^{1/b} n^{-1/b} (\\log n)^{1+1/b}\\right) \\to 1$, so the failure probability does not tend to 0 and the proof of Theorem 1.1 cannot be completed as written.","tokens_in":8687,"feed_emoji":"","tokens_out":17900,"duration_ms":150065,"temperature":0.7,"pith_summary":"This paper proves that a uniformly random degree-n cover of any fixed closed hyperbolic surface has an optimal spectral gap with a polynomial error rate: there exist constants b, c > 0, depending only on the genus of the base surface, such that the first new Laplacian eigenvalue satisfies $\\lambda^{\\mathrm{new}}_1(X_n) \\geq \\frac14 - c n^{-b}$ with probability tending to 1. The value $\\frac14$ is the bottom of the Laplacian spectrum on the hyperbolic plane, so it is the best possible limiting position for the gap. The proof phrases the spectral gap as the operator norm of a Selberg-transformed geometric ball cutoff, approximates that operator by a matrix-valued group-algebra polynomial, and feeds it into a recent effective strong-convergence theorem for random permutation representations of surface groups. This gives the first polynomial error rate for spectral gaps of random surfaces, improving on earlier rates of order $\\log\\log n / \\log n$.","feed_headline":"Random covers approach spectral gap 1/4 at polynomial rate","feed_subtitle":"Random degree-n covers have no new eigenvalues below 1/4 minus a polynomial error, with high probability.","key_machinery":"The load-bearing object is the Selberg transform, the spherical transform that converts a radial kernel on the hyperbolic plane into a Fourier multiplier evaluated at the Laplacian spectral parameter $r$ (with eigenvalue $\\lambda = \\frac14 + r^2$). The paper works with the geometric ball cutoff $k_1(z,w) = \\mathbf{1}_{d(z,w) \\leq 1}$ and its integral operator $P_{k_1}$; on the new spectrum of a cover, the operator norm of $P_{k_1}$ equals $h_1\\!\\left(i\\sqrt{\\frac14 - \\lambda^{\\mathrm{new}}_1(X_n)}\\right)$, where $h_1$ is the Selberg transform of $k_1$, so an upper bound on that norm translates directly into a lower bound on $\\lambda^{\\mathrm{new}}_1(X_n)$. To compare the cover's operator norm with the corresponding operator on the universal cover, the paper decomposes $P_{k_1}$ as a finite sum $\\sum_{\\gamma \\in S(1)} a_{\\gamma,1} \\otimes \\rho_n(\\gamma^{-1})$ over short elements of the surface group, approximates each compact operator $a_{\\gamma,1}$ by a rank-$r$ operator $b^{(r)}_{\\gamma,1}$ with error $O(r^{-1/2})$, and assembles these blocks into a self-adjoint matrix-valued group-algebra polynomial to which an effective strong-convergence theorem applies. The Selberg transform is what monitors the spectral parameter near $\\frac14$, and the finite-rank reduction is what lets the infinite-dimensional operator be treated by finite-dimensional probabilistic bounds.","core_discovery":"The paper's central claim is Theorem 1.1: for any closed hyperbolic surface $X$, there are constants $b, c > 0$ depending only on the genus of $X$ such that a uniformly random degree-$n$ cover $X_n$, sampled uniformly among the finitely many labelled degree-$n$ covers, satisfies $\\lambda^{\\mathrm{new}}_1(X_n) \\geq \\frac14 - c n^{-b}$ with probability tending to 1 as $n \\to \\infty$. The theorem concerns only the new spectrum, the part of $L^2(X_n)$ orthogonal to lifts of functions from the base. Because $\\frac14$ is the bottom of the $L^2$ spectrum of the Laplacian on the hyperbolic plane, no weaker lower bound can be expected asymptotically; the content is that the gap approaches this optimal value at a polynomial rate in $n$. Along the way the paper quantifies the failure probability in the strong-convergence input as $O((\\log n)^{-1/b})$, so the high-probability statement is itself quantitative.","pith_inferences":["The same Selberg-transform-and-finite-rank scheme should apply to other radial observables built from the Laplacian on random covers, such as heat-kernel traces or spectral window counts near $\\frac14$, yielding polynomial-rate estimates wherever the strong-convergence theorem provides the comparison.","The expected fluctuation scale for $\\lambda^{\\mathrm{new}}_1$ is $n^{-2/3}$ (by analogy with random regular graphs and Tracy-Widom statistics), so the exponent $b$ in the theorem is likely far from optimal; extracting the actual $b$ from the strong-convergence argument would show how much room remains.","If the effective strong-convergence theorem also holds for finite-area non-compact hyperbolic surfaces, the same proof structure would give polynomial-rate spectral gaps in that setting, extending the result beyond closed base surfaces."],"forward_implications":["For any fixed closed hyperbolic base surface, with probability tending to 1, the random degree-$n$ cover has no new Laplacian eigenvalues in $[0, \\frac14 - c n^{-b})$, so the first new eigenvalue converges to $\\frac14$ at the polynomial rate $c n^{-b}$.","This is the first polynomial error rate for spectral gaps in any random surface model; previously the best available rates for covers were of order $\\log\\log n / \\log n$ or worse.","Because the constants depend only on the genus of the base, the same quantitative bound applies uniformly across all degree-$n$ covers sampled from a given base surface.","Taking $n$ growing along a sequence and passing to the corresponding covers gives a tower of closed hyperbolic surfaces whose Laplacian first eigenvalue approaches $\\frac14$ at a polynomial rate in the cover degree.","The paper's failure-probability bound, $O((\\log n)^{-1/b})$, makes the convergence statement quantitative: not merely 'probability tends to 1' but an explicit decay rate for the exceptional covers."],"supporting_citations":[{"why":"Supplies the effective strong-convergence theorem (quoted as Theorem 2.2, its Theorem 6.1) for uniformly random permutation representations of surface groups; this is the probabilistic input that converts a norm comparison into a high-probability spectral bound.","marker":"[MPvH25]"},{"why":"Provides the support-count bound and the finite-rank approximation lemma (Lemmas 3.2 and 3.3) that reduce the Selberg operator to a matrix-valued group-algebra polynomial with controlled error.","marker":"[Hid23]"},{"why":"Gives that a uniformly random cover is connected with probability tending to 1, so the first new eigenvalue is strictly positive and the spectral-gap statement is meaningful.","marker":"[LS04]"},{"why":"Supplies the block-matrix trick (proof of its Theorem 1.1) that makes the group-algebra polynomial self-adjoint before applying the strong-convergence theorem.","marker":"[BC23]"},{"why":"Provides the \\v{S}varc-Milnor lemma used to bound the word length of the finitely many group elements appearing in the Selberg operator, keeping the constants independent of n.","marker":"[BH99]"},{"why":"Identifies 1/4 as the bottom of the Laplacian spectrum on the hyperbolic plane, which is the optimal value toward which the spectral gap is shown to converge.","marker":"[Hub74]"}],"fun_headline_variants":["Random covers hit spectral gap 1/4 at polynomial rate","Polynomial speed to optimal spectral gap for random covers","Random hyperbolic covers: spectral gap near 1/4 at polynomial rate","Optimal spectral gap for random covers at polynomial rate"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof's central step assumes that the quoted effective strong-convergence theorem gives a failure probability tending to 0 when the spectral slack $\\varepsilon$ is as small as $(r\\log n / n)^{1/b}$ and the matrix dimension grows polynomially in $n$; as the theorem is stated in the paper (failure probability bounded by $c_d n^{-\\varepsilon b}$), that quantity approaches 1, not 0, in this regime, so the high-probability conclusion depends on unstated information about how $c_d$ depends on $d$ and how $b$ depends on $\\varepsilon$.","fun_headline_variants_meta":{"raw":{"variants":["Random covers hit spectral gap 1/4 at polynomial rate","Polynomial speed to optimal spectral gap for random covers","Random hyperbolic covers: spectral gap near 1/4 at polynomial rate","Optimal spectral gap for random covers at polynomial rate"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001033,"raw_usage":{"total_tokens":4303,"prompt_tokens":853,"completion_tokens":3450,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":469,"completion_tokens_details":{"reasoning_tokens":3381}},"tokens_in":469,"tokens_out":3450,"duration_ms":25193,"temperature":1.0,"reasoning_tokens":3381,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T21:54:59.380140+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the precise dependence of $c_d$ and $b$ in the effective strong-convergence theorem quoted as Theorem 2.2 (the cited paper's Theorem 6.1), and evaluate the failure probability bound at $\\varepsilon = (r\\log n/n)^{1/b}$ with $r = n^a$ for some small $a>0$; if the only bound is $c_d n^{-\\varepsilon b}$, then $n^{-\\varepsilon b} = \\exp\\left(-b r^{1/b} n^{-1/b} (\\log n)^{1+1/b}\\right) \\to 1$, so the failure probability does not tend to 0 and the proof of Theorem 1.1 cannot be completed as written.","supporting_citations":[],"review_version":1}