Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fractional Hardy inequalities on $C^{1,1}$ open sets

Published 11 Feb 2026 in math.AP | (2602.10463v1)

Abstract: Let $Ω$ be a bounded open set of class $C{1,1}$ in $\mathbb{R}N$ and $s\in(\frac{1}{2}, 1)$. We study a family of fractional Hardy-type inequalities \begin{equation} \frac{c_{N,s}}{2}\displaystyle\iint_{Ω\timesΩ}\frac{(u(x)-u(y))2}{|x-y|{N+2s}}\ dxdy-\displaystyleλ\int_Ωu2\ dx\geq C\displaystyle\int_Ω\frac{u2}{δ{2s}}\ dx,~\quad\forallλ\in\mathbb{R},~~~~~(0.1) \end{equation} with $u\in C_c\infty(Ω)$ and $C=C(Ω,s,N,λ)>0$. We show that the best constant in $(0.1)$ is achieved if and only if $λ>λ*(s,Ω)$, for some $λ*(s,Ω)\in\mathbb{R}$. As a by-product, we derive in particular that the best constant in Hardy inequality $μ{N,s}(Ω)$ is achieved if and only if $μ{N,s}(Ω)<\mathfrak{h}{N,s}$, with $\mathfrak{h}{N,s}$ being the best constant for the fractional Hardy inequality in the half space. Moreover, if $Ω$ is a convex open set, we obtain a lower bound for $λ*(s,Ω)$ in terms of the volume of $Ω$. Specifically, we prove that $λ*(s,Ω)\geq a(N,s)|Ω|{-\frac{2s}{N}}$ with an explicit constant $a(N,s)>0$. For general bounded $C{1,1}$ open sets, we prove instead that $λ*(s,Ω)\geq0$ when $s$ is close to $\frac{1}{2}$. The aforementioned result is proved after showing that $μ{N,s}(Ω)=\mathfrak{h}{N,s}$ for $s$ close to $\frac{1}{2}$. In particular, we deduce that, whenever $s$ is sufficiently close to $\frac{1}{2}$, the Hardy constant $μ_{N,s}(Ω)$ is never achieved, hence, behaves differently from that in the local case. This result is completely new in the fractional setting, and was known only for convex open sets for the full range $s\in(\frac{1}{2}, 1)$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.