Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 15, p. 617 — E|L̂ₙ|ʳ I{|L̂ₙ| ≥ M} ≤ C/(p ∧ (1 − p)) · E|Y|ʳ I{|Y| ≥ M}, and the same for Ûₙ

Proved
StoneRegression.Quantile.proposition_15

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

conditional-quantilesnonparametric-regressionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1uniform-integrability

Fix n≥1n\ge1n≥1. Let WnW_nWn​ be a (jointly Borel) probability weight function satisfying condition (1) with a constant C≥1C\ge1C≥1:

E∑iWni(X)f(Xi)≤C Ef(X)for every nonnegative Borel f.E\sum_i W_{ni}(X)f(X_i)\le C\,Ef(X)\quad\text{for every nonnegative Borel } f.Ei∑​Wni​(X)f(Xi​)≤CEf(X)for every nonnegative Borel f.

Let 0<p<10<p<10<p<1, M>0M>0M>0 and r≥1r\ge1r≥1, and let YYY be any real response with (X,Y),(X1,Y1),…(X,Y),(X_1,Y_1),\dots(X,Y),(X1​,Y1​),… i.i.d. Then

E ∣L^nY(p∣X)∣r I{∣L^nY(p∣X)∣≥M}≤Cp∧(1−p) E ∣Y∣rI{∣Y∣≥M},E\,|\hat L_n^Y(p\mid X)|^r\,I_{\{|\hat L_n^Y(p\mid X)|\ge M\}}\le\frac{C}{p\wedge(1-p)}\,E\,|Y|^r I_{\{|Y|\ge M\}},E∣L^nY​(p∣X)∣rI{∣L^nY​(p∣X)∣≥M}​≤p∧(1−p)C​E∣Y∣rI{∣Y∣≥M}​,

and the same inequality holds with L^nY(p∣X)\hat L_n^Y(p\mid X)L^nY​(p∣X) replaced by U^nY(p∣X)\hat U_n^Y(p\mid X)U^nY​(p∣X).

Since the right side does not depend on nnn and tends to 000 as M→∞M\to\inftyM→∞ when E∣Y∣r<∞E|Y|^r<\inftyE∣Y∣r<∞, the proposition gives uniform integrability of ∣L^n∣r|\hat L_n|^r∣L^n​∣r and ∣U^n∣r|\hat U_n|^r∣U^n​∣r, which turns the convergence in probability of Theorem 3 into convergence in LrL^rLr.

Formalization Note. The page leaves rrr unquantified; the Lean statement takes r≥1r\ge1r≥1, the range in which Theorem 3 uses it. Condition (1) is required at the given nnn only. Expectations are [0,∞][0,\infty][0,∞]-valued lower integrals. The weight function WnW_nWn​ is assumed jointly Borel.

Preamble
import Mathlib
import Definitions.Def_StoneRegression_Criterion_Setting
import Definitions.Def_StoneRegression_Quantile_Quantiles
Formal statement
namespace StoneRegression.Quantile

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal NNReal

/-- Proposition 15, p. 617, for one `n ≥ 1`: if `Wₙ` is a (Borel) probability weight function satisfying
(1) at this `n` with constant `C ≥ 1`, then for `0 < p < 1`, `M > 0` and `r ≥ 1`,
`E|L̂ₙ(p|X)|ʳ I{|L̂ₙ(p|X)| ≥ M} ≤ C/(p ∧ (1 − p)) · E|Y|ʳ I{|Y| ≥ M}`, and the same with `Ûₙ(p|X)`.
The page leaves `r` unquantified; `r ≥ 1` is the range Theorem 3 uses. -/
theorem proposition_15 {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ]
    (W : StoneRegression.Criterion.WeightSeq d) (n : ℕ) (hn : 1 ≤ n)
    (hWn : Measurable
      (fun q : EuclideanSpace ℝ (Fin d) × (Fin n → EuclideanSpace ℝ (Fin d)) => W n q.1 q.2))
    (hPn : ∀ x xs, (∀ i, 0 ≤ W n x xs i) ∧ ∑ i, W n x xs i = 1)
    (C : ℝ≥0) (hC : 1 ≤ C)
    (h1 : ∀ f : EuclideanSpace ℝ (Fin d) → ℝ≥0, Measurable f →
      ∫⁻ ω, ∑ i : Fin n, ‖StoneRegression.Criterion.wAt W n ω i‖ₑ * (f (ω (i.val + 1)) : ℝ≥0∞) ∂(StoneRegression.Criterion.xLaw μ) ≤ C * ∫⁻ x, f x ∂μ)
    (p : ℝ) (hp0 : 0 < p) (hp1 : p < 1) (M : ℝ) (hM : 0 < M) (r : ℝ) (hr : 1 ≤ r)
    (κ : Kernel (EuclideanSpace ℝ (Fin d)) ℝ) [IsMarkovKernel κ] :
    ∫⁻ ω, ‖estLowerQ W n p ω‖ₑ ^ r * (if M ≤ |estLowerQ W n p ω| then 1 else 0) ∂(StoneRegression.Criterion.pairLaw μ κ) ≤
        ((C : ℝ≥0∞) / ENNReal.ofReal (min p (1 - p))) *
          ∫⁻ q, ‖q.2‖ₑ ^ r * (if M ≤ |q.2| then 1 else 0) ∂(μ ⊗ₘ κ) ∧
    ∫⁻ ω, ‖estUpperQ W n p ω‖ₑ ^ r * (if M ≤ |estUpperQ W n p ω| then 1 else 0) ∂(StoneRegression.Criterion.pairLaw μ κ) ≤
        ((C : ℝ≥0∞) / ENNReal.ofReal (min p (1 - p))) *
          ∫⁻ q, ‖q.2‖ₑ ^ r * (if M ≤ |q.2| then 1 else 0) ∂(μ ⊗ₘ κ) := by sorry

end StoneRegression.Quantile
Source
Stone (1977), Ann. Statist. 5, Proposition 15, p. 617 (§12)
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