Introduction
Neural operators approximate the solution operator of a partial differential equation, that is, the map from its input functions, such as initial and boundary data, coefficients and forcing, and its physical parameters to its solution [13 ] . Widely used examples are the Fourier neural operator (FNO) [17 ] and the deep operator network (DeepONet) [21 ] , and both can approximate any continuous operator on a compact set of inputs [12 , 15 ] . Once trained on solutions computed by a conventional solver, a neural operator is evaluated orders of magnitude faster than the solver, which makes it useful whenever a solution operator must be evaluated many times. Fluid dynamics is a main field of application. Fourier neural operators predict turbulent solutions of the two-dimensional Navier–Stokes equations [17 ] , reproduce the long-time statistics of chaotic dissipative systems [18 ] , and forecast the global weather [22 ] . Closest to the present problem, they have been trained on two-dimensional Rayleigh–Bénard convection, a Boussinesq flow driven by buoyancy, where they predict the velocity and temperature fields more accurately than earlier data-driven models [29 ] . Physics-informed neural networks [26 ] and their operator versions [36 , 19 ] add the residual of the equation to the training loss, so that the network learns from the equation as well as from solutions.
Machine learning has also begun to assist mathematical analysis. It has suggested conjectures and guided their proofs in pure mathematics [5 ] , and it has constructed
Funding: J. Wu was partially supported by the National Science Foundation (NSF) under grants DMS-2104682 and DMS-2309748. X. Zheng was partially supported by the NSF under grant DMS-2309747. examples that disprove conjectures or improve known bounds [35 , 28 ] . For the equations of fluid motion, neural networks have found an approximate self-similar blow-up profile of the three-dimensional axisymmetric Euler equations, which also solves the closely related two-dimensional Boussinesq equations [38 ] , and new families of unstable singularities [37 ] , accurate enough to serve as a starting point for computer-assisted proofs. In these works the network proposes candidates and a separate rigorous or high-precision computation decides whether they are valid. The same division of labor underlies multifidelity methods, in which a cheap model explores and an accurate model confirms [24 ] . In the stability theory of fluids, the search for the initial data that maximize the growth of a perturbation over a finite time is an optimization problem, each step of which requires solving the equations forward and backward in time [25 , 10 ] .
Known structure can also be built into the network itself. Conservation laws can be enforced by construction [27 , 8 ] , and asymptotic-preserving networks and neural operators build the limit of a small parameter of the equation into the loss, so that one network stays accurate across the range of the parameter [9 , 39 , 40 ] . Asymptotics-informed operator networks add boundary-layer correctors from singular perturbation theory to the output [16 ] . In these approaches the network learns from solutions computed by a solver, from the residual of the equation, or from both, and the structure built into it comes from the equation or from a formal limit. What rigorous analysis proves about the solutions, such as which quantities are nearly conserved, that is, change only at higher order in the amplitude, how large the various parts of the solution are, and which quantities depend on the data in an ill-conditioned way, is used less systematically in the design of the network. In this paper we design a neural operator from the rigorous long-time analysis of a partial differential equation, the two-dimensional Boussinesq system with anisotropic dissipation, and use it to obtain information that the analysis alone does not give. The analysis decides what the network predicts, how its output is split, and how each part is scaled with the amplitude of the data. The trained network then takes the place of the solver in a search over initial data for a lower bound on the constant of the analytical estimate, and the solver confirms the candidates it finds. The remainder of this introduction describes the physical problem and the analytical result on which the design rests.
Buoyancy-driven flows in the Boussinesq approximation are a canonical model of stratified fluids in the atmosphere and ocean, where the interplay of velocity and temperature (or density) governs the onset of convection, the persistence of shear flows, and the emergence of stratified states [23 , 4 ] . In many geophysical regimes the dissipation is strongly anisotropic : turbulent transport and rotation make the effective diffusion in the horizontal and vertical directions markedly different, and it is natural, both physically and mathematically, to study models in which the dissipation is present in only one direction of each field. The system studied here retains horizontal viscosity in the momentum equation and vertical thermal diffusion in the temperature equation, and no dissipation in the complementary directions.
The stability of such partially dissipated Boussinesq systems near the hydrostatic equilibrium has been established in a sequence of works: for the strip T × R \mathbb{T} \times\mathbb{R} T × R with horizontal velocity dissipation and vertical thermal diffusion [1 ] , for related partial-dissipation configurations [14 ] , and for the buoyancy-driven case without any thermal diffusion [30 , 6 ] . A recurring theme is that the buoyancy coupling itself is stabilizing: the exchange between the vertical velocity and the temperature converts the momentum equation, which is damped only in the horizontal direction, into a damped-wave-type system, so that small perturbations remain globally regular and uniformly bounded. On the periodic box T 2 \mathbb{T}^2 T 2 , which is the setting of the present paper, the corresponding uniform H 2 H^2 H 2 stability estimate has become available only recently [7 ] . The energy method used on the strip in [1 ] does not carry over to the box. On a bounded vertical interval the one-dimensional Sobolev inequality acquires an additional zeroth-order term, which breaks the anisotropic product estimates on which that method rests, and a different mechanism, special to the box, is needed. This estimate is recalled in Appendix A.
What these stability results do not by themselves settle is the long-time limit : given that a small perturbation exists and remains small for all time, what does it converge to, and how much of the limit is determined by the initial data?
If the dissipation is isotropic and present in both fields, as in the full-Laplacian system ∂ t u + u ⋅ ∇ u = − ∇ p + ν Δ u + θ e 2 \partial_t u+u\cdot\nabla u=-\nabla p+\nu\Delta u+\theta e_2 ∂ t u + u ⋅ ∇ u = − ∇ p + ν Δ u + θ e 2 , ∂ t θ + u ⋅ ∇ θ + u 2 = η Δ θ \partial_t\theta+u\cdot\nabla\theta+u_2=\eta\Delta\theta ∂ t θ + u ⋅ ∇ θ + u 2 = η Δ θ , the answer on T 2 \mathbb{T}^2 T 2 is immediate: the two coupling terms cancel in the L 2 L^2 L 2 energy balance, leaving
d d t ( ∥ u ∥ L 2 2 + ∥ θ ∥ L 2 2 ) = − 2 ν ∥ ∇ u ∥ L 2 2 − 2 η ∥ ∇ θ ∥ L 2 2 . \frac{d}{dt}\left(\lVert u\rVert_{L^2}^2+\lVert\theta\rVert_{L^2}^2\right)=-2\nu\lVert\nabla u\rVert_{L^2}^2-2\eta\lVert\nabla\theta\rVert_{L^2}^2. d t d ( ∥ u ∥ L 2 2 + ∥ θ ∥ L 2 2 ) = − 2 ν ∥ ∇ u ∥ L 2 2 − 2 η ∥ ∇ θ ∥ L 2 2 .
and, provided the conserved mean ∫ T 2 u 1 \int_{\mathbb{T}^2}u_1 ∫ T 2 u 1 also vanishes initially, the Poincaré inequality on zero-mean fields forces the entire perturbation to decay exponentially to zero, leaving no persistent structure. For the anisotropic system studied here, with dissipation ν ∂ 11 u \nu\partial_{11}u ν ∂ 11 u and η ∂ 22 θ \eta\partial_{22}\theta η ∂ 22 θ only, the same computation gives
d d t ( ∥ u ∥ L 2 2 + ∥ θ ∥ L 2 2 ) = − 2 ν ∥ ∂ 1 u ∥ L 2 2 − 2 η ∥ ∂ 2 θ ∥ L 2 2 . \frac{d}{dt}\left(\lVert u\rVert_{L^2}^2+\lVert\theta\rVert_{L^2}^2\right)=-2\nu\lVert\partial_1u\rVert_{L^2}^2-2\eta\lVert\partial_2\theta\rVert_{L^2}^2. d t d ( ∥ u ∥ L 2 2 + ∥ θ ∥ L 2 2 ) = − 2 ν ∥ ∂ 1 u ∥ L 2 2 − 2 η ∥ ∂ 2 θ ∥ L 2 2 .
The right-hand side vanishes on the velocity modes with k 1 = 0 k_1=0 k 1 = 0 and on the temperature modes with k 2 = 0 k_2=0 k 2 = 0 , so the Poincaré inequality no longer closes the estimate and the buoyancy coupling itself must supply the stabilization. The closest precedent on the same domain is [30 ] (see also [6 ] ), which treats the two-dimensional Boussinesq system on T 2 \mathbb{T}^2 T 2 with full (isotropic) velocity viscosity but no thermal diffusion, and shows that the velocity decays to zero while the temperature tends to an explicit function of x 2 x_2 x 2 alone. For the system with full dissipation in both fields, a second-order numerical scheme has been developed and analyzed in [2 ] , and its long-time simulations show the perturbation relaxing exponentially to zero. Our system differs from that of [30 ] in two ways. The velocity dissipation is made anisotropic (horizontal only) and a vertical thermal diffusion is added. The roles are then reversed: it is now the temperature that decays to zero and the vorticity that tends to a stratified limit, that is, a function of x 2 x_2 x 2 alone (see Theorem 3.1 ).
The design of our neural operator is guided by the long-time behavior of the system on the periodic box T 2 = [ 0 , 2 π ] 2 \mathbb{T}^2=[0,2\pi]^2 T 2 = [ 0 , 2 π ] 2 , which we establish in Theorem 3.1 . Writing any field as its x 1 x_1 x 1 -average g ‾ ( x 2 , t ) \overline{g}(x_2,t) g ( x 2 , t ) plus its zero-average oscillation g ~ = g − g ‾ \widetilde{g}=g-\overline{g} g = g − g , the analysis gives the following picture. The horizontal viscosity, together with the buoyancy coupling, damps the oscillatory (that is, x 1 x_1 x 1 -dependent) part of the flow: the oscillation of the vorticity decays and the temperature perturbation decays to zero. What remains is a purely horizontal, stratified shear flow u = ( u ‾ 1 ( x 2 ) , 0 ) u=(\overline{u}_1(x_2),0) u = ( u 1 ( x 2 ) , 0 ) carrying the horizontally averaged vorticity ω ‾ = − ∂ 2 u ‾ 1 \overline{\omega}=-\partial_2\overline{u}_1 ω = − ∂ 2 u 1 . The averaged vorticity is not conserved, since the nonlinear advection contributes the term ∂ 2 2 u ~ 1 u ~ 2 \partial_2^2\widetilde{u}_1\widetilde{u}_2 ∂ 2 2 u 1 u 2 to its evolution, where u ~ 1 u ~ 2 \widetilde{u}_1\widetilde{u}_2 u 1 u 2 is the Reynolds stress. However, the oscillation is of the order ε \varepsilon ε of the perturbation and square integrable in time, and the Reynolds stress is quadratic in it, so the change ω ‾ ( ⋅ , t ) − ω ‾ 0 \overline{\omega}(\cdot,t)-\overline{\omega}_0 ω ( ⋅ , t ) − ω 0 of the horizontal average is O ( ε 2 ) O(\varepsilon^2) O ( ε 2 ) for all time. For the neural operator, this picture tells what to predict and how large each part is. The final vorticity is the known initial average ω ‾ 0 \overline{\omega}_0 ω 0 plus a change of the average of order ε 2 \varepsilon^2 ε 2 and an oscillation of order ε \varepsilon ε , and the temperature, which decays to zero, is not needed as an output.
The anisotropy makes the solution operator difficult to learn with a standard neural operator, for three reasons. First, the quantity bounded by the analysis is small. The change of the horizontal average of the vorticity is of order ε 2 \varepsilon^2 ε 2 , while the vorticity is of order ε \varepsilon ε , and in our data this change is three to four orders of magnitude below ω ˉ 0 \bar{\omega}_0 ω ˉ 0 in L 2 L^2 L 2 . A network that predicts the final vorticity as a whole would hide the change inside its own error. Second, the parts of the solution grow at different rates with the amplitude, so the targets at the smallest and the largest amplitudes differ greatly in size. Third, since each field is dissipated in only one direction, the temperature modes independent of x 2 x_2 x 2 are damped by factors that differ by more than ten orders of magnitude between small and large horizontal wavenumbers. The late-time temperature therefore depends on the initial data in a severely ill-conditioned way, and in a preliminary experiment a network that also predicted it did not converge. The analysis resolves each of these difficulties. We train a Fourier neural operator on 10 4 10^4 1 0 4 initial-to-final pairs generated by a pseudo-spectral solver at ten amplitudes, predict only the vorticity, and give the network the structure that the analysis identifies: its output is the initial horizontal average ω ˉ 0 \bar{\omega}_0 ω ˉ 0 plus a learned approximation of ω ( ⋅ , T ) − ω ˉ 0 \omega(\cdot,T)-\bar{\omega}_0 ω ( ⋅ , T ) − ω ˉ 0 , split into its horizontal average and its oscillation, each divided by its size, which grows as ε 2 \varepsilon^2 ε 2 and ε \varepsilon ε , respectively. We then test the bound of the analysis directly, on 2 × 10 3 2 \times10^3 2 × 1 0 3 further solver runs and on the surrogate’s predictions for the same initial data.
The remainder of the paper is organized as follows. Section 2 sets up the governing equations, the hydrostatic equilibrium, and the mean/oscillation decomposition. Section 3 states the standing hypotheses, the main result, Theorem 3.1, on the asymptotic stratification and its limit profile, and the linear decay rate, Proposition 3.2. Section 4 introduces the Fourier neural operator (Sec. 4.1), describes the training data (Sec. 4.2), explains why the late-time temperature is not a prediction target (Sec. 4.3), sets out the network and its training (Sec. 4.4), reports the accuracy and cost of the surrogate (Sec. 4.5), tests Theorem 3.1(b) on solver runs and surrogate predictions (Sec. 4.6), compares the surrogate with networks trained without the analysis (Sec. 4.7), and uses the surrogate to search for a lower bound for the constant of Theorem 3.1(b) (Sec. 4.8). Section 5 summarizes the results. Appendix A states the uniform stability estimate and derives from it the bound used in the proof, Appendix B contains the proof of Theorem 3.1, and Appendix C the proof of Proposition 3.2.
Governing equations and the mean/oscillation decomposition
The perturbation system
We consider the two-dimensional anisotropic Boussinesq system from [1 ] , with the domain taken to be the square box Ω = [ 0 , 2 π ] 2 \Omega=[0,2\pi]^2 Ω = [ 0 , 2 π ] 2 . Denote the velocity vector as U U U , the pressure as P P P , and the temperature as Θ \Theta Θ . The governing equations are
∂ t U + U ⋅ ∇ U = − ∇ P + ν ∂ 11 U + Θ e 2 , x = ( x 1 , x 2 ) ∈ Ω , t > 0 , ∂ t Θ + U ⋅ ∇ Θ = η ∂ 22 Θ , ∇ ⋅ U = 0. \begin{aligned}
\partial_t U+U\cdot\nabla U&=-\nabla P+\nu\partial_{11}U+\Theta e_2,\qquad x=(x_1,x_2)\in\Omega,\quad t>0,\\
\partial_t\Theta+U\cdot\nabla\Theta&=\eta\partial_{22}\Theta,\\
\nabla\cdot U&=0.
\end{aligned} ∂ t U + U ⋅ ∇ U ∂ t Θ + U ⋅ ∇Θ ∇ ⋅ U = − ∇ P + ν ∂ 11 U + Θ e 2 , x = ( x 1 , x 2 ) ∈ Ω , t > 0 , = η ∂ 22 Θ , = 0.
where ν \nu ν is the kinematic viscosity and η \eta η the thermal diffusivity. Here e 2 e_2 e 2 is the unit vector in the vertical direction.
Denote a hydrostatic equilibrium as ( U h e , P h e , Θ h e ) = ( 0 , 1 2 x 2 2 , x 2 ) (U_{\mathrm{he}},P_{\mathrm{he}},\Theta_{\mathrm{he}})=(0,\frac{1}{2}x_2^2,x_2) ( U he , P he , Θ he ) = ( 0 , 2 1 x 2 2 , x 2 ) and the perturbation as ( u , p , θ ) = ( U − U h e , P − P h e , Θ − Θ h e ) (u,p,\theta)=(U-U_{\mathrm{he}},P-P_{\mathrm{he}},\Theta-\Theta_{\mathrm{he}}) ( u , p , θ ) = ( U − U he , P − P he , Θ − Θ he ) . We assume the perturbation to be periodic in both spatial directions with period 2 π 2\pi 2 π . That is, the domain of the perturbation is the periodic box T 2 = [ 0 , 2 π ] 2 \mathbb{T}^2=[0,2\pi]^2 T 2 = [ 0 , 2 π ] 2 .
The governing equations are, with the notation u = ( u 1 , u 2 ) \mathbf{u}=(u_1,u_2) u = ( u 1 , u 2 ) ,
∂ t u + u ⋅ ∇ u = − ∇ p + ν ∂ 11 u + θ e 2 , (1) \partial_t\mathbf{u}+\mathbf{u}\cdot\nabla\mathbf{u}=-\nabla p+\nu\partial_{11}\mathbf{u}+\theta\mathbf{e}_2, \tag*{(1)} ∂ t u + u ⋅ ∇ u = − ∇ p + ν ∂ 11 u + θ e 2 , (1)
∂ t θ + u ⋅ ∇ θ + u 2 = η ∂ 22 θ , (2) \partial_t\theta+\mathbf{u}\cdot\nabla\theta+u_2=\eta\partial_{22}\theta, \tag*{(2)} ∂ t θ + u ⋅ ∇ θ + u 2 = η ∂ 22 θ , (2)
∇ ⋅ u = 0. (3) \nabla\cdot\mathbf{u}=0. \tag*{(3)} ∇ ⋅ u = 0. (3)
An equivalent formulation uses the vorticity ω = ∇ × u = ∂ 1 u 2 − ∂ 2 u 1 \omega=\nabla\times\mathbf{u}=\partial_1u_2-\partial_2u_1 ω = ∇ × u = ∂ 1 u 2 − ∂ 2 u 1 and the stream function ψ \psi ψ ,
∂ t ω + u ⋅ ∇ ω = ν ∂ 11 ω + ∂ 1 θ , (4) \partial_t\omega+\mathbf{u}\cdot\nabla\omega=\nu\partial_{11}\omega+\partial_1\theta, \tag*{(4)} ∂ t ω + u ⋅ ∇ ω = ν ∂ 11 ω + ∂ 1 θ , (4)
− Δ ψ = ω , (5) -\Delta\psi=\omega, \tag*{(5)} − Δ ψ = ω , (5)
u = ∇ ⊥ ψ = ( ∂ 2 ψ , − ∂ 1 ψ ) , (6) \mathbf{u}=\nabla^\perp\psi=(\partial_2\psi,-\partial_1\psi), \tag*{(6)} u = ∇ ⊥ ψ = ( ∂ 2 ψ , − ∂ 1 ψ ) , (6)
∂ t θ + u ⋅ ∇ θ + u 2 = η ∂ 22 θ . (7) \partial_t\theta+\mathbf{u}\cdot\nabla\theta+u_2=\eta\partial_{22}\theta. \tag*{(7)} ∂ t θ + u ⋅ ∇ θ + u 2 = η ∂ 22 θ . (7)
Mean/oscillation decomposition
For a field g ( x 1 , x 2 , t ) g(x_1,x_2,t) g ( x 1 , x 2 , t ) that is periodic in x 1 x_1 x 1 we write
g ˉ ( x 2 , t ) : = 1 2 π ∫ 0 2 π g ( x 1 , x 2 , t ) d x 1 , g ~ : = g − g ˉ , (8) \bar{g}(x_2,t):=\frac{1}{2\pi}\int_0^{2\pi}g(x_1,x_2,t)\,dx_1,\qquad\widetilde{g}:=g-\bar{g}, \tag*{(8)} g ˉ ( x 2 , t ) := 2 π 1 ∫ 0 2 π g ( x 1 , x 2 , t ) d x 1 , g := g − g ˉ , (8)
so that g ˉ \bar{g} g ˉ is independent of x 1 x_1 x 1 , and g ~ \widetilde{g} g has zero x 1 x_1 x 1 -mean for every x 2 x_2 x 2 . A field independent of x 1 x_1 x 1 is called stratified. The vertical counterpart of (8) ,
Q 0 g ( x 1 , t ) : = 1 2 π ∫ 0 2 π g ( x 1 , x 2 , t ) d x 2 , g ⊥ : = g − Q 0 g , (9) Q_0g(x_1,t):=\frac{1}{2\pi}\int_0^{2\pi}g(x_1,x_2,t)\,dx_2,\qquad g^\perp:=g-Q_0g, \tag*{(9)} Q 0 g ( x 1 , t ) := 2 π 1 ∫ 0 2 π g ( x 1 , x 2 , t ) d x 2 , g ⊥ := g − Q 0 g , (9)
enters only in Appendix A.
The two decompositions separate what each dissipative term can reach. The horizontal viscosity ν ∂ 11 \nu\partial_{11} ν ∂ 11 annihilates the x 1 x_1 x 1 -average and acts as − ν k 1 2 -\nu k_1^2 − ν k 1 2 on the oscillation, so it damps g ~ \widetilde{g} g and leaves g ˉ \bar{g} g ˉ untouched. By contrast, the vertical diffusion η ∂ 22 \eta\partial_{22} η ∂ 22 annihilates Q 0 g Q_0g Q 0 g and damps g ⊥ g^\perp g ⊥ .
In the analysis we write the perturbation velocity u \mathbf{u} u of {(citep)}(2.1)–(2.3) as u \mathbf{u} u , and its initial value as u 0 \mathbf{u}_0 u 0 . Each property in Lemma 2.1 is a direct consequence of the definitions, the periodicity of the box and, where indicated, the incompressibility of u \mathbf{u} u .
Lemma 2.1 (Mean/oscillation calculus). Let g ˉ \bar{g} g ˉ and g ~ = g − g ˉ \widetilde{g}=g-\bar{g} g = g − g ˉ be the horizontal mean and oscillation defined in (8) , and let u = ( u 1 , u 2 ) \mathbf{u}=(u_1,u_2) u = ( u 1 , u 2 ) be a 2 π 2\pi 2 π -periodic, divergence-free vector field with vorticity ω = ∂ 1 u 2 − ∂ 2 u 1 \omega=\partial_1u_2-\partial_2u_1 ω = ∂ 1 u 2 − ∂ 2 u 1 . For f , g ∈ H 1 ( T 2 ) f,g\in H^1(\mathbb{T}^2) f , g ∈ H 1 ( T 2 ) , and with X X X denoting L 2 L^2 L 2 or any of the norms of (3.2) below, whenever the norms involved are finite:
(a) g ˉ ‾ = g ˉ \overline{\bar{g}}=\bar{g} g ˉ = g ˉ , g ~ ~ = 0 \widetilde{\widetilde{g}}=0 g = 0 , f ˉ g ~ ‾ = f ˉ g ~ = 0 \overline{\bar{f}\widetilde{g}}=\bar{f}\widetilde{g}=0 f ˉ g = f ˉ g = 0 , f g ‾ = f ˉ g ˉ + f ~ g ~ \overline{fg}=\bar{f}\bar{g}+\widetilde{f}\widetilde{g} f g = f ˉ g ˉ + f g .
(b) ∂ 2 g ˉ = ∂ 2 g ‾ \partial_2\bar{g}=\overline{\partial_2g} ∂ 2 g ˉ = ∂ 2 g , ∂ 2 g ~ = ∂ 2 g ~ \partial_2\widetilde{g}=\widetilde{\partial_2g} ∂ 2 g = ∂ 2 g , ∂ 1 g ˉ = 0 \partial_1\bar{g}=0 ∂ 1 g ˉ = 0 , ∂ 1 g = ∂ 1 g ~ \partial_1g=\partial_1\widetilde{g} ∂ 1 g = ∂ 1 g , ω ˉ = − ∂ 2 u ˉ 1 \bar{\omega}=-\partial_2\bar{u}_1 ω ˉ = − ∂ 2 u ˉ 1 , ω ~ = ∂ 1 u ~ 2 − ∂ 2 u ~ 1 \widetilde{\omega}=\partial_1\widetilde{u}_2-\partial_2\widetilde{u}_1 ω = ∂ 1 u 2 − ∂ 2 u 1 .
(c) ∥ g ∥ X 2 = ∥ g ˉ ∥ X 2 + ∥ g ~ ∥ X 2 \|g\|_X^2=\|\bar{g}\|_X^2+\|\widetilde{g}\|_X^2 ∥ g ∥ X 2 = ∥ g ˉ ∥ X 2 + ∥ g ∥ X 2 , and ∥ g ˉ ∥ X ≤ ∥ g ∥ X \|\bar{g}\|_X\le\|g\|_X ∥ g ˉ ∥ X ≤ ∥ g ∥ X , ∥ g ~ ∥ X ≤ ∥ g ∥ X \|\widetilde{g}\|_X\le\|g\|_X ∥ g ∥ X ≤ ∥ g ∥ X .
(d) ∂ 2 u ˉ 2 = 0 \partial_2\bar{u}_2=0 ∂ 2 u ˉ 2 = 0 , and if in addition ∫ T 2 u 2 d x = 0 \int_{\mathbb{T}^2}u_2\,dx=0 ∫ T 2 u 2 d x = 0 , then u ˉ 2 ≡ 0 \bar{u}_2\equiv0 u ˉ 2 ≡ 0 and u 2 = u ~ 2 u_2=\widetilde{u}_2 u 2 = u 2 .
(e) (Horizontal Poincaré) since the lowest nonzero horizontal frequency on [ 0 , 2 π ] [0,2\pi] [ 0 , 2 π ] is one,
∥ g ~ ∥ L 2 ≤ ∥ ∂ 1 g ~ ∥ L 2 = ∥ ∂ 1 g ∥ L 2 , ∥ ∂ 2 g ~ ∥ L 2 = ∥ ∂ 2 g ~ ∥ L 2 ≤ ∥ ∂ 2 g ∥ L 2 , (10) \|\widetilde{g}\|_{L^2}\le\|\partial_1\widetilde{g}\|_{L^2}=\|\partial_1g\|_{L^2},\qquad\|\partial_2\widetilde{g}\|_{L^2}=\|\widetilde{\partial_2g}\|_{L^2}\le\|\partial_2g\|_{L^2}, \tag*{(10)} ∥ g ∥ L 2 ≤ ∥ ∂ 1 g ∥ L 2 = ∥ ∂ 1 g ∥ L 2 , ∥ ∂ 2 g ∥ L 2 = ∥ ∂ 2 g ∥ L 2 ≤ ∥ ∂ 2 g ∥ L 2 , (10) and hence, the first inequality being applied to g ~ \widetilde{g} g and to ∂ 2 g ~ = ∂ 2 g ~ \partial_2\widetilde{g}=\widetilde{\partial_2g} ∂ 2 g = ∂ 2 g , ∥ g ~ ∥ H 1 ≤ 2 ∥ ∂ 1 g ∥ H 1 \|\widetilde{g}\|_{H^1}\le\sqrt{2}\|\partial_1g\|_{H^1} ∥ g ∥ H 1 ≤ 2 ∥ ∂ 1 g ∥ H 1 , in particular ∥ u ~ ∥ H 1 ≤ 2 ∥ ∂ 1 u ∥ H 1 \|\widetilde{\mathbf{u}}\|_{H^1}\le\sqrt{2}\|\partial_1\mathbf{u}\|_{H^1} ∥ u ∥ H 1 ≤ 2 ∥ ∂ 1 u ∥ H 1 .
(f) (Vertical Poincaré ) if h h h satisfies ∫ 0 2 π h ( x 1 , x 2 ) d x 2 = 0 \int_{0}^{2\pi} h(x_{1},x_{2})\,\mathrm{d}x_{2}=0 ∫ 0 2 π h ( x 1 , x 2 ) d x 2 = 0 for every x 1 x_{1} x 1 , then
∥ h ∥ L 2 ≤ ∥ ∂ 2 h ∥ L 2 . (11) \lVert h\rVert_{L^{2}} \leq\lVert\partial_{2}h\rVert_{L^{2}}. \tag*{(11)} ∥ h ∥ L 2 ≤ ∥ ∂ 2 h ∥ L 2 . (11)
(g) ∂ 2 Q 0 g = 0 \partial_{2}Q_{0}g=0 ∂ 2 Q 0 g = 0 and ∫ 0 2 π g ⊥ d x 2 = 0 \int_{0}^{2\pi}g^{\perp}\,\mathrm{d}x_{2}=0 ∫ 0 2 π g ⊥ d x 2 = 0 for every x 1 x_{1} x 1 , so the decomposition g = Q 0 g + g ⊥ g=Q_{0}g+g^{\perp} g = Q 0 g + g ⊥ of (9) is orthogonal in L 2 ( T 2 ) L^{2}(\mathbb{T}^{2}) L 2 ( T 2 ) , and ∂ 1 \partial_{1} ∂ 1 commutes with both projections.
Main result: stratification and the limit profile
Standing hypotheses on the initial data
Throughout, the initial data ( u 0 , θ 0 ) ∈ H 2 ( T 2 ) (u_{0},\theta_{0})\in H^{2}(\mathbb{T}^{2}) ( u 0 , θ 0 ) ∈ H 2 ( T 2 ) are assumed to satisfy ∇ ⋅ u 0 = 0 \nabla\cdot u_{0}=0 ∇ ⋅ u 0 = 0 and
∫ T 2 θ 0 d x = ∫ T 2 u 2 , 0 d x = ∫ T 2 u 1 , 0 d x = 0 , ∥ u 0 ∥ H 2 + ∥ θ 0 ∥ H 2 ≤ ε . (12) \int_{\mathbb{T}^{2}}\theta_{0}\,\mathrm{d}x=\int_{\mathbb{T}^{2}}u_{2,0}\,\mathrm{d}x=\int_{\mathbb{T}^{2}}u_{1,0}\,\mathrm{d}x=0,\qquad\lVert u_{0}\rVert_{H^{2}}+\lVert\theta_{0}\rVert_{H^{2}}\leq\varepsilon. \tag*{(12)} ∫ T 2 θ 0 d x = ∫ T 2 u 2 , 0 d x = ∫ T 2 u 1 , 0 d x = 0 , ∥ u 0 ∥ H 2 + ∥ θ 0 ∥ H 2 ≤ ε . (12)
Here and below, with the Fourier coefficients f ^ k = ( 2 π ) − 2 ∫ T 2 f ( x ) e − i k ⋅ x d x \widehat{f}_{k}=(2\pi)^{-2}\int_{\mathbb{T}^{2}}f(x)e^{-\mathrm{i}k\cdot x}\,\mathrm{d}x f k = ( 2 π ) − 2 ∫ T 2 f ( x ) e − i k ⋅ x d x ,
∥ f ∥ H s 2 = ( 2 π ) 2 ∑ k ∈ Z 2 ( 1 + ∣ k ∣ 2 ) s ∣ f ^ k ∣ 2 , s ∈ R , (13) \lVert f\rVert_{H^{s}}^{2}=(2\pi)^{2}\sum_{k\in\mathbb{Z}^{2}}(1+|k|^{2})^{s}|\widehat{f}_{k}|^{2},\qquad s\in\mathbb{R}, \tag*{(13)} ∥ f ∥ H s 2 = ( 2 π ) 2 k ∈ Z 2 ∑ ( 1 + ∣ k ∣ 2 ) s ∣ f k ∣ 2 , s ∈ R , (13)
summed over the components of a vector field.
The mean conditions in (12) are preserved by the flow. Integrating (1) –(2) over T 2 \mathbb{T}^{2} T 2 , the pressure and transport terms vanish by periodicity and ∇ ⋅ u = 0 \nabla\cdot u=0 ∇ ⋅ u = 0 , and
d d t ∫ T 2 u 1 d x = 0 , d d t ∫ T 2 θ d x = − ∫ T 2 u 2 d x , d d t ∫ T 2 u 2 d x = ∫ T 2 θ d x . \frac{\mathrm{d}}{\mathrm{d}t}\int_{\mathbb{T}^{2}}u_{1}\,\mathrm{d}x=0,\qquad
\frac{\mathrm{d}}{\mathrm{d}t}\int_{\mathbb{T}^{2}}\theta\,\mathrm{d}x=-\int_{\mathbb{T}^{2}}u_{2}\,\mathrm{d}x,\qquad
\frac{\mathrm{d}}{\mathrm{d}t}\int_{\mathbb{T}^{2}}u_{2}\,\mathrm{d}x=\int_{\mathbb{T}^{2}}\theta\,\mathrm{d}x. d t d ∫ T 2 u 1 d x = 0 , d t d ∫ T 2 θ d x = − ∫ T 2 u 2 d x , d t d ∫ T 2 u 2 d x = ∫ T 2 θ d x .
Thus ∫ T 2 u 1 d x \int_{\mathbb{T}^{2}}u_{1}\,\mathrm{d}x ∫ T 2 u 1 d x is conserved, and
∫ T 2 θ d x = cos t ∫ T 2 θ 0 d x − sin t ∫ T 2 u 2 , 0 d x , \int_{\mathbb{T}^{2}}\theta\,\mathrm{d}x=\cos t\int_{\mathbb{T}^{2}}\theta_{0}\,\mathrm{d}x-\sin t\int_{\mathbb{T}^{2}}u_{2,0}\,\mathrm{d}x, ∫ T 2 θ d x = cos t ∫ T 2 θ 0 d x − sin t ∫ T 2 u 2 , 0 d x ,
∫ T 2 u 2 d x = sin t ∫ T 2 θ 0 d x + cos t ∫ T 2 u 2 , 0 d x , \int_{\mathbb{T}^{2}}u_{2}\,\mathrm{d}x=\sin t\int_{\mathbb{T}^{2}}\theta_{0}\,\mathrm{d}x+\cos t\int_{\mathbb{T}^{2}}u_{2,0}\,\mathrm{d}x, ∫ T 2 u 2 d x = sin t ∫ T 2 θ 0 d x + cos t ∫ T 2 u 2 , 0 d x ,
which are periodic in time with period 2 π 2\pi 2 π and do not decay unless both initial means vanish. Under (12) all three means are zero for all t ≥ 0 t\geq0 t ≥ 0 .
Statement of the main result
By Theorem A.1 of Appendix A, quoted from [7 ] , there is ε ∗ = ε ∗ ( ν , η ) > 0 \varepsilon_{*}=\varepsilon_{*}(\nu,\eta)>0 ε ∗ = ε ∗ ( ν , η ) > 0 such that for ε ≤ ε ∗ \varepsilon\leq\varepsilon_{*} ε ≤ ε ∗ the system (1) –(3) with initial data satisfying (12) has a unique global solution. This solution is bounded by C ∗ ε C_{*}\varepsilon C ∗ ε in H 2 H^{2} H 2 for all time, and its dissipation integral ∫ 0 ∞ ( ν ∥ ∂ 1 u ∥ H 2 2 + η ∥ ∂ 2 θ ∥ H 2 2 ) d τ \int_{0}^{\infty}(\nu\lVert\partial_{1}u\rVert_{H^{2}}^{2}+\eta\lVert\partial_{2}\theta\rVert_{H^{2}}^{2})\,\mathrm{d}\tau ∫ 0 ∞ ( ν ∥ ∂ 1 u ∥ H 2 2 + η ∥ ∂ 2 θ ∥ H 2 2 ) d τ is bounded by C ν ε 2 C_{\nu}\varepsilon^{2} C ν ε 2 . Theorem 3.1 describes the long-time behavior of this solution.
Averaging the first component of (1) over x 1 x_{1} x 1 , the terms − ∂ 1 p -\partial_{1}p − ∂ 1 p and ν ∂ 11 u 1 \nu\partial_{11}u_{1} ν ∂ 11 u 1 drop out by Lemma 2.1 (b). Since ∇ ⋅ u = 0 \nabla\cdot u=0 ∇ ⋅ u = 0 , u ⋅ ∇ u 1 = ∂ 1 ( u 1 2 ) + ∂ 2 ( u 1 u 2 ) u\cdot\nabla u_{1}=\partial_{1}(u_{1}^{2})+\partial_{2}(u_{1}u_{2}) u ⋅ ∇ u 1 = ∂ 1 ( u 1 2 ) + ∂ 2 ( u 1 u 2 ) , and the first term averages to zero. Hence ∂ t u ‾ 1 = − ∂ 2 u 1 u 2 ‾ \partial_{t}\overline{u}_{1}=-\partial_{2}\overline{u_{1}u_{2}} ∂ t u 1 = − ∂ 2 u 1 u 2 . By Lemma 2.1 (a), u 1 u 2 ‾ = u ‾ 1 u ‾ 2 + u ~ 1 u ~ 2 \overline{u_{1}u_{2}}=\overline{u}_{1}\overline{u}_{2}+\widetilde{u}_{1}\widetilde{u}_{2} u 1 u 2 = u 1 u 2 + u 1 u 2 , and by the mean conditions of (12) , which hold for all t ≥ 0 t\geq0 t ≥ 0 , and Lemma 2.1 (d), u ‾ 2 = 0 \overline{u}_{2}=0 u 2 = 0 . Therefore ∂ t u ‾ 1 = − ∂ 2 u ~ 1 u ~ 2 \partial_{t}\overline{u}_{1}=-\partial_{2}\widetilde{u}_{1}\widetilde{u}_{2} ∂ t u 1 = − ∂ 2 u 1 u 2 , and since ω ‾ = − ∂ 2 u ‾ 1 \overline{\omega}=-\partial_{2}\overline{u}_{1} ω = − ∂ 2 u 1 by Lemma 2.1 (b),
∂ t ω ‾ = ∂ 22 u ~ 1 u ~ 2 . (14) \partial_{t}\overline{\omega}=\partial_{22}\widetilde{u}_{1}\widetilde{u}_{2}. \tag*{(14)} ∂ t ω = ∂ 22 u 1 u 2 . (14)
Theorem 3.1 (Small-data stratification and the limit profile on T 2 \mathbb{T}^{2} T 2 ). Let ε ∗ = ε ∗ ( ν , η ) > 0 \varepsilon_{*}=\varepsilon_{*}(\nu,\eta)>0 ε ∗ = ε ∗ ( ν , η ) > 0 be the threshold of Theorem A.1 . Let the initial data satisfy (12) with ε ≤ ε ∗ \varepsilon\leq\varepsilon_{*} ε ≤ ε ∗ and let ( u , θ ) (u,\theta) ( u , θ ) be the corresponding global solution of (1) –(3) . Let ω = ∂ 1 u 2 − ∂ 2 u 1 \omega=\partial_{1}u_{2}-\partial_{2}u_{1} ω = ∂ 1 u 2 − ∂ 2 u 1 , and let ω ‾ \overline{\omega} ω and ω ‾ 0 \overline{\omega}_{0} ω 0 be the horizontal averages (8) of ω \omega ω and ω 0 \omega_{0} ω 0 . Then the zero means are preserved, ∫ T 2 θ ( t ) = ∫ T 2 u 2 ( t ) = 0 \int_{\mathbb{T}^{2}}\theta(t)=\int_{\mathbb{T}^{2}}u_{2}(t)=0 ∫ T 2 θ ( t ) = ∫ T 2 u 2 ( t ) = 0 for all t ≥ 0 t\geq0 t ≥ 0 , and the following hold.
(a) (Decay of the vertical velocity and the temperature ) As t → ∞ t \to\infty t → ∞ , u 2 ( t ) → 0 u_{2}(t) \to0 u 2 ( t ) → 0 and θ ( t ) → 0 \theta(t) \to0 θ ( t ) → 0 in H s ( T 2 ) H^{s}(\mathbb{T}^{2}) H s ( T 2 ) for every s < 2 s < 2 s < 2 .
(b) (Stratification and limit profile of the vorticity ) There is ω ‾ ∞ = ω ‾ ∞ ( x 2 ) ∈ H 1 ( T 2 ) \overline{\omega}_{\infty} = \overline{\omega}_{\infty}(x_{2}) \in H^{1}(\mathbb{T}^{2}) ω ∞ = ω ∞ ( x 2 ) ∈ H 1 ( T 2 ) such that ω ( ⋅ , t ) → ω ‾ ∞ \omega(\cdot,t) \to\overline{\omega}_{\infty} ω ( ⋅ , t ) → ω ∞ in H s ( T 2 ) H^{s}(\mathbb{T}^{2}) H s ( T 2 ) for every s < 1 s < 1 s < 1 as t → ∞ t \to\infty t → ∞ , and
ω ‾ ∞ = ω ‾ 0 + ∫ 0 ∞ ∂ 22 u ~ 1 u ~ 2 ( ⋅ , t ) d t (15) \overline{\omega}_{\infty} = \overline{\omega}_{0} + \int_{0}^{\infty} \partial_{22}\widetilde{u}_{1}\widetilde{u}_{2}(\cdot,t)\,\mathrm{d}t \tag*{(15)} ω ∞ = ω 0 + ∫ 0 ∞ ∂ 22 u 1 u 2 ( ⋅ , t ) d t (15) where the integral converges in H − 2 H^{-2} H − 2 . Moreover
sup t ≥ 0 ∥ ω ‾ ( ⋅ , t ) − ω ‾ 0 ∥ H − 2 ≤ C ε 2 and ∥ ω ‾ ∞ − ω ‾ 0 ∥ H − 2 ≤ C ε 2 , \sup_{t \ge0} \lVert\overline{\omega}(\cdot,t) - \overline{\omega}_{0} \rVert_{H^{-2}} \le C\varepsilon^{2}
\qquad\text{and}\qquad
\lVert\overline{\omega}_{\infty} - \overline{\omega}_{0} \rVert_{H^{-2}} \le C\varepsilon^{2}, t ≥ 0 sup ∥ ω ( ⋅ , t ) − ω 0 ∥ H − 2 ≤ C ε 2 and ∥ ω ∞ − ω 0 ∥ H − 2 ≤ C ε 2 , where C C C depends only on ν \nu ν .
The proof is given in Appendix B. Since ω ‾ 0 \overline{\omega}_{0} ω 0 is determined by u 0 u_{0} u 0 alone, Theorem 3.1 (b) shows that the initial temperature affects the limit only at order ε 2 \varepsilon^{2} ε 2 : for a fixed u 0 u_{0} u 0 , any two θ 0 \theta_{0} θ 0 admissible under (12) give limits ω ‾ ∞ \overline{\omega}_{\infty} ω ∞ that differ by at most 2 C ε 2 2C\varepsilon^{2} 2 C ε 2 in H − 2 H^{-2} H − 2 . By (15) , ω ‾ ∞ − ω ‾ 0 \overline{\omega}_{\infty} - \overline{\omega}_{0} ω ∞ − ω 0 is a nonlinear functional of the whole trajectory, and no formula for it in terms of the initial data is known. Section 4 approximates the map from the initial data to it by a neural operator.
The linear decay rate
Proposition 3.2 (Linear decay of ( u 2 , θ ) (u_{2},\theta) ( u 2 , θ ) ). Consider the linearization of (4) and (2) about the hydrostatic state,
∂ t ω = ν ∂ 11 ω + ∂ 1 θ , ∂ t θ = η ∂ 22 θ − u 2 , (16) \partial_{t}\omega= \nu\partial_{11}\omega+ \partial_{1}\theta,\qquad\partial_{t}\theta= \eta\partial_{22}\theta- u_{2}, \tag*{(16)} ∂ t ω = ν ∂ 11 ω + ∂ 1 θ , ∂ t θ = η ∂ 22 θ − u 2 , (16)
with u \mathbf{u} u obtained from ω \omega ω by the Biot–Savart law (5) and (6) . For each k = ( k 1 , k 2 ) ∈ Z 2 ∖ { 0 } \mathbf{k} = (k_{1},k_{2}) \in\mathbb{Z}^{2} \setminus\{0\} k = ( k 1 , k 2 ) ∈ Z 2 ∖ { 0 } the Fourier coefficients satisfy
d u ^ 2 d t = − ν k 1 2 u ^ 2 + k 1 2 ∣ k ∣ 2 θ ^ , d θ ^ d t = − u ^ 2 − η k 2 2 θ ^ . (17) \frac{\mathrm{d}\widehat{u}_{2}}{\mathrm{d}t} = -\nu k_{1}^{2}\widehat{u}_{2} + \frac{k_{1}^{2}}{|\mathbf{k}|^{2}}\widehat{\theta},\qquad
\frac{\mathrm{d}\widehat{\theta}}{\mathrm{d}t} = -\widehat{u}_{2} - \eta k_{2}^{2}\widehat{\theta}. \tag*{(17)} d t d u 2 = − ν k 1 2 u 2 + ∣ k ∣ 2 k 1 2 θ , d t d θ = − u 2 − η k 2 2 θ . (17)
(a) If k 1 ≠ 0 k_{1} \ne0 k 1 = 0 and k 2 ≠ 0 k_{2} \ne0 k 2 = 0 , then
∣ u ^ 2 ( t ) ∣ 2 + k 1 2 ∣ k ∣ 2 ∣ θ ^ ( t ) ∣ 2 ≤ e − 2 min { ν , η } t ( ∣ u ^ 2 ( 0 ) ∣ 2 + k 1 2 ∣ k ∣ 2 ∣ θ ^ ( 0 ) ∣ 2 ) . |\widehat{u}_{2}(t)|^{2} + \frac{k_{1}^{2}}{|\mathbf{k}|^{2}}|\widehat{\theta}(t)|^{2}
\le e^{-2\min\{\nu,\eta\}t}
\left(|\widehat{u}_{2}(0)|^{2} + \frac{k_{1}^{2}}{|\mathbf{k}|^{2}}|\widehat{\theta}(0)|^{2}\right). ∣ u 2 ( t ) ∣ 2 + ∣ k ∣ 2 k 1 2 ∣ θ ( t ) ∣ 2 ≤ e − 2 m i n { ν , η } t ( ∣ u 2 ( 0 ) ∣ 2 + ∣ k ∣ 2 k 1 2 ∣ θ ( 0 ) ∣ 2 ) .
If k 1 = 0 k_{1} = 0 k 1 = 0 and k 2 ≠ 0 k_{2} \ne0 k 2 = 0 , then u ^ 2 ≡ 0 \widehat{u}_{2} \equiv0 u 2 ≡ 0 and θ ^ ( t ) = e − η k 2 2 t θ ^ ( 0 ) \widehat{\theta}(t) = e^{-\eta k_{2}^{2}t}\widehat{\theta}(0) θ ( t ) = e − η k 2 2 t θ ( 0 ) .
(b) If k 2 = 0 k_{2} = 0 k 2 = 0 and ν k 1 2 > 2 \nu k_{1}^{2} > 2 ν k 1 2 > 2 , then θ ^ ( t ) = a + e λ + t + a − e λ − t \widehat{\theta}(t) = a_{+}e^{\lambda_{+}t} + a_{-}e^{\lambda_{-}t} θ ( t ) = a + e λ + t + a − e λ − t , with constants a ± a_{\pm} a ± determined by u ^ 2 ( 0 ) \widehat{u}_{2}(0) u 2 ( 0 ) and θ ^ ( 0 ) \widehat{\theta}(0) θ ( 0 ) , λ − ≤ − ν k 1 2 / 2 < − 1 \lambda_{-} \le-\nu k_{1}^{2}/2 < -1 λ − ≤ − ν k 1 2 /2 < − 1 , and
λ + = − 2 ν k 1 2 + ν 2 k 1 4 − 4 , 1 ν k 1 2 ≤ ∣ λ + ∣ ≤ 2 ν k 1 2 < 1. \lambda_{+} = \frac{-2}{\nu k_{1}^{2} + \sqrt{\nu^{2}k_{1}^{4} - 4}},
\qquad
\frac{1}{\nu k_{1}^{2}} \le|\lambda_{+}| \le\frac{2}{\nu k_{1}^{2}} < 1. λ + = ν k 1 2 + ν 2 k 1 4 − 4 − 2 , ν k 1 2 1 ≤ ∣ λ + ∣ ≤ ν k 1 2 2 < 1.
In particular λ + → 0 \lambda_{+} \to0 λ + → 0 as ∣ k 1 ∣ → ∞ |k_{1}| \to\infty ∣ k 1 ∣ → ∞ , so the linear decay of θ \theta θ has no uniform rate.
The proof is given in Appendix C. The absence of a uniform decay rate in part (b) is consistent with Theorem 3.1 , which treats the nonlinear case and also does not give a decay rate.
A neural-operator surrogate, its training data, and a test of Theorem 1(b)
Neural operators and the Fourier neural operator
A neural operator (NO) [13 ] is a deep-learning architecture that learns a map between two infinite-dimensional function spaces, rather than between finite-dimensional Euclidean vectors as in a standard neural network. Given an input Banach space A \mathcal{A} A and an output Banach space U \mathcal{U} U of functions on a domain D ⊂ R d \mathcal{D} \subset\mathbb{R}^{d} D ⊂ R d (here D = T 2 \mathcal{D} = \mathbb{T}^{2} D = T 2 and d = 2 d = 2 d = 2 ), the target is a generally nonlinear operator G † : A → U \mathcal{G}^{\dagger} : \mathcal{A} \to\mathcal{U} G † : A → U , and the neural operator provides a parametric approximation G ϕ ≈ G † \mathcal{G}_{\phi} \approx\mathcal{G}^{\dagger} G ϕ ≈ G † trained from a finite set of input-output pairs { ( a ( i ) , z ( i ) ) } \{(a^{(i)}, z^{(i)})\} {( a ( i ) , z ( i ) )} . For the present problem this operator maps the small-amplitude initial perturbation to the state at a later time: the input is the pair of initial fields a = ( ω 0 , θ 0 ) a = (\omega_{0}, \theta_{0}) a = ( ω 0 , θ 0 ) , at an amplitude ε \varepsilon ε that varies across the data, and the output is the vorticity z = ω ( ⋅ , T ) z = \omega(\cdot,T) z = ω ( ⋅ , T ) at the final time (§ 4.2 ).
Architecture. A neural operator is a composition of a lifting map, a sequence of L L L hidden layers (here L = 4 L = 4 L = 4 ), and a projection map,
G ϕ = Q ∘ H L ∘ ⋯ ∘ H 1 ∘ P . \mathcal{G}_{\phi} = Q \circ\mathcal{H}_{L} \circ\cdots\circ\mathcal{H}_{1} \circ\mathcal{P}. G ϕ = Q ∘ H L ∘ ⋯ ∘ H 1 ∘ P .
The pointwise lifting operator P \mathcal{P} P raises the input function a a a to a function v 0 v_{0} v 0 with more components, called channels, and the pointwise projection operator Q Q Q maps the last hidden function back to the output z z z . Each hidden layer updates the current function v ℓ : D → R d v ℓ v_{\ell} : \mathcal{D} \to\mathbb{R}^{d_{v_{\ell}}} v ℓ : D → R d v ℓ by
v ℓ + 1 ( x ) = ϱ ( W ℓ v ℓ ( x ) + ( K ℓ v ℓ ) ( x ) + b ℓ ( x ) ) , x ∈ D , (18) v_{\ell+1}(x) = \varrho\left(W_{\ell}v_{\ell}(x) + (\mathcal{K}_{\ell}v_{\ell})(x) + b_{\ell}(x)\right), \qquad x \in\mathcal{D}, \tag*{(18)} v ℓ + 1 ( x ) = ϱ ( W ℓ v ℓ ( x ) + ( K ℓ v ℓ ) ( x ) + b ℓ ( x ) ) , x ∈ D , (18)
where ϱ \varrho ϱ is a fixed nonlinear activation applied pointwise, W ℓ W_{\ell} W ℓ is a local (pointwise) linear transformation, b ℓ b_{\ell} b ℓ is a bias function, and K ℓ \mathcal{K}_{\ell} K ℓ is a nonlocal linear integral kernel operator
( K ℓ v ℓ ) ( x ) = ∫ D κ ( ℓ ) ( x , x ′ ) v ℓ ( x ′ ) d x ′ . (19) (\mathcal{K}_{\ell}v_{\ell})(x) = \int_{\mathcal{D}} \kappa^{(\ell)}(x,x')v_{\ell}(x')\,\mathrm{d}x'. \tag*{(19)} ( K ℓ v ℓ ) ( x ) = ∫ D κ ( ℓ ) ( x , x ′ ) v ℓ ( x ′ ) d x ′ . (19)
Fourier neural operator. The kernel (4.2) admits several parameterizations, and we use the Fourier neural operator (FNO) [17 ] , which represents the kernel directly in the frequency domain. Assuming a translation-invariant kernel κ ( ℓ ) ( x , x ′ ) = κ ( ℓ ) ( x − x ′ ) \kappa^{(\ell)}(x,x') = \kappa^{(\ell)}(x-x') κ ( ℓ ) ( x , x ′ ) = κ ( ℓ ) ( x − x ′ ) and applying the convolution theorem turns (4.2) into a multiplication in Fourier space,
( K ℓ v ℓ ) ( x ) = F − 1 ( S ϕ ( ℓ ) ⋅ F ( v ℓ ) ) ( x ) , (20) (\mathcal{K}_{\ell}v_{\ell})(x) = \mathcal{F}^{-1}\left(S_{\phi}^{(\ell)} \cdot\mathcal{F}(v_{\ell})\right)(x), \tag*{(20)} ( K ℓ v ℓ ) ( x ) = F − 1 ( S ϕ ( ℓ ) ⋅ F ( v ℓ ) ) ( x ) , (20)
where F \mathcal{F} F and F − 1 \mathcal{F}^{-1} F − 1 are the Fourier transform and its inverse, and S ϕ ( ℓ ) S_{\phi}^{(\ell)} S ϕ ( ℓ ) is a learned complex weight tensor acting on the Fourier coefficients. Only the lowest wavenumbers, those with ∣ k j ∣ \lvert k_{j}\rvert ∣ k j ∣ up to k max k_{\max} k m a x in each direction, are retained, and for each of them S ϕ ( ℓ ) S_{\phi}^{(\ell)} S ϕ ( ℓ ) holds a trainable complex d v ℓ + 1 × d v ℓ d_{v_{\ell+1}} \times d_{v_{\ell}} d v ℓ + 1 × d v ℓ matrix. The higher modes are truncated, which both limits the parameter count and acts as a spectral smoothing filter. For real-valued fields the conjugate symmetry S ( − k ) = S ( k ) ∗ S(-k) = S(k)^{*} S ( − k ) = S ( k ) ∗ is imposed so that the output remains real. On a uniform periodic grid F \mathcal{F} F is evaluated by the fast Fourier transform, giving a quasi-linear cost O ( N 2 log N ) \mathcal{O}(N^{2}\log N) O ( N 2 log N ) on an N × N N \times N N × N grid.
Training data generation
The training pairs are produced by numerical simulation of the perturbation system in its vorticity-stream-function form on the periodic box T 2 \mathbb{T}^{2} T 2 , using a Fourier pseudo-spectral discretization in space and a second-order semi-implicit time integrator. Spatial discretization.. All fields are represented by their truncated Fourier series on an N × N N \times N N × N grid with N = 128 N = 128 N = 128 . Linear operators are diagonal in Fourier space: differentiation is multiplication by i k ik ik , the stream-function solve − Δ ψ = ω -\Delta\psi= \omega − Δ ψ = ω is division by ∣ k ∣ 2 |k|^2 ∣ k ∣ 2 , and the anisotropic dissipation terms ν ∂ 11 ω \nu\partial_{11}\omega ν ∂ 11 ω and η ∂ 22 θ \eta\partial_{22}\theta η ∂ 22 θ become − ν k 1 2 ω ^ -\nu k_1^2\widehat{\omega} − ν k 1 2 ω and − η k 2 2 θ ^ -\eta k_2^2\widehat{\theta} − η k 2 2 θ . The quadratic advection terms are evaluated pseudo-spectrally in conservative form, u ⋅ ∇ ω = ∇ ⋅ ( u ω ) \mathbf{u}\cdot\nabla\omega= \nabla\cdot(\mathbf{u}\omega) u ⋅ ∇ ω = ∇ ⋅ ( u ω ) and u ⋅ ∇ θ = ∇ ⋅ ( u θ ) \mathbf{u}\cdot\nabla\theta= \nabla\cdot(\mathbf{u}\theta) u ⋅ ∇ θ = ∇ ⋅ ( u θ ) (using ∇ ⋅ u = 0 \nabla\cdot\mathbf{u} = 0 ∇ ⋅ u = 0 ): the products u ω \mathbf{u}\omega u ω and u θ \mathbf{u}\theta u θ are formed on the grid in physical space and their divergence is taken in Fourier space.
Time integration.. Writing the two evolution equations as ∂ t ω = N ω + ν ∂ 11 ω \partial_t\omega= \mathcal{N}_{\omega} + \nu\partial_{11}\omega ∂ t ω = N ω + ν ∂ 11 ω and ∂ t θ = N θ + η ∂ 22 θ \partial_t\theta= \mathcal{N}_{\theta} + \eta\partial_{22}\theta ∂ t θ = N θ + η ∂ 22 θ with the nonlinear-and-coupling parts
N ω = − u ⋅ ∇ ω + ∂ 1 θ , \mathcal{N}_{\omega} = -\mathbf{u}\cdot\nabla\omega+ \partial_1\theta, N ω = − u ⋅ ∇ ω + ∂ 1 θ ,
N θ = − u ⋅ ∇ θ − u 2 , \mathcal{N}_{\theta} = -\mathbf{u}\cdot\nabla\theta- u_2, N θ = − u ⋅ ∇ θ − u 2 ,
the system is advanced with a second-order semi-implicit scheme based on the backward differentiation formula (BDF2): the linear anisotropic dissipation is treated implicitly, while the advection and the buoyancy and coupling terms N ω , N θ \mathcal{N}_{\omega},\mathcal{N}_{\theta} N ω , N θ are treated explicitly by second-order extrapolation from the two previous time levels. In Fourier space, for each wavenumber k = ( k 1 , k 2 ) k = (k_1,k_2) k = ( k 1 , k 2 ) ,
( 3 2 Δ t + ν k 1 2 ) ω ^ n + 1 = 2 ω ^ n − 1 2 ω ^ n − 1 Δ t + N ^ ω ∗ , \left(\frac{3}{2\Delta t}+\nu k_1^2\right)\widehat{\omega}^{n+1}
=
\frac{2\widehat{\omega}^{n}-\frac{1}{2}\widehat{\omega}^{n-1}}{\Delta t}
+\widehat{\mathcal{N}}_{\omega}^{*}, ( 2Δ t 3 + ν k 1 2 ) ω n + 1 = Δ t 2 ω n − 2 1 ω n − 1 + N ω ∗ ,
( 3 2 Δ t + η k 2 2 ) θ ^ n + 1 = 2 θ ^ n − 1 2 θ ^ n − 1 Δ t + N ^ θ ∗ , \left(\frac{3}{2\Delta t}+\eta k_2^2\right)\widehat{\theta}^{n+1}
=
\frac{2\widehat{\theta}^{n}-\frac{1}{2}\widehat{\theta}^{n-1}}{\Delta t}
+\widehat{\mathcal{N}}_{\theta}^{*}, ( 2Δ t 3 + η k 2 2 ) θ n + 1 = Δ t 2 θ n − 2 1 θ n − 1 + N θ ∗ ,
where N ∗ \mathcal{N}^{*} N ∗ denotes the nonlinear terms evaluated at the extrapolated state ( ω ∗ , θ ∗ ) = ( 2 ω n − ω n − 1 , 2 θ n − θ n − 1 ) (\omega^{*},\theta^{*}) = (2\omega^{n}-\omega^{n-1},2\theta^{n}-\theta^{n-1}) ( ω ∗ , θ ∗ ) = ( 2 ω n − ω n − 1 , 2 θ n − θ n − 1 ) , with the corresponding velocity obtained from ω ∗ \omega^{*} ω ∗ by the Biot–Savart law (5) and (6) . The multistep scheme is initialized with a single first-order step of the same semi-implicit form, backward Euler for the dissipation and forward Euler for N ω , N θ \mathcal{N}_{\omega},\mathcal{N}_{\theta} N ω , N θ . No dealiasing filter is applied to the quadratic terms. The Courant–Friedrichs–Lewy (CFL) number Δ t ∥ u ∥ ∞ / h \Delta t\lVert\mathbf{u}\rVert_{\infty}/h Δ t ∥ u ∥ ∞ / h , with h = 2 π / N h = 2\pi/N h = 2 π / N , is monitored at every step and kept below 1 / 2 1/2 1/2 .
As is standard for odd-order derivatives on an even grid [34 Ch. 3] , the coefficients of the vorticity at the Nyquist wavenumbers k 1 = N / 2 k_1 = N/2 k 1 = N /2 and k 2 = N / 2 k_2 = N/2 k 2 = N /2 are set to zero, in the initial data and at every time step. The simulations use ν = η = 1 \nu= \eta= 1 ν = η = 1 , time step Δ t = 10 − 3 \Delta t = 10^{-3} Δ t = 1 0 − 3 , and are integrated to the final time T = 100 T = 100 T = 100 .
Initial data and data sets.. For each sample the initial vorticity ω 0 \omega_0 ω 0 and initial temperature θ 0 \theta_0 θ 0 are sampled independently as zero-mean Gaussian random fields on T 2 \mathbb{T}^2 T 2 with covariance operator ( τ 2 − Δ ) − α (\tau^2-\Delta)^{-\alpha} ( τ 2 − Δ ) − α . That is, the Fourier coefficients are independent complex Gaussians with variance proportional to ( τ 2 + ∣ k ∣ 2 ) − α (\tau^2+|k|^2)^{-\alpha} ( τ 2 + ∣ k ∣ 2 ) − α . For ω 0 \omega_0 ω 0 we take α = 2.5 \alpha= 2.5 α = 2.5 and τ = 7 \tau= 7 τ = 7 , the values used for the initial vorticity of the two-dimensional Navier–Stokes equations in [13 ] , and for θ 0 \theta_0 θ 0 we take α = 3.5 \alpha= 3.5 α = 3.5 and τ = 7 \tau= 7 τ = 7 . With probability one a sample lies in H s ( T 2 ) H^s(\mathbb{T}^2) H s ( T 2 ) exactly when s < α − 1 s < \alpha- 1 s < α − 1 , and the velocity is one derivative smoother than the vorticity, so u 0 \mathbf{u}_0 u 0 and θ 0 \theta_0 θ 0 both lie in H s H^s H s for every s < 5 / 2 s < 5/2 s < 5/2 , in particular in H 2 H^2 H 2 . The zero-frequency mode is set to zero, so that ∫ T 2 θ 0 d x = 0 \int_{\mathbb{T}^2}\theta_0\,dx = 0 ∫ T 2 θ 0 d x = 0 in accordance with the zero-mean hypothesis of Theorem 3.1. The velocity is recovered from the vorticity through the stream function (Biot–Savart law),
u ^ ( k ) = ( i k 2 ∣ k ∣ 2 , − i k 1 ∣ k ∣ 2 ) ω ^ ( k ) , k ≠ 0. \widehat{\mathbf{u}}(k)=\left(\frac{ik_2}{|k|^2},-\frac{ik_1}{|k|^2}\right)\widehat{\omega}(k),\qquad k\ne0. u ( k ) = ( ∣ k ∣ 2 i k 2 , − ∣ k ∣ 2 i k 1 ) ω ( k ) , k = 0.
Finally each sample is rescaled so that the smallness hypothesis (3.1) of Theorem 3.1 is realized with equality, the norm being divided evenly between the two fields,
∥ u 0 ∥ H 2 = ∥ θ 0 ∥ H 2 = 1 2 ε . (21) \|u_0\|_{H^2}=\|\theta_0\|_{H^2}=\tfrac{1}{2}\varepsilon. \tag*{(21)} ∥ u 0 ∥ H 2 = ∥ θ 0 ∥ H 2 = 2 1 ε . (21)
For each sample we store the initial pair ( ω 0 , θ 0 ) (\omega_0,\theta_0) ( ω 0 , θ 0 ) and the corresponding final fields ( ω ( ⋅ , T ) , θ ( ⋅ , T ) ) (\omega(\cdot,T),\theta(\cdot,T)) ( ω ( ⋅ , T ) , θ ( ⋅ , T )) , all on the 128 × 128 128 \times128 128 × 128 grid, together with its amplitude and the index of its group, a group being the five samples at one amplitude that share one initial vorticity. Because the rescaling of ω 0 \omega_0 ω 0 does not involve θ 0 \theta_0 θ 0 , the members of a group share their initial vorticity exactly. The training set uses ten amplitudes, consecutive ones differing by the factor 2 1 / 2 2^{1/2} 2 1/2 ,
ε j = 0.025 ⋅ 2 ( 2 j − 1 ) / 4 , j = 0 , … , 9 , (22) \varepsilon_j=0.025\cdot2^{(2j-1)/4},\qquad j=0,\ldots,9, \tag*{(22)} ε j = 0.025 ⋅ 2 ( 2 j − 1 ) /4 , j = 0 , … , 9 , (22)
with 1000 samples each, 200 initial vorticities each paired with five independent initial temperatures, 10 4 10^4 1 0 4 samples in all. Two test sets are generated with independent random seeds. The training-amplitude set uses the same ten amplitudes with 100 samples each, 20 initial vorticities each paired with five independent initial temperatures. The interpolation set uses the five amplitudes ε ∈ { 0.025 , 0.05 , 0.1 , 0.2 , 0.4 } \varepsilon\in\{0.025, 0.05, 0.1, 0.2, 0.4\} ε ∈ { 0.025 , 0.05 , 0.1 , 0.2 , 0.4 } with 200 samples each, 40 initial vorticities each paired with five independent initial temperatures. Each interpolation amplitude lies a factor 2 1 / 4 2^{1/4} 2 1/4 from the two nearest training amplitudes, inside the trained range. Neither test set enters the loss. The 1.2 × 10 4 1.2 \times10^4 1.2 × 1 0 4 simulations took 33.8 hours of wall-clock time in all, an average of 10.2 s each. Each of the 25 amplitudes of the three sets was generated as a separate job, the jobs running in parallel, so the 10 3 10^3 1 0 3 training samples of one amplitude took between 2.2 and 3.1 hours and the complete data were available after about three hours.
The late-time temperature and why it is not a prediction target
Linear prediction.. By Proposition 3.2, ∣ θ ^ ( k 1 , k 2 , t ) ∣ |\hat{\theta}(k_1,k_2,t)| ∣ θ ^ ( k 1 , k 2 , t ) ∣ with k 2 ≠ 0 k_2 \ne0 k 2 = 0 decays at least like e − min { ν , η } t e^{-\min\{\nu,\eta\}t} e − m i n { ν , η } t , which is e − 100 e^{-100} e − 100 at T = 100 T=100 T = 100 when ν = η = 1 \nu=\eta=1 ν = η = 1 . When k 2 = 0 k_2=0 k 2 = 0 , ∣ θ ^ ( k 1 , 0 , t ) ∣ |\hat{\theta}(k_1,0,t)| ∣ θ ^ ( k 1 , 0 , t ) ∣ decays like e − t / ( ν k 1 2 ) e^{-t/(\nu k_1^2)} e − t / ( ν k 1 2 ) , since ∣ λ + ∣ = ( ν k 1 2 ) − 1 + O ( ( ν k 1 2 ) − 3 ) |\lambda_+|=(\nu k_1^2)^{-1}+O((\nu k_1^2)^{-3}) ∣ λ + ∣ = ( ν k 1 2 ) − 1 + O (( ν k 1 2 ) − 3 ) by the formula in Proposition 3.2(b). Let E t ( k 1 ) E_t(k_1) E t ( k 1 ) denote the expectation of ∣ θ ^ ( k 1 , 0 , t ) ∣ 2 / ε 2 |\hat{\theta}(k_1,0,t)|^2/\varepsilon^2 ∣ θ ^ ( k 1 , 0 , t ) ∣ 2 / ε 2 . Then
E T ( k 1 ) ≈ E 0 ( k 1 ) e − 2 T / ( ν k 1 2 ) , when ν k 1 2 ≫ 1. (23) E_T(k_1)\approx E_0(k_1)e^{-2T/(\nu k_1^2)},\qquad\text{when }\nu k_1^2\gg1. \tag*{(23)} E T ( k 1 ) ≈ E 0 ( k 1 ) e − 2 T / ( ν k 1 2 ) , when ν k 1 2 ≫ 1. (23)
For the Gaussian fields of § 4.2 , E 0 ( k 1 ) ∝ ( τ 2 + k 1 2 ) − α E_0(k_1)\propto(\tau^2+k_1^2)^{-\alpha} E 0 ( k 1 ) ∝ ( τ 2 + k 1 2 ) − α with α = 3.5 \alpha=3.5 α = 3.5 and τ = 7 \tau=7 τ = 7 , and the right-hand side of (23) when T = 100 T=100 T = 100 and ν = 1 \nu=1 ν = 1 is largest at k 1 ∗ = 9.4 k_1^*=9.4 k 1 ∗ = 9.4 .
Comparison with the simulations.. The 2000 spectral simulations of the two test sets agree with this analysis. At T = 100 T=100 T = 100 the temperature of each run is, to a close approximation, a function of x 1 x_1 x 1 alone, oscillating in x 1 x_1 x 1 (Figure 1 ). The modes with k 2 = 0 k_2=0 k 2 = 0 carry a median 99.9999 percent of ∥ θ ( ⋅ , T ) ∥ L 2 2 \|\theta(\cdot,T)\|_{L^2}^2 ∥ θ ( ⋅ , T ) ∥ L 2 2 , against 5 percent in the initial data, and the L 2 L^2 L 2 norm of θ \theta θ has fallen by a median factor of about 50. The wavenumber ∣ k 1 ∣ |k_1| ∣ k 1 ∣ at which ∣ θ ^ ( k 1 , 0 , T ) ∣ 2 |\hat{\theta}(k_1,0,T)|^2 ∣ θ ^ ( k 1 , 0 , T ) ∣ 2 is largest has median 10, close to k 1 ∗ = 9.4 k_1^*=9.4 k 1 ∗ = 9.4 . At every k 1 k_1 k 1 with 7 ≤ k 1 ≤ 20 7 \le k_1 \le20 7 ≤ k 1 ≤ 20 , a range that carries 90 percent of ∑ k 1 E T ( k 1 ) \sum_{k_1} E_T(k_1) ∑ k 1 E T ( k 1 ) , the right-hand side of (23) , with E 0 E_0 E 0 replaced by its average over the 2000 runs, differs from the average of ∣ θ ^ ( k 1 , 0 , T ) ∣ 2 / ε 2 |\hat{\theta}(k_1,0,T)|^2/\varepsilon^2 ∣ θ ^ ( k 1 , 0 , T ) ∣ 2 / ε 2 over the same runs by a relative error of at most 0.6 percent. The oscillation of θ ( ⋅ , T ) \theta(\cdot,T) θ ( ⋅ , T ) in x 1 x_1 x 1 is therefore not a numerical artifact. It is the part of θ 0 \theta_0 θ 0 with k 2 = 0 k_2=0 k 2 = 0 , from which the coupling with u 2 u_2 u 2 has removed the modes with small ∣ k 1 ∣ |k_1| ∣ k 1 ∣ , while the decay of E 0 E_0 E 0 with ∣ k 1 ∣ |k_1| ∣ k 1 ∣ keeps the energy at large ∣ k 1 ∣ |k_1| ∣ k 1 ∣ small.
Figure 1. Top: the initial temperature and the temperature at T = 100 T = 100 T = 100 of a representative run of the interpolation set, at ε = 0.1 \varepsilon= 0.1 ε = 0.1 (note the differing color scales). Bottom left: ∣ θ ^ ( k 1 , 0 , t ) ∣ 2 |\hat{\theta}(k_1,0,t)|^2 ∣ θ ^ ( k 1 , 0 , t ) ∣ 2 of the same run at t = 0 t = 0 t = 0 and t = T t = T t = T . Bottom right: the averages of ∣ θ ^ ( k 1 , 0 , t ) ∣ 2 / ε 2 |\hat{\theta}(k_1,0,t)|^2/\varepsilon^2 ∣ θ ^ ( k 1 , 0 , t ) ∣ 2 / ε 2 over the 2000 test runs at t = 0 t = 0 t = 0 and t = T t = T t = T , which estimate E 0 E_0 E 0 and E T E_T E T , and the right-hand side of (4.6) evaluated with the average at t = 0 t = 0 t = 0 . The dotted line marks k 1 ∗ = 9.4 k_1^* = 9.4 k 1 ∗ = 9.4 . In both panels the shaded band is 7 ≤ ∣ k 1 ∣ ≤ 20 7 \leq|k_1| \leq20 7 ≤ ∣ k 1 ∣ ≤ 20 .
Why the temperature is not a prediction target.. By (23) the map θ 0 ↦ θ ( ⋅ , T ) \theta_0 \mapsto\theta(\cdot,T) θ 0 ↦ θ ( ⋅ , T ) is severely ill-conditioned. On the modes with k 2 = 0 k_2=0 k 2 = 0 the measured value of the multiplier, ( E T ( k 1 ) / E 0 ( k 1 ) ) 1 / 2 (E_T(k_1)/E_0(k_1))^{1/2} ( E T ( k 1 ) / E 0 ( k 1 ) ) 1/2 , is 4.8 × 10 − 11 4.8 \times10^{-11} 4.8 × 1 0 − 11 , 1.4 × 10 − 5 1.4 \times10^{-5} 1.4 × 1 0 − 5 , 1.9 × 10 − 3 1.9 \times10^{-3} 1.9 × 1 0 − 3 , 0.368 0.368 0.368 , 0.902 0.902 0.902 and 1.00 1.00 1.00 at k 1 = 2 , 3 , 4 , 10 , 32 , 64 k_1 = 2, 3, 4, 10, 32, 64 k 1 = 2 , 3 , 4 , 10 , 32 , 64 , the last because the vertical velocity vanishes at k 1 = N / 2 = 64 k_1 = N/2 = 64 k 1 = N /2 = 64 , where the coefficients of the vorticity are set to zero, so that this mode is neither damped nor coupled. The ratio of its largest to its smallest value exceeds 10 10 10^{10} 1 0 10 , and in a preliminary experiment at a single amplitude a network trained with both ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) and θ ( ⋅ , T ) \theta(\cdot,T) θ ( ⋅ , T ) as targets did not converge. Moreover, by Theorem 3.1 (a) the temperature decays to zero, and at T = 100 T = 100 T = 100 its median L 2 L^2 L 2 norm is 1.3 × 10 − 5 1.3 \times10^{-5} 1.3 × 1 0 − 5 . The network therefore predicts only the vorticity, and θ 0 \theta_0 θ 0 is kept as an input because it enters the evolution of the vorticity.
Network structure and training
Network architecture. The Fourier neural operator of § 4.1 is instantiated in two spatial dimensions with L = 4 L = 4 L = 4 Fourier layers, k max = 32 k_{\max} = 32 k m a x = 32 , so that the wavenumbers − 32 ≤ k 1 < 32 -32 \leq k_1 < 32 − 32 ≤ k 1 < 32 and ∣ k 2 ∣ ≤ 32 |k_2| \leq32 ∣ k 2 ∣ ≤ 32 are retained, the second direction being handled by a real Fourier transform, and 64 hidden channels. The lifting and projection maps use channel-expansion ratios of 2 and 4, respectively. The network has three input channels and two output channels on the 128 × 128 128 \times128 128 × 128 grid.
The inputs are the rescaled initial fields ω 0 / ε \omega_0/\varepsilon ω 0 / ε and θ 0 / ε \theta_0/\varepsilon θ 0 / ε , and a constant channel log ( ε / 0.1 ) \log(\varepsilon/0.1) log ( ε /0.1 ) that encodes the amplitude. Each channel is standardized with one mean and one standard deviation computed over the training set.
The outputs are not the final vorticity itself. Theorem 3.1 (b) says that the horizontal average of the vorticity stays within C ε 2 C\varepsilon^2 C ε 2 of ω ˉ 0 \bar{\omega}_0 ω ˉ 0 at every time. On the test sets the change of the horizontal average,
δ ω ˉ : = ω ˉ ( ⋅ , T ) − ω ˉ 0 , (24) \delta\bar{\omega} := \bar{\omega}(\cdot,T) - \bar{\omega}_0, \tag*{(24)} δ ω ˉ := ω ˉ ( ⋅ , T ) − ω ˉ 0 , (24)
is a median 5.4 × 10 − 5 5.4 \times10^{-5} 5.4 × 1 0 − 5 to 1.2 × 10 − 3 1.2 \times10^{-3} 1.2 × 1 0 − 3 of ω ˉ 0 \bar{\omega}_0 ω ˉ 0 in L 2 L^2 L 2 , growing with ε \varepsilon ε . A network that predicts ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) whole would have to represent a correction three to four orders of magnitude below the field it outputs. We therefore give the surrogate the structure of the theorem,
ω N O ( ⋅ , T ) = ω ˉ 0 + s m ( ε ) m N O + s q ( ε ) q N O , (25) \omega^{\mathrm{NO}}(\cdot,T)=\bar{\omega}_0+s_m(\varepsilon)m^{\mathrm{NO}}+s_q(\varepsilon)q^{\mathrm{NO}}, \tag*{(25)} ω NO ( ⋅ , T ) = ω ˉ 0 + s m ( ε ) m NO + s q ( ε ) q NO , (25)
where ω ˉ 0 \bar{\omega}_0 ω ˉ 0 is computed exactly from the input ω 0 \omega_0 ω 0 and the superscript NO marks an output of the neural operator. The network has two output channels. The first, with its x 1 x_1 x 1 -average removed, is q N O q^{\mathrm{NO}} q NO , and the x 1 x_1 x 1 -average of the second is m N O ( x 2 ) m^{\mathrm{NO}}(x_2) m NO ( x 2 ) . The remaining parts of the two channels do not enter (25) . Thus s m m N O s_m m^{\mathrm{NO}} s m m NO and s q q N O s_q q^{\mathrm{NO}} s q q NO approximate the two parts of ω ( ⋅ , T ) − ω ˉ 0 \omega(\cdot,T)-\bar{\omega}_0 ω ( ⋅ , T ) − ω ˉ 0 in the mean/oscillation decomposition of Sec. 2.2, δ ω ˉ \delta\bar{\omega} δ ω ˉ and ω ~ ( ⋅ , T ) \widetilde{\omega}(\cdot,T) ω ( ⋅ , T ) , respectively.
For each training amplitude ε j \varepsilon_j ε j , the scales s q ( ε j ) s_q(\varepsilon_j) s q ( ε j ) and s m ( ε j ) s_m(\varepsilon_j) s m ( ε j ) are the root-mean-square values of ω ~ ( ⋅ , T ) \widetilde{\omega}(\cdot,T) ω ( ⋅ , T ) and δ ω ˉ \delta\bar{\omega} δ ω ˉ over the grid points and the n j = 1000 n_j=1000 n j = 1000 training samples at that amplitude,
s q ( ε j ) = ( 1 n j ∑ i = 1 n j ∥ ω ~ i ( ⋅ , T ) ∥ L 2 2 4 π 2 ) 1 / 2 , s m ( ε j ) = ( 1 n j ∑ i = 1 n j ∥ δ ω ˉ i ∥ L 2 2 4 π 2 ) 1 / 2 . (26) s_q(\varepsilon_j)=\left(\frac{1}{n_j}\sum_{i=1}^{n_j}\frac{\lVert\widetilde{\omega}_i(\cdot,T)\rVert_{L^2}^2}{4\pi^2}\right)^{1/2},\qquad
s_m(\varepsilon_j)=\left(\frac{1}{n_j}\sum_{i=1}^{n_j}\frac{\lVert\delta\bar{\omega}_i\rVert_{L^2}^2}{4\pi^2}\right)^{1/2}. \tag*{(26)} s q ( ε j ) = ( n j 1 i = 1 ∑ n j 4 π 2 ∥ ω i ( ⋅ , T ) ∥ L 2 2 ) 1/2 , s m ( ε j ) = ( n j 1 i = 1 ∑ n j 4 π 2 ∥ δ ω ˉ i ∥ L 2 2 ) 1/2 . (26)
Between the training amplitudes, log s q \log s_q log s q and log s m \log s_m log s m are interpolated linearly in log ε \log\varepsilon log ε . No power of ε \varepsilon ε is imposed, but over the training amplitudes s m s_m s m grows as ε 2.00 \varepsilon^{2.00} ε 2.00 , with s m / ε 2 s_m/\varepsilon^2 s m / ε 2 between 5.7 × 10 − 6 5.7\times10^{-6} 5.7 × 1 0 − 6 and 6.6 × 10 − 6 6.6\times10^{-6} 6.6 × 1 0 − 6 , and s q s_q s q as ε 1.00 \varepsilon^{1.00} ε 1.00 . Because the scales carry the growth of the targets with ε \varepsilon ε , the network outputs m N O m^{\mathrm{NO}} m NO and q N O q^{\mathrm{NO}} q NO are of order one at every amplitude and depend mainly on the normalized data ω 0 / ε \omega_0/\varepsilon ω 0 / ε and θ 0 / ε \theta_0/\varepsilon θ 0 / ε .
Training process. The training set is the 10 4 10^4 1 0 4 samples of Sec. 4.2. An epoch is one pass through the training set, and a batch is the set of B B B samples used in one gradient update. The loss is the sum of the relative L 2 L^2 L 2 errors of the two outputs, each per sample and averaged over the batch of size B B B ,
L = 1 B ∑ i = 1 B ∥ s q q i N O − ω ~ i ( ⋅ , T ) ∥ L 2 ∥ ω ~ i ( ⋅ , T ) ∥ L 2 + γ 1 B ∑ i = 1 B ∥ s m m i N O − δ ω ˉ i ∥ L 2 ∥ δ ω ˉ i ∥ L 2 , γ = 10. (27) \mathcal{L}=\frac{1}{B}\sum_{i=1}^{B}\frac{\lVert s_q q_i^{\mathrm{NO}}-\widetilde{\omega}_i(\cdot,T)\rVert_{L^2}}{\lVert\widetilde{\omega}_i(\cdot,T)\rVert_{L^2}}+\gamma\frac{1}{B}\sum_{i=1}^{B}\frac{\lVert s_m m_i^{\mathrm{NO}}-\delta\bar{\omega}_i\rVert_{L^2}}{\lVert\delta\bar{\omega}_i\rVert_{L^2}},\qquad\gamma=10. \tag*{(27)} L = B 1 i = 1 ∑ B ∥ ω i ( ⋅ , T ) ∥ L 2 ∥ s q q i NO − ω i ( ⋅ , T ) ∥ L 2 + γ B 1 i = 1 ∑ B ∥ δ ω ˉ i ∥ L 2 ∥ s m m i NO − δ ω ˉ i ∥ L 2 , γ = 10. (27)
The weight γ \gamma γ emphasizes δ ω ˉ \delta\bar{\omega} δ ω ˉ , the part on which Theorem 3.1 (b) bears. Two preliminary runs on 900 samples, with γ = 10 \gamma=10 γ = 10 and γ = 100 \gamma=100 γ = 100 , showed that the larger weight did not improve δ ω ˉ \delta\bar{\omega} δ ω ˉ and left the oscillation output unlearned, its relative error staying at 1, so γ = 10 \gamma=10 γ = 10 is used. Optimization uses AdamW [20 ] with learning rate 3 × 10 − 4 3\times10^{-4} 3 × 1 0 − 4 , weight decay 10 − 4 10^{-4} 1 0 − 4 and batch size B = 8 B=8 B = 8 , the learning rate being halved every 200 epochs. The network is trained for 600 epochs, 7.5 × 10 5 7.5\times10^5 7.5 × 1 0 5 gradient updates of 3.47 × 10 7 3.47\times10^7 3.47 × 1 0 7 parameters (complex weights counted once), on a single NVIDIA Tesla V100S (32 GB) GPU, in 10 h 59 min of wall-clock time, 66 s per epoch.
Surrogate accuracy and cost
Accuracy. On the 2 × 10 3 2\times10^3 2 × 1 0 3 test samples the surrogate (25) reproduces the final vorticity ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) to a median relative L 2 L^2 L 2 error between 3.8 × 10 − 5 3.8\times10^{-5} 3.8 × 1 0 − 5 and 2.4 × 10 − 4 2.4\times10^{-4} 2.4 × 1 0 − 4 at the five interpolation amplitudes, and between 4.0 × 10 − 5 4.0\times10^{-5} 4.0 × 1 0 − 5 and 3.3 × 10 − 4 3.3\times10^{-4} 3.3 × 1 0 − 4 at the ten training amplitudes, the error growing with the amplitude. Figure 2 shows the training history and Figure 3 three test samples, the best, the median and the worst.
Figure 2. Training history of the Fourier neural operator, versus epoch. Each curve is the average over the batches of each epoch. Black: the loss (4.10). Blue: the first term in (4.10), the relative L 2 L^2 L 2 error of the oscillation on the training set. Orange: the second term in (4.10) without γ \gamma γ , the relative L 2 L^2 L 2 error of δ ω ˉ \delta\bar{\omega} δ ω ˉ on the training set. The learning rate is halved at epochs 200 and 400.
Figure 3. The surrogate on the three samples of the interpolation set with the smallest, median and largest relative L 2 L^2 L 2 error of ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) among the 10 3 10^3 1 0 3 samples of that set (2.7 × 10 − 5 2.7 \times10^{-5} 2.7 × 1 0 − 5 , 7.0 × 10 − 5 7.0 \times10^{-5} 7.0 × 1 0 − 5 and 5.4 × 10 − 4 5.4 \times10^{-4} 5.4 × 1 0 − 4 ). Columns: the two input fields ω 0 \omega_0 ω 0 and θ 0 \theta_0 θ 0 , the spectral-solver final vorticity ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) , the prediction ω N O ( ⋅ , T ) \omega^{\mathrm{NO}}(\cdot,T) ω NO ( ⋅ , T ) of (25) , and the pointwise error on its own scale. Fields are drawn with x 1 x_1 x 1 horizontal. The final vorticity is banded horizontally, that is, nearly independent of x 1 x_1 x 1 . In the best case the error varies with x 1 x_1 x 1 and lies in the oscillation. In the worst case it is banded horizontally and lies in the fine structure of the stratified profile.
The field is accurate because most of it is ω ˉ 0 \bar{\omega}_0 ω ˉ 0 , which the surrogate adds exactly. The two learned parts are reproduced less accurately. The median relative L 2 L^2 L 2 error is 4.0 to 4.7 percent for the oscillation ω ~ ( ⋅ , T ) \widetilde{\omega}(\cdot,T) ω ( ⋅ , T ) and 23 to 27 percent for δ ω ˉ \delta\bar{\omega} δ ω ˉ , nearly the same at every amplitude. Both parts are small compared with ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) , so these errors barely affect the field.
The error of δ ω ˉ , s m N O − δ ω ˉ \delta\bar{\omega}, s_m^{\mathrm{NO}}-\delta\bar{\omega} δ ω ˉ , s m NO − δ ω ˉ , lies at fine vertical scales. Of its squared L 2 L^2 L 2 norm, 95 to 99 percent lies at ∣ k 2 ∣ > 16 |k_2| > 16 ∣ k 2 ∣ > 16 , against 22 to 26 percent for δ ω ˉ \delta\bar{\omega} δ ω ˉ itself, so the network reproduces the large-scale profile of δ ω ˉ \delta\bar{\omega} δ ω ˉ and misses its fine structure. On the training samples this error is far smaller, below 10 − 2 10^{-2} 1 0 − 2 from epoch 201 on and 2.4 × 10 − 3 2.4 \times10^{-3} 2.4 × 1 0 − 3 at the end, so the fine structure is learned for the training profiles but does not carry over to new ones. The H − 2 H^{-2} H − 2 norm of Theorem 3.1 (b) weights high wavenumbers weakly. In this norm the median relative error of δ ω ˉ \delta\bar{\omega} δ ω ˉ is 6 to 10 percent at every amplitude, and ∥ δ ω ˉ ∥ H − 2 \lVert\delta\bar{\omega}\rVert_{H^{-2}} ∥ δ ω ˉ ∥ H − 2 , which Theorem 3.1 (b) bounds by C ε 2 C\varepsilon^2 C ε 2 at every time, is reproduced to a median relative error of 2.2 percent (§ 4.6 ).
Inference cost. Once trained, the surrogate is far cheaper to evaluate than the spectral solver that generated its data, which costs 10.2 s per simulation on average (§ 4.2 ). On one NVIDIA Tesla V100S (32 GB), a batch of 16 initial fields is mapped to the final vorticity (4.8), including the computation of the inputs and of (4.8), in 21.3 ms, that is, 1.33 ms per field, and a batch of 64 in 73.6 ms, 1.15 ms per field. Against the 10.2 s of the solver, at the batch of 16, the surrogate is about 8 × 10 3 8 \times10^3 8 × 1 0 3 times faster per field.
The quantity of Theorem 3.1(b): solver and surrogate
Theorem 3.1 (b) bounds ∥ ω ˉ ( ⋅ , t ) − ω ˉ 0 ∥ H − 2 \lVert\bar{\omega}(\cdot,t)-\bar{\omega}_0\rVert_{H^{-2}} ∥ ω ˉ ( ⋅ , t ) − ω ˉ 0 ∥ H − 2 at every time by C ε 2 C\varepsilon^2 C ε 2 , with C C C independent of the data, in the norm (3.2). For the whole field the bound is weaker. Writing ω − ω ˉ 0 = ( ω ˉ − ω ˉ 0 ) + ω ~ \omega-\bar{\omega}_0=(\bar{\omega}-\bar{\omega}_0)+\widetilde{\omega} ω − ω ˉ 0 = ( ω ˉ − ω ˉ 0 ) + ω and using ∥ ω ~ ∥ H − 2 ≤ ∥ ω ~ ∥ L 2 \lVert\widetilde{\omega}\rVert_{H^{-2}}\leq\lVert\widetilde{\omega}\rVert_{L^2} ∥ ω ∥ H − 2 ≤ ∥ ω ∥ L 2 , ∥ ω ~ ∥ L 2 ≤ ∥ ω ∥ L 2 \lVert\widetilde{\omega}\rVert_{L^2}\leq\lVert\omega\rVert_{L^2} ∥ ω ∥ L 2 ≤ ∥ ω ∥ L 2 and ∥ ω ∥ L 2 ≤ ∥ u ∥ H 2 \lVert\omega\rVert_{L^2}\leq\lVert u\rVert_{H^2} ∥ ω ∥ L 2 ≤ ∥ u ∥ H 2 (Lemma 2.1 (c)) together with (A.2),
∥ ω ( ⋅ , t ) − ω ˉ 0 ∥ H − 2 ≤ C ε 2 + C ∗ ε for every t ≥ 0 , (28) \lVert\omega(\cdot,t)-\bar{\omega}_0\rVert_{H^{-2}}\leq C\varepsilon^2+C_*\varepsilon\qquad\text{for every }t\geq0, \tag*{(28)} ∥ ω ( ⋅ , t ) − ω ˉ 0 ∥ H − 2 ≤ C ε 2 + C ∗ ε for every t ≥ 0 , (28)
which is of order ε \varepsilon ε because the oscillation ω ~ \widetilde{\omega} ω is. For a sample i i i at the final time T = 100 T=100 T = 100 we define
R ˉ i = ∥ ω ˉ i ( ⋅ , T ) − ω ˉ 0 , i ∥ H − 2 ε i 2 , R i = ∥ ω i ( ⋅ , T ) − ω ˉ 0 , i ∥ H − 2 ε i , (29) \bar{R}_i=\frac{\lVert\bar{\omega}_i(\cdot,T)-\bar{\omega}_{0,i}\rVert_{H^{-2}}}{\varepsilon_i^2},\qquad R_i=\frac{\lVert\omega_i(\cdot,T)-\bar{\omega}_{0,i}\rVert_{H^{-2}}}{\varepsilon_i}, \tag*{(29)} R ˉ i = ε i 2 ∥ ω ˉ i ( ⋅ , T ) − ω ˉ 0 , i ∥ H − 2 , R i = ε i ∥ ω i ( ⋅ , T ) − ω ˉ 0 , i ∥ H − 2 , (29)
and by Theorem 3.1 (b), R ˉ i ≤ C \bar{R}_i\leq C R ˉ i ≤ C for every sample, while by (28) R i ≤ C ε i + C ∗ R_i\leq C\varepsilon_i+C_* R i ≤ C ε i + C ∗ .
Table 1 is built as follows. For each of the 2 × 10 3 2\times10^3 2 × 1 0 3 test samples, the norms in (29) are evaluated with the discrete Fourier coefficients on the 128 × 128 128\times128 128 × 128 grid, once with the solver’s ω i ( ⋅ , T ) \omega_i(\cdot,T) ω i ( ⋅ , T ) , giving R ˉ i \bar{R}_i R ˉ i and R i R_i R i , and once with the surrogate’s prediction (4.8) in its place, giving R ˉ i N O \bar{R}_i^{\mathrm{NO}} R ˉ i NO and R i N O R_i^{\mathrm{NO}} R i NO . At each amplitude the table lists the sample mean, the standard deviation and the maximum of R ˉ \bar{R} R ˉ , the sample mean and the maximum of R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO , the median and the maximum of ∣ R i N O − R ˉ i ∣ / R ˉ i \lvert R_i^{\mathrm{NO}}-\bar{R}_i\rvert/\bar{R}_i ∣ R i NO − R ˉ i ∣ / R ˉ i , the sample mean of R R R and the median of ∣ R i N O − R i ∣ / R i \lvert R_i^{\mathrm{NO}}-R_i\rvert/R_i ∣ R i NO − R i ∣ / R i . Figure 4 shows the same data for R ˉ \bar{R} R ˉ . Panel (a) plots R ˉ i \bar{R}_i R ˉ i of every solver run against its amplitude, together with the sample mean and the maximum at each amplitude for the solver and for the surrogate, and panel (b) plots R ˉ i N O \bar{R}_i^{\mathrm{NO}} R ˉ i NO against R ˉ i \bar{R}_i R ˉ i for every sample.
Table 1. The quantities of (29) at T = 100 T=100 T = 100 on the 2 × 10 3 2 \times10^3 2 × 1 0 3 test samples, from the spectral solver and from the surrogate. R ˉ \bar{R} R ˉ is bounded by Theorem 3.1 (b) at every time. The interpolation amplitudes (top) were not used in training. The columns ∣ R ˉ N O − R ˉ ∣ / R ˉ \lvert\bar{R}^{\mathrm{NO}}-\bar{R}\rvert/\bar{R} ∣ R ˉ NO − R ˉ ∣ / R ˉ give the median and the maximum over the amplitude of the per-sample relative difference, and the last two columns the sample mean of R R R and the median of its relative difference. In the column set, train. marks the training amplitudes and interp. the interpolation amplitudes. Standard deviations use n − 1 n-1 n − 1 .
Figure 4. (a) R ˉ = ∥ ω ˉ ( ⋅ , T ) − ω ˉ 0 ∥ H − 2 / ε 2 \bar{R}=\lVert\bar{\omega}(\cdot,T)-\bar{\omega}_0\rVert_{H^{-2}}/\varepsilon^2 R ˉ = ∥ ω ˉ ( ⋅ , T ) − ω ˉ 0 ∥ H − 2 / ε 2 at T = 100 T=100 T = 100 for every test sample of the spectral solver (dots, spread slightly in ε \varepsilon ε for visibility), with the sample mean (solid line, filled markers) and the maximum (dashed line, open markers) at each amplitude for the solver (circles) and the surrogate (squares). The dotted line is the largest of the 2 × 10 3 2 \times10^3 2 × 1 0 3 solver values. Both the sample mean and the maximum stay nearly the same over a factor of 2 3 2^3 2 3 in ε \varepsilon ε . (b) The surrogate’s R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO against the solver’s R ˉ \bar{R} R ˉ , sample by sample, with the line of equality. The median printed in the panel is over all 2 × 10 3 2 \times10^3 2 × 1 0 3 samples.
Table 1 and Figure 4 show four things. First, R ˉ \bar{R} R ˉ stays nearly the same as ε \varepsilon ε varies. Its sample mean lies between 1.33 × 10 − 6 1.33 \times10^{-6} 1.33 × 1 0 − 6 and 1.55 × 10 − 6 1.55 \times10^{-6} 1.55 × 1 0 − 6 at every amplitude from 0.021 0.021 0.021 to 0.476 0.476 0.476 , and a least-squares fit of the sample mean of ∥ ω ˉ ( ⋅ , T ) − ω ˉ 0 ∥ H − 2 \lVert\bar{\omega}(\cdot,T)-\bar{\omega}_0\rVert_{H^{-2}} ∥ ω ˉ ( ⋅ , T ) − ω ˉ 0 ∥ H − 2 to c ε p c\varepsilon^p c ε p over all 15 amplitudes gives p = 1.99 p=1.99 p = 1.99 , with 95 percent bootstrap interval [ 1.95 , 2.03 ] [1.95, 2.03] [ 1.95 , 2.03 ] . The maximum also stays nearly the same: it lies between 2.45 × 10 − 6 2.45 \times10^{-6} 2.45 × 1 0 − 6 and 4.24 × 10 − 6 4.24 \times10^{-6} 4.24 × 1 0 − 6 . All 2 × 10 3 2 \times10^3 2 × 1 0 3 runs therefore satisfy
∥ ω ˉ ( ⋅ , T ) − ω ˉ 0 ∥ H − 2 ≤ 4.25 × 10 − 6 ε 2 \lVert\bar{\omega}(\cdot,T)-\bar{\omega}_0\rVert_{H^{-2}} \le4.25 \times10^{-6}\varepsilon^2 ∥ ω ˉ ( ⋅ , T ) − ω ˉ 0 ∥ H − 2 ≤ 4.25 × 1 0 − 6 ε 2
which is the form of Theorem 3.1 (b) with an empirical constant, and over the range tested nothing in the data suggests that the constant grows as ε \varepsilon ε decreases. All the samples come from one family of initial data, Gaussian random fields of fixed covariance rescaled to the amplitude ε \varepsilon ε , so the test shows that for this family the change is of second order with a bounded ratio, and the empirical constant depends on the covariance of the initial data. § 4.8 shows that initial data of other shapes give a ratio more than four times larger.
Second, at a fixed amplitude R ˉ \bar{R} R ˉ varies from sample to sample. Its standard deviation in Table 1 is 0.36 to 0.54 times its sample mean. This variation comes from the shapes of the initial data, ω 0 / ε \omega_0/\varepsilon ω 0 / ε and θ 0 / ε \theta_0/\varepsilon θ 0 / ε , which differ from sample to sample, and not from the amplitude, since the relative spread is about the same at every ε \varepsilon ε .
Third, the surrogate’s R ˉ i N O \bar{R}^{\mathrm{NO}}_i R ˉ i NO is close to the solver’s R ˉ i \bar{R}_i R ˉ i in each individual run. At every amplitude the sample mean of R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO agrees with that of R ˉ \bar{R} R ˉ to within 7 percent, and its maximum and standard deviation to within 8 percent. Over all 2 × 10 3 2 \times10^3 2 × 1 0 3 test runs, the median of ∣ R ˉ i N O − R ˉ i ∣ / R ˉ i \lvert\bar{R}^{\mathrm{NO}}_i-\bar{R}_i\rvert/\bar{R}_i ∣ R ˉ i NO − R ˉ i ∣ / R ˉ i is 2.2 percent, 84 percent of the runs have it below 5 percent, and every run below 12 percent. The largest value of R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO , 4.05 × 10 − 6 4.05 \times10^{-6} 4.05 × 1 0 − 6 , is 5 percent below the largest value of R ˉ \bar{R} R ˉ . At every amplitude the median of ∣ R ˉ i N O − R ˉ i ∣ / R ˉ i \lvert\bar{R}^{\mathrm{NO}}_i-\bar{R}_i\rvert/\bar{R}_i ∣ R ˉ i NO − R ˉ i ∣ / R ˉ i lies between 1.3 and 6.6 percent.
Fourth, R R R behaves differently. Its sample mean is nearly the same, between 1.8 × 10 − 7 1.8 \times10^{-7} 1.8 × 1 0 − 7 and 2.1 × 10 − 7 2.1 \times10^{-7} 2.1 × 1 0 − 7 , for ε ≤ 0.06 \varepsilon\le0.06 ε ≤ 0.06 , and rises to 7.4 × 10 − 7 7.4 \times10^{-7} 7.4 × 1 0 − 7 at ε = 0.476 \varepsilon= 0.476 ε = 0.476 . To see why, write
ω ( ⋅ , T ) − ω ˉ 0 = δ ω ˉ + ω ~ ( ⋅ , T ) , \omega(\cdot,T)-\bar{\omega}_0=\delta\bar{\omega}+\widetilde{\omega}(\cdot,T), ω ( ⋅ , T ) − ω ˉ 0 = δ ω ˉ + ω ( ⋅ , T ) ,
where ∥ δ ω ˉ ∥ H − 2 = ε 2 R ˉ \lVert\delta\bar{\omega}\rVert_{H^{-2}}=\varepsilon^2\bar{R} ∥ δ ω ˉ ∥ H − 2 = ε 2 R ˉ is of order ε 2 \varepsilon^2 ε 2 . Theorem 3.1 (b) drives the oscillation ω ~ \widetilde{\omega} ω to zero, but at T = 100 T=100 T = 100 it is still present, because it is tied to the slowly decaying temperature modes with k 2 = 0 k_2=0 k 2 = 0 of § 4.3 . In every run at least 99.99 percent of ∥ ω ~ ( ⋅ , T ) ∥ H − 2 2 \lVert\widetilde{\omega}(\cdot,T)\rVert_{H^{-2}}^2 ∥ ω ( ⋅ , T ) ∥ H − 2 2 lies on the modes with k 2 = 0 k_2=0 k 2 = 0 , and on these modes the equation ω ^ ( k 1 , 0 , T ) = i θ ^ ( k 1 , 0 , T ) / ( ν k 1 ) \widehat{\omega}(k_1,0,T)=i\widehat{\theta}(k_1,0,T)/(\nu k_1) ω ( k 1 , 0 , T ) = i θ ( k 1 , 0 , T ) / ( ν k 1 ) holds to within 0.15 percent in relative H − 2 H^{-2} H − 2 norm, in the sense that ∥ Q 0 ω ( ⋅ , T ) + ν − 1 ∂ 1 − 1 Q 0 θ ( ⋅ , T ) ∥ H − 2 \lVert Q_0\omega(\cdot,T)+\nu^{-1}\partial_1^{-1}Q_0\theta(\cdot,T)\rVert_{H^{-2}} ∥ Q 0 ω ( ⋅ , T ) + ν − 1 ∂ 1 − 1 Q 0 θ ( ⋅ , T ) ∥ H − 2 is at most 0.0015 ∥ Q 0 ω ( ⋅ , T ) ∥ H − 2 0.0015\lVert Q_0\omega(\cdot,T)\rVert_{H^{-2}} 0.0015 ∥ Q 0 ω ( ⋅ , T ) ∥ H − 2 , with Q 0 Q_0 Q 0 the vertical average (9) and ∂ 1 − 1 \partial_1^{-1} ∂ 1 − 1 acting on the modes with k 1 ≠ 0 k_1\ne0 k 1 = 0 . This equation is the balance ν ∂ 11 ω + ∂ 1 θ = 0 \nu\partial_{11}\omega+\partial_1\theta=0 ν ∂ 11 ω + ∂ 1 θ = 0 of (4) . The H − 2 H^{-2} H − 2 norm of ω ~ ( ⋅ , T ) \widetilde{\omega}(\cdot,T) ω ( ⋅ , T ) lies between 1.8 × 10 − 7 ε 1.8\times10^{-7}\varepsilon 1.8 × 1 0 − 7 ε and 2.0 × 10 − 7 ε 2.0\times10^{-7}\varepsilon 2.0 × 1 0 − 7 ε at every amplitude, so the oscillation is of first order and keeps R R R nearly constant for small ε \varepsilon ε . At larger ε \varepsilon ε the term δ ω ˉ \delta\bar{\omega} δ ω ˉ , of order ε 2 \varepsilon^2 ε 2 , becomes comparable, and R R R rises. The surrogate’s R N O R^{\mathrm{NO}} R NO , which contains its prediction of the oscillation, matches R R R to a median of 0.9 percent and in every sample to within 7 percent.
Comparison with Fourier neural operators trained without the analysis
To isolate the effect of the design, two further networks were trained that differ from the surrogate only in what the analysis decides. They use the same 10 4 10^4 1 0 4 training runs, the same Fourier neural operator with four layers, 64 channels and the same retained modes, and the same optimizer, batch size, learning-rate schedule, number of epochs and seed. Each predicts ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) whole, with one output channel and the loss
L b a s e = 1 B ∑ i = 1 B ∥ ω i N O ( ⋅ , T ) − ω i ( ⋅ , T ) ∥ L 2 ∥ ω i ( ⋅ , T ) ∥ L 2 , (30) \mathcal{L}_{\mathrm{base}}=\frac{1}{B}\sum_{i=1}^{B}\frac{\lVert\omega_i^{\mathrm{NO}}(\cdot,T)-\omega_i(\cdot,T)\rVert_{L^2}}{\lVert\omega_i(\cdot,T)\rVert_{L^2}}, \tag*{(30)} L base = B 1 i = 1 ∑ B ∥ ω i ( ⋅ , T ) ∥ L 2 ∥ ω i NO ( ⋅ , T ) − ω i ( ⋅ , T ) ∥ L 2 , (30)
the relative L 2 L^2 L 2 error commonly used for Fourier neural operators [17 ] . Neither network adds ω ˉ 0 \bar{\omega}_0 ω ˉ 0 exactly, splits the output into δ ω ˉ \delta\bar{\omega} δ ω ˉ and the oscillation, or scales the two parts. In the first network, called plain, the inputs are ω 0 \omega_0 ω 0 and θ 0 \theta_0 θ 0 , standardized per channel, and the output is ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) , standardized by its training mean and standard deviation, so the amplitude enters only through the size of the fields. The second network, called scaled, receives the same inputs as the surrogate, ω 0 / ε \omega_0/\varepsilon ω 0 / ε , θ 0 / ε \theta_0/\varepsilon θ 0 / ε and log ( ε / 0.1 ) \log(\varepsilon/0.1) log ( ε /0.1 ) , and predicts ω ( ⋅ , T ) / ε \omega(\cdot,T)/\varepsilon ω ( ⋅ , T ) / ε . It isolates the effect of the decomposition and of the separate scaling of the two parts.
Table 2 shows the result. Both networks fit the training fields closely, to a relative L 2 L^2 L 2 error below 10 − 3 10^{-3} 1 0 − 3 , and reproduce the field of the test runs to about 3 percent. Their median error in δ ω ˉ \delta\bar{\omega} δ ω ˉ , however, is 30 to 37 times the size of δ ω ˉ \delta\bar{\omega} δ ω ˉ itself, so the change of the average that they predict is determined by their error in the field and not by the flow. The values of R ˉ \bar{R} R ˉ they produce are, on average over each amplitude, 6 to 180 times too large, most at the smallest amplitudes, and the predicted change of the average grows as ε 0.95 \varepsilon^{0.95} ε 0.95 to ε 0.98 \varepsilon^{0.98} ε 0.98 for the scaled network and ε 1.17 \varepsilon^{1.17} ε 1.17 to ε 1.18 \varepsilon^{1.18} ε 1.18 for the plain one, against the second-order growth of Theorem 3.1(b), which the solver confirms with the exponent 2.00 and the surrogate reproduces. The field itself is also predicted far less accurately, because the surrogate adds ω ˉ 0 \bar{\omega}_0 ω ˉ 0 , which makes up most of ω ( ⋅ , T ) \omega(\cdot,T) ω ( ⋅ , T ) , exactly.
Table 2. The surrogate and two Fourier neural operators trained on the same data with the loss (4.13), on the 10 3 10^3 1 0 3 runs of each test set. The growth exponent is the least-squares slope of the logarithm of the mean of ∥ δ ω ˉ ∥ H − 2 \lVert\delta\bar{\omega}\rVert_{H^{-2}} ∥ δ ω ˉ ∥ H − 2 over each amplitude against log ϵ \log\epsilon log ϵ . All values were computed on an NVIDIA V100S, the GPU used for training.
Surrogate investigation of a lower bound for the constant of Theorem 3.1(b)
Theorem 3.1(b) bounds R ˉ \bar{R} R ˉ by a constant C C C that depends only on ν \nu ν , but gives no value for C C C , and the 2 × 10 3 2\times10^3 2 × 1 0 3 solver runs of § 4.6 only show that C ≥ 4.24 × 10 − 6 C\ge4.24\times10^{-6} C ≥ 4.24 × 1 0 − 6 . The surrogate evaluates R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO in about 1 ms per sample on one GPU, against 10.2 s per simulation for the solver. It is also differentiable: the gradient of R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO with respect to the initial fields ( ω 0 , θ 0 ) (\omega_0,\theta_0) ( ω 0 , θ 0 ) is obtained by automatic differentiation at the cost of about one further evaluation, whereas the solver would need an adjoint computation backward in time from T T T to 0. We use the speed to screen many initial fields and the gradient to start an ascent from the screened fields with the largest R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO , in search of initial fields with a larger R ˉ \bar{R} R ˉ . The search is carried out separately at each of the five interpolation amplitudes, and the amplitude is held fixed. Only the shape of the fields changes, and their norms stay ∥ u 0 ∥ H 2 = ∥ θ 0 ∥ H 2 = ϵ / 2 \lVert u_0\rVert_{H^2}=\lVert\theta_0\rVert_{H^2}=\epsilon/2 ∥ u 0 ∥ H 2 = ∥ θ 0 ∥ H 2 = ϵ /2 . Since R ˉ \bar{R} R ˉ is divided by ϵ 2 \epsilon^2 ϵ 2 and Theorem 3.1(b) bounds it by the same constant at every amplitude, the values found at the different amplitudes are compared with one another. Every value of R ˉ \bar{R} R ˉ reported in this subsection is recomputed with the spectral solver.
First, the surrogate evaluated R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO for 10 6 10^6 1 0 6 new samples of the family of § 4.2 at each of the five interpolation amplitudes, 5 × 10 6 5\times10^6 5 × 1 0 6 samples in all, in 83 minutes of GPU time. The solver would need about 1.6 years for the same task. At each amplitude, the average of R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO over the 10 6 10^6 1 0 6 samples lies between 1.36 × 10 − 6 1.36\times10^{-6} 1.36 × 1 0 − 6 and 1.44 × 10 − 6 1.44\times10^{-6} 1.44 × 1 0 − 6 , close to the averages of the solver’s R ˉ \bar{R} R ˉ in Table 1 . However, at each amplitude a few hundred of the 10 6 10^6 1 0 6 samples have R ˉ N O > 4.25 × 10 − 6 \bar{R}^{\mathrm{NO}}>4.25\times10^{-6} R ˉ NO > 4.25 × 1 0 − 6 , a value that no test sample reaches. The largest value of R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO over all 5 × 10 6 5\times10^6 5 × 1 0 6 samples is 7.34 × 10 − 6 7.34\times10^{-6} 7.34 × 1 0 − 6 . The solver, run on the 16 samples with the largest R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO at each amplitude, gives R ˉ > 4.25 × 10 − 6 \bar{R}>4.25\times10^{-6} R ˉ > 4.25 × 1 0 − 6 for all 80 of them. The largest value, R ˉ = 8.32 × 10 − 6 \bar{R}=8.32\times10^{-6} R ˉ = 8.32 × 1 0 − 6 , comes from the same sample that gives the largest R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO .
Second, starting from the 8 samples with the largest R ˉ N O \bar{R}^{\mathrm{NO}} R ˉ NO at each amplitude, 40 starting samples in all, each kept at its own amplitude, we maximized log R ˉ N O \log\bar{R}^{\mathrm{NO}} log R ˉ NO by gradient ascent with the Adam method, step size 0.02 and 2000 steps. The variables are the complex Gaussian coefficients ξ k ω \xi_k^\omega ξ k ω and ξ k θ \xi_k^\theta ξ k θ , whose real and imaginary parts are independent standard normal variables at the start, that define the initial data through
ω ^ 0 ( k ) = c ω ( τ 2 + ∣ k ∣ 2 ) − α ω / 2 ξ k ω , θ ^ 0 ( k ) = c θ ( τ 2 + ∣ k ∣ 2 ) − α θ / 2 ξ k θ \widehat{\omega}_0(k)=c_\omega\left(\tau^2+|k|^2\right)^{-\alpha_\omega/2}\xi_k^\omega,\qquad\widehat{\theta}_0(k)=c_\theta\left(\tau^2+|k|^2\right)^{-\alpha_\theta/2}\xi_k^\theta ω 0 ( k ) = c ω ( τ 2 + ∣ k ∣ 2 ) − α ω /2 ξ k ω , θ 0 ( k ) = c θ ( τ 2 + ∣ k ∣ 2 ) − α θ /2 ξ k θ
with α ω = 2.5 \alpha_\omega=2.5 α ω = 2.5 , α θ = 3.5 \alpha_\theta=3.5 α θ = 3.5 and τ = 7 \tau=7 τ = 7 as in § 4.2 , where the constants c ω , c θ > 0 c_\omega,c_\theta>0 c ω , c θ > 0 are recomputed after every step so that ∥ u 0 ∥ H 2 = ∥ θ 0 ∥ H 2 = ε / 2 \|u_0\|_{H^2}=\|\theta_0\|_{H^2}=\varepsilon/2 ∥ u 0 ∥ H 2 = ∥ θ 0 ∥ H 2 = ε /2 . After every step the Gaussian coefficients are also rescaled so that, for each s ≥ 1 s\geq1 s ≥ 1 , the sums of ∣ ω ^ 0 ( k ) ∣ 2 |\widehat{\omega}_0(k)|^2 ∣ ω 0 ( k ) ∣ 2 and of ∣ θ ^ 0 ( k ) ∣ 2 |\widehat{\theta}_0(k)|^2 ∣ θ 0 ( k ) ∣ 2 over the annulus s − 1 2 < ∣ k ∣ ≤ s + 1 2 s-\frac{1}{2}<|k|\leq s+\frac{1}{2} s − 2 1 < ∣ k ∣ ≤ s + 2 1 keep their initial values, up to the common factors c ω 2 c_\omega^2 c ω 2 and c θ 2 c_\theta^2 c θ 2 . Only the phases of the Fourier coefficients and the distribution of their moduli among the wavenumbers of one annulus change. This keeps the initial data in the class on which the surrogate was trained, which is meant to keep its predictions reliable along the ascent, as in model-based optimization restricted to the region where the model is trusted [33 ] . Fields with a prescribed power spectrum and modified phases are used in the same way to separate the role of the phases from that of the spectrum [32 ] .
The ascent gives 40 paths in the space of initial data, one from each starting sample. We ran the solver on the 16 paths with the largest R ‾ N O \overline{R}^{\mathrm{NO}} R NO at step 2000, at steps 0, 100, 300, 500, 1000, 1500 and 2000 of each path (Figure 5 (a)). Up to step 300 the surrogate agrees with the solver to a median relative difference of about 10 percent, and the solver’s R ‾ \overline{R} R first grows along every path, to a largest value R ‾ = 1.87 × 10 − 5 \overline{R}=1.87\times10^{-5} R = 1.87 × 1 0 − 5 at step 500, 4.4 times the largest value of the test set. Recomputed on a 256 × 256 256\times256 256 × 256 grid, or with half the time step, this largest value changes by less than 10 − 5 10^{-5} 1 0 − 5 in relative terms. Further on, the surrogate overestimates R ‾ \overline{R} R , by a median of 50 percent at step 2000, the ascent follows its errors, and the solver’s R ‾ \overline{R} R decreases. Figure 5 (b)–(Figure 5 e) shows the case with the largest difference, R ‾ N O = 1.31 × 10 − 5 \overline{R}^{\mathrm{NO}}=1.31\times10^{-5} R NO = 1.31 × 1 0 − 5 against R ‾ = 5.9 × 10 − 6 \overline{R}=5.9\times10^{-6} R = 5.9 × 1 0 − 6 .
Figure 5. Gradient ascent of the surrogate’s R ‾ N O \overline{R}^{\mathrm{NO}} R NO with the sum of ∣ ω ^ 0 ( k ) ∣ 2 |\widehat{\omega}_0(k)|^2 ∣ ω 0 ( k ) ∣ 2 and of ∣ θ ^ 0 ( k ) ∣ 2 |\widehat{\theta}_0(k)|^2 ∣ θ 0 ( k ) ∣ 2 over each wavenumber annulus held fixed. (a) R ‾ \overline{R} R at seven steps of 16 ascent paths, from the spectral solver (circles) and the surrogate (squares), median (solid line, filled markers) and maximum (dashed line, open markers) over the paths. The crosses mark the case of (b)–(e), the largest relative difference between the surrogate and the solver. The dotted line is the largest R ‾ \overline{R} R of the 2 × 10 3 2 \times10^3 2 × 1 0 3 test samples. (b) Initial temperature θ 0 / ϵ \theta_0/\epsilon θ 0 / ϵ and (c) initial vorticity ω 0 / ϵ \omega_0/\epsilon ω 0 / ϵ of that case, at step 1500 of its path and ϵ = 0.1 \epsilon= 0.1 ϵ = 0.1 . (d), (e) Its vorticity ω ( ⋅ , T ) / ϵ \omega(\cdot,T)/\epsilon ω ( ⋅ , T ) / ϵ at T = 100 T=100 T = 100 from the solver and from the surrogate, with one color scale.
Since Theorem 3.1 (b) bounds R ‾ \overline{R} R at every time, the largest value of R ‾ \overline{R} R found over all the amplitudes tested, ε \varepsilon ε from 0.025 to 0.4, gives C ≥ 1.87 × 10 − 5 C\geq1.87\times10^{-5} C ≥ 1.87 × 1 0 − 5 for ν = η = 1 \nu=\eta=1 ν = η = 1 , provided these amplitudes lie below the threshold ε ∗ \varepsilon_* ε ∗ .
Discussion and conclusions
In this paper we designed a neural operator from a rigorous analysis of the long-time behavior of the two-dimensional anisotropic Boussinesq system on the periodic box T 2 \mathbb{T}^2 T 2 , with horizontal viscosity ν \nu ν and vertical thermal diffusivity η \eta η . The operator maps a small perturbation of hydrostatic equilibrium to the vorticity at a late time, and it captures the main features of the analysis. It reproduces, sample by sample, the H − 2 H^{-2} H − 2 norm of the change of the horizontally averaged vorticity, the quantity that the analysis bounds, with a median error of 2.2 percent and at most 12 percent over 2× 10 3 \times10^3 × 1 0 3 test runs, together with its growth as ε 2 \varepsilon^2 ε 2 , and the oscillation of the vorticity about its horizontal average, of order ε \varepsilon ε . A single network, trained on 10 4 10^4 1 0 4 solver runs at ten amplitudes spanning a factor of 23, serves all amplitudes, including five not used in training. It also gives a quantitative lower bound for the constant in the estimate, which the analysis does not provide.
The long-time analysis guides the design of the network. First, the network does not learn the final vorticity whole. Its prediction is the initial averaged vorticity ω ‾ 0 \overline{\omega}_0 ω 0 plus a learned approximation of the change ω ( ⋅ , T ) − ω ‾ 0 \omega(\cdot,T)-\overline{\omega}_0 ω ( ⋅ , T ) − ω 0 , split into the change of the horizontal average and the remaining oscillation. The loss measures the relative error of each part separately and gives the change of the average ten times the weight of the oscillation. Second, the inputs are the initial fields divided by ε \varepsilon ε , and each part of the output is divided by its size at that amplitude, of order ε 2 \varepsilon^2 ε 2 for the change of the average and ε \varepsilon ε for the oscillation. The network outputs are therefore of order one at every amplitude. Third, since the temperature decays to zero, the network predicts only the vorticity at the final time T = 100 T=100 T = 100 .
Departing from the theory leads to failure. When the final temperature was included in the training targets in a preliminary experiment, the training did not converge. When the same network is trained with the standard loss, the error of the whole final vorticity between the network and the solver, it learns the training fields well but misses the quantity bounded by the analysis by a factor of about 30 in the median, and the change of the horizontal average that it predicts grows only about linearly in ϵ \epsilon ϵ , instead of with the second-order growth that the analysis proves.
Because the network evaluates an initial datum in milliseconds, against 10.2 s for the solver, and gives the gradient of its prediction with respect to the initial data, it can search the space of initial data far more extensively than the solver. Screening 5 × 10 6 5 \times10^6 5 × 1 0 6 random initial data took 83 minutes with the network and would take about 1.6 years with the solver. A gradient ascent of its prediction, with every candidate checked with the solver, finds initial data whose change of the horizontal average is 4.4 times the largest among the 2 × 10 3 2 \times10^3 2 × 1 0 3 test runs, and gives the lower bound C ≥ 1.87 × 10 − 5 C \ge1.87 \times10^{-5} C ≥ 1.87 × 1 0 − 5 for the constant in the estimate ∥ ω ‾ ( ⋅ , t ) − ω ‾ 0 ∥ H − 2 ≤ C ϵ 2 \|\overline{\omega}(\cdot,t)-\overline{\omega}_0\|_{H^{-2}} \le C\epsilon^2 ∥ ω ( ⋅ , t ) − ω 0 ∥ H − 2 ≤ C ϵ 2 .
The approach extends to other equations for which an analysis identifies a nearly conserved quantity and gives the order in the amplitude of each part of the solution. Such knowledge lets a neural operator learn a small but important quantity accurately, and the trained operator in turn estimates quantities, such as the constants in the estimates, that the analysis does not provide.
Acknowledgments. J. Wu was partially supported by the National Science Foundation (NSF) under grants DMS-2104682 and DMS-2309748. X. Zheng was partially supported by the NSF under grant DMS-2309747. This work was supported in part by computational resources and services provided by the High Performance Computing Center (HPCC) of the Institute for Cyber-Enabled Research at Michigan State University.
We record here the global stability estimate on T 2 \mathbb{T}^{2} T 2 . It is Theorem 1.1 of [7 ] , which uses the norms (3.2) and the smallness condition ( ∥ u 0 ∥ H 2 2 + ∥ θ 0 ∥ H 2 2 ) 1 / 2 ≤ ε (\|u_{0}\|_{H^{2}}^{2}+\|\theta_{0}\|_{H^{2}}^{2})^{1/2}\leq\varepsilon ( ∥ u 0 ∥ H 2 2 + ∥ θ 0 ∥ H 2 2 ) 1/2 ≤ ε , implied by (3.1).
Theorem A.1 (Uniform H 2 H^{2} H 2 stability on T 2 \mathbb{T}^{2} T 2 , [7 ] ). There is ε ∗ = ε ∗ ( ν , η ) > 0 \varepsilon_{*}=\varepsilon_{*}(\nu,\eta)>0 ε ∗ = ε ∗ ( ν , η ) > 0 with the following property. Let 0 < ε ≤ ε ∗ 0<\varepsilon\leq\varepsilon_{*} 0 < ε ≤ ε ∗ and let the initial data ( u 0 , θ 0 ) ∈ H 2 ( T 2 ) (u_{0},\theta_{0})\in H^{2}(\mathbb{T}^{2}) ( u 0 , θ 0 ) ∈ H 2 ( T 2 ) be divergence free and satisfy (3.1). Then (2.1)–(2.3) possesses a global solution, unique in the class
( u , θ ) ∈ L ∞ ( 0 , ∞ ; H 2 ( T 2 ) ) ∩ ⋂ 0 ≤ s < 2 C ( [ 0 , ∞ ) ; H s ( T 2 ) ) , (31) (u,\theta)\in L^{\infty}(0,\infty;H^{2}(\mathbb{T}^{2}))\cap\bigcap_{0\leq s<2}C([0,\infty);H^{s}(\mathbb{T}^{2})), \tag*{(31)} ( u , θ ) ∈ L ∞ ( 0 , ∞ ; H 2 ( T 2 )) ∩ 0 ≤ s < 2 ⋂ C ([ 0 , ∞ ) ; H s ( T 2 )) , (31) ∂ t ( u , θ ) ∈ L ∞ ( 0 , ∞ ; L 2 ( T 2 ) ) , \partial_{t}(u,\theta)\in L^{\infty}(0,\infty;L^{2}(\mathbb{T}^{2})), ∂ t ( u , θ ) ∈ L ∞ ( 0 , ∞ ; L 2 ( T 2 )) , and there are an absolute constant C ∗ C_{*} C ∗ and a constant C ν C_{\nu} C ν depending only on ν \nu ν such that
sup t ≥ 0 ( ∥ u ( t ) ∥ H 2 + ∥ θ ( t ) ∥ H 2 ) ≤ C ∗ ε , (32) \sup_{t\geq0}\left(\|u(t)\|_{H^{2}}+\|\theta(t)\|_{H^{2}}\right)\leq C_{*}\varepsilon, \tag*{(32)} t ≥ 0 sup ( ∥ u ( t ) ∥ H 2 + ∥ θ ( t ) ∥ H 2 ) ≤ C ∗ ε , (32) \int_{0}^{\infty}\left(\nu|\partial_{1}u|_{H^{2}}^{2}+\eta|\partial_{2}\theta|_{H^{2}}^{2}\right),d\tau\leq C_{\nu}\varepsilon^{2},
{#eq:A.3}
∫ 0 ∞ ∥ ∂ 1 Q 0 θ ∥ L 2 2 d τ ≤ C ν ε 2 . (33) \int_{0}^{\infty}\|\partial_{1}Q_{0}\theta\|_{L^{2}}^{2}\,d\tau\leq C_{\nu}\varepsilon^{2}. \tag*{(33)} ∫ 0 ∞ ∥ ∂ 1 Q 0 θ ∥ L 2 2 d τ ≤ C ν ε 2 . (33) One may take C ∗ = 8 2 C_{*}=8\sqrt{2} C ∗ = 8 2 and C ν = 64 ( 2 + ν ) / min { 1 , ν 2 } C_{\nu}=64(2+\nu)/\min\{1,\nu^{2}\} C ν = 64 ( 2 + ν ) / min { 1 , ν 2 } . The thermal diffusivity η \eta η enters only through the smallness threshold ε ∗ \varepsilon_{*} ε ∗ .
Remark A.2 (The estimate used in the proof). Theorem A.1 yields the following estimate, on which the proof of Theorem 3.1 in Appendix B draws. In addition, the proof of part (b) uses (A.3) directly, so that its constant depends on ν \nu ν only. There is C 0 = C 0 ( ν , η ) C_{0}=C_{0}(\nu,\eta) C 0 = C 0 ( ν , η ) such that
sup t ≥ 0 ( ∥ u ( t ) ∥ H 2 2 + ∥ θ ( t ) ∥ H 2 2 ) + 2 ν ∫ 0 ∞ ∥ ∂ 1 u ∥ H 2 2 d τ + 2 η ∫ 0 ∞ ∥ ∂ 2 θ ∥ H 2 2 d τ + ∫ 0 ∞ ∥ ∂ 1 θ ∥ L 2 2 d τ ≤ C 0 ε 2 . (34) \sup_{t\geq0}\left(\|u(t)\|_{H^{2}}^{2}+\|\theta(t)\|_{H^{2}}^{2}\right)+2\nu\int_{0}^{\infty}\|\partial_{1}u\|_{H^{2}}^{2}\,d\tau+2\eta\int_{0}^{\infty}\|\partial_{2}\theta\|_{H^{2}}^{2}\,d\tau+\int_{0}^{\infty}\|\partial_{1}\theta\|_{L^{2}}^{2}\,d\tau\leq C_{0}\varepsilon^{2}. \tag*{(34)} t ≥ 0 sup ( ∥ u ( t ) ∥ H 2 2 + ∥ θ ( t ) ∥ H 2 2 ) + 2 ν ∫ 0 ∞ ∥ ∂ 1 u ∥ H 2 2 d τ + 2 η ∫ 0 ∞ ∥ ∂ 2 θ ∥ H 2 2 d τ + ∫ 0 ∞ ∥ ∂ 1 θ ∥ L 2 2 d τ ≤ C 0 ε 2 . (34)
The first three terms are (A.2) and (A.3). Only the last one requires a proof. Decompose ∂ 1 θ = ∂ 1 Q 0 θ + ∂ 1 θ ⊥ \partial_{1}\theta=\partial_{1}Q_{0}\theta+\partial_{1}\theta^{\perp} ∂ 1 θ = ∂ 1 Q 0 θ + ∂ 1 θ ⊥ , which is orthogonal in L 2 ( T 2 ) L^{2}(\mathbb{T}^{2}) L 2 ( T 2 ) by Lemma 2.1(g). For every x 1 x_{1} x 1 the function x 2 ↦ ∂ 1 θ ⊥ ( x 1 , x 2 ) x_{2}\mapsto\partial_{1}\theta^{\perp}(x_{1},x_{2}) x 2 ↦ ∂ 1 θ ⊥ ( x 1 , x 2 ) has zero mean on [ 0 , 2 π ] [0,2\pi] [ 0 , 2 π ] , so the vertical Poincaré inequality (2.11) applies and gives, using ∂ 2 Q 0 θ = 0 \partial_{2}Q_{0}\theta=0 ∂ 2 Q 0 θ = 0 ,
∥ ∂ 1 θ ⊥ ∥ L 2 ≤ ∥ ∂ 2 ∂ 1 θ ⊥ ∥ L 2 = ∥ ∂ 1 ∂ 2 θ ∥ L 2 ≤ ∥ ∂ 2 θ ∥ H 1 . \|\partial_{1}\theta^{\perp}\|_{L^{2}}\leq\|\partial_{2}\partial_{1}\theta^{\perp}\|_{L^{2}}=\|\partial_{1}\partial_{2}\theta\|_{L^{2}}\leq\|\partial_{2}\theta\|_{H^{1}}. ∥ ∂ 1 θ ⊥ ∥ L 2 ≤ ∥ ∂ 2 ∂ 1 θ ⊥ ∥ L 2 = ∥ ∂ 1 ∂ 2 θ ∥ L 2 ≤ ∥ ∂ 2 θ ∥ H 1 .
Therefore ∫ 0 ∞ ∥ ∂ 1 θ ⊥ ∥ L 2 2 d τ ≤ η − 1 ∫ 0 ∞ η ∥ ∂ 2 θ ∥ H 2 2 d τ ≤ η − 1 C ν ε 2 \int_{0}^{\infty}\|\partial_{1}\theta^{\perp}\|_{L^{2}}^{2}\,d\tau\leq\eta^{-1}\int_{0}^{\infty}\eta\|\partial_{2}\theta\|_{H^{2}}^{2}\,d\tau\leq\eta^{-1}C_{\nu}\varepsilon^{2} ∫ 0 ∞ ∥ ∂ 1 θ ⊥ ∥ L 2 2 d τ ≤ η − 1 ∫ 0 ∞ η ∥ ∂ 2 θ ∥ H 2 2 d τ ≤ η − 1 C ν ε 2 , and adding (A.4) bounds the last term of (A.5). Collecting the four contributions, one may take C 0 = C ∗ 2 + ( 3 + η − 1 ) C ν C_{0}=C_{*}^{2}+(3+\eta^{-1})C_{\nu} C 0 = C ∗ 2 + ( 3 + η − 1 ) C ν , which depends on ν \nu ν and η \eta η only.
Appendix B. Proof of Theorem 3.1.
We first record Barbalat’s lemma [3 , 11 ] , which turns the finite dissipation integrals of (A.5) into convergence to zero.
Lemma B.1 (Barbalat). Let g : [ 0 , ∞ ) → [ 0 , ∞ ) g:[0,\infty)\to[0,\infty) g : [ 0 , ∞ ) → [ 0 , ∞ ) satisfy ∫ 0 ∞ g ( τ ) d τ < ∞ \int_{0}^{\infty}g(\tau)\,d\tau<\infty ∫ 0 ∞ g ( τ ) d τ < ∞ and be uniformly continuous, for instance Lipschitz. Then g ( t ) → 0 g(t)\to0 g ( t ) → 0 as t → ∞ t\to\infty t → ∞ .
Proof of part (a)
Proof of Theorem 3.1(a). Global existence, uniqueness and the bound (A.5) are furnished by Theorem A.1 and Remark A.2 of Appendix A. We repeatedly use that, by (A.5), sup t ≥ 0 ( ∥ u ( t ) ∥ H 2 + ∥ θ ( t ) ∥ H 2 ) ≤ C ε \sup_{t\ge0}(\|u(t)\|_{H^2}+\|\theta(t)\|_{H^2})\le C\varepsilon sup t ≥ 0 ( ∥ u ( t ) ∥ H 2 + ∥ θ ( t ) ∥ H 2 ) ≤ C ε . Throughout the proof of part (a), C C C denotes a constant that may depend on the viscosity ν \nu ν and the diffusivity η \eta η but on nothing else, and that may change from one occurrence to the next. In the proof of part (b) the dependence of the constant is tracked explicitly.
Write v v v for either u u u or θ \theta θ , and let D D D denote a first-order spatial derivative, so that D ∈ { ∂ 1 , ∂ 2 } D\in\{\partial_1,\partial_2\} D ∈ { ∂ 1 , ∂ 2 } . By (A.1) the solution supplied by Theorem A.1 has ∂ t v \partial_t v ∂ t v only in L 2 L^2 L 2 , hence ∂ t D v = D ∂ t v \partial_t Dv=D\partial_t v ∂ t D v = D ∂ t v is only known to lie in H − 1 H^{-1} H − 1 , and the chain rule d d t ∥ D v ∥ L 2 2 = 2 ( ∂ t D v , D v ) L 2 \frac{d}{dt}\|Dv\|_{L^2}^2=2(\partial_t Dv,Dv)_{L^2} d t d ∥ D v ∥ L 2 2 = 2 ( ∂ t D v , D v ) L 2 has no meaning as an L 2 L^2 L 2 inner product. It is supplied instead by the following standard fact [31 Ch. III, Lemma 1.2] , in which the pairing is the duality between H − 1 H^{-1} H − 1 and H 1 H^1 H 1 . If w ∈ L l o c 2 ( [ 0 , ∞ ) ; H 1 ( T 2 ) ) w\in L^2_{\mathrm{loc}}([0,\infty);H^1(\mathbb{T}^2)) w ∈ L loc 2 ([ 0 , ∞ ) ; H 1 ( T 2 )) and ∂ t w ∈ L l o c 2 ( [ 0 , ∞ ) ; H − 1 ( T 2 ) ) \partial_t w\in L^2_{\mathrm{loc}}([0,\infty);H^{-1}(\mathbb{T}^2)) ∂ t w ∈ L loc 2 ([ 0 , ∞ ) ; H − 1 ( T 2 )) , then t ↦ ∥ w ( t ) ∥ L 2 2 t\mapsto\|w(t)\|_{L^2}^2 t ↦ ∥ w ( t ) ∥ L 2 2 is absolutely continuous and
d d t ∥ w ∥ L 2 2 = 2 ⟨ ∂ t w , w ⟩ H − 1 , H 1 (35) \frac{d}{dt}\|w\|_{L^2}^2=2\langle\partial_t w,w\rangle_{H^{-1},H^1} \tag*{(35)} d t d ∥ w ∥ L 2 2 = 2 ⟨ ∂ t w , w ⟩ H − 1 , H 1 (35)
for almost every t t t .
Every function g g g to which Lemma B.1 is applied below is of the form g = ∥ w ∥ L 2 2 g=\|w\|_{L^2}^2 g = ∥ w ∥ L 2 2 with w = D v w=Dv w = D v . By (A.1), w ∈ L ∞ ( 0 , ∞ ; H 1 ) w\in L^\infty(0,\infty;H^1) w ∈ L ∞ ( 0 , ∞ ; H 1 ) and ∂ t w = D ∂ t v ∈ L ∞ ( 0 , ∞ ; H − 1 ) \partial_t w=D\partial_t v\in L^\infty(0,\infty;H^{-1}) ∂ t w = D ∂ t v ∈ L ∞ ( 0 , ∞ ; H − 1 ) , so (B.1) applies and, moving D D D onto the second factor, ∣ d g / d t ∣ = 2 ∣ ∫ T 2 ∂ t v ⋅ D 2 v d x ∣ ≤ 2 ∥ ∂ t v ∥ L 2 ∥ D 2 v ∥ L 2 |dg/dt|=2\left|\int_{\mathbb{T}^2}\partial_t v\cdot D^2v\,dx\right|\le2\|\partial_t v\|_{L^2}\|D^2v\|_{L^2} ∣ d g / d t ∣ = 2 ∫ T 2 ∂ t v ⋅ D 2 v d x ≤ 2∥ ∂ t v ∥ L 2 ∥ D 2 v ∥ L 2 , which is bounded by (A.1) and (A.5). Hence each such g g g is Lipschitz on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) .
Step 1: Preservation of the zero means. Write m θ = ∫ T 2 θ m_\theta=\int_{\mathbb{T}^2}\theta m θ = ∫ T 2 θ and m u = ∫ T 2 u 2 m_u=\int_{\mathbb{T}^2}u_2 m u = ∫ T 2 u 2 . Both are Lipschitz on [ 0 , ∞ ) [0,\infty) [ 0 , ∞ ) , because ∂ t ( u , θ ) ∈ L ∞ ( 0 , ∞ ; L 2 ) \partial_t(u,\theta)\in L^\infty(0,\infty;L^2) ∂ t ( u , θ ) ∈ L ∞ ( 0 , ∞ ; L 2 ) by (A.1) and T 2 \mathbb{T}^2 T 2 has finite measure, and by the identities of § 3.1 they satisfy m θ ′ = − m u m_\theta'=-m_u m θ ′ = − m u and m u ′ = m θ m_u'=m_\theta m u ′ = m θ for almost every t t t . Hence m θ 2 + m u 2 m_\theta^2+m_u^2 m θ 2 + m u 2 is absolutely continuous with ( m θ 2 + m u 2 ) ′ = − 2 m θ m u + 2 m u m θ = 0 (m_\theta^2+m_u^2)'=-2m_\theta m_u+2m_u m_\theta=0 ( m θ 2 + m u 2 ) ′ = − 2 m θ m u + 2 m u m θ = 0 almost everywhere, so it is constant. It vanishes at t = 0 t=0 t = 0 , and therefore m θ ≡ m u ≡ 0 m_\theta\equiv m_u\equiv0 m θ ≡ m u ≡ 0 . Since u u u is divergence-free and ∫ T 2 u 2 = 0 \int_{\mathbb{T}^2}u_2=0 ∫ T 2 u 2 = 0 , Lemma 2.1(d) gives u ˉ 2 ≡ 0 \bar{u}_2\equiv0 u ˉ 2 ≡ 0 and u 2 = u ~ 2 u_2=\widetilde{u}_2 u 2 = u 2 .
Step 2: Decay of the oscillatory part and of u 2 u_2 u 2 . We first show ∥ u ~ ( t ) ∥ H 1 → 0 \|\widetilde{u}(t)\|_{H^1}\to0 ∥ u ( t ) ∥ H 1 → 0 . Set g 1 ( t ) = ∥ ∂ 1 u ( t ) ∥ L 2 2 g_1(t)=\|\partial_1u(t)\|_{L^2}^2 g 1 ( t ) = ∥ ∂ 1 u ( t ) ∥ L 2 2 . By (A.5), ∫ 0 ∞ g 1 d τ ≤ ∫ 0 ∞ ∥ ∂ 1 u ∥ H 2 2 d τ < ∞ \int_0^\infty g_1\,d\tau\le\int_0^\infty\|\partial_1u\|_{H^2}^2\,d\tau<\infty ∫ 0 ∞ g 1 d τ ≤ ∫ 0 ∞ ∥ ∂ 1 u ∥ H 2 2 d τ < ∞ , and g 1 g_1 g 1 is Lipschitz, as shown above. Lemma B.1 gives g 1 ( t ) → 0 g_1(t)\to0 g 1 ( t ) → 0 , that is, ∥ ∂ 1 u ( t ) ∥ L 2 → 0 \|\partial_1u(t)\|_{L^2}\to0 ∥ ∂ 1 u ( t ) ∥ L 2 → 0 . By the horizontal Poincaré inequality (2.10) (Lemma 2.1(e)), ∥ u ~ ∥ L 2 ≤ ∥ ∂ 1 u ∥ L 2 → 0 \|\widetilde{u}\|_{L^2}\le\|\partial_1u\|_{L^2}\to0 ∥ u ∥ L 2 ≤ ∥ ∂ 1 u ∥ L 2 → 0 , and interpolation with the uniform bound yields
∥ u ~ ( t ) ∥ H 1 ≤ C ∥ u ~ ∥ L 2 1 / 2 ∥ u ~ ∥ H 2 1 / 2 ≤ C ε 1 / 2 ∥ u ~ ∥ L 2 1 / 2 → 0. \|\widetilde{u}(t)\|_{H^1}\le C\|\widetilde{u}\|_{L^2}^{1/2}\|\widetilde{u}\|_{H^2}^{1/2}\le C\varepsilon^{1/2}\|\widetilde{u}\|_{L^2}^{1/2}\to0. ∥ u ( t ) ∥ H 1 ≤ C ∥ u ∥ L 2 1/2 ∥ u ∥ H 2 1/2 ≤ C ε 1/2 ∥ u ∥ L 2 1/2 → 0.
Since u 2 = u ~ 2 u_2=\widetilde{u}_2 u 2 = u 2 by Step 1, ∥ u 2 ( t ) ∥ H 1 ≤ ∥ u ~ ( t ) ∥ H 1 → 0 \|u_2(t)\|_{H^1}\le\|\widetilde{u}(t)\|_{H^1}\to0 ∥ u 2 ( t ) ∥ H 1 ≤ ∥ u ( t ) ∥ H 1 → 0 .
Step 3: Decay of the temperature. Applying Lemma B.1 to the Lipschitz functions g 2 ( t ) = ∥ ∂ 1 θ ∥ L 2 2 g_2(t)=\|\partial_1\theta\|_{L^2}^2 g 2 ( t ) = ∥ ∂ 1 θ ∥ L 2 2 and g 3 ( t ) = ∥ ∂ 2 θ ∥ L 2 2 g_3(t)=\|\partial_2\theta\|_{L^2}^2 g 3 ( t ) = ∥ ∂ 2 θ ∥ L 2 2 , whose time integrals are finite by (A.5), gives ∥ ∂ 1 θ ( t ) ∥ L 2 → 0 \|\partial_1\theta(t)\|_{L^2}\to0 ∥ ∂ 1 θ ( t ) ∥ L 2 → 0 and ∥ ∂ 2 θ ( t ) ∥ L 2 → 0 \|\partial_2\theta(t)\|_{L^2}\to0 ∥ ∂ 2 θ ( t ) ∥ L 2 → 0 . By Step 1, ∫ T 2 θ ( t ) = 0 \int_{\mathbb{T}^2}\theta(t)=0 ∫ T 2 θ ( t ) = 0 , so the Fourier coefficient of θ ( t ) \theta(t) θ ( t ) at k = 0 k=0 k = 0 vanishes, and since ∣ k ∣ ≥ 1 |k|\ge1 ∣ k ∣ ≥ 1 for every other wavenumber, the Poincaré inequality on T 2 \mathbb{T}^2 T 2 gives
∥ θ ( t ) ∥ L 2 ≤ ∥ ∇ θ ( t ) ∥ L 2 → 0 , \|\theta(t)\|_{L^2}\le\|\nabla\theta(t)\|_{L^2}\to0, ∥ θ ( t ) ∥ L 2 ≤ ∥∇ θ ( t ) ∥ L 2 → 0 ,
hence ∥ θ ( t ) ∥ H 1 → 0 \|\theta(t)\|_{H^1}\to0 ∥ θ ( t ) ∥ H 1 → 0 .
Step 4: Decay in H s H^s H s , s < 2 s<2 s < 2 . For 0 ≤ s ≤ 2 0\le s\le2 0 ≤ s ≤ 2 and every f ∈ H 2 ( T 2 ) f\in H^2(\mathbb{T}^2) f ∈ H 2 ( T 2 ) , Hölder's inequality applied to the Fourier sum (3.2) with the weight ( 1 + ∣ k ∣ 2 ) s = ( ( 1 + ∣ k ∣ 2 ) 2 ) s / 2 (1+|k|^2)^s=((1+|k|^2)^2)^{s/2} ( 1 + ∣ k ∣ 2 ) s = (( 1 + ∣ k ∣ 2 ) 2 ) s /2 gives ∥ f ∥ H s ≤ ∥ f ∥ L 2 1 − s / 2 ∥ f ∥ H 2 s / 2 \|f\|_{H^s} \le\|f\|_{L^2}^{1-s/2}\|f\|_{H^2}^{s/2} ∥ f ∥ H s ≤ ∥ f ∥ L 2 1 − s /2 ∥ f ∥ H 2 s /2 . By (A.5) the H 2 H^2 H 2 norms of u 2 ( t ) u_2(t) u 2 ( t ) and θ ( t ) \theta(t) θ ( t ) are bounded by C ε C\varepsilon C ε for all t t t , and by Steps 2 and 3 their L 2 L^2 L 2 norms tend to zero. Hence u 2 ( t ) → 0 u_2(t)\to0 u 2 ( t ) → 0 and θ ( t ) → 0 \theta(t)\to0 θ ( t ) → 0 in H s H^s H s for every 0 ≤ s < 2 0\le s<2 0 ≤ s < 2 , and for s < 0 s<0 s < 0 the claim follows from the case s = 0 s=0 s = 0 .
Proof of part (b)
Proof of Theorem 3.1(b). Step 1: The vorticity becomes stratified. By Step 2 of the proof of part (a), ∥ u ~ ( t ) ∥ H 1 → 0 \|\widetilde{u}(t)\|_{H^1}\to0 ∥ u ( t ) ∥ H 1 → 0 . The oscillatory part of the vorticity is ω ~ = ω − ω ‾ = ∂ 1 u ~ 2 − ∂ 2 u ~ 1 \widetilde{\omega}=\omega-\overline{\omega}=\partial_1\widetilde{u}_2-\partial_2\widetilde{u}_1 ω = ω − ω = ∂ 1 u 2 − ∂ 2 u 1 (Lemma 2.1 (b)), so ∥ ω ( t ) − ω ‾ ( ⋅ , t ) ∥ L 2 = ∥ ω ~ ( t ) ∥ L 2 ≤ C ∥ u ~ ( t ) ∥ H 1 → 0 \|\omega(t)-\overline{\omega}(\cdot,t)\|_{L^2}=\|\widetilde{\omega}(t)\|_{L^2}\le C\|\widetilde{u}(t)\|_{H^1}\to0 ∥ ω ( t ) − ω ( ⋅ , t ) ∥ L 2 = ∥ ω ( t ) ∥ L 2 ≤ C ∥ u ( t ) ∥ H 1 → 0 .
Step 2: The horizontal average converges. From (14) , for 0 ≤ t 1 ≤ t 2 0\le t_1\le t_2 0 ≤ t 1 ≤ t 2 ,
∥ ω ‾ ( ⋅ , t 2 ) − ω ‾ ( ⋅ , t 1 ) ∥ H − 2 ≤ ∫ t 1 t 2 ∥ ∂ 22 u ~ 1 u ~ 2 ∥ H − 2 d t ≤ ∫ t 1 t 2 ∥ u ~ 1 u ~ 2 ∥ L 2 d t ≤ C ∫ t 1 t 2 ∥ u ~ ( t ) ∥ H 1 2 d t . \begin{aligned}
\|\overline{\omega}(\cdot,t_2)-\overline{\omega}(\cdot,t_1)\|_{H^{-2}}
\le\int_{t_1}^{t_2}\|\partial_{22}\widetilde{u}_1\widetilde{u}_2\|_{H^{-2}}\,dt \\
&\le\int_{t_1}^{t_2}\|\widetilde{u}_1\widetilde{u}_2\|_{L^2}\,dt
\le C\int_{t_1}^{t_2}\|\widetilde{u}(t)\|_{H^1}^2\,dt .
\end{aligned} ∥ ω ( ⋅ , t 2 ) − ω ( ⋅ , t 1 ) ∥ H − 2 ≤ ∫ t 1 t 2 ∥ ∂ 22 u 1 u 2 ∥ H − 2 d t ≤ ∫ t 1 t 2 ∥ u 1 u 2 ∥ L 2 d t ≤ C ∫ t 1 t 2 ∥ u ( t ) ∥ H 1 2 d t .
where we used ∥ ∂ 22 g ∥ H − 2 ≤ ∥ g ∥ L 2 \|\partial_{22}g\|_{H^{-2}}\le\|g\|_{L^2} ∥ ∂ 22 g ∥ H − 2 ≤ ∥ g ∥ L 2 , ∥ g ~ ∥ L 2 ≤ ∥ g ∥ L 2 \|\widetilde{g}\|_{L^2}\le\|g\|_{L^2} ∥ g ∥ L 2 ≤ ∥ g ∥ L 2 (Lemma 2.1 (c)), and the Ladyzhenskaya inequality ∥ u ~ 1 u ~ 2 ∥ L 2 ≤ C ∥ u ~ ∥ H 1 2 \|\widetilde{u}_1\widetilde{u}_2\|_{L^2}\le C\|\widetilde{u}\|_{H^1}^2 ∥ u 1 u 2 ∥ L 2 ≤ C ∥ u ∥ H 1 2 . By Lemma 2.1 (e), ∥ u ~ ∥ H 1 ≤ 2 ∥ ∂ 1 u ∥ H 1 \|\widetilde{u}\|_{H^1}\le\sqrt{2}\|\partial_1u\|_{H^1} ∥ u ∥ H 1 ≤ 2 ∥ ∂ 1 u ∥ H 1 , and with (A.3) this gives
∫ 0 ∞ ∥ u ~ ∥ H 1 2 d t ≤ 2 ∫ 0 ∞ ∥ ∂ 1 u ∥ H 2 2 d t ≤ 2 ν − 1 C ν ε 2 . \int_0^\infty\|\widetilde{u}\|_{H^1}^2\,dt\le2\int_0^\infty\|\partial_1u\|_{H^2}^2\,dt\le2\nu^{-1}C_\nu\varepsilon^2. ∫ 0 ∞ ∥ u ∥ H 1 2 d t ≤ 2 ∫ 0 ∞ ∥ ∂ 1 u ∥ H 2 2 d t ≤ 2 ν − 1 C ν ε 2 .
Therefore the right-hand side of the preceding estimate tends to 0 0 0 as t 1 → ∞ t_1\to\infty t 1 → ∞ , and ω ‾ ( ⋅ , t ) \overline{\omega}(\cdot,t) ω ( ⋅ , t ) is Cauchy in H − 2 H^{-2} H − 2 and converges to some ω ‾ ∞ \overline{\omega}_\infty ω ∞ . Integrating (14) from 0 0 0 to ∞ \infty ∞ gives the representation (15) . The same estimate with t 1 = 0 t_1=0 t 1 = 0 and t 2 = t t_2=t t 2 = t gives ∥ ω ‾ ( ⋅ , t ) − ω ‾ 0 ∥ H − 2 ≤ C ε 2 \|\overline{\omega}(\cdot,t)-\overline{\omega}_0\|_{H^{-2}}\le C\varepsilon^2 ∥ ω ( ⋅ , t ) − ω 0 ∥ H − 2 ≤ C ε 2 for every t ≥ 0 t\ge0 t ≥ 0 , and with t 2 = ∞ t_2=\infty t 2 = ∞ the bound on ω ‾ ∞ − ω ‾ 0 \overline{\omega}_\infty-\overline{\omega}_0 ω ∞ − ω 0 . The Ladyzhenskaya and Poincaré constants are absolute, so the constant depends only on ν \nu ν .
Step 3: The whole field converges to the same limit. By Step 1, ω ( ⋅ , t ) − ω ‾ ( ⋅ , t ) → 0 \omega(\cdot,t)-\overline{\omega}(\cdot,t)\to0 ω ( ⋅ , t ) − ω ( ⋅ , t ) → 0 in L 2 ( T 2 ) L^2(\mathbb{T}^2) L 2 ( T 2 ) , hence in H − 2 ( T 2 ) H^{-2}(\mathbb{T}^2) H − 2 ( T 2 ) , the embedding L 2 ↪ H − 2 L^2\hookrightarrow H^{-2} L 2 ↪ H − 2 being continuous. Adding the convergence of Step 2 gives ω ( ⋅ , t ) → ω ‾ ∞ \omega(\cdot,t)\to\overline{\omega}_\infty ω ( ⋅ , t ) → ω ∞ in H − 2 H^{-2} H − 2 , and by continuity of the norm ∥ ω ( ⋅ , t ) − ω ‾ 0 ∥ H − 2 → ∥ ω ‾ ∞ − ω ‾ 0 ∥ H − 2 \|\omega(\cdot,t)-\overline{\omega}_0\|_{H^{-2}}\to\|\overline{\omega}_\infty-\overline{\omega}_0\|_{H^{-2}} ∥ ω ( ⋅ , t ) − ω 0 ∥ H − 2 → ∥ ω ∞ − ω 0 ∥ H − 2 , which Step 2 bounds by C ε 2 C\varepsilon^2 C ε 2 .
Step 4: Regularity of the limit and convergence in H s H^s H s , s < 1 s<1 s < 1 . Since ∣ ω ^ k ∣ ≤ ∣ k ∣ ∣ u ^ k ∣ |\widehat{\omega}_k|\le|k||\widehat{u}_k| ∣ ω k ∣ ≤ ∣ k ∣∣ u k ∣ and ( 1 + ∣ k ∣ 2 ) ∣ k ∣ 2 ≤ ( 1 + ∣ k ∣ 2 ) 2 (1+|k|^2)|k|^2\le(1+|k|^2)^2 ( 1 + ∣ k ∣ 2 ) ∣ k ∣ 2 ≤ ( 1 + ∣ k ∣ 2 ) 2 , (A.5) gives ∥ ω ( t ) ∥ H 1 ≤ C ε \|\omega(t)\|_{H^1}\le C\varepsilon ∥ ω ( t ) ∥ H 1 ≤ C ε for all t t t . Each Fourier coefficient of ω ( t ) \omega(t) ω ( t ) converges to that of ω ‾ ∞ \overline{\omega}_\infty ω ∞ by Step 3, so Fatou’s lemma gives ∥ ω ‾ ∞ ∥ H 1 ≤ C ε \|\overline{\omega}_\infty\|_{H^1}\le C\varepsilon ∥ ω ∞ ∥ H 1 ≤ C ε , and ω ‾ ∞ ∈ H 1 ( T 2 ) \overline{\omega}_\infty\in H^1(\mathbb{T}^2) ω ∞ ∈ H 1 ( T 2 ) . For − 2 ≤ s ≤ 1 -2\le s\le1 − 2 ≤ s ≤ 1 , Hölder’s inequality applied to the Fourier sum with ( 1 + ∣ k ∣ 2 ) s = ( ( 1 + ∣ k ∣ 2 ) − 2 ) ( 1 − s ) / 3 ( 1 + ∣ k ∣ 2 ) ( s + 2 ) / 3 (1+|k|^2)^s=((1+|k|^2)^{-2})^{(1-s)/3}(1+|k|^2)^{(s+2)/3} ( 1 + ∣ k ∣ 2 ) s = (( 1 + ∣ k ∣ 2 ) − 2 ) ( 1 − s ) /3 ( 1 + ∣ k ∣ 2 ) ( s + 2 ) /3 gives
∥ f ∥ H s ≤ ∥ f ∥ H − 2 ( 1 − s ) / 3 ∥ f ∥ H 1 ( s + 2 ) / 3 . \|f\|_{H^s}\le\|f\|_{H^{-2}}^{(1-s)/3}\|f\|_{H^1}^{(s+2)/3}. ∥ f ∥ H s ≤ ∥ f ∥ H − 2 ( 1 − s ) /3 ∥ f ∥ H 1 ( s + 2 ) /3 .
With f = ω ( t ) − ω ‾ ∞ f=\omega(t)-\overline{\omega}_\infty f = ω ( t ) − ω ∞ , which is bounded in H 1 H^1 H 1 by C ε C\varepsilon C ε and tends to zero in H − 2 H^{-2} H − 2 by Step 3, this gives ω ( ⋅ , t ) → ω ‾ ∞ \omega(\cdot,t)\to\overline{\omega}_\infty ω ( ⋅ , t ) → ω ∞ in H s H^s H s for every − 2 ≤ s < 1 -2\le s<1 − 2 ≤ s < 1 . For s < − 2 s<-2 s < − 2 the H s H^s H s norm is bounded by the H − 2 H^{-2} H − 2 norm, and the convergence follows from the case s = − 2 s=-2 s = − 2 .
Appendix C. Proof of Proposition 3.2
Proof. Throughout, k ≠ 0 k\ne0 k = 0 . The Biot–Savart law gives u ^ 2 = − i k 1 ω ^ / ∣ k ∣ 2 \widehat{u}_2=-ik_1\widehat{\omega}/|k|^2 u 2 = − i k 1 ω /∣ k ∣ 2 . Multiplying the Fourier transform of the first equation of (16) by − i k 1 / ∣ k ∣ 2 -ik_1/|k|^2 − i k 1 /∣ k ∣ 2 gives the first equation of (17) , and the second follows directly. (a) Let k 1 ≠ 0 k_1 \ne0 k 1 = 0 , k 2 ≠ 0 k_2 \ne0 k 2 = 0 and E k = ∣ u ^ 2 ∣ 2 + ( k 1 2 / ∣ k ∣ 2 ) ∣ θ ^ ∣ 2 E_k = |\hat{u}_2|^2 + (k_1^2/|\mathbf{k}|^2)|\hat{\theta}|^2 E k = ∣ u ^ 2 ∣ 2 + ( k 1 2 /∣ k ∣ 2 ) ∣ θ ^ ∣ 2 . By (17) ,
d E k d t = − 2 ν k 1 2 ∣ u ^ 2 ∣ 2 − 2 η k 2 2 k 1 2 ∣ k ∣ 2 ∣ θ ^ ∣ 2 ≤ − 2 min { ν k 1 2 , η k 2 2 } E k . \frac{dE_k}{dt} = -2\nu k_1^2|\hat{u}_2|^2 - 2\eta k_2^2\frac{k_1^2}{|\mathbf{k}|^2}|\hat{\theta}|^2 \le-2\min\{\nu k_1^2,\eta k_2^2\}E_k. d t d E k = − 2 ν k 1 2 ∣ u ^ 2 ∣ 2 − 2 η k 2 2 ∣ k ∣ 2 k 1 2 ∣ θ ^ ∣ 2 ≤ − 2 min { ν k 1 2 , η k 2 2 } E k .
Since k 1 2 ≥ 1 k_1^2 \ge1 k 1 2 ≥ 1 and k 2 2 ≥ 1 k_2^2 \ge1 k 2 2 ≥ 1 , the minimum is at least min { ν , η } \min\{\nu,\eta\} min { ν , η } , and the bound follows by Grönwall’s inequality. If k 1 = 0 k_1 = 0 k 1 = 0 and k 2 ≠ 0 k_2 \ne0 k 2 = 0 , then u ^ 2 = − i k 1 ω ^ / ∣ k ∣ 2 = 0 \hat{u}_2 = -ik_1\hat{\omega}/|\mathbf{k}|^2 = 0 u ^ 2 = − i k 1 ω ^ /∣ k ∣ 2 = 0 by the Biot–Savart law, and the second equation of (17) reduces to d θ ^ / d t = − η k 2 2 θ ^ d\hat{\theta}/dt = -\eta k_2^2\hat{\theta} d θ ^ / d t = − η k 2 2 θ ^ .
(b) For k 2 = 0 k_2 = 0 k 2 = 0 and k 1 ≠ 0 k_1 \ne0 k 1 = 0 the matrix of (17) is
( − ν k 1 2 1 − 1 0 ) , \begin{pmatrix}
-\nu k_1^2 & 1 \\
-1 & 0
\end{pmatrix}, ( − ν k 1 2 − 1 1 0 ) ,
with characteristic equation λ 2 + ν k 1 2 λ + 1 = 0 \lambda^2 + \nu k_1^2\lambda+ 1 = 0 λ 2 + ν k 1 2 λ + 1 = 0 . For ν k 1 2 > 2 \nu k_1^2 > 2 ν k 1 2 > 2 its roots λ ± = ( − ν k 1 2 ± ν 2 k 1 4 − 4 ) / 2 \lambda_\pm= (-\nu k_1^2 \pm\sqrt{\nu^2 k_1^4 - 4})/2 λ ± = ( − ν k 1 2 ± ν 2 k 1 4 − 4 ) /2 are real, distinct and negative, which gives the representation of θ ^ \hat{\theta} θ ^ . Multiplying the numerator and the denominator of λ + \lambda_+ λ + by ν k 1 2 + ν 2 k 1 4 − 4 \nu k_1^2 + \sqrt{\nu^2 k_1^4 - 4} ν k 1 2 + ν 2 k 1 4 − 4 gives the stated formula, and 0 ≤ ν 2 k 1 4 − 4 ≤ ν k 1 2 0 \le\sqrt{\nu^2 k_1^4 - 4} \le\nu k_1^2 0 ≤ ν 2 k 1 4 − 4 ≤ ν k 1 2 gives the bounds on ∣ λ + ∣ |\lambda_+| ∣ λ + ∣ and λ − ≤ − ν k 1 2 / 2 \lambda_- \le-\nu k_1^2/2 λ − ≤ − ν k 1 2 /2 . ∎