Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2, p. 608 — liminf/limsup bounds on E∑iWni(X)f(Xi)E\sum_i W_{ni}(X)f(X_i)E∑i​Wni​(X)f(Xi​) for nonnegative weights

Proved
StoneRegression.Criterion.proposition_2

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

nonparametric-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 nonnegative Borel weights satisfying conditions (1)–(3) of Theorem 1. Suppose that there are sequences {Mn}\{M_n\}{Mn​} and {Nn}\{N_n\}{Nn​} of nonnegative constants such that

lim⁡n→∞P(Mn≤∑iWni(X)≤Nn)=1.\lim_{n\to\infty} P\Big(M_n\le \sum_i W_{ni}(X)\le N_n\Big) = 1 .n→∞lim​P(Mn​≤i∑​Wni​(X)≤Nn​)=1.

Let fff be a nonnegative Borel function on Rd\mathbb R^dRd with Ef(X)<∞Ef(X)<\inftyEf(X)<∞. Then

lim inf⁡nE∑iWni(X)f(Xi) ≥ (lim inf⁡nMn) Ef(X)\liminf_{n} E\sum_i W_{ni}(X)f(X_i) \ \ge\ \big(\liminf_n M_n\big)\,Ef(X)nliminf​Ei∑​Wni​(X)f(Xi​) ≥ (nliminf​Mn​)Ef(X)

and

lim sup⁡nE∑iWni(X)f(Xi) ≤ (lim sup⁡nNn) Ef(X).\limsup_{n} E\sum_i W_{ni}(X)f(X_i) \ \le\ \big(\limsup_n N_n\big)\,Ef(X).nlimsup​Ei∑​Wni​(X)f(Xi​) ≤ (nlimsup​Nn​)Ef(X).

The proposition controls the first moments of weighted sums by the total mass of the weights; Proposition 3 applies it to the squared weights in the r=2r=2r=2 step of Theorem 1.

Formalization Note. All expectations, limits inferior and superior are taken in [0,∞][0,\infty][0,∞] (a lim sup⁡\limsuplimsup of the NnN_nNn​ may be +∞+\infty+∞), with the convention 0⋅∞=00\cdot\infty = 00⋅∞=0 of [0,∞][0,\infty][0,∞]; with Ef(X)=0Ef(X) = 0Ef(X)=0 both sides of the upper bound vanish. 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 2 (Stone 1977, p. 608). Nonnegative weights satisfying (1)–(3), constants `Mₙ, Nₙ ≥ 0` with
`P(Mₙ ≤ ∑ᵢ W_{ni}(X) ≤ Nₙ) → 1`, and a nonnegative Borel `f` with `Ef(X) < ∞`. Then
`liminf E ∑ᵢ W_{ni}(X) f(Xᵢ) ≥ (liminf Mₙ) Ef(X)` and `limsup E ∑ᵢ W_{ni}(X) f(Xᵢ) ≤ (limsup Nₙ) Ef(X)`,
all in `ℝ≥0∞` (the limits inferior and superior may be `+∞`). -/
theorem proposition_2 {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ]
    (W : WeightSeq d) (hW : MeasurableWeights W) (hnn : Nonneg W)
    (h1 : ∃ C : ℝ≥0, 1 ≤ C ∧ Cond1 μ W C) (h2 : ∃ D : ℝ, 1 ≤ D ∧ Cond2 μ W D) (h3 : Cond3 μ W)
    (M N : ℕ → ℝ≥0)
    (hMN : Tendsto (fun n => xLaw μ {ω | (M n : ℝ) ≤ ∑ i : Fin n, wAt W n ω i ∧
        ∑ i : Fin n, wAt W n ω i ≤ (N n : ℝ)}) atTop (𝓝 1))
    (f : EuclideanSpace ℝ (Fin d) → ℝ≥0) (hf : Measurable f) (hfi : ∫⁻ x, f x ∂μ < ∞) :
    liminf (fun n => (M n : ℝ≥0∞)) atTop * ∫⁻ x, f x ∂μ ≤
        liminf (fun n => ∫⁻ ω, ∑ i : Fin n,
          ENNReal.ofReal (wAt W n ω i) * (f (ω (i.val + 1)) : ℝ≥0∞) ∂(xLaw μ)) atTop ∧
      limsup (fun n => ∫⁻ ω, ∑ i : Fin n,
          ENNReal.ofReal (wAt W n ω i) * (f (ω (i.val + 1)) : ℝ≥0∞) ∂(xLaw μ)) atTop ≤
        limsup (fun n => (N n : ℝ≥0∞)) atTop * ∫⁻ x, f x ∂μ := by sorry

end StoneRegression.Criterion
Source
Stone (1977), Ann. Statist. 5, Proposition 2, p. 608; proof p. 608
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