Mathematics > Classical Analysis and ODEs
[Submitted on 23 Jun 2026]
Title:Weighted Hardy Inequalities for Nested Averages
View PDF HTML (experimental)Abstract:We study a family of Hardy-type inequalities for weighted averages over nested subsets of a measure space. Given a partition of a measure space and a weight function $m$, we consider operators of the form \[ f \mapsto \frac{1}{M_n}\int_{X^{(n)}} m(x)f(x)\,\mathrm{d}\mu(x), \] with additional weights on the resulting sequence of averages. In particular, we generalize an inequality obtained by Vincent and Sohani in \cite{VincentSohani2025} and characterize the boundedness in terms of the finiteness of a single testing quantity $\beta$. We also provide two-sided estimates for the best constant $C_{\mathrm{opt}}$, namely \[ \beta \leq C_{\mathrm{opt}} \leq p^{1/q} (p')^{1/p'}\beta \leq 2\beta. \] Thus the characterization is never off by more than a factor of 2. We also develop a second approach, inspired by Broadbent's proof of Hardy's inequality, which gives a local sufficient condition that often provides sharper constants and recovers several important cases, including the classical weighted Hardy inequality.
Submission history
From: Pierre-Olivier Parise Pop [view email][v1] Tue, 23 Jun 2026 01:05:03 UTC (37 KB)
References & Citations
Loading...
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.