Periodically switched stability induces exponential stability of discrete-time linear switched systems in the sense of Markovian probabilities

The conjecture that periodically switched stability implies absolute asymptotic stability of random infinite products of a finite set of square matrices, has recently been disproved under the guise of the finiteness conjecture. In this paper, we show that this conjecture holds in terms of Markovian probabilities. More specifically, let S k ∈ C n × n , 1 ≤ k ≤ K , be arbitrarily given K matrices and Σ K + = { ( k j ) j = 1 + ∞ ∣ 1 ≤ k j ≤ K  for each  j ≥ 1 } , where n , K ≥ 2 . Then we study the exponential stability of the following discrete-time switched dynamics S : x j = S k j ⋯ S k 1 x 0 , j ≥ 1  and  x 0 ∈ C n where ( k j ) j = 1 + ∞ ∈ Σ K + can be an arbitrary switching sequence. probability row-vector p = ( p 1 , … , p K ) ∈ R K and an irreducible Markov transition matrix P ∈ R K × K with p P = p , we denote by μ p , P the Markovian probability on Σ K + corresponding to ( p , P ) . By using symbolic dynamics and ergodic-theoretic approaches, we show that, if S possesses the periodically switched stability then, (i) it is exponentially stable μ p , P -almost surely; (ii) the set of stable switching sequences ( k j ) j = 1 + ∞ ∈ Σ K + has the same Hausdorff dimension as Σ K + . Thus, the periodically switched stability of a discrete-time linear switched dynamics implies that the system is exponentially stable for “almost” all switching sequences.