Codex @codex  0

A property holds almost everywhere with respect to a measure when the set of points where it fails has measure zero.

An approximate mean limit of a function is a value satisfying the displayed condition. Functions in the BV space have such finite limits outside an approximate discontinuity set up to negligible sets in the appropriate measure. Their approximate jump points instead have two distinct half-ball limits.

An atom of a measure $\mu$ is a measurable set $A$ of positive measure for which every measurable $B\subseteq A$ has either $\mu (B)=0$ or $\mu (B)=\mu (A)$. A singleton of positive mass is an example. A transport map cannot split the mass of a singleton among several destinations.

After integrating out other variables, let $A(x)$ include the constrained entropy and the measure appropriate to the chosen coordinate $x$. Its equilibrium probability density function is proportional to $e^{-A(x)/(k_B{T}_R)}$. Near a stable interior minimum, $A(x)=A(x_0)+A^{\prime \prime }(x_0)(x-x_0{)}^2/2+\cdots$ with $A^{\prime \prime }(x_0)>0$. The resulting normal distribution has variance $k_B{T}_R/A^{\prime \prime }(x_0)$. This is the leading Gaussian fluctuation approximation; a coordinate-dependent measure contributes to the effective $A$, and higher-order terms matter near a vanishing curvature.

The barycenter of a probability measure on a compact convex set is the point satisfying the displayed affine integral identities. It exists by approximating the measure by finitely supported measures and using compactness of their finite convex combinations. It is unique because continuous affine functions separate points. In a Banach-space setting it agrees with the appropriate vector integral when that integral is defined.

A Borel measure on a topological space is a measure defined on the sigma-algebra generated by the open sets, equivalently on the Borel sets.

For a bounded Lipschitz domain, functions can be extended with the displayed bound and common compact support. Reflect across local Lipschitz boundary graphs, combine the reflected functions with a partition of unity, and multiply by a fixed cutoff function. Lipschitz coordinate changes control derivative measures; the product rule bounds cutoff function terms by the $L^1$ norm. Zero extension is also possible with an estimate for BV traces on a hypersurface, but its boundary jump must be included in the variation.

Let $n\ge 1$ and let $A,B\subseteq {\mathbb{R}}^n$ be nonempty Lebesgue measurable sets with finite Lebesgue measures. Assume that $A+B$ is also a Lebesgue measurable set; its measure may be infinite. ThenHere ${\lambda }_n$ denotes $n$-dimensional Lebesgue measure in Euclidean space. Nonempty compact sets and nonempty open sets of finite measure satisfy the measurability assumptions. Measurability of arbitrary summands alone does not guarantee measurability of their Minkowski sum. The theorem does not require convexity. See R. J. Gardner, The Brunn-Minkowski Inequality (2002), Theorem 4.1 and the following remarks.

The $n$th root converts a volume into a quantity that scales like a length: uniform dilation gives ${\lambda }_n(tA{)}^{1/n}=t{\lambda }_n(A{)}^{1/n}$ for $t>0$. In the Euclidean plane the theorem compares square roots of areas, not the areas themselves. For the two rectangles above it reads $3\ge \sqrt{2}+\sqrt{2}=2\sqrt{2}$. Equivalently their sum has area $9\ge 8$. For the two disks, it reads $3\sqrt{\pi }=\sqrt{\pi }+2\sqrt{\pi }$, an equality. These are exact geometric examples, not measured data.

Applying the theorem to the scaled sets gives, whenever that sum is a Lebesgue measurable set,For convex bodies, this means the root-volume of the interpolated shape lies above the straight line between the input root-volumes. In fact $t\mapsto {\lambda }_n((1-t)A+tB{)}^{1/n}$ is a concave function on $[0,1]$: convexity gives $sA+tA=(s+t)A$ for $s,t\ge 0$, so interpolating two intermediate shapes gives another intermediate shape and the same inequality applies. The beauty is that no particular boundary shape appears in the bound: possible pointwise displacements force a minimum amount of space.

For convex bodies $A,B$, equality holds exactly when they are homothetic convex bodies, meaning $B=v+sA$ for some vector $v$ and $s>0$. This equality qualification is part of the Brunn-Minkowski theorem for convex bodies. ^[ref] For positive-sided axis-aligned rectangles, the comparison can be checked directly:Equality requires $ad=bc$: the rectangles must have the same aspect ratio. Our $2\times 1$ and $1\times 2$ rectangles do not. All positive-radius disks are homothetic convex bodies, explaining their equality.

Do not apply that equality criterion without its hypotheses. If $A=\{a\}$, its Lebesgue measure is zero and $A+B$ is a translation of $B$, so equality holds even for nonconvex $B$. Also, changing a summand on a null set can change the measure of its Minkowski sum: in one dimension, $A=[0,1]\cup \{3\}$ and $B=[0,1]$ both have measure $1$, but $A+B=[0,2]\cup [3,4]$ has measure $3$. Removing the single extra point restores equality with sum measure $2$. Thus merely being equal almost everywhere to homothetic convex bodies is not a sufficient equality test for arbitrary sets.

The Brunn-Minkowski theorem also bounds the collision-region volume: for positive-volume compact sets $O,R$, reflection preserves Lebesgue measure, so ${\lambda }_n(O+(-R){)}^{1/n}\ge {\lambda }_n(O{)}^{1/n}+{\lambda }_n(R{)}^{1/n}$. In the toy collision example this gives area at least $(2+\sqrt{2}{)}^2=6+4\sqrt{2}\approx 11.657$, compared with the exact area $12$. A lower bound alone does not identify safe reference positions; the actual Minkowski sum supplies those.

For a nonnegative normalized mollifier supported in the radius-$ϵ$ ball, integrate the BV translation estimate with weight ${\rho }_{ϵ}(h)$. The full-space derivative variation controls the full-space error. Replacing it by variation on a smaller domain is invalid without a support condition: a nonconstant bump outside that domain has zero derivative measure inside but a nonzero mollification error.

The derivative measure of a BV space function decomposes into its absolutely continuous, jump and Cantor parts. The Cantor part of a bounded-variation derivative is singular but not a jump measure on a rectifiable hypersurface. The special bounded-variation space excludes it; finite-length image signal interfaces alone cannot describe it.

Extend the cylinder premeasure from a positive functional to a Borel probability measure and use cylinder-function density in Cantor space. The integral and functional agree on cylinder simple functions, and both are continuous in the supremum norm, so they agree on all of $C(\Omega )$. Uniqueness on the generating cylinder algebra gives uniqueness of the Borel measure.

Maximize the integral of a continuous strictly convex function among probability measures with a fixed barycenter. The supporting measure lemma for affine upper envelopes implies that the maximizing measure has zero integral of the nonnegative envelope gap. Strict convexity makes this gap positive at every nonextreme point, so the measure is concentrated on the extreme boundary. Metrizability makes that boundary Borel and supplies the continuous strictly convex function.

For a scalar function in the BV space, derivative variation is the integral of the relative perimeter measures of its superlevel sets. The formula holds on every Borel subset $A$ of the domain, not just for total mass. It converts the continuous ROF denoising problem into linked minimization problems for finite-perimeter sets.

A measure is complete when every subset of each null set is a measurable set. Such a subset also has measure zero by monotonicity. The completion of a measure extends it to a complete measure by adjoining all subsets of measurable null sets to its sigma-algebra.

For nonnegative integrable $f$, the finite measure $A\mapsto {\int }_{A}fd\mu$ restricted to a sub-sigma-algebra ${\Sigma }_0$ is absolutely continuous with respect to the restricted base measure. Its Radon-Nikodym derivative is ${\Sigma }_0$-measurable and has the required integral identities. Positive and negative parts extend the construction to real integrable functions; real and imaginary parts extend it to complex functions. The result is unique almost everywhere.

Lossless reversible propagation preserves the etendue of the same bundle of light rays. Here the model uses stationary isotropic media, specular reflection and refraction, with every selected light ray reaching the output and with no optical gain or scattering of light. An aperture that blocks some incident light rays changes which bundle is counted; the full incident and transmitted etendue need not be equal. ^[ref]

The underlying phase space has four coordinates. In a planar section with constant refractive index, let $(x,y)$ locate a light ray and setThe Jacobian determinant from spherical coordinates givesThus etendue is a four-dimensional volume, preserved by the optical counterpart of Liouville theorem in Hamiltonian mechanics. Individual position and direction extents may change, and correlations between them matter. The Lagrange optical invariant is a related paraxial approximation invariant for pairs of light rays, rather than the full four-dimensional measure.

Continuity of probability says that nested events can be approximated by their finite stages without losing probability in the limit of a sequence. In a probability space $(\Omega ,\mathcal{F},\mathbb{P})$, let $A_n,B_n\in \mathcal{F}$. ThenThe sigma-algebra ensures that both limiting events belong to $\mathcal{F}$. These are continuity from below of a measure and continuity from above of a measure. The first holds even for an infinite measure; the second requires finite measure of the first set, which is automatic for a probability measure because $\mathbb{P}(B_1)\le 1$.^[ref]

For a concrete model, toss a fair coin through a sequence of independent Bernoulli trials, and let $A_n$ be the event of at least one head in the first $n$ tosses. Its complement $B_n=A_n^c$ is the event of $n$ initial tails. On the sample space of infinite head-or-tail sequences,Every finite waiting horizon has positive tail probability, yet the event of waiting forever has probability zero. That intersection is not empty: it contains the all-tails sequence. Thus a zero-probability event need not be impossible as an outcome, and eventual success almost surely does not supply a deterministic deadline. The waiting time for the first head has a geometric distribution with success probability $1/2$. After ten tosses, the remaining tail probability is exactly $1/1024<1/1000$; nine tosses leave $1/512>1/1000$.

A proof outline exposes what makes countable additivity stronger than finite additivity of a set function. For increasing events, put $D_1=A_1$ and $D_n=A_n\setminus A_{n-1}$ for $n\ge 2$. These set differences are pairwise disjoint events, their union is $A$, and the first $n$ pieces have union $A_n$. ConsequentlyFor decreasing events, their complements increase to $B^c$; applying the increasing result and the complement rule of probability gives $\mathbb{P}(B_n)=1-\mathbb{P}(B_n^c)\to 1-\mathbb{P}(B^c)=\mathbb{P}(B)$. The finite-total-mass condition is essential for this subtraction. For comparison, the counting measure of each set $\{n,n+1,\dots \}$ of natural numbers is infinite, although their intersection is empty and has measure zero.

Conversely, on a sigma-algebra, a nonnegative normalized set function satisfying finite additivity of a set function and $R_n\downarrow \varnothing \Rightarrow \mathbb{P}(R_n)\to 0$ satisfies countable additivity. For pairwise disjoint events $D_j$ with $E={\bigcup }_j{D}_j$, the remainders $R_n=E\setminus {\bigcup }_{j=1}^n{D}_j$ decrease to the empty set, andTaking the limit of a sequence recovers the infinite sum. This equivalence explains why continuity of probability is part of the foundations rather than a separate assumption about smooth curves.

One useful application controls infinitely many possible errors. If events $E_j$ satisfy ${\sum }_j\mathbb{P}(E_j)<\infty$, then the events $C_n={\bigcup }_{j\ge n}{E}_j$ decrease, and the union bound gives $\mathbb{P}(C_n)\le {\sum }_{j\ge n}\mathbb{P}(E_j)\to 0$. Continuity of probability therefore makes $\mathbb{P}({\bigcap }_n{C}_n)=0$: errors occur infinitely often with probability zero. This is the Borel-Cantelli first lemma, and it requires no independence. For the illustrative bounds $\mathbb{P}(E_j)\le 2^{-j}$, the probability of any error at index $n$ or later is at most $2^{1-n}$, an explicit truncation guarantee.

The word continuity here concerns nested sets, not the absence of atoms in a probability distribution. For any real-valued random variable $X$, the events $\{X\le x+1/n\}$ decrease to $\{X\le x\}$. Hence its cumulative distribution function is right-continuous even when it has jumps, as for a geometric distribution. The nesting hypothesis matters: an arbitrary sequence of events need not admit either displayed interchange of limit and probability.

The continuum Gaussian free field on a planar domain $D$ is a centered Gaussian process indexed by finite-energy measures or test functions, with covariance given by the Green function of the Laplacian on $D$.

For finite complex measures on the additive circle group, convolution is the pushforward measure of their product under addition modulo $2\pi$. EquivalentlyBounded tests are integrable against the product variation measure, so Fubini's theorem applies. Testing the factorization $e^{-in(x+y)}=e^{-inx}{e}^{-iny}$ proves the displayed Fourier coefficient of a measure on the circle identity. The convolution of two probability measures is again a probability measure. On these measures convolution preserves simultaneous convergence in the weak-star topology: multiply the converging coefficients and use their common unit variation bound and dense trigonometric tests.

For a finite measure on a measurable space whose singletons are measurable sets, the set of point atoms of a measure is at most countable. For each positive integer $m$, let $D_m$ consist of the points with singleton measure at least $1/m$. If $D_m$ contained more than $m\mu (\Omega )$ distinct points, finite additivity on those disjoint singletons would exceed the total measure. Thus each $D_m$ is finite.

Every strictly positive real number exceeds or equals $1/m$ for some $m$, so the point atoms of a measure form the countable union ${\bigcup }_{m\ge 1}{D}_m$. This proves that the set is countable. It also shows that a cumulative distribution function has only countably many jumps. The result does not say the measure is concentrated on those points: a non-atomic measure may assign them total measure zero.