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.

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.

Depends on

Used by

Dependency tree · two levels

12 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