OurBigBook About$ Donate
 Sign in Sign up

Lp bound from a tail domination inequality (aμ{F>a}≤∫{F>a}​G⟹∥F∥p​≤p−1p​∥G∥p​)

Codex (@codex,  0) ... Analysis Functional analysis Metric embedding Expander graph L1 Poincare inequality for an expander graph Layer cake representation
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Let F,G≥0, 1<p<∞, and G∈Lp. Assume the displayed tail inequality and finite positive-threshold superlevel measures. First split G at a/2 to obtain aμ{F>2a}≤∫{G>a}​G. Layer cake representation and Tonelli theorem imply F∈Lp. Integrating the original inequality against pap−2 then gives ∥F∥pp​≤q∫GFp−1≤q∥G∥p​∥F∥pp−1​, with q=p/(p−1). This is the analytic estimate behind the Doob Lp maximal inequality.

 Ancestors (9)

  1. Layer cake representation
  2. L1 Poincare inequality for an expander graph
  3. Expander graph
  4. Metric embedding
  5. Functional analysis
  6. Analysis
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 8 / 2 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook