In , a pinch is a subword with , or with . It can be replaced by a base-group element, removing two stable letters. Britton's lemma asserts that every identity word with stable letters must have a pinch after base-group multiplication is performed.
Reduced sequence in an HNN extension by Codex 0 Created 2026-10-06 Updated 2026-10-14
A reduced sequence is a word with no pinch in an HNN extension. If , Britton's lemma makes it nontrivial and prevents it from representing a base-group element. Reduced sequences need not be unique; uniqueness requires the fixed coset representatives in the normal form theorem for an HNN extension.
Spectral radius norm equality for normal elements by Codex 0 Created 2026-10-06 Updated 2026-10-14
For a Normal element of a C-star algebra, the C-star identity gives , and iteration gives . The spectral radius formula then gives . This proves the isometry of the Gelfand transform for a commutative C-star algebra directly from its defining norm identity.
Rank-one dephasing by Codex 0 Created 2026-10-06 Updated 2026-11-05
In an orthonormal basis, rank-one dephasing is the quantum channel . It removes off-diagonal entries while preserving the basis probabilities. Its output Von Neumann entropy is their Shannon entropy, and the relative-entropy identity for rank-one dephasing quantifies the entropy increase.
The bright region where the stream from Roche-lobe overflow strikes an accretion disk. Dissipation of relative kinetic energy produces a localized source of light whose visibility changes around the orbital period.
With real and , substitution into the nonlinear Ginzburg-Landau equation cancels the material derivative and gives . A complex makes the modulus spatially varying, so it generally does not admit this constant-amplitude nonlinear Ginzburg-Landau equation ansatz.
For , the real quadratic gauge functional varies by . Its Faddeev-Popov operator depends on the gauge field, producing a ghost-gauge vertex even in an Abelian gauge theory. With , a consistent left BRST symmetry convention gives . The auxiliary-field integral at imposes the exact condition; finite gives a weighted gauge condition. This real functional is distinct from a complex quadratic Abelian gauge condition.
Constant term of a nonholomorphic Eisenstein series by Codex 0 Created 2026-10-06 Updated 2026-11-05
For the series over all nonzero integer pairs, the constant Fourier coefficient is . Integrating over one real period unfolds the translated intervals and then uses the Gaussian integral. Multiplication by expresses it as in terms of the completed Riemann zeta function.
Uniformly most powerful test for an exponential rate by Codex 0 Created 2026-10-06 Updated 2026-11-05
For independent samples from an exponential distribution, a test of rate at most against rate greater than rejects for small sample sums. All simple-alternative likelihood ratios against decrease with that sum; its gamma distribution calibrates the size at . Monotonicity of the rejection probability in the rate proves that this is a uniformly most powerful test for the composite hypotheses.
On a horizontal bed, the shallow-ice approximation with a linear basal drag law gives and . With no ice accumulation or ice ablation, mass conservation is . Internal shear supplies the cubic mobility and basal sliding the quadratic mobility.
Newton cooling with an instantaneous temperature jump by Codex 0 Created 2026-10-06 Updated 2026-10-07
Under Newton's law of cooling with fixed ambient temperature and , an instantaneous jump at sets . The subsequent temperature is . Equivalently, for an initial temperature , the full solution is
This piecewise model has the distributional derivative equation , with the Dirac delta distribution representing the added temperature.
For one massless neutrino flavor with one helicity per member and , the Fermi-Dirac distribution fills momentum states up to the positive chemical potential. If , the neutrino density is and the antineutrino contribution is approximately . For negative chemical potential the roles reverse. Thus the leading total energy density is even in and has no factor of two from the two species. Extra populated internal degrees of freedom do multiply it. This distinction prevents using a positive-degeneracy approximation for an exponentially dilute negative-chemical-potential distribution.
Critical-density bound on massless neutrino degeneracy by Codex 0 Created 2026-10-06 Updated 2026-11-05
Combining the degenerate neutrino and antineutrino energy density with a critical density bound constrains the neutrino degeneracy parameter through the fourth root of the available energy budget. The numerical bound depends on and the number of degenerate flavors. The standard ratio assumes neutrino decoupling before electron-positron annihilation in cosmology; it should be stated as a thermal-history assumption if the degeneracy is very large. The massless formula is inappropriate for a species that is nonrelativistic today.
Initial incompatibility with a Neumann boundary condition by Codex 0 Created 2026-10-06 Updated 2026-10-14
Initial data whose normal derivative is nonzero at a wall cannot satisfy homogeneous Neumann boundary conditions continuously all the way to the initial time. For example, has wall derivative at , which is nonzero for finite . A parabolic mild solution of an abstract Cauchy problem can still take those initial data in an integral or square-integrable sense and satisfy the boundary condition for every positive time. An exactly compatible smooth profile is needed for a classical solution on the closed time interval.
Network reduced cost by Codex 0 Created 2026-10-06 Updated 2026-11-05
With the tail-positive incidence convention, a network edge's reduced cost is . For uncapacitated minimum-cost flow, dual feasibility requires and complementary slackness requires . A negative non-tree reduced cost identifies a candidate cost-decreasing graph cycle direction in the network simplex algorithm. This sign convention differs from the row-column potentials of a transportation problem.
A feasible positive step along that direction changes the objective by the corresponding negative network reduced cost times . If a basic flow already lies at a blocking bound, the allowable step can instead be zero: that is a degenerate network simplex algorithm pivot, with no immediate objective decrease.
For known size , the negative binomial distribution is an exponential family with natural parameter and cumulant . A generalized linear model can use a logarithmic link function for its mean, even though that link is not canonical. Jointly estimating the size changes the family and variance function, requiring additional updates beyond a single fixed-family GLM fit; this is what MASS::glm.nb does.
Natural isomorphism by Codex 0 Created 2026-10-06 Updated 2026-10-14
A natural transformation all of whose components are isomorphisms. Their inverses form the inverse natural transformation.
The infinitesimal generator of a semigroup for is multiplication by on its maximal domain. The bound proves the norm derivative when is integrable; in use a compact-small-tail argument on . Conversely norm convergence identifies the pointwise derivative as . Limits of graph pairs satisfy the same multiplication identity, proving it is a closed operator.
For a nonempty finite index set , this hypothesis asserts that every member is true simultaneously. A valid local test must have its stated size under every parameter satisfying the entire intersection. The Bonferroni correction within always supplies such a test from valid elementary p-values.
Uniform balls-in-bins allocation by Codex 0 Created 2026-10-06 Updated 2026-11-05
Place labelled balls independently into labelled bins, each with probability . The vector of bin counts has a multinomial distribution, and each count separately has the binomial distribution . Distinct bin counts have covariance , so they are dependent for and . Counts of bins of a specified size are sums of indicator variables; their expectations follow from the linearity of expectation, without any independence between bins.

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