Manuscript VII-J-ST@1 · VII-J-ST.tex · theorem · f1f1d82c
Theorem: Encoded physical containment
Causal embedding, realized routes, and robustness · lines 661–682 · proof included or linked
VII-J-ST@1#thm:physical, VII-J-ST@1#eq:physical
Suppose the full encoded–computed–decoded network is complete, and every dependency edge has the stated causal certificate. For a joint output , let contain input factors whose assigned events can reach at least one output event of . Then
Every intervention supported outside has zero signalling to , with arbitrary untouched references.
Proof. Theorem thm:schedule gives the first inclusion. Concatenate the supplied causal routes along a scheduled path. Transitivity gives the second inclusion. Apply Theorem thm:nosignal to the complement of the physical past.
Displayed formulas in this passage
VII-J-ST@1#eq:physical · line 668