Optimal regularity for the no-sign obstacle problem

Details Optimal regularity for the no-sign obstacle problem Optimal regularity for the no-sign obstacle problem

2011-05-04

arxiv.org/abs/1105.0717v1

Mathematics

Analysis of PDEs

Scientific paper

In this paper we prove the optimal $C^{1,1}(B_\frac12)$-regularity for a general obstacle type problem $$ \lap u = f\chi_{\{u\neq 0\}}\textup{in $B_1$}, $$ under the assumption that $f*N$ is $C^{1,1}(B_1)$, where $N$ is the Newtonian potential. This is the weakest assumption for which one can hope to get $C^{1,1}$-regularity. As a by-product of the $C^{1,1}$-regularity we are able to prove that, under a standard thickness assumption on the zero set close to a free boundary point $x^0$, the free boundary is locally a $C^1$-graph close to $x^0$, provided $f$ 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.

Affiliated with

Also associated with

No associations

Rating

Optimal regularity for the no-sign obstacle problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal regularity for the no-sign obstacle problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal regularity for the no-sign obstacle problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688709