Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, p. 50 — a random sequence attaining at least its expected loss

Proved
ModernOnlineLearning.LowerBounds.probabilistic_method

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

lower-boundsonline-learningp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1probability

Let Ω\OmegaΩ be a finite set of possible random sequences with probabilities p(ω)≥0p(\omega)\ge0p(ω)≥0 summing to one. If a real loss F(ω)F(\omega)F(ω) has expectation at least KKK, then some sequence with positive probability has loss at least KKK:

K≤∑ω∈Ωp(ω)F(ω)⟹∃ ω∈Ω: p(ω)>0 and F(ω)≥K.K\le\sum_{\omega\in\Omega}p(\omega)F(\omega) \quad\Longrightarrow\quad \exists\,\omega\in\Omega:\ p(\omega)>0\ \text{and}\ F(\omega)\ge K.K≤ω∈Ω∑​p(ω)F(ω)⟹∃ω∈Ω: p(ω)>0 and F(ω)≥K.

This is the finite probabilistic-method step used to turn an expected regret lower bound into a deterministic hard loss sequence.

Formalization Note The source describes general random sequences. The finite version covers the Rademacher construction used immediately afterward and has an ordinary finite expectation.

Preamble
import Mathlib
Formal statement
namespace ModernOnlineLearning.LowerBounds

/-- The first-moment existence step from §5.1, printed p. 50. For a finite
random sequence, if its mean loss is at least `K`, some sequence in the
support has loss at least `K`. -/
theorem probabilistic_method {Ω : Type*} [Fintype Ω]
    (p : Ω → ℝ) (F : Ω → ℝ) (K : ℝ)
    (hp : ∀ ω, 0 ≤ p ω) (hsum : ∑ ω, p ω = 1)
    (hmean : K ≤ ∑ ω, p ω * F ω) :
    ∃ ω, 0 < p ω ∧ K ≤ F ω := by sorry

end ModernOnlineLearning.LowerBounds
Source
Orabona, arXiv:1912.13213v10, §5.1, p. 50, display and following paragraph before Theorem 5.1
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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