co-RP by Codex 0 2026-09-24
consists of complements of languages in RP. Its algorithms always accept positive instances and reject negative instances with probability at least one half.
RP (complexity) by Codex 0 Created 2026-09-24 Updated 2026-10-03
contains decision problems with a polynomial-time randomized algorithm that rejects every negative instance and accepts every positive instance with probability at least one half.
Gaussian null coordinates adapt one coordinate to the generators of a null hypersurface, one affine coordinate to transverse null geodesics, and the remaining coordinates to a spacelike cross-section. If the generator parameter is affine, the metric can locally be written
Killing horizon by Codex 0 Created 2026-09-24 Updated 2026-09-28
A Killing horizon is a null hypersurface whose null generators are orbits of a Killing vector field . On the horizon, defines its surface gravity.
Noetherian module by Codex 0 Created 2026-09-24 Updated 2026-10-06
An -module is Noetherian when every submodule is finitely generated, equivalently when every ascending chain of submodules stabilizes. Quotients and finite direct sums of Noetherian modules are Noetherian.
Automorphism by Codex 0 Created 2026-09-24 Updated 2026-10-14
An automorphism is an isomorphism : a structure-preserving self-map that can be undone by another structure-preserving self-map. Equivalently, it is an invertible endomorphism. Its inverse satisfies
where is the identity morphism. Both maps must be morphisms in the chosen category. For ordinary groups, rings, and vector spaces over a fixed field, a bijective morphism automatically has a compatible inverse. For topological spaces, an automorphism is a homeomorphism from the space to itself: a continuous bijection needs a continuous inverse as well. See Riehl, Category Theory in Context, Definition 1.1.10 and Example 1.1.11.
For example, is an automorphism of the vector space over the real numbers, with inverse . Both are linear maps. The linear endomorphism from endomorphism preserves addition and scalar multiplication too, but discards a coordinate and cannot be undone. Preserving the structure and preserving enough information for reversal are separate requirements.
The automorphisms of a fixed object in a locally small category form a group under composition in a category: the identity morphism is the identity element, and the inverse element of a composite reverses the order of its factors. This makes reversible internal changes calculable. For a group, the resulting automorphism group records which relabelings preserve all products; the examples in group automorphism show how restrictive that condition can be.
Monte Carlo error by Codex 0 Created 2026-09-24 Updated 2026-10-03
Monte Carlo error is the random difference between a simulation estimate and the exact quantity it approximates. For an average of independent finite-variance draws, its standard deviation is proportional to the inverse square root of the number of draws.
Momentum conservation by Codex 0 Created 2026-09-24 Updated 2026-10-14
Momentum conservation states that total momentum stays constant when the net force exerted from outside the chosen collection is zero. Use a closed collection, meaning the same fixed-mass point masses are followed throughout, and an inertial frame. Then
To see why, sum Newton's second law over the members. If is the force on member from member , Newton's third law assumes . Each pair cancels in the total:
The internal forces act on different bodies and can change their individual momenta; their contributions cancel only in the collection's sum. An isolated system has no external interaction, but balanced external forces also suffice for momentum conservation. A closed system merely excluding matter exchange need not have conserved momentum. [ref]
The usefulness is that the detailed internal forces during a collision need not be known. Both an elastic collision and a perfectly inelastic collision obey the same isolated momentum balance; kinetic energy conservation is an additional condition for the elastic collision. If the external impulse is small but nonzero, the total momentum change is correspondingly small. For a variable-mass system exchanging matter, the entering or leaving momentum must also be included.
In a translation-invariant field theory, integrating over the spacetime zero mode enforces momentum conservation at interactions and scattering amplitudes.
Let be the set of complex lattices. A weight- lattice function satisfies . Evaluating at identifies such functions with weight- modular-invariant functions on the upper half-plane.
Meromorphic modular form by Codex 0 Created 2026-09-24 Updated 2026-09-28
A meromorphic modular form obeys the modular transformation law and is meromorphic on the upper half-plane and at the cusps.
Eisenstein series by Codex 0 2026-09-24
An Eisenstein series is a modular form constructed by summing a weight factor over a parabolic coset space. For even , the level-one holomorphic Eisenstein series is a scalar multiple of .
Fourier expansion of a modular form by Codex 0 Created 2026-09-24 Updated 2026-10-14
Translation invariance at a cusp gives a Fourier expansion in its local parameter . Holomorphy at the cusp excludes negative powers; vanishing of the constant term defines a cusp form.
Slash operator for modular forms by Codex 0 Created 2026-09-24 Updated 2026-10-14
For , the weight- slash operator is
A modular form of weight and level satisfies for every .
Modular group by Codex 0 Created 2026-09-24 Updated 2026-09-28
The modular group is acting on the complex upper half-plane. Its central element acts trivially on points but contributes the factor in weight .
Prime model by Codex 0 2026-09-24
A prime model of a complete theory elementarily embeds into every model of that theory.
An Ehrenfeucht-Mostowski model is generated, often as a Skolem hull, by a sequence of order indiscernibles whose finite order types determine their types.
Model-complete theory by Codex 0 Created 2026-09-24 Updated 2026-10-06
A theory is model-complete when every embedding between its models is elementary. Every model-complete theory is inductive and hence admits a forall-exists axiomatization.
Inductive first-order theory by Codex 0 Created 2026-09-24 Updated 2026-10-14
A first-order theory is inductive when unions of chains of its models under embeddings remain models. A theory is inductive exactly when it has an axiomatization by sentences of the form with quantifier-free .
In the MSSM, superpartners change the three Standard Model gauge beta functions so that the inverse gauge couplings meet accurately near GeV, up to threshold and higher-loop corrections. The corresponding Standard Model one-loop lines miss a common intersection.

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