Consequences of valid Lyapunov bounds #
This module derives Lyapunov inequalities from a certificate whose bounds have already been proved valid for the stated functions.
Design:
LyapunovCertpackages bounds on a candidate Lyapunov functionVand its derivativeV̇over a boxed region.NeuralLyapunovis an abstract interface forVandV̇(typically defined from a network).LyapunovCert.ValidForrecords the substantive enclosure theorem. A graph checker may prove it; an external producer cannot obtain it merely by writing numbers to JSON.
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 strict positivity and negativity, we specialize to ℝ, whose linear order
supports the required transitivity arguments.
Concrete real-valued certificate format for JSON/importer-facing workflows.
- vLower : ℝ
Lower bound for the Lyapunov candidate
V. - vUpper : ℝ
Upper bound for the Lyapunov candidate
V. - derivativeLower : ℝ
Lower bound for the orbital derivative
Vdot. - derivativeUpper : ℝ
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
Convert the importer-friendly RealCert record into the canonical LyapunovCert.
Instances For
For ℝ: V is positive when the certified lower bound is positive.
For ℝ: V̇ is negative when its certified upper bound is negative.
Positivity and decay follow from valid strict certificate margins.