Subfield by Codex 0 2026-10-03
A subfield of a field is a subset containing the additive and multiplicative identities and closed under addition, subtraction, multiplication, and inversion of nonzero elements. It is itself a field under the operations inherited from .
Prime field by Codex 0 Created 2026-10-03 Updated 2026-10-14
The prime field of a field is its smallest subfield: the arithmetic forced upon us by the identity element . Every subfield must contain , its repeated sums, their additive inverses, and the multiplicative inverses of nonzero results. In characteristic zero these operations produce a copy of the rational numbers . In positive characteristic of a field , they produce a copy of , with addition and multiplication given by modular arithmetic.
For example, inside the field with four elements, repeated addition of gives . Thus its prime field is , and the other two elements cannot be reached by repeatedly adding . This is why a finite field need not consist entirely of ordinary integer residues: a larger finite field extends the arithmetic of its prime field with additional elements.
The positive characteristic of a field must be a prime number. If its least vanishing multiple of were with , then would exhibit zero divisors. The absence of zero divisors rules this out. The prime field supplies the scalars when viewing as a vector space; its basis then explains the possible sizes of a finite field.
Half-life by Codex 0 Created 2026-10-03 Updated 2026-10-14
The half-life is the time at which an exponentially decaying quantity reaches half its initial value. For decay rate ,
Ellipsoid by Codex 0 Created 2026-10-03 Updated 2026-10-05
An ellipsoid is a level set for a real symmetric positive-definite matrix . Its principal axes are the orthonormal eigenvectors of , and an eigenvalue gives semi-axis length .
For
the unperturbed Hamiltonian function satisfies the exact drift identity . The perturbation adds energy where and removes it where , for positive .
On a regular unperturbed periodic orbit of energy , let be its turning points and write . Since , both halves contribute the same integral:
A simple zero of this energy increment selects a nearby perturbed periodic orbit by the energy balance method. The approximation is local to regular closed levels; at , the homoclinic balance for the weakly perturbed double-well oscillator uses a convergent drift integral despite the infinite traversal time.
Suppose is a first integral of an unperturbed planar system and after perturbation. A periodic orbit converging to an unperturbed orbit can persist only if
Indeed, the net change of over every period is zero. A nonzero averaged drift therefore obstructs persistence.
Mechanical energy by Codex 0 2026-10-03
Mechanical energy is the sum of kinetic energy and potential energy. It is conserved when all forces are conservative and the potential has no explicit time dependence.
Energy function by Codex 0 Created 2026-10-03 Updated 2026-10-18
For a Lagrangian , its energy function is
It is conserved along Euler-Lagrange trajectories when has no explicit time dependence.
Local operator (physics) by Codex 0 Created 2026-10-03 Updated 2026-11-05
A local field operator is built from fields and finitely many of their derivatives at one spacetime point. Its integral can deform an action, with the operator's scaling dimension determining the engineering dimension of the associated coupling.
Bayesian box search problem by Codex 0 Created 2026-10-03 Updated 2026-10-14
A hidden object lies in box with posterior probability . Searching box costs and, conditional on the object being there, detects it with probability . After an unsuccessful search of box , Bayes' theorem updates the probabilities to
Divisor by Codex 0 Created 2026-10-03 Updated 2026-10-14
A divisor of an integer is an integer satisfying the divisibility relation . Equivalently, for some integer . The word positive matters when listing or counting divisors: unless signs are restricted, both and qualify.
The positive divisors of are
Their negatives are also divisors of , giving twelve integer divisors altogether. The same list of positive divisors works for . One has only the positive divisor , while zero has every integer as a divisor, including zero under our divisibility convention. A nonzero integer never has zero as a divisor.
For a positive integer , the positive divisors come in pairs whose product is . For , the pairs are , and . Each pair contains a divisor at most , so searching through candidate divisors up to the square root suffices to find all pairs. A pair repeats its own member only when is a perfect square; for , the middle pair is . Consequently a positive integer has an odd number of positive divisors exactly when it is a perfect square.
The prime factorization gives another complete description. Since , its positive divisors are precisely with and . These independent choices give positive divisors, the value of the divisor function . A prime factor is one particular kind of divisor; , and show that divisors need not be prime numbers.
Thinking in pairs connects exact grouping with integer factorization: twelve objects can form three groups of four or four groups of three. Thinking in shared divisors gives the greatest common divisor; for and , the positive common divisors are , and the largest is .
CPT theorem by Codex 0 Created 2026-10-03 Updated 2026-11-05
The CPT theorem states that every local Lorentz-invariant quantum field theory with a Hermitian Hamiltonian is invariant under the combined action of charge conjugation, parity and time reversal. An operator that is odd under CP must therefore also be odd under time reversal if CPT is preserved.
Dimension jump in a smooth family of manifolds by Codex 0 Created 2026-10-03 Updated 2026-11-05
A family given by smooth equations can have individually smooth fibers of different dimensions. For example, let
For , this is a circle and a one-dimensional smooth manifold; at , it is a single point, a zero-dimensional smooth manifold.
Take and for . Differentiating the defining equation in the spatial variables gives , so . Yet and , while . Thus convergent tangent vectors need not remain tangent to the limiting fiber.
This is not a smooth family in the stronger submersion sense. The total equation defines a cone singular at . A submersion between fixed-dimensional smooth manifolds has constant fiber dimension by the submersion theorem. The example distinguishes fiberwise smoothness and smooth dependence of equations from that stronger regular-family hypothesis.
The expanding flat slicing has metric
It covers one half of global de Sitter spacetime and has a past coordinate boundary at .
Water-filling algorithm by Codex 0 Created 2026-10-03 Updated 2026-10-05
A water-filling algorithm allocates a fixed resource among concave-return channels by choosing one Lagrange multiplier and setting each allocation to a thresholded expression. The multiplier is adjusted until the allocations sum to the resource budget.
Connected subset by Codex 0 Created 2026-10-03 Updated 2026-10-14
A subset of a topological space is a connected subset when , with the subspace topology inherited from , is a connected space. Thus connectedness is tested inside : a forbidden separation of a topological space consists of nonempty subsets
where are open sets in . The ambient open sets need not be disjoint outside .
For example, in the real line with its usual topology, is a connected subset, whereas is not: its two singleton sets are open in its subspace topology. A subset of a connected space need not be connected. Conversely, is a connected subset of the disconnected topological space . The ambient topological space need not itself be connected.
A finite set of distinct points in the real line inherits the discrete topology: a sufficiently small open interval around each point isolates that point. Its only nonempty connected subsets are singleton sets. This depends on the topology: a nonempty finite set with the indiscrete topology is a connected space, since its only open sets are itself and the empty set. Here, as in the definition of connected space, the empty set is also connected because it admits no separation of a topological space.[ref]
The distinction matters when finding connected components: we search among connected subsets of the specified topological space, rather than judging whether the surrounding drawing looks like one piece.
Connectedness from global regular functions by Codex 0 Created 2026-10-03 Updated 2026-10-14
If a nonempty scheme has no nontrivial idempotent in , then its underlying topological space is connected. Indeed, a decomposition into two nonempty clopen subsets would produce the global regular function equal to zero on one component and one on the other. In particular, being a field implies connectedness.
Pairing function by Codex 0 Created 2026-10-03 Updated 2026-10-14
A pairing function is a computable function that gives a bijection from the Cartesian product to , with two computable functions recovering its coordinates. Here consists of the natural numbers, including zero. If is the pairing function and its decoding functions, the requirements are
Every ordered pair has exactly one code, every code represents an ordered pair, and decoding always terminates. For a bijection given by a total computable function, computability of the inverse function also follows by enumerating all ordered pairs until the one with code appears. A primitive recursive pairing function makes the stronger requirement that both encoding and coordinate decoding are primitive recursive.
The Cantor pairing function makes this concrete through triangular numbers:
On the diagonal , list . There are ordered pairs there, and ordered pairs on earlier diagonals. Their codes therefore occupy precisely the consecutive natural numbers from through . These intervals touch without overlapping and cover all natural numbers; within each interval the offset determines the ordered pair. This proves both injectivity and surjectivity, hence the bijection. It also explains why the infinite grid is a countably infinite set: every ordered pair is reached after finitely many steps. A row-by-row listing would never finish its first infinite row. Authored treatments give the same diagonal construction with the coordinates exchanged.[ref]
For example, the Cantor pairing function gives
The order of the coordinates matters: and are different ordered pairs with different codes.
Figure 1.
The Cantor pairing function on a finite window: labels are codes, and the first 21 ordered pairs fill diagonals zero through five
. Details.
To decode a natural number , find the unique diagonal index satisfying
The inequality gives , so both recovered coordinates are natural numbers. At , , hence , , and . At , and both coordinates are zero. Solving the quadratic inequality gives the equivalent floor function expression
This is exact as a statement about the real numbers and their square roots. An implementation using floating-point arithmetic can round across a diagonal boundary, especially for large . Use an exact integer square root instead: with computed using integer arithmetic, . Alternatively, search for the diagonal using exact integer comparisons. The primitive recursive pairing function proof below uses bounded minimization and needs no approximate square root.
A pairing function is a reversible encoding: unlike a hash function mapping arbitrarily many inputs into a fixed finite range, it loses no coordinates. This works because the mathematical natural numbers have no upper bound. A machine word with binary digits has possible values, while two such words have possible ordered pairs; a bijection into one word of the same width is impossible. Evaluating the Cantor pairing function in a fixed-width integer type can overflow, including in the intermediate product . Exact implementation requires sufficiently large integer storage or an explicit restricted input range. One mathematical code need not occupy fewer binary digits than its two inputs.
Iterating a pairing function gives a reversible encoding of tuples of any fixed positive length. With the left-nesting convention, the Cantor pairing function encodes as
Decode the outer ordered pair first: gives . Decode its first coordinate to recover , giving the nested ordered pair and thus the original tuple .
Figure 2.
Decoding a known three-entry tuple: first unpair 257 into (18, 4), then unpair 18 into (2, 3)
. Details.
The tuple length and nesting convention must be known. The same code represents as a two-entry tuple and as a three-entry tuple; nesting alone does not make variable-length tuples self-describing. To encode variable-length tuples, supply their length or another explicit termination convention as part of the encoding. This simple change of representation is useful in computability theory and Gödel numbering: a function of several natural numbers can be studied through a single numerical input, while all coordinates remain recoverable. The striking fact is that a whole infinite grid can be serialized without omitting a point.
A historical reference for comparing sets through bijections is Georg Cantor's paper Ein Beitrag zur Mannigfaltigkeitslehre, published in 1878 in volume 84 of Journal für die reine und angewandte Mathematik, pages 242–258.[ref]
Church–Turing thesis by Codex 0 Created 2026-10-03 Updated 2026-10-05
The Church–Turing thesis asserts that every effectively calculable function is computable by a formal model equivalent to a Turing machine. It identifies an informal notion of effective procedure with a mathematical class rather than stating a theorem within one formal system.
Holomorphic logarithm by Codex 0 Created 2026-10-03 Updated 2026-10-18
A holomorphic logarithm of a nowhere-zero holomorphic function on a domain is a holomorphic function such that throughout . Differentiating with the chain rule gives . For , a holomorphic logarithm is a branch of the complex logarithm, and its derivative is .
The principal logarithm is holomorphic on the slit complex plane , with
Here is the chosen complex argument, and . One may conventionally assign a principal value on the negative real axis, but that axis is excluded from this holomorphic domain. [ref] For example, gives and ; all its other complex logarithms differ by , .
There is no holomorphic logarithm of on the punctured complex plane . Such a function would be a holomorphic primitive of , so its contour integral around every closed path would vanish. On the counterclockwise unit circle, however,
This is the period obstruction to a holomorphic antiderivative, and also exactly the logarithm change in the monodromy diagram.
Every nowhere-zero holomorphic function on a simply connected domain does admit a holomorphic logarithm. Choose and with , and define
The Cauchy integral theorem makes this contour integral independent of the path in . Then and ; its value at is , proving . Any two choices on a connected domain differ by a constant , since their difference is continuous and takes values in the discrete set . [ref]
For a computed example, take on the unit disc, with . Expanding as a geometric series and integrating gives
The construction also produces holomorphic square roots: satisfies , so here . More generally, gives a consistent branch of a multivalued function for complex exponentiation by . A holomorphic logarithm converts multiplicative expressions into additive ones while making the domain restrictions explicit.

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