A note on time-uniform concentration inequality for matrix products

This short note contains a simple argument that allows us to go from fixed-time to any-time bounds for the concentration of matrix products. The result presented here is motivated by the analysis of Oja’s algorithms.