Lyapunov certificate checking via CROWN bounds #
This module provides a small certificate-checking interface for Lyapunov stability arguments.
Design:
LyapunovCertpackages bounds on a candidate Lyapunov functionVand its derivativeV̇over a boxed region.NeuralLyapunovis an abstract interface forVandV̇(typically defined from a network).- The trusted boundary for this Lyapunov workflow is the oracle axiom
crown_oracle, quarantined inNN.MLTheory.CROWN.Lyapunov.Oracle. Downstream theorems in this file only depend on that axiom.
The bottom portion specializes to ℝ so that strict inequalities like V_lo > 0 ⟹ V(x) > 0 can be
discharged by simple order transitivity (0 < V_lo and V_lo ≤ V(x)).
V is bounded below on the certified region.
V is bounded above on the certified region.
V̇ is bounded below on the certified region.
V̇ is bounded above on the certified region.
Quantitative bounds on V and Vdot over the certified region.
Specialization to ℝ #
For proofs involving transitivity (V_lo > 0 implies V > 0), we specialize to ℝ which has the full Preorder/LinearOrder structure.
Concrete real-valued certificate format for JSON/importer-facing workflows.
- V_lo : ℝ
Lower bound for the Lyapunov candidate
V. - V_hi : ℝ
Upper bound for the Lyapunov candidate
V. - Vdot_lo : ℝ
Lower bound for the orbital derivative
Vdot. - Vdot_hi : ℝ
Upper bound for the orbital derivative
Vdot. Lower endpoint of the certified input region, componentwise.
Upper endpoint of the certified input region, componentwise.
Instances For
For ℝ: V is positive when V_lo > 0.
For ℝ: V̇ is negative when Vdot_hi < 0.
For ℝ: Main Lyapunov conditions