Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 5, p. 609 — under (1)–(4), ∑iWni(X)f(Xi)→f(X)\sum_i W_{ni}(X)f(X_i)\to f(X)∑i​Wni​(X)f(Xi​)→f(X) in LrL^rLr

Proved
StoneRegression.Criterion.proposition_5

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

lp-convergencenonparametric-regressionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weight-functions

Let X,X1,X2,…X, X_1, X_2,\dotsX,X1​,X2​,… be i.i.d. Rd\mathbb R^dRd-valued with law μ\muμ and let {Wn}\{W_n\}{Wn​} be a sequence of Borel weights satisfying conditions (1)–(4) of Theorem 1: (1) with some C≥1C\ge1C≥1, (2) with some D≥1D\ge1D≥1, the localization condition (3), and ∑iWni(X)→1\sum_i W_{ni}(X)\to1∑i​Wni​(X)→1 in probability (4).

If r≥1r\ge1r≥1 and fff is a Borel function on Rd\mathbb R^dRd with E∣f(X)∣r<∞E|f(X)|^r<\inftyE∣f(X)∣r<∞, then ∑iWni(X)f(Xi)→f(X)\sum_i W_{ni}(X)f(X_i)\to f(X)∑i​Wni​(X)f(Xi​)→f(X) in LrL^rLr:

lim⁡n→∞E ∣∑i=1nWni(X)f(Xi)−f(X)∣r=0.\lim_{n\to\infty} E\,\Big|\sum_{i=1}^n W_{ni}(X)f(X_i) - f(X)\Big|^r = 0 .n→∞lim​E​i=1∑n​Wni​(X)f(Xi​)−f(X)​r=0.

This is the noise-free version of consistency: with f(x)=E(Y∣X=x)f(x) = E(Y\mid X=x)f(x)=E(Y∣X=x) it handles the bias part of E^n(Y∣X)−E(Y∣X)\hat E_n(Y\mid X) - E(Y\mid X)E^n​(Y∣X)−E(Y∣X) in the proof of Theorem 1.

Formalization Note. The LrL^rLr distance is a lower Lebesgue integral in [0,∞][0,\infty][0,∞], as is E∣f(X)∣rE|f(X)|^rE∣f(X)∣r. Weights are assumed jointly Borel (standing assumption).

Preamble
import Mathlib
import Definitions.Def_StoneRegression_Criterion_Setting

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal BoundedContinuousFunction
Formal statement
namespace StoneRegression.Criterion

/-- Proposition 5 (Stone 1977, p. 609). Under (1)–(4), for `r ≥ 1` and a Borel `f` with `E|f(X)|ʳ < ∞`,
`∑ᵢ W_{ni}(X) f(Xᵢ) → f(X)` in `Lʳ`, i.e. `E|∑ᵢ W_{ni}(X) f(Xᵢ) − f(X)|ʳ → 0`. -/
theorem proposition_5 {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ]
    (W : WeightSeq d) (hW : MeasurableWeights W)
    (h1 : ∃ C : ℝ≥0, 1 ≤ C ∧ Cond1 μ W C) (h2 : ∃ D : ℝ, 1 ≤ D ∧ Cond2 μ W D) (h3 : Cond3 μ W)
    (h4 : Cond4 μ W)
    (r : ℝ) (hr : 1 ≤ r) (f : EuclideanSpace ℝ (Fin d) → ℝ) (hf : Measurable f)
    (hfr : ∫⁻ x, ‖f x‖ₑ ^ r ∂μ < ∞) :
    Tendsto (fun n => ∫⁻ ω,
        ‖∑ i : Fin n, wAt W n ω i * f (ω (i.val + 1)) - f (ω 0)‖ₑ ^ r ∂(xLaw μ)) atTop (𝓝 0) := by sorry

end StoneRegression.Criterion
Source
Stone (1977), Ann. Statist. 5, Proposition 5, p. 609
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me