Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Volume estimates on the critical sets of solutions to elliptic PDEs (1403.4176v2)

Published 17 Mar 2014 in math.AP and math.DG

Abstract: In this paper we study solutions to elliptic linear equations $L(u)=\partial_i(a{ij}(x)\partial_j u) + bi(x) \partial_i u + c(x) u=0$, either on $Rn$ or a Riemannian manifold, under the assumption of Lipschitz control on the coefficients $a{ij}$. We focus our attention on the critical set $Cr(u)\equiv{x:|\nabla u|=0}$ and the singular set $S(u)\equiv{x:u=|\nabla u|=0}$, and more importantly on effective versions of these. Currently, under the coefficient control we have assumed, the strongest results in the literature say that the singular set is n-2-dimensional, however at this point it has not even been shown that $H{n-2}(S)<\infty$ unless the coefficients are smooth. Fundamentally, this is due to the need of an $\epsilon$-regularity theorem which requires higher coefficient control as the frequency increases. We introduce new techniques for estimating the critical and singular set, which avoids the need of any such $\epsilon$-regularity. Consequently, we prove that if the frequency of u is bounded by $\Lambda$ then we have the estimates $H{n-2}(C(u))\leq C{\Lambda2}$, $H{n-2}(S(u))\leq C{\Lambda2}$, depending on whether the equation is critical or not. More importantly, we prove corresponding estimates for the {\it effective} critical and singular sets. Even under the assumption of analytic coefficients these results are much sharper than those currently in the literature. We also give applications of the technique to the nodal set of solutions, and to give estimates on the corresponding eigenvalue problem.

Summary

We haven't generated a summary for this paper yet.