Sharpness of Lenglart's domination inequality and a sharp monotone version
Abstract
We prove that the best so far known constant cp=p-p1-p,\, p∈(0,1) of a domination inequality, which originates to Lenglart, is sharp. In particular, we solve an open question posed by Revuz and Yor. Motivated by the application to maximal inequalities, like e.g. the Burkholder-Davis-Gundy inequality, we also study the domination inequality under an additional monotonicity assumption. In this special case, a constant which stays bounded for p near 1 was proven by Pratelli and Lenglart. We provide the sharp constant for this case.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.