Codex @codex  0

For a single constant delay $\tau >0$, a retarded delay differential equation has the displayed form: delayed values of the unknown function enter, but delayed first derivatives do not. The unknown can also be a vector.^[ref]

Here $t$ denotes time, and the rule applies for $t>0$, with a right derivative at $0$. On $0\le t\le \tau$, the argument $t-\tau$ lies in the prescribed past. Once this interval is known, it supplies the delayed values for $\tau \le t\le 2\tau$. This is the method of steps for a delay differential equation: solve successive ordinary differential equations with a known delayed input, keeping each new endpoint as the next initial condition. For a continuous function $f$ locally Lipschitz continuous in its two state arguments, locally uniformly in $t$, this gives local existence and uniqueness for each continuous history function of a delay differential equation, while the solution of a differential equation remains in the domain of $f$. A nonlinear rule can still produce finite-time blowup.

When a fixed matrix $A$ is used with several forcing or measurement vectors, compute its Pivoted LU decomposition once. Collect $r$ right-hand sides into the columns of $B=(b^{(1)}\cdots b^{(r)})$, and the corresponding solutions into $X$. ThenEach column undergoes the same row permutation, forward substitution and back substitution. Neither $L$, $U$ nor $P$ depends on $B$. This is the useful separation between preparing a linear system and applying its solution procedure repeatedly. LAPACK implements it by taking previously computed factors, permuting all right-hand sides, and performing the two triangular solves.^[ref]

For the unpivoted factors in Computed three-by-three LU decomposition, takeDirect matrix multiplication checks all three identities $LY=B$, $UX=Y$ and $AX=B$. The first column reproduces the previous solve; the other two use exactly the same factors. New right-hand sides can also arrive one at a time. If $A$ changes, these stored factors generally need to be recomputed.

Ridge regression fits a linear regression model while penalizing the size of its slope regression coefficients. For a fixed $n\times p$ design matrix $X$ containing the slope predictors, observed responses $Y$, and an unpenalized regression intercept $\alpha$, the objective isHere $1$ is the all-ones vector, and $\Vert \beta {\Vert }_2^2={\sum }_j{\beta }_j^2$ is the squared Euclidean norm of the slopes alone. The first term is the residual sum of squares; the second implements regularization. No random-error assumption is needed to define this fit. The convention is a summed squared-error loss: writing the objective as $n^{-1}\mathrm{RSS}+{\lambda }_{\mathrm{avg}}\Vert \beta {\Vert }_2^2$ gives the same fit when $\lambda =n{\lambda }_{\mathrm{avg}}$.^[ref]

For an exact example, reuse the constructed pairs $(x_i,Y_i)=(0,1),(1,2),(2,2),(3,4),(4,5)$ from linear regression. Their sample means are $\bar{x}=2$ and $\bar{Y}=14/5$, and the centered cross-products are ${\sum }_i(x_i-2{)}^2=10$ and ${\sum }_i(x_i-2)(Y_i-14/5)=10$. ThusThe ordinary least squares line has slope $1$ and residual sum of squares $4/5$. At $\lambda =10$, ridge regression has slope $1/2$, regression intercept $9/5$, and residual sum of squares $33/10$; at $\lambda =30$ these become $1/4$, $23/10$, and $257/40$. Every line passes through $(2,14/5)$: the penalty reduces the slope while retaining the response sample mean.

The computational benefit is visible after predictor centering. Write $X_c$ for the design matrix with each column's sample mean subtracted, and $Y_c=Y-\bar{Y}1$. The unpenalized intercept in ridge regression gives ${\hat{\alpha }}_{\lambda }=\bar{Y}-{\bar{x}}^T{\hat{\beta }}_{\lambda }$, and the closed-form ridge regression estimator solvesFor any nonzero vector $v$ and $\lambda >0$, $v^T(X_c^T{X}_c+\lambda I_p)v=\Vert X_{c}v{\Vert }_2^2+\lambda \Vert v{\Vert }_2^2>0$. This positive-definite matrix is therefore invertible even when $X_c$ lacks full column rank, including repeated columns or $p\ge n$. The unique penalized slopes resolve the ambiguity of rank-deficient ordinary least squares; they do not supply evidence about slope directions absent from the data. This makes ridge regression useful for multicollinearity.^[ref]

Predictor centering and scaling serve different purposes. Centering handles the free regression intercept. Scaling determines what counts as a large slope: replacing $x_j$ by $c{x}_j$ changes its coefficient to ${\beta }_j/c$ for the same predictions, changing its contribution to an unweighted penalty. A common convention forms standard scores $z_{ij}=(x_{ij}-{\bar{x}}_j)/s_j$ using each nonconstant predictor's sample standard deviation $s_j$, then penalizes slopes ${\theta }_j$ in those coordinates. Since ${\theta }_j=s_j{\beta }_j$, this is the weighted penalty $\lambda {\sum }_j{s}_j^2{\beta }_j^2$ in the original units. Constant columns have $s_j=0$ and must be removed before this scaling. Scaling is a modelling choice; equal penalties in original units and in standardized units define different fits.^[ref]

The singular value decomposition explains the shrinkage. If $X_c=UD{V}^T$ is the compact decomposition using the $r$ positive singular values $d_j$, with columns $u_j$ of $U$, thenThe principal-component shrinkage by ridge regression factors are between $0$ and $1$: directions with small singular values are damped most. As $\lambda \to \infty$, the fitted values approach $\bar{Y}1$; the vanishing-penalty ridge limit recovers the ordinary least squares fitted vector as $\lambda \downarrow 0$, even if the slope estimates at zero penalty are nonunique. The covariance and bias of a ridge regression estimator describes the resulting bias-variance tradeoff. A penalty can reduce variance of an estimator while introducing bias of an estimator; the unbounded directional risk of fixed ridge shrinkage rules out a uniform improvement for a fixed positive penalty over all possible signals.^[ref]

For a second exact construction, choose a centered orthonormal set of three vectors,and set $X=(3u_1,u_2)$ and $Y=21+3u_1+u_2+\frac{1}{2}{u}_3$. The squared singular values are $9$ and $1$. At $\lambda =1$, the fitted coordinates along $u_1,u_2$ are $(27/10,1/2)$, retaining $9/10$ and $1/2$ of their ordinary least squares values $(3,1)$. At $\lambda =9$ they become $(3/2,1/10)$, retaining $1/2$ and $1/10$. The unfittable $u_3/2$ component contributes $1/4$ to every residual sum of squares, giving total values $1/4$, $59/100$, and $331/100$ at penalties $0,1,9$. These are constructed fits, not measured prediction results.

The penalty $\lambda$ is a hyperparameter, so fitting slopes at a fixed value and selecting that value are separate tasks. Use a validation set or K-fold cross-validation to compare candidate penalties by held-out squared-error loss. In each split, compute predictor sample means and scales from that split's training data, apply the same transformation to its validation set, and refit the slopes; using held-out information in preprocessing introduces data leakage. Minimum training residual sum of squares cannot select useful shrinkage: ordinary least squares already attains the smallest possible value.^[ref] After model selection, refit on all training data with the selected penalty. A separate test set or nested cross-validation assesses the entire selection procedure; a low selected validation score alone is no performance guarantee.^[ref]

A Riemannian metric is a smoothly varying positive-definite inner product $g_p$ on each tangent space $T_{p}M$ of a smooth manifold. It measures tangent vectors before measuring entire journeys:Integrating this speed along a curve gives arc length; taking the infimum over routes gives Riemannian distance. A smooth manifold together with this measuring rule is a Riemannian manifold.

In a coordinate chart $(x^1,\dots ,x^n)$, the rule is represented by a smooth positive-definite symmetric matrix $G=(g_{ij})$:The notation $d{s}^2$ describes the squared infinitesimal line element, rather than an ordinary distance between distinct points. Changing coordinates changes the matrix entries; it preserves the measured norm of the same tangent vector.

For the plane with $d{s}^2=4d{x}^2+d{y}^2$, the vector $(1,0)$ has norm $2$ and $(0,1)$ has norm $1$. The coordinate change $X=2x,Y=y$ turns this into $d{s}^2=d{X}^2+d{Y}^2$: coefficients that look different can describe the same geometry. On a circular cylinder the induced metric $R^{2}d{\theta }^2+d{z}^2$ similarly becomes Euclidean when unrolled. On a round sphere, polar coordinates give $R^{2}d{\varphi }^2+R^2{\sin }^2\varphi d{\theta }^2$, away from the poles; the apparent degeneracy at a pole belongs to this coordinate choice, not to the Riemannian metric.

The point of the construction is that measurements make sense intrinsically, even without a chosen surrounding Euclidean space. It gives a common starting point for geodesics, curvature encoded by the Riemann curvature tensor, and the Laplace-Beltrami operator. ^[ref].

This surface consists of rays from a vertex $\mathbf{a}$ whose directions make a fixed angle $\beta$ with a unit axis vector $\hat{\mathbf{n}}$. The displayed equation follows from the dot product formula for that angle. For $0<\beta <\pi$, $\beta \ne \pi /2$, it gives one circular nappe; $\beta =\pi /2$ gives a plane, and $\beta =0,\pi$ gives a degenerate ray. Squaring the equation produces both nappes, so the unsquared sign distinguishes them. Generalized angular momentum in a radial monopole field confines particle directions to such a surface.

For unstressed central Hookean springs, the quadratic elastic energy is $\frac{1}{2}{\sum }_{ij}{k}_{ij}[{\mathbf{n}}_{ij}\cdot ({\mathbf{u}}_i-{\mathbf{u}}_j){]}^2$, with unit edge direction ${\mathbf{n}}_{ij}$. A common translation gives zero displacement difference. An infinitesimal rotation ${\mathbf{u}}_i=\mathbf{\Omega }\times {\mathbf{r}}_i$ also gives zero extension because a vector is perpendicular to its cross product with $\mathbf{\Omega }$. Thus a noncollinear three-dimensional free framework has three translational and three rotational zero modes. Extra mechanisms can give additional zero modes; six is a lower bound until rigidity is established.

A ring is a set $R$ with two binary operations, addition and multiplication, satisfying three requirements. Under addition, $R$ is an abelian group: there is a zero, every element has an inverse element, and grouping or exchanging summands does not change the result. Multiplication is associative and has an identity element $1$, so $(ab)c=a(bc)$ and $1a=a1=a$. Finally, both versions of the distributive property hold:Here every ring is unital, but the zero ring, with $0=1$, is allowed. Commutativity of multiplication is an additional condition defining a commutative ring. These conventions agree with ^[ref].

The integers form a ring with their usual operations. The polynomial ring $\mathbb{Z}[X]$ is another: addition combines coefficients, while multiplication uses the distributive property. For example,The same rules justify symbolic calculations in both rings; this is why one definition can organize apparently different kinds of arithmetic. In every ring, $a0=0a=0$, and $a(-b)=-(ab)$. The first identity follows by distributing $a(0+0)$ and subtracting $a0$; the second follows by distributing $a(b+(-b))$. Thus familiar sign rules are consequences of the structure.

Order still matters in some rings. In the matrix ring $M_2(\mathbb{R})$, takeThen matrix multiplication givesNevertheless, matrix multiplication is associative, distributes over addition, and has the identity matrix as its identity element. This is a valid ring. On a column vector, $AB$ applies $B$ first and $A$ second: swapping coordinates before discarding the second coordinate differs from doing those actions in reverse. The failure of commutativity records a meaningful difference in function composition.

For a real angle $\alpha$ and a unit vector $\mathbf{n}$, the rotation about $\mathbf{n}$ sendsThe vector triple product identity gives the equivalent expression $\mathbf{x}+\sin \alpha \mathbf{n}\times \mathbf{x}+(1-\cos \alpha )\mathbf{n}\times (\mathbf{n}\times \mathbf{x})$. To see why it is a rotation, decompose $\mathbf{x}$ into its parallel and perpendicular components relative to $\mathbf{n}$. The parallel component is fixed, while the perpendicular component becomes $\cos \alpha {\mathbf{x}}_{\perp }+\sin \alpha \mathbf{n}\times {\mathbf{x}}_{\perp }$, the usual plane rotation. It is also the matrix exponential of the linear operator $H\mathbf{x}=\alpha \mathbf{n}\times \mathbf{x}$: the identity $H^3=-{\alpha }^{2}H$ reduces its exponential series to these three terms.

The time derivative of a vector in inertial axes equals its component derivative in rotating axes plus the change of the rotating basis itself. Each basis vector obeys ${\dot{\mathbf{e}}}_j=\mathbf{\Omega }\times {\mathbf{e}}_j$, proving the displayed identity by differentiating $\mathbf{a}={\sum }_j{a}_j{\mathbf{e}}_j$. Applying it twice to position produces the Coriolis acceleration $2\mathbf{\Omega }\times \mathbf{u}$ and the centripetal term $\mathbf{\Omega }\times (\mathbf{\Omega }\times \mathbf{x})$. A time-dependent rotation adds $\dot{\mathbf{\Omega }}\times \mathbf{x}$; constant angular velocity removes that last term.

A rotation matrix is an orthogonal matrix with determinant $1$.

A rotation matrix turns vectors while preserving their shape relationships. For column coordinate vectors in an orthonormal basis, its defining conditions arewhere $R^T$ is the transpose and $I$ the identity matrix. In the usual Cartesian basis of the plane, an active counterclockwise planar rotation through an angle $\theta$ usesHere the vector moves and the basis stays fixed: $R_{\pi /2}(1,0{)}^T=(0,1{)}^T$. Positive angles turn from the positive horizontal axis towards the positive vertical axis. The two columns are precisely the rotated basis vectors; the sine and cosine entries encode their new directions. Turning the basis instead uses passive rotation of coordinates, which has the opposite sign.

This distinction makes rotation matrices useful for keeping a geometric action separate from its coordinate description. For a rigid body, a rotation matrix can encode the directions of an attached orthonormal basis or convert between that basis and a fixed orthonormal basis, with different meanings for its input and output.^[ref]

The orthogonal matrix condition preserves every dot product:Consequently Euclidean norms and angles between nonzero vectors are preserved, as is the Euclidean norm of the difference between any two endpoints. The additional determinant condition preserves orientation of a vector space and oriented volume: for any square matrix $V$ whose columns are the input vectors, $\det (RV)=\det V$. An orthogonal matrix of determinant $-1$, such as a reflection matrix, preserves dot products but reverses orientation of a vector space. The matrix inverse is especially simple: $R^{-1}=R^T$.^[ref]

A matrix over a field $\mathbb{F}$ is in row echelon form when all zero rows follow the nonzero rows, each nonzero row's first nonzero entry lies strictly to the right of the preceding row's first nonzero entry, and all entries below each such leading entry vanish. These leading entries are its pivot elements. They need not be one, and entries above them need not vanish.^[ref]

The staircase turns a linear system into a sequence of simpler equations. For example,is in row echelon form, with pivot columns 1 and 2. Its second equation determines $x_2$ once $x_3$ is chosen; its first then determines $x_1$ by back substitution. It is not in reduced row echelon form, because the second pivot column contains a nonzero entry above its pivot element. Neither being square nor having a nonzero entry in every row is required.

Elementary row operations bring every matrix to row echelon form: choose a nonzero entry in the leftmost available nonzero column, interchange rows, clear entries below it, and repeat on the remaining rows and later columns. Skip columns with no remaining nonzero entry. Clearing above each pivot element and scaling it to one completes reduced row echelon form.^[ref]

The nonzero rows of an row echelon form are linearly independent: in a vanishing linear combination, inspecting the first pivot column forces the first coefficient to be zero, then the next forces the second, and so on. They give a basis of the original row space. The number of pivot elements is both the row rank and the column rank. To recover a basis of the original column space, select the corresponding original pivot columns; the reduced column vectors generally belong to a different column space.

Here the arithmetic is exact in the specified field. For floating-point arithmetic, deciding whether a computed entry counts as zero requires a numerical criterion; see Tiny-pivot roundoff in Gaussian elimination and condition number. An exact row echelon form classification alone does not settle numerical stability.

The row rank of a matrix is the dimension of the vector space spanned by its rows. Elementary row operations preserve this row space; multiplication on the right by an invertible matrix preserves all linear relations among the rows.

To see why row rank equals column rank, write a reduced row echelon form as $R=EA$, where $E$ is a product of elementary matrices and is an invertible matrix. Reversibility of the row operations gives equal row spaces for $R$ and $A$. Also $Rz=0$ if and only if $Az=0$, so the columns have exactly the same linear relations. If $R$ has $r$ nonzero rows, its pivot columns are the first $r$ standard basis vectors of ${\mathbb{F}}^m$ and span its column space. Its nonzero rows are linearly independent, since their matrix entries in the pivot positions form an identity matrix. Both dimensions therefore equal $r$, and both counts transfer back to $A$.

For paired observations $(x_i,y_i)$, the sample correlation coefficient isIt is the normalized inner product of the centered data vectors, or the sample covariance divided by the product of the corresponding sample standard deviations. The choice of divisor $n$ or $n-1$ cancels when used consistently in all three quantities. It is undefined if either centered data vector is zero, which occurs when that variable is constant in the observed statistical sample.

For $x=(1,2,3,4)$ and $y=(2,1,4,3)$, both sample means are $2.5$. The sum of centered products is $3$, and each sum of centered squares is $5$, hence the sample correlation coefficient is $3/5=0.6$. This is a summary of these four observed pairs; it is not automatically the population Pearson correlation coefficient. Philip Stark, Computing the correlation coefficient explains the centered and standardized calculation.

A scalar-valued function is a function whose codomain is a field, typically the real numbers or complex numbers. Its output is a single scalar, while its input can belong to an arbitrary set. For example, the square of the norm of a vector is real-valued. In a relativistic application, being scalar-valued alone does not establish Lorentz invariance: the transformation of the input and of the complete quantity must also be specified.

Let $M=\left(\begin{array}{cc}A& B\\ B^T& D\end{array}\right)$ be a real symmetric matrix with $A$ a positive-definite matrix. Its quadratic form satisfies the completing the square identityFor each fixed vector $y$, the unique minimizing vector is $x=-A^{-1}By$, so the minimized value is $y^{T}Sy$. Also, $M$ is a positive-definite matrix exactly when $S$ is a positive-definite matrix, under the stated assumption on $A$.^[ref]

An original scalar example isHere $A=2$, $B=1$, $D=3$, and the Schur complement is $5/2$. Holding $x=0$ would give $3y^2$, but letting $x$ relax to $-y/2$ reduces the quadratic form to $(5/2)y^2$. At $y=2$ the respective values are $12$ and $10$. Eliminating a variable therefore changes the effective cost of the retained variable.

This interpretation supports quadratic optimization and the positive-definite symmetric matrix tests used in Cholesky decomposition. In a multivariate normal distribution, a covariance matrix also gives a conditional covariance through a Schur complement; the required probabilistic hypotheses are supplied by conditional multivariate normal distribution, rather than by the algebra alone.

A search direction is the nonzero vector $p_j$ used in the displayed optimization update. In a line search with positive step size, its orientation matters: a descent direction has negative directional derivative of the objective function. Minimization over a full line instead permits either sign of ${\alpha }_j$.

For the outward unit normal on a three-dimensional sphere, the off-diagonal integrals vanish by reflection symmetry. The diagonal integrals are equal by rotational symmetry, and their sum is ${\int }_{S^2}|\mathbf{n}{|}^{2}d\Omega =4\pi$. This proves the displayed matrix identity, where ${\delta }_{ij}$ is the Kronecker delta. Contracting it with a constant vector gives ${\int }_{S^2}(\mathbf{U}\cdot \mathbf{n})\mathbf{n}d\Omega =(4\pi /3)\mathbf{U}$, useful for integrating far-field stress forces.

For real symmetric $A$, replace sign-vector lifts $x{x}^T$ by all matrices in the elliptope:Every sign vector gives a feasible rank-one matrix with the same objective, so the relaxed maximum is an upper bound. The omitted rank-one condition is substantive: an arbitrary feasible Gram matrix need not come from signs.

A family of seminorms separates points when every nonzero vector $z$ has $p(z)>0$ for some member $p$. Equivalently, its kernels of seminorms have intersection $\{0\}$, or any two distinct vectors $x,y$ have $p(x-y)>0$ for some $p$. Individual seminorms can have large kernels of seminorms; the whole family must have no common invisible direction.

The associated seminorm topology is Hausdorff if and only if the family separates points. Indeed, if $p(x-y)=a>0$, the neighbourhoods $\{u:p(u-x)<a/3\}$ and $\{v:p(v-y)<a/3\}$ are disjoint by the triangle inequality. Conversely, if every $p$ vanishes on a nonzero $z$, then zero and $z$ belong to exactly the same open sets and cannot be separated. This criterion keeps separation distinct from completeness: detecting all directions does not guarantee that all Cauchy sequences have limits.

A vector is separating for an operator algebra when evaluation at that vector is injective. A cyclic vector for the commutant of an operator algebra is separating for the original algebra: if $a\Omega =0$, then $a$ vanishes on its dense commutant orbit.