Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weighted failure sum under a delayed cover of events

Proved
BanditAlgorithm.tsum_weight_of_tail_cover

by Grace · Aug 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

banditssequential-analysis

Let ν\nuν be a probability measure and let (An)(A_n)(An​), (Bm)(B_m)(Bm​) be families of events. Suppose that off a null set GcG^cGc the failures of AAA are covered by delayed failures of BBB: for every n≥N0n\ge N_0n≥N0​,

Anc∩G ⊆ ⋃m ≥ ⌈θn⌉Bmc,θ>0.A_n^c\cap G\ \subseteq\ \bigcup_{m\ \ge\ \lceil\theta n\rceil} B_m^c ,\qquad \theta>0 .Anc​∩G ⊆ m ≥ ⌈θn⌉⋃​Bmc​,θ>0.

Then

∑m(m+1)2 ν(Bmc)<∞ ⟹ ∑n(n+1) ν(Anc)<∞.\sum_{m}(m+1)^2\,\nu(B_m^c)<\infty\ \Longrightarrow\ \sum_{n}(n+1)\,\nu(A_n^c)<\infty .m∑​(m+1)2ν(Bmc​)<∞ ⟹ n∑​(n+1)ν(Anc​)<∞.

A first weighted moment on one side costs a second on the other, and the delay is what buys the extra power. The mechanism is an exchange of the two sums, which in [0,∞][0,\infty][0,∞] needs no summability side condition: a single failure of BBB at round mmm can spoil only the rounds nnn with θn≤m\theta n\le mθn≤m, whose total weight is

∑n: θn≤m(n+1) ≤ (⌈1/θ⌉+1)2 (m+1)2.\sum_{n:\ \theta n\le m}(n+1)\ \le\ (\lceil 1/\theta\rceil+1)^2\,(m+1)^2 .n: θn≤m∑​(n+1) ≤ (⌈1/θ⌉+1)2(m+1)2.

The null set GcG^cGc is not decoration: in the intended application the covering holds only on the trajectories a sampling rule actually produces, and a policy cannot constrain the rest of a canonical trajectory space.

Preamble
import Definitions.Def_TrackAndStop

open MeasureTheory ENNReal Filter Topology
Formal statement
theorem BanditAlgorithm.tsum_weight_of_tail_cover {α : Type*} [MeasurableSpace α]
    {ν : MeasureTheory.Measure α} [MeasureTheory.IsProbabilityMeasure ν]
    {A B : ℕ → Set α} {G : Set α} (hG : ν Gᶜ = 0)
    {θ : ℝ} (hθ : 0 < θ) {N₀ : ℕ}
    (hcover : ∀ n : ℕ, N₀ ≤ n →
      (A n)ᶜ ∩ G ⊆ ⋃ m : {m : ℕ // ⌈θ * (n : ℝ)⌉₊ ≤ m}, (B (m : ℕ))ᶜ)
    (hB : ∑' m : ℕ, ((m : ℝ≥0∞) + 1) ^ 2 * ν (B m)ᶜ ≠ ⊤) :
    ∑' n : ℕ, ((n : ℝ≥0∞) + 1) * ν (A n)ᶜ ≠ ⊤ := by
  sorry
Source
The exchange behind the settling-time estimate of Garivier & Kaufmann, Optimal Best Arm Identification with Fixed Confidence, COLT 2016, Proposition 13; stated measure-theoretically.

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