Five behaviors of binding and catalysis, derived and placed
The full five-step comparison for each behavior, then every result placed at its parameter conditions, read backwards for design, and bounded by what the regime enumeration of a written mechanism guarantees.
This chapter is the derivation companion to the core. The core shows five behaviors that cells build from binding and catalysis: the sign of regulation, a threshold, memory, adaptation and a rhythm. It explains each one by the allocation of a finite pool. Here each behavior is derived in full, with every model written out, every limit taken explicitly and every number traced to a calculation. Nothing below assumes an equation from the core.
The chapter has one method and one destination. The method is a five-step comparison between a binding-catalysis model and the effective rate law usually written in its place. The destination is a table that puts each example, and each published result about the same behavior, at the parameter conditions where it holds. A reader who finishes should be able to take a mechanism this page never mentions, run the five steps, and place a result on that table.
Parts 2 to 6 run the comparison on the five behaviors, one part each. Part 7 collects them. It shows that every boundary on the placement table has been derived, reads the table backwards for design, and states what the enumeration of regimes guarantees about a written mechanism and what it leaves to the closed dynamics. The lineage tells how the field reached each verdict. This page cites the literature for authority only.
A bare species symbol is a free concentration: , , . A total, the sum over every state that contains a constituent, is . A complex of A and B is , and the dissociation constant of a pair is , or a labelled K when a page carries several. An elementary step gets a straight arrow with its microscopic constants. A composite step, such as transcription, translation, degradation or dilution, gets a bare squiggle, and its rate law is written beside it.
Every number carries one of four labels, stated where it appears. Exact means exact within the stated reduced model, usually a closed form. Leading order means a limit or a dominance approximation, with its condition named. Numerical means a model prediction computed at stated illustrative parameters. Reported means a measurement or a stated value in a cited source, with its page. No number here is a fit to data.
A fair comparison
What is compared, how an effective law sits inside a binding-catalysis model, and what matching the two can and cannot fix.
1A behavior is a property of the closed loop
A response curve describes one experiment on a binding layer. A behavior belongs to the vector field on the totals, once production and removal close the loop.
The object of comparison is a vector field on totals, so we build one concretely first. Take a protein X that binds one partner Y. Binding is the elementary pair
where is the association rate constant, the dissociation rate constant, and their ratio, the dissociation constant, a concentration. Binding moves molecules between states without changing how many X there are. The totals count every state:
Binding is fast against everything else, so at every instant the pair sits at equilibrium, . Given the totals, eqs. (1) and (2) fix every free species and complex. That is Lecture 8's binding layer.
Production and removal change the totals, and that closes the loop. Suppose X is made by a composite step whose rate law depends on the binding layer, for instance on how much of a promoter is free. Its total then obeys an addition-removal balance:
Here q collects the totals and b the binding constants and activities. The binding layer computes the production law from the totals, and the balance moves the totals. A behavior is what this closed loop does.
The removal term has a rule, and the rule is part of the model. If free X is removed at frequency and bound X at , the loss is . We write for the bound-to-free removal ratio. Growth dilution removes every state alike, so and the loss is , a function of the total alone. Removal of free X only, for example by a protease that cannot reach bound X, has , and binding then protects X. These are the two variants Lecture 8's coda handed over. Part 6 shows that the whole range of matters.
A behavior is one of four properties of that vector field. It can be how a steady state depends on a total, how many attractors exist, how far the output returns after a sustained step of input, or whether a stable cycle exists. The first is a static input-output behavior and the other three are dynamical. A steep response curve of the binding layer alone, measured at fixed totals, is a static relation of that layer, and a count of binding states is a property of the layer too. The loop can turn either into different closed-loop behaviors or into none.
Each comparison in this chapter runs five steps, and each step removes one ambiguity.
- Model. Write the elementary binding steps, the composite production and removal steps with their rate laws, the totals, the removal rule and the observable.
- Limit. Derive the effective rate law as a limit of that model, and name the assumptions that make it exact.
- Match. Choose parameters so that both give the same response at one reference condition.
- Move a total. Change what a cell changes: an input total, a regulator total, a site number, a removal rate.
- Close the loop. Read the behavior from the closed dynamics: steady states, their stability, the error after a step, or a cycle.
Two of the five steps exist to keep the comparison fair, and two to make it informative. Step 2 makes the effective law a correct answer to a narrower question, not a strawman. Step 3 prevents a difference of scale from posing as a difference of mechanism. Step 4 is where the two models can part. Step 5 decides whether the parting is a difference in behavior.
State a behavior as a property of the closed vector field on the totals, with the removal rule named by its bound-to-free ratio , and plan every comparison as model, limit, match, move a total, close the loop.
2One binding pair supplies the elementary calculation
Most effective laws in this chapter are the binding pair of eq. (1) evaluated in one of its regimes, and the multisite and multimer laws of Parts 3 and 4 are assembled from the same calculation. Drawn on the pair's map, a law is a cut that stays on one side of a boundary.
The pair has an exact solution, and the effective laws are its limits. Write the pair generically as , with totals and . Substituting and into gives a quadratic, with . Its physical root is the smaller one, written without a cancelling difference:
The root lies between zero and the smaller total, as a complex must.
Lecture 8 sorts the pair into four regimes by which term wins each total. A regime names the winner of first, then the winner of . Keeping only the winners and the binding relation gives one monomial law per regime. Each law is accurate to leading order deep inside its sector, where the stated inequalities hold with a wide margin:
| Regime | Leading-order law | Sector where the law is accurate |
|---|---|---|
| and | ||
| , | and | |
| , | and | |
| and |
The last regime is singular, and for a structural reason. The complex wins both totals, so the two winner equations, and , select the same column and leave E and S undetermined. Its law needs one more balance. The difference of the totals is exact, , so near the ray , and binding gives . A small free pool of size survives where nearly everything is bound. The condition needs the difference of the totals to be small on that scale, not merely the totals to look close on a log plot.
The sector lines are leading-order boundaries, not exact ties. An exact tie is an equal contribution of two terms to one total. Free and bound E contribute equally where , and binding then forces , so the tie lies on the curve . Free and bound S tie on . The leading-order map draws the first of these as , which differs from the exact curve by at most a factor of 2. Lecture 8 guaranteed agreement within such bounded factors and no more. A tie marks a boundary between two regimes. It is a different thing from the singular regime above, where the winners are dependent.
The Michaelis-Menten law is the pair wherever the free substrate wins its own total. If , then and give
The condition holds in the regimes and , that is when or . This validity condition is the one Liu, Ren and Xiao derived for the law.1 Outside it the substrate is held in the complex, and eq. (5) has no way to say so.
The Hill law with coefficient 1 is the free partner on a weak cut. Hold far below , the partner in trace, and sweep . The free species S then wins its total, so , and the free fraction of the partner is
This is a repression law of Hill coefficient 1 in the total . Its log-slope, , never reaches 1. A promoter in trace read by a repressor is this cut.
A titration switch is the same partner on a tight cut. Hold far above . Below the ray, where , the complex holds nearly all of S, and the free partner falls only as the sites fill, . Above it, where , the complex holds nearly all of E, the free S is , and . The law needs the further excess . Between these the free partner drops by a factor of order , passing through on the ray. A promoter pool read by a repressor whose total passes the pool is this cut, and Parts 4 and 6 use it.
Scroll inside the figure to see it at reading size.
Only the winners of the conservation sums are a dominance regime. A regime is a choice of one winning term per total, nothing more. The observable, the controlled input and the removal rule are separate model choices. A different observable reads the same allocation differently, as free and total output do in Part 5. A different removal rule changes the vector field without changing any allocation. A different architecture changes the conservation sums themselves. All four must be named to interpret a result, and only the first is a regime.
A cut's height decides the kind of response, and the height is a ratio of totals to . Below the corner a cut breaks once, at , where one total changes winner, and the response is graded. Above it a cut crosses the singular ray, where in the leading-order map both totals change winner together, and the response switches. At finite binding the two exact ties stay distinct: on a cut at fixed they sit near and . Between them lies a broad intermediate band, and the free partner's collapse is concentrated in a much narrower rounding layer of width about around the ray. Lecture 11 develops the general geometry of such maps for networks with many pairs. This chapter needs only the one-pair map, applied once per example.
Locate an effective law as a cut through a binding pair's map: name the regime it stays in, write the condition on the totals that keeps it there, and predict a switch wherever a path crosses the singular ray.
3Matching fixes one scale and leaves the totals free
Matching two models at a reference condition sets one constant for each quantity matched. It does not make the models equivalent, because it says nothing about how either one stores a total.
A match sets as many constants as it equates. To match a floor, a ceiling and a midpoint of two response curves, one chooses three parameters. The choice is a calibration, a fact about the parameters, not about the mechanisms. The binding-catalysis supplement of the lecturer's group makes the same point about a matched pair of induction circuits: the equality of the fitted curves is a calibration choice, not an identity of the full equilibrium.2
A match leaves three things free. It leaves the inventories: how much of each total sits in complexes rather than free. It leaves the joint states, such as which promoter states coexist. And it leaves the response to a total the match did not touch. Step 4 moves exactly such a total.
A match can move the two models to opposite sides of a regime boundary. Part 2 matches an induced activator to an induced repressor in free inducer. The match forces the activator to bind its inducer about times more weakly than the repressor does. On the map of Figure 1, it puts the activator's inducer pair near the corner and the repressor's far above it. The two circuits then answer a change of inducer total in opposite ways, and the match itself predicted it.
A contrast is stated with its conditions, and only a counterexample under those conditions refutes it. Each contrast below names its model, its observable, its controlled input, its removal rule and the one parameter it moves. A reproduced counterexample under exactly those statements would refute that contrast. A second successful fit of the effective law refutes nothing. The law should keep working wherever its regime holds, and it can agree by accident outside it.
After matching two models, list what the match fixed and which totals it left free, check where each model's pairs sit on the map, and state every contrast with the conditions a counterexample would have to meet.
Sign of regulation
An inducer can turn a gene on through an activator or through a repressor. Matched in free inducer, the two circuits compute different functions of the inducer total. The core draws the two circuits side by side.
4The repressor circuit reduces to one equation
A repressor circuit has five binding species, but its equilibrium is one monotone equation for the free repressor, and its output reads that free repressor.
1 · Model, repressor. The job is to switch on a gene, the output protein G, when an inducer I appears. The repressor R binds the promoter D and blocks expression. The inducer binds the repressor, and the complex cannot bind the promoter. The binding steps are elementary, and expression and removal are composite:
Here a is the expression activity of a free promoter and the removal frequency of the output. The two dissociation constants are and . The letter pair in a subscript names the partners. At equilibrium and , and the three totals are
Every species follows from the free repressor. The promoter total and its binding relation give and . The inducer total gives, in the same way, . Substituting both into the repressor total leaves one equation for R:
The left side rises strictly with R, from zero at to at least at . So eq. (9) has exactly one root in , for every set of totals.
The output reads the free repressor. Production is , so the production per promoter, in units of the free-promoter activity, is
This is the observable throughout Part 2. Because it reads a free species, it inherits the titration switch of §2 whenever the inducer total drives the free repressor across a ray.
The illustrative parameters put the repressor far above its operator constant. In nanomolar, , , and , a trace promoter. The excess of the repressor over its operator constant is . These are model parameters chosen for clarity, not measurements.
Reduce a one-promoter repressor circuit to the single monotone equation (9) for the free repressor, and read its output as the free-promoter fraction (10).
5The activator circuit reduces to one equation, and its order is capped
The activator circuit also reduces to one equation, for the inducer-bound activator. Its output is a complex, and a complex holding one inducer can never rise faster than the inducer total.
1 · Model, activator. The activator A binds the inducer, and only the complex binds the promoter, as . The free activator cannot bind the promoter. Both promoter states express:
The constants and are the activities of the free and the loaded promoter. At equilibrium and , with totals
Every species follows from the inducer-bound activator. Write . The promoter gives . Let be what the complexes hold of both the activator and the inducer. Then and , and the binding relation of the pair becomes
The left side falls and the right side rises as c grows from zero to the point where . So eq. (13) has one root. The production is , and the rise above the floor is proportional to the active complex.
The active complex never rises faster than the inducer total, and the proof takes two observations. First, the share of the inducer that sits in the active complex depends only on the free activator and the free promoter. Second, both fall when inducer is added. Take the first. Every species is a product of free constituents, and , so the free inducer cancels from the share:
This share rises with A and with D.
The second observation follows from the Jacobian of the totals, which is positive definite. Differentiate the totals with respect to the logarithms of the free constituents A, I and D. Each species contributes its concentration once for every constituent it contains, so the Jacobian is the symmetric matrix
It is positive definite, because for any vector w the form is a sum of species concentrations times squares. Adding inducer at fixed and changes the free logarithms by times . The two entries of that matter are cofactors:
The first numerator is nonnegative because . So free activator and free promoter both fall as the inducer total rises, the share (14) falls, and
The lower bound holds because rises as D falls. This is exact for every parameter set of the circuit (11), promoter loading included.
An order of at most 1 caps the Hill coefficient at 2. Measure steepness by , where and are the inputs giving 10% and 90% of the rise. The normalized rise is , and by eq. (17) its log-slope is at most 1. A ninefold rise of the response, from 0.1 to 0.9, then needs at least a ninefold rise of input. So and , whatever the parameters. The repressor's output (10) reads a free species, which carries no such bound. The lecturer's thesis states the general form of this dichotomy: an activating regulator acts through a complex, whose order in a total is bounded between 0 and 1, while a repressing regulator acts through a free species, whose order can become arbitrarily negative under tight binding.3
Reduce the activator circuit to eq. (13), and bound its response without computing it: the active complex has order at most 1 in the inducer total, so its Hill coefficient in that total is at most 2.
6Three assumptions give one free-inducer law
With binding at equilibrium, the free inducer clamped and the promoter in trace, both circuits become one Michaelis-Menten law with a floor. Matching them costs one affinity ratio of about .
2 · Limit. Three assumptions give the usual effective law. Binding is at equilibrium. The free inducer I is the controlled input, as when a large medium holds it fixed. The transcription factor far exceeds the promoter, and , so loading the promoter does not deplete the factor. The fast subsystem removed is the binding layer, justified by binding equilibrium. The promoter in trace is a dominance choice: the factor wins its own total.
The repressor circuit becomes Michaelis-Menten in free inducer, with a floor. With the promoter in trace, the free repressor is the share of its total that holds no inducer, . Substituting into eq. (10) and rearranging,
The floor is the leak of a repressed promoter, and the rise above it is half complete at the free inducer .
The activator circuit becomes the same form. With the promoter in trace, the inducer-bound activator is , and the loaded fraction of the promoter is . With that fraction rearranges to . The production per promoter is times the free fraction plus times the loaded fraction. Its half-rise point is .
3 · Match. Three choices make the two laws identical. Give both factors the same excess, . Set the activities so that the floors and ceilings agree: the floor needs , and a ceiling of 1 then needs . Equal half-rise points need
At the illustrative parameters and in both circuits. The exact circuits then agree with each other and with eq. (18) within 0.1% (numerical, Figure 2, left).
The match moves the two inducer pairs to opposite sides of the corner. Eq. (19) makes the repressor bind its inducer times more tightly than the activator does. Excess activator lowers the half-rise point, because a few induced activators already fill the promoter. Excess repressor raises it, because nearly all of the repressor must be inactivated. On the map of Figure 1, the activator and its inducer sit at , at the corner, and the repressor and its inducer at , far above it. The first cut is graded and the second switches, and §7 confirms both.
In this regime the two designs differ only in the sign of one sensitivity. Savageau compared activator and repressor control in systems that were otherwise identical, and found that the only inherent difference was their response to regulatory mutations (p. 5647).4 In eq. (18) and its activator twin, a change of the regulator's own total is such a mutation. §8 derives the two responses and finds them equal and opposite. That verdict is exact in the regime of the three assumptions.
Before trusting a matched induction law, name its three assumptions, write the affinity ratio the match forces, here , and locate each circuit's inducer pair on the map.
7In the inducer total, the repressor switches where its store runs out
When the cell controls the inducer total, each circuit must first fill its own store of bound inducer. The repressor's store is its whole total, so it switches there. The activator's store is small, so it stays graded.
4 · Move a total. Let the cell set the inducer total , as it does for a metabolite or a second messenger it makes itself. The inducer then splits between free and bound, and only the free part enters the law (18).
Counting the stored inducer at half rise gives both half-rise totals. At half rise both circuits hold free inducer , by eq. (18). Take the repressor first. Setting eq. (10) to the half level gives . All other repressor holds an inducer, apart from at most on the promoter, so the stored inducer is . For the activator, the bound inducer at is . Adding free and stored inducer,
The exact half-rise totals are 99.98 and 2.04 nM (numerical). The activator's estimate is 2.4% low, mostly because the loaded promoter also stores inducer, about at half rise.
Scroll inside the figure to see it at reading size.
The shapes differ as much as the positions. In the inducer total the activator stays graded, with , inside the cap of eq. (17). The repressor switches, with (both numerical).
In the tight-inducer limit the two responses are mirror images, and their Hill coefficients are related exactly. Let the inducer binding become tight, , with rematched by eq. (19), and write . Then every inducer is bound. The free repressor is while , so eq. (10) becomes , and the normalized rises of the two circuits are
Solving each for its 10% and 90% points gives
at , exact in the limit. For large , . In this limit the repressor computes a comparison of two totals, , the titration switch of §2 with the repressor as the sink for inducer. The activator reads the smaller of and through one saturating promoter.
At finite inducer affinity the steepness has a closed form, and it locates the tightness condition. With the promoter in trace, the response depends on the free inducer alone, so the 10% and 90% points in free inducer are and . The inducer total adds the stored inducer, , so . With , the ratio of the two points gives
As the ratio is 81 and . As it becomes the tight limit (22). The switch appears when the stored inducer outweighs the free inducer at both points, which needs , roughly : the repressor must bind its inducer sufficiently more tightly than its operator. Eq. (23) is continuous, so there is no universal threshold. At and the criterion used here, a ratio of 0.1 already gives 6.1 and a ratio of 1 gives 1.93, which is why the factor of ten is quoted as a working rule for these parameters. Eq. (23) gives 25.8, 6.11 and 1.93 at , 0.1 and 1, against exact values of 25.7, 6.10 and 1.93 with promoter loading (numerical, Figure 3).
Scroll inside the figure to see it at reading size.
The threshold needs two conditions: tight inducer binding, derived above, and an inducer whose total is set inside the system. A metabolite, a second messenger, a protein anti-repressor or a cell-free extract qualifies. A membrane-permeant inducer in a large medium clamps the free inducer instead, and then the effective law (18) is the right model for both circuits.
Predict a half-rise total by adding the free inducer the law needs to the inducer each regulator stores, and read from eq. (23) how steep the repressor's switch at is for its affinity ratio: at a ratio of 0.1 gives , and the switch sharpens continuously as the ratio falls.
8The regulator and promoter totals separate the circuits again
The regulator's own total moves the repressor's threshold one for one and barely moves the activator's. The promoter total, which the effective law does not contain, separates them a third time.
The repressor's threshold tracks its own total. By eq. (20) the repressor's half-rise total is about . Sweeping the factor's total over 50, 100 and 200 nM moves it to 49.5, 100.0 and 201.0 nM. The activator's half-rise total moves only from 3.01 to 2.04 to 1.55 nM (numerical). The activator's store, , stays near whatever is. What moves is its free-inducer half point, , which falls as rises at fixed .
In free inducer the two sensitivities to the regulator total are equal and opposite. Hold the free inducer at the half-rise point and change the factor's total. For the repressor, eq. (10) with gives , and at the half point . For the activator, the loaded fraction has , and at the half point . Working both through,
This is exact within the reduced model, and it is Savageau's difference of response to regulatory mutations made quantitative.4
In the inducer total the repressor's sensitivity is about fifty times its free-inducer value. Holding the inducer total at each circuit's half-rise point, the sensitivity is for the repressor, about 50 times the of eq. (24), and for the activator, about half its eq. (24) value (numerical). The two circuits now differ about a hundredfold in size of sensitivity. Near its threshold the repressor turns a 1% change in its own total into about a 25% change in output. This is a static sensitivity: it predicts how a change of the factor's total slower than shows up in the output. No noise was simulated.
The promoter total separates the circuits a third time. Raise past the factor's total. With tight promoter binding, an uninduced repressor occupies one site each, so the free promoter is about and the production per promoter about once . With saturating inducer, the activator loads one site each, so the loaded promoter is about and the production per promoter is about . Both estimates give 0.50 at , against exact values of 0.505 (numerical). At 1000 nM the repressor circuit reaches 0.90 and the activator circuit falls to 0.11. The effective law (18) contains no , so it predicts a production per promoter independent of copy number in both.
Brewster and colleagues measured the repressor side of this result for the Lac repressor in E. coli, with the repressed gene on multicopy plasmids or at five chromosomal sites. The measured fold-change in expression stayed near 1 whenever repressors were fewer than gene copies, as the caption of their Figure 4 states (p. 1316).5
Use the regulator total and the promoter total as two further inputs: in free inducer the sensitivities to the regulator total are , and in the inducer total a repressor near its threshold amplifies changes in its own total many fold.
9Closing the inducer loop: removal decides what the steady state reads
Closing the output loop adds nothing while the inducer total is fixed. Once the inducer is made and removed, the removal rule decides whether the steady state reads the free inducer or the total.
5 · Close the loop. With the inducer total fixed, the output obeys , which filters v with the same time in both circuits. Closing that loop changes no comparison. Let the inducer total itself be dynamic, supplied by with rate law u, and dilute the output at . Time is in units of .
If only free inducer is removed, both circuits reach the same steady state, at different times. The inducer obeys , so at steady state exactly, whatever the binding. Both circuits settle at the output the free-inducer law (18) gives, 0.505 when , that is at with . The repressor must first fill a store of about , which takes about . It reaches half its final output at , against 0.85 for the activator (numerical). Binding protects the stored inducer from removal.
If every inducer-containing state is diluted, the steady state reads the total. Uniform dilution gives , so
in both circuits, exactly, whatever the binding. At the same supply the steady total is 10.1 nM, and the activator reaches 0.84 while the repressor stays at 0.011 (numerical). The repressor turns on only when the steady total passes its half-rise total, about , that is when . At , eq. (25) crosses when , at , and the production per promoter switches there. The output protein follows through its own removal filter, with time . The repressor total is itself held by synthesis at , so the threshold sits where the two synthesis rates match, the in vivo titration threshold of Buchler and Louis (pp. 1106 to 1110).6
Close an inducer loop with a named removal rule: removal of free inducer only makes the steady state read the free inducer and delays the repressor by about , while uniform dilution makes it read the total and switches the repressor where the inducer supply passes .
Ultrasensitivity
A threshold from two saturated enzymes, and a threshold from one tight binding layer whose input is a total. In both, the threshold sits at a total. The core shows the finite-pool picture.
10The modification cycle with every complex kept
The canonical switch is a covalent-modification cycle. Written with both enzyme complexes kept in the substrate total, it is two binding pairs and one slow balance with exactly one stable steady state.
Two measures of steepness are used, and a threshold is a claim about the second. The Hill coefficient of §5 summarizes the whole rise from 10% to 90%. The local order is the slope on log axes at one point, Lecture 8's gain. A hard saturation corner can raise without any point of high local order, so a threshold is checked with the local order.
1 · Model. A kinase E converts the substrate X into its modified form Y, and a phosphatase F converts it back. Each enzyme binds its substrate form in an elementary step and acts in a composite catalytic step, with co-substrates held fixed and the reverse activity neglected:
The totals are , and the substrate total , which the cycle conserves. The modified total, free or bound to the phosphatase, is , and the unmodified total is .
Each enzyme forms one pair with its own substrate form, so eq. (4) gives both complexes. The kinase pairs with the unmodified total and the phosphatase with the modified total: and , where is the root (4) and , are the two dissociation constants. The slow variable obeys
The root (4) rises with each of its totals. So the first term falls and the second rises as grows, and eq. (27) has exactly one steady state, which is stable. The cycle cannot hold two states by itself.
The experiment varies the ratio of the enzyme totals. The input is with equal catalytic constants, , so r is the ratio of the two maximal rates. The readout is the modified fraction . Both enzymes share one dissociation constant K, which is also their Michaelis constant when catalysis is slow against unbinding.
Write a modification cycle as two binding pairs plus the slow balance (27), and conclude from monotonicity alone that it has one stable steady state at every input.
11Saturation is the route to steepness, and a large phosphatase share caps it
In this cycle the steepness comes from saturating both enzymes. One saturated enzyme gives at most . For the modified fraction read against the enzyme ratio, a phosphatase holding more than a small share of the substrate caps the steepness however saturated the enzymes are.
2 · Limit. Goldbeter and Koshland took both enzymes in trace, so that the complexes are negligible in the substrate total and each free substrate form wins its own total.7 Each complex then follows eq. (5). With , setting eq. (27) to zero gives their closed form:
These are their Eqs. 7 to 10 (pp. 6841 to 6842) with equal constants for the two enzymes. 3 · Match. In the trace limit the exact cycle (27) reproduces eq. (28) to (numerical).
Saturation sets the steepness. For a saturating substrate, , expand the logarithm. Since , only the first-order terms survive: . Therefore
At the rise from 10% to 90% spans r from 0.919 to 1.088, an 18% change of the enzyme ratio. At the switch is barely there, (both from eq. 28).
One saturated enzyme gives at most 2, so a sharper switch needs both. Let the phosphatase work in its first-order range, , in the two-constant form of Eq. 10. The response ratio becomes , which falls to 9 as the kinase saturates, so and stops (exact). Goldbeter and Koshland's condition is that "one or more" of the enzymes work in the zero-order region (p. 6840). One saturated enzyme already makes the response ultrasensitive, up to 2. A switch steeper than that needs both. Saturation is the route to steepness in this cycle. It is not the only route in general, and §13 reaches a threshold through sequestration instead.
4 · Move a total. An abundant phosphatase caps the switch, because it holds the modified substrate. Raise the phosphatase total to a fraction of the substrate and take binding tight. In that limit each complex is the smaller of its two totals, and flux balance at equal catalytic constants sets . There are two cases, and . Take first. Below the balance point the phosphatase out-runs the kinase, so every modified substrate sits on the phosphatase: , and . Above it the phosphatase is full, , the kinase holds the whole unmodified total , and . The normalized rise reaches 10% at on the linear part. It reaches 90% on the linear part only if , and otherwise at the jump, .
For the phosphatase can never be filled, because the plateau would leave it less modified substrate than its own total. Once the kinase total passes half the substrate, at , each enzyme holds the whole of its substrate form, and forces . The response is up to and then the plateau , with no jump at . At , , and the exact cycle gives (numerical). Normalized by its plateau the rise is linear from start to end, so . The two cases combine into
with the plateau below and above it. The cap is 41.7 at and 3.0 at . Unbounded steepness of this readout needs , a phosphatase scarcer than . That condition is exact in the tight limit for this normalized readout, the total modified fraction against the ratio of enzyme totals. It is not a requirement for steepness in general, and not a necessary condition for every catalytic switch. The exact cycle approaches these caps as the substrate saturates (numerical, Figure 4). Goldbeter and Koshland remarked that enzyme ratios of 0.1 or less change little at their parameters (p. 6842). That agrees, because at the cap of 42 is far above the trace value of 3.7.
Scroll inside the figure to see it at reading size.
5 · Close the loop. The cycle has one stable state at every input, by §10, so its steepness is a static input-output behavior: the steady state as a function of the enzyme ratio. It is not an autonomous dynamical behavior such as memory or a cycle. A steep static response becomes one only when a loop feeds the output back, which Part 4 does with a titration layer instead.
Read a catalytic switch's steepness from eq. (29), about , with both enzymes saturated, since one alone gives at most . For the modified fraction against the enzyme ratio, read the cap of eq. (30) from the phosphatase share: unbounded only below , and 2 from on.
12In free ligand, negative cooperativity flattens
A receptor with two sites, only the doubly bound state active, can make a threshold with one binding layer. Measured against free ligand, though, negative cooperativity makes its response flatter, not steeper.
1 · Model. A receptor R binds ligand L at two identical sites, first with the site constant and then, with one site filled, with . An empty receptor offers two sites, so its association runs at . A doubly bound receptor can lose either ligand, so its dissociation runs at . Writing those factors into the elementary arrows,
Equilibrium of each step then gives
with totals and . The cooperativity is . It is negative when , so that the second ligand binds more weakly than the first. The observable is the active fraction . The illustrative constants are and , so .
The exact equilibrium is one monotone equation for the free ligand. Substituting eq. (32) into the ligand total,
The left side rises strictly with L, so there is one root, and every species follows from it.
2 · Limit. The classical treatment takes the ligand in excess, so that the free ligand equals its total. The fast subsystem removed is the binding layer, and the dominance choice is that free ligand wins its own total. The active fraction is then a function of free ligand alone:
Its Hill coefficient lies between 1 and 2. For strong negative cooperativity, once the first site is full and eq. (34) becomes , a Michaelis-Menten law, so . For strong positive cooperativity it becomes , so . The computed values are 1.000 at , 1.005 at , 1.19 at and 1.98 at (numerical, from eq. 34). Ha and Ferrell describe the same trend (p. 990).8
3 · Match. Eq. (34) is exact when the receptor cannot deplete the ligand, that is when . There the response to the ligand total rises half-way near , with at (numerical), as the free-ligand law does.
Write a multisite receptor with its statistical factors in the elementary arrows, solve it by the monotone equation (33), and expect a free-ligand response with between 1 and 2 that negative cooperativity pushes toward 1.
13In the ligand total, the first sites buffer the input
When the receptor total exceeds its second dissociation constant and the input is the ligand total, the singly bound receptors absorb the first ligands one each. The response stays flat up to the receptor total and then rises straight to full.
4 · Move a total. Raise the receptor total past , to , and sweep the ligand total. Count before computing. The first site binds a hundred times more tightly than the second, so the first ligands go to empty receptors. Until reaches , nearly every receptor holds at most one ligand, and the active state stays empty. Past that point the two totals read and , because nearly every receptor and every ligand is bound. Subtracting,
The rise from 10% to 90% then spans from 1.1 to 1.9, which gives , exact in the limit. This is the maximum Ha and Ferrell found as (p. 991). At the illustrative constants the exact response has , with 10%, 50% and 90% points at 1.08, 1.52 and 2.08 μM and a local order of 11.0 near . The same receptor has in free ligand (both numerical).
The threshold needs two separate conditions. Negative cooperativity, , makes the singly bound receptors a buffer that absorbs the first of ligand. Tight binding, , makes the ligand total the effective input. Without negative cooperativity, at , the two sites fill independently. With all ligand bound, each site is occupied with probability , so the active fraction is , with local order exactly 2. Its 10% and 90% points are and , so . That high value comes from the depletion corner at , not from a threshold. With a weak second site, , the response stays near (numerical).
Scroll inside the figure to see it at reading size.
Ha and Ferrell built the two-site receptor from DNA strands and held it at 1000 nM (p. 991). From their threshold data they inferred for one ligand pair (supplement, Table S1), near the illustrative 0.01.8 In budding yeast, Buchler and Cross measured apparent Hill coefficients up to 12 from a transcription factor sequestered by an inhibitor, with threshold and steepness set by the inhibitor's abundance (p. 1).9
Get a threshold from one binding layer by making the input a total, with a buffer that binds first () and binding tight against the partner total (): the response is flat to and then follows eq. (35).
14The threshold sits at a total, so a fitted Hill function cannot travel
The receptor's threshold is its own total. A Hill function fitted at one receptor total stores the threshold as a constant, so it misses as soon as that total moves.
The half-rise point moves from to as the receptor total grows. While the free-ligand law (34) holds and the half-rise is near . Once , eq. (35) puts it at . Along the way the Hill coefficient rises from 1.02 at through 3.6 at to 7.8 at (numerical).
A Hill function fitted at one receptor total misses at the next. The Hill function through the exact 10% and 90% points at has half-rise and coefficient 6.73. At and the exact half-rise points are 0.47 and 4.52 μM, so the fit misses them 3.2-fold and 3.0-fold, and the exact coefficients change to 5.28 and 7.39 (numerical). The fit stores the threshold as a constant. The mechanism places it at a total.
At fixed ligand the active receptor rises and then falls with the receptor total. Apply the same counts with the roles swapped, holding and sweeping . While there is ligand for every site, and . Between and , eq. (35) gives , because added receptors take ligand one at a time and complete fewer pairs. So the active receptor peaks at : at 0.100 μM for (numerical). A model without ligand depletion keeps rising. Ha and Ferrell predicted and measured this peak, at a receptor-to-ligand ratio of 1:2 (p. 993).8
5 · Close the loop. A threshold becomes a behavior only inside a loop. Parts 4 and 6 put the same mechanism, a pool whose total sets a threshold, into feedback loops: a finite promoter pool read by monomeric repressors. The repressor of §7 is the same mechanism once more, with the repressor as the sink for inducer. Buchler and Louis state the pair of controls for such titration: the titrant total sets the threshold's position, and the ratio of that total to sets its sharpness (pp. 1108 to 1109).6
Refit a Hill function whenever the partner total moves, or better, place the threshold at the partner total: half-rise near for the two-site receptor, and a peak at when the receptor total is swept.
Multistability
Memory needs several stable states of the closed loop. Two comparisons follow: the same toggle mechanism in two limits, and two architectures for N factors. The core shows the circuits and their time courses.
15The Hill toggle needs the product of its coefficients above one
The effective model of mutual repression is the Hill toggle. It holds a single stable state whenever the product of its two Hill coefficients is at most one, and a short index argument proves it.
1 · Effective model. Gardner, Cantor and Collins wrote the toggle in dimensionless form (Box 1, p. 339):10
Here u and v are the two repressor totals in units of the repression constant, time is in removal lifetimes, and are synthesis strengths, and and are Hill coefficients. These letters are the authors' and hold only in this section. Every arrow is composite: with rate law , and removal with rate law u. Nothing in eq. (36) resolves binding, so each exponent is a fitted cooperativity. Gardner and colleagues attribute it to multimerization and cooperative binding to several operator sites.
If , the toggle (36) has exactly one fixed point for every , and every trajectory converges to it.
The proof has three steps: every fixed point is a stable node, there is exactly one, and no cycle exists. Write and . At a fixed point , so with , the log-slope of the first repression law. Likewise with . The Jacobian has trace and determinant , so every fixed point is a stable node, of index +1. On the boundary of the box the field points strictly inward, so the indices inside sum to +1, and there is exactly one fixed point. The divergence is everywhere, so Bendixson's criterion excludes periodic orbits, and the Poincaré-Bendixson theorem sends every trajectory to the fixed point.
The converse holds: a product above one opens a bistable wedge. The saddle-node set is , which needs . On the diagonal, with and , the symmetric state splits when its log-slope reaches 1, at . So the symmetric threshold is
which is 2 at , 1.19 at and 89.2 at (exact). On a grid of 1681 synthesis pairs from 0.1 to 1000, no point is bistable at or 1, and 11, 339 and 536 points are bistable at , 2 and 3 (numerical).
Cherry and Adler stated the condition for any two repression laws. With , the largest log-slope, multiple equilibria need , and some removal rates give them when (Proposition 1.1, p. 123).11 For a Hill law . Gardner and colleagues state the weaker form, that at least one repressor must act with cooperativity greater than one (p. 339).
Before expecting a Hill toggle to hold two states, check the product of its two Hill coefficients: at most one means one globally attracting state, and above one opens a bistable wedge whose symmetric edge is eq. (37).
16A finite promoter pool makes a monomeric toggle bistable
The same monomeric toggle, written with its promoter sites, is monostable in its trace-promoter limit and bistable once the site pool exceeds the dissociation constant. This is the strict comparison of one mechanism with its own effective law.
1 · Model. Repressor binds the promoter sites of gene 1 as a monomer, one repressor per site, and only free sites express . Every site also leaks at a small rate. Free and bound repressor are diluted alike, the uniform variant :
and symmetrically for gene 2. Here is the dissociation constant of one repressor and one site, is the site total of each gene, the production per free site and the leak per site, free or bound. The two production steps sum to . The last step is growth dilution of a bound repressor: growth copies the genes, so the site total stays fixed while the repressor on a site is diluted, and the site reappears free. Because free and bound repressor leave at the same rate, the total balance is exact. Only the binding layer uses fast equilibrium.
The free fraction of sites solves a quadratic. Measure the repressor total and the dissociation constant in units of the pool: and . With the free fraction, the bound sites are and the free repressor is , in units of . Equilibrium, , becomes , whose physical root and inverse are
Below equivalence the free fraction falls linearly, and above it collapses. Take tight binding, . Below equivalence, where , each repressor occupies one site, so : the free promoter falls in proportion, while the free repressor stays tiny, about . Past equivalence, where , the sites are full and every further repressor stays free, so . At equivalence, , the quadratic gives , so . That is the small free pool on the singular ray of §2. Each asymptotic piece holds only on its own side, and the exact quadratic (39) bridges the corner .
The log-slope of the free fraction measures how sharply the pool switches. Differentiating gives , so
In the limit below equivalence, and the log-slope is , which exceeds 1 for and grows without bound as . A straight fall on linear axes is a steep fall on log axes. At finite the peak has a closed form. Differentiating eq. (40) written in p, , and setting the derivative to zero gives
These hold for , that is . For the formula for gives no physical fraction, and there is no interior peak: the log-slope rises with r toward 1 and never reaches it. At the peak is 7.106423 at , while at equivalence itself the slope is 7.066653 (exact). Both share the leading term , which is 7.07 here, so the two agree to within 0.6% (Figure 6).
Scroll inside the figure to see it at reading size.
In units of the pool and the dilution time, the toggle is two equations. With , the repressors one free site makes per lifetime, and , the leak,
2 · Limit. Put the promoter in trace, . The repressor then wins its own total, the free repressor equals the total, and , a Hill law of coefficient 1 in the repressor total. The fast subsystem removed is the binding layer, and the dominance choice is a promoter in trace. Eq. (41) becomes the toggle (36) with . 3 · Match. In this limit the two models are the same equations, and by §15 they hold exactly one stable state.
4 · Move a total. Raise the pool above K. The symmetric state, without leak, has . The gain of each link, the slope with which one node's production answers its upstream total relative to its removal slope of 1, is . Using and eq. (39),
The Jacobian at the symmetric state is , with eigenvalues . So the symmetric state is a saddle exactly when , where the loop gain of the two links passes 1. Clearing the denominator, becomes , that is , which needs . Since falls as p rises, the condition on the production is :
So monomeric repressors make a toggle once the site pool exceeds the dissociation constant and production is high enough (exact for the symmetric state). The number of stable states, computed on 36 grid points with from 0.01 to 2 and a from 1.5 to 1000, matches eq. (43) at every point (numerical).
5 · Close the loop. The removal rule matters here too. If bound repressor is protected, the gain becomes , and §27 proves that the toggle then holds one state for every parameter. Cherry and Adler showed that depletion of free repressor can make a switch without cooperative binding, given more than one operator copy per cell, a small enough dissociation constant, and equal decay of free and bound repressor (pp. 127 to 128). Their pool condition is that the operator total exceed the dissociation constant.11 Eq. (43) adds the production threshold, in closed form.
Decide whether monomeric repressors can make a toggle from the pool and the production: the trace-promoter limit never can, and a finite pool can exactly when and , with bound repressor removed alongside free.
17N Hill genes keep at most one node raised
Generalized to N mutually repressing genes, the Hill toggle keeps at most one node high in any stable state. That part is a theorem. The resulting count of N + 1 states holds over the parameter grid searched.
1 · Effective model. Each of N genes is repressed by all the others through a product of Hill laws, with no self-activation:
The totals are in units of the repression constant and time in removal lifetimes. All arrows are composite, and the model is symmetric and all-to-all.
Lemma: a stable state has at most one raised node. At a fixed point with , so takes the same value at every node. The shape of splits the proof into two cases, and . Its derivative is . For it is positive everywhere, so all nodes share one value, and the uniform state, the root of , is the only fixed point. No node is raised. For the function rises to a peak at and then falls, so each node sits on the rising or the falling side at that common level. Suppose two nodes a and b sit on the falling side. They then share one value q. The Jacobian of eq. (44) has off-diagonal entries , and applied to it returns . On the falling side , so and the eigenvalue is positive. The state is unstable. So a stable state raises at most one node.
The count of N + 1 is a grid result, not a theorem. The lemma allows the N single winners and the uniform state. A numerical enumeration of every fixed point over from 1.2 to 1000 and n from 1 to 8 finds at most 2 stable states at and at most for N from 3 to 12, the N single winners plus the uniform state. They coexist at small and steep repression. Brute-force runs from many starts agree for N from 2 to 5, and at every case has one stable state (numerical), as the first case of the lemma requires. A bound for all parameters was not proved.
Self-activation would change the architecture and the count. A Hill network of N self-activating switches with weak cross-repression reaches states. So the comparison with MultiFate in §18 and §19 is a comparison of two architectures within one framework, not a limit of one mechanism. The strict limit comparison for multistability is §16.
Bound the repertoire of symmetric Hill mutual repression by the one-raised-node lemma, and quote its count with its model and grid: symmetric, all-to-all, product form, no self-activation.
18MultiFate's dimer pool solves in closed form
In MultiFate every factor dimerizes through one shared domain. Homodimers activate and heterodimers do not. One equilibrium then supplies both the steepness of self-activation and the inhibition by sharing partners.
1 · Model. Each factor pairs with itself into an active homodimer and with any other factor into an inactive heterodimer.12 All factors share one dimerization domain, so every unordered pair of monomers associates at the same rate per pair. Count pairs in a volume V first. With molecules of there are same-factor pairs and mixed pairs with . Dividing by converts these to and in concentration units. So, per product of concentrations, the heterodimer channel runs twice as fast as the homodimer channel. We take the rate law of one homodimer association event to be , each event using two monomers, which puts the factor 2 on the heterodimer arrow. With one dissociation constant for every dimer,
Homodimer association has rate law , heterodimer association , and every dimer dissociates at . Equilibrium therefore gives and , the statistical convention of Zhu and colleagues (supplement, p. 8). The totals count each homodimer twice:
The homodimer activates its own gene through composite transcription and translation, and every state is removed at one frequency , "regardless of its dimerization state" (Box 1, p. 6 of 11):
Here is basal production, activated production, the homodimer level for half activation and n the transcriptional Hill coefficient. These are MultiFate's letters, and is not Gardner's coefficient of §15. The published dimensionless values are , , and , in units of and (reported). Dimerization is fast: the authors estimate unbinding at 14.4 per hour against removal at 0.1 per hour (supplement, parameter section).
Every monomer keeps the same free fraction, which closes the binding layer. Substituting the equilibria into eq. (46), with the free monomer of all factors. The factor in parentheses is the same for every i, so with one shared . Summing over i, the pooled total satisfies , so , and
Every other factor inhibits through , by taking a share of the partners.
The homodimer is nearly quadratic in its own total while it is dilute or holds a small share of the pool. With the other totals held, , so the own-total log-slope of the homodimer is
It is close to 2 while . Two cases satisfy that condition: a dilute factor, , whatever its share, and a factor holding a small share of a large pool, . The slope falls toward 1 only when one factor dominates a large pool. For a factor alone it is 1.96, 1.75, 1.33, 1.11 and 1.04 at , 0.1, 1, 10 and 100. With held by others, one factor ON, it stays at 2.00, 2.00 and 1.96 up to and falls to 1.69 and 1.19 at 10 and 100 (exact, Figure 7). An OFF factor rising among ON factors is therefore nearly quadratic, a Hill degree of 2 made by binding.
Scroll inside the figure to see it at reading size.
Solve a shared dimerization pool through the common free fraction (48), write the statistical factor of 2 into the heterodimer arrow, and read the binding-made cooperativity from eq. (49), close to 2 while , that is while the factor is dilute or holds a small share of a large pool.
19Counting MultiFate's stable states, and what removal decides
The stable states of MultiFate are counted by numerical enumeration of the closed loop. The count follows binomial sums whose range is set by how many factors can stay ON together. The removal rule decides whether partner competition sets the count at all.
5 · Close the loop. At a fixed point each node solves one scalar equation at the shared , , where h is the activation law of eq. (47). That equation has a low, a middle and a high branch. A fixed point is therefore a pattern of nodes over the three branches, plus one scalar consistency equation for S. Enumerating every pattern and solving its equation finds every fixed point the branch parametrization can reach, and the eigenvalues of the Jacobian classify each one. This is a numerical enumeration, not a certified one. Brute-force runs from 300 to 500 starts agree for N from 2 to 5 (numerical).
The counts follow binomial sums. At the published parameters the stable states number
| N | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| stable states | 3 | 7 | 15 | 30 | 56 | 99 | 93 | 130 | 176 | 232 | 299 |
| most factors ON | 2 | 3 | 4 | 4 | 4 | 4 | 3 | 3 | 3 | 3 | 3 |
(numerical). Every count is a sum over the allowed numbers k of factors ON together,
where is the most factors ON and is 1, or 0 once the all-OFF state is stable, which happens from N = 7. For N = 4 every non-empty subset is allowed, . For N = 5, one to four ON gives . For N = 9, zero to three ON gives .
Sharing partners caps how many factors stay ON. With k factors ON, each near its full level , the pool is . For a large pool eq. (48) gives , so each ON homodimer is about and falls as 1/k. At the published parameters that holds at most four factors ON for and three for . Zhu and colleagues give the same reason, the diminishing share of active homodimers among all dimers (p. 9 of 11).
Scroll inside the figure to see it at reading size.
Zhu and colleagues built MultiFate-3 in mammalian cells, and the cells held seven distinct states, each stable for at least 18 days (p. 1 of 11). Seven is the count at N = 3. For larger N they report a maximum of 256 attractors at N = 9 in the same model (p. 9 of 11).12 Our reanalysis finds 130 stable states there, and . The 126 are the symmetric four-ON fixed points, which exist on the middle branch with a threefold unstable eigenvalue of (and at N = 8). A kick of 0.1% sends each to a three-ON state (numerical). Their counts of robust attractors, read from their Fig. 5D as about 92 and 128 at N = 8 and 9, agree with our stable counts of 93 and 130.
Binding supplies the steepness. Without transcriptional cooperativity, , a parameter set chosen for three states at N = 2 (, , ) holds 3, 7, 15, 31, 62, 119 and 218 states for N = 2 to 8, following up to N = 5 (numerical). The near-quadratic homodimer of eq. (49) does the work. Zhu and colleagues also report multistability at (supplement, p. 19).
Heterodimers make the OFF states. A lone factor always activates itself at the published parameters. It stays OFF only because ON factors, or the pooled basal expression of many OFF factors, titrate its monomers into inactive heterodimers. Forbidding heterodimers leaves one stable state, all ON, for every N (numerical).
Under free-only removal the steady-state equations separate, but the dynamics stay coupled. Remove only free monomers: . Each right side depends on its own free monomer alone, so at a fixed point each is a root of one scalar sigmoidal equation, with one or three roots. The dynamics do not separate. In logarithmic free coordinates , eq. (46) gives with the binding-capacity matrix , whose off-diagonal entries are not zero. So , and the Jacobian at a fixed point is with . Since A is symmetric positive definite, is similar to , which has the inertia of G by Sylvester's law. The unstable directions are the nodes on a middle root. So the count is exactly when the scalar equation has three roots and 1 otherwise, for every N. At the published parameters it is 1, all ON. At it is , while uniform removal gives 4, 7, 11, 16, 22 and 29 for N = 2 to 7 (numerical). Uniform removal, the published model, is what lets partner competition set the count.
Count stable states from the closed loop by enumerating branch patterns, expect binomial sums (50) with a co-expression cap set by partner sharing, and name the removal rule, since free-only removal turns the count into 1 or through Sylvester's law.
Adaptation
One incoherent feedforward loop, built two ways. Both effective laws compute input over controller. In binding and catalysis each needs its own regime of its binding pair, and the input itself walks the controller across the map. The core shows the step, the pulse and the controller.
20One feedforward loop, two implementations, two production constants
The controller can degrade the output or repress its gene. Matching the two set points fixes two different production constants, one per design, and the matching condition carries units.
Adaptation is a return to the old output after a sustained change of input. In an incoherent feedforward loop the input u drives the output X directly and also drives a controller Y that opposes X. The test here is a tenfold step: hold until steady state, step to , and compute the steady-state error
A persistent adaptive window is a range of , open toward one end of the input range, on which . An isolated input at which changes sign is a protocol-dependent endpoint cancellation, not a window, because it moves when the step factor changes.
1 · Model. The input is dimensionless and multiplies both production laws, as an activator held in its linear range or a gene dosage would. In both designs the controller is made by with rate law and leaves every state that contains it at frequency . In the degradation design Y binds X and destroys it. Binding is an elementary pair, and at this model's resolution the catalytic step is one event:
The composite step returns the bound output to the free pool when its controller is removed, so X leaves the system only through catalysis. This is an idealized controller-removal model, not indiscriminate dilution of every molecule, and the exact adaptation of free X below depends on it. The totals are and , and binding is at equilibrium, .
In the repression design the controller binds the promoter instead. Y binds the promoter G of the gene for X, whose total is fixed. Only the free promoter expresses, and X binds nothing:
The totals are and , with , and . The two production constants carry different subscripts because the designs will need different values. The observable is the output total , and in the degradation design free X is a second readout. A check against the full mass-action networks confirms binding equilibrium on the clock of the totals, to within over a step (numerical).
2 · Limit. Each design has a standard effective law. Degradation becomes a Michaelis-Menten law in which the substrate total stands for the free substrate, eq. (5). Repression becomes a Hill law of coefficient 1 in which the repressor total stands for the free repressor, the trace-promoter cut of eq. (6):
3 · Match. In both designs the controller settles at , proportional to the input. The degradation law then gives , so
independent of the input whenever the dimensionless degrader load is below 1. The repression law gives once , also independent of the input. Equal set points therefore require
Both sides are a production rate per unit input, a concentration per time, because and are dimensionless. Take as the unit of concentration and as the unit of time, and set per unit input, so that . The illustrative values , and then give and per unit input, and a shared set point (exact). In their limits both laws compute the ratio of input to controller. That shared structure is why the effective laws call the two designs the same.
Match two implementations by their set points, not by one shared constant: write each production constant with its own symbol and derive the matching condition, here eq. (56), with its units.
21The degradation design adapts only while both partners are free
The degradation design cancels the input exactly in free X at every input. Its total output adapts only while the degrader stays free and well below its dissociation constant, and the input pushes it out of that regime.
4 · Move a total. Here the input itself moves a total, because . A sweep of the input walks the controller total along the pair's map.
The binding-catalysis steady state is exact in closed form. Setting eq. (52) to zero gives and , so and . Binding then gives the free output and the total:
The free output is the effective law's set point (55) at every input. The total carries an extra factor, . Here is Lecture 8's residual fraction of the output total: the bound share measured against the winner, free X.
The regimes of the pair X, Y place the failure. Name each regime by the winner of , the degrader, then of :
| Regime | Condition at steady state | Total output | Gain in u |
|---|---|---|---|
| , both free | , | , degradation flux | 0, adapts |
| , output bound | , | 1, tracks the input | |
| , degrader saturated | , so | set point fragile, eq. (55) near | fine-tuned edge |
| , | totals tied, | tracks |
The path leaves where , that is at .
Precision demands depth inside the adaptive regime. A tenfold step multiplies , and so , by ten. By eq. (57) the error of the total is
With , the persistent window is (exact). Its edge sits at 0.0112 times the regime boundary , two decades inside the regime. That is Lecture 8's bounded-factor accuracy read backwards: a 10% tolerance asks for the discarded term to be about 1% of the winner. Free X has at every input.
The Michaelis-Menten law is valid exactly where the design works. The law (54) needs the free substrate to win its own total, , which is the regime or of the table.1 So the law describes the adaptive regime correctly, and it has no complex with which to represent the failure: sequestration of the total output.
Loading the degrader more heavily widens the window and makes the set point fragile. From eq. (55), , so : 1.05 at , 2 at 0.5 and 10 at 0.9. In the plane of input and set point, eq. (58) puts the window edge at , which rises with the load (Figure 9, left). For production outruns the degrader's capacity , and X accumulates without bound. Saturating the degrader therefore trades robustness of the set point for range.
Diluting the output as well closes the window from below, and gives Du and colleagues' form. Let every X-containing state also be removed at , so a bound X is diluted and releases its degrader. The steady state then balances , with and . Solving,
The first factor is the unregulated level. In Du and colleagues' scaled variables, with dosage D, free regulator and the dimensionless catalytic rate , this is their (Data S1, pp. 14 to 16).13 It compensates dosage only approximately, and only for . Their K also counts removal of the complex, so it is a Briggs-Haldane-like constant that reduces to when binding is fast. With and the best error of a tenfold step is 19.1%, and no input adapts within 10%. A 10% window needs above about 3500 (numerical). The repression design has no such lower edge, because its output is removed at first order anyway.
Bleris and colleagues built incoherent feedforward loops in mammalian cells, with a microRNA as the controller. Their measured loops adapted to the amount of their genetic template (abstract; p. 7). Their model predicted a loss of adaptation at high copy number and low silencing-complex concentration, from saturation of that complex (p. 5).14 In the language of the table this is the degrader-saturated regime . It is their model's prediction, not a measurement.
Check a degradation design by the residual fraction of its output total: a tenfold step adapts within 10% only while , free output adapts regardless, and output dilution adds a lower edge that needs in the thousands.
22The repression design adapts only above its dissociation constant and its promoter
The repression design adapts only while the repressor exceeds both its dissociation constant and the promoter total. The Hill law sees the first condition. Only the binding-catalysis model sees the second, and with it a titration switch and a cancellation that holds for one step size.
The binding-catalysis steady state reads the free promoter. Eq. (53) at steady state gives , with G the free member of the pair at totals . By the same quadratic as eq. (4),
The regimes of the pair G, Y place both failures. Name each regime by the winner of , the promoter, then of :
| Regime | Leading sector | Free promoter G | Gain of in u |
|---|---|---|---|
| , weak repression | , | 1, tracks the input | |
| , repressor titrated | , | 1, tracks | |
| , | a switch | ||
| , repressor in excess | , | 0, adapts |
Each entry is leading order deep inside its sector. Near the ray of a heavy promoter, outside the rounding scale , the improved expressions are below it and above it, and the exact root (60) covers the rest. The exact ties lie within a factor of 2 of the sector lines, as in §2.
The design needs : the free repressor wins its own total and the complex wins the promoter's. There the free-promoter readout has gain in the repressor total, and the input's gain of cancels it.
The Hill law already predicts the low-input failure, weak repression. In the Hill law (54) the output is proportional to in units of , so
At it gives 818%. At low input the repressor is scarce, the promoter stays mostly free, and production tracks the input. This is weak repression, and the Hill law represents it.
The Hill law misses titration of the repressor by the promoter pool. With a light promoter, , eq. (60) starts the persistent window at , close to the Hill law. With a heavy promoter, , the first of repressor is soaked up by the sites, and the persistent window starts only at (numerical). In both cases the window begins about one decade beyond the leading-order regime boundary .
Below that window the heavy promoter has a protocol-dependent endpoint cancellation. At the error of eq. (60) passes through zero at , and stays within from to (exact roots, Figure 10). A tenfold step from there jumps across the titration ray : the input rises tenfold while the free promoter falls about tenfold as the repressor passes the pool. The two endpoints happen to give the same output. Between them the output does not stay flat, and a different step factor moves the cancelling input. It is not an adaptive window.
On the titration ray a step over-adapts. At the high-input step starts on the ray, where the free promoter is about . The step drives the promoter into , and the output settles at 0.41 of its old level, an error of (numerical). The Hill law, with its promoter in trace, has no ray to cross.
Scroll inside the figure to see it at reading size.
Scroll inside the figure to see it at reading size.
Segall-Shapiro, Sontag and Voigt tuned a monomeric TALE repressor to stay in excess at the lowest gene dosage, and obtained nearly constant expression across plasmids from 3 to 100 copies per cell, at the price of output strength (pp. 353 to 354).15 Their model assumes exactly the two conditions above, a repressor in excess of the promoters and of its (supplement Note 1, pp. 3 to 5), and gives the strength-error trade as (supplement Eq. 19). Goentoro and colleagues likewise ask for and note that the promoter then runs at a small fraction of its maximal strength (p. 897).16 At the edge of the light-promoter window here the promoter runs at of its unrepressed strength.
Check a repression design against both of its conditions, and , at the lowest input it must handle, and distinguish a persistent window from an endpoint cancellation by asking whether it survives a different step factor.
23Step responses: what each effective law misses
The closed dynamics show both failures in one experiment. Each effective law misses a different one, for a different reason.
5 · Close the loop. Step the input tenfold from the steady state and integrate the closed totals, with binding solved at every instant (Figure 11). At low input, , the degradation design starts in . Its total pulses 5.9-fold and returns to within 8.5%. The repression design starts in and rises about tenfold and stays there, with errors of 824% at and 892% at . At high input, , the roles swap. The light-promoter repression design starts in , pulses 4.9-fold and returns to within 8.1%. The degradation design starts in . Its total settles at an error of 814%, while its free X pulses 17-fold and returns exactly (all numerical).
Scroll inside the figure to see it at reading size.
Each effective law misses a different failure. The Michaelis-Menten law misses sequestration of the total output. It adapts at every input, with , and at high input it pulses to 18.4 and returns, while the binding-catalysis total stays 814% high. The Hill law captures the low-input failure, weak repression: its error of 818% at is close to the 824% of the light promoter. What it misses is depletion of free repressor by a finite promoter pool, and with it the titration that moves the window to and the over-adaptation to 0.41 on the titration ray.
The readout matters as much as the regime. In the degradation design free X adapts exactly at every input, and only the total fails. Which pool counts is a biological question. The total counts when bound X still acts or is still measured, as for a fluorescent fusion, or for a target mRNA that is still translated while bound, until it is cleaved. The effective law cannot pose the question, because it has no complex.
Both loops forget the input only inside one regime. Each design adapts over a feasible operating range of inputs, set by its binding regime, never over every possible input. Lecture 10 asks what a loop must remember to adapt across a whole range, and it should take these claims with that scope.
Read a step response together with the regime before the step: the degradation design adapts from and the repression design from , the Michaelis-Menten law misses sequestration of the total output, and the Hill law misses titration by the promoter pool.
Oscillation
A ring of three repressors loses its symmetric rest state when each link amplifies more than twofold. A Hill law cannot supply that gain at coefficient 1. A finite promoter pool can, by titration, if bound repressor leaves with free repressor. Below the threshold a cycle can still coexist with a stable rest state. The core follows one cycle around the ring.
24A ring's rest state loses stability at a gain of 2 per link
Linearizing a symmetric ring gives a threshold on the gain of each link: 2 for proteins alone, a loop gain of , and 4/3 with an mRNA stage at equal lifetimes. Crossing it destabilizes the symmetric rest state. It is not a necessary condition for oscillation. A Hill law's gain is always below its coefficient.
The threshold comes from the eigenvalues of a cyclic matrix. Take a symmetric ring of three nodes with uniform removal, linearized at its symmetric steady state. Each node relaxes at rate 1, in units of its removal rate, and its upstream neighbour pushes it with slope . We call the gain of each link. The loop gain, the product of the three link gains around the ring, is . The Jacobian is , with P the cyclic shift of the three nodes, whose eigenvalues are the cube roots of unity. So
For , , so the pair has real part and imaginary part . It crosses into the right half-plane at , a loop gain of 8, with frequency times the removal rate. A ring of N genes, N odd, crosses at . A two-gene loop instead becomes a saddle at , which was the toggle of §16.
The threshold is a statement about the symmetric rest state, not about oscillation in general. Above it the rest state is unstable. Below it the rest state is locally stable, yet a stable cycle can coexist with it far from rest, as §28 finds beyond a subcritical Hopf point. A gain above 2 per link is therefore sufficient to destabilize the rest state, and it is not necessary for a cycle.
An mRNA stage lowers the link threshold to 4/3 at best. Elowitz and Leibler's model adds an mRNA to each node (Box 1, p. 337):17
Here and are mRNA and protein in their authors' units, time is in mRNA lifetimes, and are the maximal and leaky transcription, and is the ratio of protein to mRNA removal rates. These letters hold only in this section. For a rotating mode the linearization gives . Setting and separating real and imaginary parts gives and . Eliminating , the rest state is unstable, for , exactly when
This is Elowitz and Leibler's condition with their slope written as . The left side is smallest, 4, at , equal lifetimes, where the condition becomes . For the rest state is unstable at every .
A Hill law supplies a gain below its coefficient. The protein-only ring is with . At its unique symmetric fixed point, ,
The first factor is below n and the second below 1, so a leak lowers the gain further. At , , below both thresholds, for every production, leak and pair of lifetimes. With Elowitz and Leibler's own parameters, , , and , derived from their Box 1, the gain is . The threshold of eq. (64) at is 1.52, so the steady state is unstable, and the predicted period is 43.2 mRNA lifetimes, about 125 minutes (numerical). Their repressilator, built from cooperative repressors, oscillated with a period of around 150 minutes (p. 336, reported). The Hill law is the right model for that circuit.
Scroll inside the figure to see it at reading size.
Optional: why a Hill ring with coefficient 1 never oscillates, from any start
The local argument leaves open a cycle far from the steady state, and a global argument closes it. Let and be the limsup and liminf of node i along a bounded trajectory. Each node passes its input through the decreasing map and through stable first-order filters, so and . Around the ring this gives and with , hence and .
Now f is a Möbius map, so is again a Möbius map, and it has the same two fixed points as f: one positive and attracting, one negative. So above the positive steady state and below it. The two inequalities then force . Every trajectory converges, in the protein-only model and with mRNA, for every parameter and every odd ring length (exact).
Potvin-Trottier and colleagues simulated a minimal Hill model of the repressilator at (, ). Its stochastic traces oscillate, while the deterministic equations with the same parameters show damped oscillations (Extended Data Fig. 4d and its legend; Supplementary Information 4.1, p. 12).18 The damping is the Hill limit of eq. (65).
Decide whether a repressor ring's symmetric rest state is stable by comparing the gain of each link with 2, a loop gain of 8, or with 4/3 when an mRNA stage has equal lifetimes. A gain above the threshold rules the rest state out, a gain below it does not rule out a cycle, and a Hill law supplies less than its coefficient.
25A finite promoter pool supplies the gain by titration
The same ring, written with its promoter sites, gets its gain from the titration layer of §16. The trace-promoter limit is the Hill ring with coefficient 1 and cannot oscillate.
1 · Model. Repressor binds the promoter sites of gene i as a monomer, with indices counted around the ring of three. Free sites express at the full rate, every site, free or bound, leaks at a small rate, and free and bound repressor are diluted alike:
As in §16 the total balance is exact, and in units of and the closed loop is
with , , and the free fraction of eq. (39). The observable is the three repressor totals over time.
2 · Limit. With the promoter in trace, , and eq. (67) becomes the protein-only Hill ring with coefficient 1. By §24 it converges from every start. 3 · Match. In that limit the two rings are the same equations. At the reference parameters of §28 with the promoter put in trace, the gain is and the run returns to rest (numerical).
4 · Move a total. With a finite pool, the gain is the titration slope. The gain of each link is the production slope relative to the removal slope of 1, , with or without leak. At a leak-free steady state , and H equals the log-slope (40) of the free fraction at , which is eq. (42). So the ring can borrow the steep log-slope that titration makes near equivalence, up to about (Figure 6). In the irreversible limit , below equivalence, and the gain is : the production per lifetime itself, without bound.
Write a repressor ring with its promoter sites, reduce it to eq. (67), and read the gain of each link as the titration slope , which a finite pool can raise far above 2.
26The tightness threshold and its irreversible-binding edge
A leak-free monomer ring's symmetric steady state can lose stability only if the promoter pool exceeds dissociation constants. Production must then lie in a window. Irreversible binding is the edge of this map, where Clamons and Murray's idealized ring sits.
The threshold is a quadratic inequality in the free fraction. Set the gain (42) above 2 and clear the denominator: becomes
Some between 0 and 1 satisfies it exactly when the discriminant is positive, , that is . The root above 1 is excluded, so , or
This is exact for the leak-free symmetric ring under uniform removal.
Production must lie in a window. The roots of eq. (68) are . Since falls as p rises, the steady state is unstable for
We call this the symmetric-state instability window, because that is what it bounds. It is not the complete set of parameters at which a cycle exists, as §28 shows.
The window's two edges have simple limits. They follow from and . At the window is , and the largest gain over production is 7.11, close to (exact, leak-free). A leak raises the threshold slightly: to 14.1 at , 16.1 at and 20.8 at (numerical).
The threshold concerns the steady state, not every cycle. Eq. (69) is necessary and sufficient for the symmetric steady state to lose stability at some production. It does not prove that no cycle exists below it, because a subcritical Hopf point can leave a stable cycle beside a stable steady state, as §28 finds. A scan below the threshold found none: at , 12, 13 and 13.5, with 26 productions from 1 to 316 and two distant starts each, every run came to rest (numerical).
Irreversible binding is the edge of the map, and Clamons and Murray's idealized ring sits there. As , eq. (39) becomes . Clamons and Murray's first-order CRISPRi model assumes abundant dCas, instantaneous binding and irreversible one-to-one binding of the guide-dCas complex to DNA, until the promoter pool saturates (p. 9).19 For the ring, with guide totals and promoter total P, their equation is
where and are the guide production rates from an unbound and a bound promoter and is the dilution rate (p. 10). The loss multiplies the total guide, bound guide included, so this idealized equation dilutes bound complexes with free ones. In their full model, replication releases the DNA-bound complex back to the free pool rather than removing it (pp. 4 to 5), and the printed reaction list gives a different product for that step (p. 6). The comparison is therefore made on eq. (71).
A coefficient conversion maps eq. (71) onto the ring (67) at the edge. Since ,
So their leak is a background from every promoter plus an increment from each free one, the lecture's form. With and time in units of ,
which is eq. (67) at with , that is . At zero leak the two equations coincide exactly. Integrated side by side they give the same period, 3.808 in units of , with a largest trajectory difference of (numerical).
Their instability condition needs the central state below saturation. If , the symmetric state lies on the sloped segment, , the gain is a, and the rotating pair has real part . It is unstable exactly when , that is , the condition they derived (p. 11). If , the symmetric state is , on the flat segment where production does not depend on the input, and the Jacobian is : stable. At the state sits on the kink, where the law has no derivative, so it is treated directly. A node below 1 never falls, since its rate is at least , so every deficit shrinks at least as . A node above 1 adds nothing to the next node's production, so the deficit cannot travel around the ring, and every trajectory comes to rest at (exact). So the complete condition is together with . For example , , satisfies the first, with , but has , a saturated central state at , and a stable one (exact). Clamons and Murray state that cooperativity is not necessary for a toggle or a repressilator (p. 12). In the coordinates of this page their ring is the right edge of the map, , where the window (70) becomes .
Test whether a monomer ring's symmetric state can lose stability against and the production window (70), read irreversible binding as the edge with the conversion (72), and require as well as at that edge.
27The bound-to-free removal ratio rescales the pool
If bound repressor leaves at a fraction of the rate of free repressor, the symmetric-state gain and the instability thresholds of the ring and the toggle are those of uniform removal with the pool replaced by . Protected bound repressor, , makes neither a toggle nor a cycle, from any start.
Partial protection changes the removal slope. Let free repressor leave at and bound repressor at , with time in units of . The free repressor, in units of , is , so the ring becomes
The removal slope is , and . Dividing the production slope by it, the gain is .
At a leak-free steady state the gain is the uniform gain at a smaller pool. The steady state balances . With from eq. (39) and , this gives , and substituting,
So the removal ratio rescales the pool in the symmetric-state analysis. The link gain at the symmetric state, and every instability threshold derived from it, are those of uniform removal with replaced by and a by (exact, Figure 13). The substitution concerns the symmetric state only. It does not make whole trajectories or cycles identical, and eq. (74) is not the uniform ring with new constants.
The rescaling gives the two thresholds at once. The ring's symmetric state can lose stability exactly when , by eq. (69). The symmetric state of the toggle of §16 is a saddle exactly when and
which is eq. (43) rescaled. With bound repressor protected, , eq. (75) gives
for every pool and production. Titration then lowers the production slope and the removal slope in the same proportion, and the two cancel. That is a local statement about the symmetric state. A global one also holds, because free-only removal turns each node into a Hill-1 filter of free repressor. Write node i in its free repressor . Binding gives , so the input of node i is , a decreasing Möbius map of the upstream free repressor, and its removal rises with . The limsup and liminf argument of the optional box in §24 then applies to the free repressors, around a ring of any length, odd or even. Every trajectory of the ring and of the toggle converges to the unique steady state, for every pool, production and leak (exact). A check from four starts at each of 24 parameter sets for the ring and the toggle found the same (numerical).
The numbers show how much protection the ring tolerates. At the largest leak-free gain is 7.11, 5.05, 3.24 and 1.74 for , 0.5, 0.2 and 0.05 (exact). With a leak of the values for 1, 0.5 and 0.05 are 6.99, 4.99 and 1.73 (numerical). The ring's steady state can lose stability only for . At the bound repressor must leave at more than 0.279 times the rate of free repressor.
Scroll inside the figure to see it at reading size.
The published analyses sit at particular removal ratios. In Loinger and Biham's rate equations, bound repressor degrades at and free repressor at d, so . Without bound-repressor degradation their single steady state "is stable for any choice of the parameters" (p. 6), the case . With it their Eq. 5 oscillates, and the oscillatory range "shrinks to zero when " (p. 7), consistent with the rescaled threshold.20 Müller and colleagues degrade free proteins only (preprint, p. 3), which is , and find the central equilibrium of their ring stable for Hill coefficients below 4/3 (p. 29).21 Potvin-Trottier and colleagues note that equal dilution of repressor and binding sites is key to effective titration (Supplementary Information 4.3, p. 17).18
Name the bound-to-free removal ratio before deciding what monomeric repressors can do: replace by in every symmetric-state threshold, so a toggle's symmetric state is a saddle only if , a ring's rest state can lose stability only if , and protected bound repressor allows neither a toggle nor a cycle.
28Hopf points, a subcritical edge and a relaxation cycle
Inside the window the ring settles onto a relaxation cycle. Its upper edge is subcritical, so a stable cycle outlives the unstable steady state, and rest and oscillation coexist.
5 · Close the loop. Take and a leak . The steady state loses stability between two Hopf points, at and , where the gain passes 2. The lower crossing is supercritical: the cycle grows from zero amplitude, with a peak-to-peak of 0.25 at . The upper crossing is subcritical. The large cycle outlives the steady state's instability up to a fold of cycles near , so a stable steady state and a stable cycle coexist for , separated by an unstable cycle (all numerical). A gain above 2 is therefore sufficient for the steady state to lose stability, but not necessary for oscillation.
At the reference production the steady state spirals outward fast. At the symmetric state has , and . Eq. (62) then gives the eigenvalues and , which a finite-difference Jacobian reproduces (numerical).
The cycle is a relaxation oscillation through three titration switches. At the period is . Each total swings from to , while the free fraction of its target sites runs from to 0.83 (numerical, Figure 14). One repressor pulse holds the next promoter pool occupied while dilution clears it. When its total falls through the pool, the pool is released abruptly, the next gene fires, and its pulse represses the gene after. On the map of Figure 1, each pool sweeps its cut from far below the ray to far above it once per cycle. The same cycle is reached from a distant start.
Scroll inside the figure to see it at reading size.
Take about 20 promoter copies per E. coli cell, which is about 20 nM by Lecture 2's rule that one molecule per cell is about one nanomolar. Take a tight repressor with . Then , far above 13.9. A free site that makes one repressor per minute, diluted at per minute (a 23-minute doubling), gives , inside the window . The period is then minutes, about 14 doublings. All of these are illustrative values and a model prediction.
For comparison, reported values. The Lac repressor binds its operator in vitro with a dissociation constant close to in standard buffer (p. 402).22 The chromosomal DnaA boxes of E. coli form a natural titration pool of about 300 high-affinity sites with dissociation constants near 1 nM (pp. 013011-2 to 013011-3).23 A three-node CRISPRi ring in E. coli oscillated with a period of 10 to 12 hours (p. 6).24 Clamons and Murray's full model predicts about seven hours (p. 12).
Loinger and Biham's oscillator sits inside the window. Their Fig. 2 uses one promoter site per gene, protein synthesis , degradation , binding per molecule and unbinding , all per second, and reports a period of about 2260 s (p. 19).20 In this page's units that is , and molecules, so . There the leak-free window is , the gain is 3.38, and eq. (67) cycles with period s. Their binding is only a few times faster than degradation, so the occupancy constant is the better equilibrium proxy. With it , the window is , the gain 2.95 and the period 2210 s (all numerical). The two equilibrium estimates bracket their reported period.
Read a ring's behavior from its closed dynamics, not from the gain alone: locate the two Hopf points and their criticality, expect a relaxation cycle with a period of about ten lifetimes inside the window, and check for a coexistence band beyond a subcritical edge.
29The cycle as a tour through repression patterns
The same cycle can be read without a Jacobian, as a sequence of repression patterns. The reading uses three kinds of statement, kept apart below: exact winner boundaries, asymptotic formulas on their own domains, and a high/low cartoon checked against the exact allocation.
A predicted rest point must pass two separate tests. It must be a fixed point of the coupled equations of its pattern and lie inside the inequalities that define that pattern, which is consistency. And it must be stable under the dynamics. Consistency alone proves nothing about memory or rest: a consistent point can be a saddle. The two tests are checked separately below.
Each link has two conservation rows, and each row has its own exact winner boundary. Take the pair formed by repressor and the sites of gene i, and write . In units of , the promoter row is , free sites plus bound sites, and the repressor row is , free repressor plus bound copies. Free sites win the promoter row while , and putting into gives . Free repressor wins its row while , and with the tie forces , at . At the two boundaries are 0.505 and 1.99 (exact winner boundaries). Named by the winner of the promoter row and then of the repressor row, they split each link into below 0.505, the singular between, and above 1.99.
Each asymptotic formula holds on its own side of equivalence, not on its side of a winner boundary. Below equivalence, for , the sites fill one for one and . Above it, for , the sites are full and . The exact quadratic (39) bridges the corner , where neither piece holds. The excess formula has no meaning below equivalence, even inside the bound-sites regime: at it gives , against the exact 0.26394345. Inserted into eq. (67), the two pieces give the reduced dynamics
The first is affine in the totals. The second is nonlinear in the upstream total. Both relax at rate 1 toward a target set by the upstream total. At the two winner boundaries each piece is within 1.1% of the exact free fraction on its own side, and deeper inside it is closer (asymptotic formulas, on these domains).
The cartoon calls a repressor low below the promoter boundary and high above the repressor boundary. Low means , so its target sites are mostly free. High means , so it is mostly free itself and its target sites are nearly all bound. A repressor between the two boundaries is in the intermediate band, which the cartoon leaves unresolved. The band is much wider than the rounding layer , and away from that layer an asymptotic piece still works inside it: at , against the exact 0.311. This section simply uses the exact root throughout the band. The exact boundary values fix each node's target. A low upstream leaves , so the target lies between 16.68 and 33.33. A high upstream leaves , so the target lies between 0.033 and 0.200 (exact, at , , ). For every production with , a low upstream sends its node's target into the high class, and a high upstream sends it into the low class.
No pattern of low and high repressors is consistent, so the ring cannot rest in one. In such a pattern each node heads for the class opposite to its upstream neighbour's, and around a ring of three no assignment of two classes alternates at every link. The two uniform patterns show the same through their coupled fixed points. In the all-low pattern every link follows the affine equation, and the coupled symmetric fixed point is , far above 0.505 and outside the affine piece's own domain (exact for eq. 78). The value is only the target of a node whose upstream repressor is clamped at zero, and not a fixed point. In the all-high pattern the coupled symmetric fixed point solves , which gives , below 1.99 (exact for eq. 78). Neither reduced system has another fixed point, because each link is a decreasing affine or Möbius map of its upstream total.
The only steady state sits in the intermediate band, and the stability test rejects it. Each link of the full ring is a decreasing function of its upstream total, so the full ring has exactly one steady state, the symmetric one. At it is , with . Bound sites hold 0.967 of the pool and bound copies 0.867 of the repressor, so every link is in the singular regime , inside the intermediate band and close to the rounding layer, at . Neither asymptotic piece describes it: the excess piece gives a free fraction of 0.0430, against the exact 0.0325. The state is consistent and real, and its gain is , above the threshold of 2 from §24, so it is unstable (numerical). Consistency decides whether a predicted rest point is real. Stability decides whether the ring can stay there.
Between rest points the state is handed on, one release at a time. One repressor pulse holds the next promoter pool occupied while dilution clears it. When the pulse falls through the intermediate band, the pool is released, the next gene fires, and its pulse represses the gene after. Six phases of one period at , measured from a peak of , give each repressor's class and the exact allocation of one promoter row and one repressor row:
| classes | sites of gene 1: free, bound | repressor 1: free, bound | ||
|---|---|---|---|---|
| 0.00 | 0.272, 24.4, 1.18 | low, high, middle | 0.024, 0.976 | 0.002, 0.270 |
| 1.65 | 14.1, 5.98, 0.269 | high, high, low | 0.733, 0.267 | 13.1, 1.00 |
| 3.30 | 24.4, 1.18, 0.272 | high, middle, low | 0.730, 0.270 | 23.4, 1.00 |
| 4.95 | 5.98, 0.269, 14.1 | high, low, high | 0.000, 1.000 | 4.98, 0.999 |
| 6.61 | 1.18, 0.272, 24.4 | middle, low, high | 0.000, 1.000 | 0.204, 0.976 |
| 8.26 | 0.269, 14.1, 5.98 | low, high, high | 0.001, 0.999 | 0.002, 0.267 |
The table checks the cartoon against the exact allocation. At every phase each low or high repressor is matched by its asymptotic piece to within 0.3% of the exact free fraction, and at three phases one repressor is crossing the intermediate band, where this section uses the exact root. Gene 1's promoter row changes winner twice per period, between free and bound sites. Repressor 1's row changes winner twice as well, between free repressor and the copies on gene 2's sites (numerical, in units of ). The cycle spans r from 0.169 to 24.35, so it crosses both exact boundaries, and the targets at its extremes, 27.7 from the trough and 0.040 from the peak, lie in the classes the cartoon predicts.
The pattern argument explains the order, and the full model supplies the rest. The reduced equations (78) hold on their domains and fail in the rounding layer around equivalence, which each repressor crosses twice per period, and the cartoon leaves the wider intermediate band unresolved. So the pattern argument explains the sequence of repression patterns, not the period, the amplitude or the basin. Those come from integrating the full ring, as §28 does, and the parameters used here are verified there to oscillate.
This is Marken, Xiao and Murray's structural reading, applied here to titration. They simplify a circuit inside each saturation regime, compute that regime's fixed point, and ask whether it is consistent, meaning that it lies inside the regime it came from (p. 8). For a Hill repressilator they find the all-low fixed point inconsistent once , the all-high fixed point consistent but failing its own stability test once , and the six mixed regimes pointing around the ring to carry the cycle (§4, pp. 12 to 14 and Fig. 4).26 Their all-low point does not transfer to this ring. It comes from production that is constant while the upstream repressor is low, whereas here production in the low class falls linearly with the upstream total, and the coupled all-low fixed point is . What transfers is the pointing, here with no cooperativity at all. The bound , which sends a low upstream's target into the high class, plays the role of their , and the bound keeps the target of a high upstream low against the leak and the residual free sites. The role of their consistent but unstable all-high point is taken by the steady state in the intermediate band, which lies near the rounding layer and needs the exact quadratic.
Their is a threshold of the limiting cartoon, not a finite-parameter condition. In the smooth Hill model at finite production the gain is , below n by eq. (65), so at the symmetric state's leading real part is still negative. The cartoon is marginal exactly at that endpoint. The monomer ring has its own gain, eq. (42), and its own verified conditions, eq. (69) and the window (70). They are not the cartoon's condition transferred. They also state their own limits: the regime description is good far from a boundary and breaks down near one, smooth transitions between regimes are assumed rather than proved, and the connection between their structural matrix and the Jacobian is still under development (p. 15). Lecture 11 develops the systematic version of this method.
Read an oscillation as a tour through repression patterns: draw each pattern with exact winner boundaries, reduce its dynamics only where an asymptotic formula holds, compute the coupled fixed point before calling it a rest point, test consistency and stability separately, and keep the full model as the check on the period and the attractor.
Every result holds in its regime
The five comparisons gave three kinds of contrast. Each sits at a regime boundary derived above. Collected, they place every example and every published result at its parameter conditions, invert into a list of requirements, and come with a precise guarantee and a precise limit.
30Three contrasts mark where an effective law leaves its regime
An effective law can hide a difference between mechanisms, forbid a behavior the mechanism produces, or misjudge how a capacity scales. In every case the law holds inside its regime, exactly in its limit and to leading order near it, and the contrast appears across a boundary with a formula.
The three kinds of contrast are the evidence, and each one has an address. The table lists, for each comparison, where the effective law holds and the boundary beyond which the binding-catalysis model parts from it.
| Kind | Comparison | The effective law holds where | The contrast appears where |
|---|---|---|---|
| Hides a difference | Activator against repressor (§6, §7) | Free inducer clamped, promoter in trace | Inducer total controlled and , eq. (23) |
| Hides a difference | Degradation design (§21) | Free output wins its total, | Total output with before a tenfold step held to 10%, eq. (58) |
| Hides a difference | Repression design (§22) | Promoter in trace | Promoter total above : the window moves to at |
| Forbids a behavior | Two-site receptor (§12, §13) | Free ligand, | Ligand total with and , |
| Forbids a behavior | Monomeric toggle (§16) | Promoter in trace, one stable state | Symmetric state a saddle for and production above eq. (76) |
| Forbids a behavior | Monomer ring (§24 to §27) | Promoter in trace, | Rest state unstable for and production in the window (70), and a coexisting cycle beyond its subcritical edge |
| Misjudges a scaling | N factors (§17 to §19) | Symmetric Hill mutual repression, at most on the grid | A shared dimer pool with uniform removal: binomial sums (50) |
The last row compares two architectures within one framework, not a mechanism with its own limit. The same-mechanism comparison for multistability is the monomeric toggle, in the fifth row.
The table mixes three kinds of boundary, and the difference matters. The validity boundary of an approximation, such as for the Michaelis-Menten law, ends a formula, not necessarily a behavior: a law can agree by accident outside its regime. A performance criterion, such as a tenfold-step error below 10%, is a threshold chosen by the test. A bifurcation boundary, such as the symmetric toggle's pitchfork, where its symmetric state becomes a saddle, or the ring's loss of stability, is a property of the closed dynamics. Rows 1 to 4 and 7 of the table are validity boundaries and performance criteria. Rows 5 and 6 are bifurcation boundaries.
Each boundary is a ratio of totals to an affinity, a removal ratio or a production window. None is a property of the effective law alone. Each names a parameter a cell or an experiment can move. That is why the contrasts can be turned into a placement: a published result is neither right nor wrong in general, it holds in the regime its conditions select.
Before calling an effective law wrong, find its regime and the boundary that ends it: a ratio of a total to a dissociation constant, a removal ratio, or a production window.
31The placement table: each result at its parameter conditions
Every example of this chapter, and every published result about the same behaviors, holds at parameter conditions that Parts 2 to 6 derived. The table collects them. The monomeric-repressor rows also appear on one plane.
The table reads left to right as result, conditions, consequence, derivation. The conditions are inequalities on totals, affinities, production and removal. The consequence carries its label: exact, leading order, numerical or reported. The last column names the section that derives the condition, so every boundary can be checked.
| Result | Parameter conditions | What holds there | Derived in |
|---|---|---|---|
| Matched induction law, and Savageau's controlled comparison4 | Free inducer clamped, , binding at equilibrium, | One law, eq. (18), for both circuits. They differ only in the sign of (exact) | §6, §8 |
| Repressor threshold in the inducer total, as the lecturer's draft states25 | Inducer total controlled, , and for a sharp switch , roughly | Half rise near , eq. (20). Steepness rising continuously with the affinity ratio, eq. (23), toward (leading order) | §7 |
| Activator order in the inducer total, as the lecturer's thesis states3 | Any parameters, with the free activator unable to bind the promoter | Order at most 1 and , eq. (17) (exact) | §5 |
| Brewster's promoter-copy experiment5 | Uninduced repressor, tight promoter binding, | Production per promoter about (leading order). Measured fold-change near 1 while repressors are fewer than gene copies (reported) | §8 |
| Closed inducer loop, and Buchler and Louis's synthesis-rate threshold6 | Free-only removal of inducer, or uniform dilution | Steady state reads , or the total (exact). Repressor on only for (leading order) | §9 |
| Goldbeter and Koshland's switch7 | Both enzymes saturated, . For unbounded steepness of the modified fraction against the enzyme ratio, a phosphatase share | , eq. (29). One first-order enzyme caps at 2, and a larger phosphatase share caps it by eq. (30), at 2 from a share of 9/19 on (exact limits) | §11 |
| Ha and Ferrell's receptor, and Buchler and Cross's sequestration8, 9 | Ligand or titrant total as the input, , | Flat to , then eq. (35), . In free ligand . Peak at when the receptor total is swept | §12 to §14 |
| Gardner, Cantor and Collins's toggle, and Cherry and Adler's product condition10, 11 | Hill coefficients with , synthesis inside the wedge, edge (37) on the diagonal | Two stable states. For , one globally attracting state (proved) | §15 |
| Monomeric toggle by depletion of free repressor11 | and , with eq. (43) at | Symmetric state a saddle (exact), two stable states at every tested grid point for (numerical). With the promoter in trace, or , one state from any start (proved) | §16, §27 |
| Symmetric Hill mutual repression of N genes | Product form, all-to-all, no self-activation, grid , | At most one raised node (proved). At most stable states on the grid (numerical) | §17 |
| MultiFate12 | Fast dimerization, uniform removal, the published production and binding constants | Binomial sums (50): 3, 7, 15, 30, up to 299 for N = 2 to 12 (numerical). Seven states measured at N = 3 (reported). The 256 at N = 9 includes 126 saddles (our reanalysis). Free-only removal: 1 or | §18, §19 |
| Degradation adaptation, Du's microRNA modules, and Bleris's model13, 14 | Total output, for a tenfold step held to 10%: before the step, so at . With output dilution, above about 3500. Du: , approximately | Adapts at low input and fails at high input by sequestration of the total output. Free output adapts at every input. Bleris's predicted loss is the saturated regime (model prediction) | §21, §23 |
| Repression adaptation, Segall-Shapiro's TALE circuit, and Goentoro's condition15, 16 | At the lowest input, (Hill law), at , at | Adapts at high input and fails at low input by weak repression and titration. The band from 1.904 to 2.211 is a protocol-dependent cancellation | §22, §23 |
| Hill repressilators: Elowitz and Leibler, and Potvin-Trottier's damped model17, 18 | Promoter in trace. Rest state unstable for a link gain above 2, or above the threshold (64) with mRNA | Hill coefficient 2 at Elowitz and Leibler's parameters oscillates, (numerical). Coefficient 1 never oscillates, from any start (proved) | §24 |
| Monomer ring by titration: Loinger and Biham, and this chapter's ring20 | , production in the window (70). Loinger and Biham: , from 38 to 50, | Steady state unstable (exact), relaxation cycle (numerical), and coexistence beyond a subcritical edge | §25 to §28 |
| Clamons and Murray's idealized CRISPRi ring19 | The edge : and | Central state unstable. A saturated central state, , is stable (exact) | §26 |
| Protected bound repressor: Loinger and Biham's Eq. 3, and Müller's ring20, 21 | , and every trajectory converges to the unique steady state: no toggle and no cycle at any pool, production or leak (proved) | §27 |
Scroll inside the figure to see it at reading size.
The removal rule belongs on the map. Removal of free species alone protects bound molecules. That protection fixes the free-inducer steady state in §9, separates MultiFate's steady-state equations in §19, and forbids the monomeric toggle and ring in §27. Three of the table's rows change when changes, so a placement that omits the removal rule is incomplete.
Some boundaries on the table come from the regimes and some from the closed dynamics. Where a half rise sits, where a window of adaptation ends, and where a switch occurs are read from the regimes of a binding pair. Where a steady state loses stability, eq. (69) and the window (70), is a condition on the Jacobian of the closed loop. It uses the exact titration slope across the singular ray, not a single regime's monomial law. §33 makes the distinction precise.
Place a new result by writing its mechanism as binding and catalysis, naming its removal ratio, and finding the row whose inequalities its parameters satisfy. If no row fits, run the five steps and add one.
32The same table, read as a set of requirements
Read from the behavior backwards, each row becomes a list of requirements on totals, affinities, production and removal, and an experiment that would show the boundary.
Inverting a row is a mechanical step, because every condition is an inequality in measurable quantities. Start from the behavior, find the rows that produce it, and read their inequalities as a specification. Each inequality names one of four things: which total is the controlled input, how large a total must be against a dissociation constant, how strong production must be against removal, and what the bound-to-free removal ratio must be. The last column then points at the derivation, so the requirement can be rechecked when a parameter is revised.
The requirements for the five behaviors of this chapter, stated as inequalities. A threshold in an induction input asks for the repressor architecture, an inducer whose total the system sets, and inducer binding tight enough for the sharpness wanted, which eq. (23) specifies. At the illustrated total , a ratio gives , and the threshold sits at (§7). A steep response from one binding layer asks for a titrant whose total sets the threshold and whose ratio to its sets the sharpness, with and for a two-site receptor (§13). Memory from monomeric parts asks, at the symmetric state, for and production above eq. (76) (§16, §27). Adaptation of a total output is specified here by the test chosen in §21, a tenfold step held to 10%. For the degradation route it asks that the controller before the step stay below in total, , and that catalysis be about 3500 times faster than any other removal of the output. For the repression route it asks that the controller exceed both and the promoter total at the lowest input (§21, §22). A different step or tolerance moves these numbers. A cycle that grows from an unstable rest state asks for , a production inside the window (70), and a small leak. A cycle can also coexist with a stable rest state beyond a subcritical edge, which none of these inequalities captures (§26 to §28).
Each requirement also names the sweep that would expose its boundary. The threshold row predicts that a sweep of the inducer total at several repressor totals moves the half rise with slope 1 in . The receptor row predicts a peak at when the receptor total is swept at fixed ligand. The adaptation rows predict opposite failures at the two ends of the input range, and different verdicts for the free and the total output. The ring rows predict a window in production with two edges, and a loss of the window as falls. A measurement that follows a predicted boundary supports the placement. One that does not locates a missing state or a wrong removal rule, which is more useful than a better fit.
Two of these questions are handed forward. Lecture 10 takes the adaptation rows, with their scope: each design adapts over a feasible operating range of inputs, never over every input. Lecture 11 takes the regime maps themselves and develops the general geometry, for networks with many pairs, that this chapter uses one pair at a time.
Turn any row of the table into a specification by reading its inequalities as requirements on the controlled total, the ratios of totals to dissociation constants, the production window and the removal ratio, and then name the sweep that would show the boundary.
33What the regime enumeration guarantees, and what it leaves to the dynamics
For a written binding-catalysis mechanism, the regimes of its conservation sums can be enumerated completely. That covers the parameter space. It does not count attractors, locate Hopf points or decide whether a cycle coexists with a steady state.
The enumeration is complete because each conservation equation is a finite sum of positive terms. A mechanism fixes a finite list of species and a finite list of complexes, so each total is with the number of copies of constituent i in species j. At every positive parameter choice each such sum has a largest term, its winner. A choice of one winner per total is a regime, and there are finitely many choices. Enumerating them therefore exhausts the possibilities. Two kinds of inequality describe a regime, and only one is linear in the totals. The exact winner inequalities, such as , are linear in the logarithms of the species. Rewritten in the totals they generally are not: the exact tie of §2 lies on , which is not a line in log coordinates. The leading-order consistency conditions, written with each regime's own monomial laws, are linear inequalities in the logarithms of the totals and the binding constants, and they define the polyhedral map. Lecture 8 gives the procedure, and Lecture 11 develops its geometry.
The guarantee is conditional on the written mechanism being the intended one. The mechanism includes its binding states, its activities, its removal rules and the fast-equilibrium assumption. A missing complex, a missing conformation or a removal rule written as uniform when it is not changes the lists, and therefore the enumeration. Nothing in the procedure can detect such an omission. This chapter supplies three reminders: §19, where the removal rule changes the count from binomial sums to 1 or ; §27, where the removal ratio rescales every symmetric-state threshold; and §22, where the promoter total, absent from the effective law, moves an adaptive window by a decade.
Three cases need the full equations rather than one regime's monomial law. The first is a tie, where two terms of one total contribute comparably. It marks a boundary between two regimes, and there either regime's law is off by a bounded factor, at most 2 for one pair (§2). The second is a singular regime, which is a different thing: its winners are dependent, as on §2's ray, where the complex wins both totals, the free pool is , and the winner equations leave the free species undetermined until one more balance is added. The third is any question about the closed dynamics, which needs the Jacobian, built from exact slopes. The steep behavior lives near the first two: eq. (40)'s log-slope peaks at of eq. (40a), just above equivalence.
The guarantee covers regimes, and the dynamics still decide the behavior. Four results of this chapter make the limit concrete. The number of stable states of MultiFate comes from enumerating fixed points of the closed loop and computing eigenvalues, not from the binding regimes (§19). The threshold comes from the Jacobian of the ring at its steady state, and it uses the exact titration slope (§26). The criticality of the two Hopf points, and the band from to where a stable cycle coexists with a stable steady state, come from integrating the closed dynamics (§28). And because of that subcritical edge, a gain above 2 is sufficient for the symmetric steady state to lose stability but not necessary for a cycle to exist. A complete regime analysis of a mechanism does not list its attractors.
So the chapter ends with one claim and one boundary on it. The claim: for a written binding-catalysis mechanism, the regimes of its conservation sums can be listed in full, every published result about its behaviors can be placed at the conditions where it holds, and the list inverts into requirements. The boundary: regimes are not attractors. Which attractor a closed loop reaches, whether a cycle exists, and whether rest and oscillation coexist are questions for the dynamics, answered example by example in Parts 4 to 6.
Claim completeness for the regimes of a written mechanism, under its stated binding states, activities, removal rules and equilibrium assumption, and claim nothing about attractors without the closed dynamics: stability, cycles and coexistence are separate calculations.
Thresholds, gates and feedback
Four derivations that the core uses intuitively, each prompted by what the one before leaves open. Cooperative binding has an equilibrium ceiling on steepness, so §34 looks for a threshold in one binding pair read against a total. A threshold reads one input, so §35 asks what a promoter reading two inputs can compute. A steep law can be closed on its own output, so §36 asks what feedback buys from steepness, and finds a residual of about . That residual never vanishes, so §37 asks what removes it, and finds a stored difference of two sequestering species. Lecture 10 develops the adaptation story systematically.
34One binding pair computes a rectifier and a minimum
Why look for steepness in a single binding pair? Because occupancy at equilibrium, read against a free ligand, has a ceiling: its Hill slope cannot exceed the number of sites. One pair read against a total escapes that ceiling. With tight binding it leaves a free pool that is the positive part of a difference and a complex that is the smaller of two totals. Weak binding gives a product instead, and one bound covers the whole plane.
Cooperative occupancy has a ceiling on steepness, set by the number of sites. Take a molecule with n sites at equilibrium with a free ligand L, and let m be the number of ligands bound, distributed over the states with weights proportional to . Then , and the Hill slope of the occupancy odds is
The bound holds because m lies between 0 and n, so , which is . Equality needs all-or-none binding, every molecule empty or full. So a Hill slope of 8 by this route needs at least 8 sites on one molecule acting together, and reaching the bound needs all-or-none binding (exact, for direct occupancy at equilibrium). Sites are not subunits: one molecule can carry several sites, so the count says nothing about how many proteins assemble. This is an equilibrium limit of the kind Lecture 7 contrasted with driven mechanisms.
The ceiling binds one kind of mechanism, and a fitted coefficient does not reveal the mechanism. Eq. (78a) concerns direct occupancy at equilibrium, read against the free ligand. A large fitted Hill coefficient therefore does not by itself imply that many sites. This chapter has already passed the ceiling twice: §11 with saturated enzymes, which are driven, and §13 with two sites read against a ligand total. Titration passes it the second way, by changing the input from a free ligand to a total, and one binding pair shows how.
The exact pair is one root, and every limit below is a limit of it. Take with , totals and , and equilibrium . As in eq. (4),
Tight binding gives a rectifier and a minimum. Let at fixed totals. Then , so at least one free pool vanishes, while the exact difference is preserved. If then B vanishes and , and otherwise A vanishes. So
The free pool is a rectifier in the partner total: zero up to a threshold at , then linear with slope 1. The complex is the smaller of the two totals, the limiting-pool response. These are the two readouts of §2's tight cut, written as functions.
At the corner the rectifier is rounded, and the rounding has a size. Set in eq. (79). Then and , so when (exact root, leading-order value). At and the exact free pool is 0.00995 against (numerical). The rectifier's corner is therefore not sharp: it is rounded over a width of order in the totals.
The log gain at the corner is the same that Part 4 found, from one site. Differentiating the free pool with respect to at gives a log gain of 50.50 at , against (numerical). One site per molecule, read against a total, so the ceiling of eq. (78a) does not apply, and the steepness grows without bound as binding tightens. The free fraction of a promoter pool in §16 is this same free pool with the pool and the repressor, which is why its peak slope has the same form.
Weak binding gives a product. If both totals are far below , both free pools are nearly their totals and , a multiplier. So one pair computes a product, a minimum or a rectified difference, depending only on where the two totals sit against .
One bound covers the whole plane. The three limits are the three candidates , and , and for positive totals and the complex is never far from the smallest of them:
The upper bound is immediate: cannot exceed either total, and . The lower bound needs a short argument, in two steps: rescale by the minimum, then bound the binding quadratic at one point. Let , and write , , and . Then and , because . Equilibrium becomes , and the physical root is the one below , where g falls from . It suffices to show at , for then the root lies at or above c. Using ,
The bracket is linear in each of and , which lie in , so its minimum sits at a corner. The corner gives , which is zero because c is the smaller root of , and the other corners give and , both positive. So , with equality only at and , that is (exact). A scan of points over six decades in each of , and agrees, with the ratio between 0.38197 and 1.0000 (numerical). So the three-way minimum is a leading-order law whose error is a factor of at most 2.62 anywhere, which is the bounded-factor accuracy of a dominance regime made concrete.
Read one binding pair as three computations selected by the totals: a product below , a minimum above it, and a rectified difference in the free pool, with a corner rounded over , a steepness that passes the equilibrium site ceiling because the input is a total, and a three-way minimum accurate within the factor 2.62 of eq. (81).
35A two-input promoter computes a gate set by its activities
A threshold reads one input. What can a promoter that reads two inputs compute? Its four binding states and their activities decide the gate. The truth table is a regime table of the promoter's conservation sum, and the gate has a fixed sign in each input exactly when its activities satisfy two inequalities per input.
The model is one conservation sum over four states. A promoter G binds regulator A at one site and regulator B at another, independently, with dissociation constants and . Independence means that each site binds with the same constants whether or not the other is occupied, so the four elementary steps close a square of states. Transcription from any state is composite:
Here , , and are the transcription activities of the empty, A-bound, B-bound and doubly bound states. Independent binding does not make the activities independent: any four values are allowed. At equilibrium the four states are in proportion , with and , so
An on-off gate gives each activity the value a or 0, and the set of expressing states names the gate.
The truth table is the regime table of the promoter total. Take each input either far below its dissociation constant, written 0, or far above it, written 1. At each corner one term of dominates, so one state wins the promoter total: the empty state at (0,0), the A-bound state at (1,0), the B-bound state at (0,1) and the doubly bound state at (1,1). The output is then the activity of that winner. Five gates follow at once:
| Expressing states | (0,0) | (1,0) | (0,1) | (1,1) | Gate |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 1 | AND | |
| 0 | 1 | 1 | 1 | OR | |
| 1 | 0 | 0 | 0 | NOR | |
| 1 | 1 | 1 | 0 | NAND | |
| 0 | 1 | 0 | 0 | A AND NOT B |
Reading a gate off a promoter is therefore the same exercise as reading a regime off a conservation sum: name the winner at each corner, then look up its activity.
The corners are idealizations, and each transition has a width set by its dissociation constant. With free inputs each site's occupancy is , which rises from 10% to 90% over a factor of 81 in its input, centred on its K. A corner is reached only when each input is far from its dissociation constant. If a regulator is depleted by the promoter, its input becomes a total, and the tight-titration rounding of §34, of order , replaces that width. A gate drawn as a truth table is an assertion about the corners alone.
The sign of each input is fixed by two inequalities on the activities. Differentiating eq. (83) in x at fixed y,
The sign is that of a straight line in y. So A activates at every level of B exactly when and , and represses at every level exactly when both inequalities reverse. B has the two corresponding inequalities, and for activation. The five gates of the table satisfy them, each input with one sign. A fixed-sign gate is monotone in each input, and it is these activity inequalities, not the positivity of the activities, that make it so.
XOR breaks the inequalities, and one layer can still compute it. XOR expresses at (1,0) and (0,1) and not at (0,0) or (1,1). Take : and , a silent doubly bound state. Eq. (84) becomes , which changes sign at , that is , so B decides whether A activates or represses (exact). The four corners give 0, 1, 1 and 0. XOR therefore needs no new binding model, only this activity assignment, which violates . Mutual exclusion alone does not give it: without the doubly bound state, the A-bound or B-bound state wins at (1,1), that corner expresses, and the gate becomes OR. Whether a real promoter silences its doubly bound state while expressing from each single state is a question about its activities. The alternative is a second layer, with one promoter computing OR, another NAND, and a third taking their outputs through an AND. Lecture 12 develops cellular computation.
Read a promoter gate from the winner of its conservation sum at each input corner, and read the sign of each input from the activity inequalities of eq. (84): XOR, which violates them, needs a silent doubly bound state or a second layer.
36Negative feedback divides small disturbances and small inputs by the same factor
§34 and §35 read their inputs without feedback. Closing a steep law on its own output asks a new question: how far does the steepness protect a steady state? Locally, one scalar identity divides a small change of removal and a small change of input by the same factor, . A finite change needs that identity integrated, because h moves with the steady state.
The model is one species with a decreasing production law. Let an input u drive production through a decreasing function F, and let the species be removed at frequency :
The production law F is the negative feedback: more x makes less x. At a positive steady state , define the static feedback steepness
For a Hill law , h is , below n, as in eq. (65). It is the same kind of quantity as the link gain H of §24, a log-slope of production. In this one-species loop the link is the whole loop, so h is also its loop gain. The lower-case h keeps the one-species loop apart from the three-node ring.
Implicit differentiation gives both local sensitivities at once. Take the logarithm of the balance: . Differentiating, and using ,
Without feedback, , the steady state is inversely proportional to the removal rate, for any change. With , a small relative change of the removal rate moves the steady state by a tenth as much. Checked against finite differences of exact steady states of eq. (85) for Hill laws with , 2 and 4, the identities agree to 10 significant figures (numerical).
A finite change needs the identity integrated, because h moves with the steady state. Integrating eq. (87) along the path from to ,
The power law follows only if h is constant along the whole path, and a Hill law's h is not: it falls as the steady state falls. Take , and the steady state with , which is with . Doubling gives , against 0.933033 from a frozen h. A tenfold increase gives 0.228571, against 0.794328 (exact steady states of eq. 85). Steepness protects a steady state only while the steady state stays on the steep part of its law.
The same steepness that rejects a disturbance also rejects the signal. Eqs. (87) are equal and opposite. Locally, a loop that suppresses a change in its removal rate by suppresses a change in its input by exactly the same factor. Rejection and responsiveness are the same quantity here, which is why a circuit that must both hold a set point and follow a signal cannot do it with static steepness alone.
The steady state of this scalar model is always locally stable. Linearizing eq. (85) at gives the eigenvalue , which is negative because . So negative feedback in this one-species, instantaneous form cannot destabilize anything. That is a property of the scalar model, not of feedback in general: Part 6's ring is negative feedback with three stages, and it oscillates.
The electronic form of the statement carries two different gains, and they must not be confused. In Black's static amplifier an input u is amplified by A after a fraction of the output is subtracted. This is a feedback factor, not the Hill coefficient of §15 or the activated production of §18. The relation is . Solving,
The first quantity is the closed-loop gain, which falls as feedback is added. The second is the relative sensitivity of that gain to the amplifier, which falls in the same proportion. At and the closed-loop gain is 0.990 and the sensitivity is 0.0099 (exact). Black wrote the same two relations as and , with his loop transmission negative for negative feedback (pp. 5 to 6).27 Writing as the loop gain, eq. (88) has the form of eq. (87) with : locally, a loop gain of h divides a change by . Khammash draws the same comparison for a negatively autoregulated gene with Hill coefficient n, whose steady state has sensitivities of about to its expression and degradation rates (Fig. 2 caption, p. 5).28 That is the limit of eq. (87), reached at high expression.
Measure what negative feedback buys from the static steepness : locally it divides both a disturbance and an input by , a finite change needs the integral (87a) because h moves with the steady state, and in the scalar model feedback never costs stability.
37Rejection is not perfect adaptation
§36's loop shrinks an error but never removes it. What removes it? A stored quantity, not a steeper curve. Two sequestering species supply one: the rate of change of their difference is the error, so the difference stores the accumulated error, and at a steady state the error is zero.
A static law cannot reach zero error at finite steepness. By eq. (87a) a finite change of the removal rate leaves the steady state unchanged only if h is infinite along the whole path. Locally the residual is the fraction of the change. For a large step it can be much worse, because h falls as the steady state falls: in §36's example a tenfold step from leaves the output at 0.229 of its old level. The binding mechanisms of Parts 3 and 4 supply a finite h: eq. (40a) caps the titration steepness at , and eq. (65) caps a Hill law below its coefficient.
Integral action is a stored quantity, and that is a different thing from a steep curve. An integrator holds a running total of the error and keeps changing its output until that error is zero. The state that holds it is a memory, so the circuit needs an extra species, not a sharper function of x. Khammash describes the same action in the frequency domain, as infinite gain at zero frequency (p. 7).28 That description belongs to a dynamic integrator, and it is not a licence to treat an infinitely steep static law as one.
Sequestration supplies the memory, written here as a reversible pair whose complex is removed. A reference species is made at constant rate and actuates the output. A sensor species is made in proportion to the output, at rate . The two bind into a complex, which is removed. This is the controller's sensing rate, in the notation of Briat, Gupta and Khammash, and not the bound-to-free removal ratio of §27, which does not appear again in this section.29 The output X is made by free and removed at frequency , and the disturbance is a change of :
Binding and unbinding cancel in the difference of the two free species. The net sequestration flux takes one and one per binding event and returns one of each per unbinding, so it enters both free balances identically:
The rate of change of is the error , so itself stores the accumulated error. With the totals and , the difference is also , and complex removal, which takes one of each, cancels there too. At any steady state the left side of eq. (90) is zero, so
whatever and the plant's other constants are. This is robust perfect adaptation: the set point depends on two controller constants and on nothing in the controlled network. Simulating eq. (89) at , , , , and , from small positive starts, the steady state is 4.000000 at , 1, 2 and 3, and every species stays nonnegative (numerical). Briat and colleagues write the comparison as annihilation, , an event that lowers both counts by one and so preserves their difference (Equation 1, p. 19). Eq. (90) holds there too, but annihilation conserves no separate totals.
At steady state the free reference is §34's rectifier, with an effective constant that includes removal. The complex balance at a steady state of eq. (89) gives with , because removal empties the complex as unbinding does. When is small against the totals, eq. (80) applied with gives : the actuator runs only while the reference total exceeds the sensor total. A small alone is not enough. At , and , the steady state has while , because (exact). Using the equilibrium constant along a transient also needs binding fast against complex removal. The memory identity (90) needs neither approximation, and the zero steady error comes from it, not from the sharpness of the corner.
Three conditions belong next to that claim: the loop must settle, a reversible complex must be removed, and the free controller species must not be. Take settling first. Eq. (91) holds at a steady state, and the difference balance says nothing about whether the loop reaches one. "If it settles" is a stability condition on the full closed loop, as everywhere in this chapter. Briat and colleagues prove settling, in the stochastic sense of ergodicity, for unimolecular networks whose open loop is stable and output controllable and whose set point is accessible (Theorem 2, p. 21). They also note that the deterministic counterpart can oscillate in an instability region (p. 24).
A reversible complex must be removed, or the loop has no steady state. Without complex removal nothing removes the reference, so grows as . The complex then grows as too, and the free sensor must grow with it to keep binding balanced against unbinding. With its growth rate is , which the sensor's production must supply on top of . The output therefore settles at an offset instead of the set point,
which is 4.0976 at and 4.0331 at with and the other constants above (exact for this ramp, and numerical). The plant's removal rate now sets the output, so adaptation is lost. Irreversible binding into an inert complex, , needs no removal, because the complex never returns its partners. Annihilation is that case.
Removing the complex does not leak the memory, but removing the free controller species does. The cancellation in eq. (90) is a cancellation of equal event fluxes: each binding, unbinding or complex-removal event changes the two free species, or the two totals, by the same amount. Equal first-order removal of the free species is not such a flux. Diluting free and at gives , a leaky integrator, and the set point acquires an offset: the output falls from 4.000 to 3.925 at and to 3.358 at 0.1 (numerical). As in §27, the removal rule is part of the model, and here equal dilution of the two free species is enough to make the memory leak.
A living cell dilutes its controller, so its adaptation is near-perfect rather than exact. Aoki and colleagues built the motif in E. coli from the σ factor SigW and its anti-σ factor RsiW. They note that the theory assumes unsaturated production and negligible degradation of the two controller proteins, that living cells satisfy neither, and that simulations with realistic parameters gave small errors (p. 535).30 In eq. (90) that is the leak term.
Lecture 10 takes this question up systematically. It develops the internal model principle, the conditions for robust perfect adaptation, chemotaxis and the comparison with the feedforward designs of Part 5. This section supplies only the two identities, eq. (87) for static rejection and eq. (90) for stored memory, and the distinction between them.
Separate three quantities: the static steepness h, which divides a small disturbance by ; a stored difference, whose rate of change is the error and which drives the error to zero through eq. (90); and the stability of the closed loop, which neither of them establishes. Keep a reversible complex removed and the free controller species unremoved, or the memory fails.
References
- Q. Liu, X. Ren and F. Xiao, “Evaluating valid parameter regimes for biocircuits,” bioRxiv 2026.01.19.700491 (2026), preprint. §3.1 and Eq. 12: the validity condition of the Michaelis-Menten law, free substrate winning its own total. bioRxiv
- F. Xiao, J. P. Marken, J. Yan and D. Cappelletti, Supplementary Information for: Universal polyhedral geometry governs the behavior of biomolecular reaction systems, unpublished author manuscript, snapshot of 21 September 2026. §20.1, pp. 317 to 326: an induced activator and an induced repressor matched to one Hill curve, the matching as a calibration choice, and a sweep of the regulator total. Cited as an unpublished manuscript.
- F. Xiao, Biocontrol of biomolecular systems: polyhedral constraints on binding’s regulation of catalysis from biocircuits to metabolism, PhD thesis, California Institute of Technology (2022). Printed p. 113, Eq. 3.45 and the paragraph after it: an activating regulator acts through a complex, whose order in the regulator total stays between 0 and 1, while a repressing regulator acts through a free species that can become hypersensitive under tight binding. Cited as unpublished.
- M. A. Savageau, “Design of molecular control mechanisms and the demand for gene expression,” Proceedings of the National Academy of Sciences USA 74, 5647–5651 (1977). p. 5647: in a controlled comparison of otherwise identical systems, the only inherent difference between activator and repressor control is the response to regulatory mutations. publisher
- R. C. Brewster, F. M. Weinert, H. G. Garcia, D. Song, M. Rydenfelt and R. Phillips, “The transcription factor titration effect dictates level of gene expression,” Cell 156, 1312–1323 (2014). Fig. 4 and its caption, p. 1316: the fold-change is near 1 while the repressor copy number is below the gene copy number. publisher
- N. E. Buchler and M. Louis, “Molecular titration and ultrasensitivity in regulatory networks,” Journal of Molecular Biology 384, 1106–1119 (2008). pp. 1106 to 1110: titration as a sink, the threshold where two totals match, the sharpness set by the ratio of the titrant total to , and the in vivo threshold where two synthesis rates match. publisher
- A. Goldbeter and D. E. Koshland Jr., “An amplified sensitivity arising from covalent modification in biological systems,” Proceedings of the National Academy of Sciences USA 78, 6840–6844 (1981). p. 6840: amplification when one or more converter enzymes work in the zero-order region. pp. 6841 to 6842: Eqs. 7 to 10 and the remark on enzyme ratios of 0.1 or less. publisher
- S. H. Ha and J. E. Ferrell Jr., “Thresholds and ultrasensitivity from negative cooperativity,” Science 352, 990–993 (2016), with Supplementary Materials. p. 990: the receptor models and the excess-ligand assumption. p. 991: the limit near 8.04, the singly bound state as a stoichiometric buffer, and the receptor held at 1000 nM. p. 993: the biphasic response at a receptor-to-ligand ratio of 1:2. Supplement, Table S1: the inferred cooperativity. publisher
- N. E. Buchler and F. R. Cross, “Protein sequestration generates a flexible ultrasensitive response in a genetic network,” Molecular Systems Biology 5, 272 (2009). p. 1: apparent Hill coefficients up to 12, with threshold and steepness set by the inhibitor’s abundance. publisher
- T. S. Gardner, C. R. Cantor and J. J. Collins, “Construction of a genetic toggle switch in Escherichia coli,” Nature 403, 339–342 (2000). Box 1, p. 339: the model, and the statement that the nullclines intersect three times because of their sigmoidal shape. publisher
- J. L. Cherry and F. R. Adler, “How to make a biological switch,” Journal of Theoretical Biology 203, 117–133 (2000). p. 123, Proposition 1.1: the condition on the product of the two repression laws’ largest log-slopes. pp. 127 to 128: depletion of free repressor as a route that needs no cooperative binding, with more than one operator copy per cell, a small enough dissociation constant, and equal decay of free and bound repressor. publisher
- R. Zhu, J. M. del Rio-Salgado, J. Garcia-Ojalvo and M. B. Elowitz, “Synthetic multistability in mammalian cells,” Science 375, eabg9765 (2022), with Supplementary Materials. p. 1 of 11: seven states held for more than 18 days. p. 6 of 11, Box 1: the model and removal of every species regardless of its dimerization state. p. 9 of 11: a maximum of 256 attractors at N = 9, and the declining share of active homodimers. Supplement, p. 8: the dimerization equilibria with the statistical factor 2. Supplement, p. 19: multistability even at n = 1. publisher
- R. Du, M. J. Flynn, K. Mahe, M. Honsa, B. Gu, D. Li, S. E. McGeary, V. Gradinaru, R. Jungmann and M. B. Elowitz, “miRNA modules for precise, tunable control of gene expression,” bioRxiv 2024.03.12.583048, version 5 (2025), preprint, and the Molecular Cell version (2026), Data S1, pp. 14 to 16: the non-dimensionalization, the dimensionless catalytic rate, the constant K once complex removal is included, and the approximate compensation window. publisher
- L. Bleris, Z. Xie, D. Glass, A. Adadey, E. Sontag and Y. Benenson, “Synthetic incoherent feedforward circuits show adaptation to the amount of their genetic template,” Molecular Systems Biology 7, 519 (2011). Abstract and p. 7: the measured loops adapt. p. 5: the model’s predicted loss of adaptation at high copy number from saturation of the RNA-induced silencing complex. publisher
- T. H. Segall-Shapiro, E. D. Sontag and C. A. Voigt, “Engineered promoters enable constant gene expression at any copy number in bacteria,” Nature Biotechnology 36, 352–358 (2018), with the revised Supplementary Information. pp. 353 to 354: monomeric TALE repressors and nearly constant expression from 3 to 100 copies per cell. Supplement, Note 1, pp. 3 to 5: the assumptions of repressor excess over the promoters and over , and Eq. 19 for the strength-error trade. publisher
- L. Goentoro, O. Shoval, M. W. Kirschner and U. Alon, “The incoherent feedforward loop can provide fold-change detection in gene regulation,” Molecular Cell 36, 894–899 (2009). p. 897: the requirement , at a small fraction of the promoter’s maximal strength. publisher
- M. B. Elowitz and S. Leibler, “A synthetic oscillatory network of transcriptional regulators,” Nature 403, 335–338 (2000). p. 335: the conditions that favour oscillation. Box 1, p. 337: the model, its parameters, the stability condition, and the two operator sites used to obtain cooperativity. p. 336: the measured period of around 150 minutes. publisher
- L. Potvin-Trottier, N. D. Lord, G. Vinnicombe and J. Paulsson, “Synchronous long-term oscillations in a synthetic gene circuit,” Nature 538, 514–517 (2016), with Supplementary Information. Extended Data Fig. 4d and its legend: at Hill coefficient 1 the stochastic model oscillates while the deterministic equations damp. Supplementary Information 4.1, p. 12: the minimal Hill model. Supplementary Information 4.3, p. 17: equal dilution of repressor and binding sites as key to effective titration. publisher
- S. Clamons and R. M. Murray, “Modeling dynamic transcriptional circuits with CRISPRi,” bioRxiv 225318 (2017), preprint, version posted 11 February 2022. p. 4: global dilution of all components. pp. 4 to 6: the replication and unbinding step, printed differently in the text and in the reaction list. p. 9: the first-order assumptions and the idealized equations. p. 10: the definitions of the production and dilution rates. pp. 11 to 12: the loss-of-stability condition, and that cooperativity is not necessary. bioRxiv
- A. Loinger and O. Biham, “Stochastic simulations of the repressilator circuit,” Physical Review E 76, 051917 (2007). Read as the arXiv preprint 0710.1421, Sec. III A. p. 6: the rate equations with an explicit bound repressor, their single steady state stable for any choice of the parameters, and cell division as an effective degradation of bound transcription factors. p. 7: oscillations once bound repressor degrades, and an oscillatory range that shrinks to zero as that rate goes to zero. p. 19, Fig. 2: the parameters and the period of about 2260 s. publisher
- S. Müller, J. Hofbauer, L. Endler, C. Flamm, S. Widder and P. Schuster, “A generalized model of the repressilator,” Journal of Mathematical Biology 53, 905–937 (2006). Read as the author preprint. p. 3: only free proteins are degraded. p. 29: the central equilibrium is stable for Hill coefficients below 4/3 at zero leak and three genes. publisher
- A. D. Riggs, S. Bourgeois and M. Cohn, “The lac repressor-operator interaction. III. Kinetic studies,” Journal of Molecular Biology 53, 401–417 (1970). p. 402: the equilibrium constant close to in the authors’ standard buffer, and its sensitivity to ionic strength. publisher
- H. Fu, F. Xiao and S. Jun, “Bacterial replication initiation as precision control by protein counting,” PRX Life 1, 013011 (2023). pp. 013011-2 to 013011-3: about 300 high-affinity chromosomal DnaA boxes with dissociation constants near 1 nM, acting as a titration pool. publisher
- A. Santos-Moreno, E. Tasiudi, J. Stelling and Y. Schaerli, “Multistable and dynamic CRISPRi-based synthetic circuits,” Nature Communications 11, 2746 (2020). p. 6, Fig. 5: a three-node CRISPRi ring in E. coli oscillating with a period of 10 to 12 hours. publisher
- F. Xiao, J. P. Marken, J. Yan and D. Cappelletti, Universal polyhedral geometry governs the behavior of biomolecular reaction systems, unpublished manuscript, draft of 28 August 2026. The subsection on unique response behaviors from logically equivalent gene regulatory networks: the repressor architecture reaches arbitrarily large reaction order in the signal total, the activator architectures stay at most linear, and the distinctions vanish under the Michaelis-Menten assumptions. Cited as an unpublished manuscript.
- J. P. Marken, F. Xiao and R. M. Murray, “A geometric and structural approach to the analysis and design of biological circuit dynamics,” bioRxiv 2020.02.18.953620 (2020), preprint. p. 8: regime consistency conditions, which decide whether a regime’s fixed point lies inside the regime it came from. §4, p. 12 and Fig. 4: structural oscillation when each regime’s fixed point points into the next, with the conditions and for their repressilator model. pp. 13 to 14: the two parameter conditions and the remaining regimes. p. 15: the stated limits of the approach. bioRxiv
- H. S. Black, “Stabilized feedback amplifiers,” Bell System Technical Journal 13, 1–18 (1934). p. 5: signal, noise and modulation in the output are divided by , with feedback negative when that factor reduces them. p. 6, Eqs. 5 and 6: the closed-loop gain and the reduction of its relative variations by the same factor. publisher
- M. Khammash, “An engineering viewpoint on biological robustness,” BMC Biology 14, 22 (2016). p. 5, Fig. 2 caption: the sensitivities of a negatively autoregulated gene's steady state to its expression and degradation rates, about for Hill coefficient n. p. 7: integral feedback as infinite gain at zero frequency, and perfect adaptation to constant disturbances. publisher
- C. Briat, A. Gupta and M. Khammash, “Antithetic integral feedback ensures robust perfect adaptation in noisy biomolecular networks,” Cell Systems 2, 15–26 (2016). p. 19, Equation 1: the controller reactions, with made at rate , made in proportion to the regulated species, and an annihilation that lowers both counts by one and so preserves their difference. p. 21, Theorem 2: ergodicity and set-point tracking for unimolecular networks whose open loop is stable and output controllable and whose set point is accessible. p. 24: the deterministic counterpart oscillates in an instability region. publisher
- S. K. Aoki, G. Lillacci, A. Gupta, A. Baumschlager, D. Schweingruber and M. Khammash, “A universal biomolecular integral feedback controller for robust perfect adaptation,” Nature 570, 533–537 (2019). p. 535: the σ factor SigW and anti-σ factor RsiW of Bacillus subtilis as the two controller molecules in E. coli, and the statement that the theory's assumptions of unsaturated production and negligible controller degradation are not satisfied in living cells. publisher
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 box or a table cell names a reported measurement. None is a fit to data. The figure generator, the parameter records and the numbered checks are kept in the Lecture 9 research directory.