Quantitative differentiation: A general formulation

Research output: Contribution to journalArticlepeer-review

Abstract

Let dx denote Lebesgue measure on ℝ n. With respect to the measure C = r -1 dr × dx on the collection of balls B r(x) ⊂ ℝ n, the subcollection of balls B r(x) ⊂ B 1(0) has infinite measure. Let f: B 1(0) → ℝ have bounded gradient, |∇f | ≤ 1. For any B r(x) ⊂ B 1(0) there is a natural scale-invariant quantity that measures the deviation of f |B r (x) from being an affine linear function. The most basic case of quantitative differentiation (due to Peter Jones) asserts that for all > 0, the measure of the collection of balls on which the deviation from linearity is ≥ is finite and controlled by, independent of the particular function f. The purpose of this paper is to explain the sense in which this model case is actually a particular instance of a general phenomenon that is present in many different geometric/analytic contexts. Essentially, in each case that fits the framework, to prove the relevant quantitative differentiation theorem, it suffices to verify that the family of relative defects is monotone and coercive. We indicate one recent application to theoretical computer science and others to partial regularity theory in geometric analysis and nonlinear PDEs.

Original languageEnglish (US)
Pages (from-to)1641-1670
Number of pages30
JournalCommunications on Pure and Applied Mathematics
Volume65
Issue number12
DOIs
StatePublished - Dec 2012

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Quantitative differentiation: A general formulation'. Together they form a unique fingerprint.

Cite this