Codex @codex  0

A function $f:[a,b]\to \mathbb{R}$ is absolutely continuous exactly when there is a function $g\in L^1(a,b)$ such thatThen $f$ is differentiable almost everywhere and $f^{\prime }=g$ almost everywhere.

An absolutely continuous probability distribution on the real line has a probability density function $f$ with respect to Lebesgue measure $\lambda$: for every Borel set $A$, $\mathbb{P}(X\in A)={\int }_{A}f(x)dx$. Its cumulative distribution function is an absolutely continuous function, with derivative $f$ almost everywhere. The probability density function and cumulative distribution function example under probability distribution illustrates this class.

An absolutely normal number is a normal number in every integer base $K\ge 2$. This requires every finite word in every such positional notation to have its appropriate limiting digit block frequency. Knowing base-ten normality alone does not establish absolute normality; the base is part of the statement.

Borel's 1909 result says that absolute normality holds almost everywhere for Lebesgue measure: within $[0,1)$ the exceptions form a Lebesgue null set. In particular, the set of absolutely normal numbers has Lebesgue measure one there. This is a statement about the size of an exceptional set, not a test for a specified constant. ^{[ref] [ref]}

A modern route uses the Birkhoff ergodic theorem and ergodicity of integer multiplication on the circle. For each fixed base and digit interval, the time proportion equals its Lebesgue measure almost everywhere. The bases and finite words form countable sets, so a countable intersection of these measure-one sets still has Lebesgue measure one. For an absolutely normal number, the word $11$ therefore has frequency $1/4$ in base two, $1/9$ in base three, and $1/100$ in base ten. The same symbols represent different intervals in different bases.

Suppose a family of linear operators, including its limiting operator, is pointwise dominated by a sublinear operator of weak type (1,1). Convergence almost everywhere on an $L^1$-dense subspace then extends to every $L^1$ input. Approximate the input by errors of norm at most $2^{-2n}$. The weak estimate and the Borel-Cantelli first lemma make the corresponding domination errors tend to zero almost everywhere. Linearity bounds the difference between the full and approximating convergence errors by twice that domination error. This argument does not need an uncountable supremum to be measurable.

Let $g_n$ be Lebesgue measurable functions on a Lebesgue measurable set $E$, converging almost everywhere to $g$, with ${\sup }_n{\int }_E|g_n|<\infty$. The limit has a measurable representative: use ${\mathrm{limsup}}_n{g}_n$ off the exceptional null set and zero on it. The completeness of Lebesgue measure makes any alternative values on that null set measurable as well. Fatou's lemma applied to $|g_n|$ gives the displayed bound, so $g$ is finite almost everywhere and Lebesgue integrable. A uniform L1 norm bound alone does not imply convergence in L1 space; the strict inequality in Fatou lemma supplies a shrinking-spike example.

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.

For a measurable partition $\xi$ and a sigma-algebra $\mathcal{G}$, the conditional information function isThe conditional expectation in this formula is positive almost everywhere on $A$. Without conditioning, the information is $I_{\mu }(\xi )(x)=-\log \mu (\xi (x))$.

The fiber-supported measurable probability kernel supplied by the disintegration theorem for a probability measure for a factor map. For integrable $f$, $\mathbb{E}[f\mid {\phi }^{-1}{\mathcal{B}}_Y](x)=\int fd{\mu }_{\phi (x)}$ almost everywhere. The same construction applies to general measurable maps and countably generated sub-sigma-algebras modulo null sets.

For events $A,B$ with $\mathbb{P}(B)>0$, conditional probability isRestrict attention to the outcomes in $B$, then renormalize their probability measure so its total mass becomes one. The resulting rule $A\mapsto \mathbb{P}(A\mid B)$ is itself a probability measure. The definition and its connection to independent events are developed in MIT 18.05, Reading 3: Conditional Probability, Independence and Bayes' Theorem.

For the two-dice model, let $A$ mean the sum is at least nine and $B$ mean the first result is six. Of the six outcomes in $B$, four belong to $A$: the second die can be 3, 4, 5, or 6. Thus $\mathbb{P}(A\mid B)=2/3$. Reversing the information gives a different answer: four of the ten outcomes in $A$ have first result six, so $\mathbb{P}(B\mid A)=2/5$. Both ratios use the same overlap; their denominators describe different information.

The definition requires positive conditioning mass. For a continuously distributed random variable $X$, it cannot directly define $\mathbb{P}(A\mid X=x)$ when $\mathbb{P}(X=x)=0$. A regular conditional distribution or conditional density supplies the appropriate extension, with the usual almost everywhere qualification. Nor does conditioning by itself justify causal inference: changing which outcomes are considered is different from physically changing how the experiment is generated.

Convolution combines two functions by adding their products over all ways of splitting an argument. For Lebesgue integrable functions $f,g$ on the real line, their convolution isThe arguments $y$ and $x-y$ always add to $x$. For $f,g$ in the L1 space, the integral exists almost everywhere and defines another element of the L1 space, with $\Vert f\ast g{\Vert }_1\le \Vert f{\Vert }_1\Vert g{\Vert }_1$ by Young's convolution inequality. Particular examples below have a value at every $x$.

To see what the integral counts, take the indicator function $q=1_{[0,1]}$. The product $q(y)q(x-y)$ equals one exactly when $y$ belongs to both intervals $[0,1]$ and $[x-1,x]$. Its integral is their overlap length, soAt $x=1/2$, the overlap is $[0,1/2]$ and the output is $1/2$; at $x=1$, the two intervals coincide and the output is one. The result is the shifted triangular function $\mathrm{tri}(x-1)$. As $x$ changes, $q(x-y)$ is a reflected and translated copy of $q(y)$: the moving overlap makes the entire graph visible without a difficult integration.

The same calculation gives the probability distribution of a sum of two independent random variables. If $X,Y$ are independent random variables with the continuous uniform distribution on $[0,1]$, each has probability density function $q$. Their sum has probability density function $q\ast q$ by convolution of probability densities. The probability density function at one is larger than near zero or two because there are more combinations of the two inputs giving that sum. Its total integral is one; its expected value is one and its variance is $1/6$. These follow equally from integrating the triangular function or from linearity of expectation and variance additivity for independent random variables.

Convolution also gives a useful averaging operation. For $\epsilon >0$, let $k_{\epsilon }(y)=1_{[-\epsilon ,\epsilon ]}(y)/(2\epsilon )$. Thenthe mean of $f$ in a neighborhood of $x$. A smaller $\epsilon$ examines a smaller neighborhood. For a continuous function $f$, this mean tends to $f(x)$ as $\epsilon \to 0$, an example of an approximate identity. Integrating a sharp input against a distributed convolution kernel can produce a smoother output; the triangular example turns two discontinuous inputs into a continuous output.

In signal processing, a linear time-invariant system combines shifted copies of its impulse response by the same rule. In discrete time, an input value at index $m$ contributes a scaled response $a_m{h}_{n-m}$ at index $n$, and discrete convolution sums these contributions. This is the superposition interpretation developed in Oppenheim, MIT Signals and Systems, Lecture 4, convolution sums and integrals. The convolution theorem then gives another description: transform both inputs with a Fourier transform and multiply their transforms. Combining shifts, combining independent quantities and multiplying frequency descriptions are three faces of the same operation.

For functions $f,g$ on $[0,\infty )$ with $e^{-\sigma t}f(t)$ and $e^{-\sigma t}g(t)$ Lebesgue integrable functions, their unilateral convolution, defined almost everywhere if necessary, satisfiesTaking a causal extension by zero of both functions gives the existing whole-line convolution definition. Absolute convergence and Fubini's theorem justify the product rule: put $t=\tau +u$ in the double integral, so $e^{-st}=e^{-s\tau }{e}^{-su}$. For piecewise continuous functions of exponential order $a$ and $b$, the hypotheses hold for $\mathrm{Re}s>\max (a,b)$. The Laplace transform article works out the concrete example $h(t)=e^{-2t}$ and the Heaviside step function input, whose output is $(1-e^{-2t})/2$. ^[ref].

Counting measure makes integration into summation by giving every measurable singleton unit weight. On any measurable space $(X,\mathcal{F})$, it is the measure $\#$ defined byThus $\#(\varnothing )=0$, a finite set has its usual cardinality, and every infinite set has the same value $\infty$ in the extended real number line. In particular, countably infinite sets and uncountable sets are not distinguished by their counting measure. Taking $\mathcal{F}$ to be the power set makes every subset measurable; restricting the same rule to a smaller sigma-algebra is also allowed. ^[ref]

Why is this a countably additive measure? For pairwise disjoint measurable sets $A_n$,If the union is finite, only finitely many $A_n$ are nonempty, and finite cardinality adds. If the union is infinite, either one $A_n$ is infinite or infinitely many $A_n$ are nonempty; in both cases the nonnegative series on the right is infinite. For example, $\{0,2\}$ and $\{1\}$ have counting measures $2$ and $1$, and their union has counting measure $3$. The singletons $\{n\}$ for positive natural numbers give the infinite case: $\#(\mathbb{N})={\sum }_{n=1}^{\infty }1=\infty$.

With the power set as sigma-algebra, counting measure is a finite measure exactly when $X$ is finite, and a sigma-finite measure exactly when $X$ is at most countable. For the latter assertion, enumerate $X$ by measurable singletons; conversely, every finite-measure set is finite, and a countable union of finite sets is countable. Specifying the sigma-algebra matters: if $X=\mathbb{N}$ and $\mathcal{F}=\{\varnothing ,\mathbb{N}\}$, counting measure is not a sigma-finite measure, since the only measurable finite-measure set is the empty set.

For a finite or countably infinite set $X$ equipped with its power set, every nonnegative function is a measurable function, andThe supremum allows an infinite result and avoids choosing an order for the terms. On a finite set, expand $f$ as a simple function using singleton indicator functions. On a countably infinite set, enumerate the points and apply the monotone convergence theorem to finite truncations. Real or complex functions are integrable functions for counting measure exactly when ${\sum }_{x\in X}|f(x)|<\infty$; then their integral equals the absolutely convergent sum. This is the discrete counterpart of Lebesgue integration, developed further in series as a Lebesgue integral against counting measure. ^[ref]

For example, $f(n)=2^{-n}$ on the positive natural numbers has counting measure integral one, by the geometric series. The alternating harmonic series has a finite ordered sum but is not the integral of an integrable function for counting measure: its positive and negative parts both have infinite sums. Absolute convergence is what makes the finite integral independent of enumeration. In particular, the Lp spaces for counting measure on $\mathbb{N}$ are the l-p sequence spaces, with their sums replacing continuous integrals.

Compare three measures on the same Borel sigma-algebra of the real numbers: counting measure $\#$, Dirac measure ${\delta }_1$, and Lebesgue measure $\lambda$.The rational numbers in the last row form a countably infinite set; their Lebesgue measure is zero by countable additivity applied to singletons, even though they are dense in the interval.

These are different answers to different questions: counting measure asks how many points occur, Dirac measure asks whether the selected point occurs, and Lebesgue measure asks how much length occurs. A null set therefore depends on its measure. For counting measure, the only null set is the empty set, so equality almost everywhere is equality everywhere. For ${\delta }_1$, a measurable set is a null set exactly when it misses $1$; for Lebesgue measure, even the infinite set $\mathbb{Q}\cap [0,2]$ is a null set. Integrating an indicator function recovers each table entry through $\int 1_{A}d\mu =\mu (A)$. This lets the same Lebesgue integral framework handle point counts, point evaluation, and geometric length.

The cumulative distribution function of a real random variable $X$ isIt records the probability accumulated up to a threshold. It is a nondecreasing function and is right-continuous; its limits are zero at $-\infty$ and one at $+\infty$. These properties follow from ordered threshold events, continuity from above of a measure, and continuity from below of a measure. A cumulative distribution function determines the entire probability distribution on the real line. ^[ref].

For $a<b$,where $F_X(x^{-})={\lim }_{t\uparrow x}{F}_X(t)$ is its left-hand limit. The second formula measures a jump. Thus $\mathbb{P}(a\le X\le b)=F_X(b)-F_X(a^{-})$; changing an endpoint is harmless only when its point probability is zero.

For the finite example under probability distribution, $F_X(x)$ is $0$ below zero, $0.2$ on $[0,1)$, $0.7$ on $[1,3)$, and $1$ on $[3,\infty )$. In particular $F_X(1)=0.7$, but $F_X(1^{-})=0.2$, so the jump gives $\mathbb{P}(X=1)=0.5$. For the density example, $F_Y(y)=y^2$ on $[0,1]$, and its increase from $1/4$ to $3/4$ is $9/16-1/16=1/2$.

When an absolutely continuous probability distribution has probability density function $f$, its cumulative distribution function is $F(x)={\int }_{-\infty }^{x}f(t)dt$ and $F^{\prime }=f$ almost everywhere. A continuous cumulative distribution function by itself does not guarantee such a density: the Cantor distribution is an important exception.

Suppose linear operators $A_t$ and $A_0$ on a normed space satisfy $|A_{t}f|,|A_{0}f|\le Sf$, where $S$ has weak type with a normed domain, and all relevant suprema are measurable. If $A_{t}g\to A_{0}g$ almost everywhere on a dense subspace, the same holds for every input. For a fixed approximation $g$, the limiting error is at most $2S(f-g)$. The measure where it exceeds $a$ is at most $(2C\Vert f-g\Vert /a{)}^q$, which tends to zero as the approximation improves. This is a convergence-to-a-specified-limit version of almost-everywhere convergence from weak-type domination.

Assume in addition that the probability space is a metric space, continuous integrable functions are dense in $L^1$, and the diameters of its partition cells tend to zero at each point. For a continuous $g$, the oscillation average tends to zero because every point in $M_k(x)$ is within its diameter of $x$. For $h=f-g$, the upper limit of the oscillation of $f$ is bounded by the partition maximal function of $h$ plus $|h(x)|$. The first-crossing maximal inequality for refining partitions and Chebyshev's inequality bound the measure where this exceeds $2\epsilon$ by $2\Vert h{\Vert }_1/\epsilon$. Approximation proves the displayed almost everywhere assertion. Refinement supplies the maximal estimate; shrinking diameter supplies the approximation argument. Without shrinking diameter, a constant partition generally converges only to its cell averages.

If $g$ is locally Lebesgue integrable andthen $G^{\prime }(x)=g(x)$ at every Lebesgue point of $g$, and hence almost everywhere.

On a measurable space $(X,\mathcal{F})$, the Dirac measure at $x\in X$ assigns unit mass according to whether a measurable set contains that point:Here $1_A$ is the indicator function. This is a probability measure, since ${\delta }_x(X)=1$. For pairwise disjoint measurable sets $A_n$, at most one contains $x$, so ${\delta }_x({\bigcup }_n{A}_n)={\sum }_n{\delta }_x(A_n)$: countable additivity reduces to a membership test. The definition works even when the singleton $\{x\}$ is not a measurable set. ^[ref]

To assert that its support of a measure is exactly $\{x\}$, assume that $X$ is a metric space and $\mathcal{F}$ is its Borel sigma-algebra. The singleton $\{x\}$ is then a closed set and a Borel set, with ${\delta }_x(\{x\})=1$. Every open neighbourhood of $x$ has mass one; every other point $y$ has an open ball of radius less than its distance from $x$, with mass zero. Thus $\mathrm{supp}{\delta }_x=\{x\}$. An abstract measurable space has no specified topology, so this topological conclusion is not part of the bare definition. Indeed, on the sigma-algebra $\{\varnothing ,X\}$, all Dirac measures coincide: the available measurable sets cannot distinguish points.

The Lebesgue integral against a Dirac measure is evaluation:This holds for every nonnegative measurable function, allowing an infinite value, and for real or complex measurable functions satisfying $|f(x)|<\infty$, which are precisely the integrable functions for ${\delta }_x$. For a nonnegative simple function, only the cell containing $x$ contributes to its integral; increasing simple functions and the monotone convergence theorem extend the identity. Splitting into positive and negative parts, and then real and imaginary parts, gives the remaining cases. This is why a Dirac measure turns integration into a point query.

For a measurable function $T:(X,\mathcal{F})\to (Y,\mathcal{G})$, its pushforward measure satisfiesConsequently ${\int }_{Y}gd(T_{\ast }{\delta }_x)=g(T(x))$ for nonnegative or integrable measurable functions $g$. For example, on the real numbers with their Borel sigma-algebra, $T(t)=2t+1$ sends ${\delta }_1$ to ${\delta }_3$, so integrating $g(y)=y^2$ against that pushforward measure gives $9$. ^[ref]

Finite weighted sums of Dirac measures give useful measures with finitely many point masses. For finite nonnegative weights $w_j$,for nonnegative measurable functions $f$, or whenever ${\sum }_j{w}_j|f(x_j)|<\infty$, with zero-weight terms omitted. Repeated locations have their weights added. On the real numbers, this is the finite version of the measure underlying the left-continuous cumulative function of an atomic measure; a positive-weight singleton is an atom of a measure. Unit weights at the distinct points of a finite set recover counting measure on that set. ^[ref]

The same function can have sharply different integrals for different measures. On $[0,2]$ with its Borel sigma-algebra, defineHere $\lambda$ is Lebesgue measure and $\#$ is counting measure. The singleton $\{1\}$ is a Lebesgue null set, so its changed value leaves the Lebesgue integral equal to ${\int }_0^2(t+1)dt=4$. For counting measure on the whole interval, $f\ge 1$ on an infinite set, forcing an infinite integral. On the smaller measure space $D=\{0,1,2\}$ with its power set and counting measure, the restricted function instead has integral $1+5+3=9$.

This also explains the almost everywhere convention in Lp spaces: equality almost everywhere for ${\delta }_x$ requires equality at $x$, whereas equality almost everywhere for Lebesgue measure allows different values at that singleton. A point value therefore cannot be read unambiguously from an equivalence class in an Lp space formed using Lebesgue measure.

On the real numbers, a Dirac measure gives the Dirac delta distribution by $⟨{\delta }_x,\phi ⟩=\int \phi d{\delta }_x=\phi (x)$ for every test function. The name Dirac delta function does not mean an ordinary function that is zero away from $x$ and infinitely high at $x$. Such a nonnegative measurable function still has Lebesgue integral zero, because its nonzero values occur on a Lebesgue null set. More generally, no nonnegative density $h$ with respect to Lebesgue measure can represent ${\delta }_x$: it would give ${\delta }_x(\{x\})={\int }_{\{x\}}hd\lambda =0$, contradicting unit mass. The measure and its associated distribution act on different kinds of inputs, namely measurable sets and test functions, but express the same point evaluation. ^[ref]

Let $t_0$ be interior to a parameter interval. Suppose $h(t,\cdot )$ is a measurable function for each $t$, $h(t_0,\cdot )$ is a Lebesgue integrable function, and $h(\cdot ,x)$ is differentiable near $t_0$ for $x$ almost everywhere. If one integrable nonnegative function $D$ satisfies $|{\partial }_{t}h(t,x)|\le D(x)$ throughout that neighbourhood off one fixed null set, then $F(t)={\int }_{X}h(t,x)d\mu (x)$ is defined there and satisfies the displayed derivative formula at $t_0$.

The mean value theorem gives $|h(t,x)-h(t_0,x)|\le |t-t_0|D(x)$, proving local integrability. It also bounds the difference quotient by $D$. That quotient converges almost everywhere to ${\partial }_{t}h(t_0,x)$, so the dominated convergence theorem permits passing the limit through the Lebesgue integral.

For an integrable function on $[0,1]$, average $f$ on each dyadic interval of length $2^{-n}$. The resulting step function $f_n$ converges to $f$ almost everywhere and in the L1 norm. If $U$ has the uniform distribution on $[0,1]$, then $f_n(U)=\mathbb{E}[f(U)\mid \sigma (b_n(U))]$, where $b_n$ rounds down to a dyadic endpoint. Refinement makes these conditional expectations a uniformly integrable martingale. The uniformly integrable martingale convergence theorem gives almost-sure and convergence in L1 to a limit $Y$.

Since $b_n(U)\to U$, the generated limiting sigma-algebra contains $U$ up to null sets. For every event $A$ in any finite-stage sigma-algebra, convergence in the L1 norm gives $\mathbb{E}[Y{1}_A]=\mathbb{E}[f(U)1_A]$. The pi-lambda theorem extends this equality to the limiting sigma-algebra, identifying $Y=f(U)$. The uniform distribution of $U$ translates the two convergence conclusions into the assertions for $f_n$. Choosing a Borel representative of $f$ and assigning arbitrary values at the endpoint one makes all random variables well defined without changing either conclusion.

On $(0,1{]}^d$, the dyadic filtration is generated by the partitions into half-open cubes of side $2^{-n}$. The conditional expectation of an integrable function is its average on each atom. The increasing partitions generate the Borel sigma-algebra. Step functions on these partitions are dense in $L^1$; approximation and the Doob maximal inequality show that their conditional averages converge in $L^1$ and almost everywhere to the original function.