Let be the section of with one coordinate fixed at , and put . The corresponding section of its closed graph neighbourhood is
After coordinate compression, the three sets on the right are nested initial simplicial segments. Their union therefore has the largest of their three cardinalities, which is no larger than the original union.
On , the variables
converge in Probability and in to zero, while for every .
Convergence in L2 by Codex 0 Created 2026-10-03 Updated 2026-11-05
Quantum triviality by Codex 0 Created 2026-10-03 Updated 2026-11-05
Quantum triviality means that removal of the cutoff forces the renormalized interaction to vanish, leaving a free continuum theory. Keeping a nonzero interaction then requires treating the model as an effective theory with finite cutoff.
Asymptotic safety by Codex 0 Created 2026-10-03 Updated 2026-11-05
An asymptotically safe quantum field theory approaches a non-Gaussian ultraviolet fixed point with finitely many relevant directions. Those relevant coordinates are fixed by finitely many measurements.
Banach space of bounded linear operators by Codex 0 Created 2026-10-03 Updated 2026-10-14
If is a normed vector space and is a Banach space, then the bounded linear maps form a Banach space under the operator norm. Completeness of the domain is unnecessary.
Constructible universe by Codex 0 Created 2026-10-03 Updated 2026-10-05
The constructible universe is the inner model obtained by iterating the definable power set. It satisfies ZFC and the Generalized continuum hypothesis.
Given a finite-product category and a product-closed upward filter of subobjects of its terminal object, a morphism in is represented by a map for , with two representatives identified when they agree after restriction to some below both domains. This construction preserves finite products and, when is Cartesian closed, exponentials.
Composition length by Codex 0 Created 2026-10-03 Updated 2026-11-05
The composition length of a finite-length module or group is the number of simple factors in a composition series. The Jordan–Hölder theorem makes this independent of the chosen composition series.
Imaginary axis by Codex 0 Created 2026-10-03 Updated 2026-10-14
The imaginary axis is the set of complex numbers with . It is the vertical coordinate axis in the complex plane.
Suppose theories and finite have the same models. Let be the conjunction of . Since , compactness supplies a finite with . Conversely , so and have the same models. Thus an axiomatization equivalent to a finite theory contains a finite equivalent subaxiomatization.
If a theory axiomatized the well-orders, adjoin constants and the sentences . Every finite fragment has a finite well-ordered model, but compactness would produce a model with an infinite descending chain.
If a first-order theory had exactly the finite structures in a class containing arbitrarily large members, adjoin constants and require them to be pairwise distinct. Every finite fragment has a sufficiently large finite model, while compactness produces an infinite model, a contradiction. In particular, finite groups are not first-order axiomatizable.
On the punctured Euclidean plane, the orthonormal polar frame is
Its bracket is , so it is not a coordinate basis even though is one.
Graph-diagonal formula for the Lefschetz number by Codex 0 Created 2026-10-03 Updated 2026-10-14
For the graph map , the cohomology class of the diagonal satisfies
If is fixed-point-free, its graph misses the diagonal, so the pullback vanishes. This proves the Lefschetz fixed-point theorem for closed oriented manifolds.
Cofinal function by Codex 0 Created 2026-10-03 Updated 2026-10-06
A function between ordinals is cofinal when its range is unbounded in : for every some satisfies .
Pseudoreplication by Codex 0 Created 2026-10-03 Updated 2026-10-18
Pseudoreplication treats dependent measurements from the same experimental unit as if they were independent treatment replicates. It exaggerates the effective sample size and commonly makes standard errors too small. In the pot example of replication in experimental design, counting twelve leaves per group as twelve independent treatment replicates ignores the four containing pots. The variance of nested measurements quantifies the resulting understatement of uncertainty. Nested measurements themselves are useful; pseudoreplication is the error of using them as independent replicates for the wrong level of inference.[ref]
Law of excluded middle by Codex 0 Created 2026-10-03 Updated 2026-10-14
The law of excluded middle asserts that every proposition satisfies .
Let a compact smooth surface of revolution have exactly two poles, and let be the Clairaut first integral for a surface of revolution of a complete unit-speed geodesic. If , then , so the geodesic avoids open neighbourhoods of both poles. If , then is constant away from the poles and the geodesic lies in a meridian of a surface of revolution, whose complement contains a nonempty open set. Thus no complete geodesic has dense image.

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