The Lorenz system as a gradient-like system
Abstract: We formulate, for continuous-time dynamical systems, a sufficient condition to be a gradient-like system, i.e. that all bounded trajectories approach stationary points and therefore that periodic orbits, chaotic attractors, etc. do not exist. This condition is based upon the existence of an auxiliary function defined over the state space of the system, in a way analogous to a Lyapunov function for the stability of an equilibrium. For polynomial systems, Lyapunov functions can be found computationally by using sum-of-squares optimisation. We demonstrate this method by finding such an auxiliary function for the Lorenz system. We are able to show that the system is gradient-like for $0\leq\rho\leq12$ when $\sigma=10$ and $\beta=8/3$, significantly extending previous results. The results are rigorously validated by a novel procedure: First, an approximate numerical solution is found using finite-precision floating-point sum-of-squares optimisation. We then prove that there exists an exact solution close to this using interval arithmetic.
- D. Hilbert, Bulletin of the American Mathematical Society 8, 437 (1902).
- E. N. Lorenz, Deterministic nonperiodic flow, Journal of Atmospheric Sciences 20, 130 (1963).
- X. Chen, Lorenz equations part i: existence and nonexistence of homoclinic orbits, SIAM Journal on Mathematical Analysis 27, 1057 (1996).
- D. Angeli, M. A. Al-Radhawi, and E. D. Sontag, A robust Lyapunov criterion for nonoscillatory behaviors in biological interaction networks, IEEE Transactions on Automatic Control 67, 3305 (2021).
- P. Glendinning, Stability, instability and chaos: an introduction to the theory of nonlinear differential equations (Cambridge University Press, 1994).
- T. Bárta, R. Chill, and E. Fašangová, Every ordinary differential equation with a strict Lyapunov function is a gradient system, Monatshefte für Mathematik 166, 57 (2012).
- J. K. Hale, Stability and gradient dynamical systems., Revista matemática complutense 17, 7 (2004).
- R. Devaney, An introduction to chaotic dynamical systems (CRC press, 2018).
- C. R. Doering and J. Gibbon, On the shape and dimension of the Lorenz attractor, Dynamics and Stability of Systems 10, 255 (1995).
- D. Goluskin, Bounding averages rigorously using semidefinite programming: mean moments of the Lorenz system, Journal of Nonlinear Science 28, 621 (2018).
- J. P. Parker, D. Goluskin, and G. M. Vasil, A study of the double pendulum using polynomial optimization, Chaos: An Interdisciplinary Journal of Nonlinear Science 31 (2021).
- W. Tan, Nonlinear Control Analysis and Synthesis using Sum-of-Squares Programming, Phd thesis, University of California, Berkley (2006).
- A. Papachristodoulou and S. Prajna, On the construction of Lyapunov functions using the sum of squares decomposition, in Proceedings of the 41st IEEE Conference on Decision and Control, 2002., Vol. 3 (IEEE, 2002) pp. 3482–3487.
- K. G. Murty and S. N. Kabadi, Some NP-complete problems in quadratic and nonlinear programming, Tech. Rep. (1985).
- P. A. Parrilo, Semidefinite programming relaxations for semialgebraic problems, Mathematical programming 96, 293 (2003).
- M.-D. Choi, T. Y. Lam, and B. Reznick, Sums of squares of real polynomials, in Proceedings of Symposia in Pure mathematics, Vol. 58 (American Mathematical Society, 1995) pp. 103–126.
- MOSEK ApS, The MOSEK optimizer for C manual. Version 10.0. (2023).
- W. Tucker, The Lorenz attractor exists, Comptes Rendus de l’Académie des Sciences-Series I-Mathematics 328, 1197 (1999).
- J.-L. Figueras and R. de la Llave, Numerical computations and computer assisted proofs of periodic orbits of the Kuramoto–Sivashinsky equation, SIAM Journal on Applied Dynamical Systems 16, 834 (2017).
- D. Wilczak and P. Zgliczyński, A geometric method for infinite-dimensional chaos: Symbolic dynamics for the Kuramoto-Sivashinsky PDE on the line, Journal of Differential Equations 269, 8509 (2020).
- D. Henrion, S. Naldi, and M. Safey El Din, SPECTRA–a Maple library for solving linear matrix inequalities in exact arithmetic, Optimization Methods and Software 34, 62 (2019).
- H. Peyrl and P. A. Parrilo, Computing sum of squares decompositions with rational coefficients, Theoretical Computer Science 409, 269 (2008).
- D. Cifuentes, T. Kahle, and P. Parrilo, Sums of squares in macaulay2, Journal of Software for Algebra and Geometry 10, 17 (2020).
- C. Jansson, D. Chaykin, and C. Keil, Rigorous error bounds for the optimal value in semidefinite programming, SIAM Journal on Numerical Analysis 46, 180 (2008).
- W. Tucker, Validated numerics: a short introduction to rigorous computations (Princeton University Press, 2011).
- D. P. Sanders and L. Benet, IntervalArithmetic.jl (2014).
- D. Goluskin and G. Fantuzzi, Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming, Nonlinearity 32, 1705 (2019).
- F. Fuentes, D. Goluskin, and S. Chernyshenko, Global stability of fluid flows despite transient growth of energy, Physical Review Letters 128, 204502 (2022).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.