Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantitative regularity for the Navier-Stokes equations via spatial concentration

Published 14 Mar 2020 in math.AP | (2003.06717v3)

Abstract: This paper is concerned with quantitative estimates for the Navier-Stokes equations. First we investigate the relation of quantitative bounds to the behaviour of critical norms near a potential singularity with Type I bound u<em>L<sup></sup></em>tL<sup>3,x</sup>M|u|<em>{L<sup>{\infty}</sup></em>{t}L<sup>{3,\infty}_{x}}\leq</sup> M. Namely, we show that if T<sup>T<sup>* is a first blow-up time and (0,T<sup>)(0,T<sup>*) is a singular point then u(,t)<em>L<sup>3(B</sup></em>0(R))C(M)log(1T<sup><em>t),R=O((T</em>t)<sup>12).|u(\cdot,t)|<em>{L<sup>{3}(B</sup></em>{0}(R))}\geq C(M)\log\Big(\frac{1}{T<sup><em>-t}\Big),\,\,\,\,\,\,R=O((T^</em>-t)<sup>{\frac{1}{2}-}). We demonstrate that this potential blow-up rate is optimal for a certain class of potential non-zero backward discretely self-similar solutions. Second, we quantify the result of Seregin (2012), which says that if uu is a smooth finite-energy solution to the Navier-Stokes equations on R<sup>3×</sup>(0,1)\mathbb{R}<sup>3\times</sup> (0,1) with $$\sup_{n}|u(\cdot,t_{(n)})|<em>{L<sup>{3}(\mathbb{R}<sup>3)}&lt;\infty\,\,\,\textrm{and}\,\,\,t</sup></sup></em>{(n)}\uparrow 1,$$ then uu does not blow-up at t=1t=1. To prove our results we develop a new strategy for proving quantitative bounds for the Navier-Stokes equations. This hinges on local-in-space smoothing results (near the initial time) established by Jia and \v{S}ver\'{a}k (2014), together with quantitative arguments using Carleman inequalities given by Tao (2019). Moreover, the technology developed here enables us in particular to give a quantitative bound for the number of singular points in a Type I blow-up scenario.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.