Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 5, p. 26 — νᵢ ∈ [0, 1] and each factor 1 − νⱼ(Lⱼ − R) is nonnegative

Proved
RiskControl.WSR.factor_nonneg

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

betting-confidence-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-controlupper-confidence-bound

Let n∈Nn \in \mathbb Nn∈N and δ∈R\delta \in \mathbb Rδ∈R, and let νi\nu_iνi​, LjL_jLj​ be the betting fractions and losses of Proposition 5 (see the definition RiskControl.WSR.Process). Then:

  1. for every sample ω∈Rn\omega \in \mathbb R^nω∈Rn and every index iii, 0≤νi≤10 \le \nu_i \le 10≤νi​≤1;
  2. for every sample with all losses L1,…,Ln∈[0,1]L_1, \dots, L_n \in [0,1]L1​,…,Ln​∈[0,1], every R∈[0,1]R \in [0,1]R∈[0,1] and every 1≤j≤n1 \le j \le n1≤j≤n,
1−νj (Lj−R)≥0.1 - \nu_j\,(L_j - R) \ge 0.1−νj​(Lj​−R)≥0.

This is the step of the proof of Proposition 5 that makes the capital process Ki(R)\mathcal K_i(R)Ki​(R) nonnegative at the true mean R=R(λ)∈[0,1]R = R(\lambda) \in [0,1]R=R(λ)∈[0,1], which Ville's inequality requires.

Formalization Note The losses lie in [0,1][0,1][0,1] by the standing assumption of §3.1 of the paper (the loss is nonnegative and bounded by one); R∈[0,1]R \in [0,1]R∈[0,1] because the true mean of [0,1][0,1][0,1]-valued losses lies there, which is the paper's "(Li(λ)−R(λ))∈[−1,1](L_i(\lambda) - R(\lambda)) \in [-1,1](Li​(λ)−R(λ))∈[−1,1]". Part 1 holds for every δ\deltaδ and every nnn.

Preamble
import Mathlib
import Definitions.Def_RiskControl_WSR_Process
Formal statement
namespace RiskControl.WSR

/-- Proof of Proposition 5, p. 26 (arXiv:2101.02703v3): `ν_i ∈ [0, 1]` for every sample and
every index, and, for losses in `[0, 1]` and `R ∈ [0, 1]`, each factor
`1 − ν_j(λ)(L_j(λ) − R)` of the capital process is nonnegative. -/
theorem factor_nonneg (n : ℕ) (δ : ℝ) :
    (∀ (ω : Fin n → ℝ) (i : ℕ), 0 ≤ nu n δ ω i ∧ nu n δ ω i ≤ 1) ∧
    (∀ ω : Fin n → ℝ, (∀ j, ω j ∈ Set.Icc (0 : ℝ) 1) →
      ∀ R ∈ Set.Icc (0 : ℝ) 1, ∀ j : ℕ, 1 ≤ j → j ≤ n →
        0 ≤ 1 - nu n δ ω j * (obs ω j - R)) := by sorry

end RiskControl.WSR
Source
Bates, Angelopoulos, Lei, Malik & Jordan, arXiv:2101.02703v3, Proof of Proposition 5, p. 26, sentence after the first display
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 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