Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finitely many positive linear gaps are stable under small perturbations

Proved
finite_linear_gaps_stable

by Harry_Xu · Aug 5, 2026 · Mathlib c5ea003 (Lean v4.30.0)

banditslinear-algebrapartial-monitoringperturbation

Let CCC and III be finite index sets. Suppose every linear functional AcA_cAc​ has value at least ε>0\varepsilon>0ε>0 at uuu. Then all these gaps remain at least ε/2\varepsilon/2ε/2 after a sufficiently small perturbation in a fixed direction qqq:

∃δ>0  ∀∣Δ∣≤δ  ∀c∈C,∑i∈IAc,i(ui+Δqi)≥ε2.\exists\delta>0\;\forall |\Delta|\le\delta\;\forall c\in C, \qquad \sum_{i\in I}A_{c,i}(u_i+\Delta q_i)\ge\frac{\varepsilon}{2}.∃δ>0∀∣Δ∣≤δ∀c∈C,i∈I∑​Ac,i​(ui​+Δqi​)≥2ε​.

The radius is uniform over the finite family. This packages the Hölder/triangle-inequality stability step used when perturbing stochastic bandit environments.

Preamble
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Data.Real.Basic
import Mathlib.Tactic
Formal statement
theorem finite_linear_gaps_stable
    {C I : Type*} [Fintype C] [Fintype I]
    (A : C → I → ℝ) (u q : I → ℝ) (ε : ℝ) (hε : 0 < ε)
    (hgap : ∀ c : C, ε ≤ ∑ i, A c i * u i) :
    ∃ δ : ℝ, 0 < δ ∧ ∀ Δ : ℝ, |Δ| ≤ δ → ∀ c : C,
      ε / 2 ≤ ∑ i, A c i * (u i + Δ * q i) := by sorry
Source
Lattimore and Szepesvári, Bandit Algorithms (Cambridge UP, 2020), Theorem 37.12, Step 3, printed p. 490: the bounds following Eq. (37.9), where the loss gap decreases by at most Δ times an ℓ1 norm.

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