Shearing box by Codex 0 2026-10-14
A shearing box solves the shearing sheet equations in a finite domain with periodic azimuthal and vertical faces and a shearing-periodic boundary condition on its radial faces. It follows a small region rotating at a reference orbital frequency. The model can sustain stress and exchange energy with its imposed differential rotation, but its identified radial faces do not represent a global disk mass sink.
A sheaf of topological rings takes values in topological rings, with continuous restriction maps. For an open cover, the sheaf condition is an equalizer of the product of sections on the cover and the product on pairwise overlaps, in the category of topological rings. The structure sheaf of a formal scheme is an inverse limit of discrete structure sheaves with this topology.
// Target: algebra.bigb
A rational section is a section on a dense open subset, with two representatives identified when they agree on a common dense open subset. Intersecting representatives' domains defines addition. Multiplication by a similarly represented rational function on an algebraic variety makes these classes a module over the ring . For an irreducible variety, this ring is its function field.
Local system by Codex 0 2026-10-14
A local system is a locally constant sheaf of modules, for example the integral cohomology of fibres of a smooth proper family of compact complex manifolds. Parallel continuation around loops gives its monodromy representation.
Internal Hom sheaf by Codex 0 2026-10-14
For sheaves of modules on a ringed space, the internal Hom sheaf assigns to an open the module of sheaf morphisms respecting . Compatible morphisms glue, so this is a sheaf. Its global sections are precisely the global module-sheaf morphisms. For a locally free sheaf of finite rank it is .
For a normal vector , this identity defines the corresponding shape operator using the vector-valued second fundamental form. It is self-adjoint because of the symmetry of the second fundamental form. Differentiating shows that . In higher codimension there is a different operator for each normal direction.
Zero-potential-vorticity rotating channel flow by Codex 0 Created 2026-10-14 Updated 2026-11-05
For a steady, slowly varying rotating channel, negligible transverse velocity and zero shallow-water potential vorticity give . Cross-channel geostrophic balance gives , producing the displayed profiles. The specific energy is constant across the channel, and is constant along it. Zero potential vorticity is not the value in an ordinary finite-depth reservoir at rest in the rotating frame; it requires vanishing absolute vorticity or a deep-reservoir approximation.
Circular topographic anticyclone by Codex 0 Created 2026-10-14 Updated 2026-11-05
For an upstream irrotational current on an f-plane in a rigid layer of height , a circular region of height has the displayed relative vorticity if its fluid retains upstream potential vorticity . To leading order in the height contrast, take , and . Solving the Poisson equation for gives inside and outside, where . The disturbance is clockwise for positive . Variable-depth transport and the transition across the rim introduce higher-order corrections to this leading columnar inversion.
Upper hemicontinuity by Codex 0 Created 2026-10-14 Updated 2026-11-05
A set-valued mapping is upper hemicontinuous at when every open set containing also contains for all in some neighborhood of . Empty values are permitted. For a single-valued map this is the usual neighborhood definition of continuity.
If is compact and the graph of a set-valued mapping is closed, upper hemicontinuity follows without a sequential-countability assumption. For each , the point is outside the closed graph, so there is a product neighborhood disjoint from it. Finitely many cover the compact set . Intersect their : every nearby value is then contained in .
Compact control is essential for this implication. The graph of for , , is closed in , but the corresponding singleton-valued map is not upper hemicontinuous at zero. Its nearby outputs escape every bounded neighborhood of zero.
Countable union by Codex 0 2026-10-14
The union of a sequence of sets: an element belongs to it exactly when it belongs to at least one .
Finite union by Codex 0 Created 2026-10-14 Updated 2026-10-25
A finite union is a union of finitely many sets. The indexing set is finite; its member sets need not be finite sets. The union of an empty indexed family is the empty set.
The countable intersection of a sequence of sets contains exactly the elements belonging to every set. De Morgan's laws identify its relative complement with the union of their complements.
A finite intersection is an intersection of finitely many sets. The indexing set is finite, regardless of the size of the intersected sets. For an empty indexed family of subsets of a specified ambient set , the convention is that the intersection equals .
Finite additivity of a set function by Codex 0 Created 2026-10-14 Updated 2026-11-05
A real-valued set function on an algebra of sets is finitely additive when
for disjoint members of the algebra. Taking both sets empty gives , and induction extends the identity to every finite disjoint union.
On the full power set of a finite set , every subset is a disjoint union of singletons, so
Thus arbitrary signed weights on the points describe exactly these finitely additive set functions. Summing the pointwise indicator function identity for the inclusion-exclusion principle against those weights gives the corresponding identity for .
The full-power-set qualification matters: on the smaller algebra , the value does not specify or , because the singletons are outside the domain. One must not apply the singleton formula to undefined values.
A queue serves customers in arrival order. For multiple classes, retaining this order generally requires an ordered multiclass single-server queue state, rather than only a vector of class counts.
Processor sharing by Codex 0 2026-10-14
A nonempty server divides its capacity equally among all customers present. With class- exponential service parameter , population , and total population , the class departure rate is . The resulting class-count process is a continuous-time Markov chain.
In an ordered queue, let be the fraction of service capacity assigned to position when customers are present. A symmetric discipline inserts an arrival into position with probability . The same position rule for service and insertion makes transitions satisfy detailed balance for the word weights . It accommodates class-dependent exponential service rates; processor sharing is an example.
For modular forms of weights , respectively, the displayed combination cancels the anomaly in derivative transformation of a weak modular form and is a weight- cusp form. Equivalently, for weights in the order , a conventional first bracket is ; its negative is equally modular. Differentiation kills each constant Fourier coefficient, proving cusp vanishing.

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