On Sublevel Set Estimates and the Laplacian

Abstract

Carbery proved that if u:Rn → R is a positive, strictly convex function satisfying D2u ≥ 1, then we have the estimate | \x ∈ Rn: u(x) ≤ s \ | n sn/2 and this is optimal. We give a short proof that also implies other results. Our main result is an estimate for the sublevel set of functions u:[0,1]2 → R satisfying 1 ≤ u ≤ c for some universal constant c: for any α > 0, we have | \x ∈ [0,1]2 : |u(x)| ≤ \| c + α - 12 ∫[0,1]2|∇ u||u|α dx. For 'typical' functions, we expect the integral to be finite for α < 1. While Carbery-Christ-Wright have shown that no sublevel set estimates independent of u exist, this result shows that for 'typical' functions satisfying u ≥ 1, we expect the sublevel set to be 1/2-. We do not know whether this is sharp or whether similar statements are true in higher dimensions.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…