“…For any ∈ J , introduce (similarly to (15-H)) ( ( )) * = max ∈C max (A ( )), C * = { * ∈ C | max (A * ( )) = ( ( )) * } and notice that there exists * ∈ C * such that matrix A * ( ) is irreducible (since all A ( ), ∈ C are essentially positive and, inherently, irreducible). Hence, for any ∈ J , we apply case 1 However the proof of Theorem 4 together with Lemma 1 in [22] also allows addressing quantitative aspects, in the sense that there exist pairs (k, ), with k ≫ 0, satisfying inequalities (10-S), with ≥ ( ) * as close to ( ) * as we want, and, respectively, inequalities (10-H), with ≥ ( ) * as close to ( ) * as we want. Equivalently, this means that ( ) * and ( ) * , respectively, represent the best (fastest) contraction rate for all the invariant sets defined by inequality (8-S) and (8-H), respectively, with = 1.…”