Constructing and analyzing a binding-catalysis model
Every derivation behind the core's three tools, and the five-step pipeline run on every example.
This chapter is the reader's companion to the core. The core states three tools: the binding-catalysis model, leading-order dominance, and regulation read from the regime map. Here every step behind them is shown, with units, proofs and worked answers. The aim is transfer. A reader who finishes should be able to take an unfamiliar complex, write its four lines, map its regimes and read its responses.
The chapter follows the core's four parts. Part 1 makes the core's two observations exact. Part 2 builds the model and proves that its binding layer has one solution. Part 3 turns dominance into a procedure and runs it on one binding pair. Part 4 justifies the core's five-step pipeline and then runs it on every regulatory example, each ending in a regime-sequence table. An optional part runs the pipeline on further mechanisms. The lineage traces where these ideas came from.
"Core §N" always means a section of the core. A bare §N means a section of this page. Concentrations are pure numbers in one canonical unit, , as in core §4, so no bar or reference concentration is carried. A regime is named by its winner tuple, never by a letter. Every curve is computed from stated illustrative parameters. None is a measurement.
How this page follows the core
| Core section | What the core states | Where this page derives it |
|---|---|---|
| §1 | the model-class question | the lineage |
| §2 | binding moves constituents, catalysis changes totals | §1 |
| §3 | separated clocks put binding at equilibrium | §2 |
| §4 | the four-line model | §3, with every matrix of an enzyme in §9 |
| §5 | the counting matrix and its graph | §4 |
| §6 | one constant per complex, and one allocation | §5 to §9, with the uniqueness proof in §6 |
| §7 | select, solve, check | §11 |
| §8 | one pair: three sectors and a ray | §10 and §12 to §14 |
| §9 | the five-step pipeline | §15 and §16 |
| §10 | four responses along two paths | §17 to §19 |
| §11 | a competitor adds a candidate | §20 |
| §12 | joint states decide combination | §21 and §22 |
| Coda | close the dynamics | §23 to §25 |
| A1 | the winner sets the Hill degree | §26 |
| A2 | a sponge shifts the input | §27 |
| A3 | one extra state makes a window | §28 to §30 |
| beyond the core | series binding, modification cycles, transfer | §31 to §33 |
A model class for biology
Core §2 and §3 narrow the class of cell models with two observations. This part makes both exact: binding conserves every total, and binding settles on a clock of its own.
1An intervention changes a total, and binding only moves it between species
Begin with the intervention to be predicted. Supplying a protein changes its total concentration across all the forms that contain it. A reporter may respond to the free form, while a catalytic assay measures a flux from a complex. So the model's coordinates must connect the total that is controlled with the species that is read. Core §2 sorts every step by what it changes. This section makes that sorting exact for the smallest case.
The notation follows the core. A bare letter such as E or S is a free concentration. A named complex is written . The total of the enzyme constituent is , the sum over every species that contains the enzyme. A homodimer contributes two units to its monomer's total, and a ternary complex contributes to all three totals it contains.
Units come next. A dissociation constant of a one-to-one pair is a concentration. An association rate constant such as has units . A dissociation rate constant and a unimolecular conversion have units . Each rate law, a rate constant times the right concentrations, then has units of concentration per time. Fixing the canonical unit of core §4 turns every concentration into a pure number, so logarithms are defined and logarithmic derivatives are dimensionless.
One binding pair shows the accounting. Order the species as . The association has the stoichiometric column , the change in each species per event. The counting matrix L records how many copies of each constituent each species holds:
The product says that one association event moves one enzyme and one substrate constituent into the complex and changes neither total. Dissociation flips the sign of the column and leaves the conclusion unchanged. Neither statement needs equilibrium, so the cancellation holds during a binding transient too.
Scroll inside the figure to see it at reading size.
The same cancellation holds for any model. Write the species rate equation as , as in core §4. Here and are the binding and catalytic fluxes, and collects boundary processes such as supply, export and dilution. Any constant L with removes the binding fluxes:
Uniform dilution at rate λ is one such boundary process. It removes every species in proportion, so it contributes to b and to the totals.
The rows of L must be complete. They must include every independent total that fast binding conserves, or the totals cannot label the binding state. Elemental mass alone can be too coarse. Substrate and product forms are separately conserved by fast binding, even though slow catalysis converts one into the other. Conversely, a total need not be conserved by the whole model to be a useful slow coordinate. It only has to be conserved by binding.
Name the controlled total, the molecular readout and the units first, and then check that binding leaves every total unchanged.
2Affinity fixes where binding settles, not how fast
An equilibrium constant says where binding settles. It says nothing about how quickly binding gets there. This section separates the two, because core §3 needs both: equilibrium to write the binding layer algebraically, and a fast clock to justify doing so.
Equilibrium comes first. For an isolated elementary pair the net association flux is . Setting it to zero gives the binding relation, with the dissociation constant as the ratio of the two rate constants:
In a binding network with several reversible steps, every step balances at once, which is Lecture 7's detailed balance.
A catalytic escape changes the relation. For a substrate complex that also turns over at , the complex obeys . Setting this derivative to zero gives with , Briggs and Haldane's constant.1 A small derivative and an equilibrium ratio are different assumptions. They agree when , the condition stated in the note that closes core §6.
Fast exchange need not mean equilibrium either. A strongly connected state graph with a driven cycle has a unique stationary distribution and nonzero currents around the cycle. Gunawardena's linear framework eliminates such a graph without detailed balance.2 Lecture 7's compatibility audit decides which subgraph may be replaced by equilibrium weights, and core §3 assigns every driven step to catalysis.
Speed is a separate calculation. For one pair at fixed totals, substituting and gives one equation for the complex:
Linearizing around the physical root gives the relaxation frequency , evaluated at that root. So the local binding time is
Multiplying and by one common factor changes and leaves , L and the equilibrium untouched. The lecturer's thesis writes the binding time of a complex as . That is this expression when free enzyme is scarce, with added when the complex also turns over.3
Scroll inside the figure to see it at reading size.
A fast clock is not automatic. The same thesis estimates that an association constant near with a 10 nM partner gives an association frequency of only about .3 The physical reason for the usual separation is chemical. Binding makes and breaks weak bonds and relaxes fast, while catalysis rearranges covalent bonds and is slower.4 In metabolism, binding equilibrates within milliseconds to seconds, while metabolite levels change over tens of seconds.5
So compare the relaxation time with the clocks of the experiment. In a network with many complexes, use the slowest binding mode at fixed totals, not one chosen association rate. The reduction needs that mode to stay fast over every state the experiment visits. A start away from equilibrium adds a brief initial transient.
The reduced model describes the state after that transient. It still lets the complex change, because the equilibrium allocation follows the totals, (§7). At a finite binding speed, a small departure from equilibrium supplies the binding flux that this motion needs. The equilibrium equation therefore does not claim that the complex has stopped changing.
Check the binding relaxation against the experiment's slow clocks, separately from computing where binding settles.
Tool 1: the binding-catalysis model
Core §§4 to 6 write the model in four lines and state that its binding layer has one solution. This part derives the four lines, builds each matrix, proves the uniqueness and computes the solution.
3Projecting the rate equation onto the totals gives four lines
The four lines of core §4 come from one projection and one closure. The projection is exact. The closure is the fast-equilibrium approximation of §2. This section derives both and fixes every dimension.
Start with the sizes. Let n be the number of species, d the number of independent totals, m the number of catalytic steps and p the number of external fluxes. Then the concentrations are and the totals . The counting matrix is , the catalytic stoichiometry on species is , and the activity matrix is .
The projection multiplies the species equation of §1 by L. Binding drops out, and what remains is catalysis and exchange on the totals:
Here v is the vector of catalytic fluxes, and says how each catalytic step changes each total. The external fluxes are supply, export and dilution, and says which totals each one changes. Writing exchange as a separate stoichiometric term follows the lecturer's metabolic work.5 This line is exact. It holds whether or not binding is at equilibrium.
The activity line reads each catalytic flux from the species that performs it. Row j of holds the catalytic constant of step j in the column of its enzyme state, so . The entries are frequencies, so v has units of concentration per time. For a resolved first-order catalytic step this law is exact. For a composite production process, such as transcription from a promoter state, one frequency per state is an assumption. A time-resolved question may need more internal states.
The closure replaces binding dynamics by binding equilibrium. It adds one logarithmic relation per complex, collected as , where N has rows and k holds the equilibrium constants (§5). With the conservation line, the model is
The lecturer's flux-species sampling paper writes the same four lines, without the external term.6 Conservation and accumulation are exact accounting. Equilibrium is the closure, and activity is exact only for resolved first-order steps.
Scroll inside the figure to see it at reading size.
A model has five species, three totals and two catalytic steps. Find the size of L, N, , S and . Why does carry units of inverse time while S is a pure count?
Worked answer
L is 3×5 and N is 2×5, since . is 5×2, S is 3×2 and is 2×5. The product maps five concentrations to two fluxes and then to three rates of change. Each entry of S counts a change per event. Each entry of sets how often one molecule of the acting state performs the event.
Project the species equation with L to get the accumulation line, and keep track of which of the four lines is exact accounting and which is the fast-equilibrium closure.
4The complex list fixes the counting matrix
The first line needs L, and L is fixed by the complex list. This section builds L column by column, as core §5 does, and adds the rank condition that makes it complete.
Order the species with the d free atomic species first and the r other species after them, so . "Atomic" means a reference constituent of the binding model, such as an enzyme, a substrate or a protein monomer. It need not be a chemical element. The entry counts the copies of atomic species i in species j, so
Here are the free atomic species, the other species, and their compositions.3 A complex contributes once to each of two totals. A dimer contributes twice to the monomer total. An isomer contributes once to the enzyme total, exactly as E does.
The same matrix is a graph. Draw one square per total and one circle per species, and join total i to species j by an edge of weight when it is positive. This bipartite composition graph has L as its bi-adjacency matrix.7 Its edges mean "contains". They prescribe no assembly pathway.
Scroll inside the figure to see it at reading size.
Two definitions name what L may contain. The thesis calls L isomer-atomic when it has the identity block, nonnegative integer entries and no zero column. Repeated columns are then allowed.3 The author manuscript calls L faithful-atomic when its columns are also distinct.7 Repeated columns are what let two conformations carry the same material and still differ in activity. These are definitions of the present formulation, not terms from the original enzyme papers.
L must also be complete. If holds the binding columns, require
The first condition says that binding conserves every row. The second says that the rows capture every conservation law of binding. Counting elemental mass alone can miss an independent protein-form total, and a missing total leaves the allocation underdetermined.
Build L column by column from each complex's composition, keep multiplicities and distinct conformations, and check that its rows span every conservation law of binding.
5Equilibrium needs one constant per complex
Composition fixes the form of the equilibrium equations, and one constant per complex fixes the allocation. This section derives the monomials of core §6, their units, and the rule for changing the basis of N.
At equilibrium each non-free species is a monomial in the free atomic species. Its exponents are its composition column, and its coefficient is its association constant :
One constant suffices because equilibrium is path independent (Lecture 7). Every assembly route reaches the same weight, so the product of step constants along any route is the same .
The units follow from the count. Let be the number of constituents in species j. Then has units of concentration to the power . A binary complex has and , with a concentration. A three-constituent complex has a constant in inverse concentration squared. An isomer ratio is dimensionless. In the canonical unit each becomes a pure number, and these units say how it rescales if the unit changes. A catalytic is a different, kinetic quantity (§2), not another name for .
Taking logarithms turns the monomials into linear equations. Collect them in the association-affinity matrix :
Row j subtracts the logarithms of the constituents of species j and adds the logarithm of the species. The matrices L and have ranks d and r, which sum to n, and . Such a pair is a Gale pair, also called a pair of dual configurations.3 L counts what binding preserves. N states how equilibrium shares it out.
Any full-rank N with describes the same states, provided its constants transform with it. Split into its first d columns and its last r. Orthogonality gives , and full rank makes the square block invertible. So
The equilibrium set is unchanged by this change of basis. Changing N while keeping fixed would change the physical model.
For , the association row is with . Reversing it gives the dissociation row with . Both equations say . The thesis writes N in the dissociation direction, so its N and carry the opposite sign.3
Take the promoter of core A3. A regulator R binds gene G twice in sequence, and , with stepwise dissociation constants and . In the order , counting gives
The second constant has units of inverse concentration squared, because holds three constituents. The pathway basis instead uses the two binary steps. Its matrix and constants are
The second row subtracts the weight of the binary complex from that of the ternary one. Exponentiating it gives . A canonical row states an equilibrium relation. It does not assert a simultaneous three-molecule encounter.
The economy of the equilibrium model is now precise. The complex list, the compositions and one constant per complex fix the allocation. A kinetic model would also need the binding pathways and their rates, so the same equilibrium can carry different transients (§2).
Write one monomial per complex from its composition column, and transform the constants together with N whenever the basis changes.
6A strictly convex potential makes the allocation unique
To use the totals as the state, every positive total must have exactly one positive allocation. Core §6 states this. This section proves it in two parts: uniqueness from strict convexity, and existence from a lower bound on the same potential.
Set up the hypotheses. The d free atomic species are present, so , and every other column has nonnegative counts. Every concentration is a pure number in the canonical unit. Extend the association constants to the free columns by . Then equilibrium and conservation read
where is column j of L and z holds the logarithms of the free atomic species.
Define the potential
Its gradient is , the conservation residual, so a stationary point is exactly an allocation with the right totals. Its Hessian is
Uniqueness follows from convexity. For any nonzero u the quadratic form is . The free columns contribute , so the form is strictly positive. A strictly convex function has at most one stationary point.
Existence follows from a lower bound. Dropping the nonnegative complex terms gives . For positive , each term is bounded below and grows without bound as . Along any unbounded sequence at least one term grows without bound, so Φ is coercive. It therefore attains its minimum at a finite z, and that minimum is the stationary point.
So every positive total has exactly one positive allocation. The invertible Hessian also makes the allocation a smooth function of the totals and constants (§7). Horn and Jackson's theory of balanced networks is the general setting for uniqueness within a conserved class.8 The lecturer's thesis proves the same statement another way: the map is a global change of coordinates.3
What this theorem covers
The identity block supplies both the strict convexity and the coercivity. Positive constants alone do not replace it. Repeated composition columns keep the proof intact, because they only add positive exponential terms. If a total is zero, every species that carries that constituent is zero. Remove those species and solve on the remaining positive face, since the logarithmic coordinates exclude zero.
The result selects one allocation in each class of totals. It says nothing about how fast binding relaxes, and nothing about steady states once production and removal are added. Those are statements about different equations, and Lecture 9 meets circuits with several steady states.
Prove uniqueness by strict convexity and existence by coercivity, and state separately what happens at zero totals and once slow dynamics are added.
7The allocation moves smoothly with the totals
The positive-definite Hessian of §6 does more than prove uniqueness. It gives the derivative of the allocation, which the gains of Part 3 and the Jacobian of §25 both need.
At fixed constants, differentiating the monomials gives , and so with
M is positive definite by §6, so dz can be solved for. The derivative of the allocation, and its logarithmic form H, are then
Check the dimensions. L is d×n and M is d×d, so both and H are n×d. The first maps a change of totals to a change of species. H maps a fractional change of totals to a fractional change of species. Its entries are the gains. At leading order they become the exponents of a regime's monomial laws (§11).
When the totals move, the allocation follows, . "Equilibrium" here names the fast state at the current totals, not a state in which nothing changes. If a constant also changes in time, add the derivative with respect to that constant.
Why the algebraic equations are locally nonsingular
The Jacobian of conservation and equilibrium with respect to x is the square matrix
Suppose . The second block gives , so for some w. The first block then gives . Positive definiteness forces , hence , and is invertible.
So one differentiation of the algebraic equations fixes the species derivative from the total derivative. This is the local index-one property of the model on the positive orthant. It says nothing about the speed of the kinetic binding layer.
Differentiate the allocation through , read the gains from H, and keep algebraic nonsingularity separate from kinetic speed.
8Newton's method in log coordinates computes the allocation
The convexity proof also gives an algorithm. Minimize Φ by Newton's method in the log coordinates z. Each species then stays positive by construction, and the Hessian M is the Newton matrix.
A reproducible Newton step
At a trial z, compute , the residual and . Solve . Try with , and halve α until Φ decreases. Stop only when the scaled residual meets the requested tolerance.
Very small positive totals make that relative test demanding. When the task has a detection floor, add an explicit absolute tolerance. Never accept a small step as evidence that every total balances.
A multivalent example checks the method. Take three atomic species A, B and D, and three complexes , and . Illustrative constants give the monomials
and illustrative totals for A, B and D. Every total counts its complexes with their copy numbers, so . The verified implementation compares its matrix of gains against centered finite differences in log coordinates. The largest discrepancy is . Independent scalar solutions check the competitive and series-binding states of §20 and §31.
A fast driven cycle needs a different solver. Solve the normalized stationary linear equations of its state graph and keep the currents. Strong connectivity can give a unique stationary state without detailed balance.2 The extension shows how such a model can still contain subgraphs that do satisfy the equilibrium assumptions.
Solve in log free concentrations, damp the Newton step, and report a conservation residual scaled to the task.
9The reversible enzyme, matrix by matrix
Core §6 writes the reversible enzyme as a complete model. This section builds every matrix explicitly, so that the pattern can be copied for a new system.
Order the five species as . The two binding pairs and the catalytic step are elementary, so each arrow carries its rate constants:
Here and are the forward and reverse catalytic constants. The dissociation constants are and .
Scroll inside the figure to see it at reading size.
Conservation and equilibrium come first. The counting matrix has one row per total, and the association rows follow from its complex block:
The first row of the equilibrium line reads . Exponentiating gives , a relation between concentrations in the canonical unit.
Activity and accumulation come next. The catalytic columns change only the two complexes, and projecting them with L gives S:
The columns of and S, and the rows of , follow the flux order , forward then reverse. Supply and free-product export are composite boundary processes, and . Their rate laws are and , so
Uniform dilution would add . The accumulation line then reads, component by component,
The binding layer reduces to one equation in free enzyme. Each free ligand follows from its total, and , and the enzyme total then reads
The left side increases strictly from zero at to at least at , so exactly one root is physical. This is the scalar form of the uniqueness of §6.
Does catalysis conserve the substrate total? Does it conserve the sum of the substrate and product totals?
Worked answer
One forward event changes by , so the substrate total is not conserved. The sum is conserved by both catalytic steps, as the columns of S show. Supply and export change the sum. Binding conserves each total separately, which is why both are coordinates of the model.
Write every matrix of a new model explicitly, then check each catalytic column against the totals it should change.
Tool 2: leading-order dominance
Core §7 states the method and core §8 runs it on one pair. This part solves the pair exactly, writes select, solve and check as equations, bounds the error of every leading-order law, and resolves the singular ray that the leading order leaves open.
10One pair has one physical root
Every leading-order law in this part is checked against the exact equilibrium of one pair. This section computes that reference and shows how to evaluate it without losing digits. It is the calculation behind the optional box of core §8.
Substitution gives one quadratic. With and , the binding relation becomes
Its discriminant is positive, because it can be written as a sum of squares and positive terms:
Exactly one root is physical. Call the left side , and let . Then , while , because . So the smaller root lies strictly between zero and the smaller total, and the larger root lies beyond it. Only the smaller root leaves both free species positive.
Rationalizing the smaller root avoids cancellation. The textbook form subtracts two nearly equal numbers when binding is weak. Multiplying by the conjugate gives the form the core uses:
Near complete sequestration the free enzyme needs its own formula. There is again a difference of nearly equal numbers. Eliminating the complex instead gives a quadratic for E itself, with :
Use when , and when . The two expressions are algebraically equal. Each avoids cancellation on its own side of , so together they are accurate everywhere.
Any computed root should pass two checks before it is used. Both totals must be recovered, and must equal one to the working precision. The companion figures and the verifier of this chapter apply both checks to every exact curve they draw.
Scroll inside the figure to see it at reading size.
Evaluate the physical root in a cancellation-free form, and confirm both totals and the binding relation before trusting it.
11Select, solve, check: dominance as a procedure
Core §7 states dominance in three steps: select a winner for each total, solve for monomial laws, and check the discarded terms. This section writes each step as an equation, so that the method runs the same way in every hand. It then proves two facts that the core uses. A leading-order law errs by a bounded factor, and its exponents are the limits of the exact gains.
The method starts from an exact rewriting of each total. A total is a sum of positive terms, , where counts the copies of constituent i in species j. Choose one term as the winner of total i. The rest of the total, measured against the winner, is the residual fraction:
The second relation holds for every positive state, whichever winner is chosen. Leading order sets every to zero. The same comparison, normalized by the total, is the dominance profile of the flux-species sampling paper, .6 Row i of D holds the shares of total i, so its entries are nonnegative and sum to one. The winner's share is .
Selection has a graph test. On the bipartite composition graph a choice of winners is an orientation, and it is realizable exactly when the orientation is acyclic.7 Collect the winners' composition columns into the winner matrix , whose row i is . A regime is regular when is invertible. It is singular otherwise, as when one species wins two totals and its column appears twice.
Solving is linear algebra in log coordinates. At equilibrium every species is a monomial, , where z holds the logarithms of the free atomic species and is the association constant of species j (§6). Taking the logarithm of each winner's term gives d equations, one per total:
Here log acts on each entry, and collects the counts and constants of the winners. The equation is exact. Leading order drops , and a regular regime then has the unique solution . Every species becomes a monomial in the totals and the affinities:
The row vector holds the exponents of species j in the regime. On log axes each law is a straight line with these slopes, which is how saturation regimes appear in the geometric approach of Marken, Xiao and Murray.9 The exponents are rational, because has integer entries.
Checking turns each discarded term into an inequality. The regime holds where every discarded term is smaller than its total's winner, . Substituting the monomial laws makes each inequality linear in and the log affinities. So each regime occupies a polyhedron in log parameter space, and its inequalities are its consistency conditions.9 The regime-index paper runs the same loop over every choice of winners: enumerate, solve, substitute into the inequalities, and keep the consistent regimes.10
The exact equation also measures the error of every law. Subtracting the leading-order solution gives , and therefore
This identity is exact. Where each winner is the largest term of its total, , with the number of terms in total i. The error is then a bounded factor, fixed by the gains and the term counts and independent of the size of the totals. A positive gain makes the law an overestimate by at most from that total, and a negative gain an underestimate. Deep inside the region every vanishes, and the law becomes exact.
One pair shows the size of the bound. At the exact state has and , so the free species still win and the regime is . The complex has gains there, and both residual fractions equal 0.618. The law therefore overestimates the exact complex by , inside the bound .
The exact gains come from the same shares. Differentiating shows that the log change of a total is the share-weighted average of the log changes of its species:
When one share in a row is near one, the total moves with its winner.3 At equilibrium . Eliminating dz gives the gain matrix H of §7 in terms of the shares alone:
This agrees with from §7, because . Leading order replaces each row of D by the indicator of its winner. Then becomes , and H becomes , whose rows are the exponents . The exponents of a regime are the limits of the exact gains.
A singular regime needs one more equation. When a species j wins two totals i and k, its column appears twice in . Combine the two totals so that the shared winner cancels:
Every term on the right is a discarded term, so this balance survives at leading order. It holds exactly. For one pair the complex wins both totals, and the balance is . §13 solves it.
Scroll inside the figure to see it at reading size.
Run dominance as select, solve and check, and read the error of each leading-order law from the residual fractions and the gains.
12One pair has three sectors and a ray
Running the procedure on one pair produces the regime map of core §8. This section derives each check from its discarded fraction, locates the exact boundaries, and measures how far they sit from the leading-order rays.
Two exact ratios do all the checking. The binding relation gives
Within the enzyme total, the complex outweighs the free enzyme exactly when free substrate exceeds . Within the substrate total, the complex outweighs the free substrate exactly when free enzyme exceeds . Every check below is one of these two comparisons, evaluated with the regime's laws.
Take as the worked case. Select and . Solve: binding gives . Check: the discarded fractions are the residual fractions of §11, and . Both must be below one. So the regime needs and . That is two conditions, where a guess of "enzyme in excess" would supply only one.
| Regime | Select | Discarded fractions at leading order | Holds when |
|---|---|---|---|
| , | and | ||
| , | and | ||
| , | and | ||
| the ray |
The three regular regions share one corner. Their boundaries are the rays , and , all starting at . Together the three laws say that the complex is the smallest of three candidates, , which is the form in the lecturer's thesis.3 The thesis derives the same three regimes of the complex. The lecturer's paper with Khammash and Doyle reads them as the regimes of Michaelis-Menten kinetics, including the enzyme-excess regime, where the complex holds the substrate total, that a substrate-excess assumption misses.3, 4
The exact boundaries are curves, and each lies within a factor of two of the rays. The complex equals the free enzyme when , which gives . It equals the free substrate when , which gives . Take the first curve. Its leading-order counterpart is , and the ratio stays between 1/2 and 3/2. The second curve is its mirror image.
Between the two exact curves the complex outweighs both free species. At large totals this wedge runs from to , a band of constant width on log axes. At leading order it collapses onto the singular ray, which is why the ray has no area in totals. The regime-index paper gives the four regimes of one pair the shares 1/3, 1/3, 1/3 and 0 of log parameter space, while in free concentrations the singular regime is a full quadrant.10
The error of each law stays bounded up to its boundary. By §11 each free species errs by at most a factor of two in the regular regimes. The complex errs by at most a factor of two in and , and by at most four in , where both of its gains are one.
Scroll inside the figure to see it at reading size.
Derive each regime of a pair from its two discarded fractions, and read its map as leading-order rays, exact curves within a factor of two.
13On the singular ray a small free pool survives
On the singular ray the complex wins both totals, yet the free pools are not zero. Their size sets the depth of every titration switch in this chapter, from the tight cut of §17 to the sponge of §27. This section solves them exactly and bounds the error of the two usual approximations.
Ray coordinates reduce the problem to one quadratic. Let be the mean total and the imbalance. The complex cancels from the imbalance, so exactly. Let be the free sum. Then and , and becomes a quadratic in w. Its positive root gives both free pools:
These formulas are exact for every pair of totals, not only near the ray.
Leading order on the ray keeps the exact balance and approximates the complex. Replace by the mean total Q in the binding relation, and use . This gives the ray balance , so
At matched totals, , this is the core's . Away from matching, for , it approaches on the enzyme-excess side and the small tail on the substrate-excess side.
The ray has a width, and the width shrinks as binding tightens. The free pools cross over where . Relative to the totals that is , which vanishes as . So at leading order the singular regime is a ray.
Two bounds control the smaller free pool. Write and . The larger free pool is and the complex is , so binding gives
Dropping positive terms gives and, when , . The first bound holds everywhere and is sharp at matching. The second is sharper far from matching.
The tight limit is a rectifier, and its error is exactly the smaller pool. As the free enzyme tends to . The exact free enzyme exceeds this by , so the absolute error is at most . At the tight-cut ray of §17, with , the rectifier predicts no free enzyme, the ray balance predicts , and the exact value is .
The relative error depends on the readout. For the complex it is , which is small throughout. For the free enzyme below threshold the rectifier predicts zero, so its relative error is one, however tight the binding. A task that needs an output below a detection limit compares with that limit. A task that uses the free enzyme's activity needs the ray balance.
Scroll inside the figure to see it at reading size.
Near matching the free enzyme is also hypersensitive to the totals. §14 shows that its gains grow like on the ray, about 5 at . The lecturer's thesis derives the same hypersensitivity of the free enzyme near matched totals.3
Keep the exact difference of the totals on the singular ray, and judge any approximation there by its error on the output that the biology reads.
14The gains of the complex fill a triangle
A gain is a logarithmic derivative of a species with respect to a total. For the complex of one pair, its two gains are confined to a triangle whose corners are the three regular regimes. This section derives the triangle, shows that every interior point occurs, and places the two paths of §17 on it.
Implicit differentiation gives the gains. Differentiate at fixed , with and . This gives . Multiply each partial derivative by its total and divide by , using and :
The gain pair is a convex combination of three corners. Written as a vector,
The weights are positive and sum to one, so the pair lies strictly inside the triangle with corners , and . The lecturer's thesis derives the same convex combination.3
The corners are the three regular regimes. The corner is , where the complex is proportional to both totals. The corner is , where it follows the substrate total alone, and is . Dominance within W decides where the pair sits. It sits near when is the largest of the three weights, and near or when E or S is. When E and S tie far above , it sits at the midpoint of the hypotenuse, which is the singular ray.
Every interior point is attained. Given a point in the open triangle, set , and . These are positive free concentrations. The totals built from them, and , realize the point. So the open triangle is the full attainable set of the complex's gains.
The two paths of §17 trace two edges. The weak cut keeps , so the first gain stays near one while the path runs down the right edge, from to . The tight cut keeps , so the gains sum to nearly one while the path follows the hypotenuse, from through the ray to . At its ray point the exact gains are 0.525 each.
Scroll inside the figure to see it at reading size.
Free-species gains are not confined to the triangle. The same differentiation gives
On the ray, where , both have magnitude near . At the tight-cut ray point they are 5.52 and −4.99. This is the steepness of the titration switch, read as a gain.
Gains need not be integers. For a homodimer with and , the regime in which the dimer wins gives , a gain of one half. In general the exponents of §11 are rational, and a two-copy column puts a two in . The lecturer's thesis finds the same drop of the dimer's order.3 §26 runs the full dimer example.
Place the complex's two gains in the triangle whose corners are the regular regimes, and compute free-species gains separately, because they grow without bound near the ray.
Tool 3: regulation read from the regime map
Core §9 to §12 and the coda read responses off the regime map with a five-step pipeline. This part first gives the reason behind each step. It then runs the pipeline on every regulatory example of the core, and each run ends in a regime-sequence table.
15The five-step pipeline, with a reason for each step
Core §9 turns a regime map into a response in five steps. This section states the steps once more and proves that each one does what the core says. Every proof applies a fact from Part 3 to a path through the map.
- Model. Write the complex list, the binding relations and the activities. The output is .
- Experiment. Name the swept totals , the held totals and the readout. Hold the affinities b and the activities fixed. The response is the map
- Candidates. List the species that contain each total. Settle every total held in excess or in trace. The totals left over can change winner.
- Regime sequence. Walk the path. In each regime select the winners, solve for monomial laws and check the discarded terms (§11). The first check to fail is a breakpoint.
- Response. Join the pieces in a regime-sequence table: regime, input range, leading-order output and gain.
Five facts justify the steps. A sweep is a straight line in log coordinates. Excess and trace settle a total for the whole path. A regime holds on one interval of the path, and its first failing check ends it. A regular crossing joins the pieces, while a singular crossing makes a free species jump. Every piece holds within a bounded factor, and the exact curve checks it. The subsections take the facts in this order.
A sweep is a straight line in log coordinates
A sweep of one total moves log q along a straight line. Write the swept total as , with t the log of the sweep factor. Then , where is the unit vector of the swept total. Sweeping several totals in fixed proportion, as along a diagonal, gives another straight line.
Along such a line every leading-order law is a straight line on log axes. In a regime the law of species j is (§11). Substituting the path gives . The slope is the gain of species j on the input. A readout is, at leading order, its own largest term, so it is piecewise linear on log axes as well.
The affinities are held because they are parameters of the map, not coordinates of the path. They enter the checks through , so changing one moves the boundaries and changes which regimes a path meets. Which reduced laws count as valid therefore depends on which variables the experiment can tune.10
Excess and trace settle a total
Two counting bounds settle a total, and neither needs an affinity. The first bounds a ligand held in excess. Every complex that contains the ligand also contains a partner, so bound ligand cannot exceed the partner total. For one pair, , and therefore
A ligand far in excess of its partners wins its own total along the whole path, at every affinity.
Weak binding settles the same total by a second route. The reservoir law replaces free S by its total in the binding relation, which gives . Its relative error is exact:
To derive it, write . Replace by ES, with and . The right side collapses to . The bound follows from . So the substrate behaves as a reservoir whenever the enzyme total is small against either or .
The second bound concerns a species held in trace. A complex holding a promoter G cannot exceed the promoter total, . So , and when the complex never wins the regulator total. A trace promoter reads its regulator without loading it.
Settling is what keeps step 4 short. A settled total keeps one winner along the path and contributes no breakpoint. The walk then runs over the one or two totals that can change winner.
A regime holds on one interval, and its first failing check ends it
Each check is linear along the path. A check compares a discarded term with its total's winner, . The log of this ratio is affine in log q (§11), and so it is affine in t. An affine function changes sign at most once. The checks of a regime therefore hold on an intersection of half-lines, which is one interval of the path, possibly empty.
Two consequences follow. A regime appears at most once along a straight path. And it ends where its first check fails, because that is where one discarded term catches up with its winner.
The failing term names the successor. Swap it in as the new winner of its total, then select, solve and check again, because the new laws change every other comparison. If the swapped-in species already wins another total, it now wins two. Then repeats a column, and the crossing is singular. Past the singular ray the second total passes to its own next candidate.
A regular crossing joins the pieces
A regular crossing keeps the leading-order response continuous. Suppose only total i changes winner, from species to species j, and both winner matrices and are invertible. On the boundary the two terms are equal, . So the laws of the old regime also satisfy the new equation for total i, . The equations for the other totals are shared. The new regime's equations have exactly one solution, because is invertible. The two laws therefore agree on the boundary, and the pieces meet.
The gain changes at a regular crossing, and the change is a rational number. The gains are rows of , built from integer matrices. For one pair every gain is 1, 0 or −1 (§12), so the change is an integer. In general it is not. When the dimer takes the repressor total in core A1, free monomer passes from to , a gain change from 1 to 1/2 (§26). On log axes a regular crossing is a kink, and the response is graded.
A singular crossing makes a free species jump
A singular crossing changes two winners at once, and the free species that loses both totals jumps. On the tight cut of one pair, the enzyme total passes from E to and the substrate total from to S at the same point. Free enzyme follows before the ray and after it. At the two laws give and . The pieces miss each other by the factor .
The singular balance of §11 places the value in the gap. For one pair it reads , and §13 solved it: on the ray both free pools equal . That is the geometric mean of the one-sided limits and , so on log axes the ray value sits halfway down the jump. A singular crossing is a switch, and its size grows with .
Every piece holds within a bounded factor, and the exact curve checks it
Leading order is the answer because its error is bounded. The identity of §11, , holds exactly. Where the selected winners are the exact largest terms, each factor lies between 1 and the term count . The piece for species j is then within of the exact value, however large the totals are.
The bound weakens only near boundaries. For one pair the rule of §12 is leading-order rays, exact curves within a factor of two, so the loss is confined to a band of fixed width on log axes. Near a regular boundary the neighbouring regime's bound takes over. Near a singular ray the jumping species is not bounded by either side, and the balance of §13 replaces its monomial law.
The exact curve is the check. The monotone scalar solves of §8 and §10 give it at every point of a path. Each table below lists exact values at sample points beside the leading-order laws. A check that passes by a small margin is a warning sign. When the candidates of a total stay within a factor of two of one another across a whole regime, leading order can name a winner that the exact solve does not confirm, and §23 meets such a case.
Settle totals by excess and trace, end each regime at its first failing check, and read a regular crossing as a kink and a singular crossing as a jump. Trust each piece within its bounded factor, and check it against the exact curve.
16Activities fix the sign of a response
The binding layer says where each constituent sits. The activities of step 1 say what each place produces. The same allocation can therefore activate, repress or do nothing, depending only on the activities.
Take a machine with a free state E and a bound state , with activities and . Its output is
Per machine, the output is , with occupancy . Its derivative in θ is . So occupancy activates when , represses when , and changes nothing when the two agree.3 Affinity decides how θ follows the totals, and activity decides what a change in θ produces.
Several outputs collect into one matrix. Write each activity as , and collect the coefficients into , one row per process. A coefficient can be a resolved unimolecular rate constant. It can also be the effective activity of a state for a composite process, such as transcription with rate law . The mechanism decides which. If a co-substrate varies during the experiment, its level or its state must enter the model rather than hide inside a constant coefficient.
At leading order the activity of the winner sets the output. Where E wins the machine total, unless . Where wins, . A path that crosses from one regime to the other moves the output from one plateau to the other. The pieces of the regime tables below are these winner activities, multiplied by the monomial laws.
Scroll inside the figure to see it at reading size.
Assign an activity to every state before reading a response, and read the sign of the response from .
17Four responses along two paths
Core §10 runs the pipeline on one binding pair and reads four responses from one table. This section derives every entry of that table and places an exact value beside each law.
1 · Model. The pair of §10 to §14, with , and . Two activity assignments give two readouts: the complex active, read as , and the free enzyme active, read as .
2 · Experiment. Sweep at fixed and . Take two paths, the weak cut and the tight cut . They are the two dashed horizontal lines of Figure 8.
3 · Candidates. The weak cut settles the substrate total. There , so S wins along the whole path, and only the enzyme total can change winner. The tight cut settles nothing. Both totals keep two candidates each.
4 · Regime sequence. The weak cut starts in , with laws , and . Its check reads and fails first. Swapping in for the enzyme total gives , a regular crossing. Its laws are and , and its checks hold for all .
The tight cut starts in , with laws , and . The check reads and always holds. The check reads and fails at . Swapping in makes it win both totals, so the path crosses the singular ray . Past the ray the substrate total passes to S, and the path is in .
5 · Response. Dividing each law by gives the table. The exact column solves the pair at one sample point per regime.
| Path | Regime | Range of | Exact at a sample point | ||
|---|---|---|---|---|---|
| weak cut, | , gain 1 | 1, gain 0 | at : 0.0902 and 0.910 | ||
| 1, gain 0 | , gain −1 | at : 0.909 and 0.0910 | |||
| tight cut, | , gain 1 | 1, gain 0 | at : 0.490 and 0.510 | ||
| the ray, | about 1 | at : 0.905 and 0.0951 | |||
| 1, gain 0 | , gain −1 | at : 0.990 and 0.00981 |
The exact values sit where §15 says they should. Deep in a regime they approach the laws. At the weak cut's breakpoint , both pieces give 1 while the exact values are 0.499 and 0.501. That factor of two is the worst case, and it occurs at a boundary. On the tight cut the free-enzyme values at and are off by two for another reason: they are close to the ray, where the balance gives the better values and .
The table holds four archetypes. On the weak cut the complex saturates, which is the Michaelis-Menten shape at leading order, one edge of the triangle of §14.4 The free enzyme shows graded repression. On the tight cut the complex shows a limiting pool, and the free enzyme shows a titration switch. The lecturer's thesis finds it beside the three vertex regimes of a pair, as the extreme case where both totals are mostly bound and nearly equal, and there the regime is a ray (Eq. 3.45).3 The switch needs matched totals, so among all totals it occupies only a thin strip along the ray.6
Scroll inside the figure to see it at reading size.
Swapping the input gives the rising threshold, and it is a second run of the same five steps. Hold a sequestering total , sweep , and read free E. The path is a vertical line on the map of Figure 8. It runs from across the singular ray at into .
| Regime | Range of | Free E | Gain | Exact at a sample point |
|---|---|---|---|---|
| 1 | at : , law | |||
| the ray, | jump | at : | ||
| 1 | at : , law |
Free enzyme stays near until the sequestering pool fills, and then nearly every added enzyme is free. At leading order it jumps a hundredfold at . The two sample points beside the ray are again off by two, and the balance gives and there. This threshold of molecular titration needs no cooperativity.11 Bacteria use it to time replication. In the model of Fu, Xiao and Jun, about 300 chromosomal DnaA boxes bind the initiator DnaA with dissociation constants near 1 nM. About ten weaker sites at the origin, near 100 nM, trigger initiation only once the boxes are saturated.12
The low-occupancy end of the weak cut recovers Lecture 2's effective rate law. In , with the complex active at , the flux is . The coefficient has units . It is the second-order constant of the whole enzyme in this equilibrium reduction, and it holds only in .
Derive each entry of a regime table from its winners, and expect the exact value within a factor of two at a boundary and at the balance value on a singular ray.
18A reporter reads the switch
A titration switch becomes a measurable response when a reporter reads the free species. The pipeline shows where the reporter flips, and the exact inventory gives its midpoint and slope.
1 · Model. The pair of §17, read as an activator E and its sequestering partner S. A one-site reporter binds free E with dissociation constant , and its occupied fraction is
The second relation is the logit of θ. It is exact and shows that the reporter reads log E directly.11
2 · Experiment. Sweep the activator total at a fixed sequestering total , and read θ. The illustrative values are , and .
3 · Candidates. The reporter is held in trace, so its complex never wins the activator total (§15). The activator and sequestering totals can both change winner. The reporter's own total has two candidates, free and bound, which tie at .
4 · Regime sequence. The pair is tight, , so the path is the swapped run of §17. It runs through , crosses the singular ray at , and enters . Free E jumps from about to about there. The reporter's scale lies inside that jump, , so the reporter flips at the ray. The balance locates the flip: just past the ray S is small, , and half occupancy needs .
5 · Response.
| Regime | Range of | Free E | Reporter θ | Gain of θ | Exact at a sample point |
|---|---|---|---|---|---|
| , reporter free | 1 | at : 0.0099, law 0.005 | |||
| singular ray | from | rises from to 1, half at | switch | at : 0.237 | |
| , reporter bound | 1 | 0 | at : 0.834 |
The exact inventory refines the midpoint. Eliminating S with its total gives , so the activator total as a function of free E is
Half occupancy means . The logit relation makes the local Hill slope , the slope of the logit against , equal to the log gain of free E at that point:
With the illustrative values the midpoint is , close to the balance estimate , and the local Hill slope is 9.93. The steepness has a simple reading. When the bracket is near one, and . The reporter reads a small difference of two large totals, so its slope is the threshold divided by its own scale.
Two other slopes are easy to confuse with this one. The ordinary elasticity of θ is smaller by the factor , so it is half as large at the midpoint. And a Hill coefficient fitted to a whole noisy curve need not equal either local slope. One reporter site suffices because the nonlinearity sits upstream, in the finite pool. The yeast sequestration experiment of Buchler and Cross realized this mechanism, with fitted coefficients and experimental corrections distinct from this ideal calculation.13 In the lab below, "activator" is E and "inhibitor" is its sequestering partner S.
Choose the active state
Vary activator, inhibitor and affinity. Compare the free activator with the one-site reporter it drives.
The reporter is a trace probe with dissociation scale 1 µM, so its own binding does not deplete activator.
Place a reporter's scale inside a titration jump, locate its midpoint from the ray's balance, and compute the exact midpoint and local slope from the inventory written in free E.
19Effective laws are pieces of a regime sequence
The familiar effective laws of enzymology and gene regulation are pieces of regime sequences. Each piece holds in its own regime, and each regime has conditions that the effective law does not display. Three laws show this: the Michaelis-Menten law, the specificity constant and the Hill law.
The Michaelis-Menten law comes first. With a catalytic escape, the balance of the complex gives rather than (§2).1 The two agree when . The curve in free substrate, , has two pieces: where E wins the enzyme total, and where wins.
The specificity constant belongs to the first piece only. The slope of the curve at zero substrate is , with units . Writing the flux in the substrate total also needs the substrate to win its own total, which the reservoir bound of §15 controls.
A Hill law needs two regime conditions. The ligand must win its own total, which is the abundance assumption behind Hill laws in total input.3 And no partly occupied state may win the receptor total. Take n sites with stepwise dissociation constants , so that the state with k ligands has weight relative to the empty state. When only the empty and full states ever win, the full-state fraction has one corner, at , where its gain drops from n to 0. That two-piece sequence is the Hill law.
Independent equivalent sites break the second condition. Their weights are binomial, , so every state wins in turn. State k overtakes state at . The winners therefore step through all n+1 states between and , and the full-state fraction descends a staircase of gains.
| Mechanism | Winner of the receptor total | Range of R | Full-state fraction | Gain |
|---|---|---|---|---|
| only empty and full states win | empty | n | ||
| full | 1 | 0 | ||
| independent equivalent sites | the state with k ligands |
A Hill exponent therefore needs a mechanism in which the partly occupied states never win, or it must be declared an empirical fit. Selecting only the full state in the binomial sum gives , a different curve from the Hill function with the same n. The regime-index paper finds Hill laws for sequential binding fragile for exactly this reason.10
Before using an effective law, name the regime it is a piece of, and check that regime's conditions on the path of the experiment.
20A competitor adds a candidate for the enzyme total
Core §11 adds an inhibitor I that binds the enzyme as , and runs the pipeline with both ligands in excess. This section derives that run, then reruns the pipeline twice with step 3 changed. In the second run the enzyme titrates a tight inhibitor. In the third the inhibitor is a reservoir and the substrate is tight.
All three runs read one exact equation. The totals are , and , with and . Eliminating each ligand with its own total gives and , and so
The left side increases from 0 to above as E runs from 0 to . So the equation has one root in that interval, and bisection finds it. Only is active, .
Run 1: both ligands in excess
1 · Model. As above. 2 · Experiment. Sweep the substrate at fixed inhibitor levels, with both ligands far in excess of the enzyme. 3 · Candidates. Excess settles both ligand totals (§15): and . The enzyme total keeps three candidates, with and , where and . The winner is the largest of 1, s and i.
4 · Regime sequence. With the path starts in and crosses into at . With it starts in and crosses at . Each crossing is regular, because only the enzyme total changes winner. 5 · Response. Exactly, , so . The pieces keep the largest term of the denominator.
| Path | Regime | Range of s | Gain in s | Exact at a sample point | |
|---|---|---|---|---|---|
| s | 1 | at : 0.0833 | |||
| 1 | 0 | at : 0.901 | |||
| 1 | at : 0.0833 | ||||
| 1 | 0 | at : 0.901 |
The competitor moves the saturation corner without touching the substrate affinity. The exact response is half saturated at , so the apparent substrate constant is . Its initial slope in s falls by the same factor, from 1 to . Leading order keeps the larger term, . The boundaries separate leading-order laws. The exact response is smooth across all of them.
Scroll inside the figure to see it at reading size.
Run 2: the enzyme titrates a tight inhibitor
1 · Model. As above, with finite ligands. 2 · Experiment. Sweep at fixed and , and read . The illustrative values are those of core Figure 15: and .
3 · Candidates. The substrate is in excess, , so S wins its total. The enzyme and inhibitor totals can change winner. Name a regime by the winners of .
4 · Regime sequence. At low the path is in . The substrate complex wins the enzyme total because , and the tight inhibitor is almost all bound. The check reads and fails first. Swapping in makes it win both the enzyme and the inhibitor totals, so the path crosses a singular ray at . Past it the inhibitor total passes to free I, and the path is in .
5 · Response. In the last regime , and so .
| Regime | Range of | Gain in | Exact at a sample point | |
|---|---|---|---|---|
| 1, refined by the balance to | 0 | at : 0.421, refined 0.391 | ||
| singular ray | from : about 0.17 | switch | at : 0.156 | |
| −1 | at : 0.0130, law 0.0100 |
The balance explains the first row. Subtracting the inhibitor total from the enzyme total cancels : . Before the ray, free I is tiny, so the enzyme that the inhibitor leaves, , is shared between E and in the ratio . Each inhibitor takes one enzyme from the pool that substrate can reach. On the ray the balance and give , hence . The same titration by a tight inhibitor appears in the lecturer's thesis.3
Run 3: a reservoir inhibitor and a tight substrate
1 · Model. As above. 2 · Experiment. Sweep at fixed and , and read free E. The illustrative values are , , and .
3 · Candidates. The inhibitor is a reservoir: , so I wins its total. The inhibitor-bound and free enzyme then move together, with . Write for this pool. The enzyme total becomes , and becomes
So U and S form one pair with the effective constant . The competitor weakens the substrate's apparent affinity by the factor a, and a small alone no longer makes the pair tight.
4 · Regime sequence. The effective pair is tight, , so its path is a tight cut. Within the pool U the inhibitor complex outweighs free E by the factor , so is the winner where U wins. The path runs from across the effective pair's singular ray at into .
5 · Response.
| Regime | Range of | Free E | Gain | Exact at a sample point |
|---|---|---|---|---|
| , refined by the balance to | 0 | at : 0.0825, refined 0.0818 | ||
| singular ray | switch | at : 0.0091 | ||
| −1 | at : 0.000111, law 0.000100 |
The ray row comes from §13 applied to the effective pair. There the deficit of the complex is about , and it is shared by the pool U, of which free E is the fraction . Near the ray the matching must be avoided on the scale of the residual, not of the constant. With the gap , the smaller total and the missing complex δ, §13's balance reads . The rectifier laws and need both and .
Read every competition from one scalar equation. Settle each ligand total by excess, titration or reservoir first, and a reservoir competitor then scales the substrate's effective constant by .
21Joint states decide how regulators combine
Core §12 reads combined regulation as a regime map of joint promoter states. This section derives the weights and the exact outputs, runs the pipeline along both paths, and then restores finite regulators.
1 · Model. Free regulators and bind a promoter with total . The joint states are empty, bound by one regulator, bound by the other, and bound by both. Relative to the empty promoter their weights are
Here and are the dissociation constants of each regulator from the empty promoter, and the positive factor ω is the interaction of the two bound regulators. Independent binding has , and mutual exclusion removes the double state. Each state holds . Assign the states the activities , , and . Transcription is composite at this resolution, so its rate law is stated separately:
Thermodynamic models of transcription enumerate promoter states in the same way. Turning an occupancy into a transcription rate is a separate assumption. It needs each state's own initiation kinetics, not only the probability that a polymerase is bound.14
Scroll inside the figure to see it at reading size.
The first regulator binds the empty promoter with dissociation constant . What is its dissociation constant when the second regulator is already bound, if the double state has weight ?
Worked answer
The ratio of the double-state weight to the second-regulator weight is . So the conditional constant is , and the second regulator's is . Both assembly paths give the same double-state weight, which is equilibrium cycle compatibility.
2 · Experiment. Control both free regulators, as when each is in excess of the promoter. Take two paths across the plane : one regulator alone, sweeping with , and both together along the diagonal .
3 · Candidates. Each regulator wins its own total, so only the promoter total changes winner. Its candidates are the allowed joint states, and at leading order , the activity of the winning state.
4 · Regime sequence. One regulator alone hands the promoter from G to at in every architecture. On the diagonal the weights are 1, x, x and . With independent sites and , the double state overtakes G at , where all four weights tie. With exclusive sites the two single states take over together at , along their tie ray. The interaction moves the diagonal's breakpoints. With the double state overtakes G first, at . With the single states win on before the double state takes over.
5 · Response. Every active state has activity a, and for independent sites.
| Path | Regime: winner of | Range | OR | Mutual exclusion | Inactive double state |
|---|---|---|---|---|---|
| one regulator alone | G | 0 | 0 | 0 | |
| a | a | a | |||
| diagonal | G | 0 | 0 | 0 | |
| tied with | , exclusive sites | none | a | none | |
| , independent sites | a | none | 0 |
The exact outputs interpolate between these values, and at the corner they are furthest apart from them. With independent sites the weights factor, , and each activity assignment gives a closed form:
- AND activates only the double state: .
- Addition sets and : .
- OR gives every bound state the activity a, so double occupation counts once: .
- Mutual exclusion has : .
At the corner OR, mutual exclusion and the inactive double state give , and . With one regulator alone all three give the same curve, . The inactive double state reads 0, a, a and 0 in its four quadrants, so at leading order it computes exclusive-or. Its off quadrants approach zero only far from the corner, because the losing active states keep a share of the promoter.
Scroll inside the figure to see it at reading size.
A discriminating experiment therefore varies both regulators. A two-dimensional dose matrix tests the interaction directly, and a measurement of joint occupancy separates a binding change from an activity change. A response surface alone can still leave several mechanisms consistent with the data.
Which joint state changes the answer?
Control the two free regulator inputs, then change the double-state weight or activity. The empty state is inactive. Either singly occupied state has unit activity. Inputs are free concentrations divided by their dissociation constants.
| State | Probability | Share of promoter pool |
|---|---|---|
| Empty | ||
| Regulator 1 | ||
| Regulator 2 | ||
| Both regulators |
Output per gene in units of the single-state activity: .
Set one input to zero. Every choice gives the same isolated response. Restore both inputs to see which hidden assumption changes their combination. Finite supplied regulator totals require the additional balances derived in the text.
Finite regulators change step 3, because their totals are no longer settled. Each regulator total must count the promoter states that hold it:
These two balances fix both free regulators together, and more targets add more bound terms to the same balances. The output law is then evaluated at the resulting free concentrations. No new composition rule is needed. A solution without a short radical form is still unique, computable and differentiable, by the convex solve of §6.
Scroll inside the figure to see it at reading size.
Set , and . Compare the either-bound fraction with the value obtained by substituting totals for free inputs.
Worked answer
Independence factors the occupancies, so each balance reads in micromolar units. The positive root is . The either-bound fraction is , while substituting totals gives 0.75. Independent binding does not remove finite-pool depletion.
Derive combined regulation from joint states and their activities, test mechanisms along the diagonal where isolated curves agree, and close the regulator totals whenever their supplies are finite.
22At low copy number the state is a distribution
At small copy numbers the equilibrium object is a probability distribution over molecule counts, not a concentration. The core's note on promoters in §12 relies on two facts about that distribution, and this section proves both.
The first fact is an identity for occupancy. Let m labelled sites be exchangeable, and let c count the occupied ones. With the indicator that site i is occupied, , and linearity of expectation gives
The identity needs exchangeability, not independence. A finite ligand supply can correlate the sites while keeping their marginal probabilities equal.
The second fact is that the distribution is exact and small. Take enzyme molecules, substrate molecules and c complexes in a volume V. The association and dissociation propensities are and , where converts moles to molecules. Define , the dissociation constant counted in molecules. Detailed balance gives
where π is the stationary distribution, is the falling factorial, and .
A two-enzyme example shows the distinction. With , and , the complex is present with probability , and each enzyme is occupied with probability . Both enzymes are never occupied together, because only one substrate exists. The deterministic root of the same numbers gives 0.916 complexes, while the stochastic mean is 0.952. The concentration model is a macroscopic description, and averages at low counts must use the distribution.
A promoter in maintained regulator reservoirs is the case where the two agree. There the normalized weights of §21 are the probabilities of the discrete promoter states, and their activity-weighted sum is the mean production rate. Lecture 6's fast-switching limit justifies using that mean for slow dynamics. A finite regulator pool needs the conditional distribution at the relevant counts instead.
Use the exchangeability identity for mean occupancy, the exact count distribution for any low-copy average, and the concentration model only where reservoirs make the two coincide.
23The open enzyme closes the dynamics
The core's coda closes a binding-catalysis model with supply and removal on the same totals. This section does it for the reversible enzyme of §9, derives the steady state exactly, and runs the pipeline on a supply sweep.
1 · Model. Order the species as . The substrate and product bind the enzyme, and catalysis is one resolved reversible chemical step:
Supply and export are composite boundary processes, and , with rate laws and . Only free product is exported.
The accumulation line follows from the species equations. Let and be the net binding fluxes, and the net catalytic flux. Then
Adding rows with the counts of L cancels every binding flux. The enzyme total is constant, and the two form totals and obey
This is with the matrices of §9, where the external fluxes form their own stoichiometric term.5 Catalysis changes the two form totals, yet each is conserved by binding, so both are slow coordinates.
The binding layer solves by one scalar equation. With and , eliminating each ligand with its form total gives
The last equation is monotone in E on . At each integration step it supplies the states that catalysis and selective export read.
Scroll inside the figure to see it at reading size.
2 · Experiment. Vary the supply and read the steady state. At steady state , so the supply fixes and the form totals become outputs. The binding relation gives , and the catalytic balance gives . The enzyme total then yields the exact steady state:
Every concentration is positive when . The upper limit is the capacity. At or above it the reduced model has no finite steady substrate inventory. The illustrative values are , , and .
3 · Candidates. The enzyme total is at most either affinity, so and . Free S and free P win their form totals at every supply. Only the enzyme total can change winner, among E, and .
4 · Regime sequence. At low supply the path is in , with . The ratio is exact, so the check fails at . The check would fail later, at 0.6. The walk therefore predicts a product-bound regime next. Its checks hold for , which is 0.3 to 0.8. Near capacity the path is in .
The exact curve overrules the middle prediction. The exact winners are E below , the root of , and above it. At the crossing and , the closest that ever comes to winning. The predicted band is only a factor 2.7 wide, and its checks pass by margins under two. This is the warning case of §15. All three candidates stay within a factor of two of one another, so leading order names a winner that the exact solve does not confirm. A real product-inhibition regime needs , through slow export or tight product binding.
5 · Response. The substrate inventory is the readout. In , with . Near capacity, the exact E is proportional to the capacity gap , and S is inversely proportional to it.
| Regime | Range of | Free E | Free S | Gain of S | Exact at a sample point |
|---|---|---|---|---|---|
| 1 in | at 0.05: , law 0.083 | ||||
| , predicted | 0.3 to 0.8 | not realized: never exceeds 0.93 of the winner | at 0.5: , | ||
| −1 in the gap | at 0.95: , law 100 | ||||
A supply step moves the state between two steady states. At the free state is , with complexes and . At it is , with complexes 0.4615 and . The form totals move from to . The trajectory between them follows from the two accumulation equations and the scalar solve.
Scroll inside the figure to see it at reading size.
Supply, export and enzyme capacity
Change supply or export and compare the substrate and product inventories required for steady operation.
Both binding scales are 1 µM. Forward and reverse catalytic rates are 1 and 0.2 s⁻¹. Only free product is exported.
Close a binding-catalysis model by deriving the accumulation of each form total, solve its steady state exactly, and read the regimes of the enzyme total along the supply, trusting leading order only where its checks pass by a wide margin.
24Test a reduction on the output it must predict
A reduction is tested by comparing it with the resolved dynamics on the output of interest. The test keeps the equilibrium constants fixed and speeds up binding, so that only the clock separation changes.
The protocol has four parts. First, set , and choose and to keep and fixed. The catalytic and export rates are unchanged, so ε measures binding speed against the fixed catalytic clock. Second, start the resolved and reduced models at the same state, the reduced steady state at supply , and step the supply to 0.4 at time zero. Third, compare the two form totals on 301 samples over 60 s, and record the largest absolute error in either. Fourth, control the numerics. The stiff resolved equations use an implicit Radau method with relative tolerance and absolute tolerance . The reduced system is integrated independently by DOP853 and by fixed-step RK4, which agree to within . The resolved enzyme total stays constant to numerical precision.
| ε | Largest total error (µM) | Largest species error (µM) |
|---|---|---|
| 0.1 | 0.3598 | 0.3578 |
| 0.01 | 0.03397 | 0.03374 |
| 0.001 | 0.003377 | 0.003354 |
The error falls in proportion to ε across the tested range. The control speeds up only substrate binding and leaves product binding on its original clock. The fully equilibrated reduction then keeps a total error near , however fast substrate binding becomes. A valid partial reduction would keep product binding dynamic rather than eliminate it.
Scroll inside the figure to see it at reading size.
Test a reduction against resolved dynamics with its equilibrium held fixed, and measure the error on the totals or outputs the model must predict.
25Gains enter the slow Jacobian
The gains of Part 3 are the binding layer's contribution to slow dynamics. The Jacobian of the closed model factors into stoichiometry, flux size, pool size and these gains, and each factor can be read separately.
Start with the log sensitivities of the activities. For a positive activity with nonnegative coefficients, define . The chain rule through the gain matrix of §7 gives
The weights are the shares of the activity carried by each state, and they sum to one. So the sensitivity of a process is the share-weighted average of its states' gains. At leading order one state carries the activity, and its row of becomes the process's sensitivity (§11).
The Jacobian of the slow model follows. For , with ,
Stoichiometry enters through S, flux size through , pool size through , and binding through F. Within a regime F is a matrix of rational gains, so the Jacobian inherits the regime's structure. Lecture 9 uses this structure for stability, and Lecture 11 develops the geometry of the possible gains.
Directional activities must stay separate. Write and as two positive activities before taking logarithms. A net flux can vanish at equilibrium or at a stall, where its logarithm is undefined. The derivative of the net flux is still finite, as the difference of two well-defined terms. Keeping the two directions preserves the physics near balance and avoids spurious infinite sensitivities.
Build the slow Jacobian from stoichiometry, fluxes, pools and binding gains, keeping forward and reverse activities as separate positive terms.
The pipeline on further mechanisms
Core A1 to A3 run the pipeline three more times. This part derives those runs and adds four mechanisms the core leaves out: negative cooperativity, hidden conformations, series binding and a modification cycle. It ends with the pipeline stated for a system that no lecture has met.
26The winner of the repressor total sets the Hill degree
Core A1 shows that a dimerizing repressor gives a Hill law of degree two in total repressor only in one regime. This section derives the exact inventory, the exact midpoint and the table, with exact values beside the laws.
1 · Model. Two free repressor monomers R bind as the dimer , and the dimer binds the promoter G as :
The dimer association flux is defined as , so any combinatorial factor sits inside that rate constant. The dissociation constants are and , both concentrations. Only free G produces, through the composite process with rate law . The binding relations and totals are
The promoter total eliminates G, and the repressor total becomes one scalar equation for free monomer:
The right side of the second equation increases from zero to infinity with R, so every repressor total has one root. The solve keeps both dimer storage and promoter loading.
2 · Experiment. Sweep the repressor total , and read the free promoter fraction .
3 · Candidates. The promoter is in trace, , so never wins the repressor total (§15). The repressor total has candidates R and , which tie at . The promoter total has candidates G and , which tie at . A regime is named by the winners of .
4 · Regime sequence. The order of the two ties decides the sequence. When , the promoter switches while the monomer still wins, and the path runs through , and . When , the dimer takes the repressor total first, and the path runs through , and . Every crossing is regular.
5 · Response. Where the monomer wins, . Where the dimer wins, , and the binding relation gives . The monomer's gain drops from 1 to 1/2 at that crossing, a rational change (§15). The exact column uses the two panels of Figure 20, both with and .
| Regime | Range of | Free monomer R | Gain | Exact at a sample point | |
|---|---|---|---|---|---|
| 1 | 0 | left, : 0.990 | |||
| −2 | left, : 0.0135, law 0.01 | ||||
| 1 | 0 | right, : 0.953 | |||
| −1 | left, : , law . Right: 0.167, law 0.2 |
So a squared dependence on free monomer becomes a squared dependence on total repressor only in , where the monomer wins the repressor total. The lecturer's thesis derives these dimer orders, and the regime-index paper gives the same regime sequence.3, 10
The exact midpoint tests which regime a measured curve is in. At half activity , so and . The repressor total there is
The three terms count free monomer, free-dimer constituents and promoter-bound constituents at the midpoint. A Hill-2 law in total repressor needs the first term to exceed both others. In the left panel the terms are 1, 0.02 and 0.0001, so the midpoint is and the monomer wins. In the right panel they are 1, 200 and 0.0001, so the dimer wins, and the midpoint sits at .
Scroll inside the figure to see it at reading size.
Self-repression closes this model, and the closure needs a removal law. Let the product X be the repressor itself, so production is . The repressor total then obeys , where must say which protein states are removed. Removing every form at one frequency gives . Removing only free monomer gives . The two choices give different slow dynamics from the same equilibrium.
Count every protein copy, find the winner of the repressor total, and only then assign a Hill degree to a response plotted against total protein.
27A sponge moves the threshold
Core A2 shows that a tight sponge moves a promoter's threshold to the sponge total. This section derives the exact inventory, runs the pipeline twice, and then shows that the same stored material slows the free signal.
1 · Model. Free repressor R binds the promoter G or the sponge T:
Only free G produces. The totals are , and . Eliminating G and T with their totals gives one monotone equation for free repressor:
Half repression needs , whatever the sponge does. There the promoter holds and the sponge holds , so the exact midpoint is
2 · Experiment. Sweep at a fixed sponge total , and read .
Run 1: a trace promoter and a tight sponge
3 · Candidates. The promoter is in trace, so never wins the repressor total. The sponge and repressor totals form the one-pair map of §12, with T in the enzyme's role and R in the substrate's. The promoter total has candidates G and , which tie at . A regime is named by the winners of .
4 · Regime sequence. The sponge is tight, . While the path is in , and the free remainder stays below . At the path crosses the sponge pair's singular ray. Past it, free repressor wins its total, and the path is in .
5 · Response. The exact column uses the parameters of the core's Figure 20: , , and .
| Regime | Range of | Free repressor R | Gain | Exact at a sample point | |
|---|---|---|---|---|---|
| 1 | 0 | at : 0.976 | |||
| singular ray | from | falls from 1 to | switch | at : 0.753 | |
| , refined to | , refined to | −1 | at : 0.168, law 0.1, refined 0.167 |
The refined column comes from the ray's balance. With the promoter in trace, . Past the ray the free sponge is small, so , and half repression needs . The exact midpoints for sponge totals 0, 1 and are 0.21, 1.19 and . The DnaA boxes of §17 act as such a sponge.12
The shifted law needs its own conditions, and they are stricter than the midpoint's. The balance shows that replacing R by needs and . Sufficient conditions are , and . The last one bounds how close to the ray the shifted law can be used. A nearly full sponge can still leave enough free sites to violate it, so use the exact equation whenever a small difference matters.
Scroll inside the figure to see it at reading size.
Run 2: a tight promoter makes a rectifier
3 · Candidates. A tight promoter changes this step, because the promoter total is no longer in trace. The complex now becomes a candidate of the repressor total. Take , so the sponge binds first and the promoter binds next. The illustrative values are , , and .
4 · Regime sequence. Past the sponge's ray the balance holds over an interval, not just on the ray. The complex wins both the sponge and the repressor totals from onward. Their difference is then a total of its own, with an exact balance:
Its candidates are walked like any others. While the promoter has room, carries the balance, so . Once the promoter is full, free repressor carries it, , and .
5 · Response. Dividing each regime's law for G by gives the table.
| Regime | Range of | Carrier of | Exact at a sample point | |
|---|---|---|---|---|
| none | 1 | at : 0.990 | ||
| wins and | at : 0.483, law 0.5 | |||
| wins and , wins | R | at : 0.0010, law 0.0010 |
The free promoter therefore follows , a rectifier with a linear ramp of width . The balance also supplies an exact error diagnostic. Combining the totals gives
The ramp is accurate where the free pools are small against the signal, . At the diagnostic is , which is the whole gap between 0.483 and 0.5. The condition compares omitted pools with the intended signal. An affinity hierarchy alone does not guarantee it near either end of the ramp.
A sponge also slows the free signal
The stored material that moves the threshold also buffers changes in free R. Take supply and removal as composite processes, with rate law u and with rate law , so only free repressor is removed. The total obeys . Differentiating the equilibrium inventory in R gives
Here β is the buffering factor, the change in total repressor per unit change in free repressor. Because , loading slows every change in free R. Near a steady state the relaxation time is , where is the steady free repressor. The steady free level does not depend on the sponge at fixed supply. The total and the transient do. At fixed total, by contrast, adding a sponge lowers free R directly. Retroactivity theory makes exactly this distinction between a module in isolation and a module under load.15
Add a finite sponge
Increase the sponge amount and see how much total repressor is needed to repress the same gene.
Gene total 0.1 µM; gene–repressor dissociation scale 1 µM. Both complexes count toward total repressor.
Solve static sequestration and dynamic buffering from one shared inventory, and use the ray's balance to place the threshold and to test any shifted law.
28Extra states create windows and conformational switches
Core A3 shows that one inactive extra state turns a rising response into a window. This section derives the window's exact peak and then runs the pipeline on a conformational ensemble, the MWC model.
Run 1: a window from an inactive double state
1 · Model. A regulator binds a promoter twice in sequence, as and then , with stepwise dissociation constants and . The state weights are 1, and . Only the singly bound state produces, at activity a:
2 · Experiment. Sweep a controlled free regulator R, held in excess of the promoter. 3 · Candidates. Only the promoter total changes winner, among G, and .
4 · Regime sequence. When , the three states win in turn, with breakpoints at and . When , the singly bound state never wins, and G hands the promoter directly to at .
5 · Response. The illustrative values are those of the core's Figure 21: and for the open window, swapped for the closed one.
| Window | Regime | Range of R | Gain | Exact at a sample point | |
|---|---|---|---|---|---|
| open, | G | 1 | at : 0.0909, law 0.1 | ||
| 1 | 0 | at : 0.833 | |||
| −1 | at : 0.0909, law 0.1 | ||||
| closed, | G | 1 | peak at : 0.0476, law 0.1 | ||
| −1 |
The exact peak confirms the table. Differentiating the fraction in R gives a numerator proportional to , so the maximum is at in both cases. With , the weights there are 1, s and 1, and the peak is
For the open window and the peak is 0.833. For the closed window and the peak is 0.0476, while leading order gives s = 0.1. The ratio stays above 1/3, the bound for a total with three terms (§15).
Core A3 asks what changes when the double state also produces at activity a. Which end of the curve changes, and which state wins there?
Worked answer
The output becomes , one minus the empty fraction. The low end is unchanged, because G still wins below the first breakpoint. The high end changes. There wins the promoter total, and it is now active, so the output saturates at a instead of falling as . The window becomes a monotone saturation.
Run 2: a conformational switch
1 · Model. An allosteric protein with n equivalent sites takes two concerted conformations. MWC's historical letters label them R, for relaxed, which binds ligand tightly, and T, for tense, which binds it weakly. Lecture 7 called them active and inactive. Let L be the free ligand, and the site dissociation constants of the two conformations, and Λ the ratio of unliganded T to unliganded R. The state weights sum to
The binomial expansion of each power counts the occupancy states of one conformation. The relaxed fraction is . The mean number of bound ligands per protein is . These are different readouts of one ensemble, and neither gives a catalytic rate without the activities of the states.16
2 · Experiment. Sweep free ligand in reservoir, and read . The illustrative values are , , and .
3 · Candidates. The protein total has two pooled candidates, the relaxed and the tense ensembles. At leading order each factor is replaced by its larger term, . That costs at most a factor of two per site, so at most per ensemble.
4 · Regime sequence. The tense ensemble wins at low ligand, because its weight is Λ against 1. The relaxed ensemble's weight grows as once , while the tense weight stays near Λ below . The relaxed ensemble therefore takes over at , which lies below as the step assumed.
5 · Response.
| Winning ensemble | Range of L | Gain | Exact at a sample point | |
|---|---|---|---|---|
| tense, relaxed sites empty | 0 | at : 0.00146, law 0.001 | ||
| tense, relaxed sites filling | n | at : 0.0696, law 0.016 | ||
| relaxed | 1 | 0 | at : 0.990 |
The errors sit where §15 puts them. At the corner the exact value is 15 times the law, just inside the bound of 16. At the tie the exact fraction is 0.607. The pooled table is coarser than the true per-state sequence. Resolving each occupancy state as its own candidate gives the finer staircase of §19.
A finite ligand total closes the calculation with one more balance, , where is the protein total. In the full state representation each conformation and occupancy is its own species, with its own column of the counting matrix. States with equal composition may carry different weights, and a homodimer's column counts two copies of its monomer.
List every conformation and occupancy as a candidate, read windows and switches from the order in which they win, and restore finite ligand accounting before reading an ensemble curve as a response to total input.
29Negative cooperativity makes a buffer and a threshold
A two-site receptor separates binding cooperativity from response sharpness. With negative cooperativity, the singly occupied state absorbs the first ligand, and a threshold appears in total ligand. The pipeline shows where the threshold sits and why it needs finite supply.
1 · Model. Let be the receptor total, L the free ligand, and , the microscopic dissociation constants of the first and second occupation. The two singly occupied states are equivalent, so their pooled weight carries a factor of two:
Here is the fraction of receptors with i ligands, so and . The cooperativity is . Negative cooperativity means : the first ligand binds more readily than the second. Only the doubly occupied receptor is active, so the output is . The ligand total closes the model:
2 · Experiment. Sweep at , and read . The illustrative affinities are , so .
3 · Candidates. Both totals can change winner. The receptor total has candidates R, and . The ligand total has candidates L, and . A regime is named by the winners of .
4 · Regime sequence. The path starts in : each ligand fills a first site. The binding relations then give and . The check fails at , where wins both totals, a singular ray. Past it the path is in . A second singular ray at hands both totals to , and the path ends in .
The two rays carry balances, and with tight binding they hold across the whole middle interval. Subtracting totals cancels the complex that wins both:
Between the rays the free pools L and R are small, so the first balance gives . This is sharper than the regular law , which holds only within its factor of two.
5 · Response.
| Regime | Range of | Gain | Exact at a sample point | |
|---|---|---|---|---|
| 2 | at : 0.0012, law 0.0006 | |||
| singular ray | from | threshold | at : 0.045 | |
| , balance | 1 | at : 0.483, law 0.75, balance 0.5 | ||
| singular ray | from | corner | at : 0.868 | |
| 1 | 0 | at : 0.981 | ||
| positive cooperativity, : | 1 | at : 0.454, law 0.5 |
The table shows a buffer and then a threshold. With the singly occupied state soaks up the first of ligand and produces nothing. Output then rises along the ramp . With positive cooperativity, , the singly occupied state never wins, and the output rises from the start with no threshold. Finite affinity rounds the corners.
Scroll inside the figure to see it at reading size.
Ha and Ferrell tested the effect with DNA oligonucleotides. Their receptor strand bound two distinct ligand strands, and overlapping, separated or adjacent binding sequences changed the cooperativity. They measured the doubly bound product while varying the supplied ligands. The symmetric identical-ligand calculation above is their conceptual model. It is not a claim that their assay used identical ligands.17
The activity assignment is essential. If each bound ligand contributes independently, the output is proportional to , and the singly occupied receptors already produce half the full output. The buffering interval then vanishes in the tight limit. Negative cooperativity alone does not make a sharp regulatory response.
Read cooperativity from which occupied state wins, and read sharpness from the chosen activity and the ligand supply.
30Hidden conformations pool into one effective pair
Two conformations with the same composition test the whole construction. The pipeline runs on an effective pair, and its table shows which parameters a bulk response can identify.
1 · Model. Enzyme E binds substrate S into an open complex , which interconverts quickly with a closed complex . The fast mechanism is resolved as
Only the closed state is productive. Its slow conversion is composite at this resolution, with rate law . With species ordered , the fast totals are and , and
This L repeats a column, so it is isomer-atomic but not faithful-atomic (§4). Define , a concentration, and , a pure number. Binding gives and . With , the finite problem reduces exactly to one pair:
For a closed substrate-to-product experiment the slow balances are , and . Product does not bind here, so , and including it adds one identity row and one free column to L.
2 · Experiment. Sweep at fixed , and read the flux v. 3 · Candidates. The two conformations stay in the fixed ratio ρ at equilibrium, so they enter as one pooled candidate, . The pooling rests on that equilibrium ratio, not on equal composition alone. If the conformational step were slow, both states would stay dynamic.
4 · Regime sequence. The one-pair map of §12 applies with in place of . On the weak cut, , the path runs from into at .
5 · Response.
| Regime | Range of | Flux v | Gain | Parameters it depends on |
|---|---|---|---|---|
| 1 | only | |||
| 0 | only |
The last column exposes an identification limit. Every piece, and the exact curve, depends on the parameters only through and . For any positive ρ, setting and gives exactly the same flux curve at every substrate total. With and , ρ of 1 or 9 makes one half or nine tenths of the bound enzyme closed. A closed-state measurement separates mechanisms that total binding and bulk flux cannot.
Scroll inside the figure to see it at reading size.
Pool conformations that share a composition only through their equilibrium ratio, and separate the parameters a bulk response identifies from those that need a state-resolved measurement.
31Series binding tunes amplitude or threshold
A series architecture uses the first complex as the second binding partner. The downstream complex then enters the upstream totals, so the exact problem is coupled. The pipeline shows two hierarchies, one that tunes the output amplitude and one that tunes the input threshold.
1 · Model. Ligand L binds receptor R, and the complex binds a partner P:
The dissociation constants are and . The active output is . The totals are
One scalar solve gives the exact state. Let be the ligand-bound receptor. Then and , so B is the root of
On that interval decreases, so F increases. F is nonpositive at the left end and nonnegative at the right end. Bisection therefore finds the unique physical state, with no reservoir assumption.
The downstream partner changes the upstream occupancy. Binding P lowers the free binary complex needed to hold a given B, so it draws more ligand and receptor into the bound population. Adding P can raise the first layer's occupancy with every binding constant fixed.
Scroll inside the figure to see it at reading size.
2 · Experiment. Sweep , and read . A regime is named by the winners of .
Run 1: the amplitude hierarchy
3 · Candidates. Take , and . The reservoir bound of §15 settles two totals. Bound ligand is at most , and , so L wins its total. , so P wins its total. Only the receptor total can change winner. 4 · Regime sequence. R hands the receptor to at . The ternary complex never wins, because .
5 · Response. The illustrative values are and .
| Regime | Range of | Gain | Exact at a sample point | |
|---|---|---|---|---|
| 1 | at : , law | |||
| 0 | at : , law |
The plateau is set by the receptor. Changing the receptor total therefore tunes the achievable output without changing the partner, which is useful when the partner's abundance is constrained by other functions. The plateau stays below , because .
Run 2: the threshold hierarchy
3 · Candidates. Take , and keep . Then L wins its total and R wins its total, since . So , and only the partner total can change winner. 4 · Regime sequence. P hands the partner to where , at
5 · Response. The illustrative values are , , and , so .
| Regime | Range of | Gain | Exact at a sample point | |
|---|---|---|---|---|
| 1 | at : 0.0907, law 0.1 | |||
| 1 | 0 | at : 0.901 |
Here the receptor sets the threshold. Lowering the receptor total raises , so it can suppress activity without removing any ligand. The exact values follow the hyperbola to within one percent across the tested range.
Direct binding is the comparison. If L bound P directly, with dissociation constant and , the path would run from into at . The series architecture adds one control knob in each hierarchy. The amplitude hierarchy adds the receptor factor to the plateau, and the threshold hierarchy adds it to the breakpoint. Each holds only under its own settling conditions, and the exact root covers the transitions between them.
Keep every downstream complex in the upstream totals, settle the totals the hierarchy allows, and read from the table which knob sets the amplitude and which sets the threshold.
32A modification cycle switches where both enzymes saturate
A modification cycle is the classic source of zero-order ultrasensitivity. The pipeline shows that its switch is a singular regime of the two enzyme totals. The finite model then proves separately that the steady state is unique and stable.
1 · Model. Enzyme E binds the unmodified target X with dissociation constant , and enzyme F binds the modified target Y with . Catalysis is composite at this resolution: with rate law , and with rate law . For a phosphorylation cycle these laws assume maintained co-substrates and negligible reverse activities. Binding conserves , , and . Catalysis conserves the target total .
The slow dynamics reduce to one equation. Write for the exact complex of one pair with totals , and dissociation constant K, the root of §10:
Then the modified total obeys
The pair's complex increases with either total, because both of its gains are positive (§14). So on the interior. Also and . The cycle therefore has exactly one steady state, and it is stable. A scalar root between zero and the target total computes it.
2 · Experiment. Vary the capacity ratio , with capacities and , and read the modified fraction . Take trace enzymes, so complexes are negligible in the target totals, and write and . The steady balance becomes
The second form is exact, and each factor is an enzyme total over its complex. In trace, , so the numerator is . Likewise the denominator is .
3 · Candidates. The target totals are settled, since the enzymes are in trace. The enzyme totals change winner. E's candidates are E and , and wins when . F's candidates are F and , and wins when . A regime is named by the winners of .
4 · Regime sequence. Keeping the larger term of each factor gives the regimes. With , the path runs from , where , into , where both factors are near one and . It ends in , where . The middle regime is singular. Its leading-order law fixes r rather than y, so y jumps from about to about across . The exact form above is the balance that places y inside the jump.
5 · Response. The exact column uses .
| Regime | Range of r | Modified fraction y | Gain | Exact at a sample point |
|---|---|---|---|---|
| 1 | at : 0.0011, law 0.001 | |||
| from the exact balance | switch | 0.1 at , 0.5 at , 0.9 at | ||
| 0 | at : 0.9989, law 0.999 | |||
| , when | all r | 1 in the logit | graded, no switch |
The switch is steep because the jump is singular. At the slope of against is , for . y moves from 0.1 to 0.9 while r changes by 18 percent. When both enzymes stay unsaturated, the cycle sits in and the response is graded. Goldbeter and Koshland derived this zero-order amplification and also examined appreciable complexes and nonproductive binding.18 The finite model above keeps the productive complexes exactly, and its readout counts free and bound modified target.
Scroll inside the figure to see it at reading size.
Prove uniqueness from the monotone pair complex, and read the switch from the regime where both enzyme totals are won by their complexes.
33The pipeline carries over to a new system
A new binding-catalysis system goes through the same three tools in a fixed order. Each tool has a check that the examples of this page have exercised.
Tool 1 builds the model. State the intervention and the readout first. List the molecular states, count their constituents into L, and check that the totals are complete (§1, §4). Assign one affinity per complex, with units, and one activity per state (§5, §16). Solve the positive allocation before simplifying anything (§6, §8).
Tool 2 maps the regimes. For each total, list its candidates and select, solve and check (§11). Keep the exact solve available at every boundary, and use the ray's balance wherever a singular crossing or a small difference carries the output (§13).
Tool 3 reads responses. Run the five steps of §15 along the path of the experiment, and end in a regime-sequence table with exact values beside the laws. Then test the dynamical closure on its own terms. Affinity data fix the allocation but not the relaxation, so compare clocks (§2) and check the reduced model against the resolved one on the output it must predict (§24). The extension runs the same three tools on a transporter that carries a physical current.
In the conformational example of §30, suppose both bound states produce, at frequencies and . What changes in the pooled model and in its regime table?
Worked answer
The equilibrium inventory and are unchanged. The effective activity becomes the population-weighted average
The regime table keeps its breakpoint at , and both pieces take the new . If the two frequencies match, moving bound enzyme between conformations changes no activity per bound enzyme. Changing the conformational weight can still move the breakpoint through .
Build, map and read a new model in separate steps, and tie every approximation to the output it must predict.
References
- G. E. Briggs and J. B. S. Haldane, “A note on the kinetics of enzyme action,” Biochemical Journal 19, 338–339 (1925). publisher local full text
- J. Gunawardena, “A linear framework for time-scale separation in nonlinear biochemical systems,” PLOS ONE 7, e36321 (2012); equation/typesetting corrections and republication announced in 2013. publisher local full text
- 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). Binding and catalysis as the core of cellular reactions (p. 2), catalysis and its regulation (pp. 22–24), the abundance assumption of Hill laws (p. 37), L and isomer-atomic networks (pp. 79, 86), state transitions and the equilibrium argument (pp. 86, 90), dual configurations (pp. 88–89), uniqueness (§3.5, p. 96), the three regimes of one pair (Eq. 3.43, p. 109), the active state and the sign of a response (pp. 112–113), product binding, including a tight product held almost wholly by the enzyme (§3.2, pp. 72–77) and dimer orders (p. 128). This page also cites the binding clock (p. 40), the tight-binding minimum of one pair (p. 47), log derivatives as convex combinations (p. 52), the order triangle (Eq. 3.38, pp. 107–108) and hypersensitivity near matched totals (Eq. 3.45, p. 113). Printed page numbers. CaltechTHESIS local full text
- F. Xiao, M. Khammash and J. C. Doyle, “Stability and control of biomolecular circuits through structure,” 2021 American Control Conference (ACC), 476–483 (2021). Why binding is fast and catalysis slow (p. 476); the three regimes of one binding pair, with Michaelis-Menten as one edge of their triangle (pp. 477–478); production balanced by growth dilution (p. 479). publisher local full text
- F. Xiao, J. S. Li and J. C. Doyle, “Flux exponent control predicts metabolic dynamics from network structure,” 2023 American Control Conference (ACC), 1189–1194 (2023). The clock ladder of the binding-catalysis split in metabolism, and external exchange fluxes written as a separate stoichiometric term (p. 1191). publisher local full text
- Q. Liu, W. Zhou, X. Ren, J. P. Marken and F. Xiao, “Flux–species sampling enables holistic exploration of biocircuit behavior,” bioRxiv 2026.07.21.739804 (2026), preprint. The binding-catalysis model in four lines (Eq. 1, p. 5); reduced laws as leading-order descriptions of dominance regimes (p. 5); switches confined to a thin strip of totals (p. 3). bioRxiv local full text
- F. Horn and R. Jackson, “General mass action kinetics,” Archive for Rational Mechanics and Analysis 47, 81–116 (1972). publisher local full text
- J. P. Marken, F. Xiao and R. M. Murray, “A geometric and structural approach to the analysis and design of biological circuit dynamics: a theory tailored for synthetic biology,” bioRxiv 2020.02.18.953620 (2020), preprint. Saturation regimes whose monomial laws are straight lines on log axes (pp. 3–5), and the regime consistency check (p. 8). bioRxiv local full text
- Q. Liu, X. Ren and F. Xiao, “Evaluating valid parameter regimes for biocircuits,” bioRxiv 2026.01.19.700491, version 3 (2026), preprint, accepted at the 23rd IFAC World Congress. Select, solve and check as a procedure, and the one-pair regime table with its zero-area singular regime (p. 2); validity relative to the tunable variables (p. 3); fragility of Hill laws for sequential binding (p. 4); the dimer regime sequence (§3.2). bioRxiv local full text
- N. E. Buchler and M. Louis, "Molecular titration and ultrasensitivity in regulatory networks," Journal of Molecular Biology 384, 1106–1119 (2008), especially pp. 1107–1109. publisher local full text
- H. Fu, F. Xiao and S. Jun, “Bacterial replication initiation as precision control by protein counting,” PRX Life 1, 013011 (2023). Initiator titration by high-affinity DnaA boxes as a counting threshold for replication (pp. 013011-2 to 013011-4). publisher local full text
- N. E. Buchler and F. R. Cross, “Protein sequestration generates a flexible ultrasensitive response in a genetic network,” Molecular Systems Biology 5, 272 (2009). publisher local full text
- L. Bintu et al., "Transcriptional regulation by the numbers: models," Current Opinion in Genetics & Development 15, 116–124 (2005). State enumeration and activity assumptions. The consulted local copy is the full 2004 author preprint. publisher local full text
- D. Del Vecchio, A. J. Ninfa and E. D. Sontag, “Modular cell biology: retroactivity and insulation,” Molecular Systems Biology 4, 161 (2008). publisher local full text
- J. Monod, J. Wyman and J.-P. Changeux, “On the nature of allosteric transitions: a plausible model,” Journal of Molecular Biology 12, 88–118 (1965). publisher local full text
- S. H. Ha and J. E. Ferrell Jr., “Thresholds and ultrasensitivity from negative cooperativity,” Science 352, 990–993 (2016). source local full text supplement
- A. Goldbeter and D. E. Koshland Jr., “An amplified sensitivity arising from covalent modification in biological systems,” PNAS 78, 6840–6844 (1981). publisher local full text