Every number on this page is computed by the Chapter 14 notebook's own code; the chapter's numbers are exact, without simulation. Your notes stay on this page until you leave it; copy the memo before you go.
Before Chapter 15's optimization is run on Meridian, the board wants an analysis certificate: is the model well posed, how stable is the company, how strongly does it respond to change, and can it stay within its limits for the whole horizon? You prepare the certificate.
Use AXIOM to certify stability, price sensitivity, test viability, and re-budget the new link of Worked Example 14.1.
Worked Example 14.1: Meridian's feedback core (Industrial Systems and Digital, each wired both ways to engineering and treasury), the risk committee's register of ceilings, 0.40 a link (Section 12.7), the second phase's new link, and the board's rule: any deviation must halve within a year.
Edit couplings on the Meridian register and watch the spectral radius, the certificate margin, the half-life, and the Lyapunov bowl respond. Add the new link and find a set of trims that meets the board's rule.
Sliders move in steps of 0.05; the Table 14.4 options load the exact repairs. Right: the frontier hr* + 2(e² + t²) ≤ r*², with r* = 2−1/4 = 0.8409, on which every repair sits (Online Appendix 14.B.1).
Compute steady-state multipliers with the live walk decomposition, direct and knock-on, and the elasticity table; then turn the blow-up dial toward a spectral radius of 1 and record how fast the multipliers grow.
(I − M)−1B = B + MB + M²B + …: the direct effect the owner sees, then the knock-on effects along walks of one, two, three links (Theorem 14.4(ii)).
Compare a state shock, a parameter recalibration, and the preloaded structural case, an acquisition; explain why only the first two have derivatives.
Run the viability iteration live on the preloaded restructuring corridor, watch the kernel shrink quarter by quarter, and apply its two repairs.
A unit holds cash s above its floor and burns r a quarter: s′ = s − r, r′ = max(r − u, 0), 0 ≤ u ≤ the fastest cut. V0 is the feasible region; Vj+1 keeps the states with a decision leading into Vj; each Vj is {s ≥ Nj(r)} (Theorem 14.5(iii); Online Appendix 14.B.2). Dots: the fastest-cuts path from today.
Read the complexity panel, run the gain audit, and trip an invariant on purpose; classify the violation by its time signature.
Each test passes below 1 (spectral, block sizes on Chapter 9's two layers, the largest row sum L) or above 0 (the Lyapunov bowl's least eigenvalue); the board's rule needs ρ ≤ 0.8409. Complexity panel: n = 4 units; the spectral gap is 1 − ρ and the conditioning 1/(1 − ρ) (Definition 14.11).
The book declares no measured record: the measured gains are those of three states Worked Example 14.1 describes.
The runway's cash identity, sk+1 = sk − rk, along the fastest-cuts path, with the residual each quarter. The classifier reads only the residuals and the floor.
A register with spectral radius below 1 certifies the core (Theorem 14.3(ii)), and one new link can undo it (part (iii)); the multipliers grow like 1/(1 − ρ) (Theorem 14.4(iii)); the corridor is feasible every quarter until it is not, and only the kernel sees it in advance (Theorem 14.5(iii)–(iv)); and the guarantees stand or fall with the audit (Theorem 14.6(ii)).
The register's spectral radius and its margin; the half-life and the amplification; the re-budget for the new link, with its cost; the viability check and its repairs; and the audit plan.