Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7, p. 610 — finite limsup of E∑iWni(X)f(Xi)E\sum_i W_{ni}(X)f(X_i)E∑i​Wni​(X)f(Xi​) for every integrable fff gives a uniform CCC

Proved
StoneRegression.Criterion.proposition_7

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 such that, for every nonnegative Borel function fff on Rd\mathbb R^dRd with Ef(X)<∞Ef(X)<\inftyEf(X)<∞,

lim sup⁡n→∞E∑iWni(X)f(Xi)<∞.\limsup_{n\to\infty} E\sum_i W_{ni}(X)f(X_i) < \infty .n→∞limsup​Ei∑​Wni​(X)f(Xi​)<∞.

Then there are a positive integer n0n_0n0​ and a positive constant CCC such that, for every nonnegative Borel function fff on Rd\mathbb R^dRd,

E∑iWni(X)f(Xi)≤C Ef(X)for all n≥n0.E\sum_i W_{ni}(X)f(X_i) \le C\,Ef(X)\qquad\text{for all } n\ge n_0 .Ei∑​Wni​(X)f(Xi​)≤CEf(X)for all n≥n0​.

The constants n0n_0n0​ and CCC do not depend on fff. This uniform-boundedness statement is the step from consistency to condition (1) in the necessity half of Theorem 1.

Formalization Note. Expectations and the lim sup⁡\limsuplimsup are taken in [0,∞][0,\infty][0,∞], so "<∞<\infty<∞" is a genuine finiteness assumption. The order of quantifiers is ∃n0 ∃C ∀f ∀n≥n0\exists n_0\,\exists C\,\forall f\,\forall n\ge n_0∃n0​∃C∀f∀n≥n0​. 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 7 (Stone 1977, p. 610). If the weights are nonnegative and
`limsup_n E ∑ᵢ W_{ni}(X) f(Xᵢ) < ∞` for every nonnegative Borel `f` with `Ef(X) < ∞`, then there are a
positive integer `n₀` and a positive constant `C` such that, for every nonnegative Borel `f`,
`E ∑ᵢ W_{ni}(X) f(Xᵢ) ≤ C Ef(X)` for all `n ≥ n₀`. The `n₀` and `C` are chosen before `f`. -/
theorem proposition_7 {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ]
    (W : WeightSeq d) (hW : MeasurableWeights W) (hnn : Nonneg W)
    (hbdd : ∀ f : EuclideanSpace ℝ (Fin d) → ℝ≥0, Measurable f → ∫⁻ x, f x ∂μ < ∞ →
      limsup (fun n => ∫⁻ ω, ∑ i : Fin n,
        ENNReal.ofReal (wAt W n ω i) * (f (ω (i.val + 1)) : ℝ≥0∞) ∂(xLaw μ)) atTop < ∞) :
    ∃ n₀ : ℕ, 0 < n₀ ∧ ∃ C : ℝ≥0, 0 < C ∧
      ∀ f : EuclideanSpace ℝ (Fin d) → ℝ≥0, Measurable f → ∀ n, n₀ ≤ n →
        ∫⁻ ω, ∑ i : Fin n, ENNReal.ofReal (wAt W n ω i) * (f (ω (i.val + 1)) : ℝ≥0∞) ∂(xLaw μ) ≤
          C * ∫⁻ x, f x ∂μ := by sorry

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