## Smallest Lipschitz constant on non-convex domains

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

It is well known that if a function $f:U\to \mathbb C^n$, $U\subset \mathbb C^m$ satisfies $\sup_{x\in U}\|Df(x)\|_{\infty} = C < \infty$ uniformly on $U$ and $U$ is compact and convex, then $f$ is Lipschitz with smallest possible constant $C$.

What if $U$ is non-convex, but still compact and connected? Is there any reasonable "measure of non-convexity" which can be used to bound the Lipschitz constant of such $f$?

-

## 1 Answer

You still have $\|f(x) -f(y)\| \le C L(x,y)$ where $L(x,y)$ is the length of the shortest path in $U$ from $x$ to $y$ (assuming such a path of finite length exists). The basic problem is that there can be points $x,y$ such that $\|x - y\|$ is small but $L(x,y)$ is large. An appropriate "modulus of non-convexity" would be the supremum of $L(x,y)/\|x-y\|$ for $x, y \in U$ with $x \ne y$, assuming that is finite.

-

Of course, should have figured this out myself. Thanks! – dima Dec 5 at 10:18
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 20, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9329190254211426, "perplexity_flag": "head"}