Submitted Paper

Inserted: 3 nov 2026
Last Updated: 3 nov 2026

Year: 2026

Abstract:

In this paper, we prove that explicit and implicit Euler discretizations yield monotone brackets for the lower Lyapunov exponent of positive switched systems. We establish convergence of the implicit bound for every Metzler family. For the explicit bound, we derive convergence criteria in reducible systems from a face formula for the uniform lower exponent on an invariant cone. The formula takes the minimum of the rates on faces that meet the cone nontrivially and are preserved by at least one mode, using only their preserving modes. For individually irreducible modes, we prove O(h) discretization errors, where h is the step size, and show that this order is sharp in general. At interior two-mode chattering optima with an irreducible optimal mixture, we obtain one-sided first-order bounds. We also construct a three-mode example in which the explicit bound converges while finite polytope lower bounds remain capped strictly below the true exponent. We prove convergence of fixed-antinorm Gripenberg brackets under individual irreducibility as the step and tolerance decrease and the search depth increases appropriately. Finally, we obtain independently verified continuous-time brackets by exact rational checks, with lower bounds that remain valid at smaller steps.