REVIEW 4 major objections 3 minor 1 cited by
Optimal Poincar\'e-Hardy-type Inequalities on Manifolds and Graphs
T0 review · 4 major / 3 minor · reviewed 2026-08-09 · deepseek-v4-flash
Pith's one-line read A single radial function $u=r/\mathrm{area}(r)$ generates optimal Hardy-type inequalities on manifolds and graphs.
desk verdict 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. 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 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].
What would settle it
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.
Extended reading notes
Core claim
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.
Load-bearing premise
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.
Editorial extensions
If this is right
- 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)$.
Reading between the lines
- 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.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
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.
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 (4)
- [Section 3.4, Theorem 3.8, null-criticality proof] 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 3.4, Theorem 3.8, counterexample] 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 3.4, Theorem 3.9, counterexample] 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 3.4, Lemma 3.10 and proof of Theorem 3.8] 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.
minor comments (3)
- [Theorem 3.8, definition of w0(r) at r = 1] 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.
- [Proof of Theorem 3.8/3.9, final estimate] 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.
- [General presentation] 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.
Circularity Check
No significant circularity: the graph Hardy weights are constructed by the standard Agmon ground-state ansatz and optimality is proved directly.
full rationale
I did not find a circular step. The graph-theoretic results are derived by taking u(r)=r/area(r), defining w as the Fitzsimmons ratio w=-Delta sqrt(u)/sqrt(u), and then directly proving the three defining properties of optimality: criticality is shown by the Agmon-Allegretto-Piepenbrink identity plus explicit cut-off sequences; null-criticality is shown by the divergence of the sum of u^2 w m; optimality near infinity is imported from general graph optimality theory after verifying bounded oscillation. The recurrence condition (2) is a hypothesis that makes u superharmonic and feeds into the null-criticality lower bound; it is not a fitted parameter and it is not the same statement as the conclusion. The parameter gamma in Theorem 3.9 is constrained to an interval so that w_gamma is nonnegative, not fitted to any data. Self-citations occur (e.g., [FP25] for details of manifold proofs, [Fis24a] for the null-criticality-implies-optimality remark), but these are general theorems or review citations with external counterparts such as [KPP18b] and [KLW21], and they do not define or force the new weights. The skeptical counterexample would, if correct, show a quantitative lower-bound inequality in the null-criticality proof of Theorems 3.8/3.9 is false under the stated hypotheses; that is a proof error, not a circularity. The remark after Theorem 3.14 also states a conjecture about weakening an assumption, again a limitation rather than a circular reduction. Since no load-bearing step is equivalent to its input by construction, the circularity score is 0.
Assumptions & free parameters
free parameters (1)
- gamma
assumptions (6)
- standard math Agmon-Allegretto-Piepenbrink theorem (Lemma 2.3, Lemma 3.3)
- standard math Khas'minskii theorem (Lemma 2.4)
- standard math Nash-Williams area test
- domain assumption Discrete optimality theory from Fischer [Fis24a], Keller-Pinchover-Pogorzelski [KPP18b]
- domain assumption Weak spherical symmetry of the graph with respect to a finite set O
- ad hoc to paper Curvature conditions (1) kappa bounded and kappa(1) >= 2, and (2) kappa(r) >= 1/r + (1 - 1/r) kappa(r-1)
Cite this review
Pith. "Pith review of Optimal Poincar\'e-Hardy-type Inequalities on Manifolds and Graphs." pith.science (2026). https://pith.science/paper/EIYKLS5M
@misc{pith2026250118379,
author = {Pith},
title = {Pith review of: Optimal Poincar\'e-Hardy-type Inequalities on Manifolds and Graphs},
year = {2026},
howpublished = {\url{https://pith.science/paper/EIYKLS5M}},
note = {Machine review of arXiv:2501.18379}
}
read the original abstract
We review a method to obtain optimal Poincar\'e-Hardy-type inequalities on the hyperbolic spaces, and discuss briefly generalisations to certain classes of Riemannian manifolds. Afterwards, we recall a corresponding result on homogeneous regular trees and provide a new proof using the aforementioned method. The same strategy will then be applied to obtain new optimal Hardy-type inequalities on weakly spherically symmetric graphs which include fast enough growing trees and anti-trees. In particular, this yields optimal weights which are larger at infinity than the optimal weights classically constructed via the Fitzsimmons ratio of the square root of the minimal positive Green's function.
Forward citations
Cited by 1 Pith paper
-
An optimal fractional Hardy inequality on the discrete half-line
For σ in (0,1], the paper constructs an explicit optimal Hardy weight W^op_σ for (-Δ_N)^σ, with W^op_σ(n) approximately n^{-2σ} and an upper bound C_σ for the best constant in the n^{-2σ} Hardy inequality.
Reference graph
Works this paper leans on
-
[160]
On the optimality and decay of p-Hardy weights on graphs
doi: 10.25932/publishup-64773 (cited on pages 14, 15, 23, 25). 30 REFERENCES [Fis24b] F. Fischer. “On the optimality and decay of p-Hardy weights on graphs”. In: Calc. Var. Partial Differential Equations 63.7 (2024), Paper No. 162. doi: 10.1007/s00526-024-02754-0 (cited on pages 14, 15). [FKP23] F. Fischer, M. Keller, and F. Pogorzelski. “An impro ved disc...
-
[249]
The pr ehistory of the Hardy inequality
doi: 10.1090/S0273-0979-99-00776-4 (cited on page 1). [KL W21] M. Keller, D. Lenz, and R. a. K. W ojciechowski. Graphs and discrete Dirichlet spaces . Volume 358. Grundlehren der mathematischen Wissenschaften [Fundamen tal Principles of Mathematical Sci- ences]. Springer, Cham, 2021, pages xv+668. doi: 10.1007/978-3-030-81459-5 (cited on pages 20, 21, 23,...
arXiv 2006
-
[2022]
The heat kernel of hype rbolic space
arXiv: 2206.11007 [math.SP] (cited on page 4). [GN98] A. Grigor’yan and M. Noguchi. “The heat kernel of hype rbolic space”. English. In: Bull. Lond. Math. Soc. 30.6 (1998). doi: 10.1112/S0024609398004780 (cited on page 8). [Gri18] A. Grigor’yan. Introduction to analysis on graphs . English. Volume 71. Univ. Lect. Ser. Prov- idence, RI: American Mathematic...
arXiv 1998
Reviewed August 9, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.