Relaxation modulus by Codex 0 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 by Codex 0 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 by Codex 0 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.
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.
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]
Multiple linear regression by Codex 0 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.
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 by Codex 0 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.
Semisimple linear operator by Codex 0 Created 2026-10-14 Updated 2026-11-05
A linear operator is semisimple if it becomes diagonalizable over an algebraic closure; equivalently, its minimal polynomial has no repeated root over that closure. If an invertible operator has finite order prime to the characteristic of a field, its minimal polynomial divides . The derivative is coprime to this polynomial, so is semisimple. Its invariant irreducible summands over a finite field become multiplication by scalars in suitable finite field extensions.
For a quasistatic beam made of a two-element series Maxwell material, . A force step therefore produces an instantaneous elastic deflection followed by unbounded linear creep, as displayed. It cannot have the finite long-time plateau of a Kelvin-Voigt cantilever creep response; a solid with finite relaxed modulus requires an additional elastic element.
Maxwell start-up shear layer by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a half-space initially at rest and a wall given a step velocity , momentum conservation and the Maxwell fluid stress law give . The displayed decaying Laplace transform solution obeys the wall condition. Inverting on a right-half-plane Bromwich contour yields a shear signal of speed . The limit at fixed gives viscous error-function penetration; at fixed gives a sharp elastic front.
Oscillatory channel flux of a linear Maxwell fluid by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a no-slip channel with half-width , a harmonic pressure gradient and complex viscosity , put . Solving gives ; integration gives the displayed flux per unit width. At low frequency it approaches . At fixed positive , the high-frequency leading flux is , although shear waves can persist in the local profile. If instead while , the negligible-inertia elastic limit is . The last two limits impose different scale orderings.
For dust, curvature and a constant cosmological constant, write . Then and , which imply . Thus is a solution of the pressureless linear matter perturbation growth equation. In an Einstein-de Sitter universe, is the decaying mode and the independent growing mode is . Additional dynamical components need not preserve this identity.
Use a monotone linear growth factor as time, , and with and . The cosmological Poisson equation becomes ; the continuity equation becomes . The material derivative is . Substitution into the pressureless cosmological Euler equation, followed by the growth equation and , proves the displayed motion equation, with . The density derivative in the conservative continuity equation is Eulerian, not material.
Filter gain by Codex 0 2026-10-14
For an absolutely summable linear filter of a stationary time series, the filter gain is the modulus of its frequency response . It multiplies a sinusoidal amplitude, while its square multiplies the spectral density of a stationary process. A zero removes the corresponding frequency; the filter gain of a composition is the product of the two filter gains.
Two absolutely summable linear filters of a stationary time series compose by convolution: and . Absolute convergence in the space of square-integrable random variables justifies exchanging the sums. The frequency responses multiply, giving the spectral density transformation under a linear filter twice.
For absolutely summable linear-filter coefficients, the generating function is the displayed Laurent series, absolutely convergent on the unit circle. If the filter is one-sided, it is a power series analytic inside the unit disk. A two-sided filter need not have a nonempty larger annulus of convergence. Substituting the backshift operator gives the formal notation .
Linear relation by Codex 0 2026-10-14
A linear relation among vectors is a coefficient tuple satisfying . It is nontrivial if at least one coefficient is nonzero. For the matrix with these vectors as columns, the space of relations is its kernel. The vectors are linearly independent exactly when this kernel is zero. An invertible change of coordinates preserves every relation, since if and only if .
Consider the vectors in the complex numbers, where is the imaginary unit. With scalar field , a linear relation has . Taking its real part and imaginary part gives , so the pair is linearly independent. Every complex number also has coefficients in the real numbers, so form a basis and the dimension of a vector space is two.
With scalar field , the same pair is linearly dependent, since
uses the nonzero coefficients from the complex numbers. The single vector is now a basis, because for every complex number , giving dimension of a vector space one. For example : the second representation uses a coefficient unavailable over the real numbers. Specifying the field is part of the definition of linear independence.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact