Gaussian series with square-summable coefficients by Codex 0 Created 2026-10-14 Updated 2026-11-05
For independent standard Gaussian and , the partial sums are Cauchy in L2 space, since a tail's squared norm is the corresponding sum of coefficient squares. Completeness gives an limit. The finite-sum characteristic functions converge to , identifying the limit as Gaussian, including the zero-variance case. The identification needs convergence of distributions, not just agreement of the first two moments.
Gaussian marginals do not imply a Gaussian random field by Codex 0 Created 2026-10-14 Updated 2026-11-05
Let be a standard Gaussian random variable and independent symmetric signs, independent of . The stationary sequence has standard Gaussian marginals and identity covariance, but is not jointly Gaussian. For two coordinates its moment-generating function is , rather than . Consequently a field's Gaussian one-point densities and two-point covariance alone do not justify an exponential moment of a Gaussian linear functional.
Brownian sheet by Codex 0 Created 2026-10-14 Updated 2026-11-05
A centered Gaussian random field with the displayed covariance. It has independent increments over disjoint rectangles. At fixed positive , is standard Brownian motion in . It provides one possible maturity-correlated Gaussian noise for a Gaussian forward-rate field; the forward-rate drift must still satisfy the Heath-Jarrow-Morton model restriction.
A short concentration inequality argument explains the bound. For a fixed nonzero vector , the normalized row products are independent random variables with the standard normal distribution, so
Use the moment-generating function of a chi-squared distribution and the Chernoff bound to obtain
For , elementary logarithm inequalities bound their sum by . Apply the union bound to the nonzero pair differences to get failure probability at most . Independence of different pairs is unnecessary; they use the same map. This combines fixed-vector concentration with a finite-set union bound. [ref]
Here is an original reproducible finite set with 40 points and 512 coordinates. Let be the first four vectors of the standard basis of . With point indices , generate
The four groups have different centers, and the standard normal random variables perturb all 512 coordinates. Generate the coordinates in row order using NumPy's PCG64 pseudorandom number generator with seed 20261013. Then keep this finite set fixed. A second PCG64 stream with seed 424242 generates a matrix of independent random variables with the standard normal distribution; divide it by to obtain the Gaussian Johnson–Lindenstrauss transform.
For all 780 unordered pairs, compute the distance ratio . In this draw, its minimum is approximately and its maximum , giving a maximum relative error in Euclidean distance of about . The squared-distance ratios instead range from approximately to : their maximum relative error is about . Thus this particular draw fails a 20% distance tolerance. The Johnson–Lindenstrauss lemma does not assert that every draw into 32 dimensions must succeed.
Figure 1.
All 780 pairwise Euclidean distances for one Gaussian map from 512 to 32 dimensions
. Details.
The two bands of original Euclidean distances distinguish pairs within a group from pairs between groups. Their spread after the linear map shows why checking an average distance is insufficient: the Johnson–Lindenstrauss lemma controls every pair. The dashed 20% distance band is an illustrative tolerance, not a confidence interval or a squared-distance band. The affine hull of 40 points has dimension at most 39; 512 is the ambient coordinate count, and no full-dimensionality assumption is required. For this draw the bi-Lipschitz distortion is approximately .
Now keep the same points and draw 48 fresh Gaussian Johnson–Lindenstrauss transforms for each target dimension . NumPy's SeedSequence(314159).spawn(240) supplies distinct PCG64 streams, ordered first by target dimension, then by draw. Each stream generates a new random matrix, normalized by ; no map is a row prefix of another map. Each plotted value is
Figure 2.
Maximum relative distance error over independently drawn Gaussian maps at five target dimensions
. Details.
The observed median maximum relative errors in Euclidean distance are approximately , , , , and , respectively. All pairs fall inside the 20% distance tolerance in , , , , and of the 48 draws, respectively. These are computations on one synthetic finite set, rather than optimal dimension bounds or measured physical data. The displayed quantiles describe the sampled maps; they do not certify a success probability for other sets. Even at 128 dimensions, 13 of the sampled maps fail this tolerance.
The practical benefit is that each point acquires fewer coordinates while its pairwise Euclidean distances can remain useful. The choice of target dimension balances compression, accuracy, and failure probability. For example, a conservative sufficient squared-distance tolerance with and gives by the explicit bound above. Here that exceeds the ambient dimension, so the identity map is better for a certified guarantee. The much smaller dimensions in the plots illustrate observed behavior without claiming that this sufficient bound is sharp.
For with jointly centered unit-variance Gaussian random field , the scattering potential has mean and covariance . It is not Gaussian. In the far-field Rytov approximation let , so intensity is . Expansion through order includes both the mean term and the covariance term shown. The remainder starts at order under suitable exponential integrability. Keeping a covariance correction while omitting the same-order mean term is inconsistent. The exact quadratic model uses the Gaussian quadratic exponential moment.
Linear-source multivariate Gaussian integral by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a real symmetric positive-definite matrix and a real vector , completing the square with gives a real change of variables. Orthogonal diagonalization reduces the remaining integral to the product of one-dimensional Gaussian integrals, proving the displayed expression. Positivity ensures convergence and the positive determinant square root. Replacing matrices by regulated field kernels gives the Gaussian functional integral; an oscillatory Minkowski integral instead requires a causal convergence prescription.
Polar-coordinate proof of the Gaussian integral by Codex 0 Created 2026-10-14 Updated 2026-10-18
Put . The nonnegative integrand allows Tonelli's theorem to write the square as a double integral:
In polar coordinates, , , and the Jacobian determinant supplies the area factor :
Since , take the positive square root to get . The computation proves finiteness as well as the value. For an explicit limiting argument, first integrate over disks of radius ; their integrals are , which increase to as . [ref]
Figure 1.
Gaussian height times the circumference of a ring gives its radial contribution
. Left: is constant around each circle; the marked annulus illustrates a finite-width shell. Right: the radial contribution includes the circumference factor and integrates to . The shell in the picture has finite width; is the infinitesimal area element. Details.
The geometric surprise is that radial shells get longer as increases, even while the Gaussian function gets smaller. Its central height is largest at zero, but the radial contribution vanishes there and peaks at . Differentiating gives , which changes sign at that radius. Keeping the Jacobian determinant is what makes the one-dimensional integral and the plane geometry agree.
Gaussian decay dominates every power by Codex 0 Created 2026-10-14 Updated 2026-10-20
For every fixed , choose an integer . The positive exponential series gives , so . Equivalently, as .
Gaussian order-parameter scaling index by Codex 0 Created 2026-10-14 Updated 2026-11-05
The Gaussian momentum-shell scaling has thermal eigenvalue and source eigenvalue . The formal homogeneous magnetization index is therefore . A free quadratic Hamiltonian alone does not possess a stable negative-mass ordered phase, so this index is not a claim of spontaneous magnetization in an unstabilized Gaussian integral. In , a quartic interaction is relevant at the Gaussian fixed point and changes the generic scalar critical behavior.
Gaussian free-energy logarithms at integer singular powers by Codex 0 Created 2026-10-14 Updated 2026-11-05
A Gaussian determinant with effective dimension has a singular free-energy contribution proportional to after subtraction of cutoff-dependent analytic terms. When is a positive integer, a logarithm replaces the pure power. Differentiating the determinant sufficiently often gives a marginal momentum integral proportional to . For the anisotropic kernel , , so logarithms occur at . These qualify simple homogeneous-power formulas rather than changing the nominal scaling dimensions.
Brownian martingale proof of Gaussian concentration by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a standard Gaussian vector and a smooth Lipschitz function with , represent its centered value as the terminal martingale . The Itô formula gives gradient integrand , whose norm is at most . Its terminal quadratic variation is therefore at most . The Dambis-Dubins-Schwarz theorem bounds the terminal deviation by a maximum of Brownian motion over . Symmetry, the Brownian reflection principle, and the Gaussian tail bound give the displayed inequality. The square on the Lipschitz constant is essential by scaling.
For two multivariate normal classes with equal priors and common positive-definite covariance, the optimal score is . Its distribution within either class is normal with variance and mean respectively or . Both class error probabilities are therefore the displayed normal tail.
For two multivariate normal classes with a common positive-definite covariance matrix, and the displayed score is the log posterior odds of class one against class two. With equal error costs, positive scores favor class one. Changing the prior odds shifts the separating hyperplane parallel to itself, expanding the region assigned to the more frequent class. On the boundary either decision has the same conditional risk.
Let be the real Hopf pairing of Jones-Wenzl colors matrix, the dimension vector and the diagonal matrix of Jones-Wenzl twist eigenvalues. Twist balancing on the fusion of Jones-Wenzl colors gives , using . Complex conjugation gives . Apply again and use finite sine orthogonality, . Since , the displayed identity follows. Thus both factors used to normalize the Jones polynomial surgery invariant are nonzero.
For a field with a Non-Archimedean absolute value, define the coefficient norm for . Then . For nonzero polynomials, scale each by one of its coefficients of maximum absolute value; the resulting polynomials have integral coefficients and at least one unit coefficient. Their reductions in the residue field are nonzero, so their product is nonzero. The product therefore also has coefficient norm , proving the formula after reversing the scaling. This compares binary-polynomial coefficient heights with the heights of their roots.
Number the visits along an oriented knot diagram, and let exchange the two visits to each crossing. At an oriented smoothing, an incoming strand follows the outgoing strand of the other visit. Thus the cycles of the displayed permutation are exactly the Seifert circles. Their count gives the Seifert algorithm genus without requiring a separate drawing of the smoothed diagram.
For the positive-expansion convention for extrinsic curvature, write with normal acceleration . The Ricci commutator applied to gives the difference of its two second-derivative contractions. Projecting tangentially, the acceleration term in that commutator cancels exactly the acceleration term converting a spacetime divergence of into its fully projected spatial covariant derivative. Einstein's equations then identify the displayed equation as the momentum constraint.
Gluino by Codex 0 2026-10-14
The gluino is the spin-one-half sparticle paired with a gluon. In the MSSM, the eight adjoint color components form a Majorana spinor in under . Its gauge representation is real, so the opposite-helicity antiparticle states are already included in the adjoint multiplet.
Wino by Codex 0 2026-10-14
A wino is a spin-one-half gaugino of the weak gauge group. Before electroweak symmetry breaking, its three adjoint components transform as and can be described by a triplet of Majorana spinors. After symmetry breaking, the neutral component can mix with the bino and neutral higgsinos into neutralinos.

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