Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources