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.
Global MISE upper bound for the KDE
Statement
Assume . Let be iid with a Borel density version . Let be Borel, , , for every , and . For every define Then In particular, gives , where means bounded by a finite constant times for all sufficiently large . This is an upper rate under the displayed hypotheses; it is not a minimax lower bound.
Facts & Assumptions
Given: , , iid observations with density version , a Borel kernel with the displayed integrability and moment conditions, and .
The Axiom of Countable Choice, written (The Axiom of Countable Choice ()).
The estimate is the finite sum , and is a selected Borel density version (Density targets and the kernel density estimator).
The estimator is jointly Borel in the sample and evaluation point (The KDE is jointly measurable in sample and evaluation point); arithmetic operations preserve measurability (Arithmetic and lattice operations preserve measurability whenever they are defined).
The convolution bias satisfies (Second-order kernel convolution has an L² bias bound).
Iid random elements are independent and identically distributed (Identical distribution and IID families).
Measurable functions preserve independence, and expectations of integrable products of independent real random variables factor (Measurable coordinatewise functions preserve independence, Expectations factor over finite products of independent random variables).
Tonelli interchanges nonnegative integrals on the product of a probability space and with Lebesgue measure; the factors are sigma-finite (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, The product measure of two sigma-finite measure spaces, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique).
For nonnegative measurable integrands, expectation under is integration against (Change of variables for expectation, Integrating against a density agrees with integrating the product).
Under , the C affine substitutions used below satisfy the nonnegative and change-of-variables formulas (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).
A nonnegative measurable function with finite integral is finite almost everywhere (A nonnegative measurable function with finite integral is finite almost everywhere).
For a square-integrable variable , (Moments, variance, and covariance on a probability space).
Expectation is linear on integrable variables (The Lebesgue integral is linear on ).
Proof
For fixed , [F2] makes Borel, and [F1] makes Borel as a function of . Arithmetic measurability in [F2] therefore makes the squared error product-measurable and nonnegative. Tonelli [F6] identifies MISE with the integral over of its expected pointwise squared error, even before finiteness has been established.
Write . By Tonelli and the substitution in [F8], Consequently, [F9] makes the summands integrable and square-integrable for almost every . For such , put and , . The nonnegative density formula [F7] applied to shows . Thus both parts have finite density integrals, and [F7] applied separately to them, followed by subtraction using [F11], gives . Signed substitution [F8] then identifies this integral with , and identical laws plus finite-sum linearity [F11] give .
At almost every from step 2.1, the variables are iid and square-integrable. Set . These are independent, integrable and square-integrable by [F5] and step 2.1; for , [F5] makes integrable and gives . Expanding the finite square in the variance definition [F10] and applying [F11] gives . Expanding one centered square using [F10]–[F11] gives . Integrating and using step 2.1 bounds the integrated variance by .
For almost every , step 2.1 identifies the bias with . The bound [F3] therefore gives
At almost every , expand . The centered term has expectation zero, so [F10]–[F11] give Integrate this nonnegative identity using step 1.1, then apply steps 3.1 and 3.2 to obtain the displayed MISE bound. For , both and equal , which proves the stated upper rate.
Depends on
- Density targets and the kernel density estimator
- The KDE is jointly measurable in sample and evaluation point
- Arithmetic and lattice operations preserve measurability whenever they are defined
- Second-order kernel convolution has an L² bias bound
- Identical distribution and IID families
- Measurable coordinatewise functions preserve independence
- Expectations factor over finite products of independent random variables
- Moments, variance, and covariance on a probability space
- Change of variables for expectation
- Integrating against a density agrees with integrating the product
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
- The Lebesgue integral is linear on $L^1(\mu)$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The product measure of two sigma-finite measure spaces
- A nonnegative measurable function with finite integral is finite almost everywhere
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
86 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 OpenCourseWare 14.385, Fall 2007, integrated MSE calculation and multivariate rate, PDF pp. 5–7 (standard reference, not scraped)
- Adrian Bowman and Ludger Evers, Nonparametric Smoothing, APTS 2013–14 course notes, §1.2.1, PDF p. 8 (standard reference, not scraped)