Skip to content
Dynamic Corporate Transformation

Vol. I, Ch. 3 · Part 1. Foundations · Week 2

Mathematical Foundations

Learning outcomes

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

  1. Apply vector and matrix notation to enterprise models, including coordinates, bases, units, and the scaling transformations that relate alternative representations of the same enterprise state.
  2. Define enterprise state spaces formally, as constrained subsets of finite products of attribute spaces, and construct them for enterprises with mixed continuous, ordinal, and categorical attributes.
  3. Distinguish deterministic from stochastic enterprise representations, and identify the modeling circumstances under which each is adequate.
  4. Interpret mappings and operators—domains, ranges, injectivity, composition, invertibility, and the Lipschitz property—as the mathematical carriers of enterprise transformation.
  5. Apply the DCT notation constitution consistently, and state which mathematical conclusions are invariant to representational choices (bases, units, norms) and which are not.

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. Mathematical Language

    Mathematical Language

  2. Sets and Mappings

    Sets and Mappings

  3. Vector Spaces and Enterprise Vectors

    Vector Spaces and Enterprise Vectors

  4. Matrices and Linear Operators

    Matrices and Linear Operators

  5. Metrics, Norms, and Distances

    Metrics, Norms, and Distances

  6. Enterprise State Spaces

    Enterprise State Spaces

  7. Deterministic and Stochastic Models

    Deterministic and Stochastic Models

  8. Chapter Summary

    Chapter Summary

  9. Exercises

    Exercises

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

16 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 3.

A. Concept checks

  1. 3.1
    Type-check each expression against the notation hierarchy, marking it well-formed or ill-formed and correcting the ill-formed: (a) Ax+u\mathbf{A}\x + \uc; (b) x+A\x + \mathbf{A}; (c) x ⁣⊤Ax\x^{\!\top}\mathbf{A}\x; (d) T≤X\Top \le \Xc; (e) d(x,Tx′)d(\x, \Top\x'); (f) rank⁡(x)\rank(\x).
  2. 3.2
    Give one enterprise mapping that is injective but not surjective, one surjective but not injective, and one bijective, drawing all three from reporting, transformation, or diagnosis contexts, and state in one sentence each what the property means for its context.
  3. 3.3
    Explain, with two concrete operators, why transformation operators are defined with explicit domains rather than as total maps, and what modeling error the total-map convention would smuggle in.
  4. 3.4
    For each situation, argue in two or three sentences whether a deterministic or stochastic model is the appropriate regime (Table (see book)): (a) capacity planning one quarter ahead in a utility; (b) sizing a liquidity buffer against funding shocks; (c) sequencing the workstreams of an ERP migration; (d) pricing a multi-year technology bet.

B. Mathematical exercises

  1. 3.5
    Prove: for any mapping f:A→Bf: \mathcal{A} \to \mathcal{B} and subsets T1,T2⊆B\mathcal{T}_1, \mathcal{T}_2 \subseteq \mathcal{B}, f−1(T1∩T2)=f−1(T1)∩f−1(T2)f^{-1}(\mathcal{T}_1 \cap \mathcal{T}_2) = f^{-1}(\mathcal{T}_1) \cap f^{-1}(\mathcal{T}_2), and show by counterexample that the analogous identity for images, f(S1∩S2)=f(S1)∩f(S2)f(\mathcal{S}_1 \cap \mathcal{S}_2) = f(\mathcal{S}_1) \cap f(\mathcal{S}_2), can fail.
  2. 3.6
    Verify the monoid axioms of Theorem (see book)(i) in detail for total operators, and exhibit a natural enterprise operator that is not injective, explaining which distinct states it merges and why the merger is economically irreversible.
  3. 3.7
    Show that the bound L2L1L_2 L_1 of Theorem (see book)(ii) is tight for linear operators (equality for suitable T1\Top_1, T2\Top_2) and strict for a pair of your construction.
  4. 3.8
    Establish the sharp sandwich constants between ∥⋅∥1\norm{\cdot}_1 and ∥⋅∥∞\norm{\cdot}_\infty on Rn\R^n: ∥x∥∞≤∥x∥1≤n∥x∥∞\norm{\x}_\infty \le \norm{\x}_1 \le n \norm{\x}_\infty, identifying the vectors attaining each bound.
  5. 3.9
    Complete the proof of Proposition (see book): verify each metric axiom for dWd_{\mathbf{W}} line by line, and determine whether dWd_{\mathbf{W}} remains a metric when W\mathbf{W} is (a) diagonal with one zero entry, (b) a general invertible matrix.
  6. 3.10 ★
    For affine operators Tix=Aix+bi\Top_i\x = \mathbf{A}_i\x + \mathbf{b}_i (i=1,2i = 1, 2) on Rn\R^n, derive the exact condition under which T1∘T2=T2∘T1\Top_1 \circ \Top_2 = \Top_2 \circ \Top_1, separating a matrix condition from a vector condition.
  7. 3.11 ★
    For Example (see book): verify the stated eigenvalues, compute ρ(A)\rho(\mathbf{A}), and determine the steady state xˉ\bar{\x} under constant investment uk≡uˉ=10u_k \equiv \bar{u} = 10 by solving xˉ=Axˉ+Buˉ\bar{\x} = \mathbf{A}\bar{\x} + \mathbf{B}\bar{u}.
  8. 3.12
    In Theorem (see book), replace the one-hot embedding of a categorical attribute with an arbitrary injective assignment of distinct real numbers to categories.

C. Computational exercises

  1. 3.13
    (With AXIOM-03 or the Chapter 3 notebook.
  2. 3.14
    (With AXIOM-03 or the Chapter 3 notebook.

D. Enterprise applications

  1. 3.15
    Extend your enterprise state vector from Exercise 2.
  2. 3.16 ★
    Model a merger of two enterprises with state spaces XA⊆RnA\Xc^{A} \subseteq \R^{n_A} and XB⊆RnB\Xc^{B} \subseteq \R^{n_B} as a transformation operator on the product space XA×XB\Xc^{A} \times \Xc^{B} into a combined space XAB\Xc^{AB}.

Downloads

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