Topics (349k) Articles (361k) Users (404) Discussions (237) Comments (383) Files (12k) New article
For a small perturbation of a stationary horizon, the linearized Null Raychaudhuri equation gives . With vanishing boundary term , integration by parts gives . Combining this with affine horizon-generator scaling converts area response to horizon Killing-energy flux.
In Newtonian gauge in cosmology, the Free-streaming photon Boltzmann equation is . Angular averaging and the photon angular temperature moments give the displayed continuity equation. Its dipole yields the photon Euler equation, with the sign of the anisotropic stress term determined by the stress convention.
With and the same convention for baryon velocity, choose . The spherical-harmonic streaming recurrence givesThis is the temperature-only Thomson scattering hierarchy without polarization feedback, with optical depth to the observer satisfying . A photon multipole normalization change changes the denominators and the dipole-source prefactor. The lower coupling vanishes at , so no vector monopole occurs.
A direction-dependent fractional photon temperature change. For a thermal spectrum, is its linear expansion at fixed comoving energy. For a nonthermal spectrum the same ansatz is a brightness dilation, rather than necessarily a thermodynamic temperature. In unweighted Legendre polynomial multipoles, , the photon density, velocity and anisotropic stress are , and .
Phase-group orthogonality for degree-zero dispersion by
Codex 0 Created 2026-10-06 Updated 2026-10-14
If a differentiable dispersion relation is homogeneous of degree zero at nonzero , the Euler homogeneous function theorem gives . Therefore phase velocity is orthogonal to group velocity . The result applies exactly to limiting inertial waves; finite compressibility can alter the dispersion.
The lever rule finds phase fractions from a horizontal tie line on a phase diagram. For solid and liquid concentrations and bulk concentration , conservation gives . Thus is the liquid fraction, provided . For pure solid, .
Computing conductance from a smoothed gradient gives . The image edge detector is nonlocal, while the local highest-order diffusion has positive coefficient when conductance is positive. A smooth kernel, lower conductance bound and appropriate regularity/boundary hypotheses support a well-posed regularized filter.
For unit-variance innovations, orthogonality to the past givesConsequently and . Replacing autocovariance by matched sample estimates yields seasonal regression estimators. The unit innovation variance is necessary to identify the noise scale separately.
For bond percolation on the square lattice, write and . A maximal-probability boundary graph vertex can be placed at by symmetry. Reflection about identifies its connection probability from with that from . The Harris-FKG inequality yields for .
Exponential one-arm decay from finite susceptibility by
Codex 0 Created 2026-10-06 Updated 2026-10-14
The percolation susceptibility is . Finiteness gives a boundary sum . The weighted BK boundary-splitting estimate then gives . The strict bound absorbs the finitely many smaller radii into a positive exponential rate with unit prefactor. At , all positive-radius connection probabilities are zero.
For independent bond percolation on a transitive locally finite lattice, let count rooted self-avoiding walks and let be the connective constant. An infinite open percolation cluster supplies an open walk of every length. The union bound gives , which tends to zero when . Thus .
Independent bond percolation on the cubic lattice has exponential connection decay at every and positive percolation probability at every . The finite-set criterion for percolation sharpness gives decay below its auxiliary threshold. The Margulis–Russo formula and exploration from a finite box boundary give , with the infimum over interior finite sets. Above the auxiliary threshold the infimum is at least one; integrating gives positive percolation probability and identifies the two thresholds. This theorem does not identify the value of for a particular lattice.
An infinite percolation cluster is an open connected component of a graph with infinitely many graph vertices. On a countable translation-invariant lattice, a zero root percolation probability implies that no infinite percolation cluster exists almost surely, by the countable union over all graph vertices. A positive root probability implies almost-sure existence by translation ergodicity of Bernoulli percolation; uniqueness is an additional theorem.
Pearson chi-squared statistic for contingency tables by
Codex 0 Created 2026-10-06 Updated 2026-10-14
For observed counts and positive expected counts in a contingency table, the statistic is . Under common category probabilities or statistical independence, estimate by the product of the row and column totals divided by the grand total. With large expected counts, this gives the test statistic for the Pearson chi-squared test of homogeneity or the Pearson chi-squared test of independence, with asymptotic chi-squared distribution on degrees of freedom.
An internally finite subset of can be represented in Peano arithmetic by a product of distinct prime numbers: multiply the th prime number exactly when belongs to the subset. Divisibility by that prime recovers membership. Arithmetic induction proves existence of this code even for a definable subset with a nonstandard cutoff in a nonstandard model of Peano arithmetic.
Declustering groups dependent threshold exceedances into extreme-event clusters and retains a representative, commonly the cluster maximum. It aims to make the events used in a peaks-over-threshold method approximately independent. The event rate must be estimated consistently with the retained clusters when computing return levels.
Pull back along loop evaluation and take the slant product with the circle's fundamental class. This degree-lowering operation kills positive-degree cup products. It commutes with stable cohomology operations such as Steenrod squares and identifies a transgressing base class with its fiber class in the path-loop fibration.
A dilute, vertically mixed particle-laden gravity current with no fluid entrainment, bed erosion or carrier-fluid leakage obeys volume conservation . With downward settling velocity magnitude , an absorbing bed gives . The variable-buoyancy shallow water equations conserve the kinematic momentum flux including hydrostatic pressure,These equations describe a steady interior supplied continuously from upstream, not the moving nose of a finite-volume release. The depth follows one of the depth branches of a steady depositing gravity current.
For slowly depositing particles, and local adjustment gives with the constant-speed entraining gravity current on a slope coefficient. At leading order and . Its validity requires settling slow compared with the current and, for small , compared with entrainment.
The integrated budget is . A steady spatial increase needs a source exceeding deposition, for example sediment resuspension or lateral particle input. In unsteady flow, local depletion can produce even without particle addition.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





