Manuscript III-B@1 · III-B-v1.tex · theorem · d2c98f62
Theorem: Complete locality and causal containment
Causal schedules, records, and payload transport › Complete schedule locality · lines 2002–2034 · proof included or linked
III-B@1#thm:locality
For the complete scheduled channel ,
The terminal reduction to factors through the initial reduction to . With a retained reference , the joint output factors through the initial reduction to .
Replacing a complete channel outside the backward dependency region does not change the terminal law. Every scheduled ancestor event maps into the terminal metric past.
Proof. An output observable is the identity on each block disjoint from its current support. A channel adjoint is unital, so it preserves that identity. Other blocks enlarge support only to their union. Backward induction proves the inclusion.
Append any fixed state on the unused initial complement, apply the channel, and reduce to . The adjoint inclusion proves that this defines a reduced channel with the same action even on initially correlated inputs. Tensoring the argument with proves the reference statement.
An operation outside the dependency region acts on an identity in the backward calculation and is invisible. Each dependency edge is causally embedded, and concatenation proves the final containment.
Displayed formulas in this passage
unlabeled · line 2005