Let $A_0, \dots, A_{n-1}$ be upper triangular matrices with ones on the diagonal. Let $B_{n-1}, \dots, B_0$ be of the same form.

I am interested in bounding
$$|| A_0 \dots A_{n-1} B_{n-1}^{-1} \dots B_0^{-1}||$$
and in particular showing that this product is close to the identity when $A_i$ and $B_i$ are close (specifically, $||A_i - B_i|| \leq \delta \lambda^{- \min(i, n-i)}$ where $\lambda>1$).

In general, this will probably not be possible, but there may be conditions when there are interesting bounds.

The problem is, I don't really know anything about techniques for bounding products of matrices. There is the obvious multiplicativity of the matrix (i.e., operator) norm, but it is far from best possible in this case. For instance, it is easy to check that the norm can grow at most polynomially in $n$ if the norms of the $A_i, B_i$ are bounded above by some constant.

Hence:

**Question:** What techniques/tricks are there for bounding these kinds of products of matrices?

Unfortunately I don't know exactly which techniques would be useful, so I'd appreciate any pointers to relevant papers or books.

I can at least explain how the problem is motivated. Namely, we have a Holder-continuous matrix-valued function $A: X \to GL_m(\mathbb{R})$ for $X$ a compact metric space.

Then the $A_i$ will be the values $A(T^ix)$ and the $B_i$ will be $A(T^ip)$ for $p$ close to $x$. The multiplicative ergodic theorem states that the norm products $||A_0 \dots A_{n-1}||$ grow like $e^{\lambda n}$ almost everywhere (in $x$) with respect to any invariant measure (where $\lambda$ is the maximal Lyapunov exponent), but in the case of upper triangular matrices, this is actually immediate---we even have polynomial growth if ones are on the diagonal (a corollary of the nilpotence of strictly upper triangular matrices). The multiplicative ergodic theorem and its variants were used in a paper that motivated the problem I'm working on, but it doesn't quite seem to help here (because we make slightly different assumptions), which is why I was curious about other techniques.