However, in [3, Lemma 3.3] it has been shown that if [PHI] is a set of generators of [B.sub.[omega]], then all but a finite number of the rows of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] vanish; hence, we may identify it with a finite matrix
. Indeed, consider separately the two cases w//?
The system in (7) is stochastically stable if for every finite matrix
[X.sub.0] = X(0),initial mode [[tau].sup.sc.sub.0] = [[tau].sup.sc](0) [member of] [phi], and [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], there exists a finite matrix
W > 0 such that the following holds: