Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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