Algebraic geometry Created 2026-09-24 Updated 2026-11-05
Algebraic geometry studies geometric objects defined by polynomial equations and the algebra of functions on them. For example, defines a parabola, while defines the union of two coordinate lines. The coordinate ring records the second example algebraically: the images of and are nonzero but their product is zero, reflecting two components. Modern schemes extend this dictionary beyond ordinary point sets and permit geometric reasoning over general commutative rings. Applications range from elliptic curves in number theory to families of solutions depending on parameters.[ref]
Substrate replication competes with saturating enzyme clearance in this fast-slow model, where and . The physical strip , is invariant. If , the origin is attracting and a positive saddle exists at , . Eliminating the fast complex fraction gives , separating extinction from runaway. For initially zero complexes, the stable-manifold threshold is , away from singular parameter limits. To derive the correction, write the stable manifold as ; its invariance equation gives and . A Dulac factor has strictly negative weighted divergence, excluding a periodic alternative to the two basins. Saturated clearance and autocatalytic growth can therefore create an unstable concentration threshold rather than a stable nonzero balance.
Bayesian normal model Created 2026-09-24 Updated 2026-11-05
A Bayesian normal model combines a normal distribution for observations with a prior distribution for its unknown parameters. For independent with known and prior , normal-normal conjugacy gives posterior variance . The posterior mean is the corresponding precision-weighted average of and the sample mean. Unknown observation variance requires an additional prior; treating it as known yields different uncertainty. The model makes prior information and measurement variation explicit.
Cryptographic key 2026-11-05
A cryptographic key is a parameter selecting a particular transformation from a family of algorithms in cryptography. For an encryption family, correctness requires
for every allowed plaintext and appropriate encryption/decryption keys. In symmetric-key cryptography, the communicating parties share a secret key. In public-key cryptography, the public encryption or verification key is paired with a private decryption or signing key.
For a one-bit example, and recover the message because applying exclusive or twice with the same bit cancels it. The one-time pad extends this to a uniformly random independent key as long as the message. Its secrecy depends on the key distribution and use, not on hiding the XOR algorithm. The number of possible keys gives a brute-force search space, but key length alone does not establish the security of a cryptographic construction.
Consider the correctly specified fixed-design normal linear model , with an full-column-rank design matrix, , and with . Both and are unknown, so the Akaike information criterion counts fitted parameters. If is the residual sum of squares, then
The orthogonal-projection decomposition of a random variable with a multivariate normal distribution gives . Substituting into yields
Here denotes a random variable, not a quantile. The maximum-likelihood estimator of the error variance uses divisor ; the unbiased residual variance estimator with divisor cannot be substituted into the maximized likelihood. If and is invertible, the fit has zero residual sum of squares, and the Gaussian likelihood is unbounded as decreases to zero. There is then no finite positive-variance maximum-likelihood estimator to which the displayed Akaike information criterion law applies.
For positive , the origin of the Lorenz system loses stability at and two equilibria emerge stably. Center-manifold projection gives , proving a supercritical pitchfork. The nonzero-branch characteristic polynomial is . If these equilibria remain stable for all . Otherwise their transverse Hopf crossing occurs at the displayed parameter, with frequency squared . Its cubic Hopf coefficient is positive, so this Hopf is subcritical, producing an unstable small periodic orbit on the stable-equilibrium side. A zero eigenvalue detects the pitchfork, while the Hopf condition uses the Routh-Hurwitz equality; neither alone determines nonlinear criticality without the corresponding normal-form calculation.
Gamma distribution Created 2026-09-24 Updated 2026-11-05
The Gamma distribution with shape and rate has probability density function
The gamma function normalizes its integral to one. Its mean is and its variance is , obtained by integrating powers of . At it is the exponential distribution; integer gives the waiting time to the th event of a rate- Poisson process. Independent gamma variables with the same rate add their shapes. Some sources use scale instead of rate, so the parameter convention must accompany the formula.
Log-linear model Created 2026-09-24 Updated 2026-11-05
A log-linear model makes the logarithm of a positive expectation linear in model parameters. For independent cell counts with a Poisson distribution in a contingency table, write and . This is a Poisson regression with log link; finite linear predictors give strictly positive fitted cell expectations.
For a two-way table, the additive model
implies . Conditional on the total count, the cell counts have a multinomial distribution whose cell probabilities factor into row and column probabilities; this is independence of the two categorical classifications. For example, the cell-mean table has common column ratio two and odds ratio .
Adding interaction terms to the linear predictor permits association. In a table the association is measured by
It vanishes in the additive model. Hence additive main effects describe one particular log-linear model; log-linear models also include interactions and more general design matrices. Independent Poisson sampling and multinomial sampling conditional on the total use different sampling schemes, while producing this same independence structure for the normalized cell probabilities.
The positive fixed point exists when and equals ; the negative one exists when and equals . Equality on either boundary does not give a branch, because its fixed-point equation becomes . For a genuine two-cycle and , subtracting its scalar equations rules out equal signs of the two first coordinates. Solving with gives the displayed coordinates and second coordinates , . Their signs require exactly . The cycle is unique up to interchanging its two points. Degenerate boundary parameter lines can support additional period-two families and are outside this statement.
Model recovery 2026-11-05
Model recovery tests whether a model selection procedure can identify the known model that generated simulated data. Generate observations from each candidate statistical model, fit the candidates using the intended pipeline, and record which candidate is selected. It is a check on the comparison procedure under stated simulation conditions.[ref]
This differs from parameter recovery, which compares estimated parameters with the settings used to generate data within a model. Correctly identifying a model does not automatically imply accurate parameter estimation, and accurate fitting within one model does not establish that a procedure can distinguish it from its competitors.
For an invented example, suppose one hundred simulated datasets come from each of models A and B. The resulting counts are
This confusion matrix estimates selection behavior conditional on the generating model. Its empirical rate of choosing B when A generated is .
The reverse question has a different denominator. Among the datasets for which B was selected, were generated by B, giving . That calculation uses the example's balanced simulation design. It is not interchangeable with the recovery rate for B-generated datasets. Different generating-model frequencies can change the reverse proportion even if the conditional selection behavior stays fixed.[ref]
Recovery depends on parameter ranges, observation count, noise and the selection criterion. Models with nearly indistinguishable predictions can be hard to recover despite successful numerical optimization. Repeat simulations in the regimes relevant to the planned inference. Finally, recovery among a chosen candidate set does not prove that the real system belongs to that set; checking how well the selected model reproduces relevant observations remains a separate task.[ref]
Painlevé II equation Created 2026-10-14 Updated 2026-11-05
The Painlevé II equation is the nonlinear second-order ordinary differential equation
where is a constant parameter. This is the standard normalization of the second of the six Painlevé equations.[ref] A local solution is specified by and ; as a complex ordinary differential equation, its analytic continuation exhibits the special singularity structure of the Painlevé property.
Special parameters can give elementary solutions: solves the equation at , while solves it at away from zero. For the latter, both sides equal . These are exceptional rational members of a generally non-elementary family of Painlevé transcendents.[ref] Similarity reductions of some integrable systems lead to this equation after a change of scales.
Painlevé transcendent Created 2026-10-14 Updated 2026-11-05
A Painlevé transcendent is a special function obtained as a solution of one of the six nonlinear second-order Painlevé equations. The family is organized by the differential equation, its parameters and its initial or asymptotic data. In general these solutions supply new transcendental functions, rather than combinations of classical special functions.[ref]
The name of the family does not imply that every exceptional solution is a transcendental function. For the Painlevé II equation, at and at are rational solutions. The Painlevé property concerns the absence of movable branch points, rather than the absence of movable poles; it describes how solutions behave under analytic continuation.
Parameter Created 2026-10-31 Updated 2026-11-05
A parameter specifies a member of a family of mathematical models and is held fixed while a particular solution evolves. Varying it can change equilibrium existence, stability or long-term dynamics, producing a bifurcation. A model parameter differs from its evolving state variables and from an initial condition, even though all may be numerical inputs to a computation.
Parameter estimation 2026-11-05
Parameter estimation uses observations to infer the unknown parameters of a mathematical model. The result depends on both the observations and the model: one must specify which quantities are unknown, how observations relate to them, and how discrepancies are assessed. Least squares and maximum likelihood estimation provide two common criteria.[ref]
For an explicit example, suppose , where the same unknown level applies to all observations. Minimizing
gives
Since , this is the unique minimum for . Observations give the sample mean , with residuals . Independent normal distributions with a common variance also make this estimate the maximum likelihood estimation solution for the level.
An estimate is not the same as a known exact value. Under the independent equal-variance model, its standard error is estimated by , where is the sample variance. For the three illustrative observations, and the estimated standard error is . Correlated errors or a common measurement offset require different accounting; collecting more identically biased readings does not remove the offset.
Identifiability is a separate prerequisite. If a model depends only on , data of that form can estimate their sum but cannot uniquely separate from . Pairs and give the same sum. More repeated observations of that same relationship reduce uncertainty about the sum without identifying both parameters. State what the observations can determine before reporting numerical estimates.
Parameter sensitivity equation Created 2026-09-24 Updated 2026-11-05
For the initial value problem , , assume is continuous in all variables with continuous state and parameter derivatives, is continuously differentiable, and solutions exist on a common interval. The sensitivity obeys the inhomogeneous linear differential equation
This follows by differentiating the original equation and applying the chain rule. For several parameters, the columns of the sensitivity matrix satisfy the corresponding equations. The homogeneous part is the variational equation, while explicit parameter dependence supplies the forcing term.
For with parameter-independent , the exact solution is and . Substitution gives and , verifying both the evolution and its differentiated initial condition.
Partial likelihood-ratio test Created 2026-09-24 Updated 2026-11-05
For a Cox proportional-hazards model, let denote the logarithm of the Cox partial likelihood. To compare a full parameter space with a nested null model imposing independent smooth restrictions, maximize the same partial likelihood under each model and form
Nesting makes . Under the null hypothesis, a correctly specified regular model, independent censoring conditional on covariates, fixed parameter dimension, an interior true parameter and nonsingular limiting information, . The degrees of freedom count independent restrictions, not the number of observed failures. For example, testing that two identifiable regression coefficients both vanish gives .
The calibration follows from the local quadratic expansion of : the unrestricted maximizer removes the score component in the constrained directions, whose standardized squared length has a chi-squared distribution. It requires enough event information for this approximation. A variance parameter constrained to be nonnegative and tested at zero, or a parameter unidentified under the null model, violates the regular interior assumptions; an ordinary reference cannot be presumed. Model comparisons must also use the same observations and the same event-tie convention.
After an initial layer of duration in slow time, while changes only slightly. The reduced substrate equation is
Below it decreases to zero; above it increases without bound. The exact threshold for initial is the intersection of the saddle equilibrium's stable manifold with that axis. For small it is
In dimensional initial-substrate units the leading threshold is . Comparing the actual initial value to this threshold determines its fate; the reference scale can be held fixed when varying the initial concentration.
The initial sequestration produces an correction if desired. Write the stable manifold as . The invariance equation at leading order gives and . Hence
for fixed parameters away from degenerate limits. The positive correction reflects the substrate consumed in building complexes from the initially enzyme-free-complex state.
The physical strip , is invariant, and the off-diagonal derivatives are nonnegative there, so ordered initial substrate values remain ordered. There are only the attracting origin and the saddle equilibrium. With Dulac function , the divergence of the weighted vector field is , excluding periodic orbits in its interior. The saddle equilibrium separatrix therefore gives the unique threshold on the initial axis: below it solutions tend to extinction, at it they tend to the saddle equilibrium, and above it they escape to infinity. Growth is at most exponential, so this is as time tends to infinity, not a finite-time blowup. This is autocatalytic enzyme clearance with a saddle threshold.
A saddle-node bifurcation creates or destroys two equilibria when a real eigenvalue passes through zero with a nonzero quadratic normal-form term. With a parameter orientation chosen so the pair appears for , use
There are no equilibria for , a double nonhyperbolic equilibrium at zero, and equilibria for . The positive branch is stable and the negative branch unstable in the active direction; additional hyperbolic directions can make them a node and a saddle equilibrium. “Supercritical” for a fold depends on this chosen parameter orientation; unlike the pitchfork and Hopf cases it is not an intrinsic distinction between the stability of two possible cubic branches.
The supercritical pitchfork normal form of a dynamical system is
The symmetric equilibrium is stable for and unstable for . Two new stable equilibria emerge on the unstable side of the original branch. Reflection symmetry preserves the pair. The new equilibria approach zero continuously as the parameter reaches the threshold.
The Lorenz equilibria satisfy , and . Thus
At the origin the third eigenvalue is and the other two solve . Hence the origin is stable for , has one zero eigenvalue at , and becomes a saddle equilibrium with one unstable direction for . The symmetry interchanges the new branches.
The nonzero-equilibrium characteristic polynomial is
Near its Routh-Hurwitz inequalities are strict, so both new branches are stable. More explicitly, center-manifold projection at gives
The linear coefficient crosses positively and the cubic coefficient is negative. Therefore the equilibrium bifurcation is a supercritical pitchfork at , not a saddle equilibrium-node.
For completeness, the later stability boundary satisfies
If , the nonzero branches remain linearly stable for all . If , they lose stability at
At that point and
This establishes a genuine transverse Hopf crossing. It is subcritical for these positive parameters, so it is not the supercritical Hopf normal form of a dynamical system from (c). One way to check its nonlinear sign is the cubic Hopf formula. At write and
For right and adjoint eigenvectors , , , the cubic coefficient has the sign of
Substitution and clearing positive factors reduces its sign to that of the following polynomial in :
Every term is positive. The radial cubic is therefore positive, giving the unstable small cycle on the stable-equilibrium side. There is no saddle equilibrium-node among the equilibrium branches for : the only zero-eigenvalue branch intersection is the symmetry-forced pitchfork. This does not rule out separate global bifurcations of periodic orbits.