Maz’ya’s Problem 8 on the capacitary-distance Hardy inequality

Let n≥3n\ge 3. For every open set Ω⊂Rn\Omega\subset\mathbb{R}^n, set F:=Rn∖ΩF:=\mathbb{R}^n\setminus\Omega and, for 0<α≤10<\alpha\le 1 and x∈Ωx\in\Omega, define dα(x):=inf⁡{r>0:cap⁡(F∩B(x,r)‾)≥αcap⁡(B(0,r))}d_\alpha(x):=\inf\{r>0:\operatorname{cap}(\overline{F\cap B(x,r)})\ge\alpha\operatorname{cap}(B(\mathbf{0},r))\}. Determine the optimal dependence on α\alpha of the least constant Cn(α)C_n(\alpha) such that, for every such Ω\Omega and every u∈Cc∞(Ω)u\in C_c^\infty(\Omega), ∫Ω∣u(x)∣2/dα(x)2 dx≤Cn(α)∫Ω∣∇u(x)∣2 dx\int_\Omega |u(x)|^2/d_\alpha(x)^2\,dx\le C_n(\alpha)\int_\Omega |\nabla u(x)|^2\,dx. Equivalently, determine the sharp order of Cn(α)C_n(\alpha) as α↓0\alpha\downarrow0; the claimed resolution is Cn(α)≍nα−2C_n(\alpha)\asymp_n\alpha^{-2}.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

A new unrefereed preprint claims to settle the problem and determine the best dependence on the capacity parameter, but the result has not been independently checked.

Maz’ya’s Problem 8 asks for a capacitary-distance Hardy inequality with optimal dependence on the capacity parameter. The latest source claims a complete resolution.

August 27, 2026 preprint claims optimal dependence

The preprint Capacitary-Distance Hardy Inequality claims a bound with constant On(α−2)O_n(\alpha^{-2}) and constructs domains showing that this dependence on α\alpha is sharp. If correct, this settles the stated problem and identifies the optimal order.

Current status (as of August 2026): An unrefereed preprint claims the problem is solved with sharp On(α−2)O_n(\alpha^{-2}) dependence, but independent verification is not recorded.

Sources

Solutions 0

No solutions have been posted yet.