Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1(1) — size of the active pool of WMI₂

Proved
WeightedMajority.InfinitePool.theorem_4_1_part_1

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

online-learningp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1prediction-with-expert-adviceweighted-majority

Let 0≤β<10 \le \beta < 10≤β<1, u=(1+β)/2u = (1+\beta)/2u=(1+β)/2, and let W,W^W, \hat WW,W^ be real functions on the positive integers with W(i)>0W(i) > 0W(i)>0 for all iii, ∑iW(i)<∞\sum_i W(i) < \infty∑i​W(i)<∞, W^(i)≥∑j≥iW(j)\hat W(i) \ge \sum_{j \ge i} W(j)W^(i)≥∑j≥i​W(j) for all iii, and W^(i)→0\hat W(i) \to 0W^(i)→0. Let xt(i)x_t(i)xt​(i), ρt\rho_tρt​ (t=0,…,T−1t = 0, \dots, T-1t=0,…,T−1) be any sequence of predictions of the pool members A1,A2,…A_1, A_2, \dotsA1​,A2​,… and labels, on which AiA_iAi​ makes at most mim_imi​ mistakes, and consider any run of WMI2\mathrm{WMI}_2WMI2​ with parameter β\betaβ on it.

Then at the beginning of every trial ttt the size ltl_tlt​ of the active pool is the minimum lll such that

W^(l+1)≤um+1 W^(1)(1−β)(m+1)(m+2),\hat W(l+1) \le \frac{u^{m+1}\,\hat W(1)}{(1-\beta)(m+1)(m+2)},W^(l+1)≤(1−β)(m+1)(m+2)um+1W^(1)​,

where mmm is the number of mistakes made by WMI2\mathrm{WMI}_2WMI2​ in the trials before ttt.

The algorithm raises lll to the least admissible value at or above its previous value; this statement says that this local rule yields the global minimum, so the active pool is no larger than necessary. Part 1 is used in the proof of part 2 to bound the total weight of the inactive members.

Formalization Note. Minimality is stated as: the inequality holds at ltl_tlt​ and fails at every l′<ltl' < l_tl′<lt​. The pool is indexed by ℕ+, so W^(l+1)\hat W(l+1)W^(l+1) is What (Nat.succPNat l). The hypotheses on W,W^W, \hat WW,W^ are those of Theorem 4.1, without the paper's computability requirement, which the result does not depend on.

Preamble
import Mathlib
import Definitions.Def_WeightedMajority_InfinitePool_IsWMI2Run
Formal statement
namespace WeightedMajority.InfinitePool

/-- Theorem 4.1, part 1 (Littlestone–Warmuth 1994, p. 226): at the beginning of any trial the
size of the active pool of WMI₂ is the minimum `l` with `Ŵ(l + 1) ≤ slack m`, where `m` is the
number of mistakes made in prior trials. -/
theorem theorem_4_1_part_1
    (β : ℝ) (hβ0 : 0 ≤ β) (hβ1 : β < 1)
    (W What : ℕ+ → ℝ) (hW_pos : ∀ i, 0 < W i) (hW_sum : Summable W)
    (hWhat_tail : ∀ i, (∑' j : ℕ+, if i ≤ j then W j else 0) ≤ What i)
    (hWhat_lim : Filter.Tendsto What Filter.atTop (nhds 0))
    {T : ℕ} (x : Fin T → ℕ+ → Bool) (label : Fin T → Bool)
    (mi : ℕ+ → ℕ)
    (hmi : ∀ i, (Finset.univ.filter (fun t : Fin T => x t i ≠ label t)).card ≤ mi i)
    (prediction : Fin T → Bool) (w : ℕ → ℕ+ → ℝ) (l : ℕ → ℕ)
    (hrun : IsWMI2Run β W What x label prediction w l) :
    ∀ t : Fin T,
      What (Nat.succPNat (l t.val)) ≤ slack β What (mistakesBefore prediction label t.val) ∧
      ∀ l' < l t.val,
        slack β What (mistakesBefore prediction label t.val) < What (Nat.succPNat l') := by sorry

end WeightedMajority.InfinitePool
Source
Littlestone, Warmuth, The Weighted Majority Algorithm, Inform. and Comput. 108 (1994), p. 226, Theorem 4.1, part 1
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