Skip to content

Capacitary-Distance Hardy Inequality

Yiqun Chen, Jie Xiao, Dachun Yang, Wen Yuan, Yangyang Zhang

math.CAarXiv:2608.26663

Abstract

Let n3, Ω⊂ Rn be an open set, F:= RnΩ, and α∈(0,∞). For any x∈Ω, we define the capacitary distance align* dα(x) := ∈f\ r>0: cap(F B(x,r)) αcap(B(0,r)) \. align* In this article, we prove that there exists a positive constant Cn, depending only on n, such that, for any α∈(0,1] and any u∈ Cc∞(Ω), align* ∫Ω|u(x)|2dα(x)2\,d x Cnα2 ∫Ω|∇ u(x)|2\,d x. align* This gives an affirmative answer to Problem 8 of Maz'ya [25]. Moreover, this dependence on α is sharp: there exists a positive constant cn, depending only on n, such that, for every α∈(0,1], we are able to construct a bounded connected domain Ωα on which the optimal constant in the above Hardy inequality is at least cnα2. The proof combines a variable-time semigroup estimate for the killed Brownian motion with finite-time exit estimates derived from capacity.

Create a lesson