Every number on this page is computed by the Chapter 6 notebook's own code. The drift paths of step 5 are the notebook's draws with the lab's random seed 26106, not Meridian records. Your notes stay on this page until you leave it; copy the memo before you go.
The board wants a recommended two-year program built from four moves—the sale of part of Industrial Systems, with or without the shared engineering team; the digital build; and the automation round—and a view on whether automation should become an annual playbook. You are on the transformation office team.
Use AXIOM to declare the moves as operators with their preconditions, find which sequences can run, test whether the automation playbook sustains itself, and set an execution tolerance for each step.
Meridian today (Table 3.1) and the board's floor (Table 5.4). The sale (Worked Example 3.1), the digital build (Worked Example 1.1, in the Chapter 1 model) and the automation round (Worked Example 6.1).
In the operator forge, declare the four moves with their effects and preconditions, the board's floor included, and inspect each operator's domain and range.
Each move is an operator: its effect is the mapping, its domain holds the preconditions (Definitions 6.1–6.4). Outside its domain an operator has no result: “cannot”, not “should not”.
Liquidity and efficiency, workforce capability 58. Shaded: the domain, liquidity of at least $470 million (the $350 million floor plus the round's $120 million). Hatched: the range, efficiency (e + 85)/2 at liquidity of at least the floor.
In the pipeline composer, chain the moves two at a time, record which sequences pass every seam, and find the one that reaches a technology index of 70 with operational efficiency of 80.
Every sequence of up to two moves from today, with branches pruned where a precondition fails. A second sale or a second build is impossible and is not drawn. Target: technology at least 70 and efficiency at least 80.
In the iteration theater, repeat the automation round with the savings paid out and with the savings recycled, and watch the nested domains shrink to nothing or settle on a sustainable core. Find the smallest starting liquidity from which the recycled playbook runs indefinitely.
One round at the start of each year; the precondition, liquidity of at least $470 million, is checked before each round. Liquidity at each year's end (Worked Example 6.1, Steps 2–3).
Equation 6.2: each further round adds a precondition on today's state. Paid out, round k needs 470 + 120(k − 1); recycled, the requirement settles (Theorem 6.3).
In the reachability explorer, grow the reachable sets of the four-move repertoire one step at a time against the board's target, and tighten or loosen its tolerance.
Rk+1 = Rk ∪ ⋃ Ti(Rk ∩ dom Ti): breadth-first search over the four moves (Theorem 6.4(i)). Each state is drawn once, at the depth where it is first reached; ✕ marks a build whose low point would breach the floor.
Efficiency after k recycled rounds is 85 − 14 × 0.5k (Table 6.4's first row): the ceiling is approached but never reached (Theorem 6.4(iii); Remark 6.B.3).
On the stability bench, set the shortfall per round and the sensitivity factor L, and compare the observed drift with the bound (Equation 6.4).
The efficiency step halves the remaining gap, a contraction with L = 0.5, so its steady state moves by at most s/(1 − L) (Theorem 6.5(iii); Worked Example 6.1, Step 4).
Only one two-move sequence reaches the target within the floor (Theorem 6.4); the recycled playbook is tightest early, at the start of year 3 (Theorem 6.3); consolidating steps forgive shortfalls and amplifying steps compound them (Theorem 6.5).
Recommend a two-year sequence with its seam conditions, the automation playbook's status (strategy or trade, with the core threshold), and the execution tolerance for each step.