Manuscript En03-A@1 · En03-A.tex · proof · 5398614e

Proof

Conditional approximation and verification interfaces › Topology, guards, and a finite stability allowance · lines 2955–2959

Back to manuscript

Proof. Adding the two inequalities gives $E_{k + 1} \leq L_{k} E_{k} + η_{k}$ . Iteration proves the display, with empty products equal to $1$ . Fixed readout contracts trace distance into total variation.

Nearby in this section

section: Topology, guards, and a finite stability allowance
section: Topology, guards, and a finite stability allowance