{"id":"f48eb8ee-18fb-4d36-9b89-52fb6e35b419","arxiv_id":"2501.18379","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"The paper derives explicit optimal Poincaré-Hardy weights on weakly spherically symmetric graphs and shows they dominate Green's-function-based optimal weights at infinity.","lead":"The authors construct explicit optimal Hardy-type inequalities on a broad class of graphs called weakly spherically symmetric graphs, including trees and anti-trees. Their weights are provably larger at infinity than the weights produced by the classical Green's function method, which may improve sharp constants for spectral estimates on such graphs.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.8's null-criticality proof uses a reversed inequality; a weighted ray with area(r)=r satisfies all hypotheses but yields w0(r)=0 for r≥2, contradicting the claimed lower bound.","rationale":"The reader correctly identified condition (2) as central, but the actual failure is more serious than a typo or sketched detail: the proof's null-criticality lower bound is false under the stated hypotheses, and there is an admissible graph satisfying all assumptions for which the constructed weight vanishes on all sufficiently distant spheres. This invalidates the main graph-theoretic theorems as stated, not merely their proofs. The manifold section and the homogeneous-tree theorems are largely independent and likely correct, and a repaired version could plausibly restore the results by adding a properness or growth assumption such as area(r)/r → ∞ or liminf κ(r) > 1. But the current central claim, optimal Poincaré-Hardy weights on weakly spherically symmetric graphs, is false as written. The suggested concrete test settles the issue immediately by evaluating the explicit ray example; if the test is run, it reproduces w0(r) = 0 for r ≥ 2, confirming the counterexample. For these reasons the verdict should move from the reader's CONDITIONAL to REJECT, with the caveat that the paper may be salvageable after adding the missing non-degeneracy assumption.","tokens_in":24721,"tokens_out":43409,"duration_ms":402912,"concrete_test":"Take the explicit weighted ray X = N0, m(0) = 1, m(r) = r for r ≥ 1, and b(r−1,r) = r for r ≥ 1, with all other b = 0. Compute area(r) = r, κ(r) = (r+1)/r, and u(r) = r/area(r) = 1 for r ≥ 1, and verify that all hypotheses of Theorem 3.8 hold (κ(1) = 2, κ bounded, condition (2) at equality). Then compute w0 from Theorem 3.8; one obtains w0(1) = 1 and w0(r) = 0 for all r ≥ 2, contradicting the theorem's claimed lower bound and the null-criticality divergence. Alternatively, substitute κ(1) = 2, κ(2) = 3/2, r = 2 into the proof's chain: the left-hand side is 0 while the claimed right-hand side is positive, showing the reversed inequality directly.","verdict_should_be":"REJECT","load_bearing_attack":"The load-bearing step is the lower-bound estimate in the proof of Theorems 3.8/3.9 just before the null-criticality computation. The proof claims\nwγ(r)/k−(r) ≥ (√κ(r)−1)^2 + √κ(r)(2 − √(1+1/r) − √(1−1/(κ(r)r))) ≥ (√κ(r)−1)^2 + √κ(r)(2 − √(1+1/r) − √(1−1/r)) ≥ (√κ(r)−1)^2 + √κ(r)/(4r^2).\nThe second inequality has the wrong direction: since κ(r) ≥ 1, we have 1 − 1/(κ(r)r) ≥ 1 − 1/r, so its square root is larger and subtracting it gives a smaller quantity. The asserted final bound wγ(r) ≥ k−(r)/(4r^2) is therefore not justified and is in fact false.\n\nA concrete counterexample to the claimed bound is the weighted ray X = N0 with m(r) = r and b(r−1,r) = r. Then area(r) = r, κ(r) = area(r+1)/area(r) = (r+1)/r, so κ(1) = 2, κ is bounded, and condition (2) of Theorem 3.8 holds with equality for every r ≥ 2. For γ = 0, u(r) = r/area(r) = 1 on X\\{0}, so w0(r) = 0 for all r ≥ 2. This violates the displayed lower bound, which is positive for r ≥ 2. The null-criticality sum ∑ u(r)wγ(r)m is then finite, not infinite, so the optimality conclusion of Theorem 3.8 collapses exactly under the stated hypotheses. The proof implicitly needs a non-degeneracy condition such as properness of u, equivalently area(r)/r → ∞ or liminf κ(r) > 1, which is not among the assumptions.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper reviews a method for obtaining optimal Poincaré-Hardy-type inequalities on hyperbolic spaces and related manifolds, then transfers the method to graphs. On graphs, the authors choose u(r) = r/area(r) for spherically symmetric graphs, define the candidate Hardy weight w = −Δ√u/√u, and prove criticality via a logarithmic cutoff sequence. The central new results, Theorem 3.8 and Theorem 3.9, assert that under the curvature conditions (1) κ bounded and κ(1) ≥ 2 and (2) κ(r) ≥ 1/r + (1−1/r)κ(r−1), the explicit weights w0 and wγ are optimal Hardy weights on X\\O and X respectively. Theorem 3.14 states that for eventually constant κ > 1 these weights dominate the Fitzsimmons-ratio weight of the Green function. The proof of optimality relies on a null-criticality estimate claiming wγ(r) ≥ k−(r)/(4r^2) for r ≥ 2.","tokens_in":25161,"tokens_out":10405,"duration_ms":89700,"significance":"If correct, the graph part of the paper would provide a simple, explicit construction of optimal Hardy weights on a large class of weakly spherically symmetric graphs, including trees and anti-trees, and would improve on the classical Green-function-based weights. The manifold review is a useful presentation of existing results, and the criticality argument via a logarithmic cutoff is elegant. However, the main graph optimality theorem is false as stated: a simple weighted ray satisfies all hypotheses but yields the zero weight, for which null-criticality fails. This invalidates the central claim of the paper.","major_comments":[{"comment":"The chain of inequalities proving the lower bound wγ(r) ≥ k−(r)/(4r^2) contains a reversed inequality. The display in the proof claims wγ(r)/k−(r) ≥ (√κ(r)−1)^2 + √κ(r)(2 − √(1+1/r) − √(1−1/(κ(r)r))) ≥ (√κ(r)−1)^2 + √κ(r)(2 − √(1+1/r) − √(1−1/r)). Since κ(r) ≥ 1 implies 1−1/(κ(r)r) ≥ 1−1/r, the square root √(1−1/(κ(r)r)) is larger than √(1−1/r), so subtracting it gives a smaller quantity; the second '≥' should be '≤'. Thus the claimed lower bound is not justified by this argument.","section":"Section 3.4, Theorem 3.8, null-criticality proof"},{"comment":"Theorem 3.8 is false as stated. Consider the weighted ray X = N0 with O = {0}, m(0) = 1, m(r) = r for r ≥ 1, and b(r−1,r) = r for r ≥ 1, with all other weights zero. This graph is weakly spherically symmetric and locally finite. We have area(r) = r, vol(r) = r, k−(r) = 1 for r ≥ 1, and κ(r) = area(r+1)/area(r) = (r+1)/r, so κ(1) = 2, κ is bounded, and condition (2) holds with equality for every r ≥ 2. For γ = 0, u(r) = r/area(r) = 1 on X\\O, so w0(r) = 0 for all r ≥ 2. This contradicts the theorem's asserted lower bound w0(r) ≥ k−(r)/(4r^2) > 0 and makes the null-criticality sum ∑ u^2 w0 m equal to 0, so u ∈ ℓ^2(X\\O, w0 m). Thus w0 is not an optimal Hardy weight under the stated hypotheses.","section":"Section 3.4, Theorem 3.8, counterexample"},{"comment":"The same weighted ray also disproves Theorem 3.9. With m(0) = 1, m(r) = r, b(r−1,r) = r, we have k+(0) = 1, vol(0) = 1, and κ(1) = 2, so the allowed interval for γ is exactly [1,1], forcing γ = 1. Then u(r) = 1 for all r ≥ 0, and the formulas give wγ(0) = wγ(1) = wγ(r) = 0 for r ≥ 2, i.e., wγ ≡ 0. The same failure of null-criticality follows, so the theorem's optimality conclusion collapses.","section":"Section 3.4, Theorem 3.9, counterexample"},{"comment":"The underlying issue is a missing non-degeneracy condition. Lemma 3.10 shows that strict superharmonicity of √u implies properness of u, and properness is used to obtain the infinite null-criticality sum. In the counterexample, √u = 1 is harmonic rather than strictly superharmonic, so Lemma 3.10 does not apply, and the null-criticality sum is finite. The theorem's assumptions do not exclude this case; adding a condition such as area(r)/r → ∞ or liminf κ(r) > 1 would be needed to make the argument work, but this is not part of the stated hypotheses.","section":"Section 3.4, Lemma 3.10 and proof of Theorem 3.8"}],"minor_comments":[{"comment":"The formula for w0(r) in Theorem 3.8 uses κ(r−1) for r ≥ 1; for r = 1 this refers to κ(0), which is not defined. Although the factor (1−1/r) makes the term vanish, the authors should state the r = 1 case separately or define κ(0) to avoid ambiguity.","section":"Theorem 3.8, definition of w0(r) at r = 1"},{"comment":"The phrase 'the second last from the binomial series expansion' is misleading in context, because the binomial expansion is applied only after the erroneous inequality. The estimate 2 − √(1+1/r) − √(1−1/r) ≥ 1/(4r^2) is correct by itself, but it does not repair the earlier reversed inequality.","section":"Proof of Theorem 3.8/3.9, final estimate"},{"comment":"The provided text contains numerous OCR-style artifacts, such as '/greaternotequal', '/lessnotequal', and '/radicalvertex', which make parts of the exposition hard to read. The authors should ensure the final published version has clean typesetting.","section":"General presentation"}],"recommendation":"reject","confidential_remarks":"The manuscript's main graph results, Theorems 3.8 and 3.9, are contradicted by a simple weighted ray that satisfies every stated hypothesis. The error is not a minor gap: the null-criticality estimate used in the proof has the wrong inequality direction, and the counterexample shows the conclusion is false. The manifold review part appears sound but does not offset the invalidity of the central new graph theorems. The method might be salvageable by adding a properness or growth assumption, but as it stands the paper's main contribution is not correct."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the graph construction is genuinely new, and the comparison with the Green's function weight (Theorem 3.14) is a nice observation. But Theorem 3.8 is false as stated. The ray with m(r)=r and b(r-1,r)=r satisfies every assumption (κ(1)=2, condition (2) with equality, κ bounded), yet u(r)=r/area(r)=1 on X\\{0}, so w0=0 for r≥2 and the claimed lower bound w0 ≥ k−/(4r²) fails. Null-criticality fails too, so w0 is not optimal on that graph.\n\nThe manifold section is a labeled review of BGG17 and FP25; nothing new but cleanly written. The genuinely new part is the graph section. The idea of taking u=r/area and computing the Fitzsimmons ratio of √u is simple and effective; for homogeneous trees it recovers BSV21. The extension to weakly spherically symmetric graphs is the right level of generality, and the comparison theorem 3.14 (w0 beats the Green-function weight at infinity for eventually constant κ>1) is correct as far as I can see.\n\nSoft spots: (1) The lower-bound chain in the proof of Theorems 3.8/3.9 has a reversed inequality. Since κ(r)≥1, √(1−1/(κr)) ≥ √(1−1/r), so subtracting it gives a smaller quantity. The final bound w0 ≥ k−/(4r²) is not justified and is false in the ray example. (2) The theorem is missing a non-degeneracy condition such as properness of u (equivalently area(r)/r→∞, or liminf κ>1). The proof tries to get properness from Lemma 3.10, but that needs strict superharmonicity of √u, which fails when u is constant on the tail. The ray shows this is not a pedantic point. (3) The γ-interval in Theorem 3.9 is garbled; compare Lemma 3.13. (4) Some criticality details are only sketched as \"exactly as before\"; acceptable in a paper of this length, but after fixing the main gap they should be spelled out.\n\nWho it's for: people in Hardy/criticality theory on graphs. The method and the comparison result deserve to be published; the main theorem needs a revised hypothesis and a corrected proof. I would send it to a serious referee, but I would not cite it in its current form. Reading group? Maybe, as a good example of how a plausible theorem can fail at the boundary.","headline":"Nice method and a genuinely useful comparison theorem, but Theorem 3.8 is false as stated: the ray with area(r)=r satisfies all hypotheses and the claimed lower bound fails.","tokens_in":25696,"tokens_out":8526,"would_cite":false,"duration_ms":72320,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["35B09","26D10","31C12","31C20","39A12","58J60"],"pacs":[],"model":"deepseek-v4-flash","headline":"A single radial function $u=r/\\mathrm{area}(r)$ generates optimal Hardy-type inequalities on manifolds and graphs.","keywords":["Poincaré-Hardy-type inequalities","Hardy weights","hyperbolic spaces","Damek-Ricci spaces","homogeneous trees","weakly spherically symmetric graphs","Green's function","curvature ratio"],"falsifier":"Take a weakly spherically symmetric graph satisfying $\\kappa(1)\\ge 2$ and $\\kappa(r)\\ge 1/r+(1-1/r)\\kappa(r-1)$ with bounded $\\kappa$, and evaluate $E(\\varphi)-\\sum w_0\\varphi^2 m$ on the finitely supported function $\\varphi$ equal to 1 on one distance sphere and 0 elsewhere; if any such value is negative, $w_0$ is not a Hardy weight and Theorem 3.8 is false. A complementary check is to violate the recurrence at a single radius and watch whether $-\\Delta\\sqrt{u}$ turns negative there.","tokens_in":24483,"feed_emoji":"📐","tokens_out":12500,"duration_ms":103452,"temperature":0.7,"pith_summary":"This paper shows that one explicit ansatz—the function $u(r)=r/\\mathrm{area}(r)$ on a graph, or $u(r)=r/f(r)$ on a manifold with radial volume density—generates optimal Hardy-type inequalities. On weakly spherically symmetric graphs whose curvature ratio satisfies a precise monotone recurrence, the weight $w_0=-\\Delta\\sqrt{u}/\\sqrt{u}$ is an optimal Hardy weight and is strictly larger at infinity than the classical weight built from the minimal positive Green's function. This matters because the classical route through Green's functions is usually hard to compute, whereas the new weights are explicit and come with a proof of optimality. The same method yields a new proof of known optimal inequalities on homogeneous regular trees and recovers Poincaré-Hardy inequalities on hyperbolic spaces, Damek-Ricci spaces, and more general harmonic manifolds.","feed_headline":"One radial ansatz yields optimal Hardy weights on graphs","feed_subtitle":"On weakly spherically symmetric graphs, u=r/area(r) beats the classical Green's-function weight at infinity.","key_machinery":"The central object is the explicit superharmonic function $u(r)=r/\\mathrm{area}(r)$ on graphs, or $u(r)=r/f(r)$ on manifolds, together with the associated weight $W=-\\Delta\\sqrt{u}/\\sqrt{u}$. The proof that $W$ is a Hardy weight uses the Agmon-Allegretto-Piepenbrink identity, which rewrites $E(\\sqrt{u}\\varphi)-\\|\\sqrt{u}\\varphi\\|_W^2$ as a non-negative sum of squared differences. Optimality is established in three steps: the curvature recurrence makes $\\sqrt{u}$ strictly superharmonic and proper; a logarithmic cut-off sequence shows criticality of $-\\Delta-W$; and divergence of $\\sum_r \\mathrm{vol}(r)w(r)u(r)$ gives null-criticality. Bounded oscillation of $u$ then upgrades these to optimality in the sense of [DFP14].","core_discovery":"The central discovery is that optimality does not require knowledge of the Green's function: the radial function $u(r)=r/\\mathrm{area}(r)$ already carries enough information. On a weakly spherically symmetric graph over a finite set $O$, if the curvature ratio $\\kappa=k_+/k_-$ satisfies $\\kappa(1)\\ge 2$ and $\\kappa(r)\\ge 1/r+(1-1/r)\\kappa(r-1)$ for all $r\\ge 2$ and is bounded, then $w_0(r)=k_-(r)\\bigl(1+\\kappa(r)-\\sqrt{\\kappa(r)(1+1/r)}-\\sqrt{\\kappa(r-1)(1-1/r)}\\bigr)$ is an optimal Hardy weight on $X\\setminus O$, and a $\\gamma$-parametrized version is optimal on all of $X$ under an extra condition on $\\gamma$. Optimality means the shifted operator $-\\Delta-w_0$ is critical and null-critical: the weight cannot be increased anywhere without destroying the inequality, yet the ground state is not square-summable. For eventually constant curvature ratio $\\kappa>1$, the weight $w_0$ is strictly larger at infinity than the classical optimal weight $-\\Delta\\sqrt{G}/\\sqrt{G}$ obtained from the minimal positive Green's function $G$. On manifolds, the same scheme with $u(r)=r/f(r)$ yields the optimal Poincaré-Hardy weight on hyperbolic space, $W(r)=\\lambda_0(\\mathbb{H}^d)+1/(4r^2)+(d-1)(d-3)/(4\\sinh^2 r)$, and analogous weights on Damek-Ricci spaces.","pith_inferences":["The paper's closing remark suggests the strict domination in Theorem 3.14 should persist under weaker assumptions than 'eventually constant curvature'; replacing that hypothesis by convergence $\\kappa(r)\\to\\kappa>1$ is a natural testable extension.","Because the construction needs only the area function and not the Green's function, it offers a practical numerical recipe: on any finite exhaustion of a weakly spherically symmetric graph, $w_0$ can be computed from local sphere data and checked against the variational principle.","The same $u=r/f$ ansatz may produce optimal Hardy weights in other radial settings, such as graphs with weighted edges or vertex weights, whenever a suitable area function is available.","A graph that violates the curvature recurrence at a single radius should lose superharmonicity of $\\sqrt{u}$; probing such examples could reveal a genuine threshold separating optimal Hardy weights from merely formal ones."],"forward_implications":["On homogeneous regular trees $T_{d+1}$, the method reproduces the known optimal Poincaré-Hardy weights of [BSV21] with a shorter proof that avoids the general optimality theorem.","Every weakly spherically symmetric graph satisfying the curvature recurrence—including fast-growing trees and anti-trees—carries an explicit optimal Hardy weight with a Poincaré term $k_-(\\sqrt{\\kappa}-1)^2$.","On graphs with constant $\\kappa$ and $k_-$, the bottom of the spectrum is bounded below by $k_-(\\sqrt{\\kappa}-1)^2$.","If the curvature ratio is eventually constant $\\kappa>1$, the new optimal weight dominates the Green's-function weight at every sufficiently large radius, so the inequality is genuinely stronger at infinity.","The same ansatz recovers the optimal Poincaré-Hardy weight on hyperbolic space, and on Damek-Ricci spaces produces the weight $\\lambda_0+1/(4r^2)+p(p+2q-2)/(16\\sinh^2(r/2))+q(q-2)/(4\\sinh^2 r)$."],"supporting_citations":[{"why":"Supplies the hyperbolic-space Poincaré-Hardy inequality and the model-manifold version that the u=r/f method starts from.","marker":"[BGG17]"},{"why":"Provides the harmonic-manifold and Damek-Ricci weights and the Khas'minskii-type ground-state criterion used in the manifold part.","marker":"[FP25]"},{"why":"Defines optimal Hardy weights via criticality and null-criticality, the optimality notion the paper adopts.","marker":"[DFP14]"},{"why":"Establishes the classical Green's-function Fitzsimmons construction on graphs that Theorem 3.14 compares against.","marker":"[KPP18b]"},{"why":"Gives the sharp discrete Hardy inequality on N0 whose line-graph case the graph theorems recover.","marker":"[KPP18a]"},{"why":"Contains the earlier Poincaré-Hardy inequalities on homogeneous trees that are reproved with the new method.","marker":"[BSV21]"},{"why":"Provides the weakly spherically symmetric graph machinery, including the radial Laplacian and the area representation of the Green's function.","marker":"[KLW21]"},{"why":"Supplies the discrete Agmon-Allegretto-Piepenbrink theorem and criticality criterion used in Lemma 3.3.","marker":"[KPP20b]"}],"fun_headline_variants":["No Green's function needed for optimal Hardy weights on graphs","Radial ansatz yields optimal Hardy weights without Green's function","u=r/area(r) gives optimal Hardy weights on graphs","Simple radial function beats classical Green's-function weight","Radial ansatz without Green's function gives optimal Hardy weights"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the curvature recurrence $\\kappa(r)\\ge 1/r+(1-1/r)\\kappa(r-1)$ for all $r\\ge 2$, together with $\\kappa(1)\\ge 2$ and boundedness of $\\kappa$; this is exactly what makes $u(r)=r/\\mathrm{area}(r)$ superharmonic, and without it the constructed weight is not known to be a Hardy weight and optimality is not proved.","fun_headline_variants_meta":{"raw":{"variants":["No Green's function needed for optimal Hardy weights on graphs","Radial ansatz yields optimal Hardy weights without Green's function","u=r/area(r) gives optimal Hardy weights on graphs","Simple radial function beats classical Green's-function weight","Radial ansatz without Green's function gives optimal Hardy weights"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000556,"raw_usage":{"total_tokens":2670,"prompt_tokens":995,"completion_tokens":1675,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":611,"completion_tokens_details":{"reasoning_tokens":1607}},"tokens_in":611,"tokens_out":1675,"duration_ms":13265,"temperature":1.0,"reasoning_tokens":1607,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-09T23:44:43.460237+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take a weakly spherically symmetric graph satisfying $\\kappa(1)\\ge 2$ and $\\kappa(r)\\ge 1/r+(1-1/r)\\kappa(r-1)$ with bounded $\\kappa$, and evaluate $E(\\varphi)-\\sum w_0\\varphi^2 m$ on the finitely supported function $\\varphi$ equal to 1 on one distance sphere and 0 elsewhere; if any such value is negative, $w_0$ is not a Hardy weight and Theorem 3.8 is false. A complementary check is to violate the recurrence at a single radius and watch whether $-\\Delta\\sqrt{u}$ turns negative there.","supporting_citations":[],"review_version":1}