2000 character limit reached
The Bellman functions of the Carleson Embedding Theorem and the Doob's martingale inequality
Published 20 Nov 2014 in math.CA and math.PR | (1411.5408v3)
Abstract: Evaluation of the Bellman functions is a difficult task. The exact Bellman functions of the dyadic Carleson Embedding Theorem 1.1 and the dyadic maximal operators are obtained in [3] and [4]. Actually, the same Bellman functions also work for the tree-like structure. In this paper, we give a self-complete proof of the coincidence of the Bellman functions on the more general infinitely refining filtered probability space, see Definition 1.3. The proof depends on a remodeling of the Bellman function of the dyadic Carleson Embedding Theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.