Finite time blowup for an averaged three-dimensional Navier-Stokes equation

Terence Tao

Introduction

The purpose of this paper is to formalise the “supercriticality” barrier for the (infamous) global regularity problem for the Navier-Stokes equation, using a blowup solution to a certain averaged version of Navier-Stokes equation to demonstrate that any proposed positive solution to the regularity problem which does not use the finer structure of the nonlinearity cannot possibly be successful. This barrier also suggests a possible route to provide a negative answer to this problem, that is to say it suggests a program for constructing a blowup solution to the true Navier-Stokes equations.

The barrier is not particularly sensitive to the precise formulationSee for an analysis of the relationship between different formulations of the Navier-Stokes regularity problem in three dimensions. It is likely that our main results also extend to higher dimensions than three, although we will not pursue this matter here. of the regularity problem, but to state the results in the cleanest fashion we will take the homogeneous global regularity problem in the Euclidean setting in three spatial dimensions as our formulation:

in a distributional sense at least (actually, at the Hdf⁡10H^{10}_{\operatorname{df}} level of regularity it is not difficult to justify (1.6) in the classical sense for mild solutions).

The distinction between smooth finite energy solutions and Hdf⁡10H^{10}_{\operatorname{df}} mild solutions is essentially non-existent (at leastFor data which is only in Hdf⁡10H^{10}_{\operatorname{df}}, there is a technical distinction between the two solution concepts, due to a lack of unlimited time regularity at the initial time t=0t=0 that is ultimately caused by the non-local effects of the divergence-free condition ∇⋅u=0\nabla\cdot u=0, requiring one to replace the notion of a smooth solution with that of an almost smooth solution; see for details. However, in this paper we will only concern ourselves with Schwartz initial data, so that this issue does not arise. for Schwartz initial data), and the reader may wish to conflate the two notions on a first reading. More rigorously, we can reformulate Conjecture 1.1 as the following logically equivalent conjecture:

Conjecture 1.1 and Conjecture 1.2 are equivalent.

We use the results from , although this equivalence is essentially classical and was previously well known to experts.

If we take the inner product of (1.6) with uu and integrate in time using (1.2), we arrive atOne has to justify the integration by parts of course, but this is routine under the hypothesis of a mild solution; we omit the (standard) details. the fundamental energy identity

for any mild solution to the Navier-Stokes equation.

If one was unaware of the supercritical nature of the Navier-Stokes equation, one might attempt to obtain a positive solution to Conjecture 1.1 or Conjecture 1.2 by combining (1.7) (or equivalently, (1.2)) with various harmonic analysis estimates for the inhomogeneous heat equation

(or, in integral form, u(t)=etΔu0+∫0te(t−t′)ΔF(t′) dt′u(t)=e^{t\Delta}u_{0}+\int_{0}^{t}e^{(t-t^{\prime})\Delta}F(t^{\prime})\ dt^{\prime}), together with harmonic analysis estimates for the Euler bilinear operator BB, a simple example of which is the estimate

for some absolute constant CC. Such an approach succeeds for instance if the initial data u0u_{0} is sufficiently smallOne can of course also consider other perturbative regimes, in which the solution uu is expected to be close to some other special solution than the zero solution. There is a vast literature in these directions, see e.g. and the references therein. in a suitable critical norm (see for an essentially optimal result in this direction), or if the dissipative operator −Δ-\Delta is replaced by a hyperdissipative operator (−Δ)α(-\Delta)^{\alpha} for some α≥5/4\alpha\geq 5/4 (see ) or with very slightly less hyperdissipative operators (see ). Unfortunately, standard scaling heuristics (see e.g. [40, §2.4]) have long indicated to the experts that the energy estimate (1.7) (or (1.2)), together with the harmonic analysis estimates available for the heat equation and for the Euler bilinear operator BB, are not sufficient by themselves to affirmatively answer Conjecture 1.1. However, these scaling heuristics are not formalised as a rigorous barrier to solvability, and the above mentioned strategy to solve the Navier-Stokes global regularity problem continues to be attempted on occasion.

The most conclusive way to rule out such a strategy would of course be to demonstrateIt is a classical fact that mild solutions to a given initial data are unique, see e.g. [41, Theorem 5.4(iii)]. a mild solution to the Navier-Stokes equation that develops a singularity in finite time, in the sense that the Hdf⁡10H^{10}_{\operatorname{df}} norm of u(t)u(t) goes to infinity as tt approaches a finite time T∗T_{*}. Needless to say, we are unable to produce such a solution. However, we will in this paper obtain a finite time blowup (mild) solution to an averaged equation

We pause to mention some previous blowup results in this direction. If one drops the cancellation requirement (1.2), so that one no longer has the energy identity (1.7), then blowup solutions for various Navier-Stokes type equations have been constructed in the literature. For instance, in finite time blowup for a “cheap Navier-Stokes equation” ∂tu=Δu+−Δ(u2)\partial_{t}u=\Delta u+\sqrt{-\Delta}(u^{2}) (with uu now a scalar field) was constructed in the one-dimensional setting, with the results extended to higher dimensions in . As remarked in that latter paper, it is essential to the methods of proof that no energy identity is available. In a slightly different direction, finite time blowup was established in for a complexified version of the Navier-Stokes equations, in which the energy identity was again unavailable (or more precisely, it is available but non-coercive). These models are not exactly of the type (1.9) considered in this paper, but are certainly very similar in spirit.

Further models of Navier-Stokes type, which obey an energy identity, were introduced by Plecháç and Şverák , , by Katz and Pavlovic , and by Hou and Lei ; of these three, the model in is the most relevant for our work and will be discussed in detail in Section 1.2 below. These models differ from each other in several respects, but interestingly, in all three cases there is substantial evidence of blowup in five and higher dimensions, but not in three or four dimensions; indeed, for all three of the models mentioned above there are global regularity results in three dimensions, even in the presence of blowup results for the corresponding inviscid model. Numerical evidence for blowup for the Navier-Stokes equations is currently rather scant (except in the infinite energy setting, see , ); the blowup evidence is much stronger in the case of the Euler equations (see for a recent result in this direction, and for a survey), but it is as yet unclearHowever, in , finite time blowup for a three-dimensional “partially viscous” Navier-Stokes type model, in which some but not all of the fields are subject to a viscosity term, was established. whether these blowup results have direct implications for Navier-Stokes in the three-dimensional setting, due to the relatively significant strength of the dissipation.

Finally, we mention work , , establishing finite time blowup for supercritical fractal Burgers equations; such equations are not exactly of Navier-Stokes type, being scalar one-dimensional equations rather than incompressible vector-valued three-dimensional ones, but from a scaling perspective the results are of the same type, namely a demonstration of blowup whenever the norms controlled by the conservation and monotonicity laws are all supercritical.

Finally, we will averageIn an earlier version of this manuscript, no averaging over dilations was assumed, but it was pointed out to us by the referee that the non-degeneracy condition (3.24) failed if one did not introduce dilation averaging. over the dilation operators

almost surely for any natural numbers k1,k2,k3k_{1},k_{2},k_{3} and some finite CC. To phrase this definition without probabilistic notation, we have

for some probability space (Ω,μ)(\Omega,\mu) and some measurable maps Ri,⋅:Ω→SO⁡(3)R_{i,\cdot}:\Omega\to{\operatorname{SO}}(3), λi,⋅:Ω→(0,+∞)\lambda_{i,\cdot}:\Omega\to(0,+\infty) and mi,⋅(D):Ω→M0m_{i,\cdot}(D):\Omega\to\mathcal{M}_{0}, where M0\mathcal{M}_{0} is given the Borel σ\sigma-algebra coming from the seminorms ∥∥k\|\|_{k}, and one has

By the rotation symmetry ⟨B(Rot⁡Ru,Rot⁡Rv),Rot⁡Rw⟩=⟨B(u,v),w⟩\langle B({\operatorname{Rot}}_{R}u,{\operatorname{Rot}}_{R}v),{\operatorname{Rot}}_{R}w\rangle=\langle B(u,v),w\rangle, we may eliminate one of the three rotation operators Rot⁡Ri,ω{\operatorname{Rot}}_{R_{i,\omega}} in (1.13) if desired, and similarly for the dilation operator. By some Fourier analysis (related to the fractional Leibniz rule) it should also be possible to eliminate one of the Fourier multipliers mi,ω(D)m_{i,\omega}(D). However, we will not attempt to do so here.

Because we have not imposed any symmetry or anti-symmetry hypotheses on the averaging measure μ\mu, rotations RjR_{j}, and Fourier multipliers mj(D)m_{j}(D), the analogue

We are now ready to state the main result of the paper.

One can also rewrite the averaged Navier-Stokes equation (1.9) in a form more closely resembling (1.1), namely

where TT is an averaged version of the convection operator (u⋅∇)u(u\cdot\nabla)u, defined by T=12(T12+T21)T=\frac{1}{2}(T_{12}+T_{21}) where

for ij=12,21ij=12,21. We can also ensure that the inviscid form of the averaged Navier-Stokes equation conserves helicity, as well as total momentum, angular momentum, and vorticity; see Remark 4.3 below.

2. Overview of proof

To construct the stable blowup solution, we were motivated by the work on regularity and blowup of the system of ODE

for some Schwartz function ψ\psi with Fourier transform vanishing near the origin. We remark that the analogue of the energy identity (1.7) in this setting is the identity

valid whenever XnX_{n} exhibits sufficient decay as n→±∞n\to\pm\infty (we do not formalise this statement here).

We will defer for now the technical issue (which we regard as being of secondary importance) of transferring blowup results from dyadic Navier-Stokes models to averaged Navier-Stokes models, and focus on the question of whether blowup solutions may be constructed for ODE systems such as (1.17).

Blowup solutions for the equation (1.17) are known to exist for sufficiently small α\alpha; specifically, for α<1/4\alpha<1/4 this was (essentially) established in , while for α<1/3\alpha<1/3 this was established in , with global regularity established in the critical and subcritical regimes α≥1/2\alpha\geq 1/2. If a blowup solution could be constructedThe results in can be however adapted to establish a version of Theorem 1.5 in six and higher dimensions, while the results in give a version in five and higher dimensions (and just barely miss the four-dimensional case); this can be done by adapting the arguments in this paper (and using the above-cited blowup results as a substitute for the lengthier ODE analysis in this paper), and we leave the details to the interested reader. Interestingly, the results in , on a somewhat different Navier-Stokes type model also indicate blowup in five and higher dimensions, while giving global regularity instead in lower dimensions; similarly for a third Navier-Stokes model introduced in . with the value α=2/5\alpha=2/5, then this would be a dyadic analogue of Theorem 1.5. Unfortunately for our purposes, for the values λ=21/α,α=2/5\lambda=2^{1/\alpha},\alpha=2/5, global regularity was established in (for non-negative initial data Xn(0)X_{n}(0)), by carefully identifying a region of phase space that is invariant under forward evolution of (1.17), and which in particular prevents the energy XnX_{n} from concentrating too strongly at a single value of nn. However, the argument in is sensitive to the specific numerical value of λ\lambda (and also relies heavily on the assumption of initial non-negativity), and does not rule out the possibility of blowup at α=2/5\alpha=2/5 for some variant of the system (1.17).

From multiplying (1.17) by XnX_{n}, we arrive at the energy transfer equations

One can fix this problem by suitably modifying the model equation (1.17). One rather drastic (and not particularly satisfactory) way to do this is to forcibly (i.e., exogenously) shut off most of the nonlinear interactions, so that only one pair Xn,Xn+1X_{n},X_{n+1} of adjacent modes experiences a nonlinear (but energy-conserving) interaction at any given time. Specifically, one can consider a truncated-nonlinearity ODE

Our strategy, then, is to design a system of ODE similar to (1.17) that can endogenously simulate the exogenous truncations 1n−1=n(t)1_{n-1=n(t)}, 1n=n(t)1_{n=n(t)} of (1.21). As shown in , this cannot be done for the scalar equation (1.17), at least when λ\lambda is equal to 22. However, by replacing (1.17) with a vector-valued generalisation, in which one has four scalar functions X1,n(t),X2,n(t),X3,n(t),X4,n(t)X_{1,n}(t),X_{2,n}(t),X_{3,n}(t),X_{4,n}(t) associated to each scale nn, rather than a single scalar function Xn(t)X_{n}(t), it turns out to be possible to use quadratic interactions of the same strength as the terms λn−1Xn−12,λnXnXn+1\lambda^{n-1}X_{n-1}^{2},\lambda^{n}X_{n}X_{n+1} appearing in (1.17) to induce such a simulation, while still respecting the energy identity. The precise system of ODE used is somewhat complicated (see Section 6), but it can be described as a sequence of “quadratic circuits” connected in series, with each circuit built out of a small number of “quadratic logic gates”, each corresponding to a certain type of basic quadratic nonlinear interaction. Specifically, we will combine together some “pump” gates that transfer energy from one mode to another (and which are the only gate present in (1.17)) with “amplifier” gates (that use one mode to ignite exponential growth in another mode) and “rotor” gates (that use one mode to rotate the energy between two other modes). By combining together these gates with carefully chosen coupling constants (a sort of “quadratic engineering” task somewhat analogous to the more linear circuit design tasks in electrical engineering), we can set up a transfer of energy from scale nn to scale n+1n+1 which can be made arbitrarily abrupt, in that the duration of the time interval separating the regime in which most of the energy is at scale nn, and most of the energy is at scale n+1n+1, can be made as small as desired. Furthermore, this transfer is delayed somewhat from the time at which the scale nn first experiences a large influx of energy. The combination of the delay in energy transfer and the abruptness of that transfer means that the process of transferring energy from scale nn to scale n+1n+1 is not itself interrupted (up to negligible errors) by the process of transferring energy from scale n+1n+1 to n+2n+2, and this permits us (after a lengthy bootstrap argument) to construct a blowup solution to this equation, which resembles the blowup solution for the truncated ODE (1.21).

This almost finishes the proof of Theorem 1.5, except that the dyadic model equation involves the dyadic Laplacian instead of the Euclidean Laplacian. However, it turns out that the analysis of the dyadic system of ODE can be adapted to the case of non-dyadic dissipation, by using local energy inequalities as a substitute for the exact ODE that appear in the dyadic model. While this complicates the analysis slightly, the effect is ultimately negligible due to the perturbative nature of the dissipation.

3. A program for establishing blowup for the true Navier-Stokes equations?

To summarise the strategy of proof of Theorem 1.5, a solution to a carefully chosen averaged version

of the Euler equations is constructed which behaves like a “von Neumann machine” (that is, a self-replicating machine) in the following sense: at a given time tnt_{n}, it evolves as a sort of “quadratic computer”, made out of “quadratic logic gates”, which is “programmed” so that after a reasonable period of time tn+1−tnt_{n+1}-t_{n}, it abruptly “replicates” into a rescaled version of itself (being 1+ϵ01+\epsilon_{0} times smaller, and about (1+ϵ0)5/2(1+\epsilon_{0})^{5/2} times faster), while also erasing almost completely the previous iteration of this machine. This replication process is stable with respect to perturbations, and in particular can survive the presence of a supercritical dissipation if the initial scale of the machine is sufficiently small.

This suggests an ambitious (but not obviously impossible) program (in both senses of the word) to achieve the same effect for the true Navier-Stokes equations, thus obtaining a negative answer to Conjecture 1.1. Define an ideal (incompressible, inviscid) fluid to be a divergence-free vector field uu that evolves according to the true Euler equations

Somewhat analogously to how a quantum computer can be constructed from the laws of quantum mechanics (see e.g. ), or a Turing machine can be constructed from cellular automata such as Conway’s “Game of Life” (see e.g. ), one could hope to design logic gates entirely out of ideal fluid (perhaps by using suitably shaped vortex sheets to simulate the various types of physical materials one would use in a mechanical computer). If these gates were sufficiently “Turing complete”, and also “noise-tolerant”, one could then hope to combine enough of these gates together to “program” a von Neumann machine consisting of ideal fluid that, when it runs, behaves qualitatively like the blowup solution used to establish Theorem 1.5. Note that such replicators, as well as the related concept of a universal constructor, have been built within cellular automata such as the “Game of Life”; see e.g. .

Once enough logic gates of ideal fluid are constructed, it seems that the main difficulties in executing the above program are of a “software engineering” nature, and would be in principle achievable, even if the details could be extremely complicated in practice. The main mathematical difficulty in executing this “fluid computing” program would thus be to arrive at (and rigorously certify) a design for logical gates of inviscid fluid that has some good noise tolerance properties. In this regard, ideas from quantum computing (which faces a unitarity constraint somewhat analogous to the energy conservation constraint for ideal fluids, albeit with the key difference of having a linear evolution rather than a nonlinear one) may prove to be useful.

A significant (but perhaps not insuperable) obstacle to this program is that in addition to the conservation of energy, the Euler equations obey a number of additional conservation laws, such as conservation of helicity, with vortex lines also being transported by the flow; see e.g. . This places additional limitations on the type of fluid gates one could hope to construct; however, as these conservation laws are indefinite in sign, it may still be possible to design computational gates that respect all of these laws.

It is worth pointing out, however, that even if this program is successful, it would only demonstrate blowup for a very specific type of initial data (and tiny perturbations thereof), and is not necessarily in contradiction with the belief that one has global regularity for most choices of initial data (for some carefully chosen definition of “most”, e.g. with overwhelming (but not almost sure) probability with respect to various probability distributions of initial data). However, we do not have any new ideas to contribute on how to address this latter question, other than to state the obvious fact that deterministic methods alone are unlikely to be sufficient to resolve the problem, and that stochastic methods (e.g. those based on invariant measures) are probably needed.

4. Acknowledgments

I thank Nets Katz for helpful discussions, Zhen Lei and Gregory Seregin for help with the references, and the anonymous referee for a careful reading and pointing out an error in a previous version of this manuscript. The author is supported by a Simons Investigator grant, the James and Carol Collins Chair, the Mathematical Analysis & Application Research Fund Endowment, and by NSF grant DMS-1266164.

Notation

If PP is a mathematical statement, we use 1P1_{P} to denote the quantity 11 when PP is true and when PP is false.

Averaging the Euler bilinear operator

In this section we show that certain bilinear operators, which are spatially localised variants of the “cascade operators” introduced in , can be viewed as averaged Euler bilinear operators.

We now formalise the class of local cascade operators we will be working with. For technical reasons, we will use the integer powers (1+ϵ0)n(1+\epsilon_{0})^{n} of 1+ϵ01+\epsilon_{0} for some sufficiently small ϵ0>0\epsilon_{0}>0 as our dyadic range of scales, rather than the more traditional powers of two, 2n2^{n}. Roughly speaking, the reason for this is to ensure that any triangle of side lengths that are of comparable size, in the sense that they all between (1+ϵ0)n−O(1)(1+\epsilon_{0})^{n-O(1)} and (1+ϵ0)n+O(1)(1+\epsilon_{0})^{n+O(1)} for some nn, are almost equilateral; this lets us avoid some degeneracies in the tensor symbol implicit in (1.3) that would otherwise complicate the task of expressing certain bilinear operators as averages of the Euler bilinear operator BB (specifically, the smallness of ϵ0\epsilon_{0} is needed to establish the non-degeneracy condition (3.24) below).

Note from the Plancherel theorem that one has

We did not impose that the ψi\psi_{i} were divergence free, but one could easily do so via Leray projections if desired, in which case the operators C(u,v)C(u,v) defined via duality in (3.1) can be expressed more directly as

and similarly for any local cascade operator CC one has

under the additional restriction that λ\lambda is an integer power of 1+ϵ01+\epsilon_{0}.

Theorem 1.5 is then an immediate consequence of the following two results.

Let ϵ0>0\epsilon_{0}>0 be a sufficiently small absolute constant. Then every local cascade operator (with dyadic scale parameter ϵ0\epsilon_{0}) is an averaged Euler bilinear operator.

Theorem 3.3 is the main technical result of this paper, and its proof will occupy the subsequent sections of this paper. In this section we establish Theorem 3.2. This will be done by a somewhat lengthy series of averaging arguments and Fourier decompositions, together with some elementary three-dimensional geometry, with the result ultimately following from a certain non-degeneracy property of the trilinear form Λ\Lambda defined in (1.4); the arguments are unrelated to those in the rest of the paper, and readers may wish to initially skip this section and move on to the rest of the argument.

Henceforth ϵ0>0\epsilon_{0}>0 will be assumed to be sufficiently small (e.g. ϵ0=10−10\epsilon_{0}=10^{-10} will suffice). In this section, the implied constants in the O()O() notation are not permitted to depend on ϵ0\epsilon_{0}.

It will be convenient to complexify the problem in order to freely use Fourier-analytic tools at later stages of the argument. To this end, we introduce the following notation.

and that one has the integrability conditions

Suppose we can show that every local cascade operator CC is a complex average of the Euler bilinear operator BB in the sense of the above definition. The multipliers mj,ω(D)m_{j,\omega}(D) for j=1,2,3j=1,2,3 appearing in the expansion (3.4) are not required to be real, but we can decompose them as mj,ω,1(D)+imj,ω,2(D)m_{j,\omega,1}(D)+im_{j,\omega,2}(D) where mj,ω,1(D),mj,ω,2(D)m_{j,\omega,1}(D),m_{j,\omega,2}(D) are real (and with the seminorms of mj,ω,1(D),mj,ω,2(D)m_{j,\omega,1}(D),m_{j,\omega,2}(D) bounded by a multiple of the corresponding seminorm of mj,ω(D)m_{j,\omega}(D)). Thus we can decompose the right-hand side of (3.4) as the sum of 23=82^{3}=8 pieces, each of which is of the same form as the original right-hand side up to a power of ii, and with all the mj,ω(D)m_{j,\omega}(D) appearing in each piece being a real Fourier multiplier. As the left-hand side of (3.4) is real (as are the inner products on the right-hand side), we may eliminate all the terms on the right-hand side involving odd powers of ii by taking real parts. The power of ii in each of the four remaining terms is now just a sign ±1\pm 1 and can be absorbed into the m1,ω(D)m_{1,\omega}(D) factor; by concatenating together four copies of (Ω,μ)(\Omega,\mu) we may now obtain an expansion of the form (3.4) in which all the mj,ω(D)m_{j,\omega}(D) are real. Finally, by multiplying m1,ω(D)m_{1,\omega}(D) by a normalising constant we may take (Ω,μ)(\Omega,\mu) to be a probability space rather than a finite measure space. Combining all these manipulations, we conclude Theorem 3.2. Thus, it will suffice to show that every local cascade operator is a complex average of the Euler bilinear operator BB.

2. Second step: frequency localisation

By again using m1,ω(D)m_{1,\omega}(D) to absorb scalar factors, we see that if CC is a complex average of C′C^{\prime}, then any complex scalar multiple of CC is a complex average of C′C^{\prime}; also, by concatenating finite measure spaces together we see from Definition 3.4 that if C1,C2C_{1},C_{2} are both complex averages of C′C^{\prime}, then C1+C2C_{1}+C_{2} is an complex average of C′C^{\prime}. Thus the space of averages of the Euler bilinear operator is closed under finite linear combinations, and so it will suffice to show that every basic local cascade operator is a complex average of the Euler bilinear operator.

By decomposing the ψj\psi_{j}, j=1,2,3j=1,2,3 in (3.4) into finitely many (complex-valued) pieces, we may replace the basic local cascade operator with the complexified basic local cascade operator CC defined by

see Figure 1. The exact normalisation in (3.7) is somewhat arbitrary, but the vanishing (3.8) is convenient for technical reasons; also, it is necessary to ensure that ξ10,ξ20,ξ30\xi^{0}_{1},\xi^{0}_{2},\xi^{0}_{3} have distinct magnitudes in order to avoid a certain degeneracy later in the argument (namely, the failure of (3.24) below).

Once we perform this normalisation, we will have no further need of averaging over dilations, and will rely purely on Fourier and rotation averaging to obtain the required representation of the cascade operator CC.

3. Third step: forcing frequency comparability

thus η(∣ξ1∣,∣ξ2∣,∣ξ3∣)\eta(|\xi_{1}|,|\xi_{2}|,|\xi_{3}|) is only non-vanishing when ξ1,ξ2,ξ3\xi_{1},\xi_{2},\xi_{3} have comparable magnitude.

Note that η(N1,N2,N3)=η(1,elog⁡(N2/N1),elog⁡(N3/N1))\eta(N_{1},N_{2},N_{3})=\eta(1,e^{\log(N_{2}/N_{1})},e^{\log(N_{3}/N_{1})}), and that (x,y)↦η(1,ex,ey)(x,y)\mapsto\eta(1,e^{x},e^{y}) is a smooth compactly supported function. By FourierOne could also use Mellin inversion here if desired. inversion, we thus have a representation of the form

then BηB_{\eta} is a complex average of BB (note that ∥Dit∥k\|D^{it}\|_{k} grows polynomially in tt for each kk). From (1.3) and Fubini’s theorem (working first with Schwartz u,v,wu,v,w to justify all the exchange of integrals, and then taking limits) we see thatNote that we do not define η(∣ξ1∣,∣ξ2∣,∣ξ3∣)\eta(|\xi_{1}|,|\xi_{2}|,|\xi_{3}|) when one of ξ1,ξ2,ξ3\xi_{1},\xi_{2},\xi_{3} vanishes, but this is only occurs on a set of measure zero and so there is no difficulty defining the integral.

It thus suffices to show that CC is a complex average of BηB_{\eta}.

is clearly a complex average of BηB_{\eta}, and so it suffices to show that CC is a complex average of Bη,ρB_{\eta,\rho}.

4. Fourth step: localising to a single frequency scale

Suppose for now that we can show that C0C_{0} is a complex average of Bη,ρ,0B_{\eta,\rho,0} (without the use of dilation operators), thus

for some mj,ωm_{j,\omega}, RjR_{j} (j=1,2,3j=1,2,3), and (Ω,μ)(\Omega,\mu) as in Definition 3.4. From the definition of C0C_{0} (and the support hypotheses on ψ1,ψ2,ψ3\psi_{1},\psi_{2},\psi_{3}), we see that we may smoothly localise each mj,ωm_{j,\omega} to the ball B(ξj0,O(ϵ03))B(\xi_{j}^{0},O(\epsilon_{0}^{3})) without loss of generality (and without destroying the fact that the mi,ω(D)m_{i,\omega}(D) are Fourier multipliers of order that obey (3.5)). If we then define

is equal to −πi⟨Cn1(u,v),w⟩-\pi i\langle C_{n_{1}}(u,v),w\rangle when n1=n2=n3n_{1}=n_{2}=n_{3}, and vanishing otherwise if ϵ0\epsilon_{0} is small enough (thanks to the support properties of mi,ω,nm_{i,\omega,n}, η\eta and ρ\rho). Summing, we see that

(as before, one can work first with Schwartz u,v,wu,v,w, and then take limits), thus demonstrating that CC is a complex average of Bη,ρB_{\eta,\rho} as desired (absorbing the 1−πi\frac{1}{-\pi i} factor into m1,ωm_{1,\omega}). Thus, to finish the proof of Theorem 3.2, it suffices to show that C0C_{0} is a complex average of Bη,ρ,0B_{\eta,\rho,0}.

5. Fifth step: extracting the symbol

We have reduced matters to the task of obtaining a representation (3.10) for ⟨C0(u,v),w⟩\langle C_{0}(u,v),w\rangle. By (3.9) and Plancherel’s theorem, we may expand ⟨C0(u,v),w⟩\langle C_{0}(u,v),w\rangle as

for all ξj∈B(ξj0,ϵ03)\xi_{j}\in B(\xi_{j}^{0},\epsilon_{0}^{3}) and Xj∈ξj⊥X_{j}\in\xi_{j}^{\perp}, j=1,2,3j=1,2,3. Indeed, if one applies (3.12) with (X1,X2,X3)=(u^(ξ1),v^(ξ2),w^(ξ3))(X_{1},X_{2},X_{3})=(\hat{u}(\xi_{1}),\hat{v}(\xi_{2}),\hat{w}(\xi_{3})), contracts the resulting tensor against ψ^1(ξ1)‾⊗ψ^2(ξ2)‾⊗ψ^3(ξ3)‾\overline{\hat{\psi}_{1}(\xi_{1})}\otimes\overline{\hat{\psi}_{2}(\xi_{2})}\otimes\overline{\hat{\psi}_{3}(\xi_{3})} and then integrates in ξ1,ξ2,ξ3\xi_{1},\xi_{2},\xi_{3} (absorbing the ψ^i‾\overline{\hat{\psi}_{i}} and FF factors into the mj,ωm_{j,\omega} terms, after first breaking FF into 2727 components), we obtain the desired decomposition (3.10) (after replacing Ω\Omega with the disjoint union of 2727 copies of Ω\Omega to accommodate the contributions from the various components of FF). As before, one may wish to first work with Schwartz u,v,wu,v,w to justify the interchanges of integrals, and then take limits at the end of the argument.

6. Sixth step: simplifying the weights

It remains to obtain the decomposition (3.12). We will restrict attention to those rotations Rj,ωR_{j,\omega} which almost fix ξj0\xi_{j}^{0} in the sense that

for j=1,2,3j=1,2,3. With this restriction, the weight φ(1ϵ02(R1,ωξ1−ξ10))η(∣ξ1∣,∣ξ2∣,∣ξ3∣)\varphi(\frac{1}{\epsilon_{0}^{2}}(R_{1,\omega}\xi_{1}-\xi_{1}^{0}))\eta(|\xi_{1}|,|\xi_{2}|,|\xi_{3}|) is equal to one (for ϵ0\epsilon_{0} small enough), and so (3.12) simplifies to

denote the set of sextuples (R1,R2,R3,ξ1,ξ2,ξ3)(R_{1},R_{2},R_{3},\xi_{1},\xi_{2},\xi_{3}) where Rj∈SO⁡(3)R_{j}\in{\operatorname{SO}}(3) with ∣Rjξj0−ξj0∣<ϵ02/4|R_{j}\xi_{j}^{0}-\xi_{j}^{0}|<\epsilon_{0}^{2}/4 for j=1,2,3j=1,2,3, and ξi∈B(ξi0,2ϵ03)\xi_{i}\in B(\xi_{i}^{0},2\epsilon_{0}^{3}) for i=1,2,3i=1,2,3 with

For ϵ0\epsilon_{0} small enough, we see from the implicit function theorem that this is a smooth manifold (of dimension 1515), and that for any choice of ξj∈B(ξj0,2ϵ03)\xi_{j}\in B(\xi_{j}^{0},2\epsilon_{0}^{3}) for j=1,2,3j=1,2,3, the slice

Suppose that we can find a smooth function

whenever ξj∈B(ξj0,ϵ03)\xi_{j}\in B(\xi_{j}^{0},\epsilon_{0}^{3}) and Xj∈ξj⊥X_{j}\in\xi_{j}^{\perp}, j=1,2,3j=1,2,3, where dσ(R1,R2,R3)d\sigma(R_{1},R_{2},R_{3}) is surface measure on Σξ1,ξ2,ξ3\Sigma_{\xi_{1},\xi_{2},\xi_{3}}. By a change of variables, this can be rewritten as

By a Fourier expansion and another smooth truncation, we may thus write

7. Seventh step: restricting to rotations around fixed axes

It remains to find a smooth function F′F^{\prime} for which one has the required representation (3.15). Observe from (3.8) and the implicit function theorem (for ϵ0\epsilon_{0} small enough) that if ξj∈B(ξj0,ϵ03)\xi_{j}\in B(\xi_{j}^{0},\epsilon_{0}^{3}) for j=1,2,3j=1,2,3, one can find rotations Rj,ξ1,ξ2,ξ3∈SO⁡(3)R_{j,\xi_{1},\xi_{2},\xi_{3}}\in{\operatorname{SO}}(3) for j=1,2,3j=1,2,3 with

(where ∥∥\|\| denotes the operator norm) is an open submanifold of Σξ1,ξ2,ξ3\Sigma_{\xi_{1},\xi_{2},\xi_{3}}. Also, if we use the ansatz

for Xj∈ξj⊥X_{j}\in\xi_{j}^{\perp}, j=1,2,3j=1,2,3. Thus, if we can find a smooth function

for any ξj∈B(ξj0,ϵ3)\xi_{j}\in B(\xi_{j}^{0},\epsilon^{3}) and Xj∈ξj⊥X_{j}\in\xi_{j}^{\perp}. Averaging this over all S∈SO⁡(3)S\in{\operatorname{SO}}(3) with ∥S−I∥≤ϵ2/8\|S-I\|\leq\epsilon^{2}/8, and inverting the tensored rotation operator R1,ξ1,ξ2,ξ3⊗R2,ξ1,ξ2,ξ3⊗R3,ξ1,ξ2,ξ3R_{1,\xi_{1},\xi_{2},\xi_{3}}\otimes R_{2,\xi_{1},\xi_{2},\xi_{3}}\otimes R_{3,\xi_{1},\xi_{2},\xi_{3}}, we obtain a representation of the desired form (3.15). Thus it suffices to find a smooth function F′′F^{\prime\prime} with the representation (3.19).

8. Eighth step: parameterising in terms of rotation angles

for all eight choices of sign patterns (σ1,σ2,σ3)∈{−1,+1}3(\sigma_{1},\sigma_{2},\sigma_{3})\in\{-1,+1\}^{3}, and some smooth functions

9. Ninth step: Fourier inversion and checking a non-degeneracy condition

By (3.21), (1.4) and decomposing RηjγjnR_{\eta_{j}}^{\gamma_{j}}n into a complex linear combination of e−iγje^{-i\gamma_{j}} and eiγje^{i\gamma_{j}}, we see that for fixed η1,η2,η3\eta_{1},\eta_{2},\eta_{3}, we may expand

for all (η1,η2,η3)∈Γ(\eta_{1},\eta_{2},\eta_{3})\in\Gamma and all choices of signs (σ1,σ2,σ3)∈{−1,+1}3(\sigma_{1},\sigma_{2},\sigma_{3})\in\{-1,+1\}^{3}.

For this, we finally need to use the precise form of Λ\Lambda. From (3.21), (1.4) we can write Θη1,η2,η3(γ1,γ2,γ3)\Theta_{\eta_{1},\eta_{2},\eta_{3}}(\gamma_{1},\gamma_{2},\gamma_{3}) as

where ui:=ηi/∣ηi∣u_{i}:=\eta_{i}/|\eta_{i}|. Expanding

(the minus sign arising here from the ii in the denominator in (3.25)). Similarly with σ2,γ2\sigma_{2},\gamma_{2} replaced by σ1,γ1\sigma_{1},\gamma_{1} respectively. Inserting these expansions and comparing with (3.23), we conclude that

But by (3.17), ηj=ξj0+O(ϵ03)\eta_{j}=\xi_{j}^{0}+O(\epsilon_{0}^{3}), which from (3.7) implies that

As −σ1+12σ2+12σ1σ2σ3-\sigma_{1}+\frac{1}{\sqrt{2}}\sigma_{2}+\frac{1}{\sqrt{2}}\sigma_{1}\sigma_{2}\sigma_{3} is bounded away from zero for σ1,σ2,σ3∈{−1,+1}\sigma_{1},\sigma_{2},\sigma_{3}\in\{-1,+1\}, the non-degeneracy claim (3.24) follows for ϵ0\epsilon_{0} small enough. This concludes the proof of Theorem 3.2.

The averaging over dilation operators was only needed to place the base frequencies ξ10,ξ20,ξ30\xi^{0}_{1},\xi^{0}_{2},\xi^{0}_{3} in a location where the non-degeneracy condition (3.24) held. This condition in fact holds for generic ξ10,ξ20,ξ30\xi^{0}_{1},\xi^{0}_{2},\xi^{0}_{3}, and so even without the use of averaging over dilations it should be the case that most local cascade operators are expressible as averaged Euler operators. As there is some freedom to select the local cascade operators in Theorem 3.3, this should still be enough to establish a slightly stronger version of Theorem 1.5 in which one does not use any averaging over dilations. We will however not pursue this matter here.

Reduction to an infinite-dimensional ODE

We now begin the proof of Theorem 3.3. We fix 0<ϵ0<10<\epsilon_{0}<1; henceforth we allow all implied constants in the O()O() notation to depend on ϵ0\epsilon_{0}. We suppose that Theorem 3.3 failed, so that one can always constructThis hypothesis of global existence is technically convenient so that we may assume some a priori regularity on our solution, namely H10H^{10}. Alternatively, one could develop an H10H^{10} local well-posedness theory for (3.3), and unconditionally construct a mild H10H^{10} solution that blows up in a finite time by a minor modification of the arguments in this paper; we leave the details of this variant of the argument to the interested reader. global mild solutions to any initial value problem of the form (3.3) with CC a local cascade operator and u0u_{0} a Schwartz divergence-free vector field.

As in Definition 3.1, we define the rescaled functions

for (i1,i2,i3,μ1,μ2,μ3)∈S(i_{1},i_{2},i_{3},\mu_{1},\mu_{2},\mu_{3})\in S. From Definition 3.1 we see that CC is indeed a local cascade operator (it is a sum of ∣S∣=7m3|S|=7m^{3} basic local cascade operators), and (4.2) ensures that CC is symmetric. Clearly

for all i1,i2,i3∈{1,…,m}i_{1},i_{2},i_{3}\in\{1,\dots,m\} and (μ1,μ2,μ3)∈S(\mu_{1},\mu_{2},\mu_{3})\in S.

We will select initial data u0u_{0} of the formOur analysis is in fact somewhat stable, and will also apply if u0u_{0} is a sufficiently small perturbation of ψ1,n0\psi_{1,n_{0}} in the Hdf⁡10H^{10}_{\operatorname{df}} norm, thus creating blowup for a non-empty open set of initial data in smooth topologies, although this open set is rather small and is also quite far from the origin (due to the large nature of n0n_{0}). We leave the details of this modification to the interested reader.

for all n<n0n<n_{0}, i=1,…,mi=1,\dots,m, and t≥0t\geq 0.

As uu is a mild solution to (3.3), we have

then from the a priori regularity u∈Ct0Hx10u\in C^{0}_{t}H^{10}_{x} we obtain (4.6) from the Plancherel identity. Taking inner products of (4.14) with ψi,n\psi_{i,n}, we have

or in differentiated form (using (4.6) to justify the calculations)

In particular this shows that ui,nu_{i,n} is continuously differentiable in time (in the Lx2L^{2}_{x} topology, say), which implies that the Xi,nX_{i,n} are continously differentiable.

It is unfortunate that the ψi,n\psi_{i,n} are not eigenfunctions of the Laplacian Δ\Delta, otherwise ui,nu_{i,n} would be always be a scalar multiple of ψi,n\psi_{i,n} (that is, ui,n=Xi,nψi,nu_{i,n}=X_{i,n}\psi_{i,n}), and the equation (3.3) would collapse to a system of ODE in the Xi,nX_{i,n} variables. However, it is still possible to get good control on the dynamics even without the eigenfunction property. To do this, we use the local energies Ei,nE_{i,n} from (4.5). From Cauchy-Schwarz we have

and from Plancherel and the Ct0Hx10C^{0}_{t}H^{10}_{x} bound on uu we have (4.7) for all 0<T<∞0<T<\infty.

By taking inner products of (4.15) with ui,nu_{i,n}, and noting that

we obtain the local energy inequality (4.11). Indeed, one could use Fourier analysis to place an additional dissipation term of 8π2(1+ϵ0)2nEi,n8\pi^{2}(1+\epsilon_{0})^{2n}E_{i,n} on the right-hand side of (4.11), but we will not need to use this term here (it is too small to be of much use, since we are in the regime where dissipation can be treated as a negligible perturbation).

If instead, if we take inner products of (4.15) with ψi,n\psi_{i,n}, and note that

while from (4.8) we see that Ei,n−12Xi,n2E_{i,n}-\frac{1}{2}X_{i,n}^{2} vanishes at time zero. The claim (4.12) then follows from (4.16) and the fundamental theorem of calculus.

Finally, we prove (4.13). For i3=1,…,mi_{3}=1,\dots,m and n<n0n<n_{0}, we see from (4.11), (4.8), (4.9) and the fundamental theorem of calculus that

for any t≥0t\geq 0. Summing this for i=1,…,mi=1,\dots,m and n<n0n<n_{0}, and using (4.6), (4.7) to ensure all summations and integrals are absolutely convergent, we conclude that

By (4.3), all the terms here can be grouped into terms that sum to zero, except for those terms with n=n0−1n=n_{0}-1, (μ1,μ2,μ3)∈{(1,0,0),(0,1,0)}(\mu_{1},\mu_{2},\mu_{3})\in\{(1,0,0),(0,1,0)\}; thus

By the constraint on (μ1,μ2,μ3)(\mu_{1},\mu_{2},\mu_{3}), two of the terms Xi1,n0−1−μ3+μ1X_{i_{1},n_{0}-1-\mu_{3}+\mu_{1}}, Xi2,n0−1−μ3+μ2X_{i_{2},n_{0}-1-\mu_{3}+\mu_{2}}, Xi3,n0−1X_{i_{3},n_{0}-1} may be bounded by ∑n<n0∑i=1mEi,n\sum_{n<n_{0}}\sum_{i=1}^{m}E_{i,n}, and the remaining term may be controlled by (4.6), leading to the bound

for all 0≤t≤T0\leq t\leq T and some finite quantity CT,n0C_{T,n_{0}} depending on T,n0T,n_{0} (and on the quantity in (4.6)). By Gronwall’s inequality, we conclude that ∑n<n0∑i=1mEi,n(t)=0\sum_{n<n_{0}}\sum_{i=1}^{m}E_{i,n}(t)=0 for all t≥0t\geq 0, giving (4.13). ∎

The above lemma shows that (3.3) almost collapses into an ODE system for the Xi,nX_{i,n}. As a first approximation, the reader may wish to ignore the role of the energies Ei,nE_{i,n} (or identify them with 12Xi,n2\frac{1}{2}X_{i,n}^{2}), and pretend that (4.10) is replaced by either the inviscid equation

in the analysis that follows. Note that the viscous equation generalises the dyadic Katz-Pavlovic equation (1.17) (with λ=(1+ϵ0)5/2\lambda=(1+\epsilon_{0})^{5/2} and α=2/5\alpha=2/5), which corresponds to a simple case in which m=1m=1.

Theorem 3.3 now follows from the following ODE result:

We will prove Theorem 4.2 in Section 6, but we first warm up with some finite dimensional ODE toy problems in the next section.

Quadratic circuits

Our objective is to solve an infinite-dimensional system of ODE, roughly of the form (4.17). In order to build up some intuition for doing so, we will first study a finite-dimensional “toy” model, namely ODEs of the form

We first discuss in turn the three quadratic logic gates we will be using, which we call the “pump”, the “amplifier”, and the “rotor”, and then show how these gates can be combined to build a circuit with the desired properties. It looks likely that the set of quadratic gates is sufficiently “Turing complete” in that they can perform extremely general computational tasksOf course, this is bearing in mind that, being globally well-posed ODE, circuits of the form (5.1) are necessarily limited to perform continuous (i.e. analog) operations rather than perfectly digital operations. Also, as the equation (5.1) is time reversible, only reversible computing tasks may be performed by quadratic circuits, at least in the absence of dissipation., but we will not pursueSee for a treatment of continuous computation in PDE, and for continuous computation in ODE. this matter further here.

Strictly speaking, the discussion here is not actually needed for the proof of our main results, but we believe that the model problems studied here will assist the reader in understanding what may otherwise be a highly unmotivated construction and set of arguments in the next section.

where α>0\alpha>0 is a fixed coupling constant (representing the strength of the pump). We will be applying this pump in the regime where xx is initially positive and y≥0y\geq 0; by Gronwall’s inequality (or by integrating factors), we see that xx remains positive for all subsequent time, while yy is increasing. As the total energy x2+y2x^{2}+y^{2} is conserved, we thus see that energy is being pumped from xx to yy. For instance, we have the explicit solution

for any amplitude A>0A>0, which at time t=0t=0 is at the initial state (x(0),y(0))=(A,0)(x(0),y(0))=(A,0). For times 0≤t≤1αA0\leq t\leq\frac{1}{\alpha A}, the yy component increases more or less linearly at rate comparable to αA2\alpha A^{2}, with a corresponding drain of energy from xx; after this time, xx decays exponentially fast (at rate αA\alpha A), with the energy in xx being transferred more or less completely to yy after time t≥CαAt\geq\frac{C}{\alpha A} for a large constant CC. Thus, the pump can be used to execute a delayed, but gradual, transition of energy from one mode (the xx mode) to another (the yy mode). We will schematically depict the pump by a thick arrow: see Figure 2.

If one ignores the dissipation term, the dyadic model equation (1.17) can be viewed as a sequence of pumps chained together, with the coupling constant λn\lambda^{n} of the pump from one mode XnX_{n} to the next Xn+1X_{n+1} increasing exponentially with nn.

One useful feature of the pump which we will exploit is that it can “integrate” an alternating input xx into a monotone output yy, somewhat analogously to how a rectifier in electrical engineering converts AC current to DC current. Indeed, if one couples the xx input of the pump to an external forcing term, thus

with FF highly oscillatory, then xx may oscillate in sign also (if the FF term dominates the energy drain term −αxy-\alpha xy), but the yy output continues to increase at a more or less steady rate. If for instance F(t)=Aωcos⁡(ωt)F(t)=A\omega\cos(\omega t) with some quantities A,ωA,\omega which are large compared to the coupling constant α\alpha, and we set initial conditions x(0)=y(0)=0x(0)=y(0)=0 for simplicity, then we expect xx to behave like Asin⁡(ωt)A\sin(\omega t), and yy to increase at rate about 12αA2\frac{1}{2}\alpha A^{2} on average.

If instead we couple the pump to an oscillatory forcing term on the output, thus

then it is possible that yy can turn negative, which causes the pump to reverse in energy flow to become an amplifier (see below). This behaviour will be undesirable for us, so we will take some care to design our circuit so that the output of a pump does not experience significant negative forcing at key epochs in the dynamics, unless this forcing is counterbalanced by an almost equivalent amount of positive forcing.

2. Application: finite time blowup for an exogenously truncated dyadic model

As a quick application of the pump gate, we establish blowup for the truncated version (1.21) of the dyadic model system (1.17), whenever one has supercritical dissipation:

Let λ>1\lambda>1 and 0<α<1/20<\alpha<1/2, and let 0<δ<1−2α0<\delta<1-2\alpha. Then there exists a natural number n0n_{0}, a sequence of times

for all t∈[0,T∗)t\in[0,T_{*}) other than the times tn0,tn1,…t_{n_{0}},t_{n_{1}},\ldots, and all n≥n0n\geq n_{0}, with the convention that tn0−1=0t_{n_{0}-1}=0 and Xn0−1=0X_{n_{0}-1}=0. Furthermore, we have

for every k≥0k\geq 0. In particular, for any δ′>δ\delta^{\prime}>\delta, we have the blowup

This proposition is not needed for the blowup results in the rest of the paper, but is easier to prove than those results, and already illustrates the basic features of the blowup solutions being constructed. Note that the blowup here is available for all values of the dissipation parameter up to the critical value of 1/21/2, in contrast to the results in and for the untruncated equation (1.17) which cover the ranges α<1/4\alpha<1/4 and α<1/3\alpha<1/3 respectively, as well as the results in establishing global solutions when λ=2\lambda=2 and 2/5≤α≤1/22/5\leq\alpha\leq 1/2.

We let n0n_{0} be a sufficiently large natural number (depending on λ,α,δ\lambda,\alpha,\delta) to be chosen later. We then construct tn0,tn0+1,…t_{n_{0}},t_{n_{0}+1},\ldots and Xn(t)X_{n}(t) iteratively as follows:

Initialise k=0k=0 and tn0=0t_{n_{0}}=0. We also initialise

Now suppose that tn0+kt_{n_{0}+k} has been constructed, and the solution Xn(t)X_{n}(t) constructed for all times 0≤t≤tn0+k0\leq t\leq t_{n_{0}+k} and n≥n0n\geq n_{0}. We then solve the pump system with dissipation

within the time interval t∈[tn0+k,tn0+k+1]t\in[t_{n_{0}+k},t_{n_{0}+k+1}], where tn0+k+1t_{n_{0}+k+1} is the first time for which Xn0+k+1(tn0+k+1)=λ−δ(k+1)X_{n_{0}+k+1}(t_{n_{0}+k+1})=\lambda^{-\delta(k+1)}; we justify the existence of such a time below.

For each n≠n0+k,n0+k+1n\neq n_{0}+k,n_{0}+k+1, we evolve XnX_{n} on [tn0+k,tn0+k+1][t_{n_{0}+k},t_{n_{0}+k+1}] by the linear ODE

Increment kk to k+1k+1 and return to Step 2.

Let us now establish that the time tn0+k+1t_{n_{0}+k+1} introduced in Step 2 is well defined for any given k≥0k\geq 0. If we make the change of variables

then we see from construction that we have the initial conditions

and our task is to show that y(t)=λ−δy(t)=\lambda^{-\delta} for some finite t>0t>0. However, from the explicit solution (5.4) to the pump gate (5.3), we see that in the case ε=0\varepsilon=0, this occurs at time t=tanh⁡−1(λ−δ)t=\operatorname{tanh}^{-1}(\lambda^{-\delta}); standard perturbation arguments then show that if n0n_{0} is sufficiently large (which forces ε\varepsilon to be sufficiently small), the claim occurs at some time t≤2tanh⁡−1(λ−δ)t\leq 2\operatorname{tanh}^{-1}(\lambda^{-\delta}) (say). Undoing the scaling, we see that

so tnt_{n} converges to a finite limit T∗T_{*} as n→∞n\to\infty, and the claim follows. ∎

One cannot take δ=0\delta=0 in the above argument, because the pump gate never quite transfers all of its energy from the xx mode to the yy mode. If however we worked with the modified equation

for some function g:[0,+∞)→[0,+∞)g:[0,+\infty)\to[0,+\infty) increasing to infinity, and defines tn0+k+1t_{n_{0}+k+1} to be the first time for which Xn0+k(tn0+k+1)=0X_{n_{0}+k}(t_{n_{0}+k+1})=0 (so that Xn0+k+1X_{n_{0}+k+1} is the only non-zero mode at this time), then a modification of the above argument establishes finite time blowup whenever n0n_{0} is sufficiently large and

basically because one can show inductively that Xn0+k(tn0+k)X_{n_{0}+k}(t_{n_{0}+k}) is comparable to 11, tn0+k+1−tn0+kt_{n_{0}+k+1}-t_{n_{0}+k} is comparable to λ−n\lambda^{-n}, and the energy dissipation on each time interval [tn0+k,tn0+k+1][t_{n_{0}+k},t_{n_{0}+k+1}] is comparable to 1g(λn0+k)2\frac{1}{g(\lambda^{n_{0}+k})^{2}}; we omit the details. This is compatible with the heuristic calculation in [39, Remark 1.2]. In the converse direction, the arguments in or should ensure global regularity for the above equation (or for the analogous hyperdissipative version of (1.17)) under the condition

This leaves an intermediate regime (e.g. g(s)=log⁡(1+s)βg(s)=\log(1+s)^{\beta} for 1/4<β≤1/21/4<\beta\leq 1/2) in which it is unclear whether one can force blowupSince the initial release of this manuscript, it has been shown in (see also ) that blowup in fact does not occur in this intermediate regime. Roughly speaking, the basic point is that as the energy moves from low frequency modes to high frequency modes, it must transition through all intermediate frequency scales, and the cumulative energy dissipation from such transitions is enough to prevent the solution from escaping to frequency infinity in this intermediate regime. with any of these ODE models. The analysis in or suggests that this may be possible, but one would have to work with models in which many different modes are activated at once (in contrast to the situation in Proposition 5.1, in which only two modes have interesting dynamics at any given time).

3. The amplifier gate

The amplifier gate is a reversed version of the pump gate:

Here again α>0\alpha>0 is a coupling constant, indicating the strength of the amplifier. We will use this gate in the regime in which xx is positive and large, and yy is positive but small. In this case, we can explicitly solve the second equation to obtain

for any t≥t0t\geq t_{0}, which suggests that yy grows exponentially at rate comparable to αx(0)\alpha x(0), until such time that the yy mode begins to drain a significant fraction of energy from the xx mode. Thus, the xx mode can be viewed as causing exponential amplification in the yy mode. Of course, in the presence of forcing terms, we no longer have the exact formula (5.11), but we may take advantage of Gronwall’s inequality to obtain analogous control on yy.

As with the pump gate, the amplifier gate preserves the total energy x2+y2x^{2}+y^{2}. An explicit solution to (5.10) is given by

for any A>0A>0 and T>0T>0. For 0<t<T0<t<T, the quantity yy increases exponentially at rate about αA\alpha A, while xx stays roughly steady at AA.

By using the amplifier with a large coupling constant α\alpha, xx large and positive, and yy small and positive, we can cause yy to grow at a rapid exponential rate, and in particular to transition abruptly from being small (e.g. y≤εy\leq\varepsilon for some threshold ε\varepsilon) to being large (e.g. y>2εy>2\varepsilon), if the threshold ε\varepsilon is set low enough that yy does not yet begin to drain significant amounts of energy from xx. This ability to generate abrupt transitions is of course needed in our quest to engineer an abrupt delayed transition of energy from one mode to another. This behaviour can be disrupted if xx becomes negative at some point, but we will avoid this in practice by making xx the output of a pump (which, as discussed previously, can serve to “rectify” an alternating input into a steadily increasing output). We will represent the amplifier schematically by a triangle-headed arrow (Figure 3).

4. The rotor gate

where again α>0\alpha>0 is a parameter. This of course preserves the total energy x2+y2+z2x^{2}+y^{2}+z^{2} and has the explicit solution

in which (x(t),y(t))(x(t),y(t)) rotates around the origin at a contant angular rate αz(t0)\alpha z(t_{0}), while zz remains fixed. Thus the zz mode can be viewed as driving the oscillating interchange of energy between the xx and yy modes.

Because we will be coupling the rotor to various forcing terms in xx, yy, and zz, we cannot rely directly on the above explicit solution, although this solution is of course very useful for supplying intuition as to how the rotor behaves. Instead, we will use energy-based analyses of the rotor, which are much more robust with respect to forcing terms. Firstly we observe that for the rotor with no forcing, the combined energy of the xx and yy modes is conserved:

In a related spirit, we have the equipartition of energy identity

Using the conserved energy x2+y2=Ex^{2}+y^{2}=E and the constant nature of zz, this becomes

and similarly with x(t)x(t) replaced by y(t)y(t). Thus we see that over any time interval significantly longer than the period 2πα∣z(t0)∣\frac{2\pi}{\alpha|z(t_{0})|}, the xx mode absorbs about half the energy EE of the combined pair x,yx,y, and similarly for yy.

In our application, we will use the rotor with the driving mode zz being the output of an amplifier. As noted previously, amplifier outputs can transition rapidly from being small to being large, so the pair (x,y)(x,y) will initially be almost stationary, and then suddenly transition to a highly oscillatory state. This creates a “jolt” of “alternating current”, which we will then quickly transform to “direct current” via a pump gate.

We describe the rotor gate schematically by a loop connecting the xx and yy modes that is driven by the zz mode: see Figure 4.

5. A delayed and abrupt energy transition

This system looks complicated and artificial, with a rather arbitrary looking set of coupling constants of wildly differing magnitudes, but it should be viewed as a superposition of five quadratic gates:

A pump of coupling constant ε\varepsilon that transfers a small amount of energy from aa to bb;

A pump of coupling constant ε2exp⁡(−K10)\varepsilon^{2}\exp(-K^{10}) that transfers a minute amount of energy from aa to cc;

An amplifier of coupling constant ε−1K10\varepsilon^{-1}K^{10} that uses bb to rapidly amplify cc;

A rotor of coupling constant ε−2\varepsilon^{-2} that uses cc to (eventually) rotate energy very rapidly between aa and dd; and

As a caricature, the evolution of this system can be described as follows, involving a critical time tc≈2t_{c}\approx\sqrt{2}:

At a critical time tc≈2t_{c}\approx\sqrt{2}, there is an abrupt transition when the exponentially growing cc suddenly (within a time of O(K−10)O(K^{-10}) or so) transitions from being much smaller than ε2\varepsilon^{2} to being much larger than ε2\varepsilon^{2}. This ignites the rotor gate, which then begins to rapidly transfer energy between aa and dd. By equipartition of energy, d2d^{2} will approximately be equal to 1/21/2 on the average.

We depict these dynamics schematically in Figure 6.

If KK is sufficiently large, and ε\varepsilon sufficiently small depending on KK, then there exists a time

We shall use the usual bootstrap procedure of starting with crude estimates and steadily refining them to stronger estimates on this interval, using continuity arguments if necessary in case the crude estimates are initially only available at t=0t=0 rather than for all t∈t\in.

From conservation of energy and (5.18) we have

throughout this interval. In particular, we have

We can improve this bound on bb and cc as follows. From (5.14), (5.15) we have the local energy identity

(in a weak derivativeTo justify this step (a very simple example of the diamagnetic inequality (see e.g. [30, §7.19-7.22]) in action), one can first work instead with (b2+c2+δ)1/2(b^{2}+c^{2}+\delta)^{1/2} for some small δ>0\delta>0, in order to avoid any singularity, and then take distributional limits as δ→0\delta\to 0. sense), and so from (5.18) and the fundamental theorem of calculus we see in particular that

for t∈t\in. Inserting this into (5.15), we see that

for t∈t\in (note from the initial condition c(0)=0c(0)=0 and a comparison argument that c(t)≥0c(t)\geq 0 for all t≥0t\geq 0). By Gronwall’s inequality we thus have

for all t∈t\in and some absolute constant C>0C>0. Finally, from (5.16), (5.17) we have the local energy identity

and thus by (5.18) and the fundamental theorem of calculus

which is a good bound for short times t≤1/Ct\leq 1/C.

for t∈[0,tc]t\in[0,t_{c}]. Comparing this with (5.26) we conclude that tc≳1t_{c}\gtrsim 1. From (5.27) we have

for t∈[0,tc]t\in[0,t_{c}]. Inserting these bounds and (5.24) back into (5.13), we have

on [0,tc][0,t_{c}], so from (5.18) (and assuming ε\varepsilon sufficiently small depending on KK) we have

for t∈[0,tc]t\in[0,t_{c}]. This already gives all the bounds (5.20). Inserting the aa bound into (5.14) and using (5.29), we have

and so from (5.18) (again assuming ε\varepsilon sufficiently small depending on KK) we have

for t∈[0,tc]t\in[0,t_{c}]. Inserting these bounds into (5.15), we have

and hence by (5.18) and Gronwall’s inequality

for t∈[0,tc]t\in[0,t_{c}]. In particular (since tc≳1t_{c}\gtrsim 1), standard asymptotics on the error function give

which, when compared against the definition of tct_{c}, shows (5.19). In particular, tc<2t_{c}<2 (for KK large enough), and so

Having described the evolution up to time tct_{c}, we now move to the future of tct_{c}. From (5.30) we have

Meanwhile, from (5.26), (5.14) (discarding the non-negative εa2\varepsilon a^{2} term) we have

for t∈[tc,2]t\in[t_{c},2], so (for ε\varepsilon small enough) we also have

for t∈[tc,2]t\in[t_{c},2]. Inserting this bound into (5.15), and discarding the non-negative ε2exp⁡(−K10)a2\varepsilon^{2}\exp(-K^{10})a^{2} term, we arrive at the exponential growth

for t∈[tc,2]t\in[t_{c},2]. From this, (5.31), and Gronwall’s inequality, we see in particular that

for tt in the time interval I:=[tc+K−9,2]I:=[t_{c}+K^{-9},2]. In other words, the rotor gate will be continuously and strongly activated from time tc+K−9t_{c}+K^{-9} onwards. On the other hand, from (5.25), (5.32) we also have

for t∈It\in I, so the exponential growth rate of cc remains under control in this region.

Similarly, from (5.13), (5.16), and (5.23) one has

We conclude using (5.32), (5.33), and the product rule that

for t∈It\in I, so if we define the modified energy

Starting with the crude bound E∗(tc)=O(1)E_{*}(t_{c})=O(1) from (5.35), we thus see from Gronwall’s inequality that

whenever tc≤t′≤t≤2t_{c}\leq t^{\prime}\leq t\leq 2. We will use this bound with t′:=tc+1/Kt^{\prime}:=t_{c}+1/K. We claim that

Suppose this is not the case; then by (5.17) we have

However, by repeating the derivation of (5.34) we have

and hence by the fundamental theorem of calculus and (5.32) we have

combining this with the previous estimate, we conclude that

in this interval, giving the required contradiction.

Inserting the bound (5.37) into (5.36), we conclude in particular that

for tc+1K≤t≤2t_{c}+\frac{1}{\sqrt{K}}\leq t\leq 2, and (5.21) follows from (5.35) and (5.22). ∎

Blowup for the cascade ODE

We can now prove Theorem 4.2 (and hence Theorem 3.3 and Theorem 1.5). The idea is to chain together an infinite sequence of circuits of the form (5.13)-(5.17), so that (a more complicated version of) the analysis from Theorem 5.3 may be applied.

Let ϵ0>0\epsilon_{0}>0 be fixed; we allow all implied constants in the O()O() notation to depend on ϵ0\epsilon_{0}. As in the previous section, we need a large constant K≥1K\geq 1, which we assume to be sufficiently large depending on ϵ0\epsilon_{0}, and then a small constant 0<ε<10<\varepsilon<1, which we assume to be sufficiently small depending on both KK and ϵ0\epsilon_{0}. Finally, we take n0n_{0} sufficiently large depending on ϵ0,K,ε\epsilon_{0},K,\varepsilon.

The reader may wish to keep in mind the hierarchy of parameters

as a heuristic for comparing the magnitude of various quantities appearing in the sequel. Thus, for instance, a quantity of the form O(exp⁡(O(K10))(1+ϵ0)−n0/2)O\left(\exp\left(O\left(K^{10}\right)\right)\left(1+\epsilon_{0}\right)^{-n_{0}/2}\right) will be smaller than exp⁡(−K10)ε2\exp\left(-K^{10}\right)\varepsilon^{2}; a quantity of the form O(exp⁡(O(K10))ε)O\left(\exp\left(O\left(K^{10}\right)\right)\varepsilon\right) will be smaller than K−100K^{-100}; and so forth.

The dimension parameter mm for the system we will use to prove Theorem 4.2 will be taken to be m=4m=4. We set the coefficients αi1,i2,i3,μ1,μ2,μ3\alpha_{i_{1},i_{2},i_{3},\mu_{1},\mu_{2},\mu_{3}} by using Table 1, with αi1,i2,i3,μ1,μ2,μ3\alpha_{i_{1},i_{2},i_{3},\mu_{1},\mu_{2},\mu_{3}} set equal to zero if it does not appear in the above table. It is clear that the required symmetry property (4.2) and the cancellation property (4.3) hold. Also, the hypotheses of Lemma 4.1(v) are satisfied.

It will be convenient to work with the combined energy

By Lemma 4.1(iii), we have the equations of motion

(compare with (5.13)-(5.17)) and the local energy inequality

As mentioned in the previous section, if one ignores the dissipation terms, the system (6.3)-(6.6) describes an infinite number of (rescaled) copies of the quadratic circuit analysed in Theorem 5.3, with the output of each such circuit chained to the input of a slightly faster-running version of the same circuit; see Figure 7.

By Lemma 4.1(iii), we have the initial conditions

To prove Theorem 4.2, it thus suffices to show

2. Second step: describing the blowup dynamics

We will establish the following description of the dynamics of Xi,nX_{i,n} and Ei,nE_{i,n}:

Let N≥n0N\geq n_{0} be an integer. Then there exist times

(Scale evolution) For all n0<n≤Nn_{0}<n\leq N, one has the amplitude stability

(Transition state) For all n0≤n≤Nn_{0}\leq n\leq N, we have the bounds

If n0<n≤Nn_{0}<n\leq N, we have the additional bounds

(Energy estimates) For all n0<n≤Nn_{0}<n\leq N and tn−1≤t≤tnt_{n-1}\leq t\leq t_{n}, we have the bounds

These bounds may appear somewhat complicated, but roughly speaking they assert that at each time tnt_{n}, the solution concentrates an important part of its energy at scale nn (and significantly less energy at adjacent scales); see Table 2 and Figure 8. The precise bounds here do have to be chosen carefully, because of a rather intricate induction argument in which the estimates for a given value of NN are used to prove the estimates for N+1N+1. For this reason, no use of the asymptotic notation O()O() appears in the above proposition. Of the four modes X1,n,X2,n,X3,n,X4,nX_{1,n},X_{2,n},X_{3,n},X_{4,n}, it is the first mode X1,nX_{1,n} that carries most of the energy at the checkpoint time tnt_{n}; the secondary modes X2,n,X3,nX_{2,n},X_{3,n} play an important role in driving the dynamics (and so many of the more technical bounds in (viii) are devoted to controlling these modes) but carryAs a crude first approximation (ignoring factors depending on KK), one should think of X2,nX_{2,n} as being about ε\varepsilon the size of X1,nX_{1,n} or X4,nX_{4,n}, and X3,nX_{3,n} being about ε2\varepsilon^{2} the size of X1,nX_{1,n} or X4,nX_{4,n}. very little energy, while the X4,nX_{4,n} mode is only used as a conduit to transfer energy from the X1,nX_{1,n} mode to the X1,n+1X_{1,n+1} mode. The bounds (6.21)-(6.24) are technical; they are needed to ensure that the rotor at scale n−1n-1 is rotating so quickly that the modes at scale n−1n-1 do not cause any “constructive interference” with the modes at scale nn at time tnt_{n} (or at slightly later times).

Let us now see how the above proposition implies Theorem 6.2 (and hence Theorem 4.2, Theorem 3.3 and Theorem 1.5). Let N≥n0N\geq n_{0} be arbitrary. From (6.12), (6.13), (6.14) we have

and hence by (6.11) and summing the geometric series we have

for some finite T=Tϵ0T=T_{\epsilon_{0}} independent of NN. On the other hand, from (6.15), (6.13), (6.12) we have

for any NN. Sending NN to infinity, we contradict (6.1).

3. Third step: setting up the induction

It remains to prove Proposition 6.3. We do so by an induction on NN. The base case N=n0N=n_{0} is easy: one sets tn0=0t_{n_{0}}=0 and en0=1e_{n_{0}}=1, and all the required claims are either vacuously true or follow immediately from the initial conditions (6.8). It remains to establish the inductive case of this proposition. For the convenience of the reader, we state this inductive case as an explicit proposition.

Assume that Proposition 6.3 has already been established for some N≥n0N\geq n_{0}, giving times

with the properties (6.11)-(6.27) stated in that proposition. Then there exists a time

and an amplitude eN+1>0e_{N+1}>0 obeying the following properties:

(Scale evolution) One has the amplitude stability

(Energy estimates) For all tN≤t≤tN+1t_{N}\leq t\leq t_{N+1}, we have the bounds

Clearly, Proposition 6.4 implies Proposition 6.3 (and hence Theorems 6.2, 4.2, 3.3 and 1.5).

4. Fourth step: renormalising the dynamics

It is convenient to perform a rescaling to essentially eliminate the role of the time tNt_{N}, the energy eNe_{N}, and the scale (1+ϵ0)−N(1+\epsilon_{0})^{-N}, in order to make the dynamics closely resemble those in Theorem 5.3. More precisely, Proposition 6.4 rescales as follows.

Let 0<ϵ0<10<\epsilon_{0}<1, let K>0K>0 be sufficiently large depending on ϵ0\epsilon_{0}, let ε>0\varepsilon>0 be sufficiently small depending on ϵ0,K\epsilon_{0},K, and let n0n_{0} be sufficiently large depending on ϵ0,K,ε\epsilon_{0},K,\varepsilon, and the implied constants in (6.45)-(6.48), (6.51), (6.53) below. Let N≥n0N\geq n_{0}, and suppose we have rescaled times

whenever k<n0−Nk<n_{0}-N and t≥τn0−Nt\geq\tau_{n_{0}-N}.

and if N>n0N>n_{0} we have the additional bounds

whenever n0−N<k≤0n_{0}-N<k\leq 0 and τk−1≤t≤τk\tau_{k-1}\leq t\leq\tau_{k}.

The dynamics (6.45)-(6.48) are depicted in Figure 9 (with the dissipative terms ignored). Note how the rescaling has placed the tiny factor of (1+ϵ0)−n0/2(1+\epsilon_{0})^{-n_{0}/2} in front of all the viscosity terms in (6.45)-(6.48), thus highlighting the lower order nature of these terms for our analysis. This small factor is ultimately reflecting the supercritical nature of the dissipation; in practice, this factor will allow us to treat all dissipative terms as negligible.

Let us now explain why Proposition 6.5 implies Proposition 6.4 (and hence Proposition 6.3 and Theorems 6.2, 4.2, 3.3 and 1.5). Let the notation and hypotheses be as in Proposition 6.4. We then define the rescaled times

for n0−N≤k≤0n_{0}-N\leq k\leq 0, as well as the rescaled solutions

for n0−N≤k≤0n_{0}-N\leq k\leq 0 follows from (6.13) and (6.83); from this, (6.14), (6.82) and summing the geometric series we then obtain (6.53) (recall that we allow implied constants in the ≲\lesssim or O()O() notation to depend on ϵ0\epsilon_{0}).

If we directly rescale (6.3)-(6.6), we obtain (6.45)-(6.48), except with the factors (1+ϵ0)2k−n0/2(1+\epsilon_{0})^{2k-n_{0}/2} replaced by (1+ϵ0)2k−N/2eN−1(1+\epsilon_{0})^{2k-N/2}e_{N}^{-1}. However, from (6.13), (6.12) we have

This gives the equations of motion (6.45)-(6.48). The energy inequality (6.49) is similarly obtained from rescaling (6.7).

The initial conditions (6.50) follow from rescaling (6.8) (and also using (6.11)). Similarly, (6.51) follows from rescaling (6.9), and (6.52) follows from rescaling (6.10). Similarly, the conditions (6.54)-(6.63) follow from rescaling (6.15)-(6.24). Finally, (6.64)-(6.66) follow from rescaling (6.25)-(6.27) and using (6.84). We then apply Proposition 6.5 to obtain τ1,μ1\tau_{1},\mu_{1} with the stated properties (6.67)-(6.81). It is then routine to verify that the conclusions of Proposition 6.4 are satisfied with

For future reference, we record one consequence of the energy estimates (6.64)-(6.66):

(The implied constant here may depend on mm.)

whenever τk−1≤t≤τk\tau_{k-1}\leq t\leq\tau_{k} and n0−N<k≤0n_{0}-N<k\leq 0, and so

Applying (6.53) and summing the geometric series, we obtain the claim. ∎

5. Fifth step: crude energy estimates for distant modes

We now begin the proof of Proposition 6.5. For the rest of this section, we assume the notations and hypotheses are as in that proposition.

The first stage is to establish the energy bounds (6.79), (6.80), (6.81) (and also the bound (6.73)) on a certain time interval 0≤t≤T10\leq t\leq T_{1}; the quantity τ1\tau_{1} will later be chosen between and T1T_{1}, thus establishing the required bounds (6.79), (6.80), (6.81), (6.73) for 0≤t≤τ10\leq t\leq\tau_{1}.

We first establish bounds at time t=0t=0 that are slightly better than the required bounds (6.79), (6.80), (6.81), (6.73).

Let the notation and assumptions be as in Proposition 6.5. Then we have

From (6.64), (6.66) for k=0k=0 and t=0t=0, we have

which implies the claims (6.85) for all m≥3m\geq 3 and (6.87) for m≥1m\geq 1, after shifting mm by one. The claim (6.85) for m=2m=2 follows from (6.59) (since KK is large depending on ϵ0\epsilon_{0}). Also, from (6.90) we have

the claim (6.88) then follows from (6.51).

It remains to establish (6.86). From (6.51) one has

Applying Lemma 6.7, and recalling that KK and n0n_{0} are assumed sufficiently large, the claim (6.86) follows. ∎

We now define T1T_{1} to be the largest time in $$ for which one has the bounds

for all 0≤t≤T10\leq t\leq T_{1}. Lemma 6.8 ensures that T1T_{1} is well-defined (note that all the conditions here are closed conditions in tt).

We record a variant of the arguments in Lemma 6.8 that will be needed later:

For any k=−1,0,1k=-1,0,1 and 0≤t≤T10\leq t\leq T_{1}, one has

The portion of the integral with 0≤t≤T10\leq t\leq T_{1} is controlled by (6.92), (6.93), and the trivial bound T1≤100T_{1}\leq 100. The claim now follows from Lemma 6.7. ∎

The bounds (6.92)-(6.95) look like an infinite number of conditions, but note from the qualitative decay property (6.44) that

Now we use local energy estimates to rule out several of the ways in which one can “exit” the bounds (6.92)-(6.95).

Integrating (6.49) on [0,T1][0,T_{1}], we conclude that

Now suppose that m≥3m\geq 3. From (6.99) with k=1−mk=1-m and (6.85), we have

From (6.92) (and now using the hypothesis m≥3m\geq 3) we have

for 0≤t≤T10\leq t\leq T_{1}, and so (since T1≤100T_{1}\leq 100)

and (6.96) follows (assuming KK large enough).

Similarly, if m≥1m\geq 1, we may apply (6.99) with k=1+mk=1+m and use (6.87) to obtain

From (6.94) (and (6.95) when m=1m=1) we have

and (6.97) follows (assuming KK large enough). ∎

From this lemma and the previous discussion, we have some partial control on how we exit the regime:

At least one of the following assertions hold:

Although we will not need this fact here, it turns out (using a refinement of the analysis below) that it is option (6.102) which actually occurs in this trichotomy.

Thanks to (6.92)-(6.95), the task of proving Proposition 6.5 has now reduced to the following claim:

Let the notation and hypotheses be as in Proposition 6.5, and let T1T_{1} be defined as above. There exists a time

(in particular, T1≥1/100T_{1}\geq 1/100) and an amplitude

Indeed, the remaining claims (6.73), (6.79), (6.80), (6.81) of Proposition 6.5 follow for τ1\tau_{1} obeying (6.104) from (6.92)-(6.95) (using (6.105) to handle the μ1\mu_{1} factor in (6.73)).

We now begin the proof of Proposition 6.12. Henceforth the notation and assumptions are as in that proposition.

It turns out that we can reduce to the setting in which the dynamics of b1,c1,d1b_{1},c_{1},d_{1} are essentially trivial. The key proposition is

Suppose that 0≤τ≤T10\leq\tau\leq T_{1} is a time such that

whenever n0−N<k≤0n_{0}-N<k\leq 0 and τk−1≤t≤τk\tau_{k-1}\leq t\leq\tau_{k}. From this and (6.53) we conclude the crude bound

Let τ′\tau^{\prime} be the largest time in [τn0−N,τ][\tau_{n_{0}-N},\tau] for which

From continuity we see that either τ′=τ\tau^{\prime}=\tau, or else

We rule out the latter possibility as follows. From (6.47) one has

for all t≥τn0−Nt\geq\tau_{n_{0}-N}, while from (6.50) one has c1(τn0−N)=0c_{1}(\tau_{n_{0}-N})=0. From Gronwall’s inequality and (6.121), we conclude that

for any τn0−N≤t≤τ′\tau_{n_{0}-N}\leq t\leq\tau^{\prime}. In particular, from (6.120) and (6.93) we have

for all τn0−N≤t≤τ′\tau_{n_{0}-N}\leq t\leq\tau^{\prime} (here we use the trivial bound τ′≤τ≤T1≤100\tau^{\prime}\leq\tau\leq T_{1}\leq 100).

for all t≥τn0−Nt\geq\tau_{n_{0}-N}, and hence by (6.50)

In particular, from (6.123), (6.120), (6.115) we have

for 0≤t≤τ′0\leq t\leq\tau^{\prime}. However, this is inconsistent with (6.122) if KK is small enough (recalling that τ′≤100\tau^{\prime}\leq 100). Thus τ′=τ\tau^{\prime}=\tau. The bounds (6.116), (6.117), (6.118) now follow from (6.123), (6.124), (6.125).

Finally, from (6.48) and (6.117), (6.93), (6.94) we have

for 0≤t≤τ′0\leq t\leq\tau^{\prime} (taking n0n_{0} large enough), and from this, (6.88), and Gronwall’s inequality one obtains (6.119) (for KK large enough). ∎

Let T2T_{2} be the largest time in [0,T1][0,T_{1}] such that

Combining Proposition 6.13 with Corollary 6.11 and using continuity, we conclude

At least one of the following assertions hold:

Again, it turns out that it is option (6.127) that actually occurs, although we will not quite prove (or use) this assertion here.

The most important modes for the remainder of the analysis are a0,b0,c0,d0a_{0},b_{0},c_{0},d_{0}, and a1a_{1}. From (6.45)-(6.48), the energy bounds (6.92)-(6.94), and Proposition 6.13, we observe the equations of motion

for these modes in the time interval 0≤t≤T20\leq t\leq T_{2}. When N>n0N>n_{0}, we also need to keep some track of the modes a−1,b−1,c−1,d−1a_{-1},b_{-1},c_{-1},d_{-1}; again from (6.45)-(6.48) and (6.92)-(6.94), these equations may be given as

The dynamics of these variables a−1,b−1,c−1,d−1a_{-1},b_{-1},c_{-1},d_{-1}, do not directly impact the dynamics in (6.129)-(6.133); however we will still need to track these variables in order to prevent a premature exit of the form (6.126) that could potentially be caused by energy flowing back from a0a_{0} to d−1d_{-1}.

The task of proving Proposition 6.12 has now reduced further, to that of establishing the following claim.

Let the notation and hypotheses be as in Proposition 6.5, and let T1T_{1} and T2T_{2} be defined as above. There exists a time

(in particular, T2≥1/100T_{2}\geq 1/100) such that we have the bounds

Indeed, Proposition 6.12 follows from Proposition 6.15 and Proposition 6.13 once we set μ1:=a1(τ1)\mu_{1}:=a_{1}(\tau_{1}) (and take KK sufficiently large, ε\varepsilon sufficiently small, and n0n_{0} sufficiently large).

7. Seventh step: dynamics at the zero scale

We now prove Proposition 6.15 (and hence Propositions 6.12, 6.4, 6.3 and Theorems 6.2, 4.2, 3.3 and 1.5).

The task at hand is now very close to the situation in Theorem 5.3, and we will now repeat the proof of that theorem with minor modifications, except for a technical distraction having to do with eliminating a premature exercise of the option (6.126), which requires some analysis of the −1-1-scale dynamics.

for all 0≤t≤T20\leq t\leq T_{2}. Actually, we can do a bit better than this. From (6.129)-(6.133) and (6.145) we have

for 0≤t≤T20\leq t\leq T_{2} (if n0n_{0} is large enough), whereas from (6.54)-(6.58) and (6.66) we have

By the fundamental theorem of calculus, we conclude that

Now (as in the proof of Theorem 5.3) we obtain improved bounds on b,cb,c. From (6.130), (6.131), (6.145) one has

for all 0≤t≤T20\leq t\leq T_{2}, and thus by (6.146)

for all 0≤t≤T20\leq t\leq T_{2} (interpreting the derivative in a weak sense). On the other hand, from (6.55), (6.56) we have

From the fundamental theorem of calculus, we conclude that

for all 0≤t≤T20\leq t\leq T_{2}. Inserting this (and (6.146)) into (6.131), we obtain

for all 0≤t≤T20\leq t\leq T_{2}. In particular, by (6.56) and Gronwall’s inequality, we have the bound

for all 0≤t≤T20\leq t\leq T_{2}. Finally, from (6.132), (6.133) we have

for all 0≤t≤T20\leq t\leq T_{2}, and hence by (6.145)

for all 0≤t≤T20\leq t\leq T_{2} (interpreted in a weak sense). From (6.58), (6.66) we have

and hence by (6.148) and Gronwall’s inequality

for all 0≤t≤T20\leq t\leq T_{2}. Inserting this bound into (6.129), we see that

for all 0≤t≤T20\leq t\leq T_{2}, which among other things implies (from (6.54)) that a0(t)≥0a_{0}(t)\geq 0 whenever 0≤t≤min⁡(T2,1/2)0\leq t\leq\min(T_{2},1/2). From the k=−1k=-1 case of (6.49), we thus have

for 0≤t≤min⁡(T2,1/2)0\leq t\leq\min(T_{2},1/2); by (6.92) we conclude that

which rules out the first option of Corollary 6.14 if T2≤1/2T_{2}\leq 1/2. The second option of this corollary is also ruled out when T2≤1/2T_{2}\leq 1/2, thanks to (6.151). We conclude that

Now we sharpen the bounds on a0(t),b0(t),c0(t),d0(t),a1(t)a_{0}(t),b_{0}(t),c_{0}(t),d_{0}(t),a_{1}(t). Let tct_{c} be the supremum of all the times t∈[0,T2]t\in[0,T_{2}] for which ∣c(t′)∣≤K−10ε2|c(t^{\prime})|\leq K^{-10}\varepsilon^{2} for all 0≤t≤t′0\leq t\leq t^{\prime}, thus

for all 0≤t≤tc0\leq t\leq t_{c}. Comparing this with (6.148), (6.152), we conclude that

From (6.149), (6.150), (6.153), and Gronwall’s inequality one has

for all 0≤t≤tc0\leq t\leq t_{c}. Inserting these bounds and (6.147) back into (6.129), we see that

for 0≤t≤tc0\leq t\leq t_{c}, and thus by (6.54) we have

for 0≤t≤tc0\leq t\leq t_{c}. Inserting this into (6.130) and using (6.153), we conclude that

for 0≤t≤tc0\leq t\leq t_{c}, and hence by (6.55)

for all 0≤t≤tc0\leq t\leq t_{c}. Meanwhile, inserting (6.156) into (6.131), we obtain

for all 0≤t≤tc0\leq t\leq t_{c}, and hence by (6.57), (6.157) and Gronwall’s inequality we see that

whenever 1/2≤t≤tc1/2\leq t\leq t_{c}. Comparing this with (6.153) we see that

(say), which by definition of (6.153) implies that

Having described the evolution up to time tct_{c}, we now move to the future of tct_{c}, and specifically in the interval [tc,τ1][t_{c},\tau_{1}] where

whenever t≤τ1t\leq\tau_{1}. From this and Corollary 6.14 (and (6.158)) we conclude

At least one of the following assertions hold:

We will shortly eliminate the option (6.161), but first we need more control on the dynamics.

Meanwhile, from (6.148), (6.130) (discarding the non-negative εa02\varepsilon a_{0}^{2} term) we have

for all tc≤t≤τ1t_{c}\leq t\leq\tau_{1} (with n0n_{0} large enough); we conclude (for ε\varepsilon small enough) that

(say) for all tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. Inserting this bound into (6.131), and discarding the non-negative ε2exp⁡(−K10)a02\varepsilon^{2}\exp(-K^{10})a_{0}^{2} term, we see from (6.159) and a continuity argument that

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1} (in particular, c0c_{0} is positive on this interval), and furthermore that we have the exponential growth

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. We conclude that

for tt in the interval I:=[tc+K−9,τ1]I:=[t_{c}+K^{-9},\tau_{1}]. (We have not yet ruled out the possibility that this time interval is empty, although we will shortly show that this is not the case.) In the opposite direction, we see from (6.145), (6.147), (6.164), (6.131) that

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. From (6.159), (6.160), and Gronwall’s inequality, we thus have the upper bound

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. Crucially, this upper bound will be significantly smaller than a lower bound for c−1c_{-1} in the same interval, leading to an important mismatch in speeds between the -scale and −1-1-scale dynamics that prevents a premature exit via (6.161). More precisely, we have

for all tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. In particular, by Proposition 6.16 we have

and hence the interval I=[tc+K−9,τ1]I=[t_{c}+K^{-9},\tau_{1}] is non-empty.

If N=n0N=n_{0} then this is immediate from (6.52), so we may assume that N>n0N>n_{0}. In particular, the bounds (6.60)-(6.63) are available.

We will need some additional bounds on b−1,c−1b_{-1},c_{-1}. From (6.135), (6.92) (discarding the second term in (6.135) as being non-positive) we have

for all 0≤t≤τ10\leq t\leq\tau_{1}. From this and (6.61), we have

for 0≤t≤τ10\leq t\leq\tau_{1}. Meanwhile, from (6.136) (using (6.92) to bound a−1a_{-1}) we have

By Gronwall’s inequality and (6.63), we thus have

for 0≤t≤τ10\leq t\leq\tau_{1}. Inserting this back into (6.135), we see that

for 0≤t≤τ10\leq t\leq\tau_{1} (if ε\varepsilon is small enough). Inserting this into (6.136), we see that

for 0≤t≤τ10\leq t\leq\tau_{1}, and hence by (6.62)

for 1/10≤t≤τ11/10\leq t\leq\tau_{1} (if n0n_{0} is large enough). Returning to (6.135), we now have (thanks to (6.172)) that

for 0≤t≤τ10\leq t\leq\tau_{1}, and thus by (6.61)

for 0≤t≤τ10\leq t\leq\tau_{1}; from (6.136), (6.173), (6.92) we now have

From (6.92) we have d−22a−1(t)=O(K−15)d_{-2}^{2}a_{-1}(t)=O(K^{-15}) for 0≤t≤τ10\leq t\leq\tau_{1}, so

for 0≤t≤τ10\leq t\leq\tau_{1}. from (6.129), (6.93), (6.168) we have

Using (6.173), (6.175), (6.79), we conclude that

for 0≤t≤T∗0\leq t\leq T_{*}. If we define the modified energy

for 0≤t≤τ10\leq t\leq\tau_{1}. By Lemma 6.9, (6.174), (6.172) we have

From (6.176) we have E∗(0)≲K−10E^{*}(0)\lesssim K^{-10}, and by (6.178) it will suffice to show that E∗(t)≲K−14E^{*}(t)\lesssim K^{-14} for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. By Gronwall’s inequality, it thus suffices to show that

for all tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. But from (6.93) and the bound τ1≤tc+K−1/2\tau_{1}\leq t_{c}+K^{-1/2} we have

and the claim now follows from (6.156) and (6.154). ∎

We now resume the analysis of the -scale modes. From Proposition 6.17 and (6.45) (and (6.93)), we see that we can improve the error term in (6.129) to

in the interval tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. This improvement will be needed in order to close the bootstrap argument.

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}, and hence by (6.157) and (6.163) we have

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}. Inserting this into (6.131) and using (6.166), (6.93) we have

for tc≤t≤τ1t_{c}\leq t\leq\tau_{1}; combining this with (6.167) we have

Now we use equipartition of energy to establish some energy drain from a0,d0a_{0},d_{0} to a1a_{1}. From (6.179), (6.132), (6.93), (6.94) one has

for t∈It\in I. Meanwhile, from (6.133), (6.93) we have

for t∈It\in I, so if we define the modified energy

for t∈It\in I. Starting with the crude bound E∗(tc+K−9)≲1E_{*}(t_{c}+K^{-9})\lesssim 1 from (6.184), (6.93), we conclude from Gronwall’s inequality that

for any t∈It\in I. In particular, from (6.184) we have

for t∈It\in I. In particular, if we can show

then by Gronwall’s inequality we will have

for all tc+1/K≤t≤τ1=tc+1/K1/2t_{c}+1/K\leq t\leq\tau_{1}=t_{c}+1/K^{1/2}, and in particular from (6.185) we have

We now show (6.187). Suppose this is not the case. From (6.133), (6.155), (6.146) we have

so from (6.133), (6.94), and the failure of (6.187) we have

However, by repeating the derivation of (6.183) we have

on II, and hence by the fundamental theorem of calculus and (5.32) we have

On the other hand, for t∈[tc+K−9,tc+1/K]t\in[t_{c}+K^{-9},t_{c}+1/K] one has a1(t)≤0.1+O(K−20)a_{1}(t)\leq 0.1+O(K^{-20}) by (6.186), the failure of (6.187), and Gronwall’s inequality. From (6.146), (6.184) we conclude that

which contradicts (6.190). This concludes the proof of (6.187) and hence (6.144).

To finish up, we need to establish the bounds (6.139)-(6.143) (the bounds (6.138) coming from (6.154) and construction of τ1\tau_{1}). From (6.146), (6.189) we have

and (6.139) follows from this and (6.188). The bounds (6.140), (6.141) follow from (6.180) and (6.163), while the bounds (6.142), (6.143) follows from (6.159), (6.181), (6.170), and Gronwall’s inequality. This (finally!) completes the proof of Proposition 6.15, and hence of Theorem 1.5.

References