Proposition: Reference-preserving relabelled simulation

Suppose a fixed finite complete payload network is realized on new carriers with the same wire graph and interfaces. Transport blocks act only as wire-address changes. At each payload event the original complete map is applied under the corresponding tensor-factor relabelling.

Then the realized network has the original complete channel under the external-interface relabelling, including every reference.

Proof. Choose a topological ordering of the original network. The new realization respects its dependencies. Initially identify corresponding wire spaces by a tensor relabelling. At every payload event, conjugacy of its local map carries the identified intermediate state to the next identified state. Address changes do not alter internal logical states. Induct over the finite network, retaining every outcome branch. Theorem thm:foliation removes the choice of legal ordering. Tensor the calculation with a reference identity.