7. Capture and the prepared quasistatic return
7.1 The full outgoing connection
Lemma 7.1 (Complete connection at a fold). For , the outgoing local centre orbit at either fixed fold input tends to the other stable complete minimum.
Proof. At the local outgoing equation is for small . The orbit has backward limit and lies on the complete centre graph, not the stationary memory curve. Integrating strict loss (9) at constant input from the backward limit gives at each nonstationary finite point. Proposition 2.1 bounds the orbit; Lemma 3.1 gives exactly two distinct stationary points. The finite-stationary-set argument gives convergence, and the strict tilted-value deficit precludes return to . The other minimum is the only remaining limit. No monotone amplitude radius or planar basin boundary is assumed.
At fixed small exit , Lemma 4.1 and passage estimates give convergence of the ramped exit to the outgoing graph at . Choose a finite reference segment entering a small attracting ball about the other minimum. During this segment the ramp varies by . Continuous dependence transfers the nearby ramped states into the ball, contained in an attracting tube of the other stationary branch. Fixed-input loss establishes the reference connection, without implying ramp monotonicity.
7.2 Stable tracking through reversal
Away from its terminating fold a compact branch segment has uniformly Hurwitz complete Jacobian and smooth state . In moving coordinates ,
Choose smooth satisfying
Its norm, inverse norm and derivative are bounded on the compact interval. For and ,
A small tube is invariant for sufficiently small , and after a decaying transient . At reversal the state and input remain continuous, and changing sign of leaves an forcing. Fold charts apply only on the constant-slope portions near folds; (50) tracks through reversal.
Theorem 7.2 (Prepared triangular-cycle limit). Fix positive parameters with and
Start at and apply (5). For sufficiently small , the complete source makes both passages of Theorem 5.1, enters the other attracting branch on each leg, and returns to with error tending to zero. As functions of input, the two legs converge uniformly on compact intervals away from the respective static folds to
Convergence also holds in for finite . Switching inputs at sufficiently small fixed local levels obey (43). No fixed nonzero rate periodic-orbit attraction is asserted.
Proof. Complete stability and (50) give tracking to the upper fold neighborhood. Matching selects the tracked Airy solution and delayed exit; Lemma 4.1 gives the limiting graph point. Lemma 7.1 and finite-time continuous dependence give capture by the high branch. Its tube tracks to , through reversal and down to the lower fold neighborhood. Repeat the passage and capture for the low branch. A fixed positive input interval before removes the last transient. On each compact interval separated from the corresponding fold after capture, available tracking time grows like , and before first passage the exact stationary preparation supplies tracking. Equations (50)–(52) prove compact uniform convergence; the bounded-input estimates give finite- convergence by dominated convergence. Both input offsets tend to zero by the local estimates. No global trajectory enclosure is used.
A sufficiently small fixed initial full-state perturbation gives the same selection after its attracting transient. Then uniform convergence is asserted away from the initial endpoint as well as folds. The numerical transverse preparation is early, not a perturbation at a fold.
7.3 The geometric limit
An excursion along the reference connection can overshoot. Its input interval shrinks to zero, so it does not change the integral limit. For , define the magnitude of the oriented integral
A closing vertical segment at contributes zero. Thus this does not assume exact endpoint closure or measure total enclosed area of self-intersections. From (54) and uniform boundedness,
Positivity follows from the distinct ordered outer radii. This is a prepared quasistatic limit, not an exact vertical transient trace, monotone jump, unique attracting periodic orbit, or arbitrary finite-rate basin result.
8. The cost of deleting dynamic memory
The stationary reduction (15) preserves branch geometry. Test the hypothetical dynamics that impose it at every time:
This is not the experimental source. With the normalization separates:
The reduced system uses with unchanged . Hence
They differ at every finite . The term is the mobility-weighted contribution from both free memories to the mixed critical vector. This obstruction concerns the delay at preserved folds, without deciding a justified limit.
| Fold | ||||
|---|---|---|---|---|
| up | 1.603701 | 4.103701 | 3.324136 | 6.218901 |
| down | 7.327314 | 9.827314 | 6.508539 | 7.915473 |
Table 2. Stationary substitution preserves the static inputs but changes the dynamic delay prefactors. The ramp uses neither substitution. The seven-direction graph retains motion and stable error from the full dynamics. The separate three-state check below is an exact symmetry restriction with evolving memory. These are distinct operations.
9. Work and the evolving carrier
At stationarity and , so the two branches have equal stationary power:
The amplitudes, memories, stiffnesses and responses can still differ.
Proposition 9.1 (Slow-cycle maintenance work). With exact stationary preparation under Theorem 7.2, over the full round trip
For nearby fixed preparations with the same selection the leading work and dissipation coefficient persists, but unscaled need not vanish.
Proof. Uniform boundedness from Proposition 2.1 bounds independently of . On either leg . Away from folds the state tends to the branch and power to (60), so dominated convergence gives the work coefficient with a factor of two. Exact return gives and the physical ledger (10) gives the dissipation limit. For a fixed perturbed start the final stored value instead tends to , so , generally nonzero. Bounded implies .
Slower traversal approaches the static switches while maintenance work grows as . The finite oriented area (56) has different units and actuator pairing. It is neither dissipated energy nor minimum switching work. Input supplies phase, mode and traversal; reciprocal dynamics produce delay and capture without an autonomous energy source.
For imposed the amplitude propagator is
The instantaneous coherent and dissipative generators remain and . With free memory at a stationary source, using above,
Eliminating retains the initial condition and causal kernel . It is neither clamping nor a scalar function of the present carrier. The fold denominator (58) makes the retained dynamical information explicit, connecting CSCF and source-to-readout without claiming an experimental universal law.
Published source: Slow Passage and Prepared Hysteresis in Adaptive Spectral Carriers. Read the original PDF alongside the web treatment.