How to construct and test a reduced biochemical model
A standalone worked chapter: exact totals, singular limits, implicit binding constraints, regulatory laws and stochastic averaging.
This chapter teaches a procedure you can apply to a new reaction network. Start with a specified prediction. Build the full model, identify exact totals, justify the fast-state elimination and test what the smaller model preserves. You need differentiation, elementary linear algebra and the interpretation of a reaction as a state change with a rate. The stochastic sections introduce the generator when it is needed.
Three operations carry different assumptions. Molecular accounting gives exact total balances. A specified singular limit supplies an approximate fast-state closure. Additional dominance assumptions may turn that implicit closure into an explicit Michaelis–Menten or Hill law. Each worked example keeps these operations separate.
The closed enzyme supplies the full calculation first. Supply and drain then expose the role of boundaries. Product competition and self-repression require coupled binding constraints. A binary promoter requires a probability distribution in place of a deterministic fast concentration. The final enzyme–buffer exercise combines the method without assuming attendance at the lecture. All numerical examples in this chapter are model calculations.
Construct the exact model
Define the observable and account for every constituent before approximating a rate.
1Specify what the model must predict
Suppose the experiment starts with enzyme and substrate mixed in a closed vessel. A detector measures product over several catalytic times. A different detector measures complex formation immediately after mixing. The same reduced law can be excellent for the first measurement and unsuitable for the second. Before doing algebra, name the output, time window, initial conditions, and acceptable error.
For the running calculation we will compare product trajectories and complex reconstruction separately. Concentrations refer to a well-mixed vessel of fixed volume. Enzyme total is constant. The full model explicitly resolves reversible binding and irreversible conversion. It omits product rebinding, enzyme synthesis, compartment transport, and growth. Those omissions define a model, not a statement that the omitted processes never occur.
Would correct final product yield certify the complex transient? No. Both mass-conserving closed models may eventually turn the same initial substrate into product even when they disagree at intermediate times. The validation observable must interrogate the feature you intend to eliminate.
Write a reduction target that a concrete measurement or simulation could fail.
2Give every channel a flux and a change
Let be free enzyme, free substrate, their complex and free product. Order the species as . Here the superscript denotes transpose. The mechanism and channel rates are
Association changes species by . Dissociation reverses that vector. Conversion changes them by . Multiply each vector by its flux and add. With , this gives
If concentrations are micromolar and time seconds, has units . The constants have units . All three fluxes have units . This dimensional check catches comparisons of constants that are not comparable rates.
Construct and dimension-check a full mass-action ODE from state-change vectors.
3Establish the physical region
At a boundary where free substrate is zero, its derivative is . At zero free enzyme, its derivative is . At zero complex, its derivative is . Product cannot decrease in the closed model. Nonnegative initial concentrations therefore remain nonnegative.
Adding the enzyme and complex equations gives . Adding substrate, complex, and product gives . With fixed initial totals, every species is bounded. These identities give both a physical domain and numerical diagnostics.
If an integration produces negative free species, first reduce the step or use a suitable stiff method. Clipping negative values to zero changes the equations and can conceal a broken simulation. Conservation residuals should shrink under a better-resolved integration, not be erased by postprocessing.
Check positivity and conservation in the full model and use them as independent tests of a numerical trajectory.
4Find totals with a counting matrix
Define a row for each constituent: enzyme occurs in free enzyme and complex. Unconverted substrate occurs in free substrate and complex. Product occurs in free product alone. Thus
For the binding column , direct multiplication gives . For conversion, . Consequently
These are identities at any binding speed. A total is a subnetwork invariant, not necessarily a whole-network conserved quantity. Catalysis changes unconverted substrate into product while preserving enzyme abundance.
For a larger network, the retained rows must describe all independent fast-subnetwork invariants needed to reconstruct its state. Physically named constituent totals are useful rows, but one must check their independence and completeness. Section 27 returns to this coordinate requirement.
Build the exact projection that removes fast reaction fluxes from total dynamics.
5Change coordinates before taking a limit
Retain and treat as a fixed parameter. Reconstruction is , . The full system becomes
The physical interval for complex is . Binding alone can change complex rapidly but cannot change the total coordinate. This is exactly what a clean slow coordinate should do.
Rewrite a mechanism in slow totals and fast occupancy without dropping any full-system term.
Solve the singular perturbation problem
Find the fast state, justify its attraction, and calculate the motion the reduced model retains.
6State the general singular perturbation problem
A fast equation can become an algebraic constraint only after a scaling makes the approximation precise. Choose dimensionless state vectors and , with physical reference times and . Define . The standard form is
The rate functions are dimensionless in this display. They must remain finite as the selected parameter family sends to zero. State scales are part of the construction. A complex that tends to zero may still have a finite, rapidly changing fractional occupancy.
The fast problem determines which algebraic root the system can follow. Changing the clock to multiplies the slow rate by . The leading fast equations are therefore
At each retained slow state, solve for a physical root . This graph is the critical manifold. Check that the fast dynamics attracts the intended initial fast state. For a locally attracting smooth branch, a fast Jacobian whose eigenvalues have real parts uniformly below zero supplies the local stability condition.
The slow problem evolves the retained state with the reconstructed fast state:
The reduction applies after the initial layer on a bounded slow-time interval that stays inside the region of attraction. It also needs smooth rate functions, a selected isolated branch and appropriate initial data. These hypotheses connect an algebraic solve to a trajectory approximation.3
The reconstructed fast state keeps moving because the slow state moves. Its derivative is . The term neglected in the fast equation is , rather than a requirement that this derivative vanish on the slow clock. The next four sections calculate every part of this construction for the enzyme.
Does suffice if its fast linearization has a positive eigenvalue? No. A perturbed fast state moves away along the unstable direction. Solving the constraint and showing that the dynamics follows it are separate tasks.
Specify a singular limit, select its fast branch, and state the conditions needed to use that branch in a slow model.
7Scale the enzyme without renaming its species
For the enzyme, use the fixed concentration scale . Define , , , and . Physical time remains . The reference times are and .
The association term supplies the conversion factor. Since , it becomes . The complex derivative is . Dividing the full complex equation by gives
The totals form , and the complex is . To shrink the time-scale ratio at fixed affinity, increase and together. Hold catalytic rate, initial totals and retained slow boundary rates fixed. The Michaelis constant then satisfies .
Recover the small parameter by carrying units and derivative transformations through every term.
8Select the physical root and test attraction
The reconstruction returns complex concentration from substrate total, enzyme total and a positive balance constant. Solve and select the smaller root:
There is exactly one root in the physical interval. At , the quadratic is nonnegative. At , it is nonpositive. Its derivative throughout this interval is . The larger root exceeds both totals.
The two roots remain distinct for nonnegative totals and positive . The discriminant can be written as .
Attraction requires a separate dynamical check. For rapid binding, take . Differentiate the net binding flux at fixed totals and evaluate it at :
The quantity in parentheses is the sum of free enzyme, free substrate and . A small complex perturbation therefore decays as when totals are fixed. In affinity units, .
For smooth systems on suitable compact attracting portions of the critical manifold, a uniform negative fast eigenvalue supports a nearby locally invariant slow manifold at small positive .3 If a transverse eigenvalue approaches zero in another model, the same argument can fail. Solving an algebraic equation alone does not establish fast attraction.
Check root feasibility and calculate the physical relaxation time needed to justify fast-state reconstruction.
9Solve the initial binding layer
During the leading fast problem, hold substrate total at and neglect catalysis. The physical complex equation is
Use the root just derived. Let denote the physical binding-equilibrium root. The second root is . It exceeds the available totals and is not a physical concentration. Factoring the quadratic gives .
For initial complex zero, separation of variables gives an explicit binding transient. Define its local relaxation time . The partial-fraction identity is
Integrate both sides, multiply by the root difference and impose zero initial complex. Exponentiating gives a ratio of distances from the two roots. Solving that relation for the complex gives
The formula starts at zero and approaches . For and , the root is approximately , and . The reference unbinding time and the actual binding relaxation time are distinct.
The full substrate total changes slightly during this layer because catalysis continues. In affinity units, . Its change over a bounded binding-time interval is of order . Only the binding contribution to its derivative cancels exactly.
Compute an initial binding transient and distinguish exact fast-subnetwork conservation from small full-system drift.
10Reconstruct a moving fast state
The reconstruction changes when the substrate total changes. Hold and fixed, and write . Implicit differentiation of its binding relation gives
The leading closed-vessel dynamics is . Its reconstructed complex has derivative while substrate remains. A fast constraint therefore predicts a changing complex. The nonzero derivative is computed by differentiating the reconstruction along the slow solution.
A more accurate reconstruction must follow an invariant graph of the full finite-speed dynamics. Write this graph as . Its derivative along the total equation must equal its derivative in the full complex equation. Dividing that equality by , and using , gives
To find the first displacement from binding equilibrium, expand . The leading term satisfies binding balance. At first order, differentiating the binding polynomial contributes . The invariance equation becomes
Solving for the correction gives
The curve where the full complex derivative is zero is a different object, called its nullcline. It uses in the quadratic. Expanding that root gives a first correction of . The invariant graph also contains the chain-rule contribution. Its small offset from the nullcline supplies the slow derivative.4
Derive the invariance equation and its first correction instead of replacing a moving reconstruction by a zero-derivative curve.
11Match the lost initial condition
For a separate two-variable example, let and let primes denote differentiation with respect to this dimensionless time. Consider , with . First solve . Multiplying the second equation by its integrating factor gives
Integrate from zero and apply the initial condition:
The exact slow graph is . Its expansion begins . The initial-layer term restores the original value zero. To suppress an order-one fast mismatch to order epsilon, solve , giving . An e-folding time is shorter than this matching time.
Construct a matched solution that retains the fast initial condition while approaching a moving slow graph.
12Integrate the slow enzyme conversion
Rapid equilibrium gives . Since , differentiation produces
Let be the free substrate after the leading binding projection, and set that reduced initial time to zero. Separate variables. The integrand reduces to , divided by . Thus
This implicit solution predicts the full reduced progress curve. For , the projection gives . Using four as the projected free value would ignore initial sequestration.
Near depletion the total-coordinate root is , so total substrate has an exponential tail with rate . Depletion does not itself create a fold or invalidate this rapid-binding limit.
Integrate a closed reduced trajectory and initialize it with the correct binding projection.
Choose and test the enzyme reduction
Restore the open boundaries, then test fast-state elimination and free-species dominance separately.
13Derive the small-enzyme criterion
If free substrate changes little while complex forms, freeze it temporarily at . The complex equation becomes linear with relaxation rate and plateau , where .
The amount initially captured relative to substrate is . Requiring this to be small gives the familiar initial reactant-stationarity criterion.
The catalytic depletion time estimates how long the initial substrate would last at the plateau conversion rate. Compare this with the complex relaxation time:1
The ratio can be small without guaranteeing negligible binding sequestration. Conversely, large affinity-scale denominator can make the initial criterion small even without a tiny enzyme/substrate ratio. These estimates apply under the stated hypotheses and over the initial adjustment interval. They do not supply a uniform error bound for the full trajectory.
Derive the small-enzyme criterion from initial sequestration and distinguish it from a bare timescale ratio.
14Restore supply and drain in both limits
Substrate supply adds to the free-substrate equation. Product drain subtracts from the product equation. Binding is described by . The full equations are now , , and . Adding free and bound contributions gives the total balances below.
Accelerate binding at fixed affinity
For rapid binding, the normalized substrate equation is . The complex equation is unchanged from Section 7. Keep finite as . The total then changes negligibly during binding, and the fast constraint uses .
Slow substrate change by reducing enzyme
For small-enzyme QSSA, the fast state is better scaled by enzyme availability. Keep the ratio explicit rather than giving it a new letter. Fix a positive substrate reference . Define and . The exact equations become
These equations expose a second singular perturbation family. Let at fixed microscopic constants and substrate scale, while keeping finite. Then . The fast equation is attracting, and its stationary occupancy is . Also on this family.
The fast fraction can remain finite while the absolute complex tends to zero. This is why concentration scale matters when identifying slow and fast variables. In this family the ratio controls sequestration, and
Retaining in the algebraic balance gives . This total-QSSA reconstruction agrees with standard QSSA at leading order in the stated small-enzyme family. It does not automatically acquire a validity theorem at arbitrary enzyme concentration.
Check the boundary processes on the fast interval
Boundary forcing must respect the selected limit. Check the supplied amount during fast adjustment against the substrate scale: in the first family, or in the second. Fixed finite input during a limit that sends enzyme capacity to zero does not satisfy the latter family.5
Product removal can be retained in its exact downstream equation . If product is counted among the slow variables, its drain must be slow on the fast-adjustment interval. If drain is faster, product has its own faster response. Because product does not feed back in this model, that response does not alter the substrate–complex reduction.
Put both open-enzyme limits into singular perturbation form and test their state scales, source scaling and fast attraction.
15Separate total closure from Michaelis–Menten dominance
In total coordinates the full complex nullcline satisfies . Its physical root is . Rationalizing the numerator avoids subtracting nearly equal numbers:
Integrate and reconstruct free species. Replacing by produces the rapid-equilibrium closure. Its different balance requires different assumptions.
If , the equilibrium complex is . Free enzyme and substrate each equal approximately . Their product equals , satisfying binding equilibrium. The larger root makes both free concentrations negative.
The explicit Michaelis–Menten law makes an extra substitution
The algebraic relation gives in free substrate, with the constant selected by the justified limit. A law in total substrate replaces by . The bound fraction must be small for this replacement:
Thus either or suffices. The resulting explicit flux is . The inequalities must hold over the concentration range being predicted. A large initial substrate pool need not remain large during depletion.
Fast binding alone does not enforce either dominance condition. With , the physical root is , whereas the free-to-total substitution gives . The difference survives when both binding directions accelerate together. In the tight-binding limit, complex approaches , so a substantial part of the substrate total can remain bound.
Measure the two approximation errors separately
Integrate three models from the same substrate total: the full species dynamics, the total DAE and the explicit Michaelis–Menten law. Let their reconstructed fractional occupancies be , and . Define the error between any two models on the stated interval as
The full-to-DAE comparison tests finite-speed elimination. The DAE-to-MM comparison tests the extra dominance substitution and its accumulated effect on the total trajectory. The full-to-MM comparison includes both. These maximum errors are not additive because their peaks and signs can differ.
Both families start at . Supply changes from to at three reference times. Full-model complex starts at the chosen total-closure root. In the rapid-binding family, , , and . The DAE uses .
In the small-enzyme family, , , and . Thus and . The reference is , and the DAE uses .
| Family and parameter | Full versus DAE | DAE versus MM | Full versus MM |
|---|---|---|---|
| Binding, 0.02 | 0.003135 | 0.118034 | 0.120329 |
| Small enzyme, 0.005 | 0.001375 | 0.001250 | 0.001435 |
The first row gives a useful counterexample: accurate fast-state elimination can coexist with a poor explicit law in total substrate. The second row shows the joint improvement used in core Figure 6. Neither row is a uniform theorem for arbitrary forcing or initial conditions.
Choose a physically justified closure and test free-to-total substitution as a separate approximation.
16Calculate capacity and recovery
At a full steady state, total balance requires . Here is the steady complex concentration. The complex equation then gives . Product balance gives . A finite positive state needs and positive drain.
For a reduced increasing flux , define perturbations , . Linearization is explicitly
The triangular matrix has negative eigenvalues, so both modes decay locally. Close to enzyme saturation, is small: the slow recovery clock lengthens even while binding remains fast. Above capacity, the exact inequality proves accumulation without any closure.
Find the processing steady state, derive its linearized system, and distinguish slow stability from an exact overload bound.
17Choose a numerical test that can reject the reduction
The reproducible calculation integrates the full total-coordinate enzyme and two reduced ODEs. RK4 steps are chosen small relative to the fastest binding relaxation and hit output times exactly. No negative-state clipping is used. A second run at half the step tests discretization. Conserved totals test the equations independently.
Separate graph reconstruction from trajectory error. The former compares full complex with at the actual total. The latter compares independent full and reduced total trajectories. A closure can have a small instantaneous graph error and still accumulate a noticeable trajectory discrepancy over a long time.
For stiff large networks, use a tested implicit solver with tolerances checked against invariants. The explicit solver used for this bounded example resolves the fast relaxation. The coupled product-competition calculation below uses an implicit solver and an independent species-coordinate implementation.
Separate discretization error, closure error, and accumulated trajectory error in a reproducible comparison.
Derive competitive and regulatory rate laws
Work from complete mechanisms to implicit constraints and optional explicit formulas.
18Work the product-competition DAE from the full model
A product-bound enzyme adds a coupled fast constraint. Let free enzyme bind substrate or product , forming or . The complexes interconvert through slower reversible catalysis. Substrate enters at flux . Only free product leaves, at flux .
Define the three net fluxes, then apply each stoichiometric change:
The totals are , and . Their exact balances are , and . The drain still needs free product, reconstructed as .
Put both binding pairs into the singular limit
Define , , , and . Bars in this example mean division by . The slow and fast equations are
Accelerate both binding pairs at fixed affinities and fixed relative binding speed. Keep catalytic rates, boundary rates and initial totals fixed. The scaled binding terms remain finite, while the catalytic contribution to each fast equation vanishes at leading order. The two constraints are and .
Find the physical root and establish attraction
First establish a unique physical binding state at fixed totals. Eliminate each complex using its ligand total, then solve
The right side is zero at zero enzyme and at least at . Its derivative is
Continuity and strict monotonicity therefore give one physical root in . Its complexes and free ligands are automatically nonnegative. A bracketed numerical solve preserves this physical selection without using a cubic root formula.
The polynomial form is useful for an independent implementation check. Expanding the same equation gives
When , a factor cancels and the physical solve is quadratic. This exceptional simplification does not remove the two distinct ligand totals or the product contribution to inhibition.
Next test fast attraction. At fixed totals use as fast coordinates and differentiate their binding fluxes. At the physical stationary state the Jacobian is
The trace is negative. Its determinant is , which is positive for positive affinities. Both eigenvalues have negative real parts. On a bounded retained region the fast relaxation therefore supports the singular limit as both binding speeds increase at fixed affinities and fixed speed ratio.
Choose an experiment that reveals product inhibition
Product binding dominates enzyme occupancy when . The exact fast-binding fraction is . In that regime , and . Product removes enzyme from the catalytic substrate-bound state.
A fixed-input steady state cannot expose this cost through its final net flux alone, because total balance forces . First use a batch experiment: set both boundary rates to zero and give all three cases the same initial substrate and enzyme totals. Only product affinity changes.
Use , , , and . Both dissociation rates are . Choose . Initial complex is the substrate-only binding root. The full simulation conserves .
For the matched comparison, solve binding at the chosen , then solve the substrate-only binding problem at the same . The ratio of forward activities is . Both solutions use the same enzyme total. No free-ligand approximation enters this ratio, and reverse catalysis does not enter a forward activity.
| Product affinity | Time to half conversion | Enzyme fraction in C_EP at half conversion | Relative forward activity there |
|---|---|---|---|
| 100 micromolar | 5.82 s | 0.00951 | 0.99083 |
| 1 micromolar | 7.70 s | 0.45049 | 0.55794 |
| 0.01 micromolar | 140.27 s | 0.98530 | 0.01516 |
Times are measured from the full trajectories. The occupancy and relative-activity columns use the algebraic binding states at . Over 600 seconds, the largest absolute difference between full and DAE product totals is 0.00559, 0.00304 and 0.00193 micromolar in the three cases. The figure shows the first 120 seconds. The stronger inhibition is a change in enzyme allocation, rather than a consequence of substrate exhaustion.
Restore input and drain in the total DAE
The resulting slow model retains the exact boundary convention:
At every evaluation, solve for free enzyme, reconstruct both complexes, then evaluate these rates. Consistent initial algebraic values come from the initial totals. An arbitrary initial full-model occupancy adds a fast initial layer that this slow DAE does not resolve.
| Product removal rate (per second) | Maximum substrate-total error | Maximum product-total error |
|---|---|---|
| 4 | 0.000691 | 0.000454 |
| 0.4 | 0.00126 | 0.000299 |
| 0.02 | 0.0127 | 0.00258 |
For this calculation use micromolar and seconds. Set , , , , and . Both dissociation rates are . Initially , , and . These values specify the full model and consistent initial totals for the DAE.
These differences cover the full plotted interval of 400 seconds, including the small initial catalytic adjustment. They test the stated finite binding speed. They do not establish a universal error bound for arbitrary rates, forcing or initial data.
Derive the optional two-input rate law
Only after the DAE is justified should free-ligand dominance simplify it. The exact binding relation gives and . For each ligand, either small enzyme relative to its affinity or small enzyme relative to its total is sufficient to make its bound fraction small. Check both ligands before replacing both free concentrations by totals.
When both ligands are mostly free, enzyme conservation becomes . Solve for enzyme, then reconstruct both complexes. Substitution gives
The denominator accounts for competition over enzyme occupancy. The negative numerator term accounts for reverse catalysis. Product can suppress the forward rate even when reverse catalysis is negligible. Both the batch and supplied-vessel trajectories above use neither free-ligand replacement.
At fixed free substrate, increasing free product lowers the forward catalytic flux through enzyme competition. In a supplied vessel, substrate is allowed to accumulate. The eventual input-output equality can then be restored by a larger substrate pool. This is why the three trajectories can have the same final net throughput while showing different inhibition burdens.
Use monotonicity to select the physical algebraic state, fast attraction to justify its use, and independent trajectories to test the stated finite-speed reduction.
19Derive monomer self-repression
Now let binding control protein production. Free promoter produces its own repressor . Binding forms an inactive promoter complex . RNA is omitted. Production and free-protein removal are composite processes with rates and :
Both and have units of inverse time. Let . The full species equations are
Binding conserves and . Adding the species equations gives and . This model protects bound protein from removal. Removing every protein form at the same rate would give a different total balance.
Normalize concentrations by . Choose and . The exact transformed equations are
Speed both binding directions at fixed affinity, production, removal and promoter total. The physical binding root is , given by the quadratic from Section 8. Its fixed-total restoring rate is . Thus the fast-binding DAE is
To obtain the explicit repression law, first solve the binding balance in free protein: and hence . The active fraction decreases because only unbound promoter produces. If or , the bounds in Section 15 make . Then
How does the calculation change if only bound promoter produces? Replace production by in both the species and total equations. Binding balance is unchanged. Under free-protein dominance, production becomes . A change in the productive state turns repression into activation.
Binding has supplied the same algebraic root as in enzyme catalysis. The productive state determines which fraction enters the slow flux. The next example changes the binding mechanism itself.
Build a self-repressor from species balances and derive its decreasing rate law with an explicit removal and abundance convention.
20Count dimer storage before using a Hill-2 law
Suppose two free repressors first form a dimer , and only that dimer can occupy the promoter. Write the bound promoter as . The elementary binding reactions are
Production remains the composite process at rate . Only free monomers undergo composite removal at rate . Define and . The deterministic association constant includes the convention for identical reactants.
A dimer contains two protein constituents whether free or promoter-bound. Therefore , , and . No binding approximation has entered this accounting.
Define affinities and . Their geometric mean is a concentration. It will be the free-monomer half-repression level.
For the two binding fluxes just specified, define , , and . Measure concentrations in units for this block. The complete singular form is
Speed both reversible pairs together at fixed affinities and finite dimensionless production strength. Their leading stationary equations require and , hence both net binding fluxes vanish in this particular network.
Solving the stationary rates gives and . Promoter conservation then gives . Inserting these species into the protein total defines the remaining scalar solve.
Fast attraction can be checked directly. Differentiate the two fast rates in the coordinates . The physical Jacobian is
Its trace is negative. Its determinant is
Thus the physical fast state is locally attracting. The algebraic reconstruction is also unique, because the total protein determined by a given nonnegative free monomer is strictly increasing:
The degree-two formula is exact in free monomer within this fast-binding reduction: . For the same formula to use total protein, the two storage ratios must be small:
Near the half-repression point , these become and . A weakly populated free dimer can still repress strongly if dimer-promoter affinity is sufficiently tight. This supplies a consistent regime in which dimerization causes a Hill exponent of two while monomers dominate the total.
If free dimers instead dominate total protein, . Substitution gives . The occupancy now looks degree one in total protein, even though it remains degree two in free monomer. Removal is still , so it also needs the appropriate reconstruction.
For dimer-mediated activation, let only produce. Under monomer dominance the production term is . The factors of two in protein storage remain unchanged.
Derive the regulatory exponent in a specified concentration, then check molecular storage before transferring it to a total concentration.
21Compare a different two-site promoter mechanism
Two monomers can instead bind successively to a promoter. This is a different mechanism from preformed-dimer binding. Its three promoter states are , and :
At fast binding balance, the state weights relative to free promoter are . Their sum gives the promoter total. The fraction in the twice-bound state is consequently
A Hill-2 activation law appears when the twice-bound state alone produces and the singly occupied weight is negligible. Near , the intermediate term relative to either outer term is . Thus gives the required cooperative limit. A fast binding rate alone does not remove the intermediate.
If only free promoter produces, the active fraction is . Suppressing the middle term gives the corresponding Hill-2 repression law. For either law to use total protein, also check . This storage condition is independent of the intermediate-weight approximation.
Preformed-dimer binding has no singly occupied promoter state, so its Hill-2 fraction in free monomer needed no intermediate suppression. The comparison explains why an exponent alone does not specify a mechanism. Larger fast state graphs likewise produce rational occupancy functions from their resolved states.8
Derive a regulatory law from its actual state graph and identify the distinct assumptions hidden by a Hill exponent.
22Derive the delay caused by a binding load
Let a regulator bind downstream sites through . Supply is composite with flux . Only free regulator is removed, at . Exact totals give . Under fast equilibrium, , so
The steady free level is . Linearizing the scalar equation there gives decay rate . With , the relaxation time is 3.25 times the unloaded value. This is a minimal retroactivity calculation.6
If every form is removed equally, the total equation instead contains . It predicts a different steady free level. Always state whether bound molecules are protected.
Derive a downstream load's effect on an upstream transient while keeping the physical removal convention explicit.
Eliminate a random fast state
Average the correct conditional distribution, or retain the finite packet produced during a short episode.
23Average a binary promoter through its master equation
A single promoter remains binary, so fast elimination must act on its probability law. To isolate this issue, use an independently switching promoter with no feedback. Let mean OFF and mean ON. Protein count is . Define and as the probabilities of proteins with the gene OFF and ON.
Four events change the joint state. The OFF-to-ON switch has hazard , and the reverse switch has hazard . Production in the ON state has hazard . Protein removal has hazard . These hazards have units of inverse time. Addition and removal change the protein count by one. Switching changes only gene state.
The master equations add probability inflow and subtract outflow for each event:
For example, the ON-state birth inflow into count is . Birth outflow is . Removal into comes from molecules and therefore carries . These shifts account for each term.
Set probabilities with negative protein count to zero. The state-transition generator, normalized to unit relaxation rate, is
This matrix acts on functions of gene state. Its transpose acts on probability columns. It has eigenvalues zero and minus one, and stationary column . For independent switching this same distribution applies at each retained protein count.
Choose and . In this clock the exact generator form is
Here the slow operator uses birth rate and removal rate . Hold fixed and accelerate both switches. The leading master equation requires separately at each count. Thus , where . Sum the two master equations to cancel switching, then substitute:
This is the constant-arrival birth–death process. Its stationary count distribution is Poisson with mean . The arrival process is Poisson in time. The protein count process includes downward jumps and is not itself a Poisson counting process.
Finite switching speed leaves a measurable correction to noise. The next section derives the exact Fano factor . For the paths above it changes from 17.563 to 1.01814, while the stationary mean remains 9.52381. Individual displayed paths illustrate dynamics rather than estimate these moments.
Eliminate a rapidly mixing promoter by projecting its master equation onto the stationary gene-state probabilities.
24Use exact moments to test stochastic averaging
Use the independent-switching promoter specified in Section 23. The gene indicator is binary. It switches ON at rate and OFF at rate . Protein count increases at hazard and decreases at hazard . Angle brackets denote ensemble expectations at the stated time.
The generator adds each event's hazard times its change in an observable. Apply it to . Because , these four moment equations close:
For the last equation, addition changes by . Removal changes it by . Multiplying by their hazards produces the four terms shown. The mixed moment records the correlation between recent promoter activity and accumulated protein.
At stationarity, the first two equations give and . The mixed-moment equation then gives
The last moment equation gives . Subtract and divide by the mean. The result is
A noise tolerance gives a quantitative separation criterion. In this sweep the Fano excess is . To make it less than 0.1 requires . Switching merely faster than removal is not enough for that tolerance.
Conditional averaging derives the effective hazard when both switches accelerate at fixed ON fraction and fixed production rate. Section 23 obtained that hazard directly from the master equation. The moment calculation now measures the finite-speed error it leaves.7
Derive stationary moments from event changes and use the variance to test a reduction that already matches the mean.
25Retain finite random packets in a different limit
Rapid switching at fixed production erases promoter-induced packets. A different scaling preserves a finite amount produced during each short active episode. During an ON episode, production has hazard and switching OFF has hazard . Protein removal does not affect the number of birth events produced in that episode.
To calculate the packet size, ignore removal events and consider only production and switching OFF. During an episode, the next relevant event is production with probability or switching OFF with probability . Therefore the number of proteins produced before switching OFF obeys
Keep fixed while and increase. ON durations vanish, but the number produced during one ON episode does not. OFF waiting times remain exponential at rate . The limit has Poisson packet initiation and geometric packet sizes.
The corresponding protein generator is
Its stationary mean is and its Fano factor is . This also follows by taking the joint limit in the finite telegraph moments from Section 24. Fixed-packet counting, random packets with removal, and averaged single arrivals have different variances. Their packet parameters should not be interchanged.
An eliminated RNA lifetime gives the same packet law
A short-lived RNA is another possible packet mechanism. One RNA makes proteins at rate and is removed at rate . The chance that translation occurs before RNA removal is . Exactly translation events followed by removal therefore have probability
This is the same geometric law with a different physical interpretation of the two competing clocks. Its variance is . If RNA initiation has slow rate and protein removal has rate per molecule, the short-RNA limit gives packet initiation at rate and independent protein loss. Its stationary mean is and Fano factor is .10
What happens if RNA removal accelerates while translation stays fixed? Then , so the chance of any translation vanishes. A finite packet limit requires both rates to scale. The same distinction applies to promoter deactivation and ON-state production.
The packet generator also derives its stationary noise directly. For a burst size with mean , its second moment is . A packet changes by . Substitution into the generator gives the stationary Fano factor . A fixed packet of the same mean has a different second moment and a different Fano factor.
Intermittent RNA production provides experimental motivation for a promoter-episode model. Golding and colleagues examined episode durations and sizes in their bacterial reporter. Those observations concern transcription, while the protein packet mechanisms here are specified model calculations.11
Derive the random event retained after eliminating a short episode, and distinguish its rate scaling from ordinary fast-state averaging.
26Average feedback at fixed molecular totals
Feedback requires averaging at a fixed retained molecular total. Return to the binding repressor, now with one promoter copy. Let denote its occupancy and the number of free repressors. Define . Let be the number of molecules corresponding to one concentration unit in the chosen volume.
Binding preserves . At a fixed total, an unbound promoter sees free repressors, so its binding hazard is . Unbinding has hazard . Balancing these two probability flows gives
For total count one and , occupancy is one-half. Mean free count is also one-half. Inserting that mean free count into a deterministic occupancy formula would instead give one-third. The mean cannot replace the state inside a nonlinear conditional calculation.
The reduced feedback process needs averaged production and removal hazards. Let a free promoter produce at rate , and let each free protein be removed at rate . At each total count the effective hazards are
Production increases the retained total by one. Removal decreases it by one. The formula for removal accounts for protection of the bound molecule. At zero total, occupancy and removal hazard are both zero. This completes a one-coordinate reduced jump process with the same boundary convention as the original model.
The general operation is . Here labels a fast state and is its conditional stationary distribution. The binding mixing time is . It must be short enough that production and removal rarely change the retained count during fast adjustment. Speeding both binding directions at fixed affinity supplies that limit on a bounded count region.79
Construct slow stochastic hazards by averaging at fixed total count, including bound-state protection and the zero-count boundary.
Assemble the method and use it independently
Differentiate a general DAE and finish with a new network.
27Differentiate a general DAE and test its steady state
The deterministic examples all used exact projection followed by fast closure. Let contain species concentrations. Let and contain the species changes for binding and slower conversion channels. Their flux vectors are and . Boundary production, supply and removal contribute . Thus
Choose independent counting rows spanning the invariants of the fast subsystem. Define and verify . The exact projected equation is
These totals must be completed by independent fast coordinates so that the full state can be reconstructed. In the enzyme, the sole fast coordinate is its complex. In product competition there are two complexes. A redundant list of fast coordinates would introduce redundant algebraic equations and a singular Jacobian for purely bookkeeping reasons.
After choosing a justified singular limit, the leading fast rate defines . Express the projected total rate as . Here the total rate is written in physical concentration per time. Multiplying it by the chosen time scale and dividing by the concentration scale recovers the dimensionless in Section 6. The DAE is
A practical evaluation first solves the physical algebraic constraint, then reconstructs free species, then evaluates the slow fluxes. A bracketed scalar solve suffices for the competition and dimer examples. The DAE does not require an explicit root formula or a dominance approximation.
Differentiate the implicit reconstruction
Fix parameters and time-independent boundary conditions. Let the selected physical root be . We want its derivative so that slow response and steady-state stability can be calculated without an explicit root formula.
If the fast Jacobian is invertible locally, the implicit-function theorem gives a differentiable reconstruction. Differentiate the identity before differentiating the slow dynamics:
A nonsingular fast Jacobian makes this a locally solvable, index-one DAE in the standard semi-explicit terminology: differentiating its constraint once determines the fast derivative from . Fast attraction is stronger than mere nonsingularity. It establishes whether the full dynamics approaches the selected algebraic branch.
A steady state also satisfies . Linearizing the reduced differential equation there gives
Fast attraction concerns eigenvalues of the fast dynamics at fixed totals. Slow stability concerns this different Jacobian. Neither the existence of an algebraic solution nor a stable fast layer proves that the complete slow dynamics returns to a steady state.
Test whole-system steady states
For the original supplied enzyme, and . The slow Jacobian is triangular, with eigenvalues and . Since the physical complex increases with total substrate, the first is negative wherever a finite positive steady state exists. Its magnitude shrinks near enzyme saturation.
For the one-site self-repressor, . Thus the derivative of its total rate is . For the dimer model, free promoter decreases with free monomer and free monomer increases with total protein. Its production-minus-removal rate is also strictly decreasing. These particular feedback models have restoring slow dynamics. The general DAE form alone does not impose that result.
The steady processing enzyme sustains nonzero supply, conversion and removal. It is therefore a steady state of a driven system. Thermodynamic equilibrium requires additional conditions addressed in Lecture 7. Lecture 8 develops the algebraic and differential construction for larger binding networks. The final exercise here asks you to construct it for a new, fully specified system.
Differentiate the implicit fast constraint to obtain slow response and stability. Fast attraction, slow stability and thermodynamic equilibrium are distinct claims.
28Reduce an unfamiliar enzyme–buffer network
Use the completed method on a substrate that can bind either enzyme or inert buffer . The complexes are and . Only enzyme-bound substrate converts to product. The full mechanism is
Supply has flux , and free product leaves at flux . Buffer has no source, removal or catalytic activity. Before reading the solution, find the exact totals, specify a fast-binding family, select a physical algebraic state and decide whether buffer lowers the maximum sustainable input.
Write the full model and derive the totals
Let and . Their state changes give
Adding each constituent gives , , and . Their exact dynamics is
State the limit and test its fast dynamics
Define , , and . Normalize concentrations by fixed . The small parameter is .
Multiply each complex equation by and each changing-total equation by . This gives the slow–fast form from Section 6. Accelerate both binding pairs at fixed affinities and fixed relative speed, while keeping initial totals, catalytic rate and boundary rates fixed. The leading fast equations are .
At fixed totals, choose the complexes as independent fast coordinates. Use , and . Differentiating the two binding rates gives
The trace is negative. After factoring out , the determinant is . Thus the physical stationary binding state is locally attracting. The source must also move little substrate during this fast relaxation, and the observation interval must remain in the selected physical region.
Solve the physical constraint and obtain a prediction
Binding balance and the enzyme and buffer totals give and . Inserting them into substrate total gives one scalar equation:
The right side starts at zero and reaches at least the required total at . Its derivative is
There is one physical solution in . Solve it by bisection, reconstruct both complexes and integrate the total balances. Initial algebraic concentrations come from the initial totals. The full species model additionally resolves the fast redistribution from any off-constraint initial occupancy.
Buffer increases storage without lowering the limiting catalytic capacity. As free substrate grows, approaches . A positive finite steady state requires . Buffer changes the substrate total needed to support its free concentration and changes the transient response. This conclusion uses the stated absence of buffer-catalyzed conversion and bound-substrate removal.
Test the reduction against the six-species ODE. Compare a product trajectory and the complex reconstruction separately, check conservation and positivity, then repeat at smaller . To test the storage prediction, hold enzyme, affinities and source fixed while changing buffer total. Faster binding should improve the DAE comparison, while the buffer-induced change in the transient persists.
Construct and test a new binding-catalysis DAE, including its physical root, attraction, boundary scaling and a prediction that separates storage from catalytic capacity.
Interactive model laboratory
Vary the binding/catalysis ratio in the computed laboratory below. Predict which curve should improve before moving the control, then compare complex and product separately. The same microscopic relationship between affinity and the kinetic constant is enforced in every run.
Initial substrate total is , with no complex or product. Changing epsilon speeds both binding directions at fixed affinity and catalytic rate; always holds.
Rose: full mechanism. Teal: independently integrated rapid-equilibrium reduction. Purple dashed: independently integrated total QSSA. The x-axis is slow time ; concentrations are in affinity units.
The browser runs resolved RK4 integration, not illustrative exponential curves. Errors include the initial layer and are normalized by the initial substrate total. This finite parameter test is not a theorem of validity.
References
- Segel LA, Slemrod M (1989). The quasi-steady-state assumption: a case study in perturbation. SIAM Review 31:446–477. Source.
- Borghans JAM, de Boer RJ, Segel LA (1996). Extending the quasi-steady state approximation by changing variables. Bulletin of Mathematical Biology 58:43–63. Source.
- Fenichel N (1979). Geometric singular perturbation theory for ordinary differential equations. Journal of Differential Equations 31:53–98. Source.
- Eilertsen J, Schnell S (2020). The quasi-steady-state approximations revisited: timescales, small parameters, singularities, and normal forms in enzyme kinetics. Mathematical Biosciences 325:108339. Source.
- Eilertsen J, Roussel MR, Schnell S, Walcher S (2021). On the quasi-steady-state approximation in an open Michaelis–Menten reaction mechanism. AIMS Mathematics 6:6781–6814. Source.
- Del Vecchio D, Ninfa AJ, Sontag ED (2008). Modular cell biology: retroactivity and insulation. Molecular Systems Biology 4:161. Source.
- Kim JK, Sontag ED (2017). Reduction of multiscale stochastic biochemical reaction networks using exact moment derivation. PLoS Computational Biology 13:e1005571. Source.
- Gunawardena J (2012). A linear framework for time-scale separation in nonlinear biochemical systems. PLoS ONE 7:e36321. Source.
- Holehouse J, Grima R (2019). Revisiting the reduction of stochastic models of genetic feedback loops with fast promoter switching. Biophysical Journal 117:1311–1330. Source.
- Shahrezaei V, Swain PS (2008). Analytical distributions for stochastic gene expression. PNAS 105:17256–17261. Source.
- Golding I, Paulsson J, Zawilski SM, Cox EC (2005). Real-time kinetics of gene activity in individual bacteria. Cell 123:1025–1036. Source. Archived full text. Relevant reading: Figure 3 and pp. 1031–1032.