SearcharxivSearch

arXiv · 2106.13748

Chaos in stochastic 2d Galerkin-Navier-Stokes

Abstract

We prove that all Galerkin truncations of the 2d stochastic Navier-Stokes equations in vorticity form on any rectangular torus subjected to hypoelliptic, additive stochastic forcing are chaotic at sufficiently small viscosity, provided the frequency truncation satisfies $N\geq 392$. By "chaotic" we mean having a strictly positive Lyapunov exponent, i.e. almost-sure asymptotic exponential growth of the derivative with respect to generic initial conditions. A sufficient condition for such results was derived in previous joint work with Alex Blumenthal which reduces the question to the non-degeneracy of a matrix Lie algebra implying H\"ormander's condition for the Markov process lifted to the sphere bundle (projective hypoellipticity). The purpose of this work is to reformulate this condition to be more amenable for Galerkin truncations of PDEs and then to verify this condition using a) a reduction to genericity properties of a diagonal sub-algebra inspired by the root space decomposition of semi-simple Lie algebras and b) computational algebraic geometry executed by Maple in exact rational arithmetic. Note that even though we use a computer assisted proof, the result is valid for all aspect ratios and all sufficiently high dimensional truncations; in fact, certain steps simplify in the formal infinite dimensional limit.

Explore related subjects

Keep this discovery

BibTeXRIS

Jacob Bedrossian, Sam Punshon-Smith. 2021-06-25. Chaos in stochastic 2d Galerkin-Navier-Stokes. https://arxiv.org/abs/2106.13748

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR