Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 14, p. 616 — E|L(p|X)|ʳ and E|U(p|X)|ʳ are at most E|Y|ʳ/(p ∧ (1 − p))

Proved
StoneRegression.Quantile.proposition_14

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

conditional-quantilesmoment-boundsnonparametric-regressionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let 0<p<10<p<10<p<1 and r≥1r\ge1r≥1, let XXX have law μ\muμ on Rd\mathbb R^dRd and let YYY be real with conditional law κ\kappaκ given XXX. Then the lower and upper pppth conditional quantiles satisfy

E∣LY(p∣X)∣r≤E∣Y∣rp∧(1−p)andE∣UY(p∣X)∣r≤E∣Y∣rp∧(1−p),E|L^Y(p\mid X)|^r\le\frac{E|Y|^r}{p\wedge(1-p)}\qquad\text{and}\qquad E|U^Y(p\mid X)|^r\le\frac{E|Y|^r}{p\wedge(1-p)},E∣LY(p∣X)∣r≤p∧(1−p)E∣Y∣r​andE∣UY(p∣X)∣r≤p∧(1−p)E∣Y∣r​,

where p∧(1−p)=min⁡(p,1−p)p\wedge(1-p)=\min(p,1-p)p∧(1−p)=min(p,1−p).

The bound shows that the conditional quantiles inherit the rrrth moment of YYY. It is the integrability input for the LrL^rLr part of Theorem 3.

Formalization Note. The page states the proposition for r>1r>1r>1; the proof of Theorem 3 applies it for every r≥1r\ge1r≥1, and the page's argument does not use r>1r>1r>1. The Lean statement takes r≥1r\ge1r≥1, the range the paper uses. Expectations are [0,∞][0,\infty][0,∞]-valued lower integrals, so the inequality is meaningful (and true) also when E∣Y∣r=∞E|Y|^r=\inftyE∣Y∣r=∞.

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 14, p. 616 (range of `r` corrected from the printed `r > 1` to `r ≥ 1`, the range the
proof of Theorem 3 uses): `E|L(p|X)|ʳ ≤ E|Y|ʳ / (p ∧ (1 − p))` and the same for `U(p|X)`, with all
expectations as `ℝ≥0∞`-valued lower integrals (both sides may be `∞`). -/
theorem proposition_14 {d : ℕ} (μ : Measure (EuclideanSpace ℝ (Fin d))) [IsProbabilityMeasure μ]
    (κ : Kernel (EuclideanSpace ℝ (Fin d)) ℝ) [IsMarkovKernel κ]
    (p : ℝ) (hp0 : 0 < p) (hp1 : p < 1) (r : ℝ) (hr : 1 ≤ r) :
    ∫⁻ x, ‖lowerQ κ p x‖ₑ ^ r ∂μ ≤
        (∫⁻ q, ‖q.2‖ₑ ^ r ∂(μ ⊗ₘ κ)) / ENNReal.ofReal (min p (1 - p)) ∧
    ∫⁻ x, ‖upperQ κ p x‖ₑ ^ r ∂μ ≤
        (∫⁻ q, ‖q.2‖ₑ ^ r ∂(μ ⊗ₘ κ)) / ENNReal.ofReal (min p (1 - p)) := by sorry

end StoneRegression.Quantile
Source
Stone (1977), Ann. Statist. 5, Proposition 14, p. 616 (§12); printed hypothesis r > 1 widened to r ≥ 1 as used in the proof of Theorem 3, p. 617
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