PositiveRecoding

Navigation page for Blueprint/D5/S3/ConceptDynamics/Coding/PositiveRecoding/ at upstream snapshot 6974dba01daa1a25cc74b87a86c191e95fe2c681.

Contents

• Actual-history charts, endpoint-corrected positive-word gyration and signed time translation
• Ranked permutation factors as actual graph relabelings
• Transport both relabel factors through the actual charts
• Parallel-edge discrepancy on the original primitive path basis
• Actual relabel row matrices equal the reduced forward gyration
• Actual positive-word loop transport to literal vertex coordinates with both endpoint corrections
• The rectangular localized cochain equals the same actual positive-word gyration modulo three
• Actual finite graph words give chronological rectangular RS paths and exact scalar-extended endpoint maps
• Assemble actual dictionary weights over typed words
• Closed RS loops change coefficient basis through two triangles before endpoint cancellation
• Transport forward orbit phases under timed history equivalences
• Relabel actual graph histories by vertex and edge equivalences
• Number the actual incoming split and retain its time correction
• Exact numbered positive recoding and inverse time signs
• Construct the positive word on the original finite presentation
• Number rectangular edge fibers for the actual outgoing split
• The same time/id edge in every finite presentation basis measures actual primitive-orbit count
• Unit-factor recodings retain the original parallel-edge rank
• Count the signed corrections of every actual split tower
• Derive integer-time laws inside the actual recoding constructions
• Endpoint-typed finite positive words with explicit corrections