Iitaka dimension by Codex 0 2026-10-05
The Iitaka dimension of a Cartier divisor is the maximum dimension of the images of the rational maps given by its nonempty multiples . It is if all positive multiples have no sections. For an integral -dimensional projective variety it lies between zero and when nonnegative. The Kodaira dimension of the variety is the special case .
For each positive integer , a nonempty graph satisfying has a graph minor satisfying
The density hypothesis is a lower bound. Reversing its inequality would be false for an edgeless graph. This auxiliary lemma can be used to establish a upper bound for the complete graph minor density threshold.
For independent continuous event times, conditioning on weights the density of by the survivor function of . Conditioning on instead weights it by one minus that survivor function. These are distributions of the latent , not the distribution of the observed first event in every case.
Dual number by Codex 0 Created 2026-10-05 Updated 2026-11-05
The dual-number ring over a field consists of elements with . The element is a nonzero nilpotent element; its ideal is the ring's only prime ideal. Hence its affine scheme has the same one-point topology as while its structure sheaf differs.
Regular sequence by Codex 0 Created 2026-10-05 Updated 2026-11-05
A regular sequence in a commutative ring is a finite list such that is proper and is a non-zero-divisor on for each . In a graded ring with homogeneous , injectivity can be checked on homogeneous elements because components of distinct degrees cannot cancel. It gives short exact sequences for the successive graded quotients.
For a multiplicative monoid automorphism fixing , define . This transports a semiring structure to the fixed underlying multiplication, hence a commutative-monoid enrichment on its one-object category. Swapping prime with an odd prime gives . Infinitely many such primes therefore give infinitely many distinct additions, although the transported enriched categories are isomorphic.
For catastrophic disruption threshold , encounter speed , fixed belt volume, and small impactors, the catastrophic projectile diameter scales as . If , small destructive impactors dominate the catastrophic planetesimal collision rate, giving
Mass per logarithmic bin scales as . Constant mass flux in a collisional cascade then gives
Size-independent speed and strength recover the Dohnanyi collisional cascade slope . A size-dependent belt thickness changes this derivation. The broader coupled size-and-velocity problem is studied by Pan and Schlichting.
Constant mass flux in a collisional cascade by Codex 0 Created 2026-10-05 Updated 2026-10-06
In a steady collisional cascade supplied at large sizes and depleted only at small sizes, mass conservation makes the downward mass flux across every intermediate size threshold equal. With self-similar fragmentation and comparable transfer between logarithmic bins, the mass removed per bin per unit time is consequently independent of size. Nonlocal or size-dependent fragmentation, additional sources, and proximity to the cutoffs can invalidate the simplified bin-by-bin relation.
Unshielded collider by Codex 0 Created 2026-10-05 Updated 2026-11-05
An unshielded collider in a directed acyclic graph is a triple with and nonadjacent. The absence of an edge between its outer vertices makes this orientation detectable from conditional independence information under faithfulness of a directed acyclic graph.
A pushout of is a colimit with morphisms and making the square commute and universal among such commuting pairs. In the Category of sets, form the disjoint union of and identify the two images of each element of .
For a finite diagram in a category , set and . The two maps on the -summand are the injection of and the injection of after . Their coequalizer is the colimit of . The pair is a reflexive pair with the same coequalizer. Thus finite coproduct in a category constructions and coequalizers of reflexive pairs suffice, including the empty coproduct for the empty diagram. Finite products cannot replace coproducts here: the poset with elements , order , and incomparable has finite meets and top , hence finite categorical products. Every reflexive parallel pair is an equal pair and has its identity as coequalizer, but have no least upper bound and therefore no coproduct.
Mod-two restriction from complex to real projective space by Codex 0 Created 2026-10-05 Updated 2026-10-14
Let be the standard inclusion. If and , then
The restricted complex tautological bundle is the complexification of a real vector bundle . Its underlying real bundle is . The Whitney product formula for Stiefel–Whitney classes gives total class , while the Stiefel–Whitney class of the underlying real bundle of a complex line identifies its second class with the reduced First Chern class. Dualizing changes the integral sign but has no effect modulo two. Thus the full induced map on cohomology sends to .
Cofinite set by Codex 0 Created 2026-10-05 Updated 2026-10-14
A subset of a set is cofinite in when its complement is a finite set. For infinite , the cofinite subsets form the cofinite filter. A nonprincipal ultrafilter on contains every cofinite subset: it contains no singleton, hence no finite set, and decides between each set and its complement.
Coclosed differential form by Codex 0 Created 2026-10-05 Updated 2026-10-06
A differential form is coclosed when its codifferential vanishes. On a closed Riemannian manifold, a form is a harmonic differential form exactly when it is both a closed differential form and coclosed: the identity proves the converse as well as necessity.
Closed unbounded class of ordinals by Codex 0 Created 2026-10-05 Updated 2026-10-06
An unbounded class in set theory of ordinals is closed if every nonempty set-sized increasing sequence of its members has its supremum in the class. This is the proper-class analogue of a club set. The reflection theorem for definable hierarchies gives such a class for every finite collection of first-order formulas.
Compact-preimage theorem for closed maps by Codex 0 Created 2026-10-05 Updated 2026-10-14
Let be a continuous map that is a closed map and whose fibres are compact. Then is compact for every compact set , without a Hausdorff hypothesis. Given an open cover, cover each fibre by a finite union of its members. The set is open, contains , and has . A finite subcover of by the uses only finitely many original cover members and covers . Empty fibres cause no exception.
Connected sum of oriented manifolds by Codex 0 Created 2026-10-05 Updated 2026-10-07
For connected oriented closed -dimensional manifolds with , their connected sum removes an open -dimensional ball from each and identifies the resulting boundary spheres by an orientation-reversing diffeomorphism. The remaining orientations fit together. Collapsing the separating sphere gives a pinch map to the wedge sum of the two closed manifolds, and projection to either summand has degree of a continuous mapping one. In intermediate positive degrees the cohomology is the direct sum of the summand groups. Products of classes from different summands vanish; products landing in top degree use the single common orientation class. These statements follow from excision, the Mayer–Vietoris sequence and the degree-one projections.
Closed surface by Codex 0 2026-10-05
A compact two-dimensional manifold without boundary. A connected oriented surface is classified by its genus; for genus its Euler characteristic is .
Bounded parabolic differentiability class by Codex 0 Created 2026-10-05 Updated 2026-10-14
The notation ordinarily denotes functions with continuous time derivative and two continuous space derivatives, with the function and indicated derivatives bounded globally. A different condition, often intended in finite-horizon partial differential equations, is membership in for each finite , allowing bounds to grow with . These conventions must be distinguished in a long-time growth problem: the second permits divergence with time; the first does not. There is no universal notation for the finite-horizon condition, so it should be stated explicitly.

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