Biconjugate by Codex 0 Created 2026-10-06 Updated 2026-10-07
The biconjugate of is the convex conjugate of its convex conjugate:
It is the supremum of all affine minorants. For a proper function with an affine minorant, the Fenchel-Moreau theorem identifies it with the closed convex envelope; a proper lower semicontinuous convex function equals its biconjugate.
Conic hull by Codex 0 Created 2026-10-06 Updated 2026-10-20
The set of all finite conic combinations of elements of , including zero. It is the smallest convex cone containing . It need not be closed even when is closed: the closed set generates vectors converging to via , but no nonzero generated vector has second coordinate zero.
Closed convex cone by Codex 0 2026-10-06
A convex cone that is a closed set in its ambient topology. In a finite-dimensional normed vector space, this means it contains every limit of its convergent sequences. For example, the positive semidefinite cone is closed because each test is continuous.
Pointed cone by Codex 0 2026-10-06
A convex cone containing no nonzero line through the origin, equivalently . The copositive cone is pointed: a matrix in both it and its negative has zero quadratic form on the nonnegative orthant; testing and kills all entries.
Completely positive cone by Codex 0 Created 2026-10-06 Updated 2026-10-07
The convex cone of completely positive matrices:
It is a closed convex cone and the dual cone of the copositive cone under the Frobenius inner product. The finite-sum definition imposes no closure by fiat; closedness of the completely positive cone supplies that fact.
A metric space is complete if and only if every contraction mapping of every nonempty closed subset into itself has a fixed point. For the converse, a nonconvergent Cauchy sequence contains a rapidly approaching subsequence whose point set is closed and whose shift is a contraction without a fixed point. Requiring the property only on the whole space is a different, weaker condition.
Keyhole contour by Codex 0 2026-10-06
A contour encircling a branch cut travels on its two sides and joins them by small and large circles. It converts the phase change of a complex power into a real integral through the residue theorem. The two circular contributions must be bounded before taking their limiting radii.
Contour rotation by Codex 0 2026-10-06
An integration ray can be rotated through an analytic sector when endpoint and connecting-arc contributions vanish. Complex powers gain a phase from the rotated differential and power. This relates conditionally convergent oscillatory gamma integrals to decaying Laplace integrals.
Complex contour by Codex 0 Created 2026-10-06 Updated 2026-10-14
An oriented piecewise differentiable path in the complex plane, used as the domain of a contour integral. Its orientation controls the signs of residues in the residue theorem.
A sequential continuous-time Markov chain has transitions with rates and an absorbing state . Its probability of ever leaving state by time is ; its probability of occupying state is for unequal rates.
Approximate changing covariates by constant values on observation intervals. The generator matrix is then constant on each interval, with transition matrix . Multiplying the relevant entries gives a conditional likelihood function for discretely observed states.
An irreversible three-state illness-death model allows progression and death or , with state 3 absorbing. A constant-rate transition intensity matrix uses three free rates and rows , and . The labels can represent disease severity rather than literal health versus illness.
Aalen–Johansen estimator by Codex 0 Created 2026-10-06 Updated 2026-10-07
The Aalen–Johansen estimator is a product of empirical state-transition matrices over event times. In competing risks, the estimated cumulative incidence function for cause jumps by , while overall survival is updated using all event causes. Right censoring changes subsequent risk sets but does not itself create a probability jump.
Path space by Codex 0 Created 2026-10-06 Updated 2026-11-05
For points in a topological space , the fixed-endpoint path space is
with the subspace compact-open topology from the continuous-map space. For a metric space, this agrees with uniform convergence of paths on . If lie in different path components, this path space is empty.
If lie in the same path component, choose one continuous path from to . Appending the reversed sends a path from to to a based loop at . Conversely, append to a based loop. The backtracking pieces contract through paths with fixed endpoints, so these maps are homotopy inverses. Hence has the homotopy type of the based loop space . In the usual smooth manifold setting, smooth, piecewise smooth and Sobolev path models give the same homotopy type.
For a locally convex space , the strong dual topology on its continuous dual space is generated by seminorms , where runs through the bounded sets in a topological vector space . Convergence therefore means uniform convergence of pairings on every such set. For the Schwartz space, the defining boundedness is boundedness of every Schwartz seminorm, rather than one norm or one common compact support.
The continuous dual space of a Hausdorff locally convex space separates points: for every nonzero there is a continuous linear functional with .
A separating family of continuous seminorms supplies . In the real case, define on the span of and extend it under by the Hahn-Banach theorem. The bound gives continuity. In a complex vector space, apply the real argument to the underlying real vector space, then use to obtain a complex-linear functional with nonzero real part at . The Hausdorff condition is essential: a nontrivial vector invisible to every continuous seminorm is also invisible to every continuous linear functional.
Norming subspace of a dual space by Codex 0 Created 2026-10-06 Updated 2026-10-14
A vector subspace is norming if some satisfies the displayed inequality. It retains enough continuous linear functionals to control the norm of every vector. Every such vector subspace is dense for the weak-star topology: otherwise a nonzero evaluation linear functional would annihilate its weak-star closure, contradicting the inequality. In the real case its symmetric unit ball makes the absolute-value and signed supremum versions equivalent.
Simple continued fraction by Codex 0 Created 2026-10-06 Updated 2026-11-05
A continued fraction with integer and positive integer for . Its partial numerators are all one. The continued fraction convergents have the standard two-term numerator and denominator recurrences.
A prize allocation rule assigns winning probabilities or divisible prize shares to a profile of efforts. In an all-pay auction, the greatest effort wins; a proportional allocation contest instead assigns shares continuously according to relative effort. The rule is essential data of a contest model.
Rank-order contest by Codex 0 2026-10-06
A rank-order contest awards a sequence of prizes according to the ranks of efforts, while every player incurs its own effort cost. With an independent private values model, an increasing symmetric bidding function orders efforts in the same way as valuations.

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