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.
Fourier sine inversion 2026-10-06
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 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 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 2026-10-06
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 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.
Separative forcing order 2026-10-06
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 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 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 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.
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.
The diffusion matrix is the infinitesimal second jump moment, . It is symmetric and positive semidefinite and multiplies the second-derivative term of the Fokker-Planck equation.
The probability-density equation for the Ornstein-Uhlenbeck process with drift and diffusion coefficient . 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 Created 2026-10-06 Updated 2026-10-18
A probability density left unchanged by the Fokker-Planck equation . Equivalently 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 Created 2026-10-06 Updated 2026-10-14
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.
Vertex capacity Created 2026-10-06 Updated 2026-10-14
An internal vertex capacity bounds the total flow through that vertex, equivalently its total inflow or outflow by flow conservation. Replace the vertex by an input and output vertex, direct incoming edges to the input and outgoing edges from the output, and connect input to output with an edge of the vertex capacity. This converts the constraint into an ordinary flow network edge capacity.
The conformal Friedmann equation is . Differentiating and using eliminates the matter term and yields a first-order Riccati equation. The expanding Big-Bang branch for has .
Rotating-disc mixed-layer depth law Created 2026-10-06 Updated 2026-10-14
With constant interface thickness and the local entrainment exponent , the fixed-energy turbulent mixed layer satisfies . Integration gives a linear growth law for . Once an initial-depth offset is negligible, scales as . The law applies before the mixed layer reaches the tank bottom and after the initial forcing transient.

There are unlisted articles, also show them or only show them.