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 be iid with density , with at a fixed interior point , and let be near . Let be finite-valued Borel, nonnegative and symmetric, with , and . Assume either compact kernel support, or that and their first two derivatives are bounded and continuous globally. A further localization alternative, including the Gaussian kernel, is that , is bounded, and Under this rapid-tail alternative only the stated local smoothness of is needed; no global boundedness of or of its derivatives is assumed. Let with . For almost every realized design, integrate the degree-one fit of Local-polynomial estimator against the independent response laws ; call the resulting finite response-law mean , with the same fixed fallback on singular designs. Then Here means 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.
A nonsingular local-polynomial fit solves the weighted normal equations. Local-polynomial estimator.
The normalized local-linear moment matrix converges in probability to . Its scalar truncation extension for an arbitrary integrable Borel function requires globally bounded or compact support of ; under the rapid-tail alternative, its localization argument establishes the three matrix moments , . Local-linear moment matrix converges to a positive-definite limit.
The selected Borel function gives the mean under for almost every predictor. Regression target and chosen version.
Convergence in probability is convergence of the fixed-error event probabilities to zero. Convergence in probability.
For -almost every , , and conditional integration gives by the triangle inequality. Conditional expectation as a measurable function of the conditioning variable
Proof
Put , , and . Then , by [F2]. Symmetry and the first-order density expansion give ; the tail is controlled by under the global alternative. Also , using localization or the global density bound. In the rapid-tail alternative its local part has this bound, and the far contribution to is at most , hence no larger than . Since , in probability by the variance bound, so .
Set . Taylor's integral formula gives and . The truncation proof of [F2] applies to this varying integrand: on any fixed set where and are bounded it converges uniformly, its average has variance , and the absolute tail expectation is at most . Hence in probability. Furthermore and pointwise. Splitting the integral as before gives . Markov's bound yields . Under the rapid-tail alternative [F5] gives ; first apply these arguments on . For the far part put and expand . Its expected absolute contributions to and are bounded by . The same tail estimate gives the stated expectation expansion for . Thus all limits hold without global smoothness.
On a nonsingular design, [F1] and [F3] give , since the constant and slope terms cancel exactly in the intercept. Steps 1.1–2.1 give , and the denominator tends to . Division gives the claimed coefficient. The singular-design event has probability tending to zero by [F2]; even after scaling by 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
- The Axiom of Choice
- Local-polynomial estimator
- The measure with density $f$ relative to $\mu$
- Identical distribution and IID families
- Convergence in probability
- Local-linear moment matrix converges to a positive-definite limit
- Regression target and chosen version
- Conditional expectation as a measurable function of the conditioning variable
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
- Whitney K. Newey, Nonparametric and Semiparametric Estimation, MIT course notes (standard reference, not scraped)
- Ryan Tibshirani, Nonparametric Regression: Nearest Neighbors and Kernels (standard reference, not scraped)