Right-linear grammar by Codex 0 Created 2026-10-05 Updated 2026-10-31
A right-linear grammar has productions of the form or , where are nonterminals and is a terminal word, possibly empty. Each right-hand side has at most one nonterminal, at its right end. Such grammars generate exactly regular languages: regard nonterminals as states and expand each terminal word into a finite path to another state or an accepting endpoint. Conversely the transition graph of a deterministic finite automaton gives these productions directly.
Absoluteness of constructible levels by Codex 0 Created 2026-10-05 Updated 2026-10-06
For a transitive model of ZFC and , the internally computed constructible hierarchy agrees with the ambient level: . Satisfaction for a fixed set structure is computed from the same finite formulas and the same domain in both universes. Transfinite recursion then proves agreement at successors and limits. If , it follows that .
Fluctuation-dissipation relation for a conserved flux by Codex 0 Created 2026-10-05 Updated 2026-11-05
For the flux of a vector order parameter, microscopic reversibility requires independent Gaussian white noise components with covariance
The current changes sign under time reversal. The resulting path-probability ratio contributes to its logarithm; integration by parts converts this to the free-energy loss from the conserved dynamics.
Order-parameter mobility by Codex 0 Created 2026-10-05 Updated 2026-11-05
The positive order-parameter mobility relates the diffusive transport flux to the chemical potential gradient: . Combining this law with local conservation gives the Cahn--Hilliard equation when is the functional derivative of a composition free energy.
Angular-momentum flux by Codex 0 Created 2026-10-05 Updated 2026-10-14
The rate at which angular momentum crosses a surface, including advection and stresses. With positive inward mass accretion rate, the net inward flux in a steady accretion disk is .
Spin connection by Codex 0 Created 2026-10-05 Updated 2026-10-07
In an orthonormal frame, the spin connection is the Lorentz connection acting on spinors. With , its covariant derivative is . The metric connection determines when torsion conditions are specified. A zweibein gives its two-dimensional form; omitting it on a curved worldsheet generally destroys covariance.
One-particle-reducible Feynman diagram by Codex 0 Created 2026-10-05 Updated 2026-10-25
A connected Feynman diagram is one-particle reducible if cutting one internal propagator disconnects it. These diagrams occur in connected correlation functions but do not contribute to a quantum effective action defined by a Legendre transform. For a strict Wilsonian effective action, a bridge also cannot be a high-momentum propagator when the sum of external momenta on one side lies below the integrated shell.
Amputated connected correlation function by Codex 0 Created 2026-10-05 Updated 2026-11-05
An amputated connected correlation function is obtained by removing external propagators. Amputation using full propagators eliminates external self-energy decorations; internal exchange diagrams remain. It is distinct from a one-particle-irreducible correlation function. In a scalar theory with vanishing one-point function, at zero momentum the four-point quantity satisfies with a convention in which connected diagram vertices are minus effective-action derivatives. For a constant scalar source, the Legendre relation gives and . Dividing by the four full external propagators proves the formula.
Scalar curvature under conformal rescaling by Codex 0 Created 2026-10-05 Updated 2026-10-07
In dimension , the conformal rescaling of a Riemannian metric changes the Ricci scalar by the displayed formula. In two dimensions the gradient-square term vanishes; for a flat base metric, .
For independent and identically distributed random variables that are integrable random variables, with , symmetry gives . The decreasing sigma-algebras generated by these future sums permit application of the reverse martingale convergence theorem.
Conditional Jensen inequality by Codex 0 Created 2026-10-05 Updated 2026-11-05
Let be a real integrable random variable, let be a sub-sigma-algebra, and let be a finite convex function with integrable. Then
almost surely. These explicit integrability assumptions make both conditional expectations well defined.
A finite convex function on the real line is the supremum of a countable family of supporting affine functions, for example choosing supports at rational points and using continuity. Write them as . For each , monotonicity and linearity of conditional expectation give . Countability permits one exceptional null set for every . Taking the supremum proves the inequality.
With and square-integrable , the inequality says that retaining only the information in cannot increase its second moment. More generally it is the convex-loss step behind the Rao-Blackwell theorem.
Conditional density by Codex 0 Created 2026-10-05 Updated 2026-11-05
Where the marginal density is positive, a joint probability density determines the conditional density
It integrates to one in , and supplies conditional expectations by integrating against it. Its values on a probability-zero set of conditioning points are not fixed by the joint probability distribution.
Sparse vector by Codex 0 2026-10-05
A vector is s-sparse if it has at most nonzero coordinates. For , its best s-term approximation error is , equal to the sum of the absolute values of the coordinates outside the largest .
Basis pursuit by Codex 0 2026-10-05
Basis pursuit minimizes an norm subject to exact linear measurements. Basis pursuit with a noise tolerance replaces the equality by . A unique minimizer has linearly independent active columns, and hence at most nonzero coordinates: a null direction on its support would make the objective locally affine on a feasible line, contradicting minimality or uniqueness.
Restricted isometry property by Codex 0 Created 2026-10-05 Updated 2026-10-06
The restricted isometry property controls uniformly over sparse vectors. It supplies quantitative near-orthogonality of disjoint sparse coordinate combinations, not merely normalization of individual columns.
Complex conjugation sends a complex number to its complex conjugate . It is an involution and a field automorphism of , with fixed field . Applied componentwise to a complex vector, it produces the conjugated vector appearing in a Choi state for a rank-one Kraus operator.
Polish space by Codex 0 Created 2026-10-05 Updated 2026-10-06
A Polish space is a topological space whose topology can be induced by a complete separable metric. The completeness requirement concerns some compatible metric; it need not hold for every metric inducing the topology. Euclidean spaces are examples.
For a nonempty complete linear system of a divisor on a smooth projective variety, the coefficient of a prime divisor in its fixed part is the minimum of its multiplicities in all members. Multiplication by the section of identifies the sections of with those of .
The movable part is , where is the fixed part. It has no fixed components. On a smooth algebraic surface its associated divisor is nef: for each curve choose a member avoiding that curve and use nonnegative local intersection multiplicities.

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