An optimal Hardy-Littlewood-Sobolev inequality on Rn-k × Rn and its consequences
Abstract
For n > k ≥ 0, λ >0, and p, r>1, we establish the following optimal Hardy-Littlewood-Sobolev inequality \[ | Rn × Rn-k f(x) g(y) |x-y|λ |y"|β dx dy | \| f \| Lp( Rn-k) \| g\| Lr( Rn) \] with y = (y', y") ∈ Rn-k × Rk under the two necessary conditions \[ β < \ aligned & k - k/r & & if \; 0 < λ ≤ n-k,\\ & n - λ - k/r & & if \; n-k < λ, aligned . \] and \[ n-kn 1p + 1r + β + λ n = 2 - kn. \] We call this the optimal Hardy-Littlewood-Sobolev inequality on Rn-k × Rn. The existence of an optimal pair for this new inequality is also studied. The motivation of working on the above inequality is to provide a unification of many known Hardy-Littewood-Sobolev inequalities including the classical Hardy-Littewood-Sobolev inequality when k=β=0, the Hardy-Littewood-Sobolev inequality on the upper half space Rn-1 × R+n when k=1 and β = 0, and the Hardy-Littewood-Sobolev inequality on the upper half space Rn-1 × R+n with extended kernel when k=1 and β 0. We show that the above condition for β is sharp. In the unweighted case, namely β=0, our finding immediately leads to the sharp Hardy-Littlewood-Sobolev inequality on Rn-k × Rn with the optimal range 0<λ<n-k/r, which has not been observed before, even in the case k=1. As one of many consequences, we give a short proof of the Stein-Weiss inequality in the context of Rn-k × Rn.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.