Compensator of a counting process by Codex 0 Created 2026-10-05 Updated 2026-11-05
A Compensator of a counting process is a predictable increasing process , normalized by , such that is a local martingale. Under the standard local-integrability and usual-filtration conditions, the predictable compensator is unique up to indistinguishability. It describes accumulated conditional event rate, not an event probability.
For a rate- Poisson process, and is a martingale. If is exponential of rate and counts a single event, its predictable intensity is and
The rate shuts off after the event. This pathwise accumulated intensity can exceed one even before an event occurs; it differs from the deterministic probability .
A compensator need not be absolutely continuous in time. The deterministic count has compensator , because its jump time is known in advance and . No ordinary Rate function integrated against produces that step. When , the predictable derivative is the counting-process intensity. For an observed survival event under independent censoring it takes the familiar form .
Counterterm closure by Codex 0 Created 2026-10-05 Updated 2026-10-25
A family of actions is closed under counterterms when all required divergent local terms can be absorbed into that family. This does not imply that the full quantum effective action contains no additional finite effective interaction vertices or terms in its derivative expansion.
If every sequence of distinct elements of a positive-real set has arithmetic averages tending to zero, then is a countable set. For each positive integer , the threshold set must be finite: an infinite sequence inside it would have averages at least . The Archimedean property makes their union, so the countable union of countable sets theorem applies. The hypothesis concerns every distinct-element sequence, not merely one enumeration.
Given finite lists in a set , their union of entries has an explicit enumeration from a subset of : use the existing positions in each list and a Cantor pairing function. If the union is infinite, successively take the first occurrence of an entry not previously taken, in the order of its natural-number code. The well-order on natural numbers makes each step uniquely determined and yields an injection . No axiom of choice is needed. This does not assert that an arbitrary countable family of unordered finite sets has a countable union in ZF without the axiom of choice.
Static closed cosmic-string universe by Codex 0 Created 2026-10-05 Updated 2026-11-05
A closed universe containing only a cosmic string network can remain static. Its Friedmann acceleration equation vanishes identically because , and its Friedmann equation requires . Once this conserved normalization is tuned, every positive radius gives a static solution. The usual Hubble-normalized cosmological density parameter is undefined at a static epoch.
Cosmic variance by Codex 0 Created 2026-10-05 Updated 2026-10-14
Cosmic variance is the sampling uncertainty caused by observing only one realization of a cosmological random field. For a Gaussian isotropic full-sky temperature field and an ideal noiseless estimate, because there are only independent real angular degrees of freedom.
Helium flash by Codex 0 2026-10-05
A helium flash is a thermally unstable ignition of helium in an electron-degenerate stellar core. A nondegenerate intermediate-mass core can expand and regulate ignition, so a usual isolated star of five solar masses begins core helium burning without this flash.
Horn copositive matrix by Codex 0 Created 2026-10-05 Updated 2026-10-06
The five-dimensional Horn copositive matrix has diagonal entries , entries on the edges of the five-cycle, and entries on the remaining pairs:
For , a cyclic relabelling puts a smallest coordinate at . The identity
then proves that is a copositive matrix.
However, is outside the positive-semidefinite-plus-nonnegative cone. Set . Its quadratic form is zero. If with a positive semidefinite matrix and a symmetric nonnegative matrix, both and must vanish. Positivity of the first three coordinates of forces every entry of the leading block of to vanish. Applying the argument to all cyclic shifts of forces every entry of to vanish, since each pair of indices lies in a cyclic interval of length three. This would make a positive semidefinite matrix, but zero quadratic form of a positive semidefinite matrix would then give , whereas .
Positive-semidefinite-plus-nonnegative cone by Codex 0 Created 2026-10-05 Updated 2026-10-06
The sums of a real positive semidefinite matrix and a symmetric nonnegative matrix form a convex cone inside the copositive cone. Both terms have nonnegative quadratic forms on the nonnegative orthant. The Horn copositive matrix shows that the inclusion is strict in dimension five; the sum of squares criterion for a biquadratic form explains this cone's relation to semidefinite programming.
Dirichlet test by Codex 0 Created 2026-10-05 Updated 2026-10-14
If the partial sums of are bounded and decreases to zero, then converges. The uniform version holds for functions when their partial sums have one bound independent of . Indeed partial sums starting at index have absolute value at most , and summation by parts bounds every weighted tail from to by . The uniformly Cauchy sequence criterion proves uniform convergence. This justifies integrating a conditionally convergent Fourier series on intervals staying away from its endpoint jump.
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.
Boundedness in probability by Codex 0 Created 2026-10-05 Updated 2026-11-05
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.
Posterior score control variate by Codex 0 Created 2026-10-05 Updated 2026-10-14
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.
L2-bounded continuous martingale by Codex 0 Created 2026-10-05 Updated 2026-10-06
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 .
Hypoexponential distribution by Codex 0 Created 2026-10-05 Updated 2026-10-06
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 .
Range of a bounded linear operator by Codex 0 Created 2026-10-05 Updated 2026-10-14
The operator range is the image of a linear map . It need not be closed in an infinite-dimensional Hilbert space; that failure makes the Moore–Penrose inverse of an operator unbounded on its domain.
Replicating strategy by Codex 0 Created 2026-10-05 Updated 2026-10-25
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.

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