Optimal regularity for the no-sign obstacle problem
Abstract
In this paper we prove the optimal C1,1(B12)-regularity for a general obstacle type problem u = f\u≠ 0\in B1, under the assumption that f*N is C1,1(B1), where N is the Newtonian potential. This is the weakest assumption for which one can hope to get C1,1-regularity. As a by-product of the C1,1-regularity we are able to prove that, under a standard thickness assumption on the zero set close to a free boundary point x0, the free boundary is locally a C1-graph close to x0, 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.