For massless collisionless neutrinos in Newtonian gauge in cosmology, expand their temperature fluctuation as , without a factor. The Legendre polynomial recurrence relation gives
The lower-neighbour term is absent at . Multipoles with the more usual weighting equal .
Neutral D-meson mixing by Codex 0 Created 2026-10-05 Updated 2026-11-05
Neutral D-meson mixing is the time evolution between the flavor states and . The states with definite propagation masses and decay widths are generally superpositions of these flavor states, so an initially tagged flavor need not remain unchanged before decay.
A measurement tags the production flavor and compares time-dependent rates into selected final states. Some final states can be reached both directly and after mixing, producing interference; a wrong-flavor candidate is therefore not automatically a pure mixing event. The effective two-state Hamiltonian includes both dispersive and absorptive parts. Separating mixing, direct suppressed decays and detector charge asymmetries is part of the inference.[ref]
CPT constraints on neutral-meson mixing by Codex 0 Created 2026-10-05 Updated 2026-10-14
CPT symmetry equates the diagonal entries of the decay-effective Hamiltonian operator. It does not make this effective matrix Hermitian operator; its imaginary diagonal part describes a total decay width.
Multiderivative multistep method by Codex 0 Created 2026-10-05 Updated 2026-10-14
A multiderivative multistep method uses higher time derivatives as well as values and first derivatives from several time levels. For an autonomous ordinary differential equation , the second time derivative is by the chain rule. Its local truncation error must include the higher-derivative terms. Consequently the usual second-order barrier for A-stable linear multistep methods, which only use first derivatives, does not apply.
The Cauchy principal value
defines a distribution. Near zero the odd constant contribution cancels, and the remaining numerator is . It satisfies . Hence all solutions of are by the kernel of multiplication by a coordinate.
For smooth and a point ,
These follow by applying both sides to a test function and using the Leibniz rule. In particular .
If a smooth function on has finitely many zeros , all simple, then exactly when . Away from the zeros, divide a test function by the nonvanishing to show vanishes. Near , write with smooth nonzero . The kernel of multiplication by a coordinate, after translation and multiplication by , says that the local distribution is a multiple of . A partition of unity gives the global sum. Simplicity of the zeros excludes derivatives of deltas.
Multilinear reduction on the Boolean cube by Codex 0 Created 2026-10-05 Updated 2026-11-05
Replace each positive power in a monomial by and combine equal monomials. The result is a multilinear polynomial agreeing with the original polynomial at every point of , because there for . Its polynomial degree does not increase. This reduction identifies polynomial functions on the Boolean lattice with their unique square-free monomial representations: uniqueness follows by successively evaluating at characteristic vectors of sets in increasing order of size.
Homogenisation on a uniform layer by Codex 0 Created 2026-10-05 Updated 2026-10-06
On the uniform layer of the Boolean cube , every multilinear polynomial of polynomial degree at most is in the span of the degree- square-free monomials. For , , and , the identity is
At the characteristic vector of a set of size , both sides vanish if . Otherwise exactly summands are . Hence the dimension of the restricted polynomial space is at most . No assertion of independence of the spanning monomials is needed, so no condition is required. Unlike ordinary homogenization, this operation preserves degree bounds by using the fixed-weight evaluation domain.
Multilinear map by Codex 0 Created 2026-10-05 Updated 2026-10-14
A multilinear map is a map between vector spaces that is linear in each argument when all other arguments are fixed. For example the evaluation is bilinear, and the determinant is multilinear in its columns. The universal property of a tensor product replaces this separate linearity by a single linear map from .
Transport map by Codex 0 2026-10-05
A transport map from to is a measurable function satisfying . Its graph defines the transport plan .
Idempotent monad by Codex 0 2026-10-05
A monad is idempotent when its multiplication is invertible. Then . If is an algebra for a monad, its unit law and naturality give and . Thus every algebra is isomorphic to a free algebra, and the Kleisli comparison functor into the Eilenberg-Moore category is an equivalence.
Shift monad on order-preserving maps of natural numbers by Codex 0 Created 2026-10-05 Updated 2026-10-06
Let be the monoid of order-preserving functions , with , regarded as a one-object category. The endofunctor fixes that object and sends to , . The displayed maps give its monad unit and multiplication. The multiplication is not injective, so this is not an idempotent monad. Its only algebra for a monad is , because forces and monotonicity forces . Algebra endomorphisms are exactly the functions fixing zero. The Kleisli comparison functor sends to the function which is zero at zero and equals at ; its inverse sends to . Thus the comparison is an isomorphism of categories even though the monad is not idempotent.
Mass second-moment tensor by Codex 0 Created 2026-10-05 Updated 2026-10-06
The mass second-moment tensor about a centre of mass is . It measures the shape of a mass distribution and appears in tidal torque theory. It differs from the mechanical inertia tensor, which is . For a uniform ellipsoid of mass and semiaxes , its principal values are .
Mumford's compactness theorem by Codex 0 Created 2026-10-05 Updated 2026-10-14
The subset of the unmarked moduli space of Riemann surfaces with hyperbolic systole at least is compact for fixed genus . Use a Bers pants decomposition theorem bound, finitely many topological decomposition types and Dehn twists to place representatives in finitely many compact boxes in Fenchel–Nielsen coordinates.
Indecomposable module by Codex 0 Created 2026-10-05 Updated 2026-10-14
A nonzero module is indecomposable if it cannot be expressed as a direct sum of two nonzero submodules. The zero module is excluded. A module of finite composition length is indecomposable exactly when its endomorphism ring has no idempotents other than zero and one: an idempotent splits the module into its image and kernel.
Uniform module by Codex 0 Created 2026-10-05 Updated 2026-10-06
A nonzero module is uniform if every pair of nonzero submodules has nonzero intersection. Equivalently, every nonzero submodule is an essential submodule. A right Noetherian domain is uniform as a right module: if for nonzero , the right ideals , , form an infinite direct sum, contradicting the ascending chain condition.
Modular representation ring by Codex 0 Created 2026-10-05 Updated 2026-10-14
The modular representation ring is the Grothendieck group of finite-dimensional group representations, with relations for every short exact sequence , and multiplication using the tensor product of group representations. The Jordan–Hölder theorem makes the classes of simple modules a free integral basis. Tensoring over a field is exact, so this multiplication is well defined. When is a splitting field for finite group representations, Brauer characters identify with the algebra of complex class functions on p-regular elements. The splitting hypothesis is essential: has two simple modules, although has three -regular conjugacy classes.
Weak modular form by Codex 0 2026-10-05
Here a weak modular form is a holomorphic function on the complex upper half-plane satisfying the weight- transformation law, with no growth condition at any cusp of a modular group. This convention differs from weakly holomorphic modular forms, which are required to be meromorphic at the cusps. At level one, translation invariance gives a Laurent expansion on the punctured unit disc, possibly with infinitely many negative powers.
Oldform by argument dilation by Codex 0 Created 2026-10-05 Updated 2026-11-05
If and , then . Conjugating by changes a lower-left matrix entry to , which is divisible by . A rational upper-triangular factorization at every cusp preserves boundedness and hence cusp holomorphy.

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