2000 character limit reached
The sharp discrete Hardy inequality on
Published 26 Aug 2026 in math.FA, math.AP, and math.SP | (2608.25262v1)
Abstract: We determine the sharp constant in the nearest-neighbor Hardy inequality on with the Euclidean inverse-square weight. For every finitely supported function $u:\Z<sup>3\to\C$, we prove [ \sum_{x\in\Z3}\sum_{j=1}3 |u(x+e_j)-u(x)|2 \geq \frac14\sum_{x\in\Z3\setminus{0}} \frac{|u(x)|2}{|x|2}. ] The coefficient $1/4$ is sharp, and equality is not attained by a nonzero finitely supported function. The proof uses an explicit reciprocal edge field and an edgewise completion of squares, together with a concavity argument for the associated vertex weight.
Paper Prompts
Sign up for free to create and run prompts on this paper.