Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Regression Estimation

1 · Prerequisites

2 · Summary

This page fixes a pointwise version of the regression function before imposing smoothness, then defines local-constant and local-polynomial estimators and pointwise squared-error risk. Its fixed interior-point bias formulas admit compact kernels with local smoothness, general noncompact kernels with explicit sufficient global bounds, and bounded rapid-tail kernels such as the Gaussian with local smoothness and a finite response second moment. These are sufficient localization conditions, not necessary conditions. The population local-linear fit and its empirical conditional response-law mean remove the design-gradient term; Nadaraya–Watson retains it. The page also proves conditional variance limits for both estimators and an unconditional Nadaraya–Watson variance expansion under the stated extra moment bounds. The local-linear result does not assert an unconditional expectation or variance: the companion counterexample has a nonsingular near-collision design with infinite positive and negative expectation parts. A separate companion calculation exhibits first-order boundary bias.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Regression target and chosen version

Definition

Assume the Axiom of Choice. Let X,Y be real random variables on a probability space, with E∣Y∣<∞, and choose a regular conditional law Q(x,dy) of Y given X=x. On D={x:∫∣y∣ Q(x,dy)<∞} define m(x)=∫y Q(x,dy), and put m(x)=0 off D. By Conditional expectation as a measurable function of the conditioning variable, m is Borel measurable and m(X) is a version of E[Y∣σ(X)]. A regression target is the resulting PX-almost-sure equivalence class; a chosen regression-function version is the particular Borel function selected by the specified conditional law.

Pointwise smoothness is an additional hypothesis on the chosen version. It is not implied by existence of conditional expectation, and statements about m(x) at a specified point use that selected version.

Source notes

Newey, “Nonparametric Regression,” PDF p. 8; Tibshirani, §1.1, PDF p. 1.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Local-linear moment matrix converges to a positive-definite limit

Statement

Let Xi be iid real random variables with density f continuous and positive at a fixed point x. Let K be finite-valued Borel, nonnegative, symmetric, with ∫K=1 and 0<μ2=∫u2K(u) du<∞. Assume compact kernel support, a globally bounded density f, or a bounded rapid-tail kernel satisfying sup⁡∣u∣≥A∣u∣3K(u)→0. For h=hn→0 with nhn→∞, set Ui=(x−Xi)/hn and Mn=1nhn∑i=1nK(Ui)(1Ui)(1,Ui). Then Mn⟶f(x)(100μ2)in probability, and P(Mn is nonsingular)→1. More generally, the proof establishes (nhn)−1∑iL(Ui)→f(x)∫L for any integrable Borel function L, if f is bounded globally or L has compact support. Boundedness or square integrability of L is unnecessary.

Facts & Assumptions

Given: The sampling, density, kernel and bandwidth hypotheses in the statement.

[F1]

IID means a common law and mutual independence. Identical distribution and IID families.

[F2]

Density integration uses f dλ. The measure with density f relative to μ.

[F3]

A square-integrable variable has variance E[(V−EV)2]. Moments, variance, and covariance on a probability space.

[F4]

Convergence in probability is convergence of each fixed-error event probability to zero. Convergence in probability.

Proof

1.1givenF1F2F3F4algebra

For the general assertion truncate L to LA=L1{∣u∣≤A, ∣L(u)∣≤A}. The expectation of (nh)−1∑iLA(Ui) is ∫LA(u)f(x−hu) du→f(x)∫LA by uniform density convergence on its fixed compact support. Its variance is at most (nh)−1∫LA(u)2f(x−hu) du=OA((nh)−1)→0. The elementary bound P(∣V−EV∣>ϵ)≤Var⁡(V)/ϵ2 follows by integrating ϵ21{∣V−EV∣>ϵ}≤(V−EV)2. Thus the truncated average converges in probability.

2.1givenF2F4step 1.1algebra

The expectation of the absolute difference between the full and truncated averages is at most C∫∣L−LA∣, using the global density bound or its bound on the shrinking image of the compact support of L. This tends to zero as A→∞. Markov's bound, obtained from ϵ1{Z>ϵ}≤Z for Z≥0, makes this difference uniformly small in probability. Also ∫LA→∫L. First choosing A large and then n large proves the general assertion.

3.1givenF2F4step 1.1step 2.1algebra

For the rapid-tail case and L(u)=ujK(u), j=0,1,2, restrict first to ∣x−Xi∣≤δ, where the density is bounded. The same truncation proof works there. The expected absolute contribution of the remaining observations is at most ϵhh2−j∫∣z−x∣>δ∣z−x∣j−3f(z) dz→0, where ϵh=sup⁡∣u∣≥δ/h∣u∣3K(u)→0. Thus the same scalar limits hold for these three moments without a global density bound.

4.1givenF4step 2.1algebrastep 3.1∎

Apply steps 1.1–3.1 to L(u)=K(u)uj for j=0,1,2, all integrable by the finite second moment. Symmetry gives ∫uK=0. The entries of Mn therefore have the displayed limits. Its determinant tends in probability to f(x)2μ2>0, since it is a polynomial in the entries. A zero determinant lies outside a fixed neighborhood of this positive limit, so its probability tends to zero.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Nadaraya–Watson estimator

Definition

Assume AC as in Regression target and chosen version. Fix a sample size n≥1, a prediction point x∈R, a bandwidth h>0, a finite-valued nonnegative Borel function K:R→[0,∞), and a fixed fallback a0∈R. For data (Xi,Yi)i=1n, put Dn,h(x)=∑i=1nK((x−Xi)/h). The Nadaraya–Watson estimator of the pointwise target m(x) is m^NW,h(x)={∑i=1nK((x−Xi)/h)YiDn,h(x),Dn,h(x)>0,a0,Dn,h(x)=0. For fixed x,h,n, this is a Borel statistic on (R2)n with its product Borel sigma-algebra: each weight, product, and finite sum is Borel; the positive-denominator set is Borel, and division is continuous there. In any statistical experiment on this sample space whose pointwise regression estimand is ψx(θ)=mθ(x), with mθ the selected version from Regression target and chosen version, it is an estimator of ψx in the sense of Statistics and estimators. The fallback is part of the definition. Kernel regularity and bandwidth assumptions used for bias or variance results are stated in those results.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Pointwise squared-error risk for regression

Definition

Assume AC as used to select the regression version. Fix a statistical experiment indexed by θ, a point x, a real regression target mθ(x), and a real-valued estimator Tx of that target, meaning a measurable statistic with target space R as in Statistics and estimators. At this point, use the squared-error loss Lx(θ,a)=(a−mθ(x))2,a∈R. Its pointwise squared-error risk is the possibly infinite quantity Rx(θ,Tx)=∫(Tx(z)−mθ(x))2 Pθ(dz)∈[0,∞]. This is the deterministic-rule specialization of the risk in Loss functions and risk: the action space is R with its Borel sigma-algebra, the action is Tx(z), and the loss section is measurable because it is continuous in a. The integral is nonnegative, so it is defined without a finite-moment assumption.

Source notes

Martin, §5.1, PDF pp. 100–102; Hoff, §§4.1–4.2, PDF pp. 7–8.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Local-polynomial estimator

Definition

Assume AC as in Regression target and chosen version. Fix n≥1, a point x∈R, bandwidth h>0, degree p∈N0, a finite-valued nonnegative Borel function K, and fallback a0∈R. Set ui=(x−Xi)/h, rp(u)=(1,u,…,up)T, let Z be the matrix whose ith row is rp(ui)T, let W=diag⁡(K(u1),…,K(un)), and put M=ZTWZ. If M is nonsingular, define β^=M−1ZTW(Y1,…,Yn)T,m^p,h(x)=β^0. If M is singular, define m^p,h(x)=a0. For fixed x,h,n,p and Borel K, this is a real statistic on (R2)n with its product Borel sigma-algebra: the matrix entries are Borel, the nonsingular-matrix set is Borel, matrix inversion is continuous there, and the fixed fallback gives the other branch. In any statistical experiment on this sample space whose pointwise regression estimand is ψx(θ)=mθ(x), with mθ the selected version from Regression target and chosen version, it estimates ψx in the sense of Statistics and estimators. The case p=1 is the local-linear estimator. No claim that M is nonsingular for a given sample is implicit in this definition.

Source notes

Newey, “Locally Linear Regression,” PDF pp. 1–4; Tibshirani, §3.1, PDF p. 6.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Pointwise risk is variance plus squared bias

Statement

Assume AC as used to select the regression target version. Fix a model parameter θ and point x. Let Tx be a real estimator of the finite target ψ=mθ(x) with Eθ[Tx2]<∞. Define its bias by bθ(x)=Eθ[Tx]−mθ(x). Its pointwise squared-error risk from Pointwise squared-error risk for regression satisfies Rx(θ,Tx)=Var⁡θ(Tx)+bθ(x)2.

Facts & Assumptions

Given: The target, estimator, finite second moment, and AC hypothesis in the statement.

[F1]

Pointwise squared-error risk is Rx(θ,Tx)=∫(Tx(z)−mθ(x))2Pθ(dz). Pointwise squared-error risk for regression.

[F2]

For square-integrable Tx, Var⁡θ(Tx)=Eθ[(Tx−EθTx)2]. Moments, variance, and covariance on a probability space.

[A1]

AC is used only through the selected real version of mθ(x) in Regression target and chosen version; the algebra below is choice-free.

Proof

technique · direct expansion
1.1givenF2A1algebra

Write Tx−mθ(x)=(Tx−EθTx)+bθ(x). Squaring and taking expectations gives Eθ[(Tx−mθ(x))2]=Eθ[(Tx−EθTx)2]+bθ(x)2, because Eθ[Tx−EθTx]=0.

2.1givenF1F2step 1.1∎

By [F1] the left side of step 1.1 is the pointwise risk, and by [F2] its first term on the right is the variance. This is the asserted identity.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Pointwise population bias of the Nadaraya–Watson smoother

Statement

Assume AC for the chosen regression version Regression target and chosen version. Let X have Lebesgue density f, with f(x)>0 at a fixed interior point x, and let f,m be C2 near x. Let K be a finite-valued Borel, nonnegative, symmetric kernel with ∫K=1, 0<μ2=∫u2K(u) du<∞ and ∫K2<∞. Assume either that K has compact support, or that f,m and their first two derivatives are bounded and continuous on R. In these first two alternatives, no continuity or boundedness of K is required. The global alternative supplies tail control for noncompact kernels; local smoothness alone does not supply it. A further localization alternative, including the Gaussian kernel, is that E[Y2]<∞, K is bounded, and lim⁡A→∞sup⁡∣u∣≥A∣u∣3K(u)=0. Under this rapid-tail alternative only the stated local smoothness of f,m is needed; no global boundedness of m or of its derivatives is assumed. For sufficiently small h>0, the population smoother corresponding to Nadaraya–Watson estimator is well defined by mh(x)=∫K(u)m(x−hu)f(x−hu) du∫K(u)f(x−hu) du, and mh(x)−m(x)=h2μ22(m′′(x)+2m′(x)f′(x)f(x))+o(h2).

Facts & Assumptions

Given: The selected regression version, density, kernel, and either localization or global domination hypotheses in the statement. Integrals are Lebesgue integrals.

[F1]

The chosen Borel regression version represents the conditional mean almost surely. Regression target and chosen version.

[F2]

The Nadaraya–Watson estimator normalizes its nonnegative weights, with a fixed zero-denominator fallback. Nadaraya–Watson estimator.

[F3]

A density f defines the law f dλ. The measure with density f relative to μ.

[F4]

For PX-almost every t, m(t)=∫y Q(t,dy), and conditional integration gives ∫∣m(t)∣f(t) dt≤E∣Y∣<∞ by the triangle inequality. Conditional expectation as a measurable function of the conditioning variable

Proof

1.1givenF1F3F4algebra

Put g=mf. For v=f,g, twice applying the fundamental theorem of calculus gives v(x−t)=v(x)−tv′(x)+t2∫01(1−s)v′′(x−st) ds. Thus v(x−hu)=v(x)−huv′(x)+12h2u2v′′(x)+h2u2rv,h(u). On compact kernel support the remainder tends uniformly to zero. Under the global alternative it is uniformly bounded and tends to zero for each fixed u: split the remainder integral at ∣u∣≤A, use uniform continuity near x on that fixed set, and bound the remaining part by C∫∣u∣>Au2K(u) du→0 as A→∞. In the rapid-tail alternative [F4] gives ∫∣g∣<∞. Put ϵh=sup⁡∣u∣≥δ/h∣u∣3K(u)→0. For v=f,mf, ∫∣v∣<∞ and h−1∫∣z−x∣>δK((x−z)/h)∣v(z)∣ dz≤ϵhh2δ−3∫∣v∣=o(h2). On ∣z−x∣≤δ use the local Taylor remainder; its normalized integral is bounded by μ2 times the modulus of continuity of v′′ at x. The omitted constant, linear and quadratic Taylor tails are o(h2) because ∫∣u∣>δ/hu2K→0. First let h→0, then δ→0. In every alternative the integrated remainder is o(h2). Symmetry and the finite second moment give ∫uK(u) du=0, so ∫K(u)v(x−hu) du=v(x)+12h2μ2v′′(x)+o(h2). All integrals are finite by localization or the global bounds.

2.1givenF2step 1.1algebra∎

Apply step 1.1 to numerator g and denominator f. The latter tends to f(x)>0. Taking their quotient and subtracting m(x) gives 12h2μ2{(mf)′′/f−mf′′/f}(x)+o(h2)=12h2μ2(m′′+2m′f′/f)(x)+o(h2), as asserted.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Pointwise population bias of local-linear regression

Statement

Assume AC for the chosen regression version Regression target and chosen version. Let X have density f, with f(x)>0 at a fixed interior point x, and let f,m be C2 near x. Let K be a finite-valued Borel, nonnegative symmetric kernel with ∫K=1, 0<μ2=∫u2K(u) du<∞ and ∫K2<∞. Assume either compact kernel support, or that f,m and their first two derivatives are bounded and continuous on R. A further localization alternative, including the Gaussian kernel, is that E[Y2]<∞, K is bounded, and lim⁡A→∞sup⁡∣u∣≥A∣u∣3K(u)=0. Under this rapid-tail alternative only the stated local smoothness of f,m is needed; no global boundedness of m or of its derivatives is assumed. Set Sj(h)=∫K(u)ujf(x−hu) du,Tj(h)=∫K(u)ujf(x−hu)m(x−hu) du. For sufficiently small h, Dh=S0S2−S12>0 and the population local-linear intercept, in the coordinates of Local-polynomial estimator, is mLL,h(x)=S2T0−S1T1Dh. Then mLL,h(x)−m(x)=h2μ22m′′(x)+o(h2). This requires no fourth kernel moment.

Facts & Assumptions

Given: The density, selected version, kernel moments and localization or global domination hypotheses in the statement.

[F1]

The local-polynomial fit returns the intercept of the weighted normal equations on a nonsingular design. Local-polynomial estimator.

[F2]

The selected regression function is a Borel conditional-mean version. Regression target and chosen version.

[F3]

A density supplies its integration law f dλ. The measure with density f relative to μ.

[F4]

For PX-almost every t, m(t)=∫y Q(t,dy), and conditional integration gives ∫∣m(t)∣f(t) dt≤E∣Y∣<∞ by the triangle inequality. Conditional expectation as a measurable function of the conditioning variable

Proof

1.1givenF2F3F4algebra

Write rh(u)=m(x−hu)−m(x)+hum′(x). Taylor's integral formula bounds ∣rh(u)∣≤Ch2u2 and gives rh(u)/h2→12m′′(x)u2 pointwise. It also gives ∣rh(u)∣≤Ch∣u∣ and rh(u)/(h∣u∣)→0 for each nonzero u. These bounds hold on compact kernel support for small h, or globally under the alternative assumptions. With Rj=∫K(u)ujf(x−hu)rh(u) du, splitting at a fixed ∣u∣≤A and controlling the tails by ∫∣u∣>Au2K(u) du proves R0=12h2m′′(x)f(x)μ2+o(h2) and R1=o(h). The same split yields S0→f(x), S2→f(x)μ2; symmetry and the first-order expansion of f give S1=−hf′(x)μ2+o(h)=O(h). In the rapid-tail alternative [F4] gives ∫∣m∣f<∞. Write z=x−hu and split at ∣z−x∣=δ. The far parts of S0,S1,S2 are respectively o(h2),o(h),o(1), since K((x−z)/h)≤ϵhh3/∣x−z∣3 and ∫f=1. The far parts of R0,R1 are o(h2),o(h): expand r=m(z)−m(x)−m′(x)(z−x) and use ∫∣m∣f<∞ with ∣z−x∣≥δ. On the near region the preceding local bounds and the integrable u2K apply; letting δ→0 after h→0 gives the same remainder limits. These estimates also make every stated integral finite.

2.1givenF1step 1.1algebra∎

The determinant tends to f(x)2μ2>0. Since Tj=m(x)Sj−hm′(x)Sj+1+Rj for j=0,1, the affine terms in the intercept cancel exactly and mLL,h(x)−m(x)=(S2R0−S1R1)/Dh. Step 1.1 makes S1R1=o(h2) and gives the asserted coefficient after division by the positive limiting determinant.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Conditional-on-design bias of the empirical local-linear estimator

Statement

Assume AC for the chosen regression version. Let Xi be iid with density f, with f(x)>0 at a fixed interior point x, and let f,m be C2 near x. Let K be finite-valued Borel, nonnegative and symmetric, with ∫K=1, 0<μ2=∫u2K<∞ and ∫(1+u2)K(u)2 du<∞. Assume either compact kernel support, or that f,m and their first two derivatives are bounded and continuous globally. A further localization alternative, including the Gaussian kernel, is that E[Y2]<∞, K is bounded, and lim⁡A→∞sup⁡∣u∣≥A∣u∣3K(u)=0. Under this rapid-tail alternative only the stated local smoothness of f,m is needed; no global boundedness of m or of its derivatives is assumed. Let hn→0 with nhn3→∞. For almost every realized design, integrate the degree-one fit of Local-polynomial estimator against the independent response laws ∏iQ(Xi,dyi); call the resulting finite response-law mean bn(x), with the same fixed fallback on singular designs. Then bn(x)−m(x)=hn2μ22m′′(x)+oP(hn2). Here Zn=oP(hn2) means Zn/hn2→0 in probability. This is a conditional response-law mean statement; it neither assumes nor asserts that the estimator has an unconditional Lebesgue expectation.

Facts & Assumptions

Given: The selected conditional response laws and the sampling, smoothness, kernel, tail control, bandwidth and fallback hypotheses in the statement.

[F1]

A nonsingular local-polynomial fit solves the weighted normal equations. Local-polynomial estimator.

[F2]

The normalized local-linear moment matrix converges in probability to f(x)diag⁡(1,μ2). Its scalar truncation extension for an arbitrary integrable Borel function L requires globally bounded f or compact support of L; under the rapid-tail alternative, its localization argument establishes the three matrix moments L(u)=ujK(u), j=0,1,2. Local-linear moment matrix converges to a positive-definite limit.

[F3]

The selected Borel function gives the mean under Q(t,dy) for almost every predictor. Regression target and chosen version.

[F4]

Convergence in probability is convergence of the fixed-error event probabilities to zero. Convergence in probability.

[F5]

For PX-almost every t, m(t)=∫y Q(t,dy), and conditional integration gives ∫∣m(t)∣f(t) dt≤E∣Y∣<∞ by the triangle inequality. Conditional expectation as a measurable function of the conditioning variable

Proof

1.1givenF2F4algebra

Put h=hn, Ui=(x−Xi)/h, Sj=(nh)−1∑iK(Ui)Uij and rh(u)=m(x−hu)−m(x)+hum′(x). Then S0→f(x), S2→f(x)μ2 by [F2]. Symmetry and the first-order density expansion give ES1=−hf′(x)μ2+o(h); the tail is controlled by u2K under the global alternative. Also Var⁡(S1)≤C(nh)−1∫u2K2, using localization or the global density bound. In the rapid-tail alternative its local part has this bound, and the far contribution to Var⁡(S1) is at most Ch2n−1∫∣z−x∣>δf(z)∣z−x∣−4 dz, hence no larger than O((nh)−1). Since nh3→∞, (S1−ES1)/h→0 in probability by the variance bound, so S1=OP(h).

2.1givenF2F4F5step 1.1algebra

Set Rj=(nh)−1∑iK(Ui)Uijrh(Ui). Taylor's integral formula gives ∣rh(u)∣≤Ch2u2 and rh(u)/h2→12m′′(x)u2. The truncation proof of [F2] applies to this varying integrand: on any fixed set where ∣u∣ and K(u) are bounded it converges uniformly, its average has variance OA((nh)−1), and the absolute tail expectation is at most C∫tailu2K. Hence R0/h2→12m′′(x)f(x)μ2 in probability. Furthermore ∣rh(u)∣≤Ch∣u∣ and rh(u)/(h∣u∣)→0 pointwise. Splitting the integral as before gives E∣R1∣/h≤∫K(u)∣u∣∣rh(u)∣f(x−hu)/h du→0. Markov's bound yields R1=oP(h). Under the rapid-tail alternative [F5] gives ∫∣m∣f<∞; first apply these arguments on ∣Xi−x∣≤δ. For the far part put ϵh=sup⁡∣u∣≥δ/h∣u∣3K(u)→0 and expand r=m(z)−m(x)−m′(x)(z−x). Its expected absolute contributions to R0/h2 and R1/h are bounded by Cδϵh∫(1+∣m∣)f→0. The same tail estimate gives the stated expectation expansion for S1. Thus all limits hold without global smoothness.

3.1givenF1F2F3F4step 1.1step 2.1algebra∎

On a nonsingular design, [F1] and [F3] give bn−m(x)=(S2R0−S1R1)/(S0S2−S12), since the constant and slope terms cancel exactly in the intercept. Steps 1.1–2.1 give S1R1=oP(h2), and the denominator tends to f(x)2μ2>0. Division gives the claimed coefficient. The singular-design event has probability tending to zero by [F2]; even after scaling by h−2 the probability of any nonzero fallback contribution is at most that event probability, so it does not change convergence in probability. This argument integrates the response law separately for each design and never interchanges an undefined unconditional signed expectation.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Conditional asymptotic variance of Nadaraya–Watson and local-linear estimators

Statement

Assume AC for the chosen regression version. Let Xi be independent and identically distributed with density f continuous and positive at an interior point x. For the chosen conditional law Q(t,dy) in Regression target and chosen version, set σ2(t)=∫(y−m(t))2Q(t,dy) where finite. Conditional on the predictor vector, assume the responses are independent, have means m(Xi), and have variances σ2(Xi), where σ2 is finite and continuous at x. Let K be finite-valued Borel, nonnegative, symmetric, with ∫K=1, 0<μ2=∫u2K(u) du<∞ and R(K)=∫K2<∞. Assume compact kernel support, globally bounded f,σ2, or the rapid-tail alternative: EY2<∞, bounded K, and sup⁡∣u∣≥A∣u∣3K(u)→0. In this last alternative the stated local continuity is sufficient. For the local-linear conclusion also assume ∫u2K(u)2 du<∞; this extra squared moment is automatic for compactly supported kernels. The Nadaraya–Watson conclusion requires only R(K)<∞. For hn→0 with nhn→∞, use the fixed fallbacks in Nadaraya–Watson estimator and Local-polynomial estimator. Then, with variance taken conditionally on X1,…,Xn, nhnVar⁡(m^NW,hn(x)∣X1,…,Xn)⟶R(K)σ2(x)f(x)in probability, and the same limit holds with m^NW,hn(x) replaced by the degree-one local-linear estimator. This is a conditional-variance statement for both estimators. If additionally m is continuous at x and bounded globally (only bounded near x is required for compact K), or if the rapid-tail alternative holds and m is continuous at x, with nhn3→∞ additionally in this rapid-tail unconditional clause, then the Nadaraya–Watson estimator is square-integrable for large n and Var⁡(m^NW,hn(x))=R(K)σ2(x)nhnf(x)+o((nhn)−1). No unconditional local-linear variance is asserted: near-singular designs can make even its finite-sample expectation undefined.

Facts & Assumptions

Given: The conditional sampling, density, kernel, tail control, bandwidth, and fallback hypotheses in the statement.

[F1]

The Nadaraya–Watson estimate is a normalized nonnegative weighted average when its denominator is positive. Nadaraya–Watson estimator.

[F2]

The local-polynomial estimate is the intercept from weighted least squares when the moment matrix is nonsingular, with a fixed fallback otherwise. Local-polynomial estimator.

[F3]

The normalized degree-one moment matrix converges to f(x)diag⁡(1,μ2), and its singularity probability tends to zero. Local-linear moment matrix converges to a positive-definite limit.

[F4]

Variance is the expectation of squared deviation from the mean for a square-integrable variable. Moments, variance, and covariance on a probability space.

[F5]

Convergence in probability has its usual event-probability definition. Convergence in probability.

[F6]

Independent and identically distributed variables have a common law and are mutually independent. Identical distribution and IID families.

[F7]

In the rapid-tail alternative, conditional integration gives ∫ ⁣∫y2Q(t,dy)PX(dt)=E[Y2]. For PX-almost every t, m(t)2≤∫y2Q(t,dy) and σ2(t)≤∫y2Q(t,dy), so ∫m2f≤E[Y2] and ∫σ2f≤E[Y2]. Also ∫∣m∣f≤E∣Y∣. Conditional expectation as a measurable function of the conditioning variable

[A1]

AC is inherited through the chosen regression version; conditional response independence is stated explicitly so every conditional covariance used below is zero.

Proof

technique · weighted moment limits and conditional variance formulas
1.1givenF3F5F6F7A1algebra

By [F3], Mn=(nh)−1∑iK(Ui)(1,Ui)T(1,Ui)→f(x)diag⁡(1,μ2) in probability. Put Vn=(nh)−1∑iK(Ui)2σ2(Xi)(1,Ui)T(1,Ui). The scalar generalization proved in [F3] applies also to a continuous multiplier σ2(x−hu): on fixed truncated support this multiplier converges uniformly to σ2(x) and is bounded, and the tail expectation is bounded by C∫tail∣L∣. Thus, for L=K2 the (0,0) entry tends to f(x)σ2(x)R(K). In the rapid-tail alternative, local truncation remains valid. For j=0,1,2 the expected absolute far contribution to Vn,j is bounded by Ch5−j∫∣z−x∣>δ∣z−x∣j−6σ2(z)f(z) dz=o(1), since [F7] gives ∫σ2f≤EY2. Also ∫(1+u2)K2<∞ follows from boundedness and the rapid tail. For the local-linear conclusion, ∫(1+u2)K2<∞ permits L=K2uj, j=0,1,2, by the same truncation argument. All entries then converge to f(x)σ2(x)∫K2uj+k; symmetry makes the off-diagonal limit zero. Terms with K(Ui)=0 are interpreted as zero. Every active response-law variance is finite almost surely; these are variances under the specified conditional response laws, without an assumption of unconditional square integrability.

2.1givenF1F3F4step 1.1algebra

On the event ∑iK(Ui)>0, [F1], conditional response independence, and [F4] give Var⁡(m^NW,hn(x)∣X1:n)=∑iK(Ui)2σ2(Xi)(∑iK(Ui))2. Writing Mn,00=(nhn)−1∑iK(Ui) and Vn,00=(nhn)−1∑iK(Ui)2σ2(Xi) makes the scaled variance Vn,00/Mn,002, which converges to f(x)σ2(x)R(K)/f(x)2. The zero-denominator event has probability tending to zero by [F3]'s (0,0) entry, so the same convergence holds with the fallback.

2.2givenF2F3F4F5step 1.1algebra

On a nonsingular local-linear design matrix, weighted least squares gives conditional variance (nhn)−1e0TMn−1VnMn−1e0, where e0=(1,0)T. The limit matrix is diagonal with entries f(x) and f(x)μ2, so its inverse has first diagonal entry 1/f(x); the (0,0) limit of Vn is f(x)σ2(x)R(K). Matrix inversion is continuous at this invertible limit, because its entries are quotients of entries of the adjugate by the nonzero determinant. Thus the scaled conditional variance converges to R(K)σ2(x)/f(x). By [F3] the singular-design event has probability tending to zero, and the fallback does not change convergence in probability.

3.1givenF1F4F6step 1.1step 2.1algebra

For the extra Nadaraya–Watson clause, choose A,κ>0 with J={∣u∣≤A,K(u)≥κ} of positive measure, possible since ∫K=1. Its predictor count is binomial with success probability ph≍h. On Gn={N≥nph/2}, Tn=n−1∑iK(Ui)≥c1h, whereas Markov's bound applied to e−N gives P(Gnc)≤exp⁡(−c2nh). The truncation argument of step 1.1 also proves Vn,00→f(x)σ2(x)R(K) in L1: the bounded truncated average converges in L2, while the expected absolute tail is uniformly small. On Gn, (Tn/h)−2 is bounded and converges in probability to f(x)−2. It follows that the expectation of the scaled conditional variance on Gn has the stated limit: separate Vn,00 into its constant limit and an L1 error, and use bounded convergence in probability for the reciprocal factor. On Gnc, the conditional variance is at most the active-region bound on σ2, since the weights are nonnegative and sum to one, or the fallback is deterministic. Hence its scaled expectation is O(nhe−c2nh)→0 in those alternatives. Under rapid tails, the conditional variance is at most ∑iσ2(Xi); the count among the other n−1 observations is independent of Xi and is below nph/2 on Gnc. Its binomial lower-tail bound gives E[σ2(Xi);Gnc]≤EY2e−c3nh. Thus the contribution to the expected scaled conditional variance is at most n2hEY2e−c3nh. Under the stated nh3→∞ condition, nh≥n2/3 eventually, so this polynomial factor times the exponential tends to zero.

4.1givenF1F4F6F7step 3.1algebra∎

Let An be the response-law mean of the Nadaraya–Watson fit, including its fallback, and let mh=∫Kmf/∫Kf. The kernel integrals and localization or global bounds imply mh→m(x). Put Zi=K(Ui) and Rn=n−1∑iZi(m(Xi)−mh). Then ERn=0 and ERn2≤n−1E[Z12(m(X1)−mh)2]=o(h/n): after change of variables, continuity at x handles a fixed compact u-set and the integrable K2 tail is dominated by bounded f,m. On Gn, An−mh=Rn/Tn, so its expected square is o((nh)−1). On Gnc, An and mh are bounded in the compact/global alternatives. Under rapid tails, [F7] gives ∫m2f<∞; the far part of the second-moment integral is O(h6)∫m2f=o(h), and the leave-one-out binomial argument in step 3.1 gives E[An2;Gnc]≤nEY2e−c4nh+a02P(Gnc). Its expected squared bad-event contribution is therefore negligible in all stated cases, and Var⁡(An)≤E(An−mh)2=o((nh)−1). Bounded active-region means and variances, or the bound m^2≤∑iYi2+a02 under rapid tails, make the Nadaraya–Watson fit square-integrable. Expanding its centered square and integrating first under the response laws gives total variance equal to the expected conditional variance plus Var⁡(An). Step 3.1 therefore proves the unconditional Nadaraya–Watson expansion.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite-sample mean bias of the Nadaraya–Watson estimator

Statement

Assume AC for the chosen regression version. Let Xi be iid with density f, and, conditional on the predictors, let the responses be independent with the selected conditional laws Q(Xi,dy), means m(Xi) and variances σ2(Xi). At a fixed interior point x, suppose f(x)>0, f,m are C2 near x, and σ2 is finite and continuous at x. Let K be finite-valued Borel, nonnegative, symmetric, positive on some neighborhood of zero, with ∫K=1, 0<μ2=∫u2K<∞ and R(K)=∫K2<∞. Assume either compact kernel support, or that f,m and their first two derivatives are bounded and continuous globally and σ2 is finite and bounded globally. A further localization alternative, including the Gaussian kernel, is that E[Y2]<∞, K is bounded, and lim⁡A→∞sup⁡∣u∣≥A∣u∣3K(u)=0. Under this rapid-tail alternative only the stated local smoothness of f,m is needed; no global boundedness of m or of its derivatives is assumed. For hn→0 with nhn3→∞, and any fixed finite fallback, the estimator in Nadaraya–Watson estimator is integrable for all sufficiently large n and E[m^NW,hn(x)]−m(x)=hn2μ22(m′′(x)+2m′(x)f′(x)f(x))+o(hn2). The compact/global alternatives require no boundedness or continuity of K.

Facts & Assumptions

Given: The explicit sampling, version, kernel, localization or global bounds, bandwidth, and fallback assumptions in the statement.

[F1]

The chosen version represents the response mean. Regression target and chosen version.

[F2]

The estimator is a normalized nonnegative weighted average or the fixed fallback. Nadaraya–Watson estimator.

[F3]

The population bias expansion holds under precisely these smoothness and localization alternatives. Pointwise population bias of the Nadaraya–Watson smoother.

[F4]

IID provides independence and a common law. Identical distribution and IID families.

[F5]

Density integration uses f dλ. The measure with density f relative to μ.

[F6]

Under the rapid-tail alternative, conditional integration gives ∫ ⁣∫y2Q(t,dy)PX(dt)=E[Y2]. Thus ∫m2f≤E[Y2] by conditional Cauchy–Schwarz and ∫∣m∣f≤E∣Y∣. Conditional expectation as a measurable function of the conditioning variable

Proof

1.1givenF1F2F3F4F5F6algebra

Write h=hn, Zi=K((x−Xi)/h), Bi=Zi(m(Xi)−m(x)), T=n−1∑iZi, Q=n−1∑iBi, a=EZ1, and b=EB1. In the compact/global alternatives, m and σ2 are bounded on the active kernel region for small h; thus E[∣Yi∣∣Xi]≤∣m(Xi)∣+σ2(Xi) is uniformly bounded there. The weighted response average has integrable absolute value, since it is bounded by ∑i∣Yi∣1{Zi>0}. Conditioning on the predictors gives mean bias E[Q/T;T>0]+(a0−m(x))P(T=0). Change of variables gives a≍h, and [F3] gives c=b/a=mh(x)−m(x)=O(h2). Bounded m on the active region yields ∣Bi∣≤CZi, EZi2=O(h) and E(Bi−cZi)2=O(h), by R(K)<∞ and the appropriate density bound. Under the rapid-tail alternative, [F6] gives ∫m2f<∞ and E∣Y∣<∞, so integrability follows from the latter. The bounds EZi2=O(h) and E(Bi−cZi)2=O(h) still hold: inside a fixed smooth neighborhood m,f are bounded; outside it K((x−z)/h)2≤Ch6/∣x−z∣6 and ∫m2f≤EY2<∞. For R=Q−cT, independence gives ER=0, ER2=O(h/n) and Var⁡(T)=O(h/n).

2.1givenF4step 1.1algebra

Positivity near zero implies there are A,κ>0 and a Borel set J⊂[−A,A] of positive measure on which K≥κ: the positive neighborhood is the countable union of its level sets {K≥1/k}. Hence ph=P((x−Xi)/h∈J)≍h. The count N is binomial. On G={N≥nph/2}, T≥c1h. With γ=1−e−1−1/2>0, Markov's bound applied to e−N gives P(Gc)≤enph/2(1−ph+phe−1)n≤e−γnph≤e−c2nh. In particular T=0 is contained in Gc.

3.1givenF3F6step 1.1step 2.1algebra∎

On G, R/T=R/a−R(T−a)/(aT). Since ER=0, Cauchy–Schwarz bounds ∣E[R/a;G]∣ by a−1(ER2)1/2P(Gc)1/2. The second term has absolute expectation at most Ch−2(ER2)1/2Var⁡(T)1/2=O((nh)−1). On Gc∩{T>0}, ∣R/T∣≤C in the compact/global alternatives. In the rapid-tail alternative [F6] makes m square-integrable, and the squared response-law mean is at most ∑im(Xi)2+a02. For each i, the event Gc forces the count among the other n−1 observations below nph/2; independence and the same binomial bound give E[m(Xi)2;Gc]≤EY2e−c3nh. Thus Cauchy–Schwarz bounds its first-moment bad-event contribution by O(ne−c4nh). The fallback and the omitted cP(T=0) also contribute O(P(Gc)). Consequently Em^−m(x)=c+O((nh)−1)+O((1+n+(nh)−1/2)e−c5nh). Here (nh)−1=o(h2) by nh3→∞, and nh≥h−2 and nh≥n2/3 eventually make the exponential term o(h2). Substituting [F3] proves the claim.

5 · Examples, counterexamples and false statements

None yet.

Sources