Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 2 — total-weight contraction on a WM mistake

Proved
WeightedMajority.Basic.mistake_weight_step

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

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

Let WM use factor 0≤β<10\le\beta<10≤β<1 and strictly positive initial weights on a finite pool. Consider any finite binary sequence and any legal WM run. If the master errs on trial ttt, the total pool weight after that trial is at most (1+β)/2(1+\beta)/2(1+β)/2 times its weight before the trial:

Wt+1≤1+β2Wt.W_{t+1}\le \frac{1+\beta}{2}W_t.Wt+1​≤21+β​Wt​.

This is the local weight estimate in the proof of Theorem 2.1. It applies to either permitted tie choice.

Formalization Note The statement uses a weight inequality, which remains meaningful when a later weight is zero; no division by the current weight is needed.

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

/-- The per-mistake weight estimate used in the proof of Theorem 2.1. -/
theorem mistake_weight_step {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)
    (t : Fin T) (hmistake : prediction t ≠ label t) :
    totalWeight w (t.val + 1) ≤ ((1 + β) / 2) * totalWeight w t.val := by sorry

end WeightedMajority.Basic
Source
Littlestone and Warmuth, The Weighted Majority Algorithm, Information and Computation 108(2) (1994), p. 221, §2, proof of 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