Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma G.12 — every sharp optimal action is a reference atom

Proved
IAFTRL.lemma_G_12

by Canzhe Zhao · Nov 17, 2026 · Mathlib 0df444a (Lean v4.33.1)

bandit-algorithmslinear-banditsonline-learning

Setting.

  • A⊆Bd\mathcal A\subseteq\mathbb B^dA⊆Bd is compact and spanning, and B\mathcal BB is a compact generator of it.
  • eee is a surjective enumeration of Qd\mathbb Q^dQd. The candidate bmb_mbm​ is the lexicographically least minimizer of a↦a⊤e(m)a\mapsto a^\top e(m)a↦a⊤e(m) on B\mathcal BB, and JJJ is the set of first occurrences.
  • a∗∈Aa^*\in\mathcal Aa∗∈A is the unique minimizer of a↦a⊤θa\mapsto a^\top\thetaa↦a⊤θ. Sharpness holds: ς∥a−a∗∥S≤(a−a∗)⊤θ\varsigma\|a-a^*\|_{\mathcal S}\le(a-a^*)^\top\thetaς∥a−a∗∥S​≤(a−a∗)⊤θ on Conv A\mathrm{Conv}\,\mathcal AConvA for some ς>0\varsigma>0ς>0.

Claim. There is m∈Jm\in Jm∈J with bm=a∗b_m=a^*bm​=a∗. Hence a∗a^*a∗ is an atom of the reference measure μ\muμ, with μ({a∗})≥πm>0\mu(\{a^*\})\ge\pi_m>0μ({a∗})≥πm​>0.

Proof idea.

  1. Every ϑ\varthetaϑ with ∥ϑ−θ∥A≤ς/2\|\vartheta-\theta\|_{\mathcal A}\le\varsigma/2∥ϑ−θ∥A​≤ς/2 keeps a∗a^*a∗ as the unique minimizer on K\mathcal KK, by duality ∣x⊤z∣≤∥x∥S∥z∥A|x^\top z|\le\|x\|_{\mathcal S}\|z\|_{\mathcal A}∣x⊤z∣≤∥x∥S​∥z∥A​.
  2. Such a ϑ\varthetaϑ can be chosen rational.
  3. The enumeration reaches it, the lexicographic selection then picks a∗a^*a∗, and the first occurrence lies in JJJ.
Preamble
import Mathlib
import Definitions.Def_IAFTRL_LinEnv
import Definitions.Def_IAFTRL_GIAFTRL
Formal statement
namespace IAFTRL

open MeasureTheory

/-- **Lemma G.12 (Every sharp optimal action is a reference atom).** Zhao–Tan, *Best-of-Both-Worlds
FTRL for Linear Bandits* (STOC submission version), Lemma G.12, p.144: "Suppose a parameter has a
unique optimal action `a*` and `ς = inf_{a∈𝒦\{a*}} (a − a*)ᵀθ / ‖a − a*‖_𝒮 > 0`. Then `a* = b_{j*}`
for some finite index `j*`."

For a compact generator `ℬ` of a compact spanning action set `𝒜 ⊆ 𝔹^d`, a surjective enumeration
`e` of `ℚ^d`, and a sharp instance with unique optimal action `a* ∈ 𝒜`, the optimal action is the
candidate `cand ℬ e m` of some first-occurrence index `m ∈ J`; in particular it is an atom of the
reference measure (3.3). -/
theorem lemma_G_12 {d : ℕ} (𝒜 ℬ : Set (Fin d → ℝ)) (e : ℕ → Fin d → ℚ)
    (h𝒜 : IsCompact 𝒜) (hℬ : IsCompact ℬ) (hgen : IsGenerator 𝒜 ℬ)
    (hball : ∀ a ∈ 𝒜, a ⬝ᵥ a ≤ 1) (hspan : Submodule.span ℝ 𝒜 = ⊤)
    (he : Function.Surjective e) (θ astar : Fin d → ℝ) (hastar : astar ∈ 𝒜)
    (huniq : ∀ a ∈ 𝒜, a ≠ astar → astar ⬝ᵥ θ < a ⬝ᵥ θ) (hsharp : IsSharp 𝒜 θ astar) :
    ∃ m ∈ Jset ℬ e, cand ℬ e m = astar := by sorry

end IAFTRL
Source
Zhao–Tan, Best-of-Both-Worlds FTRL for Linear Bandits: The Interplay of Information Acquisition, Corruption, and Geometry (STOC submission version; arXiv:2611.01299), Appendix G.6.2, Lemma G.12, pp. 144–145

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