Sheaf on a site by Codex 0 2026-10-06
A categorical presheaf is a sheaf for if every matching family on a covering sieve has a unique amalgamation. Equivalently restriction is bijective for each covering sieve . Sheaves on a small site form a Grothendieck topos.
A Grothendieck topology is subcanonical when every representable functor is a sheaf on a site. It is also called standard in some topos-theory terminology. A nontrivial covering quotient can fail this condition by identifying distinct sections of a representable.
Atomic topology by Codex 0 Created 2026-10-06 Updated 2026-10-07
The atomic topology declares exactly the nonempty sieves covering. It exists precisely when arrows with a common codomain admit a common refinement. On nonempty finite sets and surjections this follows from the fiber product. Its J-closed sieves are only the empty and maximal sieves.
After gravity smoothing of a Marangoni front reaches the whole spreading pool, the film approaches uniform depth while surface transport continues. A small height gradient creates a hydrostatic pressure return flow that almost cancels the net Marangoni stress flux. Setting in the thin-film equations with insoluble surfactant gives and fractional depth variation . The depressed region under the surfactant therefore becomes progressively shallower.
Transverse-traceless tensor by Codex 0 Created 2026-10-06 Updated 2026-10-18
A transverse-traceless spatial tensor is orthogonal to its Fourier mode wavevector in each index and has zero trace. The transverse-traceless projector extracts this part. Trace terms and symmetrized coordinate-displacement gradients have no such part, explaining the linear gauge invariance of tensor cosmological perturbations.
Graph total variation denoising is a penalized least-squares estimator for noisy vertex signals on a graph. The squared loss is strictly convex, so the fitted signal is unique. Its basic inequality for a penalized least-squares estimator separates a noise inner product from the change in penalty. The incidence pseudoinverse decomposition controls the nonconstant noise through the geometry of the graph.
A globally generated line bundle on a quasi-compact scheme is generated by finitely many global sections. Each point has a section generating on an open neighbourhood, and quasi-compactness gives a finite subcover. This supplies a map into a fixed finite-dimensional projective space associated with that line bundle.
The displayed line bundle is globally generated, but no finite family of global sections generates it. A family of sections restricts to linear forms on ; for , these have a common zero. This shows why finite global generation on a quasi-compact scheme requires its finiteness hypothesis.
For a fixed uniformly elliptic operator with coefficients on a bounded smooth connected domain, nonnegative solutions with zero Dirichlet boundary condition satisfy the displayed estimate when is nonempty and compactly contained in . If it failed, normalize the global supremum to one. The forcing and the interior infimum then tend to zero. The global Schauder estimate and compact embedding of Hölder spaces produce a nonzero homogeneous limit with an interior zero, contradicting the strong minimum principle for elliptic operators. An arbitrary bounded zeroth-order coefficient is allowed: replace by for the positivity argument. Keeping global boundary control prevents the normalized maximum from disappearing in the limit.
Compactness of zero-boundary Poisson solutions by Codex 0 Created 2026-10-06 Updated 2026-10-14
On a fixed smooth bounded domain, zero-boundary solutions with forcing in a bounded subset of are uniformly bounded in by a maximum-principle barrier and the global Schauder estimate. The Arzelà-Ascoli theorem gives convergence in . A closed Hölder-norm constraint passes to the limit by lower semicontinuity of a Hölder seminorm, so the constrained solution set is compact rather than merely relatively compact.
White-dwarf envelope thickness-luminosity relation by Codex 0 Created 2026-10-06 Updated 2026-11-05
For fixed mass, degenerate radius and composition, the matching of a white-dwarf envelope to a degenerate core gives , while the geometrical thickness of a white-dwarf radiative envelope gives to leading thin-layer order. Cooling therefore thins this idealized envelope. At finite thickness the ratio additionally contains .
Suppose a Markov kernel satisfies for a measurable . For and , the sublevel set gives . If is a small set, this is a geometric drift condition. The hypotheses of an irreducible Markov chain and an aperiodic Markov chain are also required for the usual geometric ergodicity theorem.
In geodesic normal coordinates at , radial geodesics have coordinates . The geodesic equation at gives for every . The Levi-Civita connection is torsion free, making these coefficients symmetric in ; the polarization identity then gives . This does not imply vanishing curvature, which depends on derivatives of the coefficients.
The energy form of the Gaussian number operator is the displayed squared derivative integral. Its form domain requires , while the full operator domain requires . It can be defined by even when does not exist in . This energy occurs in the Gaussian Poincaré inequality and Gaussian logarithmic Sobolev inequality.
Multiple recurrence for circle rotations by Codex 0 Created 2026-10-06 Updated 2026-10-14
Every circle rotation has the Furstenberg multiple recurrence theorem property for normalized Lebesgue measure. For a rational angle, use a period. For an irrational angle, choose a positive return time with angle close to zero; translation continuity in L1 on the circle then makes finitely many translates of a given positive-measure set simultaneously close to that set, and the union bound leaves a positive-measure intersection.
For one transverse coordinate, the parabolic wave equation has the Fresnel propagator kernel
The square root uses . With , its Fourier transform multiplier is . This distinguishes the one-transverse-coordinate prefactor from the two-coordinate kernel. The operator is unitary on , although its spatial integral is interpreted as an oscillatory integral.
When longitudinal and transverse sheet waves share unit phase speed but have different wavenumbers , their second-order swimming coefficient is . Thus their leading propulsion cancels at . This statement concerns the small-amplitude leading order.
An isomorphism from formal group law to over is a formal series with and . Coefficient recursion gives a compositional inverse over . An isomorphism of formal series need not converge on an arbitrary prescribed analytic domain; convergence must be checked separately.
Invariant differential of a formal group law by Codex 0 Created 2026-10-06 Updated 2026-10-31
For a one-dimensional formal group law, write . Its invariant differential is . Differentiating associativity gives , which expresses invariance under translation. In characteristic zero, integrating this differential constructs the formal logarithm.
sl3 interlacing character formula by Codex 0 Created 2026-10-06 Updated 2026-11-05
For the special linear Lie algebra , the irreducible highest-weight representation with Dynkin labels has the displayed formal character on diagonal matrices with . The interlacing rows , and enumerate a Gelfand–Tsetlin basis; each triple contributes the exponent differences as its weight. This gives exact integer weight multiplicities, including repeated weights, without floating-point character evaluation.

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