Trajectories, Thresholds & Path Dependence

Primes about how systems move through time toward locked-in or threshold-crossing outcomes: irreversible lock-in (path dependence, critical juncture, first mover advantage, ratchet effect, reversibility horizon), timing windows for intervention (culminating point, Collingridge dilemma), and dual-pathway architectures (fast-path/slow-path, two-store architecture, return path).

31 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its short description.

• Annealing — Lift a stuck system into a high-mobility regime, then withdraw the agitation along a controlled schedule so it settles into a better configuration than it could reach cold.
• Approach-Avoidance Conflict — A single goal that pulls and repels at once, where competing gradients balance at an intermediate point and trap the actor in vacillation.
• Attractor Selection and Basin Control — System dynamics directed toward stable states via basin manipulation.
• Bootstrapping — A system initialises and grows itself from a minimal seed using only its own products, recursively constructing each next stage without an external scaffold, until it reaches its target operating state.
• Bycatch — A selective process aimed at one target class also captures non-target classes because of the selector's finite specificity, and the harm persists because the success metric counts only the target.
• Collingridge Dilemma — Information about a system's consequences rises as the cost of changing it rises, so the window where intervention is both informed and feasible may be narrow or absent.
• Concurrency — Manage simultaneous processes.
• Conjunctive Path Activation — A latent causal path becomes live only when every state-conditional edge along it conducts at once, making the failure invisible to factor-by-factor audit.
• Critical Juncture — Moment where small variations produce divergent locked-in paths.
• Culminating Point — The point on an advancing effort's trajectory where the net yield of one more unit of advance crosses zero and turns negative.
• Derivative Amplification — In a serial chain where each upstream stage responds to the rate of change of its downstream neighbour, variation amplifies geometrically with chain length.
• Desire Path — An involuntary trace worn into a designed environment's substrate by repeated use, recording revealed preference where the design fails to accommodate it.
• Develops-From Relation — A later entity came to be by stage-wise transformation of a continuing predecessor, the same continuant passing through directed, qualitatively distinct stages under a generative rule.
• Dislocation Motion — Large-scale change of an ordered medium achieved by propagating a localised defect rather than rearranging every unit at once.
• Ecological Succession — Stage-ordered change in which the current occupants themselves modify the substrate, determining which stage can come next through facilitation, inhibition, or tolerance.
• Fast-Path / Slow-Path Architecture — Handle the common case cheaply and escalate the exceptional case to an expensive path via a trigger.
• First Mover Advantage — When a contest rewards early arrival, the same move yields a different return depending on when in the sequence it is taken.
• Frictionless Benchmark Reasoning — A precisely stated idealised case yields a sharp invariance, irrelevance, or efficiency result that is then used not as an empirical claim but as a coordinate system against which the real world is decomposed into separately named and measured deviations.
• Last-Mile Failure — A distribution network's per-unit cost, latency, and failure rate spike at the final stage where its geometry fans out from few-trunks-carrying-much to many-leaves-each-carrying-little, so upstream throughput overstates endpoint coverage.
• Multi Path Convergence — Multiple distinct trajectories from different starts arrive at the same end-state, with the destination doing the work.
• Opportunity Asymmetry — Agents possess unequal access to actions and favorable outcomes.
• Optimal Stopping Rule — A rule maps a sequence of observations to a halt decision, trading the cost of stopping too early against stopping too late.
• Parrondo's Paradox — Two individually losing strategies, coupled through a shared state with opposite-signed regional effects, can combine into a winning one.
• Path Dependence — Outcomes are shaped by the specific historical sequence of past choices, which lock in consequences and foreclose alternatives that persist despite present incentives to change.
• Premature Optimization — Committing local refinement effort before global structure is known pays both search-cost and rigidity-cost without the information to spend either well.
• Ratchet Effect — Direction-asymmetric coupling plus a locking element produces accumulating one-way displacement under bidirectional forcing.
• Response-vs-Propagation Race — Containment wins or loses by timescale comparison.
• Return Path — Every forward-flow pipeline serving goal-directed users requires a separately-designed backward channel whose optimisation criteria invert the forward channel's.
• Reversibility Horizon — Temporal threshold where reversal cost exceeds forward commitment.
• Scaling and Scale Dependence — Patterns and constraints change qualitatively across different scales.
• Two-Store Architecture — A fast interference-prone store and a slow integrated store coupled by a periodic transfer mechanism, paying for both speed and integration by maintaining two oppositely-optimised substrates.