On weighted LpL^p-Hardy inequality on domains in Rn\mathbb{R}^n

preprint2021arXivOpen access

Abstract

We consider weighted LpL^p-Hardy inequalities involving the distance to the boundary of a domain in the nn-dimensional Euclidean space with nonempty boundary. Using criticality theory, we give an alternative proof of the following result of F.~G.~Avkhadiev (2006) Theorem: Let Ω⫋RnΩ\subsetneqq \mathbb{R}^n, n≥2n\geq 2, be an arbitrary domain, 1<p<∞1<p<\infty and α+p>nα+ p>n. Let dΩ(x)=dist(x,∂Ω)\mathrm{d}_Ω(x) =\mathrm{dist}(x,\partial Ω) denote the distance of a point x∈Ωx\in Ω to ∂Ω\partial Ω. Then the following Hardy-type inequality holds ∫Ω∣∇φ∣pdΩα dx≥(α+p−np)p∫Ω∣φ∣pdΩp+α dx∀φ∈Cc∞(Ω), \int_{Ω}\frac{|\nabla φ|^p}{\mathrm{d}_Ω^α}\,\mathrm{d}x \geq \left( \frac{α+p-n}{p}\right)^p \int_{Ω}\frac{|φ|^p}{\mathrm{d}_Ω^{p+α}}\,\mathrm{d}x \qquad \forall φ\in C^{\infty }_c(Ω), and the lower bound constant (α+p−np)p\left( \frac{α+p-n}{p}\right)^p is sharp.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.