Mind · Reasoning
MandatoryAbstraction
Before decomposing a concrete problem, locate it by climbing specialization links to the root, then retrace the route
Definition
Mechanism
A concrete problem is located before it is decomposed. The ascent starts at the most specific reusable capability that frames the problem and follows adjacent SpecializationEdge links upward until it reaches the RootSolver. At every proposed attachment, existing and plausible siblings are searched, without any claim to have found them all, and the record states the parent's genus, the child's differentia, how the higher frame changes the later carve, whether the contracts fit, and whether an informative intermediate parent was omitted. An intermediate is inserted or reused only when it changes routing, exposes a reusable invariant or changes the dimensions visible below. The route is then traversed in exact reverse order, and only after it reaches the specific subject is that capability carved by SolverDecomposition into children bound by CompositionEdge links. The ascent is mandatory for every case, while further downward depth stays governed by the MarginalValueRule. Locating a case on an existing route is distinct from adding a new higher parent, which needs evidence such as sibling comparison, recurrence or a frame error.
Invariants
- Every case is located by an ascent of specialization links from its most specific reusable capability to the root before it is decomposed.
- Each attachment records the parent's genus, the child's differentia, the sibling search, the effect on the later carve, contract fit and the search for an omitted intermediate.
- The descent before the carve retraces the ascent's route in exact reverse order.
- The ascent is mandatory for locating a case; downward depth after the carve is set by MarginalValueRule.
Risks
Failure modes
Carve in place
the problem is decomposed where it was stated, so the carve inherits the stated framing rather than a located one.
Umbrella attachment
a case is hung under a broad parent although an informative intermediate would change its routing or later carve.
Route mismatch
the descent does not retrace the ascent exactly, so the carve is made under a frame the ascent did not establish.
Record read as truth
a complete, valid route record is taken to show that its parents are insightful or true.
Location read as accommodation
locating a case is taken as licence to add new higher parents without the evidence a topology change needs.
Relationships
Builds on
References
Infrastructure
A link stating that a child supplies a differentiated contribution its parent's outward capability requires
Deepen only while expected improvement plus an exploration credit, divided by incremental cost, exceeds a domain threshold
Apex triage node of a SolverTree, with Pathway Memory as its compounding learning site
Breaking a concept into solver-contract-bound sub-concepts — the move that enables fractal recursion
Infrastructure
A link stating that a child concept is a kind or realization of its parent, forming the route by which problems are located
Nothing in this library builds on this pattern yet.