An activator in an activator-inhibitor reaction–diffusion system is a species whose local feedback enhances activation. Near a homogeneous equilibrium, positive self-feedback is reflected in the corresponding diagonal entry of the reaction Jacobian matrix. Cross-coupling to an inhibitor and differing diffusion rates can generate a Turing instability.
Along the antipodal two-cycle of , the Jacobian matrix is at both points. Its two-step periodic-orbit multipliers are squares of the roots of . The Jury criterion makes the cycle attracting precisely in the displayed interval, and repelling for . This stable family is distinct from the always unstable nonzero-sum cycles.
Area density of a surface 2026-11-05
The area density of a smooth surface with Riemannian metric is the positive coordinate-invariant rule for measuring surface area. In a chart , with first fundamental form , it is
Under a coordinate change with Jacobian matrix , the metric matrix becomes , so its determinant acquires . The square root therefore transforms by , exactly the density transformation needed for an unsigned integral.
For a parametrized surface , the same coefficient is . A radius- sphere in polar coordinates has density , giving total area . Unlike an oriented area two-form, an area density exists on a Möbius band; reversing orientation does not negate area.
Area element of a surface Created 2026-09-24 Updated 2026-11-05
A Riemannian metric on a smooth surface defines an unsigned area density of a surface in every chart:
where are the coefficients of the first fundamental form. For a coordinate change with Jacobian matrix , the identity gives . This is exactly the absolute Jacobian determinant factor in coordinate area substitution, so the density defines surface area globally, including on a nonorientable surface.
If an orientation of a surface is also chosen, the corresponding oriented area two-form is, in every positively oriented chart,
Changing the orientation negates this differential form, while leaving the unsigned surface area unchanged. A Möbius band has an area density but no globally nonvanishing area two-form, since such a form would orient it. The notation is often used for the density too; an integral computing unsigned surface area uses the positive density convention.
Area-preserving seasonal predator-prey map Created 2026-10-14 Updated 2026-11-05
The annual pulse-breeding predator-prey model is an area-preserving map in logarithmic population coordinates: , then . Each step is a shear of determinant one. At a positive fixed point, the ordinary-population Jacobian matrix has determinant one and trace . Eigenvalues lie on the unit circle for , but this linear neutrality does not prove nonlinear stability at every resonance. Area preservation excludes an isolated attracting positive periodic cycle.
Automatic differentiation Created 2026-10-06 Updated 2026-11-05
Automatic differentiation evaluates derivatives by applying the chain rule to the elementary operations executed by a numerical program. It propagates local sensitivities through the calculation; it does not estimate them by choosing a finite increment as in numerical differentiation.
For , record , . A forward calculation carries both values and derivatives:
It returns . More generally, seeding an input direction computes the product of a Jacobian matrix and a vector. A reverse calculation starts from an output sensitivity and accumulates contributions toward the inputs; for a scalar objective it computes the full gradient efficiently. This is the mechanism of backpropagation. [ref]
The chain-rule result is exact in exact arithmetic for the differentiable operations used; a floating-point implementation still has roundoff error. Branches and nondifferentiable operations require care: a derivative propagated through the executed branch need not be an ordinary derivative of the whole program at a branch boundary. The same chain-rule machinery can differentiate reparameterization gradients through simulated trajectories.
A quadratic activator can have both basal production and activation inhibited by a second species. A normalized example has reaction rates and , with and positive concentrations. At its spatially homogeneous equilibrium, , so and . Writing , its reaction Jacobian matrix is . Thus and , giving linear asymptotic stability when and instability when . Basal production makes change sign at ; a positive activation feedback needed for a conventional Turing instability requires .
Broyden's method 2026-10-25
A secant-updating method for a vector equation , named for Charles George Broyden. Solve , choose , and form , . For a nonzero step the displayed “good Broyden” update satisfies , learning the Jacobian matrix action along the observed step rather than evaluating a new full Jacobian matrix.
The update also has a least-change characterization in the Frobenius norm. Write . Any correction satisfying has squared row norms bounded below by , by the Cauchy-Schwarz inequality. Summing these bounds gives , with equality for . This proves the rank-one correction is the least-change update satisfying the secant constraint. Superlinear convergence needs local regularity and suitable initialization; it is not a global consequence of this algebraic identity.[ref]
A uniform Newtonian gravitational field inside one spherical void can be cancelled at a point by the repulsive field representing another removed sphere. The latter field has a Jacobian matrix proportional to : its axial eigenvalue is negative and both transverse eigenvalues positive. The equilibrium is restoring along the axis but unstable transversely. A zero force is thus not enough for stable rest.
Change of variables formula Created 2026-09-24 Updated 2026-10-14
The change of variables formula expresses an integral in coordinates that make its integrand or its region simpler. Three ingredients change together: the region, the function being integrated, and the element of area or volume. The last change is measured by the absolute Jacobian determinant; forgetting it amounts to counting transformed cells as though their sizes had stayed the same.
In one dimension, substitution is the integrated chain rule. If is continuously differentiable on and is continuous on its image, then
These are directed definite integrals: if decreases, the transformed endpoints reverse. This identity does not require to be injective, because an antiderivative composed with already accounts for any backtracking.[ref]
For a concrete computation, set , so . The endpoints become :
The numerator is precisely the derivative of the expression in the denominator. Substitution reveals the familiar natural logarithm hidden inside this rational function. Keeping the original endpoints after changing the integrand would describe a different integral.
For the elementary two-dimensional theorem, let be a diffeomorphism between open sets in the plane, let be a bounded region with piecewise smooth boundary, and let be continuous on , with the displayed integrals finite. Then
Here is the Jacobian matrix. The diffeomorphism assumption means a bijection with a continuously differentiable inverse, and ensures a nonzero Jacobian determinant. This excludes overlapping sheets; the more general area formula handles multiplicity.[ref]
Take and the linear map
Its inverse is . The square becomes a parallelogram with vertices : base two, height one, area two. Consequently . A nonconstant integrand changes too: .
The direction of the map matters when selecting the factor. Here goes from the new coordinates to the original coordinates, so the factor is two. Its inverse has Jacobian determinant , appropriate for converting area in the opposite direction. Writing down the map before computing its Jacobian matrix prevents a reciprocal-factor error.
Figure 1.
A unit square becomes a parallelogram of area two; reflection changes the determinant sign but preserves area
. Details.
Now reflect the image vertically: has Jacobian determinant , but still produces area two. The sign records reversal of the orientation of a vector space; ordinary area uses its absolute value. For oriented differential forms, the pullback of a differential form instead retains the signed determinant.[ref]
The geometric beauty is that a nonlinear differentiable map has a local linear approximation: tiny rectangles behave approximately like these parallelograms. Summing their scaled contributions gives the change of variables formula. In polar coordinates this factor is , explaining ; equal angular steps cover more area farther from the origin. Choosing suitable coordinates can simplify both the boundary and the integrand.[ref]
Change-of-variables formula for a probability density Created 2026-09-28 Updated 2026-11-05
Let a random vector have probability density function on an open set . If is a continuously differentiable diffeomorphism onto an open set , with nonsingular Jacobian matrix, then has probability density function
and zero off . A diffeomorphism includes differentiability of the inverse; a merely differentiable bijection is not the full hypothesis needed for this density formula. The determinant corrects local volume, and its absolute value accounts for an orientation reversal.
Indeed, for a Borel set , apply the change of variables formula to . The resulting integral over identifies the probability density function.
For example, if has an exponential distribution of rate and , use the diffeomorphism . It gives for . Its integrable singularity at zero does not create a point mass. A map with several inverse branches requires summing their density contributions rather than choosing a single inverse.
Chemostat steady state 2026-10-14
A chemostat steady state has constant nutrient concentration and biomass concentration even while nutrient and cells flow through the vessel. It is an equilibrium of the chemostat ordinary differential equations, rather than a culture in which all growth has stopped. Assume and the Monod equation. Setting both derivatives to zero gives the always-existing chemostat washout equilibrium . A positive biomass concentration instead requires growth to balance removal, , whence
The positive chemostat steady state exists exactly when
The weaker condition only makes the denominator positive; it does not ensure or . Because the Monod equation is increasing, the feed must permit a specific growth rate greater than . At a positive chemostat steady state, increasing feed nutrient concentration at fixed increases the biomass concentration without changing , within the one-nutrient assumptions.
For a concrete chemostat, let , , and . At ,
The nutrient supply minus outflow is , matching nutrient consumption . Biomass production and removal both equal . The chemostat washout threshold is . For example, formally gives and , which cannot describe a physical culture.
Figure 1.
Chemostat steady state nutrient and biomass branches meeting at the chemostat washout threshold
. Details.
There is a useful exact simplification: the nutrient-equivalent concentration satisfies , so . This combines dissolved nutrient and the nutrient equivalent of biomass; it does not assert that these two variables account for every chemical constituent. In coordinates , the Jacobian matrix at the positive chemostat steady state has eigenvalues and , both negative. Hence the positive chemostat steady state is locally asymptotically stable. In the worked example the eigenvalues are and .
Chemostat washout 2026-10-14
Chemostat washout means the culture's biomass concentration tends to zero because growth cannot sustain replacement of the cells leaving the vessel. In the ideal Monod equation chemostat with , its equilibrium is . Its Jacobian matrix has eigenvalues and : a small inoculum grows when , whereas chemostat washout is locally asymptotically stable when . For nonnegative initial concentrations, chemostat washout occurs for ; the boundary case also loses biomass asymptotically.
At the positive chemostat steady state meets the chemostat washout equilibrium, and one eigenvalue is zero, so linearization alone does not decide the boundary case. On the invariant nutrient-equivalent balance , small positive obeys : nutrient consumption lowers the specific growth rate below , leading to slow decay rather than a positive biomass concentration. The continued mathematical branches exchange stability in a transcritical bifurcation; the positive-biomass branch becomes physically inadmissible beyond .
Common affine calibration cancellation in the lever rule is the exact invariance of the binary mixture phase fraction under the same affine map applied to the overall composition and both endpoints. For ,
Both a shared offset and a shared scale cancel. The map must be common to all three measurements; separately fitted calibration curves or sample-dependent effects do not satisfy that assumption.
An original example has , , and . Applying gives measured values , and , still yielding . If only the overall-composition reading then receives an additional error, its inferred fraction changes by . Common calibration cancellation leaves independent sample errors intact.
The covariance matrix formulation explains why treating the shared errors as independent gives a false uncertainty. In input order , the Jacobian matrix row is
It annihilates both the common-offset direction and the common-scale direction , since . A joint covariance matrix representing only these shared affine influences therefore gives . The measurement guide explicitly identifies common instruments and reference data as sources of correlation that must be retained.[ref]
Analyzing the overall sample and separated phases under one unchanged instrument calibration can realize this common contribution; repeating only one sample under another calibration breaks it. The cancellation is a property of this binary ratio. It does not remove nonlinear response, composition closure errors, endpoint misidentification or uncertainty in whether the samples establish liquid-liquid equilibrium.
Commuting velocity derivative for kinetic transport Created 2026-10-07 Updated 2026-10-14
The differential operators commute with . Indeed , canceled by differentiating the explicit time factor in . Hence satisfies the same transport equation as , and obeys the same L2 norm conservation when boundary fluxes vanish. For the standard Jacobian matrix , the vector of these derivatives is .
For a conformal bijection and smooth of compact support on , . The Jacobian matrix of is a rotation times . Consequently the chain rule introduces into the gradient pairing, while the change of variables formula introduces precisely the same factor into area. They cancel. The identity extends by completion to the Dirichlet energy spaces; it does not preserve the term of an inhomogeneous Sobolev norm.
Constant rank theorem Created 2026-09-24 Updated 2026-10-14
The constant rank theorem separates the directions a smooth map preserves from the directions it forgets. If a smooth map from an open subset of to has derivative of constant rank on a neighbourhood of a point, there are local coordinate transformations in source and target in which it becomes
It keeps coordinates, discards the other , and inserts zeros. This is stronger than simplifying the Jacobian matrix at one point: it straightens the actual nonlinear map on a neighbourhood. [ref]
For a worked example, take
The two columns agree, and the first row is nonzero, so the rank is exactly one everywhere. The image of a function is the parabola . Every line is a fiber mapping to the same point .
Choose input coordinates , , and output coordinates , . Both coordinate transformations are diffeomorphisms: their inverses are , and , . In these coordinates,
The curved image has become a straight line, and the unused coordinate is explicit.
Figure 1.
A rank-one map collapses input fibres to a parabola, which a change of output coordinates straightens
. Details.
Constant rank on a neighbourhood is essential. The map has rank one when and two when , so the constant rank theorem does not supply one rank-one form across that line. By contrast, the full-rank square case of the theorem forgets no coordinates and recovers the inverse function theorem. The usefulness is that curved fibers and images can often be studied through this simpler local form.
Continuation method Created 2026-10-14 Updated 2026-10-14
A continuation method follows a solution branch of a parameter-dependent equation from a known solution, using nearby solutions to guide the next solve. This is useful when one wants to understand how solutions change, rather than obtain just one isolated answer. A continuation predictor-corrector step follows a tangent vector and then uses a Newton method correction on a transverse section. The same geometry supports both pseudo-arclength continuation through a continuation fold and transversal surface intersection tracing.
Consider the original scalar polynomial example
Its solution branch bends back twice in . Increasing alone eventually stops following the same nearby solutions; following the curve in the plane can continue around both bends. The continuation folds are
For there are three distinct real zeros of a function at that fixed , all lying on this one connected curve. A continuation method keeps their geometric relationship visible.
Figure 1.
A connected cubic solution curve with two folds and three solutions at the same parameter value
. The arrows follow increasing along , even where changes direction. The dashed horizontal line meets the solution branch three times. The marked continuation folds are extrema of , not singularities of the full curve. Details.
Every continuation method needs a seed, supplied by an independent solve, an explicitly known solution, or another search. Following one solution branch does not guarantee finding every connected component of the solution set. A large step can miss detail or make the correction converge to a distant solution. At branch intersections or a loss of rank of the full Jacobian matrix, the regular-curve argument needs separate analysis. The seed and component limitations also matter in transversal surface intersection tracing.
For the cubic polynomial, an oriented, normalized tangent vector is
Its Euclidean norm is one and . The sign here follows increasing ; for a general solution branch, choose the sign of each new tangent vector so its dot product with the previous one is positive. First predict , then apply Newton method starting at to
The second equation keeps the correction on the transverse line in this two-dimensional example; in higher dimensions it is a hyperplane. Solving the linear system and updating corrects both coordinates together.
Figure 1.
A tangent predictor and transverse correction step across the upper fold
. From with , the predictor lies above the largest attainable nearby . Correction along the transverse line returns to the solution branch on the far side of the continuation fold. Both axes use the same scale, so perpendicularity is visible. Details.
This step gives and . Check both equations: the solution must satisfy and . Checking only the first could accept any point on the solution branch. The new exceeds , so the step crosses the continuation fold, even though the predictor's exceeds .
At the seed, set . The determinant of the correction Jacobian matrix with the exact unit vector above is
At either continuation fold, , and : the correction remains invertible. More generally, if has full rank and a one-dimensional kernel spanned by , adding gives an invertible matrix, since a vector annihilated by both rows must be zero. This is a local argument; the old transverse hyperplane need not work arbitrarily far along the curve. Reduce and retry when correction fails, and check the equations and orientation after successful steps. Scaling state and parameter coordinates also matters, because it changes the Euclidean norm used to normalize the tangent vector.
// Target: analysis.bigb
A vector field on an open subset of Euclidean space whose component functions have continuous first partial derivatives. Its Jacobian matrix is continuous; this is a standard regularity assumption for the divergence theorem and Stokes theorem.