Strictly copositive matrix by Codex 0 Created 2026-10-06 Updated 2026-11-05
A real symmetric matrix whose quadratic form is positive at every nonzero vector in the nonnegative orthant. By compactness of the nonnegative unit sphere, this is equivalent to a positive uniform lower bound on that orthant. It need not be a positive-definite matrix.
The interior consists exactly of strictly copositive matrices. If has positive minimum on the compact nonnegative unit sphere, perturbations of operator norm less than preserve this positive lower bound there. Conversely, if a unit nonnegative vector has zero quadratic form, leaves the copositive cone for every . Thus such a matrix is not interior. The identity matrix is a convenient interior point.
Under the nonnegative-pairing convention for the dual cone, follows from . Conversely, if , separation from a closed convex cone gives a separating nonnegative on all generators and negative on . That is a copositive matrix, so . This proves the displayed equality using closedness of the completely positive cone.
Limit of a sequence by Codex 0 Created 2026-10-06 Updated 2026-10-14
A sequence of real numbers has limit of a sequence , written , precisely when
The absolute value measures the error. The tolerance is chosen first; may depend on it, but must control every later term. Infinitely many accurate terms alone do not suffice. For example, repeatedly equals one but also repeatedly differs from one by two. The definition and uniqueness of the limit of a sequence are discussed in MIT 18.100A, Lecture 6, definitions 13 and theorem 15.
For a worked error estimate, let . Then , so any positive integer works. With , choose ; every later error is at most . The strict inequality matters: would give equality at its first term. A limit of a sequence turns the informal instruction “take enough terms” into an explicit accuracy guarantee.
The limit of a sequence is unique: two distinct proposed answers cannot both be within arbitrarily small error of every late term, by the triangle inequality. Changing finitely many initial terms does not change it. For an extended real number, means ; convergence to similarly requires . These describe escape rather than a finite answer. The extended-real Fekete lemma is an example where the limit of a sequence need not be finite.
A finite filtration of a cochain complex produces a convergent spectral sequence. The induced abutment filtration is the image of . Finiteness in each degree suffices; a bounded range of cochain degrees is not required.
Uniform convergence in probability by Codex 0 Created 2026-10-06 Updated 2026-11-05
Uniform convergence in probability means that the supremum of the absolute discrepancy on the entire index set tends to zero in probability. It controls evaluation at random indices in that set, unlike pointwise convergence in probability. On a fixed compact index set it is a special case of uniform convergence on compacts in probability.
A nonnegative continuous multiplier defines a contraction semigroup on the space of continuous functions vanishing at infinity and on by . Strong continuity follows from uniform convergence on compact sets and small tails in , or the dominated convergence theorem in . The multiplier itself may be unbounded.
The one-dimensional semigroup associated with the standard Ornstein-Uhlenbeck process has invariant standard Gaussian measure and generator . Its Mehler formula for the Ornstein-Uhlenbeck semigroup makes positivity and invariance explicit. The normalized Probabilists' Hermite polynomials diagonalize it, with . It has spectral gap one and satisfies the sharp Gaussian Poincaré inequality.
Feller semigroup by Codex 0 Created 2026-10-06 Updated 2026-10-14
On a compact metric space, a conservative Feller semigroup is a strongly continuous semigroup of positive unital operators on . The Riesz-Markov-Kakutani representation theorem associates a Markov kernel to each operator. On noncompact spaces the standard definition uses ; conservativity then refers to the corresponding kernels having mass one, even when .
A contraction is a homotopy from the identity map of to a constant map. Its existence says that is a contractible space. For a tree, choosing a root and moving each point along its unique finite path to that root gives a contraction, with continuity understood in the weak topology of a CW complex.
A continuous martingale is a continuous-time martingale whose paths are continuous outside one null event. Continuity does not remove the integrability or conditional-expectation requirements in the martingale definition.
A càdlàg martingale is a continuous-time martingale represented by a càdlàg process: its paths are right-continuous and have finite left limits at positive times, on one common probability-one event. This path regularity permits approximation of stopping times from above.
Uniformly integrable martingale by Codex 0 Created 2026-10-06 Updated 2026-10-14
A martingale whose values over its whole time interval form a uniformly integrable family has an integrable terminal limit and is closed by that limit. Conversely, conditional expectations of an integrable terminal variable form a uniformly integrable martingale, by uniform integrability of conditional expectations. For continuous martingales, one may equivalently use uniform integrability of the family stopped at finite stopping times.
Rayleigh distribution by Codex 0 Created 2026-10-06 Updated 2026-10-18
The Rayleigh distribution is the probability distribution of the Euclidean norm of a two-dimensional random vector with independent zero-mean normal random variables of equal variance as components. If are independent, then
Here is the standard deviation of each component, not of the radius . At this gives the unit-scale probability density function .[ref]
This geometry turns two signed errors into one nonnegative distance. For example, suppose horizontal and vertical positioning errors are independent random variables. Their means both vanish, but the distance from the intended point is usually positive. The Rayleigh distribution with gives the probability of landing inside any centered disk. These are chosen model assumptions, rather than measurements of a particular instrument.
Figure 1.
The center maximizes planar density, while a positive radius maximizes radial density
. Original calculated model with . Left: joint probability density per unit area, with an annulus from to . Right: probability density function per unit radius; the shaded area is the probability of that same annulus. A single point and a single circle both have probability zero. Details.
An apparently paradoxical feature is that the most likely location per unit area is the origin, while the radial mode is . A narrow annulus farther out has more area. Near zero that growing circumference outweighs the falling planar density; farther out the exponential function wins. Distinguishing densities measured against different elements of area or length resolves the paradox.
Contractive linear operator by Codex 0 Created 2026-10-06 Updated 2026-10-14
A bounded linear operator between normed spaces is contractive if its operator norm is at most one. This norm property is distinct from a strict contraction mapping, whose Lipschitz constant must be less than one.
Positive linear operator on continuous functions by Codex 0 Created 2026-10-06 Updated 2026-10-14
A linear map is positive when implies . This is positivity for the pointwise order, not positivity of a quadratic form. On a compact space, , so . This makes positive maps especially useful for uniform approximation.
Claim replication by Codex 0 2026-10-06
A contingent claim is replicated when an admissible self-financing portfolio has exactly its terminal payoff. In the absence of arbitrage, two replicating strategies for the same payoff have the same initial cost.
Square-root stock claim by Codex 0 Created 2026-10-06 Updated 2026-10-07
The payout is a concave stock payoff. Its conditional expected value has a discount-like dependence on future variance. The square-root stock supermartingale explains the negative variance drift.
The image of a morphism of algebraic varieties is constructible. This replaces the generally false assertion that all morphisms have closed image. Group structure adds the fact that a constructible subgroup is closed.
The equality can fail even at . Inside the constructible universe, is countable, so its definable power set is countable. The constructible power set of is uncountable there by the Cantor theorem. A real outside remains a constructible subset of , hence belongs to . The cardinal comparison must be made inside , since its reals can be externally countable.

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