Skip to content
Dynamic Corporate Transformation

Vol. I, Ch. 7 · Part 2. Mathematical Representation · Week 4

Dynamic Enterprise Systems

Learning outcomes

After completing this chapter, the reader should be able to:

  1. Define a Dynamic Enterprise System mathematically, as the integration of state representation (ESA) and transformation operators (ETA) under an explicit time semantics.
  2. Formulate deterministic enterprise state equations in continuous and discrete time, with declared system class (autonomous, time-invariant, linear).
  3. Model enterprise evolution through time, including the superposition of inherited momentum and program contribution in the linear regime.
  4. Distinguish continuous-time and discrete-time enterprise systems, and convert between them exactly in the linear time-invariant case.
  5. Analyze enterprise trajectories: existence, uniqueness, continuous dependence on initial conditions, and invariance of the feasible region.
  6. Interpret equilibrium and steady-state behavior, including input-shifted equilibria and multiplicity.
  7. Evaluate enterprise stability by the spectral tests and by Lyapunov's direct method.
  8. Apply feedback within enterprise dynamics: gain design, constructive pole placement, and the overcorrection phenomenon.
  9. Analyze enterprise responses to external inputs, and determine which internal states are reconstructible from observed outputs.
  10. Prepare deterministic enterprise systems for the stochastic generalization of Chapter 8.

Reading guide

Work through the chapter in section order; the full development, proofs, and worked examples are in the book — this page indexes them and does not replace them.

  1. Motivation for Dynamic Enterprise Systems

    Motivation for Dynamic Enterprise Systems

  2. Dynamic Enterprise Systems and Their Equations

    Dynamic Enterprise Systems and Their Equations

  3. Continuous and Discrete Time

    Continuous and Discrete Time

  4. The State Transition Structure

    The State Transition Structure

  5. Enterprise Equilibria

    Enterprise Equilibria

  6. Enterprise Stability

    Enterprise Stability

  7. Feedback in Enterprise Dynamics

    Feedback in Enterprise Dynamics

  8. Worked Examples

    Worked Examples

  9. Preparation for Stochastic Enterprise Dynamics

    Preparation for Stochastic Enterprise Dynamics

  10. Chapter Summary

    Chapter Summary

  11. Exercises

    Exercises

  12. Notes and Sources

    Notes and Sources

On the map

AXIOM

This chapter is instrumented by:

Launch the module, load the chapter model, modify inputs, run the optimization, and compare against the worked examples in the book.

Exercises

19 exercises, grouped A concept checks · B mathematical · C computational · D enterprise applications. Starred (★) exercises are on the advanced track. Full solutions appear in the Instructor's Manual, Chapter 7.

A. Concept checks

  1. 7.1
    Classify each of the following along all four axes of Table (see book), one line each: (a) a quarterly covenant-compliance model; (b) an intraday liquidity model; (c) a platform-adoption model with network effects; (d) a model of demand under an announced regulatory phase-in.
  2. 7.2
    For your own enterprise, name two decision inputs, two environment inputs, one delivered output, and two reported outputs; state which reported output is a mixture of state coordinates rather than a single coordinate, and why that matters for Theorem (see book)(iii).
  3. 7.3
    Distinguish "equilibrium of the autonomous dynamics" from "steady state under a held policy," using (see book); give a Meridian instance where the two differ and explain which one a board target should reference.
  4. 7.4
    A colleague discretizes a continuous LTI treasury model by Euler's method with Δ\Delta one quarter.
  5. 7.5
    Give one enterprise scenario for each row of Table (see book), distinct from the instances printed there, and state for each which test you would run.

B. Mathematical exercises

  1. 7.6
    From the continuous-dependence bound (see book), derive the forecastable-horizon formula tmax⁡≈(1/L)ln⁡(tol/err)t_{\max} \approx (1/L)\ln( \mathrm{tol}/\mathrm{err}) for tolerance tol\mathrm{tol} and initial measurement error err\mathrm{err}; evaluate it for Meridian's capability coordinate (±5\pm 5 points per Table 5.
  2. 7.7
    Prove the generalized Gr"onwall inequality with time-varying rate: if φ(t)≤c+∫0tℓ(s)φ(s) ds\varphi(t) \le c + \int_0^t \ell(s)\varphi(s)\, \mathrm{d}s with ℓ≥0\ell \ge 0 continuous, then φ(t)≤c exp⁡(∫0tℓ(s) ds)\varphi(t) \le c\,\exp\bigl(\int_0^t \ell(s)\,\mathrm{d}s\bigr).
  3. 7.8
    Prove the diagonalizable case of Theorem (see book)(i) in full: for A=VΛV−1\mathbf{A} = \mathbf{V}\boldsymbol{\Lambda}\mathbf{V}^{-1}, show ∥xk∥≤κ(V) ρ(A)k∥x0∥\norm{\x_k} \le \kappa(\mathbf{V})\,\rho(\mathbf{A})^{k} \norm{\x_0} with κ(V)=∥V∥∥V−1∥\kappa(\mathbf{V}) = \norm{\mathbf{V}} \norm{\mathbf{V}^{-1}}, and explain the enterprise meaning of a large eigenbasis condition number (near-parallel modes: transient growth before decay).
  4. 7.9 ★
    For the planar rotation A=[cos⁡θ−sin⁡θsin⁡θcos⁡θ]\mathbf{A} = \bigl[\begin{smallmatrix}\cos\theta & -\sin\theta \\ \sin\theta & \cos\theta\end{smallmatrix}\bigr], prove Lyapunov stability of the origin directly from Definition (see book) (exhibit δ(ε)\delta(\varepsilon)), prove that asymptotic stability fails, and exhibit the Jordan pair at ρ=1\rho = 1 whose instability completes the theorem's "inconclusive" clause.
  5. 7.10
    Re-derive (see book) by splitting xk=xkfree+xkforced\x_k = \x_k^{\mathrm{free}} + \x_k^{\mathrm{forced}} from the start: define the two sequences by their own recursions, prove each satisfies it, and prove the sum satisfies the original—superposition as three small inductions.
  6. 7.11
    A covenant package reports yk=Cxk\mathbf{y}_k = \mathbf{C}\x_k with C\mathbf{C} selecting (leverage, liquidity) from a four-coordinate state (liquidity, leverage, capability, technology) whose A\mathbf{A} couples capability into liquidity with a one-period lag but couples technology into nothing financial for two periods.
  7. 7.12 ★
    Carry out Theorem (see book)(iii) for n=2n = 2 from scratch: take A=[01−a2−a1]\mathbf{A} = \bigl[\begin{smallmatrix}0 & 1 \\ -a_2 & -a_1\end{smallmatrix} \bigr], B=[0,1] ⁣⊤\mathbf{B} = [0, 1]^{\!\top}, desired eigenvalues {0.5,0.6}\{0.5, 0.6\}; compute K\mathbf{K}, verify the closed-loop characteristic polynomial by direct expansion, and then repeat with desired eigenvalues {0.5±0.3i}\{0.5 \pm 0.3i\} to confirm complex placement.
  8. 7.13
    Derive the general overcorrection threshold for the scalar system with delay: xk+1=axk+buk−1x_{k+1} = a x_k + b u_{k-1} (the decision acts one period late), under uk=−kxku_k = -k x_k.

C. Computational exercises

  1. 7.14
    (With AXIOM-07 or the Chapter 7 notebook.
  2. 7.15
    (With AXIOM-07 or the Chapter 7 notebook.
  3. 7.16
    (With AXIOM-07 or the Chapter 7 notebook.

D. Enterprise applications

  1. 7.17
    Write the dynamic declaration (Table (see book) row memberships, with justification and expiry conditions) for the enterprise model you built in Exercises 4.
  2. 7.18
    Write a one-page gain audit of one management control loop you know (pricing, hiring, inventory, credit approval): the deviation variable, the instrument, the estimated (a,b)(a, b), the operating gain and its Table (see book) regime, the computed kcritk_{\mathrm{crit}}, and one observed episode reinterpreted through the chart.
  3. 7.19
    For a perimeter-changing transformation you know (divestiture, carve-out, acquisition), sketch the hybrid timeline of Example (see book): pre-dynamics, jump operator with feasibility check, post-dynamics, and the three-item discipline (jump feasibility, post-spectrum re-diagnosis, revalidation) with the evidence each item would require.

Downloads

All three companions consume the same seeded engine (26107), so their numbers agree by construction — the MFMF convention, carried forward.