The Decompression Map
Distinguish conceptual dependencies from operational feedback. This map gives reading and reconstruction paths; an arrow here does not claim that the preceding concept logically proves every subsequent one.
| Path | Relation to examine |
|---|---|
| axiom → vls / semblance | Access, accuracy, and non-possession |
| directional-primitives → predicate-binding → force | Actuation, regulated error, and coupled operation |
| splcw → matter-meaning-cycle → splcw | Externalization and return as an operational cycle |
| continuable-structure → continuity → responsible-successor | Inheritance and the additional condition of answerability |
| semantic-closure-and-recursive-marking → correction-without-regress | Domain, revision, and usable stopping conditions |
| ultimental-kernel → minimal-rebuild-string → system-invariants | Compressed specification and fidelity assessment |
A rigorous derivation must name its premises and inference. A reading order is not that proof. Feedback can connect already defined functions without making each concept its own justification. Domain applications add explicit carrier facts and constraints; they do not follow from philosophical vocabulary alone.
For maintained relations use the coupling graph and the interaction index. A missing diagram edge is a documentation gap unless evidence establishes a missing relation in the framework itself.
The map uses two edge classes. A derivation edge records a conceptual dependency to reconstruct; an operational return records consequence, correction, and renewed action through changed conditions. The same page can participate in both classes without making the return a premise or making a reading order a proof. Keep the classes separate when recording evidence.
Reconstruction procedure
- State the target. Begin with the kernel or page whose relation is being reconstructed, and name the scope of the claim.
- Follow derivation edges. Record the premises and inference that lead from the Axiom through VLS, binding, coupling, participation, and continuation. An arrow records a dependency to examine; it does not by itself prove the destination.
- Follow operational edges separately. Trace the SPLCW return, correction, consequence, and renewed action as a cycle. Do not fold feedback into the acyclic derivation path.
- Check the seam. Compare the result with System Invariants, using its kernel crosswalk to check every atomic 12.41–12.412 relation, then compare the source pages and declared tolerance. A missing detail is a fidelity defect only when it removes a required function or distinction under that use.
This procedure restores the map's lost operational distinction without treating one reading order as the framework's only valid decomposition.
Formal status
E: Derived, Exposition — a reconstruction and reading map whose edges remain contestable. A: aims to preserve the distinction between conceptual dependency, operational feedback, and application-specific evidence. Provenance: treatise-side navigation derived from the kernel and linked source pages.
See also
Hypercompression · The Ultimental Kernel · The Minimal Rebuild String · The Coupling Graph · System Invariants · The Interaction Matrix · Semantic Closure and Recursive Marking · Description Length and Explanatory Surface · Reader Paths