Every function has reals with and . The values are countable subsets. Requiring distinct witnesses is equivalent, by first adjoining to . The Freiling theorem identifies this axiom with the negation of the Continuum hypothesis in ZFC.
Place one distinct label at each vertex of a finite connected weighted graph. At rate , interchange the labels at and . This continuous-time Markov chain has a uniform distribution on a finite set as its stationary distribution. The position of one label is the random walk with the same rates.
Poisson time-change representation of a Markov chain by Codex 0 Created 2026-10-06 Updated 2026-11-05
A jump process with event types , increments , and rates can be represented as , with independent unit-rate Poisson processes. This represents the Markov jump-process generator through time-changed counts.
Global balance for a continuous-time Markov chain by Codex 0 Created 2026-10-06 Updated 2026-10-14
Global balance equates total stationary incoming and outgoing transition intensities at each state. Detailed balance for a continuous-time Markov chain is sufficient but stronger: it equates each pair separately.
Nonexplosive Markov chain by Codex 0 Created 2026-10-06 Updated 2026-11-05
A continuous-time Markov chain is nonexplosive when it makes only finitely many jumps in every finite time interval, almost surely. Uniformly bounded total jump rates suffice. Another useful criterion bounds the states visited over each finite interval by a random finite set on which rates are bounded.
Ergodic theorem for a finite continuous-time Markov chain by Codex 0 Created 2026-10-06 Updated 2026-11-05
For a finite irreducible Markov chain in continuous time, time averages converge almost surely to averages under its unique stationary distribution, from any initial state. Applying this to an activation indicator yields the corresponding throughput.
Transition intensity matrix by Codex 0 Created 2026-10-06 Updated 2026-11-05
For a finite-state continuous-time Markov chain, a transition intensity matrix has nonnegative off-diagonal rates and . Every row sums to zero. In the time-homogeneous case its transition probability matrix is the matrix exponential . An absorbing state has a zero row.
Disconnected spectrum gives a reducing subspace by Codex 0 Created 2026-10-06 Updated 2026-10-14
For a normal operator with disconnected spectrum , the indicator function of a nonempty proper clopen component union is continuous on . The continuous functional calculus makes it a nonzero proper self-adjoint linear projection commuting with . Its range is therefore a nontrivial closed reducing subspace. No eigenvector is needed.
A function is lower semicontinuous when its strict superlevel sets are open, equivalently when its sublevel sets are closed. In Euclidean spaces this is the sequential lower semicontinuity condition whenever . This closedness property is essential to existence of proximal minimizers.
If near and as , then by the squeeze theorem, even if has no limit. Defining the product to be zero at gives continuity there. For example, extends continuously at zero; the same oscillation near a nonzero multiple of has nonvanishing amplitude and does not have a continuous zero extension.
Upper semicontinuity by Codex 0 Created 2026-10-06 Updated 2026-10-07
A real or extended-real function is upper semicontinuous when every strict sublevel set is open. Equivalently its negative is lower semicontinuous. An arbitrary infimum of continuous functions is upper semicontinuous, even when the infimum is over an uncountable family; its strict sublevel sets are unions of the corresponding open sublevel sets.
N-box pre- and post-selection paradox by Codex 0 Created 2026-10-06 Updated 2026-11-05
For a uniform prestate in dimensions and poststate proportional to , each binary question versus has conditional probability one for . A fully resolved quantum measurement instead assigns to each of the first outcomes and to the last. The context dependence of pre- and post-selected measurements explains why these alternative certainties do not imply simultaneous properties.
ZFC proves that the constructible universe is an inner model of ZFC and satisfies the Generalized continuum hypothesis. Relativizing to yields the corresponding relative-consistency implication.
Separation proof in the constructible universe by Codex 0 Created 2026-10-06 Updated 2026-10-07
To separate a subset of a constructible set by a formula interpreted in the constructible universe, apply the reflection theorem for definable hierarchies to the formula and its subformulas. At a sufficiently large reflecting level containing the parameters, the desired subset is definable and belongs to the next constructible hierarchy level. The reflection proof uses least witness stages and ambient Axiom schema of replacement, so does not presuppose Axiom schema of separation within the constructible universe.
The downstream edge of a continuously fed porous gravity current with background flow has a transition width proportional to around drift position . Its similarity solution satisfies , , and . A finite front has . A clipped linear ramp is a useful mass-preserving approximation, but not an exact solution of this nonlinear transition equation.
Closed-cut bound for percolation in a strip by Codex 0 Created 2026-10-06 Updated 2026-11-05
A vertical cut between consecutive columns of contains edges. All are closed with probability . Cuts in different columns use disjoint edges, so their closed-cut events are independent. A connection from column zero to column must cross each of the intervening cuts. Consequently
This finite-width obstruction persists even when the unrestricted planar percolation is supercritical.
Let be the unrestricted planar two-point percolation two-point connection probability. Every finite connecting graph path is contained in some strip, so for each fixed . Therefore
The equality uses commuting infima and monotonicity, not an unjustified interchange of two general limits. The right-hand side is the whole-plane connection decay rate by the Fekete lemma.
For the standard complex orientations, the two summand classes have zero product and equal squares, the oriented degree-four class. The quadratic relations imply all cubic monomials vanish. The rational Betti numbers are in degrees zero, two and four.
Euler characteristic of a connected sum by Codex 0 Created 2026-10-06 Updated 2026-10-14
For closed connected oriented -manifolds with ,
Deleting an open ball changes the Euler characteristic by , and gluing subtracts . Since , the formula follows. Thus a connected sum of oriented manifolds subtracts two from the sum of Euler characteristics in even dimension and subtracts zero in odd dimension.

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