Local degrees of arbitrary integer value 2026-10-14
In dimension two, for positive has local degree at zero, and has degree for negative . The proper map has isolated zero fiber and local degree zero, since its image misses every nearby nonreal target. These proper maps extend to the two-sphere. Taking their product with the identity of realizes the same local degrees in every dimension . In dimension one an isolated local degree is restricted to .
Orientation local system 2026-10-14
Its fiber at is . Transport changes its generator by the sign of local orientation along the path. For a connected nonorientable manifold, its degree-zero cohomology is zero, because no nonzero integer is invariant under sign reversal, whereas its degree-zero homology is , the coinvariants under that reversal.
List-chromatic index 2026-10-14
The list-chromatic index is the least integer such that every assignment of at least allowed colors to each edge admits a list edge coloring. Uniform identical lists show it is at least the chromatic index. The Galvin theorem for bipartite list edge coloring gives equality for bipartite graphs.
Rational Lagrangian submanifold 2026-10-14
For a Lagrangian submanifold in an exact symplectic manifold with primitive , its period subgroup is . It is rational when this subgroup is discrete. If it is nonzero, it is for a unique . Some conventions reserve the word rational for this nonzero case. The zero subgroup corresponds to an exact differential form ; its least positive period is interpreted as if that endpoint convention is admitted.
For a smooth nonconstant holomorphic disk in with boundary on a Lagrangian submanifold , its symplectic area is . The Cauchy-Riemann equations give , so this is the pullback of the standard symplectic form. The Stokes theorem identifies the area with the period of a primitive along the boundary loop. Thus the Liouville class of a Lagrangian submanifold evaluates nontrivially on this loop and cannot vanish.
Logit 2026-10-14
The logit link maps a mean probability to its log odds: , . Its inverse is , used in logistic regression.
Identity link Created 2026-10-14 Updated 2026-10-20
The identity link function equates the response mean with the linear predictor. In a generalized linear model it gives . It is the canonical link function for the normal distribution. For response families whose means must remain positive or between zero and one, using the identity link requires corresponding restrictions on the linear predictor.
For with fixed endpoints, initial displacement zero and initial velocity a Dirac delta at , the Fourier sine series coefficient of that velocity is . Each coefficient evolves by . Here . At critical damping, replace by ; for an overdamped mode replace it by . The initial conditions hold in the sense of distributions.
Displacement equation for a parallel magnetic shear flow Created 2026-10-14 Updated 2026-11-05
For nonresonant incompressible normal modes of a uniform-density shear flow with aligned uniform magnetic field, let , and . The normal displacement is . The linearized horizontal equations and incompressibility give . Substituting the ideal magnetohydrodynamic induction equation into normal momentum gives the displayed conservative equation. Across a zero-thickness shear layer, continuity of and of supplies the interface conditions. They express common normal displacement and continuous perturbed magnetohydrodynamic total pressure, avoiding undefined products of distributional shear gradients.
Uniform linearized chord diagram 2026-10-14
Pair linearly ordered endpoints uniformly. Each pair is a chord; its larger endpoint ends a vertex block, with all endpoints after the previous right endpoint merged into that vertex. Orient the chord from its right-endpoint block to its left-endpoint block. Removing the last endpoint and its mate leaves a uniform smaller pairing. Reinserting the mate into one of equally likely gaps chooses an existing block proportionally to its endpoint count, or the final gap creates a self-loop. This proves equivalence with the linearized chord diagram model.
An equivalent continuous representation draws independent pairs of independent uniform points on , orders the pairs by their maxima , and calls their minima . The are uniform order statistics; conditional on all the , the are independent uniform points on .
First-vertex degree in the LCD model 2026-10-14
In a uniform linearized chord diagram, . Conditional on the right endpoints, , with independent success probabilities . A Chernoff bound gives uniformly for . The early indicators are , and the remaining conditional mean is . Their conditional variance is . Hence in probability, proving the displayed tail limit. A self-loop's contribution is included in the constant two.
Relaxation modulus Created 2026-10-14 Updated 2026-11-05
The relaxation modulus is the shear-stress response at lag s to a unit small step of shear strain. By linear superposition it is the causal memory kernel multiplying shear rate. Its decaying part represents stored stress that relaxes after deformation ceases.
Complex viscosity Created 2026-10-14 Updated 2026-11-05
For the convention , complex viscosity is the ratio of oscillatory shear stress amplitude to shear rate amplitude. A causal relaxation modulus gives the displayed transform. Its associated complex shear modulus is , where is the storage modulus and the loss modulus.
Creep compliance Created 2026-10-14 Updated 2026-11-05
A small step of shear stress produces shear strain from a relaxed state. This time-dependent deformation under held stress is creep. The causal constitutive convolution gives , proving the displayed Laplace transform relation. For a Maxwell fluid, : an elastic jump followed by viscous flow.
Exponential forcing of a constant-coefficient differential system Created 2026-10-14 Updated 2026-10-25
For , substituting an exponential particular solution reduces the differential equation to . The displayed solution exists whenever is not an eigenvalue of . Resonance can require polynomial factors in time. The general solution adds , expressed using the matrix exponential.
Normal equations for linear least squares 2026-10-14
Minimizing gives the displayed equations by differentiation. Equivalently, the regression residual satisfies : it is orthogonal to every column of the design matrix. If has full column rank, the minimizer is unique and the fitted values are the orthogonal projection of onto its column space. A rank-deficient design matrix can give multiple coefficient vectors, while the projected fitted vector is still unique.
For an intercept and one predictor, put and . The equations give and , provided . In the five-point example in linear regression, , , and , giving and .
The normal equations describe the mathematical optimum, but explicitly forming and inverting can amplify numerical problems. A QR decomposition computes the same least-squares solution through orthogonal coordinates; a singular value decomposition also exposes nearly dependent columns. This connects statistical fitting to numerical linear algebra and the choice of a stable algorithm. [ref]
https://ocw.mit.edu/courses/18-06sc-linear-algebra-fall-2011/. MIT 18.06SC, Projections onto Subspaces and Least Squares
Multiple linear regression Created 2026-10-14 Updated 2026-10-18
Multiple linear regression models a scalar response by an intercept and several predictors. It is linear in the regression coefficients, even when predictors include transformed variables or interactions. In an observational study, adjustment can address measured confounding, but does not automatically identify a causal effect. Improvements in fitted coefficient of determination require external predictive assessment rather than being treated as proof of improved future prediction.
For a square invertible constraint matrix in , suppose and . This fixed dual vector stays optimal under a changed right-hand side exactly when . Sufficiency follows from primal feasibility and equal primal/dual objectives. Necessity follows from complementary slackness: since every is positive, every optimal primal constraint must bind, forcing . The inequalities define the whole validity cone, including degenerate boundary optima.
Operator commutator 2026-10-14
The commutator measures failure of two operators to commute, on a common domain where the products are defined. Direct expansion gives . A common eigenvector of lies in the kernel of , so an injective commutator excludes all nonzero common eigenvectors. A nonzero commutator need not itself be injective, and therefore does not alone exclude an individual common eigenvector.
Locally nilpotent operator Created 2026-10-14 Updated 2026-11-05
A linear operator is locally nilpotent if for each vector there is an integer such that . In finite dimension this is equivalent to being a nilpotent operator. Differentiation on the polynomial ring is locally nilpotent in characteristic zero but has no uniform nilpotence exponent.
There are unlisted articles, also show them or only show them.