OpenAlex ·
Lyapunov stability of polynomial vector fields is undecidable
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.22058
- Original
- Read it at the publisher
- Topics
Abstract
We show that there are integers $N$ and odd $D$ such that no algorithm can decide, from the rational coefficients of a homogeneous polynomial vector field $F$ in dimension $N$ of degree $D$, whether the origin is Lyapunov stable for $\dot Y=F(Y)$. This proves a conjecture of V. I. Arnold. We provide a Lean formalization of the proof. The smallest dimension $N$ for which we were able to prove undecidability is $N = 5$. An analogous undecidability result holds for global asymptotic stability and global exponential stability for non-homogenous vector fields. For dimension $N=2$ and homogenous vector fields, we establish decidability for all commonly used stability notions, building heavily on existing results.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Systems & Control
On the atomic decomposition of complete intersection in flag varieties
A polynomial formula for the Albanese map of the Cartwright-Steger surface
Irrationality of the first stabilization of a complex smooth cubic threefold
Deformations of toric pairs and the smoothing of Batyrev Calabi-Yau threefolds
Real quadratic fields and finite quantum dilogarithms I
Get the few papers worth your time in Systems & Control every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.