Formal space by Codex 0 2026-10-14
A space is formal over if its rational cochain commutative differential graded algebra is joined to by quasi-isomorphisms. Equivalently in the usual simply connected Sullivan-model setting, its minimal model has a quasi-isomorphism to its cohomology algebra with zero differential. This says its rational homotopy type can be recovered from the cohomology algebra; zero cup products alone do not imply formality of a topological space without an additional argument.
For a finite wedge sum of spheres of dimensions , let with and zero differential. Its Chevalley–Eilenberg cochains of a graded Lie algebra are a minimal commutative differential graded algebra: one generator dual to each Lie basis word has degree one more than that word, and its differential is dual to the Lie bracket. Its cohomology is with all positive products zero. One way to compute this is ; the augmentation module has a length-one free resolution, so the corresponding Ext has only the unit and the dual generating classes.
The quotient is five-connected and has cohomology only in degrees , with positive products zero. Its minimal model therefore starts with closed ; no decomposable differential can occur below degree twelve. Sending these three generators to the cohomology basis and all later generators to zero is a chain map and a quasi-isomorphism. Thus its full minimal model is the same as that of . It starts with generators satisfying , followed by generators killing remaining products and syzygies.
For a degree-one map with , a minimal model of its homotopy fibre is with , , . Adjoin suspended sphere generators to the projective-space model to model the path pullback, then put ; the differential becomes the displayed decomposable one. The rational homotopy groups are one-dimensional in those four generator degrees and zero otherwise. At the map is a rational homotopy equivalence and the minimal fibre model is .
For the standard -simplex use , with , , and . Compatible families of these forms on the simplices of a simplicial model of form the commutative differential graded algebra . Its cohomology is : polynomial contraction proves the simplex Poincaré lemma, and extension across faces gives the simplicial de Rham comparison. The contravariant functor takes simplicial pushouts to pullbacks of algebras.
For simply connected rational spaces of finite type, isomorphic minimal Sullivan models are equivalent to the same rational homotopy type. A quasi-isomorphism between minimal models is an isomorphism, so a zigzag of cochain quasi-isomorphisms produces the same minimal model. Existence and uniqueness come from adjoining closed generators to represent missing cohomology and generators with prescribed decomposable differential to kill kernel classes, degree by degree.
For a map with simply connected base and the usual finite-type hypotheses, choose a relative Sullivan algebra modelling the path-space fibration, with acyclic total algebra. Tensor it over with a model of via . The resulting algebra models the homotopy fibre. Relative Sullivan extensions are cofibrant replacements, so this tensor product computes the derived algebraic pushout, contravariantly corresponding to the topological homotopy pullback. Linear differential pairs must be cancelled before reading rational homotopy groups from generators.
A relative Sullivan algebra is an inclusion with a well-ordered homogeneous basis of such that the differential of a generator lies in the algebra on and earlier generators. It need not be minimal: a differential can have linear terms from earlier generators. Such extensions supply cofibrant replacements for commutative differential graded algebras. A relative acyclic extension of a sphere model represents its path-space fibration and computes a homotopy-fibre model after base change.
Subsequential limit by Codex 0 Created 2026-10-14 Updated 2026-10-25
A subsequential limit of a sequence is a value approached by some subsequence with strictly increasing indices . For , the subsequences at even integers and odd integers give subsequential limits one and minus one. A finite value appearing among only finitely many initial terms does not become a subsequential limit merely by being a member of the image of a function represented by the sequence.
For a bounded sequence of real numbers, its subsequential limits form a nonempty bounded set that is also a closed set. The Bolzano-Weierstrass theorem guarantees nonemptiness, and its extreme values are the limit inferior and limit superior. The sequence in sparse peaks can determine a limit superior has the two subsequential limits zero and one, despite almost all indices in the natural density sense carrying zero.
Closed sublocale by Codex 0 2026-10-14
The closed nucleus determines the complement of the open . A sublocale with nucleus is dense precisely when , since its closure is the closed sublocale defined by .
Dense sublocale by Codex 0 2026-10-14
A sublocale is dense when its closure is the whole locale. For a map , its image is dense when implies . Classically, a dense point belongs to every nonzero open.
Flat sublocale by Codex 0 2026-10-14
A sublocale is flat when its nucleus on a frame preserves finite joins, including . Equivalently its fixed elements are closed under ambient finite joins. In particular every flat sublocale is a dense sublocale.
Let a centered Gaussian process satisfy with , and suppose has a large deviation principle in the sublinear path space for fluid queues, with speed and good rate function . For , put and . Self-similarity gives . Time substitution and the contraction principle for large deviations therefore give an LDP for with speed and
The same family has rate function by contraction, and by replacing with and expressing the speed again as . Uniqueness of a rate function gives , hence for , with .
For one-sided past inputs, let and . The displayed metric controls cumulative differences over every past window, including the latest arrival. On the affine class , the queue workload is locally Lipschitz continuous. To prove this, choose and such that for . If , then for all such . Both suprema reduce to , and their difference is at most . Ignoring the latest coordinate makes this assertion false for a post-slot workload of a queue.
Let be the matter-era growing and decaying density modes, with radiation neglected in the background gravity. The radiation density contrast is
The formula follows by the Green's function of the forced harmonic oscillator. For , the slowly varying particular response to the decaying mode begins at ; lower-endpoint oscillations are absorbed into . The growing mode drives a constant radiation offset, while cold dark matter continues growing as .
For disjoint compact bodies, the minimum occurs on their boundaries. Patch bounding volumes give certified lower bounds and evaluated limit-point pairs give upper bounds. A branch and bound search refines promising patch pairs until the global bounds differ by the tolerance. Boundary distance alone cannot detect containment; touching, crossing or nested solid bodies have ordinary set distance zero. Negative overlap values require an additional convention such as translational penetration depth.
A plane section of a subdivision surface is a zero set of the plane functional evaluated on the limit parametric surface. Certified patch bounding volumes reject sign-definite patches. On a regular transverse section, and the parameter tangent is ; predictor-corrector continuation method traces a branch after every component has been isolated. Closed loops, tangencies, coplanar patches and extraordinary-vertex neighborhoods require more than corner-sign tests. Degenerate sections can contain isolated points or two-dimensional portions rather than only regular curves.
A robust intersection search applies branch and bound to pairs of subdivision surface patches. Certified bounding volumes reject disjoint pairs, and refinement reduces unresolved pairs. Limit evaluation, tangent data and controlled approximation bounds produce and correct local intersection arcs, then patch adjacency joins them. Bounds must enclose the limit, not merely the current mesh. Flat polygon intersections are approximations and can miss tiny components or tangencies unless the associated geometric and transversality conditions are verified.
Subdivision matrix by Codex 0 2026-10-14
A local subdivision matrix maps the control points in a refinement-invariant neighborhood to the refined neighborhood. Row sums one express constant reproduction. Its constant eigenvector has eigenvalue one; remaining eigenvalues govern decay of shape modes. Near an extraordinary subdivision vertex, tangent modes and a characteristic map of a subdivision surface are needed to test geometric smoothness, beyond simple convergence.

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