ConceptDynamics / CONCEPT
Actual positive-word loop transport to literal vertex coordinates with both endpoint corrections
Actual positive-word loop transport to literal vertex coordinates with both endpoint corrections.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH19
DOCUMENT LINKS0
The old chart and new enumeration have literal permutation entries
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Actual finite graph words give chronological rectangular RS paths and exact scalar-extended endpoint mapsstructural-affinity · Closed
- Actual relabel row matrices equal the reduced forward gyrationstructural-affinity · Closed
- Assemble actual dictionary weights over typed wordsstructural-affinity · Closed
- Closed RS loops change coefficient basis through two triangles before endpoint cancellationstructural-affinity · Closed
- The rectangular localized cochain equals the same actual positive-word gyration modulo threestructural-affinity · Closed
- The same time/id edge in every finite presentation basis measures actual primitive-orbit countstructural-affinity · Closed
- Transport both relabel factors through the actual chartsstructural-affinity · Closed
- Unit-factor recodings retain the original parallel-edge rankstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance