Let $X \subset \mathbb{R}^{n}$ be compact and convex. Moreover, let $f:X \rightarrow \mathbb{R}$ be a differentiable map with $\sup_{x \in X} \|\nabla f(x)\| = K < \infty$, where $\|\cdot\|$ denotes the Euclidean norm and $\nabla f$ the gradient.

Both in this question and in this webpage it is said that the best (minimal) Lipschitz constant of $f$ is $K$. If this is a basic result in real analysis, could someone please point me to a reference?


closed as off-topic by Nik Weaver, Piotr Hajlasz, abx, Alexandre Eremenko, Jan-Christoph Schlage-Puchta Jan 13 at 11:47

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "MathOverflow is for mathematicians to ask each other questions about their research. See Math.StackExchange to ask general questions in mathematics." – Nik Weaver, Piotr Hajlasz, abx
If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ Undoubtedly this is in Geometric Measure Theory by Federer. But I think this question belongs on math.stackexchange. $\endgroup$ – Nik Weaver Jan 11 at 14:49
  • 2
    $\begingroup$ It may be hard to find the proof in a textbook, but you can prove it yourself by taking a point $x$ with $\|\nabla f(x) \|\geq K-\varepsilon$ and finding a $y$ with $|f(y)-f(x)| \geq (K-2\varepsilon)|y-x|$ using the definition of differentiability at $x$. $\endgroup$ – Stanley Snelson Jan 11 at 15:00
  • $\begingroup$ @StanleySnelson: you have to check the reverse inequality too, which is where convexity comes in: any two points are joined by a line segment and you can apply the one-dimensional mean value theorem. $\endgroup$ – Nik Weaver Jan 11 at 15:54
  • 2
    $\begingroup$ You know what, come to think of it, there's a proof of this in a book I just wrote ... $\endgroup$ – Nik Weaver Jan 11 at 15:59

This is essentially Corollary 1.42 in my book Lipschitz Algebras (second edition).


Not the answer you're looking for? Browse other questions tagged or ask your own question.