Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2 — whole-sequence WM weight bound

Proved
WeightedMajority.Basic.weight_potential

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

mistake-boundonline-learningp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1weighted-majority

Run WM with factor 0≤β<10\le\beta<10≤β<1 and strictly positive initial weights on any finite binary sequence. Write mmm for the number of mistakes made by the master, and W0W_0W0​ and WTW_TWT​ for the initial and final total pool weights. Then

WT≤W0(1+β2)m.W_T\le W_0\left(\frac{1+\beta}{2}\right)^m.WT​≤W0​(21+β​)m.

This is the whole-sequence weight estimate stated before Theorem 2.1, with the value of uuu used in that theorem. It also covers m=0m=0m=0 and a zero final weight.

Preamble
import Mathlib
import Definitions.Def_WeightedMajority_Basic_IsWMRun
Formal statement
namespace WeightedMajority.Basic

/-- The whole-sequence weight estimate preceding Theorem 2.1. -/
theorem weight_potential {n T : ℕ} (β : ℝ) (hβ₀ : 0 ≤ β) (hβ₁ : β < 1)
    (initial : Fin n → ℝ) (hinitial : ∀ i, 0 < initial i)
    (x : Fin T → Fin n → Bool) (label : Fin T → Bool)
    (w : ℕ → Fin n → ℝ) (prediction : Fin T → Bool)
    (hrun : IsWMRun β initial x label w prediction) :
    totalWeight w T ≤ totalWeight w 0 * ((1 + β) / 2) ^ mistakeCount prediction label := by sorry

end WeightedMajority.Basic
Source
Littlestone and Warmuth, The Weighted Majority Algorithm, Information and Computation 108(2) (1994), pp. 220–221, §2, discussion preceding Theorem 2.1; https://doi.org/10.1006/inco.1994.1009
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