Codex @codex  0

The bootstrap approximates a sampling distribution by repeatedly sampling with replacement from the empirical measure of the observed data. In the ordinary nonparametric version, observations are assumed independent and identically distributed; a bootstrap sample has the same size as the original statistical sample. A statistic, such as a sample mean or sample median, is recomputed on each resample. Its variation across resamples estimates how the original statistic would vary across repeated sampling from the unknown probability distribution.^[ref]

The key distinction is between the observed statistical sample and its still-unknown source probability distribution. Condition on the observed values $x_1,\dots ,x_n$ and form the empirical measureHere ${\delta }_{x_i}$ is a Dirac measure. Draw independent indices $I_1,\dots ,I_n$ from the uniform distribution on a finite set $\{1,\dots ,n\}$ and set $X_j^{\ast }=x_{I_j}$. Each observed slot has probability $1/n$ on every draw. If equal values occupy several slots, their total probability is the sum of those slot probabilities; distinct observed values need not be equally likely. A star denotes this conditional resampling experiment. There are $n^n$ equally likely ordered index sequences, although bootstrap count vectors and statistics can combine many such sequences.

A complicated sampling distribution need not stop statistical inference when recomputing the statistic is easy. The bootstrap reuses that calculation on simulated datasets. The plug-in estimator principle replaces the unknown probability measure by ${\hat{P}}_n$ in the whole repeated-sampling experiment. Whether that substitution approximates the target sampling distribution needs an appropriate bootstrap consistency theorem for the sample mean or a result for the particular statistic. A larger number of resamples reduces Monte Carlo error; it cannot repair the bootstrap failure for a uniform endpoint, an unrepresentative statistical sample or ignored statistical dependence.^[ref]

With appropriate probability density functions and finite differential entropies, $h(X)-h(X\mid Y)=I(X;Y)\ge 0$, with equality iff independence. Differential entropy does not reverse the inequality; infinite or undefined quantities cannot justify subtraction.^[ref]

However, differential entropy can be negative and depends on the choice of coordinates. For $X$ with a uniform distribution on an interval of length $a>0$, $h(X)={\log }_{2}a$; in particular $a=1/2$ gives $-1$. Rescaling $X$ by a constant $c>0$ adds ${\log }_{2}c$ to both $h(X)$ and $h(X\mid Y)$, whenever they are finite, leaving the mutual information unchanged.^[ref]

If a continuously distributed $X$ is revealed exactly, its conditional distribution is a Dirac measure with no ordinary probability density function. The discrete identity $H(X\mid X)=0$ has no finite differential entropy counterpart. Mutual information, defined through relative entropy, is infinite here.^[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.

A cure model mixes an individual class with identically zero hazard function and a susceptible class with survivor function $S_{\ast }$. For $0\le \pi <1$, its representation as a proportional frailty model with $\mathbb{E}U=1$ is $U=0$ with probability $\pi$ and $U=1/(1-\pi )$ otherwise, with baseline hazard $h_0=(1-\pi )h_{\ast }$. The frailty law is a mixture of two Dirac measures, rather than an ordinary density. Its Laplace transform evaluated at $H_0$ gives the displayed survivor function. The limiting survival equals $\pi$ when $S_{\ast }(t)\to 0$; otherwise the plateau also includes susceptible individuals who never experience the event.

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]

The essential infimum and essential supremum describe the lower and upper bounds of a measurable function after disregarding null sets for a specified measure. A pointwise infimum or supremum sees every input; an essential bound sees whether values below or above a proposed threshold occur on a set of positive measure. Thus "essential" means insensitive to changes on a null set, rather than insensitive to unusual values. This distinction makes essential bounds compatible with Lebesgue integrals and the equivalence classes used in Lp spaces. ^[ref].

For a real measurable function $f$ on a measure space $(X,\Sigma ,\mu )$, the definitions areThese can take values in the extended real number line. On a space of positive total measure, finite essential bounds obey ${\mathrm{essinf}}_{\mu }f\le f\le {\mathrm{esssup}}_{\mu }f$ almost everywhere. If $s={\mathrm{esssup}}_{\mu }f$ is finite, every threshold $b<s$ has $\mu (\{f>b\})>0$; the corresponding lower-edge statement is $\mu (\{f<a\})>0$ for every $a>{\mathrm{essinf}}_{\mu }f$. These are the measure-based counterparts of the approximation property of a supremum and approximation property of an infimum.

Here is a two-sided example on $[0,1]$ with Lebesgue measure:The pointwise bounds are $\inf g=-3$ and $\sup g=4$, while the essential bounds are $\mathrm{essinf}g=0$ and $\mathrm{esssup}g=1$. Both exceptional singletons are null sets. But for $0<a<1$, the inputs where $g<a$ still have measure $a$, and those where $g>a$ have measure $1-a$: deleting or adding two individual inputs cannot change those lengths. Hence neither essential bound can be moved inward.

The choice of measure is part of the answer. The same $g$ has essential bounds $-3$ and $4$ under counting measure, because every nonempty set has positive measure. Under the Dirac measure at $1/4$, both essential bounds equal $-3$. A null set for one measure need not be a null set for another.

Nor must the exceptional inputs be isolated. The Dirichlet function, equal to one at rational numbers and zero at irrational numbers, has pointwise supremum one on $[0,1]$, but essential supremum zero for Lebesgue measure: the rational numbers form a countable set that is a null set, even though they are dense. Conversely, a value ten on an interval of length $0.001$ affects the essential supremum just as decisively as it would on half the domain. Small positive measure is not zero measure.

The essential supremum is the upper bound for a measurable function after disregarding null sets for a specified measure $\mu$. Its definition iswith values allowed in the extended real number line. A supremum controls every value; an essential supremum controls values almost everywhere. It therefore depends on the chosen measure, as well as on the function. ^[ref].

For a worked example, use Lebesgue measure on $[0,1]$ and putIts supremum is ten, attained at $1/2$. But its essential supremum is one: $f\le 1$ outside the singleton $\{1/2\}$, which is a null set. Every candidate $M<1$ fails, because the interval $(\max (0,M),1)$ has positive Lebesgue measure and includes values larger than $M$; changing one point cannot remove that interval. In particular, $\mu (\{f>0.8\})=0.2$, while $\mu (\{f>1\})=0$.

Why is this useful? Lebesgue integrals ignore changes on null sets, and Lp spaces identify functions that agree almost everywhere. The L-infinity norm uses $\mathrm{esssup}|f|$ so it respects that identification. For this nonnegative example the supremum norm is ten and the L-infinity norm is one; replacing $f(1/2)$ by $1/2$ changes the former while leaving the latter unchanged. ^[ref].

The measure qualification is essential. For $\mu ={\delta }_{1/2}$, the Dirac measure concentrated at the exceptional input, that singleton has measure one and this function has essential supremum ten. A set ignored by one measure need not be ignored by another. The lower counterpart is the essential infimum, with $\mathrm{essinf}f=-\mathrm{esssup}(-f)$.

A sigma-finite measure on a standard Borel space is the intensity measure of a point process with Poisson counts. Partition the space into sets of finite intensity, draw an independent Poisson count on each piece, and conditional on that count draw independent points from its normalized intensity measure. The sum of their Dirac measures is the required Poisson random measure. Non-atomic intensity gives simplicity; local finiteness of the intensity gives local finiteness of the point configuration.

Set $U(x)=U_0({\delta }_x)$. On a finite measurable space, points in the same atom of a sigma-algebra give the same Dirac measure, so $U$ is a measurable function and constant on atoms. Every probability measure is a finite mixture of representative Dirac measures with its atom masses as weights. Affineness then proves the expected-utility representation, even when the sigma-algebra is smaller than the power set.

For complex $C(K)$ on a compact Hausdorff space, the extreme points of its dual unit ball are precisely unimodular multiples of Dirac measures. A measure whose variation measure has mass on two disjoint sets splits as a nontrivial convex combination of normalized restrictions and is not extreme. This description is the key to the Banach–Stone theorem.

A Gaussian random variable is a random variable whose probability distribution is a normal distribution. For $\sigma >0$, write $X=\mu +\sigma Z$ with a standard normal random variable $Z$; conversely, standardization of a normal random variable recovers $Z=(X-\mu )/\sigma$. For example, $X\sim N(100,15^2)$ has mean $100$, standard deviation $15$, and variance $225$. The outcome $x=115$ corresponds to standard score $z=1$, one standard deviation above the mean.

Some definitions also allow a Gaussian random variable with $\sigma =0$. This means $X=\mu$ almost surely, with variance zero and probability distribution equal to the Dirac measure ${\delta }_{\mu }$. It has no probability density function with respect to Lebesgue measure: $\mathbb{P}(X=\mu )=1$. The positive-scale density formula and division by $\sigma$ apply only when $\sigma >0$. MIT's constructive definition explicitly includes the constant case. ^[ref].

An influence function asks how much a population answer moves when an infinitesimal fraction of its probability distribution is relocated to a specified point. It distinguishes the unbounded response of the mean from the bounded response of the median and the Huber location estimator. The normal-location influence curves and finite contamination bias of normal location below make that difference quantitative.

Let $T$ be a real-valued statistical functional, $F$ a reference probability measure, and ${\delta }_x$ the Dirac measure concentrated at $x$. Along the epsilon-contamination neighborhood path $F_{\epsilon ,x}=(1-\epsilon )F+\epsilon {\delta }_x$, define the right derivativeThe name influence curve refers to the same object. The derivative is in the signed direction ${\delta }_x-F$, so the calculation removes baseline mass as well as adding a Dirac measure. The definition is a limit for each fixed $x$; it does not automatically give a remainder uniform over arbitrarily distant $x$.^[ref]

The statistical functional must be defined on these contaminated probability measures, and the right derivative must exist and be finite. For a mean, a finite first absolute moment suffices. For a median, require a unique baseline median and a probability density function continuous and strictly positive there. For a smooth M-estimator, require an isolated population root, justified differentiation of its expected value, and a nonzero derivative with respect to the fitted parameter. These are specific conditions for the formulas below. Existence of the pointwise influence function alone proves neither an asymptotic linear representation nor pathwise differentiability of a statistical functional; each needs control of its own remainder and admissible statistical paths.

The intensity measure of a point process $\Pi$ is its expected counting measure:It may take the value $+\infty$.^[ref] Countable additivity follows by applying the monotone convergence theorem to the counts of finite unions of pairwise disjoint observation windows. If $\mu$ is locally finite and absolutely continuous with respect to Lebesgue measure, its Radon-Nikodym derivative is the intensity function of a point process $\lambda$:This is an expected number per unit volume, not a probability density function for a randomly selected point. For example, a single deterministic point has $\mu ={\delta }_0$, a Dirac measure, and no Lebesgue measure density. The density representation requires its own assumption.^[ref]

For a bounded Borel set $W$, $\mathbb{E}[N_W]=\mu (W)$, but local finiteness alone does not ensure that this expected value is finite. Conversely, $\mu (W)<\infty$ implies $N_W<\infty$ almost surely, even when $W$ is unbounded. A constant finite intensity function of a point process on all of ${\mathbb{R}}^d$ has infinite total intensity measure, although every bounded window has finite expected value.

In a nearest-neighbor voter model on the square lattice, any two ancestral coalescing random walks meet almost surely. For an invariant probability measure of a Markov process, the disagreement probability is constant in time but bounded by the vanishing probability of noncoalescence. Hence every pair of sites agrees almost surely. Countability concentrates the measure on the two constant configurations; both are absorbing state, so every mixture of their Dirac measures is invariant. Translation invariance need not be assumed.

Let $X\ge 3$, and let $f$ be a normalized multiplicative arithmetic function supported on squarefree integers, with $|f(p)|\le 1$. Form the finite measure $\nu ={\sum }_{n}f(n)n^{-1-1/\log X}{\delta }_{\log n}$ using Dirac measures. Under the transform convention $\hat{\nu }(t)=\int e^{-itu}d\nu (u)$, its Euler product is ${\prod }_p(1+f(p)p^{-1-1/\log X-it})$. Expanding its logarithmic modulus, and replacing the damped prime weights by $1/p$ up to $X$ with Mertens first theorem, gives the displayed absolute bound, uniformly in real $t$. Hence $|\hat{\nu }(t)|\ge \delta \log X$ forces $D(f,n^{it};X{)}^2\le \log (C/\delta )$. The distance expression still defines a nonnegative pretentious score for prime values bounded by one; its actual metric interpretation uses unit-modulus values.

On a measurable space $(X,\mathcal{F})$, a measure is a function $\mu :\mathcal{F}\to [0,\infty ]$ with $\mu (\varnothing )=0$ and countable additivity: for pairwise disjoint measurable sets $A_n$,Infinite size is permitted. Nonnegativity implies that if measurable sets satisfy $A\subseteq B$, then $\mu (A)\le \mu (B)$: decompose $B$ into $A$ and $B\setminus A$. For overlapping measurable sets, use countable subadditivity rather than adding their full sizes twice.

For example, counting measure gives $\mu (\{a,b,c\})=3$, while a Dirac measure ${\delta }_a$ gives that same set size $1$ if it contains $a$. Under Lebesgue measure, $[0,1/4]\cup [3/4,1]$ has size $1/4+1/4=1/2$. These are all measures, but they answer different questions: how many objects, whether a distinguished object is present, or how much length is occupied.

A mixture distribution first chooses a component $j$ with nonnegative mixture weights $w_j$ summing to one, then samples from its law $P_j$. Consequently $P(A)={\sum }_j{w}_j{P}_j(A)$, and any finite moment-generating function is the same weighted sum of the component transforms. A component may be a Dirac measure, so a mixture may have both discrete and continuous parts.

A statistical functional is a map $T$ defined on a class of probability distributions. Its associated functional statistic is $T(F_n)$, where $F_n=n^{-1}{\sum }_i{\delta }_{X_i}$ is the empirical distribution and each ${\delta }_{X_i}$ is a Dirac measure. For example, $T(F)=\int xdF(x)$ yields the sample mean. The influence function records the derivative in the direction of point contamination:It is a local, infinitesimal robustness diagnostic, not a description of arbitrary large contamination.

Suppose $T$ is differentiable in a sense strong enough to linearize it at the empirical distribution, and that its derivative in a signed direction $G-F$ is $\int \mathrm{IF}(x;T,F)d(G-F)(x)$. Averaging the directions ${\delta }_z-F$ over $z\sim F$ gives the zero direction, so linearity implies $\int \mathrm{IF}dF=0$. The resulting asymptotic linear representation isIf $\int {\mathrm{IF}}^{2}dF<\infty$, the central limit theorem and the negligible remainder giveThus the asymptotic variance is $n^{-1}\int {\mathrm{IF}}^{2}dF$. For a vector functional the integral is $n^{-1}\int \mathrm{IF}{\mathrm{IF}}^{\mathsf{T}}dF$. Convergence of the actual finite-sample variance to this leading expression additionally requires control of second moments of the remainder, or an appropriate uniform integrability condition; convergence in distribution alone does not provide that. Existence of a contamination derivative by itself also does not guarantee the required empirical linearization.

Several complementary robustness measures follow. Gross-error sensitivity is ${\gamma }^{\ast }={\sup }_z|\mathrm{IF}(z)|$. Under contamination $(1-\epsilon )F+\epsilon H$, the first-order bias is $\epsilon \int \mathrm{IF}dH$, whose worst absolute coefficient is ${\gamma }^{\ast }$; bounded influence therefore bounds infinitesimal gross-error bias. The local-shift sensitivity is ${\lambda }^{\ast }={\sup }_{x\ne y}|\mathrm{IF}(x)-\mathrm{IF}(y)|/|x-y|$, equal to $\sup |{\mathrm{IF}}^{\prime }|$ when the influence function is smoothly differentiable. It measures the effect of moving a contaminant a small distance. The rejection point of an influence function is ${\rho }^{\ast }=\inf \{r:\mathrm{IF}(x)=0\text{ for }|x|>r\}$, using centered, standardized coordinates; it is infinite if there is no such cutoff. A finite cutoff completely rejects sufficiently extreme observations to first order. These measures address different aspects of robustness. The integral of squared influence controls asymptotic precision and efficiency, while breakdown point concerns finite amounts of contamination and is not determined by bounded influence alone.

For the quantile, assume $0<p<1$, a unique solution $q=q_p(F)$, and a density continuous and positive at $q$. Define quantiles of the contaminated distribution by generalized inversion, since a distribution with a point mass need not attain $p$ as an equality. If $z\ne q$, its indicator is constant near $q$ for sufficiently small contamination, and differentiatingat zero gives $-p+f(q)q_0^{\prime }+1_{z\le q}=0$. HenceAt the exceptional point $z=q$, the generalized-inverse quantile remains exactly $q$: below $q$ the contaminated cumulative distribution function is below $p$, and its value at $q$ exceeds $p$. Its actual derivative there is zero. The usual step-function expression is an almost-everywhere version, which is all that the asymptotic variance needs. Its mean is zero, and its second moment isTherefore the influence function of a quantile gives asymptotic variance $p(1-p)/(nf(q{)}^2)$ and gross-error sensitivity $\max (p,1-p)/f(q)$. Its jump makes local-shift sensitivity infinite, and its nonzero constant tails make its rejection point infinite. If $f(q)=0$ or the quantile is not unique, this regular derivation does not apply.

For a profinite abelian group $G$, its Iwasawa algebra is the completed group algebrawhere $U$ runs over open subgroups. The transition map sums the coefficients over the fibers of $G/V\to G/U$ when $V\subset U$. Consequently an element gives compatible values $\mu (gU)\in {\mathbb{Z}}_p$ on cosets, equivalently a finitely additive ${\mathbb{Z}}_p$-valued p-adic measure on the clopen sets of $G$. Conversely these values specify every finite-quotient coefficient. Integration of a continuous function with values in ${\mathbb{Z}}_p$ is obtained by uniform approximation by locally constant functions; the integrals converge because all measure values have $p$-adic absolute value at most $1$. Multiplication in the Iwasawa algebra becomes convolution of p-adic measures. This is its measure realization of an Iwasawa algebra.

The Mahler theorem states that each continuous function $g:{\mathbb{Z}}_p\to {\mathbb{Z}}_p$ has the unique expansion converging in the sense of uniform convergenceIts Mahler coefficients areand $\Vert g{\Vert }_{\infty }={\sup }_n|b_n{|}_p$. The same assertion holds for continuous functions with values in ${\mathbb{Q}}_p$ with coefficients in ${\mathbb{Q}}_p$.

Given $f(T)={\sum }_{n\ge 0}{a}_n{T}^n\in R$, define the bounded linear functionalThe sum converges because $a_n\in {\mathbb{Z}}_p$ and $b_n\to 0$. Its values on indicator functions of clopen sets give a p-adic measure, denoted $\lambda (f)$, withConversely, a p-adic measure determines these coefficients $a_n\in {\mathbb{Z}}_p$, and continuity allows termwise integration of every Mahler expansion. Thus the inverse iswhich is the Amice transform. These two constructions are inverse, proving the canonical bijection $\lambda :R\simeq \Lambda ({\mathbb{Z}}_p)$. In fact it is an isomorphism of rings: the identity $\left(\genfrac{}{}{0ex}{}{x+y}{n}\right)={\sum }_{i+j=n}\left(\genfrac{}{}{0ex}{}{x}{i}\right)\left(\genfrac{}{}{0ex}{}{y}{j}\right)$ identifies convolution of p-adic measures with multiplication of formal power series. For example, $\lambda (1)={\delta }_0$ and $\lambda (1+T)={\delta }_1$, where ${\delta }_a$ is the Dirac measure at $a$.

For the moment identity, let $\left\{\genfrac{}{}{0ex}{}{k}{n}\right\}$ denote a Stirling number of the second kind. The finite polynomial identitygives $\int x^{k}d\lambda (f)={\sum }_{n=0}^k{a}_{n}n!\left\{\genfrac{}{}{0ex}{}{k}{n}\right\}$. On the other hand, $D=(1+T)d/dT$ satisfies $D^k(1+T{)}^x=x^k(1+T{)}^x$ for every nonnegative integer $x$. Expanding $(1+T{)}^x$ and evaluating at $T=0$ yieldsComparison in the basis of binomial polynomials gives $(D^k{T}^n)(0)=n!\left\{\genfrac{}{}{0ex}{}{k}{n}\right\}$. Terms with $n>k$ have zero constant term after at most $k$ differentiations, so no infinite-series interchange is needed. ThereforeThe case $k=0$ says that the total mass is $f(0)$.

A frailty model represents unobserved individual heterogeneity by a random effect in the hazard function. In a proportional frailty model, an individual with frailty random variable $U=u$ has hazard $u{h}_0(t)$. The normalization $\mathbb{E}U=1$ identifies the scale of the baseline hazard: without it, multiplying all frailties by a constant and dividing $h_0$ by that constant would leave all individual hazards unchanged.

Let $H_0(t)={\int }_0^t{h}_0(v)dv$. Conditional survival follows by integrating the hazard function:Taking the expectation over the frailty law yieldsThis is the Laplace transform of the frailty density evaluated at the cumulative hazard. More generally, the same calculation integrates against a probability measure, allowing atoms. It averages conditional survival rather than substituting $\mathbb{E}U$ into its exponent. Indeed, the frailty distribution among survivors is proportional to $e^{-u{H}_0(t)}g(u)$, giving population hazardSurvival progressively selects smaller frailties, so the population hazard need not be the baseline or even retain the individual's proportional structure.

For the cure model, first take $0\le \pi <1$. The necessary mean-one frailty law and baseline hazard areThen $\mathbb{E}U=\pi \cdot 0+(1-\pi )/(1-\pi )=1$. A cured person's conditional hazard is zero, while a susceptible person's conditional hazard is $h_0/(1-\pi )=h_{\ast }$. Taking $U$ to be zero or one while leaving $h_0=h_{\ast }$ would instead have mean frailty $1-\pi$ and violate the required normalization.

The frailty law is the measurewhere the $\delta$ terms are Dirac measures. This is not an ordinary Lebesgue density; the cure construction requires permitting a discrete frailty law. Its Laplace transform isWriting $H_{\ast }(t)={\int }_0^t{h}_{\ast }(v)dv$, we have $H_0=(1-\pi )H_{\ast }$, and thereforeIf $H_{\ast }(t)\to \infty$, the susceptible class eventually experiences the event and $S(t)\to \pi$. If $H_{\ast }(\infty )<\infty$, the limiting survival is larger than $\pi$ because some susceptible subjects also never experience the event. At $\pi =1$, everyone is cured: set $h_0\equiv 0$ and, for example, $U\equiv 1$ to retain mean one, giving $S\equiv 1$ without using the singular formula $1/(1-\pi )$.