Global regularity for a slightly supercritical hyperdissipative Navier-Stokes system

David Barbato, Francesco Morandin, Marco Romito

Introduction

Let d≥3d\geq 3 and consider the generalized Navier–Stokes system

on [0,2π]d[0,2\pi]^{d} with periodic boundary conditions, where D0D_{0} is a Fourier multiplier with non–negative symbol mm. The Navier–Stokes system is recovered when m(k)=∣k∣m(k)=|k|. If

where G:[0,∞)→[0,∞)G:[0,\infty)\to[0,\infty) is a non–decreasing function such that

A heuristic argument developed in [Tao09] and based on the comparison between the speed of propagation of a (possible) blow–up and the rate of dissipation suggests that regularity should still hold under the weaker condition

The main result of this paper, contained in the following theorem, is a complete proof of this conjecture.

Let d≥2d\geq 2 and assume (1.2), (1.4) and (1.5) for a non–decreasing function G:[0,∞)→[0,∞)G:[0,\infty)\to[0,\infty). Then (1.1) has a global smooth solution for every smooth initial condition.

A simple version of this conjecture, when reformulated on a toy model, has been proved for the dyadic model in [BMR14]. Actually, for that model one could prove regularity in full supercritical regime, with m(k)=∣k∣m(k)=|k|, as was done in [BMR11], but it was natural to develop there some of the main ideas on which also this paper is based. In fact here we prove that the equations for the velocity can be reduced to a suitable dyadic–like model, with infinitely many interactions though. A more sophisticated version of the arguments of [BMR14] ensures regularity of this dyadic model and, in turns, of the solution of the problem (1.1) above.

Our technique for proving Theorem 1.1 is flexible enough to include an additional critical parameter. Consider the following generalized Leray α\alpha–model,

where D1D_{1} and D2D_{2} are Fourier multipliers with non–negative symbols m1m_{1} and m2m_{2}.

Let d≥2d\geq 2, α,β≥0\alpha,\beta\geq 0, and assume

where g:[0,∞)→[0,∞)g:[0,\infty)\to[0,\infty) is a non–decreasing function such that x−αg(x)x^{-\alpha}g(x) is eventually non–increasing, and

Then (1.6) has a global smooth solution for every smooth initial condition.

Under the assumptions of Theorem 1.1, if β=0\beta=0, α=d+22\alpha=\frac{d+2}{2}, g(x)=G(x)2g(x)=G(x)^{2}, m2(k)=1m_{2}(k)=1, and m1(k)=m(k)2m_{1}(k)=m(k)^{2}, then the assumptions of Theorem 1.2 are met. Therefore Theorem 1.1 follows immediately from Theorem 1.2, and it is sufficient to prove only the second result.

The model (1.6) with g≡1g\equiv 1 was introduced by Olson and Titi in [OT07]. They proposed the idea that a weaker non-linearity and a stronger viscous dissipation could work together to yield regularity. Their statement uses though a stronger hypothesis α+β2≥d+22\alpha+\frac{\beta}{2}\geq\frac{d+2}{2} and this result was later logarithmically improved in [Yam12] with condition (1.3).

Our results are also relevant in view of the analysis in [Tao14] (see Remark 5.2 therein), since they confirm that the condition (1.7) is optimal, when general non–linear terms with the same scaling are considered.

The proof of the above theorem is based on two crucial ideas. The first idea is that smoothness of (1.6) can be reduced to the smoothness of a suitable shell model, obtained by averaging the energy of a solution of (1.6) over dyadic shells in Fourier space. We believe that this reduction may be interesting beyond the scope of this paper. The second idea is that the overall contribution of energy and dissipation over large shells satisfies a recursive inequality. Under condition (1.7) dissipation dumps significantly the flow of energy towards small scales and ensures smoothness. This is a more sophisticated version of the result obtained in [BMR14], due to the larger number of interactions between shells.

The paper is organized as follows. In Section 2 we derive the shell approximation of a solution of (1.6). The recursive formula is obtained in Section 3. In Section 4 we deduce exponential decays of shell modes by the recursive formula. The appendix A contains, for the sake of completeness, a standard existence and uniqueness result.

From the generalized Fourier Navier–Stokes to the dyadic equation

This section contains one of the crucial steps in our approach. We show that the proof of Theorem 1.2 can be reduced to a proof of decay of solutions of a suitable shell model. For simplicity and without loss of generality from now on we assume that

The dynamics of our generalized version of Navier-Stokes equation in Fourier decomposition reads

As is common in Littlewood-Paley theory, let Φ:[0,∞)→\Phi:[0,\infty)\to be a smooth function such that Φ≡1\Phi\equiv 1 on $,,\Phi\equiv 0onon[2,\infty)andand\Phiisstrictlydecreasingonis strictly decreasing on.For. Forx\geq 0,let, let\psi(x):=\Phi(x)-\Phi(2x),sothat, so that\psiisasmoothbumpfunctionsupportedonis a smooth bump function supported on(\frac{1}{2},2)$ satisfying

Notice that it is elementary to show that ψ\sqrt{\psi} is Lipschitz continuous.

and then proves that u=∑nPnu=\sum_{n}P_{n}. Since these PnP_{n} are not orthogonalThey are in fact almost orthogonal in the sense that ⟨Pn,Pm⟩L2=0\langle P_{n},P_{m}\rangle_{L^{2}}=0 whenever ∣m−n∣≥2|m-n|\geq 2. this does not give a nice decomposition of energy, as

Thus instead of Pn(x)P_{n}(x) we introduce a sort of square-averaged Littlewood-Paley decomposition. Let

One major difference with respect to the usual Littlewood-Paley theory is that it is impossible to recover vv from these XnX_{n} (as it was with the components Pn(x)P_{n}(x)), since they are averaged both in the physical space and over one shell of the frequency space.

We will denote by HγH^{\gamma} the Hilbert–Sobolev space of periodic functions with differentiation index γ\gamma, namely

If v∈Hγv\in H^{\gamma} and XX is its shell approximation, then

Hence, v(t)∈C∞v(t)\in C^{\infty} if and only if sup⁡n2γnXn<∞\sup_{n}2^{\gamma n}X_{n}<\infty for every γ>0\gamma>0. In view of Theorem A.1 (see page A.1), Theorem 1.2 follows if we can prove the following result.

Under the same assumptions of Theorem 1.2, let v(0)v(0) be smooth and periodic, and let m≥2+d2m\geq 2+\frac{d}{2}. If vv is a solution of (1.6) in HmH^{m} on its maximal interval of existence [0,T⋆)[0,T_{\star}), XX is its shell approximation and

2 The shell solution

We want to write a system of equation for the shell approximation of a solution of (1.6). We give a more formal connection between (1.6) and its shell equation because we believe the notion will result useful beyond the scopes of the present work.

We are now ready to introduce the shell model ODE for the energy of each shell, equation (2.5).

the family ϕ\phi is antisymmetric, in the sense that

there exist two positive constants c1c_{1} and c2c_{2} for which,

We will prove below that the shell approximation of a solution of (1.6) is a shell solution. It is easy to check that the dissipation term is local as expected, due to the way the shell components of a solution interact in the model’s dynamics. As for the nonlinear term, it turns out that the set II of the triples of indices (l,m,n)(l,m,n) for which there may be interaction between the shell components ll, mm and nn is quite small. This is basically because in the Fourier space, three components may interact only if they are the sides of a triangle and by triangle inequality their lengths cannot be in three shells far away from each other.

The antisymmetric property is what makes the non–linearity of (2.5) formally conservative. In fact using antisymmetry, a change of variable (m′=nm^{\prime}=n and n′=mn^{\prime}=m) and the fact that (l,m′,n′)∈I(l,m^{\prime},n^{\prime})\in I if and only if (l,n′,m′)∈I(l,n^{\prime},m^{\prime})\in I, one could formally write,

If these sums are absolutely convergent, this would prove indeed that the expression itself is equal to zero.

Since these are infinite sums, these computations are not rigorous unless we know, for instance, that ∑n22γnXn2<∞\sum_{n}2^{2\gamma n}X_{n}^{2}<\infty, with γ≥13(d2+1−β)\gamma\geq\frac{1}{3}(\frac{d}{2}+1-\beta), as it can be verified by an elementary computation.

3 The shell model as a shell approximation

The bounds on the coefficients given in Definition 2.4 are in the correct direction to prove regularity results (and hence Theorem 2.3). The following theorem, which is the main result of this section shows that they capture the natural scaling of the shell interactions for the physical solutions.

If vv is a solution of (1.6) on [0,T][0,T] and XX is its shell approximation, then XX is a shell solution.

The proof of Theorem 2.8 can be found at the end of this section. It is based on Propositions 2.10-2.11 below, which give the actual definitions of χ\chi and ϕ\phi and prove their properties.

where we used (2.2). By (2.7) we get the thesis. ∎

We finally turn our attention to the antisymmetry property and an upper bound for ϕ(l,m,n)(t)\phi_{(l,m,n)}(t). The statement is as follows.

(unless Xl(t)Xm(t)Xn(t)=0X_{l}(t)X_{m}(t)X_{n}(t)=0, in which case ϕ(l,m,n)(t):=0\phi_{(l,m,n)}(t):=0).

ϕ(l,m,n)(t)=0\phi_{(l,m,n)}(t)=0 for all (l,m,n)∉I(l,m,n)\notin I and all t≥0t\geq 0.

For any β≥0\beta\geq 0 there exists a constant c3>0c_{3}>0 depending only on dd, β\beta and ψ\psi such that

For the proof we need a couple of lemmas.

Consider the left–hand side. By performing the change of variable k′=h−kk^{\prime}=h-k we obtain

where we used the fact that ψa(k)≤1\psi_{a}(k)\leq 1. ∎

Consider the definition of ϕ(l,m,n)\phi_{(l,m,n)}, equation (2.8). By applying Lemma 2.12, for fixed tt, we immediately conclude that

and in particular that ϕ(l,m,m)=0\phi_{(l,m,m)}=0.

This proves that ϕ(l,m,n)=0\phi_{(l,m,n)}=0 outside II as defined in equation (2.4).

Finally we prove inequality (2.9) for (l,m,n)∈I(l,m,n)\in I with m<nm<n. We will consider separately the two cases n−m>2n-m>2 and n−m∈{1,2}n-m\in\{1,2\}, starting from the former.

Case 1. Since m<n−2m<n-2 and (l,m,n)∈I(l,m,n)\in I, then m=min⁡{l,m,n}m=\min\{l,m,n\} and ∣l−n∣≤2|l-n|\leq 2. This means in particular that for all the non-zero terms of the sum in equation (2.8), tipically ∣k−h∣<∣k∣|k-h|<|k|, so it is convenient to substitute ⟨vh,k⟩=⟨vh,k−h⟩\langle v_{h},k\rangle=\langle v_{h},k-h\rangle in the equation to obtain the following bound

By the definition of ψl\psi_{l}, either ψl(h)=0\psi_{l}(h)=0 or ∣h∣≥2l−1≥2m|h|\geq 2^{l-1}\geq 2^{m}. Applying this and the change of variable k′=k−hk^{\prime}=k-h one gets,

In the same way we can substitute ∣k′∣≤2m+1|k^{\prime}|\leq 2^{m+1} and apply Lemma 2.13 (recall that ψ≤1\psi\leq 1, so ψ≤ψ\psi\leq\sqrt{\psi}) to get

Since in the present case min⁡{l,m,n}=m\min\{l,m,n\}=m, this proves inequality (2.9) with c3=22+3d/2c_{3}=2^{2+3d/2}.

Case 2. Suppose now that n−m∈{1,2}n-m\in\{1,2\} and (l,m,n)∈I(l,m,n)\in I, then l≤n+2l\leq n+2 and min⁡{l,m,n}≥l−4\min\{l,m,n\}\geq l-4. In this case it is ll that can be small with respect to mm and nn, so we take the terms in ll and hh outside the internal sum,

The idea is to exploit the cancellations in the sum over kk that happen when k−hk-h and kk are switched. By Lemma 2.12 and the bound ∣k∣≤2n+1|k|\leq 2^{n+1} for kk in the support of ψm\psi_{m} or ψn\psi_{n},

Moreover by simmetry with respect to mm and nn,

By the usual bound 2l−1≤∣h∣≤2l+12^{l-1}\leq|h|\leq 2^{l+1}, since β≥0\beta\geq 0, we see that ∣h∣1−β≤2l(1−β)+1+β|h|^{1-\beta}\leq 2^{l(1-\beta)+1+\beta}, so by Lemma 2.13,

Since in the present case min⁡{l,m,n}≥l−4\min\{l,m,n\}\geq l-4, this proves inequality (2.9) with c3=29+112d−3βLc_{3}=2^{9+\frac{11}{2}d-3\beta}L. ∎

Finally we have all the ingredients to prove the main theorem of this section.

A direct computation using (2.2) and (2.1) shows that

To deal with the first sum, define χ\chi as in Proposition 2.10. By applying (2.7) for Xn(t)≠0X_{n}(t)\neq 0 and (2.2) for Xn(t)=0X_{n}(t)=0 we see that in both cases,

Now consider the second sum. Since the terms with h=kh=k give no contribution, we can apply

where it was possible to exchange the order of summation because the middle expression is clearly absolutely convergent.

Finally recalling by Proposition 2.11 that ϕ≡0\phi\equiv 0 outside II, we may restrict the scope of the sum and obtain equation (2.5). The required properties of the coefficients χ\chi and ψ\psi follow again from Propositions 2.10-2.11. ∎

From the dyadic equation to the recursive inequality

In view of the results of the previous section, we can now concentrate on shell solutions and forget equation (1.6). In this section we proceed as in [BMR14] and we deduce a recursive inequality between the tails of energy and dissipation. Clearly here, due to the more complex non–linear interaction, the relation is less trivial than in [BMR14].

A shell solution XX satisfies the energy inequality on [0,T][0,T] if the sum ∑nXn2(0)\sum_{n}X_{n}^{2}(0) is finite and

The recursive inequality between the tails and the energy bound is given in the next result.

where dˉl:=max⁡s∈[0,t]dl(s)\bar{d}_{l}:=\max_{s\in[0,t]}d_{l}(s).

Apply Lemma 3.4 below to the second sum and integrate on [0,t][0,t] to obtain

where the FnF_{n} are the tails of XX and Fn(0)<∞F_{n}(0)<\infty by hypothesis. Thus by (3.2),

Recall that α+β≥d2+1\alpha+\beta\geq\frac{d}{2}+1, hence the bound (2.6) for ϕ\phi yields ϕ(l,m,h)≤c2λmin⁡{l,m,h}\phi_{(l,m,h)}\leq c_{2}\lambda^{\min\{l,m,h\}}. Therefore

It is convenient to split the set over which the sum is done into {l<m}\{l<m\} and {m≤l}\{m\leq l\},

Apply the Cauchy-Schwarz inequality to get

Then by the bound on χ\chi in (2.6), on all [0,t][0,t],

Finally the integral of χmXm2\chi_{m}X_{m}^{2} can be bounded using (3.2),

thus proving equation (3.2) with c4=10c2c1c_{4}=10\frac{c_{2}}{c_{1}}. ∎

By using (2.6), noticing that min⁡(l,m,h)≤n−1\min(l,m,h)\leq n-1, we see that by definition of shell solution (Definition 2.4) the left–hand side of (3.3) is an absolutely convergent sum. Therefore we can exploit the cancellations due to the antisymmetry of ϕ\phi, as in Remark 2.7. Indeed

By using (3.5) into (3.4) the conclusion follows. ∎

Solving the recursion

In this section we complete the proof of our main result. In the previous section we have shown a recursive inequality involving the energy bounds of a shell solution. The following theorem shows that shell solutions are smooth. By Theorem 2.8 the shell approximation of a solution of (1.6) is a shell solution, hence Theorem 2.3 holds, and in turns Theorem 1.2 holds as well.

Let XX be a shell solution satisfying the energy inequality on [0,t)[0,t). If sup⁡n2mn∣Xn(0)∣<∞\sup_{n}2^{mn}|X_{n}(0)|<\infty for every m≥1m\geq 1, then

Let bn=g(2n+1)−1b_{n}=g(2^{n+1})^{-1}, n≥0n\geq 0, then the assumptions of Theorem 1.2 for gg read in terms of the sequence bb as

where λ=2α\lambda=2^{\alpha} as in the previous section. We recall that, by Proposition 3.3, the following inequality holds,

In the following lemma we collect some properties of the quantities RnR_{n}, QnQ_{n}, dˉn\bar{d}_{n} that will be crucial in the proof of Theorem 4.1 above.

For every 1≤m1≤m21\leq m_{1}\leq m_{2} and t>0t>0,

For every t>0t>0, lim inf⁡nRn(t)=0\liminf_{n}R_{n}(t)=0.

dˉn↓0\bar{d}_{n}\downarrow 0 as n→∞n\to\infty.

(Qn)n≥1(Q_{n})_{n\geq 1} is eventually non–increasing.

Since λnbn\lambda^{n}b_{n} is non–decreasing, we know that bn−λ−1bn−1≥0b_{n}-\lambda^{-1}b_{n-1}\geq 0. Hence by exchanging the sums,

If m2≥m1m_{2}\geq m_{1}, since (bn)n≥1(b_{n})_{n\geq 1} is non–increasing,

The claim lim inf⁡nRn(t)=0\liminf_{n}R_{n}(t)=0 follows from (4.2), since dn(t)≤d1(t)d_{n}(t)\leq d_{1}(t) for every nn, and since, by the assumptions on (bn)n≥1(b_{n})_{n\geq 1}, we can find a sequence (mk)k≥1(m_{k})_{k\geq 1} such that ∑n=mkmk+1−1bn↑∞\sum_{n=m_{k}}^{m_{k+1}-1}b_{n}\uparrow\infty.

To prove that dˉn↓0\bar{d}_{n}\downarrow 0, we notice that the sequence (mk)k≥1(m_{k})_{k\geq 1} mentioned above does not depend on tt, hence using the monotonicity of (dn(t))n≥1(d_{n}(t))_{n\geq 1} and formula (4.2), we can prove that lim inf⁡ndˉn=0\liminf_{n}\bar{d}_{n}=0, and hence dˉn↓0\bar{d}_{n}\downarrow 0 by monotonicity. Once we know that dˉn↓0\bar{d}_{n}\downarrow 0, an easy and standard argument proves that Qn→0Q_{n}\to 0.

To prove that (Qn)n≥1(Q_{n})_{n\geq 1} is eventually non–increasing, we notice that, since (dˉn)n≥1(\bar{d}_{n})_{n\geq 1} is non–increasing,

In view of the above inequality, it is sufficient to show that for some mm the increment Qm−Qm−1≤0Q_{m}-Q_{m-1}\leq 0. This is true because otherwise the sequence (Qn)n≥1(Q_{n})_{n\geq 1} would be non–decreasing, in contradiction with Qn→0Q_{n}\to 0 and Qn≥0Q_{n}\geq 0. ∎

Given θ>0\theta>0 and n0≥1n_{0}\geq 1, define by recursion the sequence

The definition of QnQ_{n} and the fact that the sequence (dˉn)n≥1(\bar{d}_{n})_{n\geq 1} is non–increasing yield the following recursive formula for QnkQ_{n_{k}},

for a constant c>0c>0 depending only from λ\lambda. Moreover, if we choose n0n_{0} large enough that (Qn)n≥0(Q_{n})_{n\geq 0} is non–increasing,

for each n∈{nk+1,…,nk+1}n\in\{n_{k}+1,\dots,n_{k+1}\}, hence by formula (4.2) and the definition of the sequence (nk)k≥1(n_{k})_{k\geq 1},

Given M>0M>0, there are n0≥1n_{0}\geq 1 and θ>0\theta>0 such that

Without loss of generality we can choose MM large (depending only on the value of λ\lambda, see below at the end of the proof). Choose n0n_{0} large enough that (Qn)n≥n0(Q_{n})_{n\geq n_{0}} is non–increasing and

for a number ϵ∈(0,1)\epsilon\in(0,1) suitably chosen below. We will prove by induction that

For the initial step of the induction (k=1k=1), we notice that by (4.4) and (4.5),

if we choose ϵ\epsilon small enough, depending from the values of λ\lambda, MM, and θ\theta.

Assume now that (4.6) holds for some k≥1k\geq 1, and let us prove that the same holds for k+1k+1. To this end it is sufficient to give the estimate for Qnk+1Q_{n_{k+1}} and dˉnk+12\bar{d}_{n_{k+1}}^{2}. Again by (4.4), (4.5) and the induction hypothesis, and since (nk)k≥0(n_{k})_{k\geq 0} is increasing by definition,

if MM is large (depending on λ\lambda), and ϵ\epsilon is small and θ\theta is large (depending only on MM, λ\lambda). ∎

Before giving the last step of the proof of Theorem 4.1, we show a property of the sequence (nk)k≥0(n_{k})_{k\geq 0}. The proof is the same as [BMR14, Lemma 11], we detail it for completeness.

Given n0≥1n_{0}\geq 1 and θ>0\theta>0, consider the sequence defined in (4.3). For infinitely many kk, nk+1=nk+1n_{k+1}=n_{k}+1. In particular bnk−1≥θλ−k/4b_{n_{k}-1}\geq\theta\lambda^{-k/4} for all such kk.

Assume by contradiction that there is rr such that nk+1≥nk+2n_{k+1}\geq n_{k}+2 for k≥rk\geq r. On the one hand

On the other hand, bnk−2≤bnk−3≤θλ−14(k−1)b_{n_{k}-2}\leq b_{n_{k}-3}\leq\theta\lambda^{-\frac{1}{4}(k-1)} and the series ∑kbnk−2\sum_{k}b_{n_{k}-2} converges. ∎

For every M>0M>0 there is cM>0c_{M}>0 such that

There is no loss of generality if we assume MM is large. Let n0n_{0}, θ\theta be the values provided by Lemma 4.3. By Lemma 4.3 and Lemma 4.4 there are infinitely many k≥1k\geq 1 such that

Let k0k_{0} be one of such indices, large enough (the size of k0k_{0} will be chosen at the end of the proof). We will prove by induction that

for a suitable choice of the constants c>0c>0, c′>0c^{\prime}>0. We first notice that there is nothing to prove concerning bnk0−1+mb_{n_{k_{0}}-1+m}, since this is a straightforward consequence of the choice of k0k_{0} and the monotonicity of (λnbn)n≥1(\lambda^{n}b_{n})_{n\geq 1}.

The initial step m=0m=0 holds, since inequalities (4.7) hold true for the index k0k_{0}. For m=1m=1,

if c=λ−M(k0−1)c=\lambda^{-M(k_{0}-1)} and c′≥λ−k0/2+λ−Mk0/2c^{\prime}\geq\lambda^{-k_{0}/2}+\lambda^{-Mk_{0}/2}.

Assume that (4.8) holds for 1,…,m1,\dots,m, for some m≥1m\geq 1. By its definition,

if c′=λ−k02+λ(λ−1)−1cc^{\prime}=\lambda^{-\frac{k_{0}}{2}}+\lambda(\lambda-1)^{-1}\sqrt{c} (the previous constraint on c′c^{\prime} is met by this choice).

By (4.1) and (4.2) we have that for every n≥2n\geq 2,

hence, using the inequality for Qnk0+m+1Q_{n_{k_{0}}+m+1} already proved and the induction hypothesis,

where the last inequality follows if k0k_{0} is large enough, since λnFn(0)→0\lambda^{n}F_{n}(0)\to 0 by assumption, and by our choice of cc, c′c^{\prime}, we have that λk0/4c′→0\lambda^{k_{0}/4}c^{\prime}\to 0 as k0→∞k_{0}\to\infty. ∎

Appendix A Local existence and uniqueness

Consider the generalised system (1.6), under the same assumptions of Theorem 1.2. AssumeExistence and uniqueness can be proved also in the general case m1(k)≥∣k∣αg(∣k∣)−1m_{1}(k)\geq|k|^{\alpha}g(|k|)^{-1}. A simple assumption that keeps our proof almost unchanged is a control from above, say m(k)≤∣k∣βm(k)\leq|k|^{\beta}, for some β≥α\beta\geq\alpha., for simplicity, that m1(k)=∣k∣αg(∣k∣)m_{1}(k)=\frac{|k|^{\alpha}}{g(|k|)}. Denote by VmV_{m} the subspace of HmH^{m} (see (2.3)) of divergence free vector fields with mean zero. Our main theorem on local existence and uniqueness for (1.6) is as follows.

Let m≥2+d2m\geq 2+\frac{d}{2} and v0∈Vmv_{0}\in V_{m}. Then there are T>0T>0 and a unique solution vv of (1.6) on [0,T][0,T] with initial condition v0v_{0} such that

where VmweakV_{m}^{\textup{\tiny weak}} is the space VmV_{m} with the weak topology. Moreover, vv is right–continuous with values in VmV_{m} for the strong topology.

If T⋆T_{\star} is the maximal time of existence of the solution started from v0v_{0}, then either T⋆=∞T_{\star}=\infty or

We denote by B^(v1,v2)\hat{B}(v_{1},v_{2}) the (Leray) projection of the non–linearity, namely

In the rest of the section we briefly outline the proof of Theorem A.1, following [MB02, Section 3.2]. The proof of the following result is a slight modification of the arguments to prove [MB02, Theorem 3.4].

Given an integer m≥2+d2m\geq 2+\tfrac{d}{2}, there exists a number c⋆>0c_{\star}>0 such that for every v0∈Vmv_{0}\in V_{m}, if T<c⋆/∥v0∥mT<c_{\star}/\|v_{0}\|_{m}, there is a unique solution of (1.6) with initial condition v0v_{0}. Moreover vϵ→vv_{\epsilon}\to v in C([0,T];Vm′)C([0,T];V_{m^{\prime}}), for m′<mm^{\prime}<m, and in C([0,T];Vmweak)C([0,T];V_{m}^{\textup{\tiny weak}}), (A.1) hold for vv, and for every ϵ>0\epsilon>0,

Unfortunately, at this stage, we cannot prove the analogous of Theorem 3.5 of [MB02] for our vv, namely that vv is continuous in time for the strong topology of VmV_{m}. The reason is that their proof uses either the reversibility of the Euler equation (that we do not have due to the presence of D1D_{1}), or the smoothing of the Laplace operator, that we do not have here either (as already mentioned). On the other hand we can prove right–continuity.

The solution vv from Proposition A.2 is right–continuous with values in VmV_{m} for the strong topology, and ddtv\frac{d}{dt}v is right continuous with values in Vm−αV_{m-\alpha}.

Given t∈[0,T]t\in[0,T], the same computations leading to (A.2) yield

therefore lim sup⁡t↓0∥v(t)∥m≤∥v0∥m\limsup_{t\downarrow 0}\|v(t)\|_{m}\leq\|v_{0}\|_{m}. On the other hand, by weak continuity, ∥v0∥m≤lim inf⁡t↓0∥v(t)∥m\|v_{0}\|_{m}\leq\liminf_{t\downarrow 0}\|v(t)\|_{m} and vv is right continuous in . Uniqueness for (1.6) and the same argument applied to t∈(0,T]t\in(0,T] yield right–continuity in tt. ∎

Nevertheless, we can still define a maximal solution and a maximal time of existence. Given v0∈Vmv_{0}\in V_{m}, let T⋆T_{\star} be the maximal time of existence of the solution starting from v0v_{0}, that is the supremum over all T>0T>0 such that there exists a solution vv of (1.6) on [0,T][0,T] with v(0)=u0v(0)=u_{0}, vv is right–continuous with values in VmV_{m}, continuous with values in VmweakV_{m}^{\textup{\tiny weak}} and with ddtv\frac{d}{dt}v right continuous with values in Vm−αV_{m-\alpha}. Due to uniqueness, any two such solutions coincide on the common interval of definition.

Given v0∈Vmv_{0}\in V_{m}, if T⋆T_{\star} is the maximal time of existence of the solution started from v0v_{0}, then either T⋆=∞T_{\star}=\infty or

Assume by contradiction that T⋆<∞T_{\star}<\infty and that M:=sup⁡t<T⋆∥v(t)∥m<∞M:=\sup_{t<T_{\star}}\|v(t)\|_{m}<\infty. Let T0=T⋆−c⋆/(4M)T_{0}=T_{\star}-c_{\star}/(4M), and start a solution with initial condition v(T0)v(T_{0}) at time T0T_{0}. By Proposition A.2 there is a solution of (1.6) on a time span of length at least c⋆/(2∥v(T0)∥m)≥c⋆/(2M)c_{\star}/(2\|v(T_{0})\|_{m})\geq c_{\star}/(2M), hence at least up to time T0+c⋆/(2M)>T⋆T_{0}+c_{\star}/(2M)>T_{\star}. By uniqueness, this solution is equal to vv up to time T⋆T_{\star}. ∎

References