%~Mouliné par MaN_auto v.0.40.4 (2aa04cce) 2026-03-27 10:19:27 \documentclass[CRMATH,Unicode,biblatex]{cedram} \TopicFR{\'Equations aux dérivées partielles} \TopicEN{Partial differential equations} \addbibresource{CRMATH_Labourie_20250791.bib} \usepackage{mathtools} \newcommand{\R}{\mathbb{R}} \newcommand{\C}{\mathbb{C}} \newcommand{\HH}{\mathcal{H}} \DeclareMathOperator{\dist}{dist} \newcommand{\dif}{\mathop{}\!{\operatorfont{d}}} %%%--------------------------------------------------------------------------- %%% BAR & OVERLINE %%% Better widebar macro \let\oldoverline\overline \makeatletter \let\save@mathaccent\mathaccent \newcommand*\if@single[3]{% \setbox0\hbox{${\mathaccent"0362{#1}}^H$}% \setbox2\hbox{${\mathaccent"0362{\kern0pt#1}}^H$}% \ifdim\ht0=\ht2 #3\else #2\fi } %The bar will be moved to the right by a half of \macc@kerna, which is computed by amsmath: \newcommand*\rel@kern[1]{\kern#1\dimexpr\macc@kerna} %If there's a superscript following the bar, then no negative kern may follow the bar; %an additional {} makes sure that the superscript is high enough in this case: \newcommand*\widebar[1]{\@ifnextchar^{{\wide@bar{#1}{0}}}{\wide@bar{#1}{1}}} %Use a separate algorithm for single symbols: \newcommand*\wide@bar[2]{\if@single{#1}{\wide@bar@{#1}{#2}{1}}{\wide@bar@{#1}{#2}{2}}} \newcommand*\wide@bar@[3]{% \begingroup \def\mathaccent##1##2{% %Enable nesting of accents: \let\mathaccent\save@mathaccent %If there's more than a single symbol, use the first character instead (see below): \if#32 \let\macc@nucleus\first@char \fi %Determine the italic correction: \setbox\z@\hbox{$\macc@style{\macc@nucleus}_{}$}% \setbox\tw@\hbox{$\macc@style{\macc@nucleus}{}_{}$}% \dimen@\wd\tw@ \advance\dimen@-\wd\z@ %Now \dimen@ is the italic correction of the symbol. \divide\dimen@ 3 \@tempdima\wd\tw@ \advance\@tempdima-\scriptspace %Now \@tempdima is the width of the symbol. \divide\@tempdima 10 \advance\dimen@-\@tempdima %Now \dimen@ = (italic correction / 3) - (Breite / 10) \ifdim\dimen@>\z@ \dimen@0pt\fi %The bar will be shortened in the case \dimen@<0 ! \rel@kern{0.6}\kern-\dimen@ \if#31 \oldoverline{\rel@kern{-0.6}\kern\dimen@\macc@nucleus\rel@kern{0.4}\kern\dimen@}% \advance\dimen@0.4\dimexpr\macc@kerna %Place the combined final kern (-\dimen@) if it is >0 or if a superscript follows: \let\final@kern#2% \ifdim\dimen@<\z@ \let\final@kern1\fi \if\final@kern1 \kern-\dimen@\fi \else \oldoverline{\rel@kern{-0.6}\kern\dimen@#1}% \fi }% \macc@depth\@ne \let\math@bgroup\@empty \let\math@egroup\macc@set@skewchar \mathsurround\z@ \frozen@everymath{\mathgroup\macc@group\relax}% \macc@set@skewchar\relax \let\mathaccentV\macc@nested@a %The following initialises \macc@kerna and calls \mathaccent: \if#31 \macc@nested@a\relax111{#1}% \else %If the argument consists of more than one symbol, and if the first token is %a letter, use that letter for the computations: \def\gobble@till@marker##1\endmarker{}% \futurelet\first@char\gobble@till@marker#1\endmarker \ifcat\noexpand\first@char A\else \def\first@char{}% \fi \macc@nested@a\relax111{\first@char}% \fi \endgroup } \makeatother \let\oldbar\bar \renewcommand*{\overline}[1]{{\mathchoice{\widebar{#1}}{\widebar{#1}}{\widebar{#1}}{\oldbar{#1}}}} %%%--------------------------------------------------------------------------- %%% DELIMITERS \DeclarePairedDelimiter{\parens}{\lparen}{\rparen} \DeclarePairedDelimiter{\braces}{\{}{\}} \DeclarePairedDelimiter{\abs}{\lvert}{\rvert} \DeclarePairedDelimiter{\norm}{\lVert}{\rVert} %%%--------------------------------------------------------------------------- %%% ENVIRONEMENTS %%% Env. {step} \newcounter{step} \newenvironment{step}[1]{\refstepcounter{step}\begin{proof}[{Step~\thestep: #1}]}{\let\qed\relax\end{proof}} %%%--------------------------------------------------------------------------- %%% VERTICAL BAR %%% ''Such that'' macro \newcommand*{\st}[1][]{\;#1\vert\;} %%%--------------------------------------------------------------------------- \graphicspath{{./figures/}} \newcommand*{\mk}{\mkern -1mu} \newcommand*{\Mk}{\mkern -2mu} \newcommand*{\mK}{\mkern 1mu} \newcommand*{\MK}{\mkern 2mu} \hypersetup{urlcolor=purple, linkcolor=blue, citecolor=red} \title{Finite number of traces for Mumford--Shah minimizers in dimension~2} \alttitle{Nombre fini de traces pour les minimiseurs de Mumford--Shah en dimension~2} \author{\firstname{Camille} \lastname{Labourie}} \address{Université de Lorraine, CNRS, IECL, F-54000 Nancy, France} \email{camille.labourie@univ-lorraine.fr} \author{\firstname{Antoine} \lastname{Lemenant}} \address[1]{Université de Lorraine, CNRS, IECL, F-54000 Nancy, France} \email{antoine.lemenant@univ-lorraine.fr} \keywords{\kwd{Mumford--Shah functional} \kwd{free discontinuity problems} \kwd{John domains}} \altkeywords{\kwd{Fonctionnelle de Mumford--Shah} \kwd{problèmes à discontinuité libre} \kwd{domaines de John}} \subjclass{49Q20, 35B65, 74G65, 74R10} \begin{abstract} In this short note, we answer a question raised by E.~De~Giorgi, showing that a Mumford--Shah minimizer in dimension~2 can admit at most three limit values as approaching the singular set. This result actually stems from tools developed in the early 2000s by G.~David, A.~Bonnet, and J.-C.~L\'eger. \end{abstract} \begin{altabstract} Dans cette courte note, nous répondons à une question soulevée par E.~De~Giorgi, en montrant qu’un minimiseur de Mumford--Shah en dimension~2 peut admettre au plus trois valeurs limites à l’approche de l’ensemble singulier. Ce résultat découle d’outils développés au début des années 2000 par G.~David, A.~Bonnet et J.-C.~Léger. \end{altabstract} \COI{The authors do not work for, advise, own shares in, or receive funds from any organization that could benefit from this article, and have declared no affiliations other than their research organizations.} \begin{document} %\input{CR-pagedemetas} %\end{document} \maketitle \section{Introduction} Let $\Omega \subset \R^N$ be open and $g\in L^\infty(\Omega)$. We say that $(u,K)$ is a Mumford--Shah minimizer when it is a solution for the problem \begin{equation}\label{MSprob} \min_{(u,K)} \int_{\Omega \setminus K} \abs{\nabla u}^2 \dif x + \int_{\Omega \setminus K} \abs{u-g}^2 \dif x + \mathcal{H}^{N-1}(K), \end{equation} where the minimum is taken over all $K\subset \Omega$ relatively closed, and $u \in H^1(\Omega \setminus K)$. The Mumford--Shah problem is a cornerstone in the study of free discontinuity problems within the calculus of variations, garnering significant attention since the 1990s. A central aspect of this research is the Mumford--Shah conjecture, which proposes a precise characterization of the structure of minimizers, predicting that the singular set is a (locally) finite union of $C^1$ arcs that are almost-disjoint, and whose extremities can be either free (crack-tips) or triple junctions. We refer to the books~\cite{afp,d,delF} for an introduction to the Mumford--Shah functional. In his famous 1991 paper~\cite{dg91}, E.~De~Giorgi has stated a list of nine conjectures about free discontinuity problems. After 34 years, most of them are still unsolved. Actually, to the best of the authors' knowledge, only Conjectures~1 and~3 are known to be true. Conjecture~1 deals with the higher integrability of the gradient, and was established by C.~De~Lellis and M.~Focardi~\cite{delF1} in dimension~2 and then by G. De~Philippis and A.~Figalli~\cite{DPF} in any dimension. Conjecture~3 follows from the $C^1$ regularity result of L.~Ambrosio, N.~Fusco and D.~Pallara~\cite{afpArt}. Conjecture~6 is a generalization of the Mumford--Shah conjecture in higher dimensions. The present note concerns Conjecture~2. Indeed, among the list of E.~De~Giorgi's open questions~\cite{dg91}, one can find the following one about the number of possible traces for $u$ when approaching the singular set $K$. \begin{conj}[{E.~De~Giorgi~\cite[p.~56, Conjecture~2]{dg91}}]\label{conjecture} If $(u,K)$ is a minimizing pair of the functional in~\eqref{MSprob}, and if we set \[ E(x)=\bigcap \braces[\big]{C \;:\; \textnormal{$C\subset \R$ closed set such that $\textstyle\lim_{y\to x} \dist\parens[\big]{u(y),C}=0$}}, \] then, for every $x\in \Omega$, $E(x)$ has a finite cardinality $\alpha(x)\leq N+1$. \end{conj} Of course outside $K$ the function $u$ is continuous so that $\alpha(x)=1$. The question is therefore relevant only for points $x\in K$. In other words, the conjecture says that $u$ must admit a finite number of traces up to the singular set. Moreover, if the Mumford--Shah conjecture is true in dimension~2, then this number must be at most $3$, which occurs only at a triple point. This explains the conjectured bound $\alpha(x)\leq N+1$. In this note, we prove that the conjecture holds in dimension~2. Here is our main result. \begin{theo}\label{main} If $N=2$, then Conjecture~\ref{conjecture} is true. \end{theo} Actually, the ingredients we use to prove Theorem~\ref{main} are mainly drawn from the works of G.~David, particularly his book~\cite{d}, his paper with A.~Bonnet~\cite{DavidBonnet}, and another paper with J.-C.~L\'eger~\cite{dleger}. However, the full argument requires assembling several statements, together with a few additional ones, so that a specific and complete proof is actually not directly available in the literature. The aim of these notes is to fill the gaps and provide the necessary details. Let us explain the scheme of proof for Theorem~\ref{main}, along with the plan of the present note. In~\cite{DavidBonnet}, it is proven that for a global Mumford--Shah minimizer $(u,K)$ in the plane, the connected components of $\R^2 \setminus K$ are John domains with center at infinity. A local version of this result is also available in G.~David's book~\cite{d} (see Proposition~\ref{prop1} below), which provides the existence of ``escape paths'' in $\Omega \setminus K$ for a Mumford--Shah minimizer. This notion, sometimes called local-John condition, is akin to, but weaker than, saying that the components of $\Omega \setminus K$ are John domains. The existence of escape paths has a key implication for Mumford--Shah minimizers: $u$ satisfies Hölder estimates up to the singular set $K$. Combined with the local finiteness of components (see Proposition~\ref{prop2}), this already proves that $\alpha(x)$ is bounded by a universal constant. But using another powerful result from G.~David and J.-C.~L\'eger~\cite{dleger}, we can go further and actually conclude that $\alpha(x)\leq 3$. Indeed, assuming for contradiction that $B(x_0,r)\setminus K$ contains more than three connected components, one can proceed to a blow-up limit and thanks to the local John-domain condition, the number of connected components is preserved in the limit (see Proposition~\ref{prop3}). The main result in~\cite{dleger} then directly implies that at most three components are allowed, and so follows the conclusion. This achieves the plan of proof for Theorem~\ref{main}. We point out that a Hölder estimate similar to that of Proposition~\ref{prop2} also appears in~\cite[Proposition~4.6.1]{delF1} in the setting of global minimizers. From that result, Theorem~\ref{main} for global minimizers could be readily deduced, thus providing a possible alternative approach to the proof of our main result. As a byproduct of the proof, we will show the following interesting statement (which is given by Proposition~\ref{prop3}). \begin{theo}\label{main1} Let $N=2$ and let $(u,K)$ be a Mumford--Shah minimizer in $\Omega$. Then for all $x_0\in K$ and $r > 0$ such that $B(x_0,r) \subset \Omega$, there are at most three connected components of $B(x_0,r) \setminus K$ whose closure contains $x_0$. \end{theo} To finish the introduction, let us say a few words about open questions. The conjecture in higher dimensions $N\geq 3$ remains widely open. The first issue is that the existence of escape paths relies on the local finiteness of the components of $\Omega \setminus K$, which is unknown in dimension higher than $2$. It is actually an open question asked by G.~David in~\cite[end of p.~368]{d}. Then David--Léger's result (Theorem~\ref{davLe} below) relies on a monotonicity formula that has, up to now, no analogue in higher dimensions. All of these missing ingredients lead us to believe that the higher-dimensional conjecture seems out of reach for the moment, even for the particular case $N=3$ for which the list of minimal cones is known. \section{Escape paths and finite number of components} One of the main ingredient of this section is the existence of escape paths that was proved in~\cite[p.~473, Proposition~16]{d}. This property means that from every point starts an arclength-parametrized path which gets away linearly from $K$. It is a local version of a similar result that was first proved in~\cite{DavidBonnet} for global minimizers. We refer to~\cite{DavidBonnet} for the proof.\footnote{To be more precise, in~\cite{DavidBonnet} the statement is given for a so-called ``topological almost MS-minimizer with gauge $h$''. Proposition~\ref{prop1} follows from applying~\cite[p.~473, Proposition~16]{d} to a Mumford--Shah minimizer, which is a particular case of topological almost MS-minimizer with gauge $h(r)=2\norm{g}^2_{\infty}r$.} \begin{prop}[{\cite[p.~473, Proposition~16]{d}}]\label{prop1} Let $N=2$ and let $(u,K)$ be a Mumford--Shah minimizer. There is a constant $\tau > 0$ (which only depends on $\norm{g}_{\infty}$) and a universal constant $c_0 >0$ such that the following holds. For all $x\in \Omega \setminus K$ and $t_0\in \parens[\big]{0, \min\parens[\big]{\dist(x,\partial \Omega),\tau}}$, there exists a $1$-Lipschitz mapping $z \colon [0,t_0]\to \Omega \setminus K$ such that $z(0)=x$ and \begin{equation}\label{lowcurve} \dist\parens[\big]{z(t),K}\geq c_0 t \quad \text{for $t\in [0,t_0]$}. \end{equation} \end{prop} In the sequel, we restrict the name ``escape path'' to the paths that satisfy~\eqref{lowcurve} with the precise constant $c_0$. In contrast to John domains, a component of $\Omega \setminus K$ may not have a common center where all points are connected to by an escape path. From a same point $x \in \Omega \setminus K$ can start several escape paths which connect $x$ to different centers further away from $K$, but there may be no good quantitative connection (satisfying~\eqref{lowcurve} with a constant independent of $x$ and $K$) between one center and another. A key ingredient in the proof of Proposition~\ref{prop1} is the local finiteness of the components of $\Omega \setminus K$. We recall the precise statement below. The argument appears in the proof of~\cite[p.~472, Lemma~13]{d}, but it applies only in the planar setting, which is the reason why Proposition~\ref{prop1} is also restricted to the dimension~2. \begin{prop}\label{prop2} Let $N=2$, let $(u,K)$ be a Mumford--Shah minimizer in $\Omega$. There exists a radius $r_0 > 0$ (which only depends on $\norm{g}_{\infty}$) and a universal constant $C \geq 1$ such that for all $x_0 \in K$, and $r \leq r_0$ with $B(x_0,2r) \subset \Omega$, there are at most $C$ components of $B(x_0,2r) \setminus K$ which meet $B(x_0,r)$. \end{prop} \begin{proof} We justify Proposition~\ref{prop2} by application of~\cite[p.~472, Lemma~13]{d}. Let $x\in B(x_0,r)\setminus K$ and let $\Omega_0$ be the connected component of $\Omega \setminus K$ that contains $x$. Then a direct application of~\cite[p.~472, Lemma~13]{d} says that there exists a universal constant $C_1>0$ such that $\Omega_0\cap B(x,r/2)$ contains a disk of radius $r/C_1$. We deduce that every component of $B(x_0,2r) \setminus K$ which meets $B(x_0,r)$ has a volume at least $\pi r^2 C_1^{-2}$. Since they are disjoint, there can only be a finite number of such components, bounded by a constant which depends only on $C_1$. An alternative argument, making our paper perhaps more self-contained, would be to remark that Proposition~\ref{prop1} is actually a stronger statement than the local finiteness. Indeed, by the existence of escape paths (i.e., Proposition~\ref{prop1}), we know that every $x\in B(x_0,r)\setminus K$ is connected to a point $z$ in $B(x_0,2r)$ satisfying $\dist(z,K)\geq c_0 r$, and then one can conclude as before. \end{proof} \section{At most three components in the complement of \texorpdfstring{$K$}{K} locally} We continue our analysis of connected components, by showing that every point $x_0 \in K$ is adherent to at most three components. For that purpose we use a deep result by David and L\'eger contained in~\cite{dleger}. \begin{theo}[David--L\'eger~\cite{dleger}]\label{davLe} Let $(u,K)$ be a Mumford--Shah global minimizer in the plane such that\/ $\R^2\setminus K$ is not connected. Then $K$ is a line or a propeller (i.e.\ three half lines meeting at one point with equal angles), and $u$ is locally constant on\/ $\R^2\setminus K$. \end{theo} We prove the following proposition that has already been announced in the introduction (Theorem~\ref{main1}), that we restate here again. \begin{prop}\label{prop3} Let $N=2$ and let $(u,K)$ be a Mumford--Shah minimizer in $\Omega$. Then for all $x_0\in K$ and $r > 0$ such that $B(x_0,r) \subset \Omega$, there are at most three connected components of $B(x_0,r) \setminus K$ whose closure contains $x_0$. \end{prop} \begin{proof} We can assume that $x_0$ is the origin. We let $c_0>0$ be the constant of Proposition~\ref{prop1} and $r_0 > 0$ be a radius such that $B(x_0,r_0) \subset \Omega$. Let us denote by $\{A_n\}$ the connected components of $B(0,r_0) \setminus K$ whose boundaries contain $0$ and assume by contradiction that $\sharp \{A_n\}\geq 4$. Consider a blow-up sequence $(u_j, K_j)$ of $(u,K)$ at the origin, namely $K_j=r_j^{-1}K$ and $u_j(x)= r_j^{-1/2}u(r_j x)$ for a sequence $r_j\to 0$. This blow-up sequence converges, up to a subsequence still denoted by $r_j\to 0$, to a global minimizer $(u_{\infty}, K_{\infty})$ (see~\cite[Section~40]{d} for the notion of blow-up limit). Our goal is to prove that $\R^2 \setminus K_{\infty}$ contains at least four different connected components, which would be a contradiction with Theorem~\ref{davLe}. Since $0\in \partial A_n$ for all $n$, we know that for all $j$ there exists $x_n \in A_n \cap B(0,r_j)$. By applying Proposition~\ref{prop1}, we deduce that this point $x_n$ is connected to a point $y_n$ such that $\abs{x_n-y_n}\leq r_j$ and $\dist(y_n, K)\geq c_0r_j$. Up to a subsequence, the points $y_n/r_j \in B(0,2)$ converge as $j\to +\infty$ to some points $z_n$ in $\overline{B}(0,2)$. Since $\dist(y_n, K)\geq c_0r_j$ for all $j$, we deduce that actually $z_n \in \overline{B}(0,2)\setminus K_{\infty}$ for all $n$ and that even $\dist(z_n, K_{\infty})\geq c_0$ for all $n$. Let us show that: \begin{equation}\label{amontrer} \text{the points $\{z_n\}_n$ all belong to different connected components of $\R^2\setminus K_{\infty}$}. \end{equation} Assume by contradiction that there is a curve $\gamma$ from $z_n$ to $z_{n'}$ in $\R^2 \setminus K_{\infty}$ (notice that a connected open set is always arc-wise connected). Then by local Hausdorff convergence, $\gamma$ does not touch any of the sets $K_j$ for $j$ large enough. Also, by convergence of $y_n/r_j$ to $z_n$, we know that for $j$ large enough $\abs{y_n/r_j-z_n}\leq c_0/2$. Since moreover $\dist(z_n, K_{\infty})\geq c_0$, we know that for $j$ large enough, the segments $[y_n/r_j, z_n] \subset \overline{B}(z_n,c_0/2)$ do not touch $K_{\infty}$ and again by Hausdorff convergence, do not touch $K_j$, either. Therefore we can modify the curve $\gamma$ as follows: \[ \gamma'=\gamma \cup [y_n/r_j,z_n] \cup [y_{n'}/r_j,z_{n'}]. \] This provides a continuous curve from $y_n/r_j$ to $y_{n'}/r_j$ which does not touch $K_j$. In other words the curve $r_j \gamma'$ is a continuous curve from $y_n$ to $y_{n'}$, that does not touch $K$. Since $\gamma'$ is bounded the curve $r_j\gamma'$ belongs to $B(0,r_0)\setminus K$ for $j$ large enough, which is a contradiction with the fact that $y_n$ and $y_{n'}$ are in different connected components of $B(0,r_0)\setminus K$. This achieves the proof of the claim in~\eqref{amontrer}. But then we have shown that $K_{\infty}$ is the singular set associated to a global minimizer in the plane for which $\R^2\setminus K_{\infty}$ has more than four connected components. This is not possible due to Theorem~\ref{davLe}, and so follows the proposition. \end{proof} \begin{rema} A related blow-up argument can be found in the recent book~\cite{delF}, namely in the proof of Theorem~1.5.2(ii) (see~\cite[pp.~102--103, proof of Corollary~4.4.2]{delF}). There, the stability of connected components is instead established through the use of $C^1$ estimates and $\varepsilon$-regularity theory. \end{rema} \begin{rema} With the same proof as for Proposition~\ref{prop3} we could also have proved the following alternative ``global'' version of the statement: if $(u,K)$ is a Mumford--Shah minimizer in $\Omega$ and $x_0\in K$, then the number of connected components of $\Omega \setminus K$ whose closure contain $x_0$, does not exceed~3. \end{rema} \section{Gradient bound and H\"older estimates} Finally, we prove the existence of a trace, up to the boundary, thanks to the existence of escape paths in the components. For that purpose we will need an $L^\infty$ estimate on the gradient of $u$. We start with a very well known upper bound. \begin{prop}\label{prop333} Let $N=2$ and let $(u,K)$ be a Mumford--Shah minimizer {in $\Omega$}. Then for all $x\in \Omega$ and $r>0$ such that $B(x,r)\subset \Omega$ we have \begin{equation}\label{upperbound} \int_{B(x,r)} \abs{\nabla u}^2 \dif x + \HH^1\parens[\big]{K\cap B(x,r)} \leq 2\pi r + 2\pi \norm{g}_{\infty}r^2. \end{equation} \end{prop} \begin{proof} This is the very standard upper bound on Mumford--Shah minimizers. First notice that $\norm{u}_\infty \leq \norm{g}_\infty$ because one can compare $u$ with a truncated version of $u$ (see for instance~\cite[Lemma~2.1.1]{delF}). Assume without loss of generality that $\overline{B}(x,r) \subset \Omega$ and use the competitor $(v,L)$ made by taking $L=K\cup \partial B(x,r) \setminus B(x,r)$ and $v=0$ in $B(x,r)$, $v=u$ in $\Omega \setminus B(x,r)$. This automatically gives~\eqref{upperbound}. \end{proof} In the sequel we will also need the following gradient estimate on the function $u$. This is the only place where we use that $(u,K)$ is a Mumford--Shah minimizer (and not only an almost-minimizer). \begin{prop}\label{prop33} Let $N=2$ and let $(u,K)$ be a Mumford--Shah minimizer in $\Omega$. There exists a constant $r_2 > 0$ (which only depends on $\norm{g}_{\infty}$) such that for all $x_0 \in K$, for all $r \leq r_2$ with $B(x_0,2r) \subset \Omega$, and for all $x \in B(x_0,r) \setminus K$, we have \begin{equation}\label{estimateH} \abs{\nabla u}(x) \leq 2 \dist(x,K)^{-\frac{1}{2}} + 4 \parens[\big]{\norm{g}_\infty \dist(x,K)}^{\frac{1}{2}}. \end{equation} \end{prop} \begin{proof} The proposition follows from the fact that $u$ is the solution of the equation \[ -\Delta u = u-g \quad \text{in $\Omega \setminus K$} \] with $u-g \in L^\infty$. In particular, $u$ is of class $C^{1,\alpha}$ by elliptic regularity. In order to derive some more precise estimates it will be convenient to assume for a moment that $g$ is also of class $C^1$. In this case we can use the equation to get \[ -\Delta (\partial_i u) = \partial_i (u-g). \] Let $x\in \Omega \setminus K$. To get the desired gradient estimate we will use a variant of the mean value property, applied to $\partial_i u$. Assuming without losing generality that $x=0$, we use a standard computation in polar coordinates (see~\cite[p.~26]{evans}) which yields, for all $r > 0$ such that $\overline{B}(0,r) \subset \Omega \setminus K$, \[ \begin{split} \frac{\dif}{\dif r} \parens*{\frac{1}{\pi r^2}\int_{B(0,r)} \partial_i u \dif y} & = \frac{1}{2\pi r} \int_{B(0,r)} \Delta (\partial_i u) \dif y \\ & = \frac{1}{2\pi r} \int_{B(0,r)} \partial_i (g-u) \dif y \\ & = \frac{1}{2\pi r} \int_{\partial B(0,r)} (g-u) \frac{y_i}{r} \dif y. \end{split} \] We deduce that for all $s0$ (which only depends on $\norm{g}_{\infty}$) and a universal constant $C \geq 1$ such that for all $r \leq r_3$ with $B(x_0,4r) \subset \Omega$ and for all $x,y$ that lie in the same connected component of $B(x_0,r) \setminus K$ we have \[ \abs[\big]{u(x)-u(y)}\leq C r^{1/2}. \] \end{prop} \begin{proof} We can assume that $x_0$ is the origin. We let $c_0,\tau>0$ be the constants of Proposition~\ref{prop1}. We may assume that $r_3\leq \tau$ and we let $r \leq r_3$ be given such that $B(0,4r) \subset \Omega$. Recall that Proposition~\ref{prop1} guarantees the existence of escape paths, which means in particular that for all $x\in B(0,r) \setminus K$, there exists a $1$-Lipschitz mapping $z \colon [0,r_3]\to \Omega \setminus K$ such that $z(0)=x$ and \begin{equation}\label{lowcurve0} \dist\parens[\big]{z(t),K}\geq c_0 t \quad \text{for $t\in [0,r]$}. \end{equation} We can also assume $r_3 \leq r_2/2$ so that Proposition~\ref{prop33} also applies and says in particular that for all $x\in B(0,2r) \setminus K$, \begin{equation}\label{estIM} \abs{\nabla u}(x)\leq 2 \dist(x,K)^{-\frac{1}{2}} + C_1, \end{equation} with $C_1= 4 \parens[\big]{2\norm{g}_\infty r_3}^{1/2}$. Now let $x,y$ be two points in the same connected component of $B(0,r)\setminus K$, as in the statement of the proposition. Set $B=B(0,r)$ and $B' \coloneqq B(0,2r)$. Then, choose a finite subset $E$ of $B'\setminus K$ which is $10^{-1}c_0r$ dense in $B'\setminus K$. We can find such a set $E$ with less than $N_0$ elements, depending only on $c_0$. Let $\xi \colon [0,1]\to B\setminus K$ be a continuous curve such that $\xi(0)=x$ and $\xi(1)=y$. The rest of the proof will be carried out in several steps, following the lines of~\cite[Lemma~21.3]{DavidBonnet}. \begin{step}{Definition of $E(t)$ and $z(t)$} For $t\in[0,1]$ we define $E(t)\subset E$ as being the set of points $z\in E$ which can be connected to $\xi(t)$ by an escape path $\gamma \colon [0,r] \to B(0,2r) \setminus K$ that is $2$-Lipschitz, satisfies $\gamma(0)=\xi(t)$, $\gamma(r)=z$, and such that \begin{equation}\label{escapeFin} \dist\parens[\big]{\gamma(s),K}\geq c_0 10^{-1} s \quad \text{for $0\leq s\leq r$}. \end{equation} Notice that we have added a factor $10^{-1}$ in~\eqref{escapeFin} compared to~\eqref{lowcurve0}, which is a less restrictive condition. It is easy to see that $E(t)$ is not empty. Indeed, by~\eqref{lowcurve0} we have the existence of an escape path $\gamma \colon [0,r] \to B(0,2r) \setminus K$ starting from $\xi(t)$, which is $1$-Lipschitz, and satisfies something 10 times more restrictive than~\eqref{escapeFin}. The path fulfills almost all the requirement on $\gamma$ excepted that its endpoint $z'$ may not belong to the finite set $E$. But there exists $z\in E$ such that $\abs{z-z'}\leq c_010^{-1}r$. And we also know that $\dist(z',K)\geq c_0r$. Therefore, adding the segment $\abs{z-z'} \subset B(0,2r) \setminus K$ to the path $\gamma$ and re-parameterizing it on $[0,r]$ as a $2$-Lipschitz function yields the desired path, which proves that $E$ is not empty. Since there is some room in the inequalities, it is also easy to prove the following fact that will be used later: for all $t\in [0,1]$, we can find a point $z(t)\in E(t)$ which also satisfies \begin{equation}\label{subtile} z(t) \in E(t') \quad \text{for all $t'$ in some neighborhood of $t \in [0,1]$}. \end{equation} This is possible since for all $t'$ close enough to $t$, the point $\xi(t')$ is connected to $\xi(t)$ by a small segment in $B(0,2r) \setminus K$. \end{step} \begin{step}{H\"older estimate for points in $E(t)$}\label{step_2} The next step is to prove that \begin{equation}\label{holder1} \abs[\big]{u\parens[\big]{\xi(t)}-u(z)}\leq C r^{1/2} \quad \text{for all $z \in E(t)$}. \end{equation} For this purpose we take a path $\gamma$ from $\xi(t)$ to $z$ satisfying~\eqref{escapeFin} and we use the gradient estimate~\eqref{estIM}. Notice that $u$ is a $C^1$ function in $\Omega \setminus K$. We can then write \[ \begin{split} \abs[\big]{u\parens[\big]{\xi(t)}-u(z)} & \leq \int_{0}^r \abs[\big]{\nabla u\parens[\big]{\gamma(s)}} \abs[\big]{\gamma'(s)} \dif s \\ & \leq 2 \int_{0}^r 2 \dist\parens[\big]{\gamma(s),K}^{-\frac{1}{2}} + C_1 \dif s \\ & \leq 2 \int_{0}^r 2 c_0^{1/2}10^{-1/2} s^{-\frac{1}{2}} + C_1 \dif s \\ & \leq C r^{1/2}, \end{split} \] where $C$ depends only on $c_0$ and $C_1$, which proves~\eqref{holder1}. \end{step} \begin{step}{Definition of $t(z)$ and iterative argument} Next we define \[ E_1 \coloneqq \braces[\big]{z\in E \st[\big] \text{$z\in E(t)$ for some $t \in [0,1]$}}, \] and then for $z\in E_1$ we define \[ t(z) \coloneqq \sup \braces[\big]{t \st[\big] z \in E(t)}. \] Notice that for $z\in E_1$, passing to the supremum and using the continuity of $u\circ \xi$, we still have from Step~\ref{step_2} the following estimate \begin{equation}\label{estimSup} \abs[\big]{u\parens[\big]{\xi\parens[\big]{t(z)}}-u(z)}\leq Cr^{1/2}, \end{equation} with the same constant $C>0$ as before. We start now an iterative argument: set $t_0=0$ and $z_0=z(t_0)$, as defined in~\eqref{subtile}. Then $z_0\in E(t_0)$ and by~\eqref{holder1} we get \[ \abs[\big]{u(x)-u(z_0)}\leq Cr^{1/2}. \] Next, set $t_1=t(z_0)$. It follows that $t_1>t_0$, by definition of $z_0=z(t_0)$ and because of~\eqref{subtile}. We also know from~\eqref{estimSup} that \begin{equation} \abs[\big]{u\parens[\big]{\xi(t_1)}-u(z_0)}\leq Cr^{1/2}. \end{equation} We continue like this iteratively, by defining $z_i=z(t_i)$ and $t_i=t(z_{i-1})$, until we reach $t_i=1$. The main point is that $t_{i+1}>t_i$ for all $i$ (as already mentioned above for $t_0$ and $t_1$), and more important: when $t_i < 1$, \begin{equation}\label{aMontrer} \text{each $z_i$ is different from all its predecessors}. \end{equation} Indeed, $z_i=z(t_i)$, hence $z_i \in E(t')$ for values $t'>t_i$. But then for all $jt_i$, as $z_i$ does. So $z_i \not = z_j$, as needed. This proves~\eqref{aMontrer}. Now we remember that $E$ was a finite set, with cardinality $N_0$ bounded by a constant depending only on the constant $c_0$. Since all the $z_i$ are disjoint, the iterative argument must stop after a maximum of $N_0$ steps. This means that $t_i$ reaches the maximum value of $1$ after possibly $N_0$ iterations or less. \end{step} \begin{step}{Conclusion} We then conclude by adding a maximum of $N_0$ inequalities of the following two types: the first one is \begin{equation} \abs[\big]{u\parens[\big]{\xi(t_{i})}-u(z_i)}\leq Cr^{1/2}, \end{equation} valid because $z_i=z(t_i)\in E(t_i)$ thus~\eqref{holder1} applies, and the second one is \begin{equation} \abs[\big]{u\parens[\big]{\xi(t_{i+1})}-u(z_i)}\leq Cr^{1/2}, \end{equation} valid because $\xi(t_{i+1})=\xi\parens[\big]{t(z_i)}$ and~\eqref{estimSup} applies. With the triangle inequality, we end up with $\abs[\big]{u(x)-u(y)} \leq 2N_0C r^{1/2}$. \qedhere \end{step} \let\qed\relax \end{proof} \section{Proof of main result}\label{proofMain} We are now in position to prove the main result of this note. \begin{proof}[Proof of Theorem~\ref{main}] Let $x_0\in K$ be given. Notice that the set $E(x_0)$ defined in Conjecture~\ref{conjecture} is exactly the set of values $\ell \in \R$ for which there exists a sequence $(y_k)_k$ in $\Omega \setminus K$ such that $y_k \to x_0$ and $u(y_k) \to \ell$. Assume for a contradiction that $E(x_0)$ contains more than three points. Let $a_k$, $k=1,\dots, 4$ be four points in $E(x_0)$ and set $\delta \coloneqq \min_{k,k'}\abs{a_k-a_{k'}}$, the minimal distance between them. From Proposition~\ref{prop3}, we can find a radius $r_0 > 0$, such that $B(x_0,r_0) \subset \Omega$ and $B(x_0,r_0)\setminus K$ has at most $C_0$ connected components intersecting $B(x_0,r_0/2)$. We can additionally choose $r_0$ so small that \begin{equation}\label{picc} 2Cr_0^{1/2}\leq \delta/10, \end{equation} where $C>0$ is the constant from Proposition~\ref{prop3bis}. Since $x_0$ is adherent to only finitely many components of $B(x_0,r_0)\setminus K$, we can take a smaller radius $r_1