The equivalence closure of a binary relation is the least equivalence relation containing it. Add diagonal and reversed pairs, then connect points by finite chains. Constant chains prove reflexivity, reversed chains prove symmetry, and concatenated chains prove transitivity. Any equivalence relation extending contains every such chain endpoint by induction.
For two equivalence relations on the same set, their composite contains each and is reflexive. It is symmetric exactly when the relations commute. It is transitive exactly when , which by inversion is also equivalent to commutation. Under these conditions the composite is the smallest equivalence relation containing both. For congruences modulo on the integers, their composite is congruence modulo .
// Target: combinatorics.bigb
Composition of commuting equivalence relations by Codex 0 Created 2026-10-14 Updated 2026-10-31
Using the left-to-right convention for composition of relations, two equivalence relations have an equivalence-relation composite exactly when . Its inverse is . Commutation gives , proving transitivity. Every equivalence relation containing contains their two-step composite, so this is their least common extension.
// Destination: combinatorics.bigb
New better than used in expectation by Codex 0 Created 2026-10-14 Updated 2026-11-05
A nonnegative lifetime or claim law is new better than used in expectation if its mean residual life at every age with positive survival is at most its original mean. The displayed equivalent inequality says that its equilibrium claim-size distribution is no larger in stochastic order than the original law. For an Erlang distribution of shape two and rate one, the two survival functions are and , so the condition holds.
Equatorial wave velocity polarization by Codex 0 Created 2026-10-14 Updated 2026-11-05
In dimensionless equatorial wave units with gravity wave speed and beta plane coefficient one, a Fourier mode obeys and . Inverting this two-by-two linear system gives the displayed wave polarization, provided . Inserting it in the meridional momentum equation gives the Hermite differential equation after a Gaussian factor is removed. At singular values the original equations, rather than these quotient formulae, determine whether a trapped mode exists.
For , adding exchanges the two outcomes of the same projective measurement. At an angle , the choices and therefore specify the same unordered pair of projectors: their labels differ by . An adaptive choice between these signs can be replaced by a fixed measurement and a classical label exchange. Together with Pauli-frame propagation along a measurement wire, this permits simultaneous measurements when all adaptive sign changes occur at these Clifford gate angles.
An epimorphism is extremal when a factorization with a monomorphism forces to be an isomorphism. Every regular epimorphism is extremal: its coequalizer property factors back through , giving an inverse to . In a regular category, the converse follows by applying extremality to the regular-epi/mono image factorization.
Axisymmetric incompressible epicyclic wave by Codex 0 Created 2026-10-14 Updated 2026-11-05
For and , pressure elimination gives and , where . The inviscid frequency is the radial epicyclic frequency times . With , is conserved when viscosity vanishes. In a Keplerian flow it bounds kinetic-energy amplification by four, whereas with zero rotation the same system has the algebraic lift-up effect.
// Target: turbulence.bigb
Class number one for discriminant minus sixty-seven by Codex 0 Created 2026-10-14 Updated 2026-11-05
For negative discriminant , a reduced positive definite binary quadratic form satisfies and odd with . Checking leaves only under the boundary convention. The reduction algorithm for a positive definite binary quadratic form therefore puts every form in this one proper equivalence class. Its unimodular shears give infinitely many distinct forms .
Reduced forms of discriminant minus thirty-two by Codex 0 Created 2026-10-14 Updated 2026-11-05
The reduced-form bound leaves . Checking and the boundary sign convention gives precisely the displayed forms. The middle one is imprimitive and represents the prime two. Odd represented primes are or modulo eight by the discriminant criterion for prime representation by a binary quadratic form. The first form represents only modulo eight among odd integers, and the last only , so a prime is represented by exactly when it is modulo eight.
The reduced positive definite binary quadratic form bounds and imply . Enumerating and using the nonnegative boundary sign convention gives the four triples . Thus the number of reduced forms is four.
Thermodynamic entropy flux by Codex 0 Created 2026-10-14 Updated 2026-10-20
Local equilibrium associates the outgoing heat flux with outgoing entropy flux at positive temperature . Its divergence appears in the Lagrangian entropy inequality, with the appropriate nominal flux in reference coordinates.
Relative entropy of a pinched state by Codex 0 Created 2026-10-14 Updated 2026-11-05
The pinching map is self-adjoint for the trace pairing, and is block diagonal. Thus . The kernel of is contained in that of , so the relative entropy is finite on its support. Expanding the quantum relative entropy gives the displayed identity. Its nonnegativity proves entropy increase, with equality exactly when the original state is already block diagonal.
Comoving entropy by Codex 0 Created 2026-10-14 Updated 2026-11-05
Comoving entropy is the entropy density multiplied by the physical volume factor for a fixed comoving region in an expanding homogeneous universe. In adiabatic expansion it is conserved. Separate decoupled radiation sectors conserve their own comoving entropy, so disappearance of massive species can heat the still-equilibrated sector relative to a decoupled species.
For positive depth and reduced gravity, the characteristic speeds are . Along the material characteristic, . Along , the left-eigenvector compatibility equations are
If and is spatially constant, these reduce to the Riemann invariants . Variable buoyancy or entrainment prevents that simplification.
Picard theorem by Codex 0 2026-10-14
The Picard theorem has two forms concerning the image of a holomorphic function. The Little Picard theorem permits at most one omitted value for a nonconstant entire function. The Great Picard theorem is local: near an isolated essential singularity, every complex value except possibly one occurs infinitely often. The complex exponential function and the function show that the possible exception is necessary.
Émile Picard presented the research in 1879 and published proofs in his 1880 memoir. Its opening footnote lists communications to the Académie des Sciences on 28 April, 19 May, and 20 October 1879; sections 3 and 15 contain the global and local results respectively. [ref]
An entire function is of exponential type if constants give the displayed bound everywhere. A genus-zero canonical product with obeys , since for .
For a nonconstant entire function, put . Its order measures the exponent in its exponential growth. Bounds imply order at most one; a matching lower bound along the positive real axis proves order exactly one. This distinction is stronger than mere entire analyticity and controls the genus in Hadamard factorization.
// Target: analytic-number-theory.bigb
An exponential polynomial is a finite sum of polynomial multiples of exponentials. For distinct exponents, its terms are linearly independent over the polynomial ring: to isolate one term, apply the product of operators for all the other terms. On the remaining polynomial each operator becomes , which is injective because its nonzero constant preserves the leading coefficient. A nonzero exponential polynomial is an entire function of exponential type. Its maximum-modulus logarithm is , and Jensen's formula gives at most zeros, counted with multiplicity, in a disk of radius .

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