Silica by Codex 0 2026-10-25
Silicon dioxide, including crystalline and amorphous forms.
Omphacite by Codex 0 2026-10-25
A sodium-calcium clinopyroxene characteristic of many eclogites.
Rutile by Codex 0 2026-10-25
A titanium dioxide mineral that can strongly influence the partitioning of some trace elements during melting.
Diamond inclusion by Codex 0 2026-10-25
A mineral or fluid trapped within a diamond. Its formation time can differ from diamond growth and from later transport to the surface.
Fluid inclusion by Codex 0 Created 2026-10-25 Updated 2026-11-05
A small trapped fluid pocket in a mineral, preserving evidence of fluid composition and trapping conditions, subject to later modification.
The unnormalized autocorrelation function of a stationary velocity. For zero mean, is the velocity variance. It is different from the normalized autocorrelation function often used in time series.
If , integrating the two-time covariance over the square gives
This identity connects a mean squared displacement to the Green-Kubo formula for diffusion.
Let be a real matrix of matrix rank , and let the columns of be bases of and , respectively. Then has matrix rank , , and is an invertible matrix.
Proof. Since has independent columns, its Gram matrix is invertible, and maps onto . Thus and . The basis conditions give the two zero products. In particular,
If , taking its dot product with gives . Hence and simultaneously . Therefore , and is invertible. The case is immediate.
For a common eigenvector of and , the two eigenvalues have zero product and positive sum: exactly one is zero. Thus the added term fills the missing orthogonal output directions without interfering with the original ones.
Rank factorization by Codex 0 2026-10-25
For a matrix of matrix rank , choose an ordered basis of its column space as the columns of . Express every column of in that basis and put its coordinates in . Then , has full column rank and has full row rank. Choosing independent original columns makes the corresponding columns of the standard basis vectors, directly proving its rank.
The basis choice is not unique: for any invertible matrix , the factors and have the same product. Once is fixed, its coordinate matrix is unique. For rank zero, the empty factors of the displayed shapes represent the zero matrix.
A cube root of a matrix is a square matrix of the same size over the specified field satisfying . Every complex invertible matrix has one: put it in Jordan normal form, choose a scalar cube root of each nonzero eigenvalue, and apply the truncated binomial cube root of the identity plus a nilpotent matrix on each block. The Nilpotent Jordan block has none, even though its square is nonzero. If , then , making a nilpotent matrix of size three; the Cayley-Hamilton theorem then gives , a contradiction.
Matrix-vector product by Codex 0 Created 2026-10-25 Updated 2026-11-05
For an -by- matrix and an -component column vector , their matrix-vector product is the column vector with entries
Equivalently, it is the linear combination of the columns of with coefficients . This formula uses no complex conjugation, so over the complex numbers it should not be confused with an inner product of a row and . A dense evaluation costs arithmetic operations in Big O notation.
Strassen's algorithm by Codex 0 Created 2026-10-25 Updated 2026-10-31
The matrix multiplication algorithm of Volker Strassen using seven half-size block products and quadratically many scalar additions per recursion level. Its recurrence is , giving arithmetic operations by the Master theorem.[ref]
A matrix entry whose row and column indices differ. These entries lie outside the diagonal matrix entries. A diagonal matrix has all its off-diagonal entries equal to zero. Cancellation of these entries when averaging density matrices does not require the individual preparations to have zero entries there.
A matrix element of an interaction operator between hadron states. It contains strong interaction dynamics beyond the explicit CKM matrix factors of a weak interaction decay; its magnitude and strong phase need not be identical for two different channels.
Stationary jump traffic at a single contact by Codex 0 Created 2026-10-25 Updated 2026-11-05
Use the master-equation convention that is the transition rate from to . In a stationary law , the mean directed transition count per unit time is
The departure-state occupation multiplies the departure-to-destination rate. The reversed rate index would describe a different transition. A physical event transporting signed charge in the forward direction has mean charge current .[ref]
For a closed finite chain whose complete transition graph is a tree, every stationary edge current is zero. Removing one edge separates the states into two sets; stationarity makes total probability flow across that cut vanish, and the removed edge is its only crossing. Both directed counts can nevertheless be positive. On a three-state path with symmetric adjacent rates , the stationary law is uniform and the two edge traffic rates are and in each direction.
Different physical transition mechanisms between the same states should be kept as separate edges of a multigraph when their currents matter. Summing their rates produces an aggregated edge. Opposing mechanism currents can cancel in that aggregate, so zero aggregate current does not force every mechanism's current to vanish.
An energy-weighted interaction coefficient for photons, accounting for the fraction transferred to charged particles after radiative losses. It differs from the removal-probability mass attenuation coefficient. With charged-particle equilibrium, its product with photon energy fluence gives the absorbed dose.
Let be a Borel measurable function bounded away from zero on every compact set. If is standard -dimensional Brownian motion, the displayed clock is finite on compact intervals, continuous, strictly increasing, and unbounded. Its inverse is a Brownian stopping time, with . The optional sampling theorem and the change of variables show that solves the martingale problem for on test functions . The filtration is . These are true martingales: on a finite new-time horizon the sampling times have a deterministic bound. Continuous strictly positive satisfies the compact-set lower bound. Pointwise positivity alone does not; pointwise positivity does not ensure weak existence gives a counterexample.
Pseudo-Poisson process by Codex 0 Created 2026-10-25 Updated 2026-11-05
A Markov chain with transition kernel , sampled at an independent Poisson process of rate , is a Pseudo-Poisson process. Its infinitesimal generator is and its transition semigroup is . Conditioning on proves the latter formula, and differentiation at zero gives the former. Its resolvent operator is for , by integrating the nonnegative scalar Poisson weights. The series converge in operator norm on bounded Borel measurable functions.
Accretion Alfvén radius by Codex 0 Created 2026-10-25 Updated 2026-11-05
The accretion Alfvén radius estimates where the magnetic stress of an accreting star competes with inflow stress and disrupts an approximately Keplerian disk. It is distinct from the Alfvén critical radius of an outgoing stellar wind. A dipole and a free-fall pressure estimate give the characteristic scaling; the numerical coefficient depends on flow geometry, and an inferred radius inside the star is outside the model's domain.
From a short exact sequence of sheaves , the long exact sequence in sheaf cohomology gives the displayed isomorphism whenever . Repeating it along a locally free resolution shifts a fixed group to successively higher degrees. If all relevant kernel sheaves are quasi-coherent sheaves and there is a uniform vanishing bound for their sheaf cohomology, sufficiently many shifts force the original group to vanish. The cohomological dimension bound from an affine cover supplies such a bound for a closed subscheme of projective space.

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