With convention , choose representatives of the right cosets of and in the base group, with identity representing each subgroup. Normal strings have the form , where represents a coset of for and of for , and when adjacent exponents are opposite. Left multiplication by base elements or stable letters defines permutations of these strings. They satisfy the HNN relations. Applying the induced action to the empty string distinguishes different normal strings, proving uniqueness without presupposing Britton's lemma.
// Target: geometry-and-topology.bigb
For normal , the closed unital C-star subalgebra generated by is commutative. When the ambient spectrum is real, its complement is connected. Membership of the resolvent in this subalgebra is both open and closed on that complement, and holds at large modulus by the Neumann series. Thus the subalgebra spectrum is the same real set. Its isometric Gelfand transform takes to a real-valued function and to its conjugate, proving equality. Normality is necessary: the nonzero matrix has spectrum but is not self-adjoint.
The unital continuous functional calculus has image , the norm closure of star polynomials including constants. The smallest closed star subalgebra need not contain the ambient identity: for it is zero. In a nonunital algebra, apply the unital calculus in the C-star unitization and retain functions vanishing at zero to recover inside the original algebra.
Since a normal C-star element commutes with its adjoint, words in those two generators can be rearranged into the displayed finite sum. Including the constant term generates the unital star algebra; omitting it generates the nonunital star algebra. Under continuous functional calculus, such a sum is the ordinary function on the spectrum. The Stone-Weierstrass theorem makes these functions uniformly dense.
Choose an orientation of a vector space on . The quotient identification for a regular value gives a smoothly oriented normal bundle along . An oriented normal frame followed by a frame of defines the latter's orientation through the ambient orientation. Changing normal lifts adds only tangent components, so the determinant sign is unchanged. No orientation on all of is required.
Continuity correction by Codex 0 Created 2026-10-14 Updated 2026-11-05
A Continuity correction shifts a discrete Probability boundary by half a lattice spacing before using a continuous normal approximation. For an upper-tail event on a unit lattice, the approximation is . Lower tails use the boundary . The correction is used in approximate Wilcoxon signed-rank tests and Wilcoxon rank sum tests; tied ranks also require the appropriate variance adjustment.
For a twice continuously differentiable regular curve describing motion, let , , and let be the principal normal vector where the curvature is positive. Differentiating the velocity vector gives
The tangential component changes the speed; the normal component changes the direction of the velocity vector. A particle can therefore have nonzero acceleration at constant speed, as in circular motion with constant speed. The formula follows from and the product rule. When , the normal contribution vanishes even though the principal normal vector is undefined there. [ref]
In dimensionless coordinates, take . At ,
The resulting vector components are
Both increasing speed and turning contribute to the same acceleration.
Figure 1.
Acceleration on a parabola has both tangential and normal parts
. At , the acceleration is the sum of tangent to the path and normal to it. This is a dimensionless mathematical trajectory. Details.
Pinching map by Codex 0 Created 2026-10-14 Updated 2026-11-05
For mutually orthogonal projectors summing to the identity, a pinching map discards coherences between their ranges while preserving each diagonal block. It is a quantum channel with Kraus operators , and a unital quantum channel. A state is fixed by pinching exactly when it commutes with every projector.
In Synchronous gauge in cosmology with coordinates comoving with cold dark matter, the linearized Einstein field equations and matter conservation give the displayed density equation. Primes denote conformal time derivatives. The radiation term contains its pressure contribution and cannot be dropped on superhorizon scales merely because radiation oscillates after cosmological horizon entry.
Eigenbasis proof of quantum relative entropy nonnegativity by Codex 0 Created 2026-10-14 Updated 2026-11-05
Diagonalize two density operators with eigenvalues , and put . This overlap matrix has row and column sums one. The scalar inequality yields in natural units; division by gives bits. Equality forces whenever , so and . Zero eigenvalues use limits, and failure of support inclusion gives infinite quantum relative entropy.
An irreducible Markov chain is recurrent exactly when every nonnegative superharmonic function for a Markov chain is constant. In the recurrent case, absorb the chain at . The inequality and almost-sure hitting give ; exchange . In the transient case, the hitting probability of a state is one there and satisfies the superharmonic inequality, but its one-step average at is the strictly smaller return Probability. It is a nonconstant example.
Primitive real-analytic Eisenstein series by Codex 0 Created 2026-10-14 Updated 2026-11-05
For this Eisenstein series also equals , where consists of translations and their negatives. It is modular invariant. The nonholomorphic Eisenstein series summed over all nonzero integer pairs instead equals : separate each pair into a positive integer times a primitive pair. This normalization matters in Rankin–Selberg unfolding.
Completed nonholomorphic Eisenstein series by Codex 0 Created 2026-10-14 Updated 2026-11-05
This modular-invariant function, initially defined for , has Fourier expansion
where is the completed Riemann zeta function, without the entire-xi polynomial factor. Poisson summation and the integral representation of the modified Bessel function of the second kind prove the expansion. It gives meromorphic continuation, , and simple poles at zero and one with residues . Apparent poles at cancel between the two constant terms.
Parametrize one ellipse as and substitute it into the quadratic equation of the other. At a transverse intersection, has a simple zero, so its sign changes. Periodicity makes the number of zeros even. The function is a trigonometric polynomial of degree at most two, so multiplication by , with , gives a nonzero polynomial of degree at most four. Hence there are at most four distinct intersection points. Coincident ellipses are excluded by transversality.
Reciprocal moment of a noncentral chi-squared variable by Codex 0 Created 2026-10-14 Updated 2026-11-05
For with , completing the square in its Gaussian representation gives . Integrate the identity and use Tonelli theorem to obtain the displayed reciprocal moment. It is strictly decreasing in , since its positive integrand is strictly decreasing for every . At the integral equals , proving finiteness and the sharp maximum over noncentrality parameters.
If an autoregressive model has white noise of positive variance, a unique weakly stationary process solving its equation on all integer times exists precisely when its autoregressive polynomial has no root on the unit circle. In that case has an absolutely summable Laurent series on an annulus containing the unit circle; its coefficients define a bilateral linear filter of a stationary time series. Applying that inverse also proves uniqueness among bounded second-moment solutions. A root on the unit circle forces the candidate spectral density of a stationary process to have a nonintegrable singularity. The stronger causality root criterion for an autoregressive model requires every root outside the closed unit disk.
The real matrix has both eigenvalues equal to one, whereas for . Hence no universal constant bounds this quotient by the maximum eigenvalue of every real matrix with real eigenvalues.
Extend the interior grid vector by zero. With axial weights and diagonal weights , the negative central coefficient equals the total neighbour weight. Expanding the edge-square sum gives the displayed quadratic form. Equality forces all axial differences to vanish, and connection to the zero exterior forces the vector to be zero. Simultaneous row and column permutations preserve symmetry and negative definiteness.
The Jacobi method has axial neighbour weights and diagonal weights . Interior row sums are one, boundary-adjacent sums are smaller, and the positive-weight graph is connected. If an eigenvalue had modulus one, a maximal-modulus eigenvector component would force all its neighbours to have the same modulus. Propagation reaches a deficient row, a contradiction. This proves strict spectral-radius control even though the infinity norm of the iteration matrix can equal one.
Let have center weight , axial weights and diagonal weights , and let have center weight and axial weights . Taylor expansion gives and . On a smooth solution of the constant-coefficient Helmholtz equation, the second-order term becomes . Thus the normalized PDE residual is fourth order, while the original unscaled stencil residual is sixth order. This local cancellation alone does not prove uniform global accuracy at or near a resonance.

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