English

Optimal regularity for the no-sign obstacle problem

Analysis of PDEs 2011-05-05 v1

Abstract

In this paper we prove the optimal C1,1(B12)C^{1,1}(B_\frac12)-regularity for a general obstacle type problem \lapu=fχ{u0}in B1, \lap u = f\chi_{\{u\neq 0\}}\textup{in $B_1$}, under the assumption that fNf*N is C1,1(B1)C^{1,1}(B_1), where NN is the Newtonian potential. This is the weakest assumption for which one can hope to get C1,1C^{1,1}-regularity. As a by-product of the C1,1C^{1,1}-regularity we are able to prove that, under a standard thickness assumption on the zero set close to a free boundary point x0x^0, the free boundary is locally a C1C^1-graph close to x0x^0, provided ff is Dini. This completely settles the question of the optimal regularity of this problem, that has been under much attention during the last two decades.

Keywords

Cite

@article{arxiv.1105.0717,
  title  = {Optimal regularity for the no-sign obstacle problem},
  author = {John Andersson and Erik Lindgren and Henrik Shahgholian},
  journal= {arXiv preprint arXiv:1105.0717},
  year   = {2011}
}
R2 v1 2026-06-21T18:02:29.494Z