Manuscript VII-J-ST@1 · VII-J-ST.tex · corollary · f1f1d82c
Corollary: Partitioned metric envelope
The complete timed network and exact scheduled support · lines 588–614 · proof included or linked
VII-J-ST@1#cor:metric-envelope
For layers on a finite metric site set , assume . Define backward sets by
Then
Proof. The support assertion is Theorem thm:schedule. Each backward layer adds at most one block diameter. Apply the triangle inequality inductively.
Displayed formulas in this passage
unlabeled · line 595
unlabeled · line 602
Nearby in this section
- definition: Definition: Complete finite network
- section: The complete timed network and exact scheduled support
- theorem: Theorem: Complete scheduled-support bound
- section: The complete timed network and exact scheduled support
- section: The complete timed network and exact scheduled support
- example: Example: Strictness of the first distinction
- proposition: Proposition: What retiming preserves
- section: The complete timed network and exact scheduled support