The Functional Delta Method and Hadamard Differentiability
Anchor (Master): van der Vaart 1998 Asymptotic Statistics (Cambridge) Ch. 20-21 (functional delta method, quantiles, the bootstrap); van der Vaart & Wellner 1996 Weak Convergence and Empirical Processes (Springer) §3.9 (Hadamard and Hadamard-tangential differentiability, the chain rule, the bootstrap delta method); Gill 1989 Non- and semi-parametric maximum likelihood estimators and the von Mises method (Scand. J. Statist.) for the compact-differentiability programme
Intuition Beginner
You already know the ordinary delta method: feed a single wobbling number into a smooth function, and the output wobbles by the input wobble times the slope at the true value. This unit asks the same question one size up. What if the thing you feed in is not a number but a whole curve — the data's estimated distribution — and the machine you feed it to turns curves into answers? A median is such a machine: hand it a distribution, it returns the middle value. A trimmed mean is another: hand it a distribution, it lops off the tails and averages the rest.
The estimated distribution wobbles around the true one; that wobble is the Brownian-bridge shape from the empirical-process unit. The question is how much the machine's answer wobbles in response. The answer is the same shape of rule: near the true distribution, a smooth machine acts like a fixed linear stretch, so the answer's wobble is that linear stretch applied to the curve's wobble. The slope of one number is replaced by a fixed linear rule that maps a whole wobble-curve to an output wobble.
The subtle part is what smooth should mean for a machine that eats curves. There are several candidate notions of derivative in this setting, and only one of them — the one mathematicians call Hadamard differentiability — is both weak enough to cover the median and quantile machines and strong enough to obey the chain rule that the proof needs. Picking the right notion of smoothness is the whole content.
The one-sentence takeaway: feed the wobbling empirical distribution into a suitably smooth curve-to-answer machine, and the answer wobbles by a fixed linear rule applied to the curve's Brownian-bridge wobble.
Visual Beginner
Picture two stacked panels. The top panel shows the true distribution curve and, jittering around it, the data's estimated curve — the wobble is the pinned-at-both-ends Brownian-bridge shape from the empirical-process unit. The bottom panel shows the machine's output: a single number (say the median) with its own little bell of uncertainty. An arrow carries the whole top wobble through a box labeled "smooth machine" and deposits it as the bottom wobble.
| What you feed the machine | What the machine does | What comes out |
|---|---|---|
| A curve very close to the true one | Acts almost like a fixed linear rule | Output close to the true answer |
| The wobble (a whole random curve) | Applies that one fixed linear rule | A scaled, reshaped wobble on the answer |
| Wobble magnified by the square root of the sample size | Same linear rule, now on the magnified wobble | A stable, non-vanishing output wobble |
The thing to watch is that the box applies the same linear rule no matter which particular wobble arrives. That single fixed rule is the functional's derivative. Because the incoming wobble is Gaussian (a Brownian bridge) and the rule is linear, the outgoing wobble is Gaussian too — which is why so many statistics end up approximately normal.
Worked example Beginner
We find how much the sample median wobbles, using the curve-to-answer picture. Take data with a smooth true distribution, and let the true median be the point where the curve crosses one half. The machine is: hand it a distribution, it returns the level where the curve hits one half.
Step 1. Name the wobble at the crossing. The estimated curve at the point sits a little above or below one half. Call that vertical gap the wobble of the curve at . From the empirical-process unit, that gap has a known typical size that shrinks like one over the square root of the sample size.
Step 2. Turn a vertical gap into a horizontal shift. The median is where the curve hits one half. If the curve is shifted up by a small vertical gap near , the crossing point slides sideways. How far sideways depends on how steeply the curve is rising at — its density value there, call it . A steep curve barely shifts; a flat curve shifts a lot.
Step 3. Read off the linear rule. A vertical gap of size near moves the crossing by about divided by the steepness . That division by is the machine's fixed linear rule for the median.
Step 4. Plug in numbers. Suppose the true density at the median is , and the curve's vertical wobble at has typical size . Then the median wobbles by about .
Step 5. What this tells us. The median's wobble is the curve's wobble divided by the density at the median. The flatter the curve at the middle, the shakier the median — exactly why a median is unreliable when data piles up away from its center. The general functional delta method is this same move: a fixed linear rule carries the curve's wobble to the answer's wobble.
Check your understanding Beginner
Formal definition Intermediate+
Throughout, and are normed (typically Banach) spaces, a map defined on a subset , and a fixed point. The leading instance is or (cadlag functions under the uniform norm), or the true distribution, and or the empirical distribution. Weak convergence in -type spaces is the Hoffmann-Jorgensen outer-expectation notion of 45.05.03. The development follows van der Vaart [van der Vaart 1998] Ch. 20 and van der Vaart-Wellner [van der Vaart Wellner 1996] §3.9.
Definition (Gâteaux, Hadamard, Fréchet differentiability). Let be a continuous linear map. The map is, at :
- Gâteaux differentiable with derivative if for each fixed ,
- Hadamard (or compactly) differentiable if the same limit holds uniformly over in compact sets, equivalently
- Fréchet differentiable if as .
Fréchet implies Hadamard implies Gâteaux; the converses fail. Hadamard differentiability is the differentiability uniform over directions ranging in compact sets — strictly between the pointwise (Gâteaux) and the norm-uniform (Fréchet) notions.
Definition (Hadamard differentiability tangentially to a subspace). When is defined only on a subset and the perturbations must stay inside it, is Hadamard differentiable at tangentially to a subspace if there is a continuous linear with
for every and every sequence with and . The tangential restriction is essential: the empirical limit is supported on the continuous functions even though acts on the larger , so the derivative need only exist along directions in the support of the limit.
Definition (statistical functional and the plug-in estimator). A statistical functional is a map from a space of distributions to ; its plug-in estimator is . The influence function of at is the kernel representing the Gâteaux derivative along point-mass perturbations,
when it exists; for a Hadamard-differentiable the derivative acts as on the centred directions , identifying the derivative with integration against the influence function.
Why Hadamard is the right notion. Fréchet differentiability is too strong: the quantile and inverse-CDF maps, and even simple integration functionals on under the supremum norm, fail to be Fréchet differentiable, because the remainder is not uniformly over all small . Gâteaux differentiability is too weak: it does not by itself yield a chain rule, and it does not transfer through weak convergence (the convergence is only directionwise, not uniform on the compacts where a tight weak limit concentrates). Hadamard differentiability is exactly the notion that (i) holds for the functionals statistics actually uses and (ii) satisfies a chain rule and a delta method, because a tight weak limit concentrates on -compact sets, precisely the sets over which Hadamard differentiability is uniform.
Key theorem with proof Intermediate+
Theorem (the functional delta method). Let be normed spaces and be Hadamard differentiable at tangentially to a subspace , with derivative . Let be maps with values in such that for some sequence , where is a tight random element taking values in . Then
and moreover .
Proof. Write , so with tight in . Define the map
so that . The content is that in the sense required to pass weak convergence through, namely: if with and , then . With this is the displayed defining limit of Hadamard differentiability tangentially to , applied to the sequence .
The transfer is the extended continuous-mapping theorem of 45.05.03: if maps satisfy for every with in the support of the tight limit , and , then . Here and the support of lies in where is defined, continuous, and linear. Apply it: , which is the claimed weak convergence.
For the asymptotic-linearity remainder, the same Hadamard limit gives along every realisation with ; since is continuous and linear, , and the difference converges to in outer probability by the portmanteau/continuous-mapping argument applied to the joint convergence . Hence . When is Gaussian and , the limit is a continuous linear image of a Gaussian, hence Gaussian.
Bridge. This theorem builds toward every -limit law for a nonparametric statistic in the chapter, and the same Hadamard-plus-weak-convergence mechanism appears again in the delta method for the bootstrap, where the bootstrapped empirical process replaces and the identical derivative transfers its conditional weak limit. The foundational reason Hadamard differentiability is the load-bearing hypothesis is that a tight weak limit concentrates on -compact subsets of , and Hadamard differentiability is exactly differentiability made uniform over compacts — this is exactly the matching of the regularity of to the concentration of that the extended continuous-mapping theorem needs. This generalises the ordinary delta method 45.04.02 from to function spaces: there , every notion of differentiability coincides (compact sets are bounded-and-closed), the derivative is the Jacobian , and ; here is infinite-dimensional, the three notions genuinely differ, the derivative is a continuous linear operator, and is the -Brownian bridge of 45.05.03. Putting these together, the central insight is that the Donsker weak limit supplies the input and Hadamard differentiability supplies the transfer, so a single weak limit on delivers the asymptotics of every smooth functional of the data at once; the bridge is the passage from a limit law for the whole empirical distribution to a limit law for any quantity computed from it.
Exercises Intermediate+
Advanced results Master
Theorem 1 (the functional delta method, sharp form). Let be Hadamard differentiable at tangentially to , and let with tight and supported in . Then with the asymptotic representation [van der Vaart Wellner 1996]. The Hadamard hypothesis cannot be weakened to Gâteaux: there are Gâteaux-differentiable functionals for which the conclusion fails, because the directionwise limit does not survive the passage to the tight weak limit, which concentrates on compacts and demands the uniformity that Hadamard supplies. With the -Brownian bridge of 45.05.03 and , the limit is centred Gaussian, identified through the influence function as with variance .
Theorem 2 (the quantile process). If has a continuous positive density on the interval , the empirical quantile function satisfies, as a process in ,
where is the -Brownian bridge and the standard bridge on , weak convergence holding in [van der Vaart 1998]. The quantile process is thus the empirical-process bridge run through the inverse-map Hadamard derivative , which is the function-valued generalisation of the Beginner median computation. The endpoints are excluded because there inflates the variance, the analytic source of the difficulty of extreme-quantile estimation.
Theorem 3 (copula functionals, brief). For a bivariate distribution with continuous margins and copula defined by , the empirical copula is a Hadamard-differentiable functional of the empirical joint and marginal distributions, provided the partial derivatives exist and are continuous [van der Vaart Wellner 1996]. The resulting empirical copula process is a Gaussian process whose covariance combines the bivariate bridge with correction terms from estimating the margins, the corrections being the images of the marginal bridges under . This is the delta-method backbone of nonparametric dependence inference.
Theorem 4 (the delta method for the bootstrap). Let be Hadamard differentiable at tangentially to with a derivative that is continuous on all of (not merely defined there). Suppose the bootstrap is consistent for , meaning the conditional law of given the data converges weakly to that of , in outer probability. Then the bootstrap is consistent for :
the supremum over -Lipschitz functions bounded by [van der Vaart Wellner 1996]. The continuity of the derivative on the whole tangent space (not just at ) is the extra hypothesis the bootstrap needs beyond the ordinary delta method, because the bootstrap perturbs around the random rather than the fixed . This is the rigorous justification of the universal recipe "to get a confidence interval for , bootstrap ," and it cross-refers the bootstrap-consistency theory of the bootstrap unit.
Theorem 5 (von Mises expansion and the influence function). A Hadamard-differentiable functional admits the von Mises expansion
with the influence function (the Gâteaux derivative along point masses, centred so ) and [von Mises 1947]. The leading term is an average of i.i.d. mean-zero summands, so the central limit theorem gives directly. The influence function is simultaneously the derivative kernel, the asymptotic-variance generator, and (in robust statistics) the measure of an observation's leverage; its boundedness is the robustness criterion, which is why trimming and Winsorising — which bound — buy robustness at a controlled efficiency cost.
Synthesis. The functional delta method is the organising theorem of nonparametric large-sample theory, and the foundational reason it works is that two ingredients meet exactly: the Donsker weak limit of 45.05.03 provides a tight Gaussian input concentrated on a -compact subspace, and Hadamard differentiability provides regularity uniform over precisely those compacts, so the extended continuous-mapping theorem transfers the limit through . This is exactly the matching that fails for the two neighbouring notions of derivative: Fréchet is too strong and excludes the quantile, inverse, and integration maps that statistics lives on, while Gâteaux is too weak and breaks the chain rule and the transfer; Hadamard is the unique notion that both holds for the working functionals and obeys the calculus. The method generalises the ordinary delta method 45.04.02 from to function spaces, and the central insight is that the influence function is at once the derivative kernel, the asymptotic-variance generator via , and the robustness diagnostic, so a single object controls limit law, efficiency, and stability. Putting these together, the same derivative that gives the limit law also certifies the bootstrap (Theorem 4), so quantiles, trimmed means, the Mann-Whitney functional, copulas, and -estimators all acquire -Gaussian limits and valid resampling-based confidence sets in one stroke; the method is dual to the von Mises expansion (Theorem 5), which packages the same first-order linearisation as an i.i.d. average plus a negligible remainder.
Full proof set Master
The functional delta method, the chain rule, the mean functional, the quantile derivative, the trimmed-mean and Mann-Whitney functionals, and the -functional derivative are proved in the Key theorem and Exercises. The remaining Master claims are recorded here.
Proposition 1 (Hadamard differentiability of the inverse/quantile map, uniform version). Let be a distribution with continuous positive density on an interval where , and let be the functions continuous on . Then , as a map into , is Hadamard differentiable at tangentially to with .
Proof. Fix uniformly with , and set , , . The defining relations are and (using continuity of on the relevant range). Subtract and use :
By the mean value theorem for between and . Uniform convergence on holds because is bounded below by on the compact range, giving uniformly. Hence uniformly, by continuity, and by joint convergence of and with continuous. Dividing by ,
uniformly in . The convergence is in the sup-norm of , the limit is linear in and continuous (division by the bounded-below ), so is Hadamard differentiable tangentially to with the stated derivative. Composing with the input proves Theorem 2.
Proposition 2 (Gâteaux is insufficient: a delta-method counterexample). There is a functional that is Gâteaux differentiable at with continuous linear derivative , and inputs , for which fails.
Proof. Work in -type direction by taking with a non-uniform structure mimicked through a sequence: let for and . Along every fixed line , , so the Gâteaux derivative at exists and equals the linear map — but this is not linear in , exhibiting the standard failure: Gâteaux derivatives need not be linear. Replacing by a genuinely linear-Gâteaux but non-Hadamard example, take if and otherwise; then has zero Gâteaux derivative at along every straight line, yet for the curved approach with the difference quotient is . So is not Hadamard differentiable, and feeding a sequence that approaches along such a parabola — which a tight non-degenerate assigns positive mass near — makes fail to converge to . The obstruction is exactly the lack of uniformity over converging direction-sequences that defines Hadamard differentiability.
Proposition 3 (the bootstrap delta method requires derivative continuity on the tangent space). Under the hypotheses of Theorem 4 — Hadamard differentiability with derivative continuous on and bootstrap consistency for — the bootstrap is consistent for , and the continuity of on is not removable.
Proof. By bootstrap consistency for , the conditional law of given the data converges to that of in outer probability (in the bounded-Lipschitz metric). The bootstrap version of the delta method linearises around the random centre rather than : a version of Hadamard differentiability uniform in a neighbourhood (supplied by continuity of on the tangent space) gives conditionally, where the remainder is negligible because the centre and the derivative varies continuously. Applying the conditional continuous-mapping theorem to the continuous linear transfers the conditional weak limit: the conditional law of converges to that of in outer probability, which is the displayed bounded-Lipschitz statement. Continuity of across is needed because the bootstrap evaluates the derivative effectively at the moving point ; a derivative defined only at leaves the linearisation around uncontrolled, and the bootstrap can then be inconsistent even when the ordinary delta method holds, as occurs for non-smooth functionals such as at .
Proposition 4 (von Mises expansion has a negligible remainder for Hadamard functionals). If is Hadamard differentiable at tangentially to a subspace containing the support of , then with the influence function and .
Proof. The functional delta-method representation (Key theorem) gives . The derivative acts as integration against the influence function, , so . Centring of the influence function, (the derivative annihilates the constant direction, since ), reduces this to . Dividing the whole representation by yields , the von Mises expansion. The leading term is a centred i.i.d. average; the central limit theorem then gives the Gaussian limit with variance , recovering Theorem 5 and tying the functional delta method to the influence-function calculus of robust statistics.
Connections Master
Donsker classes and the empirical-process weak limit 45.05.03 supply the indispensable input: the functional delta method is a transfer theorem, and the object it transfers is exactly the Donsker convergence in . The tightness of on a -compact tangent subspace is what licenses the extended continuous-mapping step, so this unit is the consumer of the weak limit that unit produces.
The delta method and the second-order delta method 45.04.02 is the finite-dimensional special case: when the unit ball is compact, the three notions of differentiability coincide, the Hadamard derivative is the Jacobian, and the functional delta method collapses to the ordinary delta method with sandwich covariance . This unit is the infinite-dimensional lift of that result.
The bootstrap and its consistency 45.04.10 is where Theorem 4 lives: the delta method for the bootstrap shows that whenever a functional is Hadamard differentiable with a derivative continuous on the tangent space and the bootstrap is consistent for the empirical measure, the bootstrap is automatically consistent for the plug-in functional. This is the theoretical license behind resampling confidence bands for quantiles, trimmed means, and copula functionals, and it is exactly the smoothness condition whose failure (at non-differentiable functionals) explains documented bootstrap inconsistencies.
-statistics and their limit theory 45.05.05 meet this unit at the Mann-Whitney/Wilcoxon functional of Exercise 6: a degree-two -statistic and the corresponding two-sample functional admit the same Gaussian limit, reached either by Hoeffding projection or by the functional delta method, and the influence function of the functional is the projection kernel of the -statistic.
M-estimators and Z-estimators 45.04.04 are recovered through Exercise 8: an estimator defined as the zero of an estimating equation is a Hadamard-differentiable functional of the empirical measure, and its influence function and sandwich variance fall out of the implicit-function differentiation, an alternative to the direct stochastic expansion of the score that unit uses.
Historical & philosophical context Master
The idea that a statistic should be viewed as a functional of the underlying distribution, and that its asymptotics should follow from differentiating that functional, originates with Richard von Mises's 1947 Annals paper [von Mises 1947], which introduced the expansion now bearing his name and treated "differentiable statistical functions" by a Taylor development in the distribution. Von Mises worked with what is essentially a Gâteaux derivative and a remainder controlled by hand, and the programme stalled on the question of which notion of derivative makes the remainder genuinely negligible.
The resolution that compact (Hadamard) differentiability is the correct notion was reached in the 1970s, principally in James Reeds's 1976 Harvard thesis [Reeds 1976], which argued that Fréchet differentiability is too strong for the quantile and related maps while Gâteaux is too weak for a chain rule, and that Hadamard differentiability threads the needle. Luisa Fernholz's 1983 lecture notes [Fernholz 1983] systematised the von Mises calculus around the Hadamard derivative and the influence function. Richard Gill's 1989 paper [Gill 1989] extended the compact-differentiability method to the product-integral and survival-analysis functionals central to event-history analysis, and the synthesis in van der Vaart and Wellner's 1996 monograph [van der Vaart Wellner 1996] and van der Vaart's 1998 textbook [van der Vaart 1998] fixed the modern statement, including the delta method for the bootstrap. The influence function, introduced by Frank Hampel in the robustness literature as the derivative of a functional along point-mass contamination, coincides with the Hadamard derivative kernel, unifying the robustness and asymptotic-efficiency readings of the same object.
Bibliography Master
@book{vanderVaart1998,
author = {van der Vaart, Aad W.},
title = {Asymptotic Statistics},
publisher = {Cambridge University Press},
series = {Cambridge Series in Statistical and Probabilistic Mathematics},
year = {1998}
}
@book{vanderVaartWellner1996,
author = {van der Vaart, Aad W. and Wellner, Jon A.},
title = {Weak Convergence and Empirical Processes: With Applications to Statistics},
publisher = {Springer-Verlag},
series = {Springer Series in Statistics},
address = {New York},
year = {1996}
}
@article{vonMises1947,
author = {von Mises, Richard},
title = {On the asymptotic distribution of differentiable statistical functions},
journal = {Annals of Mathematical Statistics},
volume = {18},
number = {3},
year = {1947},
pages = {309--348}
}
@phdthesis{Reeds1976,
author = {Reeds, James A.},
title = {On the Definition of von Mises Functionals},
school = {Harvard University},
year = {1976}
}
@book{Fernholz1983,
author = {Fernholz, Luisa T.},
title = {von Mises Calculus for Statistical Functionals},
publisher = {Springer-Verlag},
series = {Lecture Notes in Statistics},
volume = {19},
address = {New York},
year = {1983}
}
@article{Gill1989,
author = {Gill, Richard D.},
title = {Non- and semi-parametric maximum likelihood estimators and the von Mises method (Part 1)},
journal = {Scandinavian Journal of Statistics},
volume = {16},
number = {2},
year = {1989},
pages = {97--128}
}
@article{Hampel1974,
author = {Hampel, Frank R.},
title = {The influence curve and its role in robust estimation},
journal = {Journal of the American Statistical Association},
volume = {69},
number = {346},
year = {1974},
pages = {383--393}
}