From chemical balances to an adaptation claim
Start from the reaction list with the rate law of every composite step, the input, the measured output and the model boundary. The six steps are worked on the core's models, then run on a network the core does not treat.
An adaptation mechanism must connect a specified function to feasible chemistry. The core chooses the adaptation biomachine, then follows binding and catalysis to the reaction orders that restore its output. This chapter teaches how to check that connection yourself. Begin with the full balances. Derive the limiting law, identify the measured quantity, and test the conditions under which the response returns.
Six questions organize the calculation. What identity constrains the output? Which observable does it constrain? Which dominance regime justifies the law? Is the proposed rest feasible? Does it attract nearby trajectories? Which changes preserve the result? The examples develop these questions in order. The final worked problem transfers them to a protein whose inactive form converts its active form.
- For the core’s control introduction, derive the sampled controller’s equilibrium and units. Then test its convergence with the stated update order.
- For chemical implementation, start with the resolved memory-removal mechanism. Then compare a modification switch with the two-cycle feedback circuit.
- For chemotaxis, distinguish the exact methylation balance from the activity-only teaching law and its biological support.
- For the feedforward reversal, derive the finite-affinity mechanism and its free and total readouts. Then test reaction orders and added loads.
- For the antithetic controller’s frequency response, distinguish disturbance sensitivity, stability margins and noise.
The lineage explains where these questions came from. The research essay uses them to choose a perturbation that distinguishes candidate mechanisms. This chapter supplies the calculations those comparisons require.
A bare species symbol is a free concentration: , , . A total, the sum over every state that contains a constituent, is . A complex of two species is , named by its constituents, except in the two-cycle feedback circuit, whose four complexes keep the numbers to that the core and the literature use. An elementary step is a straight arrow carrying its rate constants. A composite step, such as production, an unresolved enzymatic step or growth dilution, is a bare squiggle, and its rate law is written beside it. A dissociation constant belongs to binding equilibrium, and a Michaelis constant to the steady state of a resolved model (§3).
Units are written with c for concentration and T for time. Every number carries one of four labels where it appears. Exact means exact within the stated model, usually a closed form. Leading order means a limit or a dominance approximation, with its condition named. Numerical means a model prediction at stated illustrative parameters. Reported means a value stated in a cited source, with its page. No number here is a fit to data.
The audit
What an adaptation claim states, the data needed to check it, and six questions in the order in which they depend on each other.
1The audit starts from rate laws, an input, an output and a boundary
An adaptation claim says that a measured quantity returns to its old value after a persistent step of an input, for a class of inputs, and keeps doing so under a class of changes. Checking it needs more than a reaction list: the rate law of every composite step, the input, the output and the model boundary. With those written down, six questions taken in a fixed order test the claim and find its limits.
An adaptation claim names three things
An adaptation claim names an observable, a class of inputs and a class of changes. Hold the input at one value until the system rests, step it to another value, and hold it there. The claim is that a named observable then returns exactly to its old value (core Part 1 experiment). "Exactly" is a statement about every input in a class, not about one trace. "Robustly" is a statement about a class of changes to the network itself, such as a changed rate constant, an added load on the output or growth dilution (core A16).
A reaction list alone does not fix the dynamics, because a composite step carries no rate law. An elementary step is drawn with a straight arrow and its rate constant, and its mass-action rate law follows from the arrow. A composite step is drawn with a bare squiggle, and its rate law must be stated beside it. The core's incoherent feedforward loop shows why that statement matters. Its resolved binding-catalysis mechanism approaches a reduced model in which the degrader removes the output through a composite step. With the rate law the loop adapts exactly. With and it does not (§7). The composite reaction list is the same in both cases. The rate law differs. The resolved chemistry determines whether either law is a valid approximation (§4).
The audit's starting data has five parts. The reaction list, with every arrow classified as elementary or composite. The rate law of every composite step. The input: what is stepped, and in which units. The output: which species, complex or pool is measured. The model boundary: which processes the model contains, for instance whether growth dilutes its species. This page calls these five together the starting data.
The running example, written as starting data
The core's sequestering pair, written as starting data, is the running example. A reference process makes the actuator , the output makes the sensor , the two bind into the complex , which is removed, and the actuator makes the output, which is removed too (core §8):
Here is the reference rate, in c/T, the sensing constant, and the binding and unbinding constants, the removal frequency of the complex, the actuation constant and the removal frequency of the output. The input is a change of , a first-order load on , or a constant inflow of . The output is the free . The boundary has no growth dilution, the actuation is linear in , and is made in one stage.
Six questions in a fixed order
Six questions, asked in order, audit the claim.
- Identity. Find a relation among the rates, exact for the stated rate laws, whose zero at a rest constrains the output, and say what it stores, in which units (§2).
- Observable. Find which quantity the identity pins, and how far each measured pool follows it (§3).
- Regime. Decide whether the identity is exact or a limiting law, and if it is a limit, find the regime of the totals in which it holds (§4).
- Positivity and reachability. Check that a rest with the pinned value exists with nonnegative amounts, and that the system can reach it (§5).
- Stability. Test whether that rest attracts, with every conservation law kept in the linearization (§6).
- Class of changes. Name the changes the identity survives and those it does not (§7).
The six questions organize the audit, while the chemistry sets the derivation order. Write exact species and total balances before imposing a closure or a dominance regime. An error identity suggested in step 1 remains provisional until step 3 establishes its assumptions. Only then can the feasibility and stability tests establish a returning response. The last step asks which changes preserve that result.
The audit records outcomes. It neither ranks models nor proves that a model cannot adapt. Each of the core's models illustrates one step's question in Part 2, and §8 gives every model's outcome at every step. A model can lack one kind of identity and still be input invariant. The core's subtractive compensator returns by a matched constant and has no identity at all. Its incoherent feedforward loop returns because its reaction orders match, and its identity is weighted rather than error-only (§2, core A9 and §9). So failing to find an identity of one kind does not show that none exists, and it does not show that the output cannot return.
Write the starting data of an adaptation claim (the classified reaction list, the rate law of each composite step, the input, the output and the boundary), and plan its audit as six questions in order: identity, observable, regime, positivity and reachability, stability with conservation kept, and the class of changes.
Six steps, worked on the core's models
Each step is stated in general, derived from the starting data, and worked on the core's models, with units, every total, the regime, reachability and stability.
2Rate identities reveal what can pin the output
An identity is a relation among the rates that holds exactly for the stated rate laws. Three kinds appear among the core's models: an exact mass balance, an error-only identity and a weighted error identity. Each pins the output under its own condition. Cancelling, in a combination of rate equations, every step that does not read the output is a useful way to find one, though not the only way, and what an identity stores has units of its own.
Three kinds of identity
An exact mass balance is a combination of totals whose rate reduces, by stoichiometry, to a few fluxes. In the two-cycle feedback circuit the modified-B total changes only by two catalytic steps, (§3). At a rest it pins a relation between two complexes, . That relation is not yet a statement about a measured output. Turning it into one needs further assumptions, which is the work of step 2.
An error-only identity is a state whose rate depends on the system only through the output. Write it as , where is the output and the function vanishes only at the set point . Then every rest has , whatever the other states and whatever the plant's constants. The core's integral loop has the simplest one, . Its chemotaxis teaching model has another, , whose right side depends on the state only through the receptor activity (core §5).
A weighted error identity carries a multiplier that depends on the state. Write it as , where the multiplier depends on the state. A rest pins only where is nonzero. The core's incoherent feedforward loop has , with (core §10). Its multiplier is positive at every rest with a positive input, because there . At zero input the multiplier vanishes and the rest pins nothing, which is why the core states its claim for .
Finding an identity in the starting data
One useful route to an identity combines rate equations so that every step that does not read the output cancels. For mass-action steps this is linear algebra on the stoichiometry: look for a combination of species whose net change is zero in every step except those whose rate laws read the output. In the running example (1), binding and unbinding move a molecule between its free and bound forms, so they leave the totals and unchanged. Removal of the complex lowers both totals by one, so it cancels in their difference. Only the reference and sensing steps survive:
This is an exact mass balance that is also error-only. Its right side depends on the state only through , and it vanishes only at . So every rest has , whatever , and the binding constants (exact).
The route is useful, not guaranteed. A linear combination of rate equations finds identities that are linear in the species. The identity of §9 is a logarithm, which no such combination produces. So this route can miss an identity in a nonlinear coordinate.
Specify the sampling clock before calculating the resting error
The sampled controller separates three operations within each time step. First calculate the action from the current output and memory. Next advance the output. Finally add the newly observed output to the memory. Let label these updates and let be their fixed physical interval. Physical elapsed time is . A bracketed argument names an update, rather than a continuous-time derivative.
Physical units determine the gains in the sampled rule. Let output error have units c, persistent disturbance and opposing action have units c/T, and accumulated error have units c T. Define the sampled model by
Here has units 1/T and has units . The action in the output update uses . It does not use . This rule is a specified discrete model. It is not an exact sampled solution of the continuous differential equations below.
The core’s experiment uses dimensionless versions of these variables. Choose a fixed concentration unit . For an active integral gain define
The normalized memory measures its contribution to one step’s action. The normalized equations are
The core writes these normalized variables without bars. Integral-only control has . Combined proportional and integral control has . For proportional-only control the memory is absent and .
A resting active memory forces zero output error. For a held and , the last equation at a rest gives . Thus . The output balance then gives , so . The action remains nonzero after the error vanishes. Proportional-only control instead requires . These calculations locate the rest. The stability calculation in §6 decides whether the updates reach it.
The continuous-time calculation uses a different clock. The calculation below develops the core’s continuous-time comparison. A convergence result for one clock does not automatically apply to the other.
The core’s control comparison can be calculated with physical units. Let be a concentration deviation, and let the disturbance and opposing action be concentration fluxes. The plant is . With and , the memory has units c·T, has units , and has units .
A constant disturbance separates equilibrium from convergence. Proportional control alone gives . With integral action, any rest instead has and . Differentiate the plant equation after the disturbance has become constant:
Positive and put both characteristic roots in the left half-plane. With no proportional action, the roots are purely imaginary and the output oscillates. In the older comparison , , the plant itself supplies damping through . The two comparisons therefore make the same point: the integral identity and the source of damping must be identified separately.
What the identity stores, in units
The stored quantity, the action it supplies and the disturbance it cancels are three objects with their own units. The core's integral loop shows them apart once its output carries units. Let be a concentration deviation from the set point, so that in , the disturbance is in c/T, in 1/T, the memory in c·T and the gain in . At rest , in c·T. The action , in c/T, equals the disturbance in value and in units. The memory differs from both by the gain: at and it holds 0.5 (exact, core A9).
In the sequestering pair the three objects are a concentration, a flux and a frequency. The error integral is a concentration. The action is the actuator's flux , in c/T, which at rest balances the output's removal, . The disturbance is the removal frequency itself, in 1/T. When doubles, the action doubles: the actuator moves from 1 to 2, and the error integral from 0.98 to 1.99, in units of (numerical, core A14). The error integral is neither the disturbance nor the action.
The table compares the three objects across the core's models. In each row the memory, the action and the disturbance are different quantities, with different units.
| Model | Identity | Memory | Action | Disturbance |
|---|---|---|---|---|
| Integral loop | error-only, | , in c·T | , in c/T | , in c/T |
| Chemotaxis teaching model | error-only, depends on alone | methylation , in methyl groups per receptor | the methylation's contribution to the dimensionless free-energy difference (§4), or per receptor, which cancels the attractant's term (§5) | attractant , in units of |
| Two-cycle feedback circuit | exact mass balance, | , in c | demodification flux , in c/T | input total , in c |
| Sequestering pair | exact mass balance, error-only, (2) | , in c | , in c/T | or , in 1/T; , in c/T |
| Incoherent feedforward loop, bilinear removal | weighted, | the error coordinate , in c; the input itself is held in the degrader, | removal flux , in c/T | input , in c |
A chemical concentration needs a positive implementation of signed memory
A physical engineering memory can increase or decrease through zero. A capacitor’s signed charge obeys . The sign records which plate has excess charge. A single chemical concentration must instead satisfy . At , any physically admissible chemical balance has . Therefore a global rule is impossible when on that boundary.
Three constructions avoid this conflict in different ways. A saturated removal process gives an approximate signed error rate inside a positive concentration regime. A difference of two nonnegative pools gives an exact signed coordinate. Multiplicative chemistry gives an error rate in the logarithm of a positive species. In the conversion example, is an active protein form and its inactive form. Each construction still needs an output, actuation, a feasible rest and a stability test.
| Chemical construction | Stored coordinate and rate | Condition to audit |
|---|---|---|
| Saturated memory removal | , with | Enzyme stays saturated. The approximation fails near an exhausted memory. §4 derives the defect. |
| Two nonnegative controller pools | , with exact rate | Shared removal cancels. Each pool stays nonnegative, although its difference can have either sign. |
| Multiplicative conversion and recovery | , with exact rate | . The face is invariant. §9 resolves the complete audit. |
The logarithmic construction follows by division, rather than cancellation of fluxes. In the mass-action conversion module of §9, . Divide by to obtain the rate of , where is a fixed concentration used only to make the logarithm dimensionless. Its stored coordinate is dimensionless. Its derivative has units 1/T. The same positive concentration can represent either sign of this coordinate by lying above or below .
Two models with no error-integrating state
Two comparisons have no state that integrates the output's error, and each behaves for its own reason. Lecture 9's high-gain loop has the output as its only slow state, so the output itself holds the input, as an error of about of a small relative change, where is the loop gain (lineage §2). The subtractive compensator stores nothing at all, yet its output never moves when , because the constant matches the plant (core A9). That is input invariance by a matched constant. Step 6 tests it, and a change of the plant's input gain breaks it (§7). Neither case says anything about networks in general.
Classify an identity as an exact mass balance, an error-only identity or a weighted error identity, look for it by cancelling every step that does not read the output, without reading a failed search as proof that none exists, say when its zero pins the output, and give the units of the memory, the action and the disturbance separately.
3The identity pins one quantity, and a pool adapts as far as that quantity dominates it
An identity pins something at rest, but not necessarily what an experiment measures. In the two-cycle feedback circuit the exact mass balance ties one complex to the bound enzyme. Three measurable quantities contain that complex to different degrees. In the feedforward mechanism, flux balance pins free output while total output acquires an input-dependent complex. Each calculation decomposes the measured quantity before judging adaptation.
The two-cycle feedback circuit, written as starting data
The design has twelve elementary steps on ten species. An input modifies a protein to , the modified modifies a protein to , the modified demodifies , and a fixed enzyme demodifies (core §7). It is the two-node network that Jeynes-Smith and Araujo reduce from Ma and colleagues' three-node design, with its four complexes written out (Fig. 2, p. 3).1 Each binding pair is followed by its catalytic step:
Here and are the binding and unbinding constants of pair , and , , and the catalytic constants, named as in the core. The input is the input total . The output is a pool of modified A, still to be chosen. The boundary is closed: no synthesis, no removal and no growth.
Six totals are tied by four conservation laws, and two independent totals move. The totals are , , , , and . Only and are conserved individually. The A-protein total and the B-protein total are conserved too. That makes four conservation laws for ten species, since the twelve steps have rank 6, so six coordinates still move (exact). Two of them are independent totals, and , with and moving opposite them. The other four are the amounts in the complexes to , which also move. The totals determine those amounts only once a binding closure is imposed (§4). The two moving totals obey exact mass balances:
Every binding and unbinding step cancels from (4), because it moves a modified molecule between its free and bound forms without changing the total that counts it.
Two kinds of constant
A complex's binding relation holds with a dissociation constant at binding equilibrium. At binding equilibrium, with , a dissociation constant. The same holds for the other three pairs.
At the steady state of the resolved model the same relation holds with a Michaelis constant. In (3) the complex forms at the rate and leaves by unbinding and by catalysis, so at steady state . That is the binding relation with the Michaelis constant . The steady states plotted below in Figures 1 and 2 are exact for both models, with each read as the constant of the model in use. The core's parameter set PT, introduced below, fixes the Michaelis constants. Its time courses set each unbinding constant to 100 times its catalytic constant, so each dissociation constant is 100/101 of its Michaelis constant (core A7).
The sequestering pair's complex has a third kind of constant. It leaves by unbinding and by removal, so at steady state with . Identity (2) needs none of these constants, because it holds at every binding allocation.
What the balance pins
At any rest the second balance fixes the ratio of two complexes, and it puts near an input-independent value only while the enzyme is saturated. Setting gives , which ties to the bound enzyme . Since ,
at every rest of (3), whatever the binding constants (exact). So lies a fraction below , and it is close to only while the enzyme is nearly saturated. Jeynes-Smith and Araujo obtain the same set point in the limit of saturated B-cycle enzymes (p. 3).1 Relation (5) gives it as an exact rest relation with an explicit correction.
Each measurable pool adds its own terms to . Three quantities can be measured: free , the partial pool and the full modified-A total . Dividing by and using (5),
exactly at every rest. The partial pool's error has two terms: the enzyme's free fraction and free . The full modified-A total adds , the complex that holds most of the memory , and the memory grows with the input. Jeynes-Smith and Araujo identify the partial pool as the quantity that tracks the set point when the B-cycle enzymes saturate (p. 5).1
At parameter set PT the terms decide each pool's range. Set PT is the core's illustrative choice: , , and , catalytic constants , and , and the Michaelis constants , , and , with concentrations in units of (core A7). Figure 1 plots the three terms against the input total. At low input the enzyme leaves saturation, and its free fraction grows. At high input grows. Free stays near 0.0041. So the partial pool stays within 5% of from to at least , the largest input computed, while the full modified-A total stays within 5% only from 0.064 to 5.23 (numerical).
Scroll inside the figure to see it at reading size.
Free is a third quantity, fixed by a binding relation. At binding equilibrium exactly. Since is near and free is far larger than every complex that draws on it, free is nearly constant: at , against the leading-order estimate (numerical). It is nearly input invariant, and it sits 99.6% below . Not tracking and not being input invariant are different failures.
The pinned quantity in the sequestering pair
In the sequestering pair the identity pins the free output, because the sensing step reads the free output. The rate law in (1) is a function of free , so (2) pins free . If part of were bound by a partner that the sensing step cannot read, the identity would still pin free , and the total of would be free to move.
Flux balance separates free feedforward output from total output
The feedforward mechanism makes a second observable distinction calculable. The input concentration drives output and degrader production at rates and . Their complex catalytically removes output at rate . Free and bound degrader are removed at frequency . Removal of bound degrader releases intact output. The measured output may be free or total . The boundary contains no separate output load or growth dilution.
The two total balances fix how much output is bound. With , a rest requires and . Dividing these relations gives a bound fraction independent of the input:
The complex balance then pins the free output. The resolved steady-state relation is , with . Since , cancellation of the positive gives
A finite positive rest requires . Free output is input invariant. Total output grows with the input because the complex stores more output. For a change , and , exactly within this model.
Checkpoint: can two readouts disagree about the same mechanism?
Take in a fixed concentration unit, , and two inputs that give and 10. Find the free and total output at each rest.
Solution. Free output is at both rests. Total output changes from to . The changed readout alone changes the adaptation verdict. These are rest calculations. Transient convergence requires its own test. §4 writes the full balances and the regime in which total output approaches the bilinear prediction.
Turn an identity into an observable: write the rest relation it imposes, decompose each measured pool exactly into the pinned quantity plus its other terms, and read each pool's range from those terms, taking each binding relation at equilibrium or at a resolved steady state as the model requires.
4A limiting law holds only in its regime, and the regime is not the range
A chemical mechanism supplies an effective controller only under specified conditions. Start with a saturated memory-removal enzyme, then apply the same calculation to modification feedback and chemotaxis. Finally resolve the feedforward mechanism. Each example separates an exact balance from its limiting law and the input range over which a named observable stays within tolerance.
Derive zero-order memory removal from a catalytic complex
The simplest chemical example isolates the approximation that creates an integrator. Output produces memory at rate . An enzyme removes the memory through . Production is composite. Binding and catalysis are elementary in this model. With fixed , the two independent species balances are
Adding the balances identifies the memory before any approximation. Define . Then exactly. Setting rewrites the same equation as
The free enzyme is the exact defect in the proposed error identity. A rest obeys .
An explicit plant supplies the missing feedback sign. Consider a measured free output supplied by the input flux and removed by a memory-dependent composite process:
The removal law is part of this illustrative model’s starting data. Here has units c/T, has units 1/T, and has units . Increasing the stored total increases the output’s removal frequency. The boundary keeps fixed and has no memory dilution. The input is a held supply flux, not a change of the reference constants.
The saturated limit gives a candidate rest with a feasibility condition. Neglecting the free-enzyme defect gives and . A positive candidate requires . Positivity alone does not keep the enzyme saturated. The free must also pass the concentration test below. §6 checks stability of this chosen plant in the same limit.
A binding closure converts the defect into a concentration condition. Under rapid reversible binding, use and . To keep the fractional defect at most a chosen , require . For 5% precision, the free memory concentration must reach at least nineteen dissociation constants: .
The same concentration test is exact at a resolved steady state with a Michaelis constant. Replace by . Using that relation during a transient needs a separate timescale argument.
A saturated modification cycle supplies high gain before feedback is closed
A modification fraction can control metabolism or transmit a signal. Glycogen phosphorylase’s phosphorylated and dephosphorylated forms motivate Goldbeter and Koshland’s covalent-modification model (p. 6840). Their calculation explains how saturated opposing enzymes can amplify a change in catalytic capacity.8 Here the input is the ratio of modifying to demodifying capacities. The output is the modified fraction. The substrate inventory is fixed, and feedback has not yet been closed.
A measured kinase-cascade switch supplies context for the gain calculation. Huang and Ferrell varied purified Mos in Xenopus oocyte extracts and measured a steep steady response of p42 MAPK (Fig. 3, p. 10083). Their analysis separates enzyme saturation from the additional steepness supplied by two successive phosphorylation encounters (pp. 10081–10082).9 That experiment does not identify every cascade with a single zero-order cycle. The calculation below isolates the single-cycle contribution.
Opposing saturated fluxes explain the switch used in the two-cycle feedback circuit. In the core’s single modification cycle, modifies and demodifies . The substrate inventory is . The modified total is .
The balance of catalytic capacities determines the modified fraction. Write and for the enzyme totals, and for their catalytic frequencies. At a resolved steady state, are the corresponding Michaelis constants. With enzymes scarce relative to , set . Balancing the two reduced fluxes gives
When and are small, this ratio stays close to one across a broad interval of away from zero and one. A small change of capacity ratio can therefore move the modified fraction far. This is zero-order ultrasensitivity. The lineage reconstructs Goldbeter and Koshland’s calculation with appreciable enzyme complexes.
A steep steady response does not by itself establish adaptation. The next construction makes one capacity depend on the controlled output and closes negative feedback. Its balances then identify the condition for approximate integration.
Binding allocation reduces the two-cycle feedback circuit
The two-cycle feedback circuit makes the second protein’s modified pool the memory. Its input is the held total . Its candidate output is the modified-A total , whose measured components were separated in §3. Increasing increases modification of B. Increasing increases demodification of A. The inventories , and remain fixed. Those two influences close negative feedback.
Protein-modification feedback can buffer biological signaling, without establishing this circuit’s exact assumptions. Fritsche-Guenther and colleagues measured weak dependence of phosphorylated Erk on total Erk in some cellular backgrounds. They linked the buffering to post-translational feedback from Erk to Raf (Results and Discussion).10 This supplies a biological reason to study modification feedback. It does not prove the four-complex circuit’s joint dominance regime or perfect adaptation to a persistent input.
Reducing the six totals to two equations needs a binding closure first. The exact balances (4) are written in complexes, and the totals determine the complexes only through binding relations such as . That relation holds at binding equilibrium when is a dissociation constant. With the Michaelis constant it holds exactly at every rest of the resolved model (3). Along a trajectory it is a quasi-steady-state assumption, which needs binding to be fast against catalysis and against changes of the input. At set PT the full model's slow eigenvalues approach the leading ones as unbinding speeds up (§6). The exact balances (4) need no closure, and the leading-order model below rests on one.
Lecture 8's method gives each total one winner, and each winner turns one term of (4) into a function of totals. The core's joint regime keeps the B cycle zero order: wins , wins , wins , wins , wins and wins . Each assumption enters (4) at one place:
- and win their totals, so .
- wins , so .
- wins , so .
- wins , so .
- wins , so free is known from totals, . It enters no term of (4) directly. It turns the other winner conditions into conditions on totals, and it fixes free (§3).
- Conservation of the A protein gives , exactly.
Substituting into (4) gives the core's leading-order model:
Each assumption has an exact error term. Subtract (7) from (4), with every free species written through the totals. With the closure for , the exact right side of the A balance differs from that of (7) by
This difference holds wherever the closure does. The exact right side of the B balance differs from that of (7) by
exactly, along every trajectory, because it uses only and . So the A balance needs small against and against , and small against . The B balance needs small against , and small against . Those are five of the six winner ratios. The sixth, , keeps the winner of its total.
The leading-order rest sets the memory in proportion to the input. Setting (7) to zero,
which at set PT is (leading order).
The full chemical mechanism preserves nonnegative concentrations. Equation (7) is a leading approximation inside the chosen joint regime. For example, its modified-A removal term remains even at , where the approximation has ceased to describe a possible allocation. A stable rest of (7) does not justify following (7) through such a boundary. Check the reconstructed species and winner inequalities along any transient that the approximation is used to explain.
Where the regime ends
At set PT all six ratios stay below one fifth for input totals from 0.052 to 20, and two of them set the ends. Figure 2 plots each losing form over its total's winner, at the exact steady states. At the lower end the memory's complex stops dominating its own total against the enzyme's complex: at . At the upper end the input starts to occupy : at , the condition that wins its total. The allocation ratio is 0.146 there, and it does not bind (numerical).
Scroll inside the figure to see it at reading size.
The leading-order model explains both ends, and only the full sweep establishes them. With (9), and , so , which reaches one fifth at . And , which reaches one fifth at (leading order). Near the upper end the leading-order rest drifts from the full model: the full memory is 0.01005 at against the leading 0.01, and 0.145 at against the leading 0.20 (numerical). So the estimates read the ends correctly here, and the check is still the sweep of all six ratios.
The regime justifies the leading-order model, and it is not any observable's range. The partial pool stays within 5% of up to at least , far past the regime's upper end, because its error (6) contains neither nor . The full modified-A total stays within 5% only up to 5.23, inside the regime, because its error adds . The regime and the two ranges are three different intervals (numerical).
Chemotaxis requires more than enzyme scarcity
The exact methylation balance counts modification events. Let be a fixed receptor concentration, the concentration of receptor-bound methyl groups, and . A complex adds one group at rate . A complex removes one at rate . Hence
The activity-only teaching law imposes further assumptions on these fluxes. Bound CheR must remain approximately constant. Demethylation must depend on activity without a separate ligand dependence at fixed activity. The relevant catalytic ratios and binding constants must also lose their dependence on stored modification. Yi and colleagues identify the corresponding assumptions in their model, including negligible activity of unmethylated receptors. Their integral coordinate approximates total methylation. It is not automatically the literal mean used in the teaching model below.4
Abundance ratios test enzyme scarcity. Li and Hazelbauer report approximately receptor monomers per CheR and per CheB. Those ratios support treating the modifying enzymes as scarce relative to receptors. They do not measure catalytic occupancy.5
Tether binding tests recruitment to the receptor. Lai and colleagues report a CheR tether dissociation constant near and substrate-site binding at least 50–100 times weaker. The core’s illustrative accessible tether concentration of gives occupancy . This calculation estimates recruitment under a well-mixed binding assumption. It does not certify catalytic saturation or the activity-only law.6
The chemotaxis teaching model places its boundary between rapid sensing and slower memory change. Its input is attractant concentration . Its measured output is receptor activity . Mean methylation is the changing memory. Enzyme abundances and effective methylation and demethylation capacities are held fixed. Receptor switching is represented by an equilibrium law, rather than by separate switching states. The reduced law does not resolve every CheB phosphorylation or recruitment step.
The teaching model treats the receptor activity as a fast equilibrium. A cluster of receptors with mean methylation , in methyl groups per receptor, and attractant is active with probability
where is the free energy of the active state less that of the inactive state, a dimensionless difference with every energy divided by the thermal energy. Here and are the attractant's dissociation constants for an inactive and an active receptor, and and set the activity's offset and its rise per methyl group (core A12, model details). The cluster is assumed to switch much faster than methylation changes, so follows and at every instant. Methylation then obeys , with CheR methylating at the rate and CheB demethylating at most at , half-maximally at the activity .
The teaching model's identity is the limit of a bounded model in which CheR's rate does not depend on methylation. In the core's teaching model CheR methylates at the constant rate , whatever the methylation . Its bounded version multiplies CheR's rate by and CheB's by , where is the number of sites per receptor (core A12, model details). Then depends on directly, not only through the activity, and the activity-only identity is recovered as and go to zero while stays away from both site boundaries. The limit is not uniform at or . With both constants equal to , the precision error after an attractant step is −2.3%, −0.23% and −0.023% at , 0.001 and (numerical, the Lecture 10 analysis).
What the identity needs is a methylation rate that depends on the state only through the activity. A CheR out of saturation breaks it: the precision error is −7.2% at and −35% at (numerical, the Lecture 10 analysis). CheB acting on inactive receptors through the activity alone does not break it. So the condition is independence from and from the attractant at fixed activity, not saturation of both enzymes (core A12).
Resolve feedforward removal before testing its reaction orders
The feedforward calculation needs a convention for degrader turnover. Input drives production of and at rates and . Their elementary binding-catalysis mechanism is . As in the core, removal acts on free and bound degrader at frequency . Removing bound degrader releases intact output. With and , the exact equations can be written as
Rapid reversible binding reconstructs the complex from both totals. At binding equilibrium, , where . The physical root is
When , both totals are mainly free and . Thus with . The reduced totals are the of §2 and §7. Their bilinear law is exact as a reduced-model definition and approximate as a consequence of this chemistry.
The observable calculation in §3 supplies the exact resolved rest. It gives , and , with . A finite positive rest requires and . The same calculation for the fast-binding model replaces by . The next test asks when that model’s total output agrees with its bilinear approximation, rather than merely whether its free output is input invariant.
Two small ratios recover the core’s bilinear prediction for total output. Require and . The fast-binding model gives the exact relative discrepancy from the leading level :
The discrepancy has two physical contributions. The first term is finite enzyme occupancy. The second is output stored in the complex. A plateau in free output therefore does not establish a plateau in total output.
The reduced bilinear model carries a weighted error integral. Its coordinate obeys . Define . Rewriting the derivative in this clock gives wherever . The laboratory-time error is weighted by , consistent with Xiao and Doyle’s change of coordinates.7
Checkpoint: when is the total within 5% of the bilinear prediction?
Use and the fast-binding model. Find the largest permitted . Then ask whether failure of this tolerance also destroys input invariance of free output.
Solution. The bound is . Beyond it the total exceeds the tolerance. Free output remains at throughout this mechanism’s positive-rest range. The tolerance concerns a named observable and a named leading prediction.
Derive the effective reaction orders from the binding allocation. State the closure, the small ratios and the measured pool before claiming adaptation.
5A pinned value needs a feasible chemical state
The identity says where a rest can be. It does not say that a rest with nonnegative amounts exists there, or that the system can get to it. In the sequestering pair the actuator can only add output, so a constant inflow above a threshold leaves no rest. In the two-cycle feedback circuit the leading-order rest needs room in both protein inventories. In chemotaxis the sites bound the memory.
The sequestering pair: one-sided actuation bounds the inflow
A constant inflow of output can be rejected only while it stays below the output's removal at the set point. Add to (1) a constant inflow of , a composite step with the rate law , and a first-order load , so that with . By (2) any rest has , and the complex's balance gives . The output's balance then fixes the actuator, and the binding balance the sensor:
Both are positive exactly when (exact). At the upper boundary the actuator the rest needs is zero and has no finite value, so the boundary is excluded. Beyond it the actuator would have to be negative.
Beyond the boundary there is no rest, and the sensor winds up. Take , , and , and an inflow of 1.25, a quarter above the boundary. Then tends to , the actuator falls toward zero, and the sensor grows at per unit time (numerical, Figure 3, left). The actuator can add output and cannot remove it, so an inflow that alone overshoots the set point is outside the class of inputs the pair rejects.
Saturating actuation gives the mirror case, the core's windup. With actuation , a removal so fast that even a saturated actuator cannot hold leaves no rest either. The output falls below the ceiling after an initial transient, and the actuator's total grows without bound for as long as the target stays out of reach, a statement about long times (core A14).
Scroll inside the figure to see it at reading size.
The two-cycle feedback circuit: room in both proteins
The leading-order rest exists only if the A protein exceeds . By (9) the memory is positive exactly when . The reason is the conservation law. At rest , so the unmodified total must stay positive for the input to have A left to modify. Set PT has (leading order).
The B protein must hold both and the memory. The B-protein total is , and the unmodified total contains . So the leading-order rest needs , which with (9) bounds the input:
At set PT the bound is 4900 (leading order). Requiring only , without counting the B held in , gives the coarser 5000.
These bounds are leading-order statements, and an exact one stands behind the first. In the full model (3) the partial pool is part of the A protein, , with equality only when . At a positive rest the inequality is strict, so there the partial pool cannot reach unless . The exact steady states show the cost of a thin margin (Figure 3, right). At and set PT otherwise, the partial pool sits 5.9% below at , 1.5% below at and within 0.01% at . At it settles at , and (5) is met by pushing the enzyme out of saturation, to (numerical).
Three intervals stay apart. The bound 4900 says where the leading-order rest stops fitting the B protein once the B in is counted. The coarser 5000 does not count it. The joint regime, 0.052 to 20, says where the leading-order model is valid at all. Neither bound describes the regime.
Chemotaxis: the sites bound the memory
The teaching model's rest must be an activity the receptors can reach, held by a methylation the sites allow. The pinned activity must lie between 0 and 1, which needs , not only (exact). The methylation that holds it solves , which fixes at :
The methylation's contribution to is the compensating action. Per receptor, the methylation contributes to and the attractant contributes , with the opposite sign. A rest holds at for every , so
per receptor: the change of the methylation's contribution cancels the attractant's term (exact). At the core's constants, , , and , the memory rises from 0.88 at to 2.63 at (exact).
The sites bound the memory, and so the range. The methylation must lie within the available sites, . With , reaches at (exact). Above that, the teaching model, which does not bound , still has a rest, but its methylation exceeds the sites: at , rising toward 5.49 as grows (exact). So above no rest lies within . In the bounded version the activity settles 98.8% below at (numerical, core A12). The sites set the range through a positivity bound, , as well as through the edge of a regime.
Check that the pinned rest exists with nonnegative amounts: solve for every species at the set point, find the inputs and inventories for which all stay positive, and name what happens beyond (no rest and windup, or a pool pushed out of saturation).
6Stability is a separate test, with every conservation law kept
A rest that exists need not attract. The sampled controller needs eigenvalues inside the unit circle. A continuous loop needs eigenvalues in the left half-plane. The chemical examples show how plant relaxation, actuation and conserved inventories determine those eigenvalues. After establishing local stability, a frequency audit asks how well the loop rejects disturbances that keep changing.
The sampled update order determines whether zero error is reached
The sampled controller needs a unit-circle test, rather than a left-half-plane test. A linear discrete perturbation decays when every update eigenvalue has modulus less than one. Use the normalized rule of §2, hold fixed, and write for the memory’s displacement from its rest. Substitution gives
Three inequalities decide strict convergence of this two-state rule. For a real quadratic , both roots lie inside the unit circle exactly when , and . Here and . Thus
In physical units the last condition is . A gain that converges at one sampling interval can fail at another. The equilibrium calculation in §2 did not contain this condition.
Integral-only control at the core’s gain repeats a six-step cycle. At , the matrix is . Its eigenvalues are , and its sixth power is the identity. From rest, a unit disturbance gives the exact sequence below. The memory is updated from the newly observed output in every row.
| Update t | Integral-only: output, memory | Combined controller: output, memory |
|---|---|---|
| 0 | 0, 0 | 0, 0 |
| 1 | 1, 1 | 1, 1/4 |
| 2 | 1, 2 | 3/4, 7/16 |
| 3 | 0, 2 | 9/16, 37/64 |
| 4 | −1, 1 | 27/64, 175/256 |
| 5 | −1, 0 | 81/256, 781/1024 |
| 6 | 0, 0 | 243/1024, 3367/4096 |
The combined controller converts that periodic motion into convergence. At , the matrix is , with eigenvalues 0 and 3/4. Both lie inside the unit circle. At the second update, for example, , , and . The output tends to zero. The memory tends to one and keeps cancelling the input.
The integral loop: the plant supplies the damping
The integral loop is stable exactly when its plant relaxes. The loop , has the characteristic polynomial , where is the Laplace variable. Both roots lie in the left half-plane exactly when and . At the roots are , and after a unit step at the loop circles its rest with amplitude 0.707 and period 4.44 (exact, core A9). The identity is the same in both cases. Only the plant's relaxation decides whether the rest is reached.
The saturated memory’s chosen plant supplies a local stability test
The complete saturated-memory example is locally stable in its leading regime. Use the chosen plant in §4 and . At its feasible positive rest, the Jacobian in the order is
Its trace is negative and its determinant is . The candidate rest therefore attracts nearby states in this leading model. The conclusion concerns the specified plant and saturation regime. It is not a certificate for memory chemistry connected to an arbitrary plant, or for the full resolved model far from saturation.
Chemotaxis: one slow state, and its rate falls as it rises
With the activity fast, the teaching model has one slow state, and its rest is stable wherever it exists. At fixed , differentiating gives
because methylation raises the activity (exact). A one-state system whose rate falls through zero at its rest returns to that rest from both sides.
The two-cycle feedback circuit: conservation supplies the damping
Linearize the leading-order model with the A inventory conserved. From (7), with , the Jacobian in the order is
Its trace is negative and its determinant positive, so both eigenvalues have negative real parts (exact). At set PT and they are .
Holding the unmodified pool fixed removes the damping. If were treated as a fixed constant, the first entry of would be zero. The trace would be 0 and the determinant still , so the eigenvalues would be at set PT: a centre, circled for ever (exact). After an input step from 1 to 3, the conserved model's peaks at and returns, while the model with fixed swings between 0 and without end (numerical, Figure 4). The full twelve-step model peaks at (numerical, core A13). The damping is the conservation law at work: modifying more A leaves less unmodified A for the input to modify.
Scroll inside the figure to see it at reading size.
The leading-order Jacobian describes the slow pair of the full model, not every entry. As binding speeds up, the full model's slowest eigenvalue pair approaches the leading one: at set PT and the two differ by 37%, 11%, 2.4% and 1.4% at unbinding-to-catalysis ratios of 1, 10, 100 and 1000 (numerical, core A13). The full model is stable at every case tested, on its six-dimensional class of fixed totals (numerical, 50-digit eigenvalues, the Lecture 10 analysis).
A good steady-state approximation can still miss a Jacobian entry. The core's analysis also uses a second illustrative set, P0, with the constants , , and , catalytic constants 1, 1, 1 and , and , so again . There the leading-order model is nearly undamped, at , while the full model's slow pair is . Keeping the term , by which draws on , restores the agreement (numerical, the Lecture 10 analysis).
The sequestering pair: what the Routh–Hurwitz test certifies
The one-stage loop's linearization is a quartic with a grouped form. Write and for the frequencies at which a free and a free are captured at the rest, in 1/T, and mark each deviation from the rest with a hat, standing for that of . To first order the deviations obey
with . Subtracting the first equation from the second leaves , the linear form of (2). With the other two equations, the characteristic polynomial of this system, divided by its leading coefficient, is
exactly. Its coefficients to , with , are all positive.
For a quartic with positive coefficients, one more condition decides local stability. Åström and Murray state the Routh–Hurwitz conditions for a quartic (eq. (2.19), p. 2-10).2 They number the coefficients of a monic polynomial from the leading term down, so their , , and are , , and here. Translated, all four roots have negative real parts exactly when all four coefficients are positive, , and . The last condition is at , with in the core's notation. The middle one then follows, because can be positive only if is.
The core's 65 terms certify local stability for every positive constant, at and , under four assumptions. The core's certificate is for the plant (1) itself: its numerator contains neither an inflow nor a load. With the characteristic polynomial multiplied through by , the core's is a ratio whose numerator, in the seven constants , , , , , and , has 65 monomials, each with a positive coefficient, over a positive denominator (exact, core A14, stability audit). A sum of positive terms cannot vanish at positive constants, so for every positive parameter set. That certifies local asymptotic stability of the positive rest, for the four-state model with positive constants, linear actuation, one plant stage and no dilution. It says nothing global, and nothing about saturating actuation, dilution or a second stage. A positive inflow is the separate case of the second optional box below.
The number 65 belongs to a choice of variables, and the sign does not. Dividing by leaves the count at 65, because is a monomial and moves to the denominator. The same , written in the rest's own coordinates , , , and , has 85 monomials once reduced to lowest terms over , again all positive (exact). The proof below shows why every term is positive, without counting.
Optional: why every positive constant gives a stable rest, in grouped terms
The proof groups the Hurwitz determinant into terms that are visibly positive. It covers local asymptotic stability of the positive rest of the four-state loop (1) with linear actuation, a first-order removal , no dilution and all constants positive. It is not a global result.
Four abbreviations are local to these proof boxes. Write for the sum of the two capture frequencies, for their product, for the frequency at which a complex leaves, by unbinding or by removal, and for the fraction of complexes that leave by removal, so that when . The later frequency audit uses for the angular frequency of a disturbance instead. The proof’s fixed complex-removal frequency is not that frequency variable.
The rest ties the feedback coefficient to the other constants. At the rest (10) with , the product of the capture frequencies is , and the feedback coefficient in (13) is . The coefficients of (13) are then
The determinant factors into three groups.
Each group is positive, so the rest is stable. Here , and positive constants make , so every term of every group is positive. If , the terms carrying vanish and each group is still positive. Hence , all four coefficients are positive, and the rest is locally asymptotically stable for every positive constant (exact).
Optional: the same conclusion with a constant inflow, wherever the rest exists
The rest (10) is locally asymptotically stable for every inflow with . The proof uses the abbreviations of the box above. With an inflow, is unchanged, and the feedback coefficient becomes , with , so . The sum does move with , and with it and .
Fix one rest, and treat as an auxiliary parameter. Freeze and at their values at the chosen rest. Then , , and are fixed, and enters only and . This is an algebraic device at one rest, not a continuation in . As a function of on , the determinant is a quadratic with second derivative −2, so it is concave.
It is positive at both ends, so it is positive in between. At the determinant is
At , takes the grouped form of the box above, evaluated at the frozen frequencies, which is positive for every positive and . It is not the determinant of the physical rest at , whose frequencies differ. A concave function lies above the chord joining its ends, so on the whole interval, including at the actual (exact). The upper boundary is excluded, and nothing follows for dilution or a second plant stage.
A plant with an mRNA stage loses stability inside a window of actuation gain, and an unstable rest is not yet a cycle. In the core's two-stage plant the actuator makes an mRNA , which makes , and the lag lets the controllers overshoot. The core's two-stage results use the annihilation controller, in which one and one remove each other in a single composite step with the rate law . At and unit constants the rest is unstable only for , and with reversible binding in its place only for (numerical, core A14). Inside the window a simulation at settles on a cycle of period 8.047 that attracts nearby trajectories. The eigenvalues show only that the rest is unstable. The simulation shows the cycle.
Audit local disturbance rejection without mistaking it for noise suppression
After stability, a frequency calculation asks which changing disturbances the loop attenuates. Use the ideal annihilation controller for this calculation, rather than replacing the reversible complex in (1) without notice:
The first species is made by the reference process. The second species is made in response to output. The positive actuation law can increase production through , reduce production through , or use both. The output is free . The boundary here has ideal shared annihilation, a dynamic plant, and no controller dilution.
The difference coordinate reveals integration and leaves one additional controller relaxation. Linearize at a positive rest. Set , and . Then
The first equation integrates output error. The second equation relaxes at frequency . For zero initial perturbations, the Laplace variable gives and .
The actuation derivatives determine which part of that memory reaches the plant. Define and at the rest. Since , the relation has
Here have units 1/T. The controller transfer has units 1/T. The local integral coefficient has units . It is unrelated to the chemotaxis attractant affinity , which has concentration units in §4 and §5.
The disturbance’s entry point determines its output transfer. For a one-stage plant , the plant transfer is . Here is an additive production disturbance in c/T. Closing the loop gives
The uncontrolled transfer from the same production disturbance is . Thus is the dimensionless ratio of controlled to uncontrolled response. It is not the dimensional disturbance-to-output transfer. A small removal-frequency perturbation instead injects , so its output transfer is . In a two-stage plant, production into mRNA has , while the transfer from output removal is . That disturbance enters after the mRNA stage.
A fair comparison holds the rest and local integral coefficient fixed. In normalized units take and . Choose derivative pairs for reference actuation, sensor repression and combined actuation. All have . These are local derivatives, not a claim that all three have the same linear production law.
A positive production law realizes those derivatives at the same rest. In physical units choose
At , its value is and its slopes are , . Set , and . The normalized comparison follows with time unit . This keeps equilibrium production fixed while changing how the controller acts.
The full controller and plant characteristic polynomials certify stability before the frequency comparison. They are respectively , and . All are stable. Combined actuation cancels the controller relaxation pole from the visible transfer, giving . The full state system still contains that stable mode.
Three measures compare disturbance amplification and distance to instability. Maximum sensitivity is , where is angular frequency in radians per time unit. It is the reciprocal of the Nyquist curve’s minimum distance from . Phase margin is the additional phase lag at a unity-gain crossing needed to reach that point. Gain margin is the factor by which loop gain can increase before losing stability. These measures answer different questions from the resting output error.
| Actuation route | Normalized controller C(s) | Maximum sensitivity | Phase margin |
|---|---|---|---|
| Reference actuation | 2.3123 | 32.613° | |
| Sensor repression | 1.2720 | 65.530° | |
| Combined actuation | 1.4679 | 51.827° |
The three routes differ in their finite-frequency response. The table gives numerical values for the stated stable one-stage plant. The gain margin for reference actuation is 3. The other two loops have no finite positive gain margin in this model.
The sensitivity integral constrains the whole frequency profile under explicit hypotheses. For a real-rational scalar loop , an internally asymptotically stable closed loop and , the Bode sensitivity integral is
The sum counts open-loop right-half-plane poles with multiplicity. None occurs in this comparison, so every route has integral zero. The integral has units 1/T. The pole at the origin represents integral action and is not a right-half-plane pole. Since near zero, the logarithmic singularity is integrable. The theorem’s high-frequency condition applies to , not to , which tends to one.2
A zero integral requires a tradeoff in attenuation, not a prescribed stability margin. Where , the log contribution is negative. Another frequency interval must contribute positively. Equal integrals do not impose equal peaks, gain margins or phase margins. Olsman and colleagues use this constraint to discuss antithetic feedback limits.11
The extra plant stage changes disturbance amplification while preserving the integral. Adding the normalized second plant stage leaves the integral zero but raises maximum sensitivity for reference actuation to 14.971 and reduces its phase margin to 4.796° (numerical). The core’s bottom appendix compares all three routes and relates the extra lag to A14’s stability window.
Changing the boundary changes which frequency conclusions remain valid. Equal controller dilution at frequency changes the controller to
Here and are evaluated at the diluted equilibrium. Its finite zero-frequency gain generally leaves a nonzero steady disturbance error. A stable loop with the same strictly proper plant still has zero sensitivity integral.
A different high-frequency plant model can change the integral itself. For an instantaneous gain , the correction is . State the plant’s bandwidth before applying the theorem.
Windup and intrinsic noise require different calculations. An overloaded actuator can have no feasible rest, so the local stable-loop sensitivity theorem cannot certify its long-time response. Intrinsic reaction noise enters through several reaction channels and depends on their covariance and transfers. A production-disturbance sensitivity alone does not determine output variance or prove stochastic mean adaptation. Those claims need the separate hypotheses in core A4.
Test stability separately from the identity: linearize with every conservation law substituted, read the trace and determinant for two states or the Routh–Hurwitz conditions for four, and state the assumptions under which the certificate holds.
7An identity survives some changes and not others
Robust to what? Name the change, and hold the reference constants fixed. The reduced incoherent feedforward loop keeps input invariance under changes of its positive rate constants when its reaction orders match and a finite positive rest exists. Its set point can still move with those constants. A load on its output breaks it. The sequestering pair rejects a load and a change of its plant, and growth dilution leaks its memory.
The incoherent feedforward loop: one product of orders
For monomial rate laws, one product of orders decides the incoherent feedforward loop's input invariance. Write the loop's composite steps with monomial rate laws (core A5):
with input concentration , orders , , , and , the orders and positive, and a finite positive rest. Then and , so
exactly. The output is input invariant exactly when . The slope contains no rate constant, so the condition is on orders alone. With general orders the constants carry fractional units, in for instance, and the slope is still a pure number.
Units fixed at the baseline show what a change of constants does. Take the first-order loop, , whose level is . Measure in that unit evaluated at the baseline constants, and keep the unit when a constant changes. Then doubling moves the set point from 1 to 2, doubling moves it to 0.5, and halving moves it to 2, while the output stays flat in each time (exact, Figure 5). Rescaling by the changed constants would print 1 every time and hide the move. The loop is input invariant, with a shifted level.
For general matched orders the level depends on the constants through powers. With , (14) gives the level , so doubling multiplies it by (exact). The first-order loop is the case .
Scroll inside the figure to see it at reading size.
A load is a new removal with an unmatched order. An input-independent sink gives the rest
which depends on : 0.5 at and 0.9091 at for unit constants and , a shift of +81.8% (exact, core A16).
Four properties stay apart. Input invariance means the output returns to the same level for every positive input. A fixed reference means that level does not move when the plant's constants change. Rejection of a load means it does not move when a removal is added to the output. Fold-change detection means the whole response depends only on the input's fold change, a further property that some feedforward loops have in a stated regime (core A6). The loop (14) with matched orders has the first property and neither the second nor the third.
Why the incoherent feedforward loop reaches its rest
The monomial model has a triangular stability test. At a finite positive rest of (14), with positive rate constants and , the degrader equation does not depend on . The Jacobian is triangular, so its eigenvalues are its diagonal entries:
Both are negative. Thus every such rest is locally asymptotically stable, whether or not the orders satisfy the input-invariance condition . Stability and adaptation are different tests here too.
The first-order model also gives a direct convergence argument. For a held positive input, . Once approaches its positive rest, the output equation is a scalar linear equation with a positive removal coefficient approaching . Its integrating-factor solution converges to . At zero input the coefficient instead decays to zero, so the argument no longer pins the output. This supplies the convergence claim used in the audit table.
The sequestering pair: a load is rejected, growth leaks
With and held fixed, the pair rejects a load and a change of its plant. A load changes the rest's actuator to and leaves , wherever (10) stays positive. Over 20 random sets of the plant's constants the rest stays at (numerical, core A16). Changing or changes the reference itself, which is why both are held fixed in the comparison.
Growth dilution changes the identity itself. Dilute every species at . Free and bound controllers are diluted alike, the complex cancels from the difference of the totals, and the free controllers leave a leak:
The leak depends on the controllers, not on the output, so (17) is no longer error-only. At a rest the signed relative error is , so its sign is opposite to that of . At the baseline constants of §5 the actuator exceeds the sensor, so the rest falls below : the error is −0.98%, −4.9% and −9.8% at , 0.05 and 0.1, with in units of the baseline removal rate. At a doubling of moves from 0.9025 to 0.8272 (numerical, core A14).
The compensator and chemotaxis
The subtractive compensator survives a change of the disturbance and not a change of the plant. Set to on the plant with , it leaves the offset when the input gain changes, while the integral loop still rests at zero error (exact, core A9).
In chemotaxis a change of protein level moves the reference and keeps the identity. Cutting CheR tenfold moves the pinned activity from 1/3 to 0.0175 and lengthens the half-time of the return from 1.85 to 17.5, and the return stays exact within the model’s feasible methylation range (numerical, core A12).
Ask what a claim is robust to: hold the reference constants fixed, express outputs in units fixed at the baseline, and test input invariance, a fixed reference, a load and growth dilution as separate changes.
The audit collected and transferred
Every model's outcome at every step in one table, and the six steps run on a network the core does not treat.
8The audit table records each model's outcome at every step
Collected, the six steps give one table. Each row is a model in its stated case, and each cell is what that step found there. No single step settles a model, and some cells hold only under a stated assumption.
| Model | 1 Identity | 2 Observable | 3 Regime | 4 Positivity and reach | 5 Stability | 6 Changes |
|---|---|---|---|---|---|---|
| Sampled proportional and integral control (core §3) | Output error for active integral memory | Exact for the specified new-output update | Signed engineering coordinates. Memory stores the held disturbance. | and . Integral-only gain one is periodic. | Rejects any constant normalized disturbance within this linear model. Sampling interval changes the normalized gains. | |
| Integral loop (core A9) | error-only, | , pinned at 0 | none: linear and exact | signed coordinates; one species cannot hold across its whole range (core §3b) | stable for ; a centre at | rejects any constant , for any positive and |
| Subtractive compensator (core A9) | none: no memory | the output never moves at | none | signed coordinates | the plant's own | a change of input gain leaves |
| Saturated memory removal (core §4) | exact balance | at rest | complex dominates enzyme total. Binding closure translates this into a concentration condition. | Chosen plant: , and free memory passes the saturation test. | Chosen plant is locally stable in the saturated leading model. Memory chemistry alone gives no certificate. | unsaturated enzyme or memory dilution adds a defect. Enzyme capacity and sensing set the reference. |
| Chemotaxis teaching model (core A12) | error-only, depends on alone | activity, | a limit: CheR's rate free of ; error of order | ; methylation within the sites, to | stable: one state, rate falling with | CheR level moves and keeps the return |
| Two-cycle feedback circuit, set PT (core A13) | exact mass balance (4) | ; partial pool within 5% from ; full total to 5.23 | leading-order model (7) valid for from 0.052 to 20 | leading order: and | leading model stable with the A protein conserved, a centre if it is frozen; full model stable at the cases tested | input rejected within each pool's range; and move |
| Sequestering pair, one-stage linear plant (core A14) | exact mass balance, error-only (2) | free | none: exact at every binding allocation | ; windup if actuation saturates | locally stable for every positive constant (one stage, linear actuation, no dilution); an mRNA stage gives an unstable window | rejects , and plant constants with fixed; growth leaks (17) |
| Incoherent feedforward loop, bilinear removal (core §9) | weighted, | exact for the stated bilinear laws. Their chemical derivation needs mostly free totals and rapid binding (§4). Monomial laws need | reduced model: . Resolved mechanism also needs | reduced model stable for | input invariant with a shifted level; a load breaks it (16) | |
| Resolved feedforward mechanism (§4) | exact total balances and complex balance | free is input invariant. Total includes an input-dependent complex. | rest relations are exact with . Bilinear removal in totals requires a binding closure and mainly free species. | and for a finite positive rest | the reduced model’s test does not by itself establish stability of the resolved model | the rest relations use the stated bound-degrader removal convention. A different removal or readout needs a new calculation. |
| Closed module (§9) | error-only in , (20) | free | none for mass action; a Michaelis constant if resolved | a positive rest exactly when , reached from every | stable on the line of fixed total | total rejected; a load or growth keeps the identity but removes the positive rest, unless the boundary opens |
Read down a column, and each step catches a different kind of failure. Step 1 separates integration from matching and from an error that the output holds. Step 2 separates the pinned complex from the measured pools. Step 3 separates exact identities from limiting laws. Step 4 finds the inputs and inventories outside which no rest exists. Step 5 finds plants on which a feasible rest is not reached. Step 6 separates changes that alter the identity from changes that move only its reference.
The six-question audit does not by itself prove global stability, stochastic adaptation or the need for an integrator. The linearization tests of step 5 are local: a certificate for every positive constant still concerns the neighbourhood of one rest. Convergence from far away needs an argument of its own, such as the exact solution with which §9 proves convergence from every within a class of fixed total. The mean of a noisy network needs its own theorem, under its own hypotheses (core A4). Whether a network must contain an integrator is a question for the internal model theorems, each under its hypotheses (core §3a, A10 and A1).
Place any adaptive model in the audit table by filling its six cells, each with the outcome for a stated case and the assumption it rests on.
9A protein whose inactive form converts its active form, audited in six steps
The audit transfers to a network the core does not treat in full. This is the logarithmic memory construction introduced in §2. In Shinar and Feinberg's two-species module, an inactive form converts the active form into more of itself and recovers on its own. The six steps find an error-only identity in a logarithm, a free active form pinned at one value, no limiting law for the stated rate laws, a threshold total below which no positive rest exists, a stable rest only once the conservation law is kept, and a class of changes that depends on the model's boundary.
The starting data
A protein has an active form and an inactive form , and the inactive form converts the active one. Shinar and Feinberg introduce absolute concentration robustness with this toy mass-action system (eq. (1), p. 1389).3 In their notation is the active form, the inactive form, and and are the rate constants. Here they are renamed, because , and already have other meanings in the core:
Both are elementary mass-action steps, as the paper treats them, so each carries its rate constant: the conversion constant , second order, in , and the recovery constant , first order, in 1/T. The rate equations are
The input is the protein total . Shinar and Feinberg take synthesis and degradation to be slow, so the total is constant over the time the module takes to equilibrate (p. 1389). A change of total is therefore the persistent step. The output is the free active form . The boundary is closed: no synthesis, no degradation and no growth on that time scale. This page calls the system the closed module.
What is new here, relative to the core, is everything after the identity. The memory of this module is the core's third route, multiplicative growth, whose logarithmic identity the core states for an abstract memory in A2. That statement has no plant, no conservation law, no boundary and no stability test. This module is a fully specified reaction list from the literature, closed by a conservation law: its memory and its output are two forms of one protein, its input is their total, and its stability needs that conservation law.
Step 1: an error-only identity in a logarithm
The inactive form's rate equation is a weighted error identity, and its logarithm is error-only. From (19), , a weighted error identity whose multiplier pins only where is positive. Fix any positive reference concentration , so that the logarithm is dimensionless. On ,
exactly: an error-only identity with the set point , a concentration. The memory is a pure number, and its rate is a frequency. The action is the conversion flux , in c/T, which at rest balances recovery. The disturbance is the added protein.
Shinar and Feinberg's theorem certifies from the network's structure that the active form takes one value across positive rests, and the rest equations give that value. Their theorem concerns a mass-action system that admits a positive steady state, whose network has deficiency one and contains two nonterminal nodes differing only in one species. It concludes that this species takes the same value in every positive steady state (pp. 1390–1391).3 The theorem does not say what that value is, whether the rest is stable, or which rest the system reaches. Step 2 gives the value, and steps 4 and 5 the rest.
The module meets the theorem's structural hypotheses. A node is a combination of species at the head or tail of an arrow. Nodes that can each be reached from the other along arrows form a strong-linkage class, and a class is terminal when no node in it reacts to a node outside it. The nodes of terminal classes are terminal, and all other nodes are nonterminal (p. 1390). The deficiency is the number of nodes, less the number of connected pieces of the reaction diagram, less the number of independent reaction vectors. Network (18) has four nodes, , , and , two connected pieces and one independent reaction vector, so its deficiency is 4 − 2 − 1 = 1. Each node forms its own strong-linkage class, and those of and are terminal. So and are the nonterminal nodes, and they differ only in (exact).
Step 2: the free active form is pinned
Every positive rest has the same active form, and the inactive form holds the rest of the total. Setting (20) to zero gives and (exact; Shinar and Feinberg's eq. (3), p. 1389). The observable that returns is free . The total is the input itself, and holds it. A readout of total protein would show no return at all, and only a readout specific to the active form shows the adaptation. In Figure 6 (top left) a bolus of active protein raises the total from 2 to 4: jumps to 3 and returns to 1, while rises from 1 to 3 (numerical).
Scroll inside the figure to see it at reading size.
Step 3: no limiting law, while every step that changes is first order in
For the stated mass-action laws no limiting law is needed. Identity (20) holds exactly because every step that makes or removes is first order in : conversion at , recovery at . The regime question returns as soon as a step is resolved into substeps or made composite.
Resolving the conversion keeps the active form invariant across positive rests, moves its value to and changes the kind of identity. Let the conversion pass through a complex :
with the total . The logarithm of free now changes at , which is not error-only. An exact mass balance survives: . At any rest the complex's balance gives , with the Michaelis constant , and the mass balance then gives at every positive rest (exact). So the active form still takes one value across positive rests, but that value is . It equals the mass-action value only when .
The pinned value carries a Michaelis constant, not a dissociation constant. exceeds the dissociation constant by . With , and , while the dissociation constant is 0.9. Then , the mass-action constant of Figure 6, and free settles at 1 for totals 2 and 4 (numerical).
A saturable recovery makes the identity a limiting law. If recovery were a composite enzymatic step with the rate law , the logarithm of would change at , and the rest would have , which depends on the total through . At and , the active form settles at 0.586 for a total of 3 and at 0.298 for a total of 6 (exact roots). The return is exact only in the limit , where recovery is first order again.
Step 4: a threshold total, and a rest reached only from a positive memory
A positive rest exists only above a threshold total, and only a positive memory reaches it. By step 2, exactly when , Shinar and Feinberg's condition (p. 1389). The face is invariant, because no step makes from nothing, so the rest is reached only from . Below the threshold the only rest is , , and the output simply equals the input. On the line of fixed total the boundary rest has the eigenvalue and the positive rest its negative, so the two exchange stability at the threshold (exact; Figure 6, top right).
Step 5: stability needs the conservation law
The two-dimensional linearization has a zero eigenvalue, and that eigenvalue is the conservation law. At the positive rest the Jacobian of (19) has the eigenvalues 0 and . The zero eigenvalue's right eigenvector is (0, 1). A perturbation along it changes the total and lands on the neighbouring rest of the new total, because every point with and is a rest. Its left eigenvector is (1, 1), which expresses the conservation law: no trajectory leaves its class of fixed total. Within the class the direction (1, −1) has the eigenvalue , so the rest is stable there (exact). A reader who linearizes without the conservation law sees a zero eigenvalue and can conclude nothing.
On the line of fixed total the module relaxes from every positive memory. Substituting into (19) gives the logistic equation , whose solution
converges to from every (exact). Integrations of the full two-dimensional system match it to within of the total in 60 random cases (numerical). This convergence is derived here. The theorem of step 1 does not provide it.
Step 6: the changes the identity survives depend on the boundary
In the closed module a load or growth leaves the identity intact and removes the positive rest. A change of total above the threshold is rejected (steps 2 and 4). A change of or moves the set point, as a change of a reference constant should. A load on the active form does not enter , so (20) holds exactly, but the total now falls, . At a positive rest would equal , so the total would keep falling, and no positive rest exists. Growth dilution keeps the identity error-only, , with a shifted target, but drains the pool (exact). In both cases the adaptation claim fails at step 4, positive feasibility, while the identity survives.
Robustness to a change of total is not rejection of a sustained inflow. A constant synthesis of at the rate , with nothing removed, gives , and no rest exists at all (exact). The closed module's claim holds the total fixed after each change. It says nothing about a flow through the module.
Opening the boundary gives a different model, with its own rest. Add synthesis of the active form, a load on it and growth dilution of both forms, each a composite step: with the rate law , with the rate law , and growth removing and with the rate laws and . Then
This page calls it the open module. For its positive rest is and , positive exactly when . Its Jacobian there has the trace and the determinant , so the rest is stable (exact).
In the open module, growth moves the set point and leaves the identity error-only. Now . Growth enters as a constant, so it shifts the set point to , and neither the synthesis rate nor the load enters at all (exact). Within the feasible region the open module therefore rejects changes of both. At , with , returns to 1.2 after the synthesis rate doubles and again after a load is added, while moves from 1.3 to 3.8 to 2.0 (numerical, Figure 6, bottom).
The open module answers growth differently from the sequestering pair. The pair's leak in (17) depends on the controllers and breaks the error-only form. Here dilution acts on the memory at first order, the same order as recovery, so it merges into the recovery constant and only moves the set point.
Without growth the open module has a positive rest at only one synthesis rate. At a positive rest needs and a balanced total, so it exists only at the matched rate (exact).
With a positive load, the boundary rest exists at every synthesis rate, and it attracts only below the matched rate. For the rest has the eigenvalues and . At they are −1 and −0.5 at , and −1 and +1 at (exact). Above the matched rate no positive rest exists, and the boundary rest persists but is unstable. The face stays invariant, so unbounded growth needs . At every start on the face goes to the boundary rest (2, 0). A start at leaves it, and the inactive form grows to 191 by , at a rate approaching (numerical).
Synthesis into the inactive form breaks the identity. If the protein were made as instead of , the logarithm of would gain the term , and the identity would no longer be error-only. At , unit constants and no load, then settles at 0.976 for a synthesis rate of 0.5 and at 0.989 for 1 (exact roots), so the output follows the input.
The audit's verdict
The closed module adapts exactly to a change of its total, above a threshold and from a positive memory, and its stability needs the conservation law. Its row in the audit table: an error-only identity in ; free pinned at ; no limiting law for the stated laws, and a Michaelis constant once the conversion is resolved; a positive rest exactly when , reached from every start with ; stability on the line of fixed total; a change of total rejected, while a load or growth leaves the identity intact and removes the positive rest unless the boundary is opened. Shinar and Feinberg add a caution of their own: reverse reactions omitted from such models, and interactions with the rest of the cell, should leave the robustness strong but imperfect in vivo (p. 1391).3
Run the six steps on a network you have not seen: write its starting data, find its identity and the free form it pins, check whether a limiting law is needed, find the totals and starting states that allow and reach a positive rest, keep every conservation law in the linearization, and name the changes it survives, including opening its boundary.
References
- C. Jeynes-Smith and R. P. Araujo, “Protein–protein complexes can undermine ultrasensitivity-dependent biological adaptation,” Journal of the Royal Society Interface 20, 20220553 (2023). Fig. 2 and its caption, p. 3: the two-node network reduced from Ma and colleagues' three-node design, with its four complexes to . p. 3: the set point in the limit of small Michaelis constants in the opposer cycle. p. 5: the complex and the partial pool , which track over a range of inputs when the opposer cycle's enzymes saturate. publisher local full text
- K. J. Åström and R. M. Murray, Feedback Systems: An Introduction for Scientists and Engineers, second edition, Princeton University Press, electronic edition v3.1.5 (2020). p. 2-9: the characteristic polynomial, with its coefficients numbered from the leading term down, and stability as all its roots having negative real parts. p. 2-10, eq. (2.19): the Routh–Hurwitz conditions for a fourth-order polynomial. Theorem 14.3, p. 14-6: the Bode sensitivity integral for a loop with adequate high-frequency decay. Exercise 14.3, p. 14-31: the high-frequency correction for relative degree one. local full text
- G. Shinar and M. Feinberg, “Structural sources of robustness in biochemical reaction networks,” Science 327, 1389–1391 (2010). p. 1389: the definition of absolute concentration robustness; the toy module A + B → 2B, B → A, eq. (1), with its rate equations and positive steady states, which exist when the total exceeds , eqs. (2) and (3); and the module A ⇄ B, which lacks the property, eqs. (4) and (5). pp. 1390–1391: nodes, linkage classes, deficiency, nonterminal nodes and the theorem. p. 1391: omitted reverse reactions and interactions in the cell make the robustness imperfect. publisher local full text
- T.-M. Yi, Y. Huang, M. I. Simon and J. Doyle, “Robust perfect adaptation in bacterial chemotaxis through integral feedback control,” PNAS 97, 4649–4653 (2000). The four biochemical assumptions and the weighted methylation coordinate, pp. 4650–4651. publisher local full text
- M. Li and G. L. Hazelbauer, “Cellular stoichiometry of the components of the chemotaxis signaling complex,” Journal of Bacteriology 186, 3687–3694 (2004). Discussion, “Loosely bound components” and “Conclusions”: receptor-to-enzyme ratios and representative cellular counts. publisher local full text
- W.-C. Lai, L. A. Barnakova, A. N. Barnakov and G. L. Hazelbauer, “Similarities and differences in interactions of the activity-enhancing chemoreceptor pentapeptide with the two enzymes of adaptational modification,” Journal of Bacteriology 188, 5646–5649 (2006). Opening mechanistic comparison: tether and substrate-site affinities reported from the cited binding studies. full text local copy
- F. Xiao and J. C. Doyle, “Robust perfect adaptation in biomolecular reaction networks,” 2018 IEEE Conference on Decision and Control, 4345–4352 (2018). Sections III.C.2 and III.F: change of coordinates and the feedforward integral construction. publisher local full text
- A. Goldbeter and D. E. Koshland Jr., “An amplified sensitivity arising from covalent modification in biological systems,” PNAS 78, 6840–6844 (1981). p. 6840: phosphorylated and dephosphorylated glycogen phosphorylase motivates covalent modification. pp. 6840–6842: opposing saturated enzymes and the steep steady modification response. publisher local full text
- C.-Y. Huang and J. E. Ferrell Jr., “Ultrasensitivity in the mitogen-activated protein kinase cascade,” PNAS 93, 10078–10083 (1996). pp. 10081–10082: enzyme saturation and the two-collision phosphorylation mechanism. Fig. 3, p. 10083: purified Mos versus p42 MAPK activity in Xenopus oocyte extracts. publisher local full text
- R. Fritsche-Guenther and colleagues, “Strong negative feedback from Erk to Raf confers robustness to MAPK signalling,” Molecular Systems Biology 7, 489 (2011). Results and Discussion: phosphorylated Erk versus total Erk, cellular-background dependence, and fast post-translational feedback from Erk to Raf. The perturbation is protein abundance, rather than this chapter’s persistent input to a four-complex model. publisher local full text
- N. Olsman and colleagues, “Hard limits and performance tradeoffs in a class of antithetic integral feedback networks,” Cell Systems 9, 49–63.e16 (2019). Box 2, pp. 53–54: the Bode sensitivity constraint applied to antithetic feedback. The precise high-frequency hypothesis is stated here using Åström and Murray’s theorem. publisher local full text
Every curve and number on this page is a model calculation at the stated illustrative parameters, labelled exact, leading order or numerical, except where a value is attributed to a cited source with its page. None is a fit to data. The audit scripts, their data and the figure generator are kept in the Lecture 10 research directory.