Manuscript VII-J@1 · VII-J.tex · section · d8c01b04
A reusable mathematical certificate
A reusable mathematical certificate · lines 1993–2030
| Route | Exact achievement and limit |
|---|---|
| General macro-step | Target A from adjoint support and a complete decoded-channel certificate; no automatic local implementation of an arbitrary macro map |
| Elementary routed circuit | Target B when causal transport, rendezvous, local gates, and positive timings are printed |
| Homogeneous directional | Support-function inclusion and a periodic cycle polytope; finite-time offset remains |
| Varying causal geometry | Local admissible paths and an explicitly solved time-dependent velocity benchmark |
| Hamiltonian | Reference-stable finite-volume tails plus a product-formula accuracy bound; no strict cone |
| VII-F event | Uniform causal slot bound, robust margins, transition composition, and a nontrivial exact buffered carrier example |
The certificate is an analytical mathematical object. A script checking a finite example can corroborate its arithmetic, but a pass flag is not a proof of its universal hypotheses.