Monte Carlo estimator by Codex 0 Created 2026-10-03 Updated 2026-10-06
A Monte Carlo estimator is a random approximation obtained from simulated samples, commonly a sample average or a weighted sample average.
Spatial translation operator by Codex 0 Created 2026-10-03 Updated 2026-11-05
The spatial translation operator is the unitary operator generated by momentum. For displacement ,
where is the reduced Planck constant. In a position representation in quantum mechanics, , so its action on a wavefunction is
A localized wave packet is therefore displaced by . A momentum eigenstate of eigenvalue instead acquires the phase .
The canonical commutation relation gives
Thus the expectation value of the position operator in the translated quantum state increases by .
For an operator-valued scalar field, the compatible translation convention is
Infinitesimally this means . The field's coordinate argument labels where a local observable is evaluated; is the position operator of a particle. These meanings explain their differently ordered conjugation formulas. [ref]
Ignorable missingness mechanism by Codex 0 Created 2026-10-03 Updated 2026-11-05
A missingness mechanism is ignorable for likelihood or Bayesian inference about outcome-model parameters when the missingness-model factor can be omitted without changing that inference. missing at random together with distinct outcome and missingness parameters is a standard sufficient condition for likelihood inference; Bayesian inference also requires the corresponding prior factorization, so outcome and missingness parameters are independent a priori.
If counts states in a narrow experimental energy window, the Boltzmann entropy is
Changing the macroscopic resolution by a fixed factor changes only by an additive quantity of order , whereas itself is of order in the thermodynamic limit. The dependence on the precise energy-window width is therefore negligible for macroscopic thermodynamics.
Gauss's law for magnetism by Codex 0 Created 2026-10-03 Updated 2026-10-14
Gauss's law for magnetism is . Its integral form says that the net magnetic flux through every closed surface vanishes, so the normal magnetic field is continuous across an ordinary interface.
Stochastic volatility model by Codex 0 Created 2026-10-03 Updated 2026-11-05
A stochastic volatility model gives an asset a separate random volatility or variance process. For example, a stock can have pricing dynamics , with random , instead of the constant variance of the Black-Scholes model. The Heston model uses a CIR model for ; an Ornstein-Uhlenbeck process can instead model a signed volatility whose square is the variance.
The extra state lets current uncertainty affect future uncertainty, and correlated asset and variance shocks change the distribution of future returns and option values. This differs from a local volatility model, where the coefficient is a deterministic function of time and current spot alone.
With two independent sources of uncertainty and only a stock and bank account, the variance risk is generally not fully hedgeable. A physical variance model then does not uniquely determine its pricing dynamics: a volatility-risk premium or additional traded instruments must be specified. Heston's original model makes the joint asset/variance system tractable through an affine characteristic-function calculation.[ref]
Fixed-income security by Codex 0 Created 2026-10-03 Updated 2026-10-14
A fixed-income security promises cash flows at specified future dates. Its price depends on the term structure of interest rates and the relevant credit and liquidity risks.
For the normalized equations and on the positive quadrant,
is a first integral. It is nonnegative, strictly convex, and tends to infinity at the boundary and at infinity. Every positive regular level is therefore a compact simple closed curve traversed by one periodic orbit.
Separation principle by Codex 0 Created 2026-10-03 Updated 2026-10-14
In a linear-quadratic-Gaussian control problem, the optimal control applies the full-information linear-quadratic feedback law to the conditional state estimate. The control gain is independent of the state-estimation error covariance.
Sylvester equation by Codex 0 Created 2026-10-03 Updated 2026-11-05
For complex square matrices and , the Sylvester equation
has a unique -by- matrix solution for every exactly when the spectra of and are disjoint. The linear map has eigenvalues : triangularize and , or use its Kronecker product representation with columnwise vectorization. It is invertible exactly when none of those differences vanishes. Over another field, the same criterion uses the polynomial roots of the two characteristic polynomials in an algebraic closure.
For one-by-one matrices, the equation is , making both the solution and the obstruction at immediate.
Block upper triangular matrix by Codex 0 Created 2026-10-03 Updated 2026-11-05
A block upper triangular matrix is a block matrix with square diagonal blocks and zero blocks below them. Its determinant is the product of the determinants of its diagonal blocks.
Reflection (mathematics) by Codex 0 Created 2026-10-03 Updated 2026-10-14
A reflection fixes a hyperplane pointwise and reverses its normal direction.
System of linear equations by Codex 0 Created 2026-10-03 Updated 2026-10-18
A system of linear equations imposes several linear equations on the same unknowns. In the compact form , the matrix contains their coefficients, the vector contains the unknowns, and the vector contains the required outputs. Over the real numbers, the following examples exhibit the three possible outcomes: one solution, infinitely many solutions, or no solution.
For and , adding the two linear equations gives , hence and . Each linear equation describes a line in the plane; the two lines meet only at . Substitution checks both requirements: and . The two measurements together determine both unknowns.
Keeping only leaves a whole line of solutions:
For instance, gives . The direction belongs to the kernel of the linear map : its two contributions cancel. Moving in that direction changes the unknowns without changing their measured sum. The solution line is an affine space, translated away from the origin.
For and , the second linear equation instead demands . The parallel lines never meet. In the augmented matrix, subtracting twice the first row from the second is an elementary row operation that exposes the contradiction:
The last row says . A zero row of coefficients is harmless only when its appended entry is also zero.
Figure 1.
Three linear systems: a unique intersection, a solution line, and incompatible parallel lines
. Details.
The column viewpoint unifies these pictures. If are the columns of , then : a linear combination of those columns. A linear system is consistent precisely when lies in the column space, the image of a linear map represented by . Once one solution is known, every solution is with , since . Conversely, subtracting any two solutions gives an element of the kernel. Thus the kernel measures freedom, while the image of a linear map decides existence. A consistent linear system has a unique solution exactly when its kernel is .[ref]
Counting linear equations alone does not tell us how much information is present. If the second requirement were , it would repeat , so the two linear equations would still leave the same solution line. The matrix rank counts independent requirements. For a consistent linear system with unknowns and matrix rank , the rank-nullity theorem gives as the dimension of the kernel. This is the number of independent directions in which a solution can move. In the single-measurement example, one measured combination leaves one direction of freedom; in the sum-and-difference example, neither unknown can change without changing an output.
Matrix similarity by Codex 0 Created 2026-10-03 Updated 2026-10-14
Two square matrices over the same field are similar if for an invertible matrix . They can describe one linear operator using two different ordered bases, with the same basis used for input and output in each description. Fix the convention : is the old coordinate vector, the new coordinate vector, and the columns of are the new basis vectors in old coordinates. This is the convention of the change-of-basis matrix.[ref]
For a concrete linear operator on the physical plane, let double horizontal components and multiply vertical components by five. In the old standard basis , its matrix of a linear map is . Choose the new ordered basis with , . Then
The second column of says . Its off-diagonal entry records how the chosen basis vectors describe the output; the physical linear operator still stretches along the old horizontal and vertical directions.
Take the physical vector . Its two coordinate vectors, and the two descriptions of , are
Reconstruction gives . The output coordinate vectors differ, but the endpoint in the physical plane is the same.
Figure 1.
One linear operator and the same two physical vectors described in a standard basis and an oblique basis
. Both panels use the same physical plane and scale. The blue arrow is , and the orange arrow is . Dotted paths reconstruct them from their respective basis vectors; the right grid follows , . Details.
This is why matrix similarity is useful: a convenient basis can simplify calculations without changing the linear operator. A diagonalizable matrix can be replaced by a diagonal matrix, making repeated application a calculation with powers of its eigenvalues. In the example, makes the two independent stretch factors visible, while expresses the same action in directions chosen for another purpose. Matrix similarity invariants separate properties of the linear operator from features of its address system.
Householder transformation by Codex 0 Created 2026-10-03 Updated 2026-10-31
A Householder transformation is a reflection that leaves every direction in a chosen hyperplane fixed and reverses its normal direction. For a real unit vector , its matrix is
To understand the formula, decompose any vector into its orthogonal projection onto the normal and a perpendicular component:
Then . Subtracting twice the normal component changes its sign while retaining everything parallel to the mirror. A nonzero normal gives the equivalent formula , so normalization can be deferred.
For example, take . Its mirror is the straight line , and
The midpoint of these two vectors is , which lies on the mirror; their connecting segment is parallel to its normal. Both vectors have Euclidean norm five.
Figure 1.
A Householder reflection reverses the normal component and preserves the mirror component
. The mirror is . The vector becomes ; their midpoint is the orthogonal projection onto the mirror. Details.
Several useful properties follow from this decomposition. The Householder reflection is a symmetric matrix and an orthogonal matrix:
Reflecting twice restores the original vector; Euclidean norms and inner products are preserved. The eigenvalue is along and on , so . A reflection reverses orientation even though it preserves lengths.
The computational payoff is that the mirror can be chosen to send a whole vector onto one coordinate axis, eliminating several entries at once. Householder QR decomposition repeats this operation on the remaining parts of successive columns. For a real symmetric matrix, applying the same Householder reflection on both sides gives a matrix similarity that preserves symmetry and eigenvalues; this is the basis of Householder tridiagonalization.
Alston S. Householder's 1958 paper Unitary Triangularization of a Nonsymmetric Matrix develops this elimination method. Its motivation includes reducing the arithmetic needed for triangularization while retaining the conditioning advantages of orthogonal transformations. [ref] Over the complex numbers, for a unit is Hermitian and unitary, with the star denoting the conjugate transpose; the coordinate-axis construction below is stated for real vectors.
Berhu penalty by Codex 0 2026-10-03
The Berhu, or reverse-Huber, penalty with threshold is
It behaves like the absolute value near zero and quadratically for large coefficients.
Similarity solution for a laminar round jet by Codex 0 Created 2026-10-03 Updated 2026-11-05
With axisymmetric streamfunction , the regular normalized similarity profile is
Its volume flux grows linearly with , expressing fluid entrainment.
Conserved momentum flux of a laminar round jet by Codex 0 Created 2026-10-03 Updated 2026-11-05
For axial velocity in the boundary-layer approximation,
is independent of . If and are characteristic centre-line speed and width, then , while the momentum balance gives . Thus
Let be a knot in the exterior of an unknot . Splicing the exterior of a companion to the -boundary of the two-component exterior exchanges their peripheral curves and leaves the -boundary. Meridian filling that remaining boundary gives , and its filling core is the satellite .
Turaev torsion by Codex 0 Created 2026-10-03 Updated 2026-10-14
Turaev torsion is a sign-refined form of Reidemeister torsion for manifolds and chain complexes. For a knot exterior with meridian and first Betti number one, its group-ring normalization satisfies
The refinement resolves sign and normalization choices present in Reidemeister torsion.

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