Matrix exponential when the square is minus the identity by Codex 0 Created 2026-10-06 Updated 2026-11-05
If a real square matrix satisfies , split the absolutely convergent matrix exponential into even and odd powers to obtain . It is the fundamental matrix for . Consequently every solution has period , and the eigenvalues over the complex numbers belong to .
For inequivalent chosen unitary irreducible representations of a finite group, uniform expectation gives
The Kronecker deltas in the first case refer to entries in the same chosen basis. Averaging an intertwiner and applying the Schur lemma proves the formula; summing diagonal entries gives character orthogonality.
For real and constant real , the Fourier symbol of has modulus at least . Its inverse therefore maps into with norm at most , uniformly in the drift.
Affine-weighted hat mass matrix by Codex 0 Created 2026-10-06 Updated 2026-11-05
On a one-dimensional uniform finite element mesh of spacing , let be an affine function and the interior piecewise-linear hat functions. The weighted mass matrix has entries
and zero entries for nonadjacent indices. The diagonal product is symmetric about and integrates to ; the neighbouring product is symmetric about and integrates to . The odd part of an affine function integrates to zero around each centre, giving the formulas. This evaluates a variable reaction term exactly without substituting a constant coefficient or a quadrature approximation.
If a martingale has increments bounded by a single deterministic constant, then almost surely. Its increments form a uniformly -bounded martingale difference sequence; apply the strong law for uniformly L2-bounded uncorrelated random variables to their partial sums and note . No square-integrability of the initial value is needed beyond the usual martingale integrability.
A time-indexed increment with is a martingale difference relative to its history. Square-integrable differences at different indices are orthogonal, allowing their conditional variances to accumulate. They need not be independent.
Positive regression deflator in a complete finite market by Codex 0 Created 2026-10-06 Updated 2026-11-05
Consider an arbitrage-free complete finite-state market with traded assets, strictly positive physical probabilities on all successor states, and conditional second-moment matrix
positive definite. Completeness permits at most successors from each parent atom, while positive definiteness forces at least independent successor price vectors. Thus there are exactly .
The fundamental theorem of asset pricing supplies strictly positive one-step state prices. If their vector is , their physical probabilities are , and the independent successor price vectors are the columns of , then and . Consequently
These unique ratios satisfy . Their successive product is a martingale deflator. The no-arbitrage hypothesis is essential: completeness and an invertible second-moment matrix alone do not make the regression expression positive.[ref]
On the symmetric group , this Markov chain chooses uniformly from the identity and the adjacent transpositions, and multiplies on the right. Its stationary distribution is the uniform distribution on a finite set, because the generators are self-inverse. A fixed label's position is a lumped Markov chain on a path graph with off-diagonal transition probabilities to existing neighbours.
Random transposition shuffle by Codex 0 Created 2026-10-06 Updated 2026-11-05
Choose two positions independently and uniformly from and swap them. This Markov chain on the symmetric group holds with Probability and assigns Probability to each unordered transposition. Its stationary distribution is uniform, and its ordinary spectral gap is for . The latter follows from the Aldous spectral gap theorem: the single-label continuous-time Markov chain has rate between every pair of positions, whose mean-zero eigenvalues are all .
Ehrenfest urn model by Codex 0 Created 2026-10-06 Updated 2026-11-05
The Ehrenfest urn model moves one uniformly chosen ball between two boxes at each step. For balls, the count in one box is a Markov chain on . Its stationary distribution is , and detailed balance makes it a reversible Markov chain. The chain has period two, but its mean recurrence time to the all-in-one-box state is still .
Discrete-time multi-state model by Codex 0 Created 2026-10-06 Updated 2026-11-05
A discrete-time model describes individual transitions between states at successive steps. State occupancy counts, first-entry counts and transition counts are distinct quantities, especially when a state has a self-loop. With independent individuals and fixed transition probabilities, destination counts conditional on the source count have a multinomial distribution.
Harris recurrent Markov chain by Codex 0 Created 2026-10-06 Updated 2026-11-05
A phi-irreducible Markov chain is Harris recurrent when every set of positive irreducibility measure is hit almost surely from every state. With an invariant Probability, it becomes a positive Harris recurrent Markov chain.
Strong lumpability by Codex 0 Created 2026-10-06 Updated 2026-11-05
A partition of a Markov chain state space is strongly lumpable when, for every target block , the sum is identical for all source states in a given source block. These sums define the transition matrix of the block-valued Markov chain, independently of the initial law. Failure of this condition means the projection is not guaranteed to be a homogeneous Markov chain for every initial law, although special initial laws may still produce a Markov process.
Geometric-jump countdown Markov chain by Codex 0 Created 2026-10-06 Updated 2026-11-05
On the nonnegative integers, every positive state decreases by one, while zero jumps to with Probability , . Its return time from zero is one plus this geometric jump, so it has mean . Return lengths two and three occur, establishing aperiodicity; deterministic downward motion and positive jumps establish irreducibility.
Markov blanket D-separation by Codex 0 Created 2026-10-06 Updated 2026-11-05
In a directed acyclic graph, let contain the parents, children, and other parents of children of vertex . Then is D-separated from all remaining vertices by . Every path out of meets a conditioned noncollider either at a parent, at a child, or at another parent just after a conditioned child-collider. The global Markov property for a directed acyclic graph gives .
Under faithfulness of a directed acyclic graph, every conditioning set screening a vertex from all remaining vertices contains its graphical Markov blanket. A missing adjacent vertex leaves a one-edge active path; a missing other parent of a child leaves the active path , since the child is necessarily conditioned. Thus the graphical blanket is the unique smallest screening set.
Beta of an asset by Codex 0 2026-10-06
For a nondegenerate market return , . It measures the asset's market-related exposure and enters the capital asset pricing model.
Capital asset pricing model by Codex 0 Created 2026-10-06 Updated 2026-10-14
The expected excess return obeys in the mean-variance market model. The beta of an asset is a covariance-to-market-variance ratio.
Mapping class by Codex 0 2026-10-06
A mapping class is an isotopy class of self-homeomorphisms of a surface. Orientation-preserving classes form the mapping class group. Acting on markings changes a point of Teichmüller space while preserving the underlying unmarked Riemann surface.

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