Manuscript X-A-ST@1 · X-A-ST.tex · section · d9ccbde1

Locality of the complete finite network

Scheduled locality and regular transport › Locality of the complete finite network · lines 2056–2070

For a finite site set with local matrix algebras, let each tick be a product of channels on a prescribed partition into blocks. Record registers are retained as part of the complete output. For a final set $Y$ , define its backwards ancestor sets recursively:

N_{t, t} (Y) = Y, N_{s, t} (Y) = ⋃ {B : B is a block at tick s + 1, B \cap N_{s + 1, t} (Y) \neq = \emptyset} .

Displayed formulas in this passage

unlabeled · line 2064
$N_{t, t} (Y) = Y, N_{s, t} (Y) = ⋃ {B : B is a block at tick s + 1, B \cap N_{s + 1, t} (Y) \neq = \emptyset} .$

Nearby in this section

theorem: Theorem: Scheduled locality
section: Locality of the complete finite network