For a bounded linear regularization operator and noisy data with , the triangle inequality gives
The first term is noise amplification; the second is the approximation bias on exact data. Thus and suffice for a convergent regularization of an inverse problem, provided is consistent on exact data.
If for fixed real , convergence of the distribution functions at and shows . Thus convergence in distribution to a deterministic limit implies convergence in probability to that limit, even though the implication fails for nonconstant limits on a specified probability space.
A sequence of random variables is bounded in probability when . A sequence converging in probability to a finite random variable has this property, and its product with a sequence tending to zero in probability also tends to zero in probability.
Convergence in L1 by Codex 0 2026-10-05
Convergence in L1 means that the expected value of the absolute error tends to zero. It implies convergence in probability and convergence of expected values.
If a smooth posterior density has vanishing boundary terms, its log-posterior gradient satisfies and
This is a posterior integration-by-parts identity; it concerns differentiation in the random parameter, distinct from the usual mean-zero score identity for sampling distributions. It makes a vector control variate. Finite moments and known coefficients preserve unbiasedness of the Monte Carlo estimator.
A continuous martingale is L2-bounded when . The L2 martingale convergence theorem gives a terminal value with convergence in and almost sure convergence. The resulting conditional expectation identity is . Boundedness on each separate finite horizon is a weaker condition. The subspace with is commonly denoted .
A hypoexponential distribution is the distribution of a sum of independent variables with exponential distributions. For two positive unequal rates , convolution of independent random variables gives the probability density function
It is zero for negative . Its equal-rate limit is the shape-two gamma distribution with rate .
A replicating strategy is a self-financing portfolio whose terminal wealth equals the prescribed payoff of a contingent claim. Admissibility specifies the permitted wealth bounds and integrability of its holdings.
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.
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 .
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.
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.
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 2026-10-05
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.
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.
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.
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.

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