由平方函数估计产生的障碍问题
Obstacle problems generated by the estimates of square function
摘要:
本文给出了与B. 1976年,戴维斯在\cite{Davis}。本文考虑并元平方函数算子$S$的$\|Sf\|_p \le C_p \|f\|_p$型估计,即$p\ge 2$,Davis发现了常数$C_p$的精确值.然而,随着尖锐的常数,人们可以考虑上述估计的一个更微妙的特征。这个数量被称为贝尔曼函数的问题,它似乎对我们来说,这是从来没有证明,汇合型超几何函数从戴维斯的文件(第二页)基本上给这个贝尔曼函数。在这里,我们通过找到运算符$S$的未加权$L^p$估计的精确Bellman函数来填补这一空白。我们用障碍问题的语言进行证明。为了比较,我们还找到了$S$的弱$(1,1)$估计的Bellman函数.这个公式是由Bollobas \cite{Bollobas}提出的,并由Osekowski \cite{Os2009}证明,所以它并不新,但我们喜欢强调这两个贝尔曼函数描述的共同方法。
英文摘要:
In this note we give the formula for the Bellman function associated with the problem considered by B. Davis in \cite{Davis} in 1976. In this article the estimates of the type $\|Sf\|_p \le C_p \|f\|_p$, $p\ge 2$, were considered for the dyadic square function operator $S$, and Davis found the sharp values of constants $C_p$. However, along with the sharp constants one can consider a more subtle characteristic of the above estimate. This quantity is called the Bellman function of the problem, and it seems to us that it was never proved that the confluent hypergeometric function from Davis' paper (second page) basically gives this Bellman function. Here we fill out this gap by finding the exact Bellman function of the unweighted $L^p$ estimate for operator $S$. We cast the proofs in the language of obstacle problems. For the sake of comparison, we also find the Bellman function of weak $(1,1)$ estimate of $S$. This formula was suggested by Bollobas \cite{Bollobas} and proved by Osekowski \cite{Os2009}, so it is not new, but we like to emphasize the common approach to those two Bellman functions descriptions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。