arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.07532math.CA
收藏

Hardy不等式在二元树上的Bellman函数

Bellman function for Hardy's inequality over dyadic trees

Michelangelo Cavina

AI总结:

本文利用Bellman函数技术刻画了二元树上加权Hardy不等式成立的测度,证明了相关常数的最优性,并给出了Bellman函数的随机最优控制解释。

摘要:

本文利用Bellman函数技术来刻画使加权Hardy不等式在二元树上成立的测度。我们阐述了二元树上的(对偶)Hardy不等式,并利用相关的“Burkholder型”函数来找到证明该结果所需的主要不等式。我们阐述了一个满足所需性质的“Bellman型”函数,并利用Bellman函数技术证明了本文的主要结果。我们通过一个极值映射族的显式例子证明了相关常数的最优性。我们还给出了相应Bellman函数在随机最优控制理论中的显式解释。

英文摘要:

In this article we use the Bellman function technique to characterize the measures for which the weighted Hardy's inequality holds on dyadic trees. We enunciate the (dual) Hardy's inequality over the dyadic tree and we use the associated "Burkholder-type" function to find the main inequality required in the proof of the result. We enunciate a "Bellman-type" function satisfying the required properties and we use the Bellman function technique to prove the main result of this article. We prove the optimality of the associated constant with an explicit example of an extremal family of maps. We also give an explicit interpretation of the corresponding Bellman function in terms of the theory of stochastic optimal control.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑