
A geometrical version of Hardy’s inequality for \stackrel{∘}𝑊^{1,𝑝}(Ω)
Author(s) -
Jesper Tidblom
Publication year - 2004
Publication title -
proceedings of the american mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.968
H-Index - 84
eISSN - 1088-6826
pISSN - 0002-9939
DOI - 10.1090/s0002-9939-04-07526-4
Subject(s) - algorithm , artificial intelligence , computer science
The aim of this article is to prove a Hardy-type inequality, concerning functions in W ∘ 1 , p ( Ω ) \stackrel {\circ }{\textrm {W}}{\!}^{1,p}(\Omega ) for some domain Ω ⊂ R n \Omega \subset R^n , involving the volume of Ω \Omega and the distance to the boundary of Ω \Omega . The inequality is a generalization of a recently proved inequality by M. Hoffmann–Ostenhof, T. Hoffmann–Ostenhof and A. Laptev (2002), which dealt with the special case p = 2 p=2 .