Manuscript IX-A-ST@1 · IX-A-ST.tex · section · 6e99d1b2

The complete scheduled ancestor set

Scheduled locality and regular causal transport › The complete scheduled ancestor set · lines 1781–1793

Every programme input, table selector, record, reset, encoder, decoder, and controller wire read by an operation is included in its declared interface. All maps in this section are unconditional CPTP maps.

For a finite site set $X$ , put

H_{X} = x \in X ⨂ H_{x}, A (Y) = B (H_{Y}) \otimes I_{X ∖ Y} .

Displayed formulas in this passage

unlabeled · line 1789
$H_{X} = x \in X ⨂ H_{x}, A (Y) = B (H_{Y}) \otimes I_{X ∖ Y} .$

Nearby in this section

theorem: Theorem: Schedule-locality
section: The complete scheduled ancestor set
proposition: Proposition: Exact deterministic no-signalling criterion
section: The complete scheduled ancestor set
theorem: Theorem: Physical containment is an additional certificate
section: The complete scheduled ancestor set