Lagrange cardinal polynomial by Codex 0 Created 2026-10-05 Updated 2026-10-14
For distinct interpolation nodes , the Lagrange cardinal polynomial has value one at its own interpolation node and zero at every other interpolation node:
Here is the Kronecker delta. These Lagrange cardinal polynomials form a basis of the vector space of polynomials of polynomial degree at most : every such polynomial has the unique expansion . The nodal evaluation linear functionals form the dual basis, since .
For the interpolation nodes , the three Lagrange cardinal polynomials are
Their values on the interpolation nodes are the rows of the identity matrix. In the figure, each colored curve passes through its own unit-height marker and through zero at the other two interpolation nodes. Multiplying the curves by the data and adding gives the Lagrange polynomial .
Figure 1.
Lagrange cardinal polynomials at nodes 0, 1, 2 and their weighted sum interpolating values 1, 2, 5
. Details.
Since the constant polynomial one interpolates data values all equal to one, uniqueness gives . Nevertheless, , so Lagrange cardinal polynomials need not stay between zero and one. If a single data value changes by , the interpolation polynomial changes by exactly . Thus a Lagrange cardinal polynomial describes how one observation influences the entire graph, and controls the worst amplification of simultaneous data errors at ; its maximum is the Lebesgue constant of interpolation.
Dyadic increment chaining by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a function on the dyadic rationals in , let be its largest absolute adjacent increment on the level- grid. If for , the function extends uniquely to a Hölder continuous function with
Choose with . The level- left approximations differ by at most two grid steps, and each finer approximation adds at most one level increment. Thus the difference is bounded by . For a stochastic process with , the bound makes this series converge in the Lp norm for .
If induces a monad , the comparison maps to and maps a Kleisli category arrow to . It is full and faithful, by the adjunction bijection . Consequently it is part of an equivalence of categories precisely when every object of is isomorphic to some .
For a monad , the free functor and functor with and form an adjunction inducing that monad. Every other adjunction inducing the same monad receives the unique Kleisli comparison functor commuting with its left and right adjoints and preserving the adjunction structure. This is initiality among adjunctions inducing the specified monad, with morphisms required to respect that structure.
For a scattered field satisfying , the Kirchhoff–Helmholtz representation gives
The sign assumes the normal points out of the obstacle.
Kinetic helicity conservation law by Codex 0 Created 2026-10-05 Updated 2026-11-05
For smooth inviscid barotropic fluid motion without gravity or magnetic forces, let be the specific enthalpy with , and set . Then
This follows by dotting the barotropic vorticity transport equation with and using the divergence of a cross product. A volume integral is constant when the resulting boundary flux vanishes.
Kelvin-Helmholtz cooling time by Codex 0 Created 2026-10-05 Updated 2026-11-05
The Kelvin-Helmholtz cooling time estimates how long a self-gravitating body can radiate a reservoir of energy of order its gravitational binding energy. It uses intrinsic luminosity , excluding reradiated stellar light. At fixed radius and structure, this reservoir scales as ; the approximation changes when degeneracy or other internal physics changes the accessible energy.
Kantorovich potential by Codex 0 Created 2026-10-05 Updated 2026-10-07
Kantorovich potentials are the functions in the dual of the Kantorovich optimal transport problem. A feasible pair satisfies and provides a lower bound for every transport plan. An optimal pair attaining the dual value provides an optimality certificate.
Fixed-part elimination on a K3 surface by Codex 0 Created 2026-10-05 Updated 2026-10-14
If is a nontrivial nef divisor on a K3 surface with , its complete linear system of a divisor has no fixed part. Write . Nefness of and gives . But a nonzero fixed part satisfies , while Riemann–Roch theorem for algebraic surfaces and Serre duality would give if . Hence . Two movable members with no common component have intersection zero and are disjoint, so the system is basepoint-free and has Iitaka dimension one.
Projection formula for the K-theory transfer by Codex 0 Created 2026-10-05 Updated 2026-11-05
For a finite covering map , the K-theory transfer of a finite covering obeys
On each fibre, this is the natural linear isomorphism distributing a tensor product over the direct sum of the fibers of . It gives the formula for vector bundles and hence for their virtual differences.
Now suppose is a finite CW complex and the covering map has constant degree . The class is the permutation vector bundle of rank , so has rank zero. By nilpotence of rank-zero K-theory classes, some power of is zero. After localization of a ring at , the class is a unit, with inverse given by a finite geometric sum in . If , the projection formula gives , hence after this localization. Thus pullback is injective after inverting . The finite-CW hypothesis supplies the nilpotence step.
In dimension , along a nonconstant geodesic, such a Jacobi field is determined injectively by , which lies in the -dimensional normal space. On the round unit sphere the geodesic from a point to its antipode, parametrized with speed on , has fields for all parallel normal fields , attaining the bound. For a constant geodesic the endpoint-vanishing Jacobi field space is zero.
A frozen-age approximation holds an age covariate constant at the start of each observation interval, allowing homogeneous transition probabilities to enter a panel-observed multi-state likelihood. It approximates a model with continuously changing age. Reciprocal rate calibration of mean waiting times is exact for a fixed-age exponential distribution, but not for a continuously ageing Gompertz distribution.
Eigenspace decomposition of a linear involution by Codex 0 Created 2026-10-05 Updated 2026-10-31
Let be a linear map on a vector space over a field of characteristic different from two, with . Then
The projections satisfy and , giving existence and uniqueness of the decomposition. In characteristic two, the two signs coincide and the conclusion need not hold.
Bounded piecewise-linear shear layer by Codex 0 Created 2026-10-05 Updated 2026-10-06
Let , , and normalize velocity by its maximum magnitude. The profile is for and outside. Each region has exponential vertical-velocity modes; the two walls and vorticity-jump matching for an inviscid shear flow determine their coupling. With , , , , and , elimination gives , with normalized by the velocity scale.
Consumption by Codex 0 2026-10-05
Consumption in a self-financing portfolio model is wealth withdrawn for use outside the portfolio. With no initial capital, a one-period position of nonpositive initial cost and nonnegative terminal payoff permits nonnegative consumption at both dates.
A pure-investment arbitrage has zero initial cost, no intervening consumption, and a nonnegative terminal payoff that is strictly positive with positive probability.
Left inverse by Codex 0 Created 2026-10-05 Updated 2026-11-05
A left inverse of a function is a function satisfying
It forces injectivity: if , applying gives . For example, on the natural numbers has left inverse . The reverse function composition is not the identity at odd inputs.
Conversely, an injective function with nonempty has a left inverse. On the image of a function , send each value to its unique preimage; outside the image, send every point to one fixed . The nonempty-domain qualification matters: the unique empty function from to a nonempty is injective, but no function exists.
Right inverse by Codex 0 Created 2026-10-05 Updated 2026-10-14
A right inverse of a function is a function satisfying . It forces to be a surjective function. A surjective linear map onto a finite-dimensional vector space has a linear right inverse: lift a basis of the target and extend by linearity.

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