For , this U-statistic has expectation . It removes the diagonal term from the integral of a squared second derivative kernel density estimator, but leaves smoothing bias of an estimator.
Hoeffding projection 2026-10-14
The displayed sum is the first-order projection of a centred U-statistic onto sums of functions of individual observations. Its summands are independent and have mean zero. Subtracting it leaves a remainder with conditional expectation zero in each individual observation, a useful decomposition for variance and normal-limit calculations.
A one-sample U-statistic of fixed degree has a symmetric U-statistic kernel and averages it over all distinct subsets of an iid sample:
It is unbiased for . With finite second moment, define the first Hoeffding projection . Orthogonality of the higher projections gives
If , the central limit theorem therefore proves the U-statistic central limit theorem
Equivalently the influence function of a U-statistic is , obtained by differentiating its population functional in each distribution argument. If , the root- limit degenerates and the second or higher projection determines a different, often nonnormal, limit.
For example, gives the unbiased sample variance with denominator . Its first projection is , so the influence function is . When the fourth moment is finite, the leading variance of the sample variance is . This example connects unbiased symmetric estimation to the functional influence calculation.
The empirical distribution function is . For continuous F, the probability integral transform gives independent uniform variables . Strict increase of F is unnecessary. More explicitly, generate the observations by with the generalized quantile inverse. Then , so , where is the uniform empirical distribution.
Continuity and the limits of F ensure that its range contains . The endpoint discrepancies for are zero. Hence
which depends only on n. Equivalently it is , a function of uniform order statistics. This proves the distribution-free property of the Kolmogorov-Smirnov statistic even when F has flat portions.
Choose from this common distribution so that . The Kolmogorov-Smirnov confidence band is
The event that all these inequalities hold is exactly the event used to choose the critical value, giving simultaneous coverage . The Glivenko-Cantelli theorem states that for an independent identically distributed sample from any distribution function, continuous or not, almost surely.
For an integrable r-argument U-statistic kernel, replace it by . Every permutation has the same expectation by exchangeability, so this symmetrization of a U-statistic kernel preserves the target functional. For a symmetric U-statistic kernel h and , the U-statistic is
Each summand has expectation theta, hence the statistic is unbiased.
For the population variance, use . Independence gives when the second moment is finite. The corresponding statistic simplifies using :
Thus variance as a U-statistic is precisely the usual unbiased sample variance, for .
Let . Under the symmetric continuous null hypothesis, positive and negative signs have probability and zeros have probability zero. For the sign test, take and reject for small values: under the null. Choose with ; randomization at the next value attains exact size if desired. The lower tail is appropriate for .
For the Wilcoxon signed-rank test, rank increasingly and put . Continuous observations have no absolute-value ties almost surely. Conditional on the absolute values, the signs are independent fair signs because symmetry makes the sign independent of magnitude. Hence has the distribution of for independent Bernoulli random variables with parameter . Again reject in the lower tail, using this exact subset-sum distribution or a normal approximation. Independence gives the requested null moments:
For a symmetric kernel of fixed order , a one-sample U-statistic is . State the U-statistic central limit theorem: if , , and , then . The nondegeneracy condition is important.
For , its order-two U-statistic satisfies the exact Wilcoxon signed-rank statistic identity
To prove it, in an unordered pair the sign of the sum is the sign of whichever observation has larger absolute value. Counting the pairs for which a positive observation is larger contributes its rank minus one; its own positive-sign indicator supplies the remaining one.
Write for the distribution function of under the null. Symmetry gives and
The probability integral transform makes uniform on , so . Therefore . The centred is and is negligible on the scale of . Combining the exact decomposition and its mean gives
The lower-tail approximate level- rejection rule compares this standardized statistic with ; a half-unit continuity correction can refine discrete-tail calculations.
Use the usual probability-kernel convention: , , and , in addition to symmetry and compact support. These conditions are needed for the stated finite bound; symmetry and compact support by themselves do not impose normalization or nonnegativity. Interpret the differentiability assumption in the usual Sobolev space sense , or assume classical regularity sufficient for the integral Taylor remainder. The kernel density estimator is
The bias-variance decomposition of mean squared error, followed by Tonelli theorem, yields
Independence and a change of variables give the exact integrated variance of a kernel density estimator
All changes of integration order are justified either by nonnegativity or by the displayed finite integrals.
For the bias of a kernel density estimator, symmetry gives . Taylor's integral remainder, with translations understood in , gives
The Minkowski inequality and translation invariance of the L2 norm imply
where . Consequently we obtain the slightly stronger conclusion
Since , this proves the requested bound. For signed kernels, the same argument has in place of ; the printed bound is not generally justified merely by signed-kernel symmetry. For example, let and . This symmetric compactly supported signed kernel has integral one and , but its fourth moment is nonzero. For a normal density its convolution has nonzero bias at any fixed positive bandwidth. Sending would therefore contradict a bound containing only the integrated variance term.
Writing the requested bound as , differentiation gives when . Thus gives mean integrated squared error of order . With the sharper constant one instead has ; the rate is identical.
A direct heuristic for is to choose a twice differentiable pilot kernel , estimate by the second derivative kernel density estimator
and integrate its square. Its integrated variance contains a diagonal term , which should not be mistaken for the target. A useful corrected U-statistic removes that diagonal:
Its expectation is . Thus smoothing bias of an estimator, rather than the diagonal contribution, remains. For a smooth compactly supported probability pilot kernel, the same variance calculation gives
The second term tends to zero because convolution with a shrinking probability kernel approximates every function. Thus and make the raw squared pilot estimate consistent for the quadratic density derivative functional. If , then
so the diagonal-corrected U-statistic is consistent under the same choice. Consistency already uses the assumed ; the additional third-derivative hypothesis is relevant to more ambitious rate heuristics.
Three bounded continuous derivatives do not justify a general root- estimation rate for . For a smooth perturbation with compact support, the directional derivative is
where the last expression requires a fourth derivative in the appropriate weak sense. A regular root- argument would need an influence function proportional to , with finite variance under . Three derivatives do not supply that condition.
For a more quantitative heuristic, impose the additional assumption , use a smooth Fourier cutoff of width , and estimate the quadratic functional by its off-diagonal U-statistic. The tail bias of an estimator is because the Plancherel theorem weights this functional by frequency to the fourth power. The degenerate part of its standard deviation is : the squared norm of the quadratic kernel scales as . At , these two terms balance at and have size , already slower than ; any additional first-order variance cannot improve that balance. To make both terms requires and , which are compatible only when . This is an illustrative smoothness calculation under extra Sobolev and moment assumptions, not a rate theorem asserted solely from bounded third derivatives. Particular much smoother probability density functions may of course permit root- estimation.
Exchangeability of an independent identically distributed sample makes every permuted kernel have the same expectation. Averaging over permutations therefore leaves the target functional unchanged and gives a symmetric kernel. The U-statistic then averages this kernel over the unordered r-element sample subsets.
U-statistic Created 2026-10-07 Updated 2026-10-14
A U-statistic averages a symmetric function of distinct sample observations over all unordered -tuples. For independent and identically distributed observations it is an unbiased estimator of . Omitting repeated indices can remove diagonal contributions in quadratic plug-in estimators.
Variance as a U-statistic 2026-10-14
The symmetric kernel has expectation equal to the population variance for independent identically distributed observations with finite second moment. Its U-statistic reduces to the displayed unbiased sample variance, using .