Manuscript En05-A@1 · En05-A.tex · theorem · f076e703
Theorem: Formal super-cone cycle construction
Two retiming statements and a boost-closure limitation › The earlier strong closure hypothesis · lines 1570–1601 · proof included or linked
En05-A@1#thm:cycles
Assume Hypothesis hyp:boost. Suppose lossless classical-bit transport is available in both directions between , in one original tick, with . Then an admitted composition has a directed closed chain through one event.
Proof. Put and define
If , the two ceiling terms differ by at most one. Taking the positive part preserves that bound, so is compatible. Also , .
The -image of the forward transport and the -image of the reverse transport both have duration . By the closure hypothesis, they are independently realizable in the common substrate.
Starting at , use the forward image, wait at for ticks, and use the reverse image. The final event is , because the total duration is
The devices are composed from two different retiming images; this is not the application of one coordinate change to an original network.
Displayed formulas in this passage
unlabeled · line 1580
unlabeled · line 1596
Nearby in this section
- section: The earlier strong closure hypothesis
- hypothesis: Hypothesis: Unrestricted device retiming closure
- assumption: Assumption: E7: Finite causal executability
- proposition: Proposition: Executability of admissible finite networks
- section: The earlier strong closure hypothesis
- proposition: Proposition: Closed dependencies conflict with E7(a)
- theorem: Theorem: The strong closure also excludes ordinary relays
- remark: Remark: Correct conclusion