Statement
Assume a compatible directed relation system with finite route equality, one uniform relation graph estimate, compatible closable total relation retention, and compatible bounded total decoders on a common completed graph carrier. Then the two total decoders agree after composition with the closed total retention.
Meaning and scope
The result reconstructs the common represented route, including its retained intermediate data. Individual closability of comparison factors is insufficient to guarantee equality of their separately formed products.
Source
Paper 4, Theorem 8.3. Draft manuscript — compile-audit version; not marked frozen.