Probability density function Created 2026-09-24 Updated 2026-10-14
A probability density function represents probabilities as areas under a nonnegative measurable function. For a real random variable with an absolutely continuous probability distribution, it satisfies
for every Borel set . Its height is probability per unit of the outcome variable, not the probability of that exact outcome. Thus a probability density function may exceed one, while the probability of a singleton is zero. NIST describes the interval-probability interpretation through integration. [ref].
For the example on , , but and . The cumulative distribution function is within that interval, connecting density height to the local accumulation rate.
Changing the scale changes the density height. If , then on . At the corresponding value , its height is , while is unchanged. The factor compensates for the wider integration variable. This is a change of variables, not a change in the underlying probabilities.
A probability density function is determined only almost everywhere: changing its values on a Lebesgue measure zero set changes no probabilities. The Cantor distribution has no such representation, and a mixed probability distribution can have both a point mass and a density component, so differentiating its cumulative distribution function does not recover all its mass.
Isomorphism of Banach spaces Created 2026-09-24 Updated 2026-10-14
An isomorphism of Banach spaces is a bijective bounded linear map whose inverse is bounded. The bounded inverse theorem makes boundedness of the inverse automatic.
Uniqueness of a rational approximation with bounded denominator Created 2026-09-24 Updated 2026-09-24
Two distinct reduced fractions with denominators below differ by more than , so an interval of radius contains at most one.
Continued-fraction matrix Created 2026-09-24 Updated 2026-09-29
With ,
Termination criterion for a simple continued fraction Created 2026-09-24 Updated 2026-09-24
A simple continued fraction terminates exactly when its value is rational. For a reduced rational , each reciprocal step is one step of the Euclidean algorithm and replaces the denominator by a strictly smaller nonnegative remainder.
Chomsky normal form Created 2026-09-24 Updated 2026-09-24
A context-free grammar is in Chomsky normal form when every production has the form or , with nonterminals and a terminal. If the empty word belongs to the language, one commonly also permits the exceptional rule under the usual restriction on the start symbol.
Equivalent grammar Created 2026-09-24 Updated 2026-09-24
Two grammars are equivalent when they generate the same formal language.
Parse tree Created 2026-09-24 Updated 2026-09-24
A parse tree places the start symbol at its root, the symbols on the right side of a production at the children of its left-side nonterminal, and terminal symbols at its leaves. Reading the leaves from left to right gives the tree's yield.
Grammar derivation Created 2026-09-24 Updated 2026-09-29
A grammar derivation is a finite sequence of words in which each step replaces one occurrence of a production's left side by its right side. A leftmost derivation always replaces the leftmost available nonterminal.
Coding level of the constructible hierarchy Created 2026-09-24 Updated 2026-09-24
A level is a coding level when is a limit ordinal, the representation of every well-order code in is below , and every ordinal below has a well-order code in .
Well-order code Created 2026-09-24 Updated 2026-09-24
A well-order code is a binary relation for which is a well-order. Its representation is the unique countable ordinal isomorphic to .
Condensation sentence for the constructible hierarchy Created 2026-09-24 Updated 2026-10-03
A condensation sentence is a fixed first-order sentence such that every transitive set satisfying is for a limit ordinal . It combines a sufficiently strong finite fragment of set theory, the assertion that every set is constructible, and the absence of a largest ordinal.
Flat constant-equation-of-state scale factor Created 2026-09-24 Updated 2026-09-24
For an expanding spatially flat universe with constant and ,
It vanishes at the finite past time .
Hydrodynamic mode Created 2026-09-24 Updated 2026-10-05
A hydrodynamic mode is a long-wavelength collective mode whose decay rate tends to zero because of a conservation law. Coupling to fast nonconserved variables renormalizes its diffusivity and eigenvector.
Horizontal lift Created 2026-09-24 Updated 2026-10-14
A horizontal lift is determined by the horizontal distribution of a principal connection or the corresponding connection on a vector bundle. A horizontal lift of a base curve is a curve in the bundle projecting to it and tangent to the horizontal distribution. In a local frame its fiber coordinate solves a linear ordinary differential equation.
Torsion-free connection Created 2026-09-24 Updated 2026-10-14
A connection on the tangent bundle is torsion-free when . Its Christoffel symbols are symmetric in their two lower indices.
Dual connection Created 2026-09-24 Updated 2026-10-14
The dual connection is induced by a connection on a vector bundle through the evaluation pairing. A connection on induces one on by
Its connection matrices are the negatives of the transposes of those for .
Curvature 2-form Created 2026-09-24 Updated 2026-10-14
The curvature two-forms are
Splitting sphere of a knot Created 2026-09-24 Updated 2026-10-14
A splitting sphere meets a knot transversely in two points. It is trivial when one of the resulting one-string tangles is boundary-parallel in its three-ball; otherwise it exhibits a nontrivial connected-sum decomposition.
Composite knot Created 2026-09-24 Updated 2026-10-14

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