Reference. Categorical Lyapunov Theory II: Stability of Systems

Lyapunov’s theorem provides a foundational characterization of stable equilibrium points in dynamical systems. In this paper, we develop a framework for stability for F-coalgebras. We give two definitions for a categorical setting in which we can study the stability of a coalgebra for an endofunctor F. One is minimal and better suited for concrete settings, while the other is more intricate and provides a richer theory. We prove a Lyapunov theorem for both notions of setting for stability, and a converse Lyapunov theorem for the second.

Cite

Cite as @ames-2025-categorical (helia, typst) · \cite{ames-2025-categorical} (LaTeX)
BibTeX
bibtex · 8 lines
@misc{ames-2025-categorical,
  author = {Aaron D. Ames and Sébastien Mattenet and Joe Moeller},
  title = {Categorical Lyapunov Theory II: Stability of Systems},
  year = {2025},
  month = {5},
  eprint = {2505.22968},
  archiveprefix = {arXiv}
}
hayagriva YAML (typst)
yaml · 10 lines
ames-2025-categorical:
  type: misc
  title: 'Categorical Lyapunov Theory II: Stability of Systems'
  author:
  - Ames, Aaron D.
  - Mattenet, Sébastien
  - Moeller, Joe
  date: 2025-05
  serial-number:
    arxiv: '2505.22968'
Cited by (3)

Hybrid Systems as Coalgebras: Lyapunov Morphisms for Zeno Stability moeller-2026-hybrid

Hybrid dynamical systems exhibit a diverse array of stability phenomena, each currently addressed by separate Lyapunov-like results. We show that these results are all instances of a single theorem: a Lyapunov function is a morphism from a hybrid system into a simple stable target system 𝜎, and different stability notions such as Lyapunov stability, asymptotic stability, exponential stability, and Zeno stability correspond to different choices of 𝜎. This unification is achieved by expressing hybrid systems as coalgebras of an endofunctor ℋ︀ on a category 𝖢𝗁𝖺𝗋𝗍 that naturally blends continuous and discrete dynamics. Instantiating a general categorical Lyapunov theorem for coalgebras to this setting results in new Lypaunov-like conditions for the stability of Zeno equilibria and the existence of Zeno behavior in hybrid systems.
arXiv

Compositionality of Lyapunov functions via assume-guarantee reasoning capucci-2026-compositionality

Assume-guarantee reasoning is a technique for compositional model checking in which system specifications are checked under certain assumptions on system parameters or inputs, and provide guarantees on observations of system state. We present a categorical framework for assume-guarantee reasoning for safety problems by viewing systems as lenses, following our earlier work on the compositionality of generalized Moore machines. Generalized Moore machines include ordinary Moore machines, partially observable Markov (decision) processes, and systems of parameterized ODEs (control systems); our framework gives assume-guarantee reasoning specially adapted to each of these cases. In particular, we give a novel formulation of assume-guarantee reasoning for (local) input-to-state stability ((L)ISS) Lyapunov functions on systems of parameterized ODEs. Our framework is categorically natural and straightforwardly compositional. A flavor of generalized Moore machine is determined by a tangency: a fibration with a section. We show that symmetric monoidal loose right modules of assume-guarantee certified generalized Moore machines over symmetric monoidal double categories of certified wiring diagrams can be constructed 2-functorially from fibrations internal to the 2-category of tangencies.
DOI · arXiv

Categorical Lyapunov Theory I: Stability of Flows ames-2025-categoricalx

Lyapunov’s theorem provides a fundamental characterization of the stability of dynamical systems. This paper presents a categorical framework for Lyapunov theory, generalizing stability analysis with Lyapunov functions categorically. Core to our approach is the set of axioms underlying a setting for stability, which give the necessary ingredients for “doing Lyapunov theory” in a category of interest. With these minimal assumptions, we define the stability of equilibria, formulate Lyapunov morphisms, and demonstrate that the existence of Lyapunov morphisms is necessary and sufficient for establishing the stability of flows. To illustrate these constructions, we show how classical notions of stability, e.g., for continuous and discrete time dynamical systems, are captured by this categorical framework for Lyapunov theory. Finally, to demonstrate the extensibility of our framework, we illustrate how enriched categories, e.g., Lawvere metric spaces, yield settings for stability enabling one to “do Lyapunov theory” in enriched categories.
arXiv
Cites 10 works (1 here)
With notes (1)

Categorical Lyapunov Theory I: Stability of Flows ames-2025-categoricalx

Lyapunov’s theorem provides a fundamental characterization of the stability of dynamical systems. This paper presents a categorical framework for Lyapunov theory, generalizing stability analysis with Lyapunov functions categorically. Core to our approach is the set of axioms underlying a setting for stability, which give the necessary ingredients for “doing Lyapunov theory” in a category of interest. With these minimal assumptions, we define the stability of equilibria, formulate Lyapunov morphisms, and demonstrate that the existence of Lyapunov morphisms is necessary and sufficient for establishing the stability of flows. To illustrate these constructions, we show how classical notions of stability, e.g., for continuous and discrete time dynamical systems, are captured by this categorical framework for Lyapunov theory. Finally, to demonstrate the extensibility of our framework, we illustrate how enriched categories, e.g., Lawvere metric spaces, yield settings for stability enabling one to “do Lyapunov theory” in enriched categories.
arXiv
External (9)
ames-2025-categorical reference entries/refs/ames-2025-categorical/ames-2025-categorical.hel