From simulations to possible behaviors

Build a map from biochemical structure to dynamical function: dimension decides what a vector field can do, and chemistry decides which vector fields a cell can have.

Reopen the reaction-system playground

A constitutively produced protein obeys x˙=μλx\dot x=\mu-\lambda x, with fixed production μ=2.0\mu=2.0 concentration units per hour. Move a parameter, predict the new crossing, then compare with the simulated trajectory.

The computed steady level and recovery time appear here.

You can already do something powerful. Write reactions, assemble x˙=Γv(x)\dot x=\Gamma v(x), integrate the equations, move a slider and watch the behavior change. If that were enough, this course could end here. It is not enough, and the reason is not that simulation is bad. A simulation answers one very precise question about one declared model, parameter point and initial state.

The lecture in one sentence

You cannot exhaust unknown mechanisms or high-dimensional behavior one run at a time, so we need structural statements: dimension removes whole classes of behavior, and chemical organization removes most of the vector fields that mathematics would otherwise allow.

0–5 min
Opening. Reopen a reaction-system simulation and collect what it can and cannot answer.
5–13 min
Simulation limit. Separate missing mechanisms from combinatorial explosion.
13–18 min
Goal. Draw the map from structure to function.
18–27 min
One dimension. Coordinate addition and removal, f(x)f(x), a phase line and x(t)x(t).
27–36 min
Memory. Construct two stable states from three crossings.
36–44 min
Bifurcation. Make tangency, hysteresis and critical slowing visible.
44–56 min
Two dimensions. Build the biological toggle before drawing its nullclines.
56–62 min
Dimension boundary. See why the plane has a short catalogue and three dimensions do not.
62–73 min
Local retreat. Write the linearized system, use Hurwitz and read the Jacobian as wiring.
73–81 min
Global retreat. Let energy settle a case where the Jacobian is silent.
81–87 min
Chemistry. Apply positivity, parameter independence and constrained kinetics.
87–90 min
Return. Fill in the structure-to-function map and read the price list forward.
90–95 min
Lecturer addendum. Connect the team's chosen network to the rest of the course.
If the room runs behind

First omit the high-dimensional example in section 7, then the dual-rail construction in section 10, the clickable toggle, the four-portrait gallery and the exact blow-up clock, in that order. Keep the opening playground, both structure-to-function maps, addition against removal, the three-crossing construction, all three saddle-node fields, the biological toggle network, z˙=Az\dot z=Az, the Hurwitz rule, the energy derivative, positivity and the timescale-separation handoff.

Part 1

Why analyze?

Simulation gives a member of a family. The useful design question concerns the family.

1You can already simulate. Why is that not enough?

One trajectory is exact for the model that generated it. It cannot report a mechanism the model omitted, and it cannot exhaust a large family of parameters and initial states.

In the opening model, xx is protein concentration, μ\mu is its constant production rate, λ\lambda is its first-order removal rate, and x0=x(0)x_0=x(0) is the initial concentration. Production balances dilution or degradation at x=μ/λx^{*}=\mu/\lambda, and direct integration gives

x˙=μλx,x=μλ,x(t)=x+(x0x)eλt.\dot x=\mu-\lambda x,\qquad x^{*}=\frac{\mu}{\lambda},\qquad x(t)=x^{*}+(x_0-x^{*})e^{-\lambda t}.(1)

The slider therefore changes two things together: the crossing moves as 1/λ1/\lambda, and the recovery time changes as 1/λ1/\lambda. The canvas is useful precisely because the mechanism and solution are already declared.

Limit 1: the discarded mechanism is not in the run

A cellular model is built by compression. Several elementary binding states become one effective Hill curve. Transcription and translation become one composite production arrow. A conserved pool may be removed from the coordinates. Each step says that some hidden process is fast, fixed or irrelevant to the chosen observable. A run cannot tell us what the discarded process would have changed, because that process is absent from the equations being run. We need claims that survive a class of omitted details.

Limit 2: the family is too large to enumerate

Ten uncertain parameters sampled at only ten settings already require 10×10××10=101010\times10\times\cdots\times10=10^{10} parameter combinations, before sampling any initial condition. Finer grids multiply the problem without proving what happens between grid points. We need statements such as “every field with this sign pattern is stable” or “no scalar autonomous system can oscillate.” Those cover infinitely many numerical runs at once.

Room check. Move λ\lambda from 0.5 to 1.0. Before looking at the curve, predict the new steady level and the factor by which the relaxation time changes. Then name one biological change that the slider does not represent.

2What we actually want: structure to function

The valuable arrows connect coarse structural facts to qualitative functions. Exact parameters remain essential when the question is an exact time trace.

The map we want: from structure to function STRUCTURE FUNCTION coarse coarse interaction graph admissible region; bounded? ? signs and invariant pools stable fixed point? ? response-curve shape how many states; switch or cycle? ? parameter values + initial state period, amplitude, one trajectory ? more detail more detail One simulation connects the bottom row. Which upper arrows can we justify?
Figure 1. The question that organizes the lecture. The bottom arrow is ordinary simulation: parameters and an initial condition produce one path. The upper arrows are harder and more useful because each must remain valid across a family of models.

The left hierarchy moves from coarse structure to detail: which species interact, the signs of those interactions and conserved pools, the shapes of effective response curves, then exact parameters and the initial state. The right hierarchy moves from coarse function to detail: what state space is admissible and whether motion stays bounded, whether a steady state is stable, whether there are multiple states or a cycle, then the exact period, amplitude and trajectory.

The first promised upper arrow is concrete: whether a one-variable gene circuit can remember does not depend on knowing every rate constant. It depends first on whether a regulated addition curve, here protein production, can cross its removal curve, here dilution, three times. Sections 3 and 4 will construct that statement. Exact rate constants then decide where the crossings lie and how fast each state is approached.

Structural does not mean vague

A structural claim names the information it uses and the family over which the conclusion holds. “The fixed point is stable for these numbers” is numerical. “Every continuously differentiable scalar field with this sign on these intervals has the same basins” is structural. Both can be rigorous, but they answer different questions.

Part 2

Design in one dimension

Addition and removal turn roots into crossings, crossings into basins and a deformation of crossings into a bifurcation.

3One dimension: a fixed point is a crossing

For a cellular concentration, write the net rate as a nonnegative addition term minus a nonnegative removal term. Stability becomes a comparison of slopes at their crossing.

Let x0x\ge0 be one concentration. Write its total addition rate as f+(x)0f^{+}(x)\ge0, its total removal rate as f(x)0f^{-}(x)\ge0, and its net rate as f(x)f(x):

x˙=f+(x)f(x)=f(x).\dot x=f^{+}(x)-f^{-}(x)=f(x).(2)

A fixed point xx^{*} is an addition-removal crossing, f+(x)=f(x)f^{+}(x^{*})=f^{-}(x^{*}). Just to its right, removal must win for motion to point back; just to its left, addition must win. At a simple crossing this is the slope condition f(x)=(f+)(x)(f)(x)<0f'(x^{*})=(f^{+})'(x^{*})-(f^{-})'(x^{*})<0.

This split uses the physical domain of a concentration: x0x\ge0, and both accounting terms are nonnegative. A mechanical coordinate such as spring displacement is signed, and its restoring term kq-kq need not be separated into nonnegative addition and removal. The distinction is structural, not cosmetic. Section 10 returns to the restrictions imposed by chemical state variables.

  1. Plot f(x)f(x), or plot f+(x)f^{+}(x) and f(x)f^{-}(x) and compare them.
  2. Mark every zero of ff.
  3. On each interval between zeros, draw motion right for f>0f>0 and left for f<0f<0.
  4. Translate the phase line into time traces from several initial conditions. The traces must approach, depart or escape exactly as the arrows predict.
One scalar field, three coordinated views
f(x) against xf(x)\text{ against }x
phase line
x(t) from several x0x(t)\text{ from several }x_{0}
decay
x˙=x\dot x=-x
one attractor; every initial condition decays -2 -1 1 2 -2 2
xx
f(x)f(x)
0 1 2 3 -2 -1 1 2
tt
xx
nonhyperbolic growth
x˙=x2\dot x=x^{2}
toward zero from the left; finite-time escape on the right -2 -1 1 2 1 2 3 4
xx
f(x)f(x)
0 1 2 3 -2 -1 1 2 3
tt
xx
bistable switch
x˙=(x1)(x2)(x3)\dot x=-(x-1)(x-2)(x-3)
two attractors and one threshold; memory without a cycle 1 2 3 -2 2
xx
f(x)f(x)
1 2 3 1 2 3 4 1 2 3
tt
xx
filled teal: attracting · open coral: repelling · open lime: one-sided attraction
Figure 2. Keep all three views of every example. Each row shows f(x)f(x), its induced phase line and several trajectories x(t)x(t). The first two views determine direction, fixed points and basins. The time panel also reveals approach rates and finite-time escape.

For x˙=x\dot x=-x, the field crosses with negative slope, both arrows point to zero and every trajectory decays exponentially. For x˙=x2\dot x=x^2, the field only touches zero. The origin attracts from the left and repels from the right, so f(0)=0f'(0)=0 cannot classify it. Separating variables gives

x(t)=x01x0t.x(t)=\frac{x_0}{1-x_0t}.(3)

When x0>0x_0>0, escape occurs at t=1/x0t=1/x_0. The phase line got the direction right but carried no clock. This signed mathematical example is not yet a closed concentration model; section 10 will make that boundary explicit.

The third row has two attracting roots separated by one repelling threshold. It also proves the first impossibility result. Between consecutive roots the sign of ff cannot change, so a nonstationary scalar trajectory is monotone there. To return to an earlier value it would have to reverse direction, which requires crossing a zero, but a unique trajectory cannot cross a fixed point. A scalar autonomous system can switch, but it cannot sustain a nonconstant cycle.1

This is the first structural arrow. Deform the addition or removal curve without changing the number, order and transverse character of their crossings, and the same phase-line portrait survives. The exact trajectories change; the qualitative basins do not.

4To remember, cross three times

Memory is a construction problem. Two persistent states require stable, unstable, stable crossings, so the regulated addition curve must locally outrun removal and later saturate.

Consider a positively autoregulated gene whose protein activates its own production. Fast redistribution among promoter states is compressed into an activating Hill fraction, while protein removal is dominated by first-order dilution. In dimensionless concentration xx and dimensionless time τ\tau, one concrete teaching model is

dxdτ=0.15+3x41+x4f+(x): basal + activated productionxf(x): dilution removal.\frac{dx}{d\tau}=\underbrace{0.15+\frac{3x^4}{1+x^4}}_{f^{+}(x)\text{: basal + activated production}}-\underbrace{x}_{f^{-}(x)\text{: dilution removal}}.(4)

The Hill term is a lumped effective law. It assumes promoter binding or redistribution is fast relative to protein accumulation, and the exponent represents the chosen cooperative occupancy model. It is not an elementary four-molecule collision and it is not a universal law for activation.

To remember, make addition cross removal three times what the shape must buy 1 2 3 1 2 3
xx
rate\text{rate}
addition production removal dilution 0.15 0.68 3.12 low-state basin high-state basin 1 positive feedback production must rise with x 2 enough steepness it must outrun removal locally 3 saturation it must flatten and cross back
x˙=0.15+3x41+x4x\dot x=0.15+\frac{3x^{4}}{1+x^{4}}-x
The parameters place the crossings. The shape creates the possibility.
Figure 3. Binary memory is three addition-removal crossings. The calculated crossings are near 0.15, 0.68 and 3.12. The outer two attract; the middle one is the threshold. A transient input is remembered only if it pushes the state across that threshold into the other basin.

The design logic does not begin with those four numbers. It begins with shape. Basal production keeps the low state away from zero. Positive feedback makes production rise. Sufficient effective cooperativity lets its slope exceed the removal slope over an interval. Saturation makes it flatten so removal can win again. In this construction, memory is bought with a sufficiently steep cooperative response. Other molecular mechanisms can create the required sigmoid, so cooperativity is a route to the shape rather than a proof of one unique mechanism.

Design check. Sketch a monotonically increasing addition curve that never becomes steeper than the removal line. Can it cross three times? Now make it steep but remove saturation. Which crossing is lost?

5When two curves touch, a switch is born

A saddle-node bifurcation is a tangency in the addition-removal picture. Draw the vector field below, at and above tangency before stacking those cases into branches.

Let rr be a control parameter and let xx be a signed local displacement from the collision point. The saddle-node normal form is

x˙=f(x;r)=rx2.\dot x=f(x;r)=r-x^2.(5)

In the underlying biological picture, two curves touch when both their values and slopes agree:

f+(x;r)=f(x;r),f+x(x;r)=fx(x;r).f^{+}(x^{*};r^{*})=f^{-}(x^{*};r^{*}),\qquad \frac{\partial f^{+}}{\partial x}(x^{*};r^{*})=\frac{\partial f^{-}}{\partial x}(x^{*};r^{*}).(6)
A bifurcation is a family of vector fields
r<0r<0
-1 1 -1 1
xx
f(x;r)f(x;r)
no fixed point; every arrow points left
r=0r=0
-1 1 -1 1
xx
f(x;r)f(x;r)
one double root; attraction from the right only
r>0r>0
-1 1 -1 1
xx
f(x;r)f(x;r)
one unstable root and one stable root Stack the cases: equilibrium position against parameter -1 -0.5 0.5 1 1.5 -1 1
rr
xx^{*}
stable:x=+r\text{stable:}\quad x^{*} = +\sqrt{r}
f=2rf' = -2\sqrt{r}
unstable:x=r\text{unstable:}\quad x^{*} = -\sqrt{r}
f=+2rf' = +2\sqrt{r}
no equilibrium for r<0\text{no equilibrium for }r < 0
collision at r=0\text{collision at }r = 0
r=0.01:τ=5r = 0.01:\quad \tau = 5
r=1:τ=0.5r = 1:\quad \tau = 0.5
relaxation time τ=1/(2r): a hundredfold approach in r is a tenfold slowing\text{relaxation time }\tau = 1/(2\sqrt{r})\text{: a hundredfold approach in }r\text{ is a tenfold slowing}
Figure 4. The bifurcation is visible in three graphs of f(x;r)f(x;r) against xx. For r<0r<0 there is no root. At r=0r=0 the field touches zero. For r>0r>0 it crosses twice, creating one unstable and one stable fixed point. The lower diagram stacks exactly those cases.

For r>0r>0, the roots are x=±rx^{*}=\pm\sqrt r. Since fx=2xf_x=-2x, the positive root is stable and the negative root is unstable. At r=0r=0 they collide, and for r<0r<0 neither remains. The fold creates one stable-threshold pair; when another stable branch already exists elsewhere, that event opens or closes a bistable switching range. A bifurcation is this change in the organization of all trajectories, not merely a bend in one plotted path.

Two experimental signatures

Hysteresis. A full sigmoidal switch commonly has two folds. Increasing an input destroys one state at one fold; decreasing it destroys the other state at the other fold. The switching threshold therefore depends on direction and history.

Critical slowing. Near the stable root, let u=xru=x-\sqrt r be a small displacement. Its linear term is u˙=2ru\dot u=-2\sqrt r\,u, hence

u(t)u(0)e2rt,τrelax=12r.u(t)\approx u(0)e^{-2\sqrt r\,t},\qquad \tau_{\mathrm{relax}}=\frac{1}{2\sqrt r}.(7)

Moving from r=1r=1 to r=0.01r=0.01 changes the relaxation time from 0.5 to 5. A hundredfold approach to the fold gives a tenfold slowing in this normal form. That timing prediction can be tested, provided noise, sampling and the valid parameter range are checked.2

Part 3

What dimension permits

A second coordinate permits rotation and a saddle separatrix. A third removes the planar packing restriction.

6A second variable buys going around

In a plane, trajectories can turn around fixed points and a saddle can separate basins. Nullclines make those motions readable as addition-removal balances for individual species.

The nullcline of species ii is the set where its total addition equals its total removal, so its own derivative is zero there. A trajectory crosses that curve using the other component. Only an intersection of all nullclines is a fixed point. This is the right place to build a biological two-variable switch.

Let gene GXG_X produce repressor XX and gene GYG_Y produce repressor YY. Protein XX represses production from GYG_Y; protein YY represses production from GXG_X. Both proteins are lost through molecular degradation, growth dilution or both. At the composite level,

GXGX+X,X,GYGY+Y,Y,YGX,XGY.G_X\rightsquigarrow G_X+X,\quad X\rightarrow\varnothing,\qquad G_Y\rightsquigarrow G_Y+Y,\quad Y\rightarrow\varnothing,\qquad Y\dashv G_X,\quad X\dashv G_Y.(8)
The toggle is a biological reaction network before it is an ODE composite circuit one arm opened: what the Hill term hides
GXG_X
XX
GYG_Y
YY
  X\rightsquigarrow\;X
  Y\rightsquigarrow\;Y
\varnothing
\varnothing
δXX\delta_X X
δYY\delta_Y Y
YGXY\dashv G_X
XGYX\dashv G_Y
The squiggly arrows are lumped expression. Removal may combine molecular degradation and growth dilution. fast promoter redistribution
GX+nYYCGXYG_X+n_Y Y\leftrightsquigarrow C_{G_XY}
qGX=GX+CGXYq_{G_X}=G_X+C_{G_XY}
slow composite expression and removal
GXGX+X,XG_X\rightsquigarrow G_X+X,\qquad X\rightsquigarrow\varnothing
after fast equilibration and lumping
GXqGX=11+(Y/KY)nY\frac{G_X}{q_{G_X}}=\frac{1}{1+(Y/K_Y)^{n_Y}}
X˙=αX1+(Y/KY)nYδXX\dot X=\frac{\alpha_X}{1+(Y/K_Y)^{n_Y}}-\delta_X X
The Y arm is the same construction with X and Y exchanged. The Hill exponent is an effective occupancy parameter here, not an elementary reaction molecularity.
Figure 5. Begin with the biological circuit, then open one composite arrow. Fast redistribution of a conserved promoter pool, followed by slower transcription and translation, can leave a repressive occupancy function as an effective protein-production law. The Hill exponent belongs to that approximation, not to an assumed elementary molecularity.

For the arm producing XX, let GXG_X be free promoter, CGXYC_{G_XY} its complex with repressor YY, qGXq_{G_X} the conserved promoter total, KYK_Y an effective repression scale and nYn_Y an effective cooperativity. A rapid-equilibrium occupancy model writes

CGXYGX=(YKY)nY,qGX=GX+CGXY.\frac{C_{G_XY}}{G_X}=\left(\frac{Y}{K_Y}\right)^{n_Y},\qquad q_{G_X}=G_X+C_{G_XY}.(9)

Solving for the free promoter fraction gives

GXqGX=11+(Y/KY)nY.\frac{G_X}{q_{G_X}}=\frac{1}{1+(Y/K_Y)^{n_Y}}.(10)

If promoter redistribution is fast relative to expression and composite production is proportional to the free promoter fraction, then the slow protein concentrations obey

X˙=αX1+(Y/KY)nYδXX,Y˙=αY1+(X/KX)nXδYY.\dot X=\frac{\alpha_X}{1+(Y/K_Y)^{n_Y}}-\delta_X X,\qquad \dot Y=\frac{\alpha_Y}{1+(X/K_X)^{n_X}}-\delta_Y Y.(11)

Here αX,αY\alpha_X,\alpha_Y are maximal production rates; KX,KYK_X,K_Y are repression scales; nX,nYn_X,n_Y are effective cooperativities; and δX,δY\delta_X,\delta_Y combine degradation and dilution. Equation (11) is not elementary mass action. It is a reduced law for a specific biological scenario, and its assumptions stay attached.

Scale concentrations by repression constants and time by a common removal time. A symmetric teaching case is

x˙=41+y2x,y˙=41+x2y,x,y0.\dot x=\frac{4}{1+y^2}-x,\qquad \dot y=\frac{4}{1+x^2}-y,\qquad x,y\ge0.(12)
  1. Set x˙=0\dot x=0: x=4/(1+y2)x=4/(1+y^2). Horizontal motion pauses on this xx-nullcline.
  2. Set y˙=0\dot y=0: y=4/(1+x2)y=4/(1+x^2). Vertical motion pauses on this yy-nullcline.
  3. At every intersection, both components vanish. Testing one point in each region supplies the arrow directions.
  4. The two outer intersections attract. The middle intersection is a saddle, and its stable manifold is the basin boundary. Symmetry makes the diagonal x=yx=y invariant here.
1 2 3 4 1 2 3 4
xx
yy
the three equilibria, found by bisection
(0.2679,  3.7321)(0.2679,\; 3.7321)
λ=0.5000,  1.5000stable node\lambda = -0.5000,\; -1.5000\quad\cdot\quad \text{stable node}
(1.3788,  1.3788)(1.3788,\; 1.3788)
λ=+0.3106,  2.3106saddle\lambda = +0.3106,\; -2.3106\quad\cdot\quad \text{saddle}
(3.7321,  0.2679)(3.7321,\; 0.2679)
λ=0.5000,  1.5000stable node\lambda = -0.5000,\; -1.5000\quad\cdot\quad \text{stable node}
teal: x˙=0, where x pauses\text{teal: }\dot x = 0\text{, where }x\text{ pauses}
coral: y˙=0, where y pauses\text{coral: }\dot y = 0\text{, where }y\text{ pauses}
dashed: the separatrix, the saddle's stable manifold and the basin boundary A transient must cross it to switch. A steep response alone will not.
Figure 6. Two balance curves become a cellular decision. Filled points are the two opposing expression states. The open middle point is a saddle. A perturbation switches the cell only when it crosses the dashed separatrix; a steep response by itself is not yet bistability.

Working phase portrait · click to launch a trajectory

The equations are exactly (12). Nullclines and the separatrix stay fixed; each click supplies one initial condition. Predict the basin before launching the path.

Click inside the square. The endpoint will be assigned to the nearest stable expression state.

A mutual-repression toggle was built in Escherichia coli using two repressors and two chemical inputs to set the state.3 Equation (12) is a teaching reduction, not a fit to that device. What transfers is the dynamical claim: two attractors, their basins and a separating threshold make history matter.4

7A curve packs freely in three dimensions

Trajectories cannot cross, but the force of that rule depends on dimension. A line orders motion; a closed curve separates a plane; a curve in space can pass around itself.

Uniqueness costs more where there is less room one dimension two paths cannot swap, so each one's limit is the fixed point beside it order is permanent two dimensions no path crosses the orbit, so inside and outside are separate fates the cycle is a wall three dimensions flattened into a plane this orbit would have to cross itself room to pass behind 1 2 3 1 2 3 1 2 3
tt
xx
threshold
r=1r=1
from inside from outside a break marks the strand its own z puts behind
Figure 7. The dimension boundary is geometric. In one dimension a trajectory is ordered between fixed points. In a plane an isolated closed orbit separates inside from outside. In three dimensions a trajectory has room to wind, braid and pass around itself without violating uniqueness.

This packing argument explains why one-dimensional behavior is almost completely read from signs and why generic planar fixed points and bounded recurrent behavior have a short qualitative catalogue: nodes, saddles, spirals, centers and isolated cycles. In a bounded planar region, the Poincaré–Bendixson theorem can turn “no fixed point remains in the limiting set” into the existence of a periodic orbit. Its hypotheses concern a two-dimensional invariant set; they do not automatically apply to a three-species network.

A three-repressor ring illustrates the new room:

p˙i=α1+pi1npi,i=1,2,3(indices modulo 3).\dot p_i=\frac{\alpha}{1+p_{i-1}^{n}}-p_i,\qquad i=1,2,3\quad(\text{indices modulo }3).(13)

Here pip_i is the dimensionless level of repressor ii, α\alpha is maximal production and nn is effective cooperativity. This cyclic wiring was realized as the repressilator, and later designs improved the persistence and synchronization of the oscillation.56 Three dimensions also permit chaos, but permission is not a mechanism: lack of structure is not a structure. When general geometry becomes permissive, we retreat to local structure and global certificates.

Part 4

Two structural retreats

Near one fixed point, keep the first derivative. When that derivative is silent, seek a scalar quantity that the full dynamics cannot increase.

8Close to a fixed point, every network is linear

The Jacobian is not merely a table of derivatives. Evaluated at one fixed point, it is the matrix of a new first-order dynamical system for small displacements.

Lecture 3 ended with the cell as a crowded chemical plant and with a question that balance alone could not answer: after a perturbation, does a steady state recover? Stability is the first requirement for a persistent operating point and the local prerequisite for discussing thresholds, switches and cycles. The first retreat from an unmanageable model family is therefore to keep only what every smooth network looks like near one fixed point.

Let the state vector xx obey x˙=F(x)\dot x=F(x), and let xx^{*} be a fixed point with F(x)=0F(x^{*})=0. Define the displacement vector u=xxu=x-x^{*}. Taylor expansion gives

u˙=Au+R(u),A=J(x)=Fxx,R(u)u0 as u0.\dot u=A u+R(u),\qquad A=J(x^{*})=\left.\frac{\partial F}{\partial x}\right|_{x^{*}},\qquad \frac{\|R(u)\|}{\|u\|}\longrightarrow0\ \text{as }u\to0.(14)

The matrix entry AijA_{ij} is the derivative of component FiF_i with respect to state xjx_j, evaluated at the fixed point. The canonical linearized system discards the higher-order remainder and uses a new displacement vector zz:

ddt[z1z2]=A[z1z2],A=J(x)=[a11a12a21a22].\boxed{\frac{d}{dt}\begin{bmatrix}z_1\\z_2\end{bmatrix}=A\begin{bmatrix}z_1\\z_2\end{bmatrix}},\qquad A=J(x^{*})=\begin{bmatrix}a_{11}&a_{12}\\a_{21}&a_{22}\end{bmatrix}.(15)

Equation (15), not the derivative array alone, is the linearization. It describes nearby displacement from one fixed point. A different fixed point generally produces a different matrix.

If Aw=λwAw=\lambda w, motion along eigenvector ww has scalar amplitude a(t)a(t) satisfying a˙=λa\dot a=\lambda a. Thus

z(t)=jcjeλjtwj.z(t)=\sum_j c_j e^{\lambda_j t}w_j.(16)

The real part of λj\lambda_j sets the exponential envelope; its imaginary part sets rotation. Negative real part shrinks a mode, positive real part grows it. Every small displacement is assembled from the modes, so all of them must shrink for the fixed point to recover from every small perturbation.

Hurwitz rule

A real matrix AA is Hurwitz exactly when Reλj(A)<0\operatorname{Re}\lambda_j(A)<0 for every eigenvalue. Then z=0z=0 is globally exponentially asymptotically stable for z˙=Az\dot z=Az. If A=J(x)A=J(x^{*}) for a continuously differentiable nonlinear system, the fixed point xx^{*} is locally exponentially asymptotically stable. One eigenvalue with positive real part proves instability. A zero real part leaves the nonlinear case undecided.

For a real two-by-two matrix, let τ=trA\tau=\operatorname{tr}A, Δ=detA\Delta=\det A and D=τ24ΔD=\tau^2-4\Delta. Since the eigenvalues sum to τ\tau and multiply to Δ\Delta,

A is Hurwitzτ<0 and Δ>0.\boxed{A\text{ is Hurwitz}\quad\Longleftrightarrow\quad \tau<0\ \text{and}\ \Delta>0.}(17)

The intuition is direct. A negative determinant means two real eigenvalues of opposite sign, so one direction grows. A positive determinant puts both real eigenvalues on the same side, or gives a conjugate pair. A negative trace then places their sum, and therefore both real parts, on the decaying side.

For the toggle in equation (12),

J(x,y)=[18y(1+y2)28x(1+x2)21].J(x,y)=\begin{bmatrix}-1&-\dfrac{8y}{(1+y^2)^2}\\[7pt]-\dfrac{8x}{(1+x^2)^2}&-1\end{bmatrix}.(18)

Growth dilution contributes a term λixi-\lambda_i x_i to a concentration equation and therefore contributes λi-\lambda_i to the corresponding diagonal entry before other interactions are added. It supplies local self-removal, but it is not a universal stability guarantee. In the toggle, the negative diagonal is protein removal and the two negative off-diagonal entries are mutual repression. In any biochemical model, AijA_{ij} asks how species jj changes species ii's net rate. The sign pattern of the Jacobian is the local wiring diagram.

toggle fixed point (x,y)(x^{*},y^{*})eigenvalues of AAlocal conclusion
(0.2679,3.7321)(0.2679,3.7321)−0.5, −1.5stable node, low XX / high YY
(1.3788,1.3788)(1.3788,1.3788)+0.3106, −2.3106saddle, threshold state
(3.7321,0.2679)(3.7321,0.2679)−0.5, −1.5stable node, high XX / low YY
-3 -2 -1 1 2 3 -1 1 2 3
trace τ\text{trace }\tau
determinant Δ\text{determinant }\Delta
stable spirals unstable spirals stable nodes unstable nodes
Δ<0: saddle, always unstable\Delta < 0\text{: saddle, always unstable}
D=τ24Δ=0D = \tau^{2} - 4\Delta = 0
toggle: two stable states toggle threshold
τ=0,  Δ>0: pure imaginary pair, nonlinear case undecided\tau = 0,\; \Delta > 0\text{: pure imaginary pair, nonlinear case undecided}
Every point on the positive Δ axis is a linear centre, and section 7 is about what that does not settle.\text{Every point on the positive }\Delta\text{ axis is a linear centre, and section 7 is about what that does not settle.}
The parabola is where the discriminant vanishes: above it eigenvalues are complex, below it they are real.
The four pictures are conclusions from eigenvalues, not decorations stable node
λ=0.5,  2\lambda = -0.5,\; -2
every direction contracts along the slow eigenvector saddle
λ=+1,  1\lambda = +1,\; -1
in along one eigenvector, out along the other stable spiral
λ=1±i2\lambda = -1 \pm i\sqrt{2}
rotation plus exponential contraction linear centre
λ=±i\lambda = \pm i
closed orbits, but only the nonlinear terms decide
Figure 8. A matrix has both a location and a local portrait. In the upper panel, Hurwitz occupies τ<0\tau<0, Δ>0\Delta>0; the symmetric toggle's two stable states share one point and its threshold lies in the saddle region. The lower panel shows the corresponding modal geometry. A center remains a boundary case whose nonlinear fate needs more information.
Scope of the Jacobian

A Hurwitz Jacobian proves local attraction near one hyperbolic fixed point. It does not locate every fixed point, draw a global basin boundary, establish boundedness or rule out a remote attractor. At the toggle saddle, an eigenvector gives only the tangent to the separatrix. The global curve still belongs to the nonlinear system.1

9When the linear test says nothing

Identical purely imaginary Jacobians can hide attraction, neutral cycles or repulsion. A monotone scalar function can settle what the discarded nonlinear terms do.

Compare three systems written in polar radius rr and angle θ\theta:

r˙=r3,θ˙=1spiral inward,r˙=0,θ˙=1remain on a circle,r˙=+r3,θ˙=1spiral outward.\begin{aligned}\dot r&=-r^3,&\dot\theta&=1&&\text{spiral inward},\\\dot r&=0,&\dot\theta&=1&&\text{remain on a circle},\\\dot r&=+r^3,&\dot\theta&=1&&\text{spiral outward}.\end{aligned}(19)

At the origin, all three have Jacobian [0110]\left[\begin{smallmatrix}0&-1\\1&0\end{smallmatrix}\right] and eigenvalues ±i\pm i. The cubic radial term is invisible at first order and decides three different fates.

The spring now enters with two jobs in the same narrative: it explains what a state must contain, and its energy supplies a global certificate. Let qq be displacement, mm mass, kk spring stiffness and cc viscous drag. Force balance gives

mq¨+cq˙+kq=0.m\ddot q+c\dot q+kq=0.(20)

Position alone is not a state because the mass may pass the same qq moving left or right. Set v=q˙v=\dot q and let the state vector be z=(q,v)z=(q,v). The second-order equation becomes an autonomous first-order system:

ddt[qv]=[v(k/m)q(c/m)v]=[01k/mc/m][qv].\frac{d}{dt}\begin{bmatrix}q\\v\end{bmatrix}=\begin{bmatrix}v\\-(k/m)q-(c/m)v\end{bmatrix}=\begin{bmatrix}0&1\\-k/m&-c/m\end{bmatrix}\begin{bmatrix}q\\v\end{bmatrix}.(21)

This conversion is exact, not a linearization. More generally, a higher-order law or a process with memory becomes first order by enlarging the state until the present determines the instantaneous future. Hidden promoter states and delayed intermediates pose the same modeling question.

Define the mechanical energy

E(q,v)=12mv2+12kq2.E(q,v)=\frac12mv^2+\frac12kq^2.(22)

Differentiate along the full dynamics:

E˙=mvv˙+kqq˙=v(kqcv)+kqv=cv20.\dot E=mv\dot v+kq\dot q=v(-kq-cv)+kqv=-cv^2\le0.(23)

With c=0c=0, energy is conserved and each nonzero initial condition stays on its own ellipse. The origin is stable but not attracting. With c>0c>0, energy never increases. The derivative is zero on the entire line v=0v=0, so strict decrease cannot be claimed. But at any point on that line with q0q\ne0, v˙=(k/m)q0\dot v=-(k/m)q\ne0; the trajectory immediately leaves. Only the origin remains invariant there, so LaSalle's invariance argument gives convergence.

Same Jacobian at the origin:J=[0110],λ=±i\text{Same Jacobian at the origin:}\quad J = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix},\quad \lambda = \pm i
r˙=r3,  θ˙=1\dot r = -r^{3},\; \dot\theta = 1
asymptotically stable the cubic term drains the radius
r˙=0,  θ˙=1\dot r = 0,\; \dot\theta = 1
centre the radius is exactly conserved
r˙=+r3,  θ˙=1\dot r = +r^{3},\; \dot\theta = 1
unstable one clean outward spiral shows growth All three are invisible to the Jacobian. Only the cubic term decides.
The spring connects state, phase space, and Lyapunov reasoning
mm
qq
mq¨+cq˙+kq=0m\ddot q+c\dot q+kq=0
add velocity to the state
z=[qv],v=q˙z=\begin{bmatrix}q\\v\end{bmatrix},\quad v=\dot q
z˙=Az,A=[01k/mc/m]\dot z=Az,\qquad A=\begin{bmatrix}0&1\\-k/m&-c/m\end{bmatrix}
no drag: a centre
qq
vv
5 10 15 1 2
tt
EE
E=12mv2+12kq2,E˙=0E=\tfrac12 mv^{2}+\tfrac12 kq^{2},\qquad \dot E=0
each initial energy selects one closed orbit the origin is stable, but not attracting positive drag: an attractor
qq
vv
5 10 15 1 2
tt
EE
E˙=cv20\dot E=-cv^{2}\le 0
energy falls; only the origin can remain forever inside v = 0, so every trajectory converges Energy is a statement about every trajectory, not one simulated path.
Figure 9. When first order is silent, use the full dynamics. The upper panel follows three systems with one Jacobian only long enough to display their distinct radial directions. The lower panel turns the spring into a first-order state system and then lets energy distinguish constant orbits from dissipative convergence, including the invariant-set step that negative semidefiniteness requires.
From energy to Lyapunov function

A differentiable scalar VV is a Lyapunov candidate around a fixed point when it is zero there and positive nearby away from it. Compute V˙=VF\dot V=\nabla V\cdot F using the full vector field. Strict negativity establishes asymptotic stability under the stated domain conditions. If only V˙0\dot V\le0, identify the largest invariant subset of {V˙=0}\{\dot V=0\}. The exposition works this through springs, pendula, predator-prey dynamics and reaction-network examples.78

10Chemistry forbids most vector fields

The spring was useful borrowed physics, but its signed rotation is not a closed concentration model. Mass-action networks inherit positivity, independent parameters and constrained polynomial terms.

Write elementary reaction ii as

j=1nαjiXjj=1nβjiXj,vi(x)=kij=1nxjαji.\sum_{j=1}^{n}\alpha_{ji}X_j\longrightarrow\sum_{j=1}^{n}\beta_{ji}X_j,\qquad v_i(x)=k_i\prod_{j=1}^{n}x_j^{\alpha_{ji}}.(24)

Here XjX_j is species jj, xjx_j is its concentration, αji\alpha_{ji} and βji\beta_{ji} are reactant and product stoichiometric coefficients, kik_i is the rate constant and viv_i is the elementary mass-action flux. If reaction ii consumes XjX_j, then αji1\alpha_{ji}\ge1, so its flux contains xjx_j and vanishes on the boundary xj=0x_j=0. Consumption therefore cannot push a concentration negative.

Chemistry does not permit an arbitrary vector field mass-action boundary rule
x˙i=Fi(x)0when xi=0\dot x_i=F_i(x)\ge 0\quad\text{when }x_i=0
pure rotation fails as concentration dynamics
x˙1=x2,x˙2=x1\dot x_1=-x_2,\qquad \dot x_2=x_1
x1x_1
x2x_2
consumption flux vanishes on the face it would cross PASS
x1x_1
x2x_2
F1(0,x2)=x2<0(x2>0)F_1(0,x_2)=-x_2<0\quad(x_2>0)
FAIL
Figure 10. Positivity excludes the spring's pure rotation as concentration dynamics. A mass-action consumption flux vanishes on the face it would cross, so the positive orthant is forward invariant. For pure rotation, F1(0,x2)=x2<0F_1(0,x_2)=-x_2<0 when x2>0x_2>0, so the field immediately exits the admissible region.

Three restrictions to carry forward

Positivity. Every face of the nonnegative orthant must point inward or tangent. The scalar law x˙=xμ\dot x=x-\mu with μ>0\mu>0 and the pure rotation in Figure 10 both fail at the boundary.

Independent parameters. Distinct elementary reactions have distinct rate constants. A behavior that requires two unrelated constants to match exactly is tuned, not structural. A dual-rail representation can encode a signed variable as q=x+xq=x_+-x_-, but an exact arbitrary linear system generally requires matched rates in the two rails. Biology may regulate those rates, but the equality then needs a mechanism of its own.

Constrained kinetic form. Elementary mass action produces polynomials with signs tied to what each reaction consumes and produces. Effective non-polynomial laws such as Hill and Michaelis-Menten functions arise by eliminating fast binding or catalytic states. Timescale separation is therefore a genuine route past the polynomial wall, not decorative curve fitting. Lecture 6 will ask exactly when that elimination preserves the observable we care about.

Conservation narrows the state space again

For x˙=Γv(x)\dot x=\Gamma v(x), any row vector \ell satisfying TΓ=0\ell^{\mathrm T}\Gamma=0 gives Tx=constant\ell^{\mathrm T}x=\text{constant}. Stability must then be judged inside the corresponding stoichiometric compatibility class. A zero eigenvalue normal to that class may report a conserved total rather than a physical instability.

These restrictions support high-dimensional conclusions that a generic vector field cannot offer. Complex-balanced mass-action networks admit strong Lyapunov structure, while signed interaction graphs can reveal monotone or near-monotone organization.910

Part 5

Return to the design question

The lecture ends on the same map it opened, now with the arrows filled and their prices visible.

11The price list

Analysis did not replace simulation. It identified which questions can be settled before exact parameters are known and which still require the bottom-level model.

The map, filled in: structure now implies function STRUCTURE FUNCTION coarse coarse interaction graph admissible region; bounded? positivity + saturation signs and invariant pools stable fixed point? Jacobian sign pattern response-curve shape how many states; switch or cycle? crossings + dimension parameter values + initial state period, amplitude, one trajectory simulation more detail more detail Upper arrows cover families of models; the bottom arrow returns one run. Analysis and simulation answer different questions, and the design needs both.
Figure 11. The opening map, now filled in. Positivity and saturation restrict the admissible region; Jacobian signs and magnitudes constrain local stability; response-curve crossings and dimension permit memory or cycling; exact parameters and initial conditions supply timing, amplitude and one path.
function soughtstructural pricewhat still has to be checked
one persistent expression levelone restoring addition-removal crossingdomain, boundedness and recovery time
binary memorythree crossings; in our construction, sufficiently steep cooperative feedbackbasin sizes, noise-driven switching and reduction validity
commitment with hysteresistwo folds in a parameterized responsecritical slowing, finite-copy noise and accessible parameter range
local recoverya Hurwitz Jacobian on the relevant state-space slicewhether the perturbation remains local and the fixed point exists
a biochemical clockat least two effective dimensions, rotational feedback and an isolated attracting orbitboundedness, period, amplitude and robustness
global convergencea Lyapunov function, monotonicity, contraction or another global certificateevery hypothesis on the invariant domain

The cell-as-chemical-plant question now has a more precise answer. Positivity keeps every concentration in its admissible region. Under a constant-growth approximation, dilution contributes self-limiting diagonal terms. Saturation caps many effective production fluxes. Conserved pools confine motion to lower-dimensional slices. None of these alone is a universal stability theorem, and cells deliberately switch and oscillate. Together they explain why unbounded or stalled behavior is not the default, and why interesting behavior must be built.

The core story in eleven sentences
  1. You can simulate a declared reaction system, but one run cannot expose an omitted mechanism or exhaust a large family.
  2. The goal is a map from coarse structural facts to qualitative functions.
  3. In one dimension, a fixed point is an addition-removal crossing and its stability is read from nearby signs.
  4. Binary memory requires stable, unstable, stable crossings, which a saturating cooperative response can construct.
  5. A saddle-node is tangency, and it brings hysteresis and critical slowing.
  6. A second variable permits rotation and lets a saddle manifold separate toggle basins.
  7. Three dimensions remove the planar packing restriction, so additional structure becomes essential.
  8. Near a fixed point, z˙=Az\dot z=Az; Hurwitz eigenvalues mean every local mode decays.
  9. When the Jacobian is nonhyperbolic, energy or another Lyapunov function can recover a global conclusion.
  10. Positivity, independent parameters, conservation and mass-action form exclude most mathematical vector fields from chemistry.
  11. Simulation remains the right bottom-level tool for exact trajectories, while structure tells us what a whole design can and cannot do.

A student team can start here

  1. State one biological function: recovery, memory, commitment or oscillation.
  2. Draw the reaction or mechanism network and name every approximation used to compress it.
  3. Declare the state, physical domain, conserved totals, parameters and initial conditions.
  4. Write the vector field and connect every addition, removal and regulatory sign to the network.
  5. Build the global picture first: scalar crossings or planar nullclines, fixed points, signs and candidate basins.
  6. At each fixed point, write A=J(x)A=J(x^{*}) and the system z˙=Az\dot z=Az; then state exactly what Hurwitz does or does not prove.
  7. Search for positivity, conservation, trapping or a Lyapunov function when the claim is global or the Jacobian is silent.
  8. Use simulation last to test timing, basin boundaries, parameter variation and the assumptions that produced the effective law.

The forward price list is now visible. Memory and commitment lead to multistability and bifurcations. A clock leads to genetic and metabolic oscillators. Return after a perturbation leads to adaptation. Wiring-level conclusions lead to reaction-order geometry. Timescale separation explains when the effective Hill laws used here can be trusted.

Exit ticket. Choose one conclusion about your network. State whether its evidence is a structural identity, a global geometric argument, a local theorem, a numerical observation or an experiment. Then name one omitted state or parameter perturbation that could invalidate the biological interpretation.

Simulation tells you what one cell did once. Structure tells you what every cell of that design can and cannot do, and that is the only kind of answer an experiment can be designed against.


References

These sources support the biological examples and the mathematical claims used in the lecture. Important full texts have been inspected and archived with the project.

  1. M. W. Hirsch, S. Smale and R. L. Devaney, Differential Equations, Dynamical Systems, and an Introduction to Chaos, 3rd ed. (Academic Press, 2013).Phase lines, linearization, invariant sets and planar dynamics.
  2. M. Scheffer et al., “Early-warning signals for critical transitions,” Nature 461, 53–59 (2009). DOI
  3. T. S. Gardner, C. R. Cantor and J. J. Collins, “Construction of a genetic toggle switch in Escherichia coli,” Nature 403, 339–342 (2000). DOI
  4. J. Jaeger and N. Monk, “Bioattractors: dynamical systems theory and the evolution of regulatory processes,” Journal of Physiology 592, 2267–2281 (2014). DOI
  5. M. B. Elowitz and S. Leibler, “A synthetic oscillatory network of transcriptional regulators,” Nature 403, 335–338 (2000). DOI
  6. L. Potvin-Trottier et al., “Synchronous long-term oscillations in a synthetic gene circuit,” Nature 538, 514–517 (2016). DOI
  7. D. Angeli, M. A. Al-Radhawi and E. D. Sontag, “A robust Lyapunov criterion for non-oscillatory behaviors in biological interaction networks,” IEEE Transactions on Automatic Control 67, 3305–3320 (2022). arXiv
  8. F. Blanchini and G. Giordano, “Piecewise-linear Lyapunov functions for structural stability of biochemical networks,” Automatica 50, 2482–2493 (2014). DOI
  9. F. Horn and R. Jackson, “General mass action kinetics,” Archive for Rational Mechanics and Analysis 47, 81–116 (1972). DOI
  10. E. D. Sontag, “Monotone and near-monotone biochemical networks,” Systems and Synthetic Biology 1, 59–87 (2007). DOI