Manuscript En03-A@1 · En03-A.tex · lemma · 5398614e
Lemma: Injective event encoding
External conical geometry and certified local moves › Event germs, guard, transport, and finite code · lines 2128–2147 · proof included or linked
En03-A@1#lem:injection, En03-A@1#eq:encodedmap
Let be a tuple of valid input locations and its transported tuple. For , valid event reports, and zero history, the map
is injective and has disjoint input and output sets.
Proof. History determines , and the output counter determines . All other input data are retained. Modes separate the two sets.
Displayed formulas in this passage
En03-A@1#eq:encodedmap · line 2133
Nearby in this section
- section: Event germs, guard, transport, and finite code
- definition: Definition: Exact event guard
- section: Event germs, guard, transport, and finite code
- proposition: Proposition: Geometric rule and blind control
- section: Event germs, guard, transport, and finite code
- section: Event germs, guard, transport, and finite code
- proposition: Proposition: Decoder-correct event permutation
- section: Event germs, guard, transport, and finite code