Discrete Gaussian white noise by Codex 0 Created 2026-10-14 Updated 2026-11-05
Discrete Gaussian white noise is a jointly Gaussian sequence with expected value zero and covariance at lag zero and zero at other lags. Joint normality makes the components independent. This is a sequence of ordinary random variables, unlike the generalized continuous-time white-noise process.
Higman's lemma by Codex 0 2026-10-14
If is a well-quasi-ordering, its finite words form a well-quasi-ordering under subsequence embedding with coordinatewise increase of letters. A minimal bad sequence proof removes the last letter of selected words whose last letters form a nondecreasing subsequence, then contradicts minimality. The result implies finite-subset lifting of a well-quasi-order under Hoare domination preorder.
A quasi-order is better-quasi-ordered if every array into it from every barrier in better-quasi-order theory is good: some barrier members satisfy . Singleton barriers recover the usual infinite-sequence condition for a well-quasi-ordering. The stronger condition is useful for infinitary closure operations for which well-quasi-ordering alone fails. Equivalently one may use continuous maps from infinite subsets of an infinite subset of the natural numbers, with the discrete topology on the range, and compare with .
A finite Cartesian product of well-quasi-orderings is well-quasi-ordered in the componentwise order. Every infinite sequence in one well-quasi-order has an infinite nondecreasing subsequence: colour pairs by whether they are ordered, apply Ramsey's theorem, and exclude an all-bad subsequence. Restrict successively to such a subsequence in each coordinate. The same argument, or the infinite pigeonhole principle, proves closure under finite disjoint unions with no cross-component comparisons.
Every infinite sequence in a well-quasi-ordering has an infinite subsequence all of whose earlier terms precede its later terms. Some term must have infinitely many later terms above it: otherwise choose each new index outside the finitely many upper-cone index sets of the terms already chosen, producing a bad sequence. Apply the same observation successively inside the infinite upper-cone subsequence. Each restriction preserves all earlier inequalities, proving the assertion.
Regular locale by Codex 0 2026-10-14
A locale is regular when every open is the join of opens well inside it. This expresses regularity without reference to points.
A weighted projective space with positive integer weights is well-formed when the greatest common divisor of the weights with any one weight omitted is one. The quotient toric lattice is free and the images of the coordinate vectors are primitive toric rays. Its fan contains the cones on all proper subsets of these rays.
For a finite list of real numbers and nonnegative weights of positive total , the weighted mean uniquely minimizes the weighted sum of squared deviations
Expanding around and using gives
Every displacement from the weighted mean increases the objective. This is the simplest one-parameter weighted least squares problem: represent all entries by one common value.
For the weighted values and with weights and ,
Thus , while . The minimum is defined by this squared-error criterion; a different loss can select a different summary, such as a median under unweighted absolute deviations.
Figure 1.
The weighted mean is the unique minimum of a squared-error objective
. For , the minimum is at . Moving to increases the objective by . Details.
Combining means of groups by Codex 0 Created 2026-10-14 Updated 2026-10-25
Suppose disjoint nonempty groups have sizes and arithmetic means . The arithmetic mean of all observations is
Each group contributes the sum ; add those totals before dividing by the overall count. This is exactly a weighted mean of group means with weights equal to group sizes. [ref]
Take a synthetic example with two observations equal to and eight equal to . The two group means are and , and the combined mean is . Giving the two groups equal weights instead produces , which summarizes the two group means with equal influence. To summarize all ten individuals with equal influence, use their group counts.
Figure 1.
Group size determines each group mean's influence on the combined individual mean
. Two synthetic observations are and eight are . Their combined arithmetic mean is ; the equal-weight average of the two group means is . Details.
The group means and counts determine the combined arithmetic mean, but do not generally determine the combined variance. Variation within the groups is additional information.
Canonical product by Codex 0 2026-10-14
A canonical product builds a prescribed discrete zero set from Weierstrass elementary factors. Choose the orders so that the logarithms of tail factors converge uniformly on each compact subset. Infinite product convergence from logarithmic tails then gives an entire function with exactly those zeros, counted with the prescribed multiplicities. When , factors of order zero suffice.
The determinant of the columns , and vanishes identically. Its apparent cubic poles at have order at most two because the coefficient multiplying the cubic-pole entry vanishes linearly. Column coincidences give six zeros, unless is a lattice point, when they give four zeros with one multiple zero. In the half-period case, the two apparent zero locations at poles are removable zeros: and the two terms cancel, leaving . Thus the zero count exceeds possible pole order in every case. The argument principle proves the identity, which expresses collinearity of the three points on the Weierstrass equation of an elliptic curve.
For , the apparent double poles at on the left are canceled by its squared zero factor. Subtract the right side: the order-three principal parts at lattice points cancel by the even Laurent expansion of , leaving at most a simple pole per period cell. An elliptic function has total residue zero in a period cell, so that possible pole is removable. The resulting entire periodic function is constant, and its oddness makes the constant zero. This proves the identity without presupposing the elliptic differential equation.
The Normal convergence of the Weierstrass elliptic-function series allows its derivative to be written as an absolutely locally uniformly convergent sum of inverse cubes. For a period lattice , this derivative sum is invariant under translation by any lattice vector, by reindexing. Consequently is constant; its apparent poles cancel. The Weierstrass elliptic function is even, so for a primitive lattice generator , evaluation at makes that constant zero. Applying this to two generators proves that this is a periodic function, namely . This argument avoids separating the original convergent series into two divergent inverse-square sums.
The Weierstrass elliptic function has degree two on its period torus. Its three distinct half-period values have double local preimages, and its pole is double, so these four values are totally ramified. This also follows from and the principal part at the pole. A Möbius transformation with pole away from these values moves all four to finite values without changing local degrees.
For a period lattice, the displayed canonical product converges normally because its logarithmic tails are bounded by a constant times . It defines an odd entire function with simple zeros exactly at the lattice and derivative one at zero. Its logarithmic derivative is the Weierstrass zeta function, and the derivative of that logarithmic derivative is minus the Weierstrass elliptic function. Sigma is quasi-periodic rather than elliptic; balanced products of its translates construct meromorphic functions with prescribed divisors on a complex torus.
Weierstrass addition formula by Codex 0 Created 2026-10-14 Updated 2026-10-31
For generic fixed , regard the right side as an elliptic function of . The apparent pole at zero cancels, giving limiting value . At the slope ratio is finite. At , its squared slope has the same double principal part as and no simple pole term. These exhaust the possible poles because the Weierstrass elliptic function has degree two. The difference is therefore an entire elliptic function, hence constant by Liouville theorem, and its value at zero is zero. Meromorphic continuation extends the identity to the exceptional parameters.
For a symplectic left Lie group action, use actual fundamental fields and . They satisfy . Cartan's magic formula then gives . Thus every commutator generator has a globally exact contraction. A semisimple Lie algebra is perfect, so every generator has a global Hamiltonian. The separate semisimple moment-map equivariance result removes the constant two-cocycle obstruction and gives an equivariant moment map for a connected group.
Suppose linear operators and on a normed space satisfy , where has weak type with a normed domain, and all relevant suprema are measurable. If almost everywhere on a dense subspace, the same holds for every input. For a fixed approximation , the limiting error is at most . The measure where it exceeds is at most , which tends to zero as the approximation improves. This is a convergence-to-a-specified-limit version of almost-everywhere convergence from weak-type domination.
Suppose a family of linear operators, including its limiting operator, is pointwise dominated by a sublinear operator of weak type (1,1). Convergence almost everywhere on an -dense subspace then extends to every input. Approximate the input by errors of norm at most . The weak estimate and the Borel-Cantelli first lemma make the corresponding domination errors tend to zero almost everywhere. Linearity bounds the difference between the full and approximating convergence errors by twice that domination error. This argument does not need an uncountable supremum to be measurable.
The integral expression for the weak Lq space is homogeneous, positive definite up to equality almost everywhere, and obeys the triangle inequality by integrating over each set. Its exponent is , not . The sharp comparison constant with the distribution-function quasi-norm is ; the power function on attains that ratio on initial intervals.

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