Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

An optimal Hardy-Littlewood-Sobolev inequality on $\mathbf R^{n-k} \times \mathbf R^n$ and its consequences (2009.09868v2)

Published 21 Sep 2020 in math.FA, math.AP, and math.CA

Abstract: For $n > k \geq 0$, $\lambda >0$, and $p, r>1$, we establish the following optimal Hardy-Littlewood-Sobolev inequality [ \Big| \iint_{\mathbf Rn \times \mathbf R{n-k}} \frac{f(x) g(y)}{ |x-y|\lambda |y"|\beta} dx dy \Big| \lesssim | f | {Lp(\mathbf R{n-k})} | g| _{Lr(\mathbf Rn)} ] with $y = (y', y") \in \mathbf R{n-k} \times \mathbf Rk$ under the two necessary conditions [ \beta < \left{ \begin{aligned} & k - k/r & & \text{if } \; 0 < \lambda \leq n-k,\ & n - \lambda - k/r & & \text{if } \; n-k < \lambda, \end{aligned} \right. ] and [ \frac{n-k}n \frac 1p + \frac 1r + \frac { \beta + \lambda} n = 2 -\frac kn. ] We call this the optimal Hardy-Littlewood-Sobolev inequality on $\mathbf R{n-k} \times \mathbf 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=\beta=0$, the Hardy-Littewood-Sobolev inequality on the upper half space $\mathbf R{n-1} \times \mathbf R+n$ when $k=1$ and $\beta = 0$, and the Hardy-Littewood-Sobolev inequality on the upper half space $\mathbf R{n-1} \times \mathbf R_+n$ with extended kernel when $k=1$ and $\beta \ne 0$. We show that the above condition for $\beta$ is sharp. In the unweighted case, namely $\beta=0$, our finding immediately leads to the sharp Hardy-Littlewood-Sobolev inequality on $\mathbf R{n-k} \times \mathbf Rn$ with the optimal range $$0<\lambda<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 $\mathbf R{n-k} \times \mathbf Rn$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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