Skip to content
Dynamic Corporate Transformation

Vol. I, Ch. 5 · Part 2. Mathematical Representation · Week 3

Enterprise State Representation

Learning outcomes

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

  1. Define an enterprise state mathematically, including the canonical minimal state as the enterprise's future-relevant memory (Theorem (see book)).
  2. Construct enterprise state vectors with declared variables, units, types, and measurement conventions.
  3. Differentiate state variables from enterprise parameters, and explain why the boundary between them is horizon-relative.
  4. Represent enterprises within multidimensional state spaces and read their geometry: admissibility, boundaries, and binding constraints.
  5. Interpret enterprise trajectories, in continuous and discrete time, including their sampling relationship and concatenation algebra.
  6. Identify feasible and infeasible enterprise states, and compute feasible regions as constraint intersections.
  7. Explain enterprise equilibrium, classify its stability informally, and state existence conditions for equilibria.
  8. Define enterprise configuration mathematically and translate configuration questions into vector-space geometry.
  9. Analyze enterprise state transitions, including the flow map that links continuous evolution to discrete epochs.
  10. Prepare enterprise representations for the transformation operator theory of Chapter 6.

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 Enterprise State Representation

    Motivation for Enterprise State Representation

  2. Enterprise State Concepts and the Minimal State

    Enterprise State Concepts and the Minimal State

  3. Enterprise State Variables

    Enterprise State Variables

  4. Enterprise State Spaces and Configurations

    Enterprise State Spaces and Configurations

  5. Enterprise Trajectories and Transitions

    Enterprise Trajectories and Transitions

  6. Equilibrium States

    Equilibrium States

  7. Feasible State Regions

    Feasible State Regions

  8. State Dimension and Visualization

    State Dimension and Visualization

  9. Worked Examples

    Worked Examples

  10. Preparation for Enterprise Transformation

    Preparation for Enterprise Transformation

  11. Chapter Summary

    Chapter Summary

  12. Exercises

    Exercises

  13. 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

18 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 5.

A. Concept checks

  1. 5.1
    Using the touchstone "the state is the memory the future requires," argue for or against state membership of each of the following, in two or three sentences each: (a) cumulative historical R&D spend; (b) the current patent portfolio; (c) last year's reported earnings; (d) the CEO's remaining contract term; (e) a concluded litigation's outcome.
  2. 5.2
    Give two quantities from your own enterprise that are parameters at a one-year horizon and state variables at a ten-year horizon, and one quantity for which the promotion has already happened in your organization's planning practice.
  3. 5.3
    Explain, citing Theorem (see book)(iii) and Example (see book), why a covenant model written with x2<4.5x_2 < 4.5 instead of x2≤4.5x_2 \le 4.5 is not a harmless stylistic choice.
  4. 5.4
    Distinguish an enterprise equilibrium from an enterprise target, and give one example where they coincide and one where a target is deliberately set at a non-equilibrium state.
  5. 5.5
    In your own words: what exactly does Theorem (see book) make non-arbitrary about "the state," and what does it leave as a modeling commitment?

B. Mathematical exercises

  1. 5.6
    Prove the unproved refinements of Proposition (see book): that an arbitrary (possibly infinite) family of convex sets has convex intersection, and that the binding set B(x)\mathcal{B}(\x) is upper hemicontinuous in the following elementary sense: if gj(x)<0g_j(\x) < 0, then j∉B(x′)j \notin \mathcal{B}(\x') for all x′\x' sufficiently near x\x.
  2. 5.7
    Prove that concatenation of discrete trajectories is associative where defined (Proposition (see book)(ii)), and show that the set of trajectories with concatenation forms a category whose objects are states—identifying identities and composition.
  3. 5.8 ★
    Carry out the construction of Theorem (see book) on a miniature behavior: outputs in {0,1}\{0, 1\}, decisions in {a,b}\{a, b\}, no environment, with β\beta defined by "output 1 exactly when the history contains at least two bb's.
  4. 5.9 ★
    Complete the continuation theory of Theorem (see book)(ii): show that the local solution extends to a maximal interval, and that if the maximal interval is bounded, the solution leaves every compact subset of the Lipschitz region.
  5. 5.10
    Derive from (see book) the a posteriori bound ∥xk−x∗∥≤L1−L∥xk−xk−1∥\norm{\x_k - \x^{\ast}} \le \frac{L}{1 - L} \norm{\x_k - \x_{k-1}}, and explain its practical advantage over the a priori bound in monitoring a running transformation program.
  6. 5.11
    Construct a continuous map of [0,1]2[0, 1]^2 into itself with exactly three equilibria, verify the hypotheses of Theorem (see book)(ii), and classify each equilibrium's stability by linearization at the fixed points (using the spectral test of Table (see book)).
  7. 5.12
    Prove that the sampled map ΦΔ\Phi_\Delta of Proposition (see book)(iii) inherits the Lipschitz property from ff on a compact invariant region, with constant at most eLΔe^{L\Delta}, using Gr"onwall's inequality (state and prove the inequality's elementary integral form as part of your answer).

C. Computational exercises

  1. 5.13
    (With AXIOM-05 or the Chapter 5 notebook.
  2. 5.14
    (With AXIOM-05 or the Chapter 5 notebook.
  3. 5.15 ★
    (With the Chapter 5 notebook.

D. Enterprise applications

  1. 5.16
    Produce the Table (see book)-style declaration for your Exercise 4.
  2. 5.17
    Identify the strongest candidate for an operating equilibrium of your enterprise (or a unit of it), state the balancing mechanisms that would make its period map contractive, and estimate—from one observed period-to-period change and a guessed LL—the convergence budget (see book) to within tolerance of steady state.
  3. 5.18
    Write a one-page memo in the voice of Example (see book)'s CFO: name the wall your growth trajectory will meet first, the constraint type it instantiates (Table (see book)), the regime handover you must design for the boundary, and the validity horizon of the current expansive model per Theorem (see book)'s Scope and Limits.

Downloads

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