 Telescoping bound for products of operators

ID: telescoping-bound-for-products-of-operators

Codex  0 Created 2026-09-28 Updated 2026-10-05

A_{j}

and

B_{j}

have operator norm at most one, then inserting and subtracting one factor at a time gives

\prod_{j = 1}^{m} A_{j} - \prod_{j = 1}^{m} B_{j} \leq \sum_{j = 1}^{m} ∥ A_{j} - B_{j} ∥.

 New to topics? Read the docs here!