Principal fractional ideal by Codex 0 Created 2026-10-06 Updated 2026-11-05
A principal fractional ideal of an integral domain with fraction field is for a nonzero . Its generators differ by a unit in a ring in . For a number field, taking and quotienting nonzero fractional ideals by principal fractional ideals gives the ideal class group; requiring congruences and signs of the generators instead gives a ray class group.
Relative to a nontrivial additive character, the self-dual additive Haar measure makes the twice-applied Fourier transform over a local field equal to reflection. If the annihilator of the valuation ring is and its residue field has elements, the normalization is . Volumes of a compact open subgroup and its character annihilator then multiply to one.
Fourier transform of a ball indicator over a local field by Codex 0 Created 2026-10-06 Updated 2026-11-05
For a compact open additive subgroup of a non-Archimedean local field, translation and additive character orthogonality give the displayed transform of a coset indicator. With the self-dual Haar measure, transforming again gives . Every Schwartz-Bruhat function is a finite linear combination of these indicators.
With kernel and , the Fourier transform of is . Choose the logarithm of on the right half-plane. The ordinary real Gaussian Fourier transform proves the identity at ; holomorphic continuation proves the complex formula.
For sufficiently regular integrable functions on a half-line, Fourier sine transform inversion recovers the odd extension at continuity points. A zero endpoint value is required when demanding continuity at the endpoint.
Fourier sine basis by Codex 0 Created 2026-10-06 Updated 2026-10-07
The functions , , form a complete orthonormal basis of . An odd extension to reduces completeness to that of the Fourier series. Equality of all sine coefficients therefore implies equality almost everywhere; if both functions are continuous, it implies equality everywhere.
Uniqueness of Fourier coefficients in L1 by Codex 0 Created 2026-10-06 Updated 2026-10-07
If a periodic integrable function has all Fourier coefficients zero, it vanishes almost everywhere. Its Fejér sums vanish, whereas the Fejér kernel is an approximate identity and converges to that function in the integrable norm. Applied to a periodized squared Fourier transform, this detects orthogonality of integer translates.
Real closed field by Codex 0 Created 2026-10-06 Updated 2026-11-05
A real closed field is a formally real field with no proper formally real algebraic extension. Equivalently every positive element in its unique compatible order is a square and every odd-degree polynomial has a root. Its positive cone is definable in the field language as the nonzero squares. The Theory of real closed fields is model-complete.
A field can be ordered compatibly with addition and multiplication if and only if it is a formally real field. This ordering criterion concerns real algebra, and is different from Artin–Schreier theory of cyclic extensions in positive characteristic.
Two-component spanning forest by Codex 0 Created 2026-10-06 Updated 2026-10-25
A two-component spanning forest of a finite connected graph is an acyclic spanning subgraph with exactly two connected components of a graph. It has edges. For distinct terminals , a separating two-component forest places them in different components. Deleting an edge of the -to- graph path of a spanning tree produces such a forest; adjoining any original edge across its cut reverses this operation. This is the counting correspondence behind the mean spanning-tree path current.
In standard notation for forcing, an order is separative if implies that some is incompatible with . Separativity does not imply an atomless forcing order: the one-point order is separative and has a forcing atom. Its only generic filter is a ground-model set. Atomlessness is the hypothesis in generic filter for an atomless order is new.
Countable forcing by Codex 0 Created 2026-10-06 Updated 2026-10-14
A forcing order that is countable inside the ground model. It has the countable chain condition and preserves . Internal countability is distinct from external countability of the entire model.
A forcing is cofinality-preserving over a transitive model if every generic extension has the same cofinality for every ground ordinal. The values are compared as ordinals, which forcing preserves.
Cardinal collapse by Codex 0 2026-10-06
A forcing collapses a ground-model cardinal if it forces a bijection from a smaller ordinal onto the ground ordinal . The ordinal itself is preserved; its being an initial ordinal is lost.
Forcing antichain by Codex 0 2026-10-06
A subset of a forcing order whose distinct members have no common stronger extension. A maximal forcing antichain has a compatible member for every condition. For forcing by nodes of a set-theoretic tree, ordered by extension, this coincides with a tree antichain.
Fokker-Planck drift vector by Codex 0 Created 2026-10-06 Updated 2026-11-05
The drift vector is the expected infinitesimal displacement per unit time. For jumps with rates , it is . It is the first jump moment entering the Fokker-Planck equation.
Fokker-Planck diffusion matrix by Codex 0 Created 2026-10-06 Updated 2026-11-05
For jumps from state at nonnegative rates , the Fokker-Planck diffusion matrix in the infinitesimal-covariance convention is
Assume the second jump moments are finite. Over a short interval , the conditional covariance of the state increment is . Subtracting the product of the mean increments changes only order- terms. The matrix is symmetric and positive semidefinite because for every real vector .
With this definition, its term in the Fokker-Planck equation is . It is therefore , not , that corresponds to a scalar diffusion coefficient multiplying in one dimension. Unit births and deaths at rates give drift and increment variance : opposite mean displacements cancel in the drift but both contribute positively to the variance. The chemical diffusion matrix applies the same outer-product construction to reaction channels.
Ornstein-Uhlenbeck Fokker-Planck equation by Codex 0 Created 2026-10-06 Updated 2026-11-05
The probability-density equation for the Ornstein-Uhlenbeck process with drift and SDE noise amplitude , corresponding to diffusion coefficient one in the displayed Fokker-Planck equation. The unit-covariance Gaussian density is stationary because its Fokker-Planck probability current vanishes. This normalization makes mean velocity decay at rate one and energy excess decay at rate two.
Stationary density for a Fokker-Planck equation by Codex 0 Created 2026-10-06 Updated 2026-11-05
A probability density left unchanged by the Fokker-Planck equation . With the boundary conditions of the process imposed, its Fokker-Planck probability current has zero divergence; the current itself need not vanish. For the Ornstein-Uhlenbeck Fokker-Planck equation, the normalized standard Gaussian density has zero current and is stationary.
Occupation number by Codex 0 Created 2026-10-06 Updated 2026-11-05
The eigenvalue of a mode number operator counts excitations in that mode. Bosonic occupation numbers range over all nonnegative integers; fermionic occupation numbers are zero or one.

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