Bandits.UCB.prob_lcbIndex_ge
Lemma
From the authors
The probability that the lower confidence bound of arm a is above its mean is at most
1 / (n + 1) ^ (c - 1).
Types
-
Ω : Type u_1mΩ : MeasurableSpace ΩA measurable space is a space equipped with a σ-algebra.
Given
-
K : ℕNeZero K -
c : ℝ -
ν : ProbabilityTheory.Kernel (Fin K) ℝA kernel from a measurable spaceαto another measurable spaceβis a measurable functionκ : α → Measure β.ProbabilityTheory.IsMarkovKernel νA kernel is a Markov kernel if every measure in its image is a probability measure. -
P : MeasureTheory.Measure ΩA measure is defined to be an outer measure that is countably additive on measurable sets, with the additional assumption that the outer measure is the canonical extension of the restricted measure.MeasureTheory.IsProbabilityMeasure PA measureμis called a probability measure ifμ univ = 1. -
O : ℕ → Ω → Unit -
A : ℕ → Ω → Fin K -
R : ℕ → Ω → ℝ -
σ2 : NNReal -
alg : Learning.Algorithm Unit (Fin K) ℝA stochastic, sequential algorithm. -
a : Fin K -
n : ℕ
Assuming
-
h : Learning.IsAlgEnvSeq O A R alg (Learning.stationaryEnv ν) PAn algorithm-environment sequence: a sequence of observations, actions and feedbacks generated by an algorithm interacting with an environment. -
hν : ∀ (a : Fin K), ProbabilityTheory.HasSubgaussianMGF (fun x => x - ∫ (x : ℝ), id x ∂ν a) σ2 (ν a)A random variableXhas a sub-Gaussian moment-generating function with parametercwith respect to a measureμif for allt : ℝ,exp (t * X)isμ-integrable and the moment-generating funct… -
hσ2 : σ2 ≠ 0 -
hc : 0 ≤ c
Then
P
{ω |
0 < Learning.pullCount A a n ω ∧ ∫ (x : ℝ), id x ∂ν a ≤ Learning.empMean A R a n ω - ucbWidth A (c * ↑σ2) a n ω} ≤
1 / (↑n + 1) ^ (c - 1)MeasurableSpace : Type u_6 → Type u_6A measurable space is a space equipped with a σ-algebra.
NeZero : {R : Type u_1} → [Zero R] → R → PropA type-class version of `n ≠ 0`.
Nat : TypeThe natural numbers, starting at zero. This type is special-cased by both the kernel and the compiler, and overridden with an efficient implementation. Both use a fast arbitrary-precision arithmetic library (usually [GMP](https://gmplib.org/)); at runtime, `Nat` values that are sufficiently small are unboxed.
Real : TypeThe type `ℝ` of real numbers constructed as equivalence classes of Cauchy sequences of rational numbers.
ProbabilityTheory.IsMarkovKernel : {α : Type u_1} →
{β : Type u_2} → {mα : MeasurableSpace α} → {mβ : MeasurableSpace β} → ProbabilityTheory.Kernel α β → PropA kernel is a Markov kernel if every measure in its image is a probability measure.
ProbabilityTheory.Kernel : (α : Type u_1) → (β : Type u_2) → [MeasurableSpace α] → [MeasurableSpace β] → Type (max u_1 u_2)A kernel from a measurable space `α` to another measurable space `β` is a measurable function `κ : α → Measure β`. The measurable space structure on `MeasureTheory.Measure β` is given by `MeasureTheory.Measure.instMeasurableSpace`. A map `κ : α → MeasureTheory.Measure β` is measurable iff `∀ s : Set β, MeasurableSet s → Measurable (fun a ↦ κ a s)`.
Fin : ℕ → TypeNatural numbers less than some upper bound. In particular, a `Fin n` is a natural number `i` with the constraint that `i < n`. It is the canonical type with `n` elements.
MeasureTheory.IsProbabilityMeasure : {α : Type u_1} → {m0 : MeasurableSpace α} → MeasureTheory.Measure α → PropA measure `μ` is called a probability measure if `μ univ = 1`.
MeasureTheory.Measure : (α : Type u_5) → [MeasurableSpace α] → Type u_5A measure is defined to be an outer measure that is countably additive on measurable sets, with the additional assumption that the outer measure is the canonical extension of the restricted measure. The measure of a set `s`, denoted `μ s`, is an extended nonnegative real. The real-valued version is written `μ.real s`.
Unit : TypeThe canonical type with one element. This element is written `()`. `Unit` has a number of uses: * It can be used to model control flow that returns from a function call without providing other information. * Monadic actions that return `Unit` have side effects without computing values. * In polymorphic types, it can be used to indicate that no data is to be stored in a particular field.
NNReal : TypeNonnegative real numbers, denoted as `ℝ≥0` within the NNReal namespace
Learning.Algorithm : (𝓞 : Type u_5) →
(𝓐 : Type u_6) →
(𝓨 : Type u_7) → [MeasurableSpace 𝓞] → [MeasurableSpace 𝓐] → [MeasurableSpace 𝓨] → Type (max (max u_5 u_6) u_7)A stochastic, sequential algorithm. At each round, it sees an observation in `𝓞`, then takes an action in `𝓐`, and finally receives feedback in `𝓨`. The action is a random function of the past rounds and the current observation.Go to its page
Learning.IsAlgEnvSeq : {𝓞 : Type u_1} →
{𝓐 : Type u_2} →
{𝓨 : Type u_3} →
{Ω : Type u_4} →
{m𝓞 : MeasurableSpace 𝓞} →
{m𝓐 : MeasurableSpace 𝓐} →
{m𝓨 : MeasurableSpace 𝓨} →
{mΩ : MeasurableSpace Ω} →
(ℕ → Ω → 𝓞) →
(ℕ → Ω → 𝓐) →
(ℕ → Ω → 𝓨) →
Learning.Algorithm 𝓞 𝓐 𝓨 →…An algorithm-environment sequence: a sequence of observations, actions and feedbacks generated by an algorithm interacting with an environment.Go to its page
Learning.stationaryEnv : {𝓐 : Type u_2} →
{𝓨 : Type u_3} →
{m𝓐 : MeasurableSpace 𝓐} →
{m𝓨 : MeasurableSpace 𝓨} →
(ν : ProbabilityTheory.Kernel 𝓐 𝓨) → [ProbabilityTheory.IsMarkovKernel ν] → Learning.Environment Unit 𝓐 𝓨A stationary environment without observations, in which the distribution of the next feedback depends only on the last action.Go to its page
ProbabilityTheory.HasSubgaussianMGF : {Ω : Type u_1} →
{mΩ : MeasurableSpace Ω} →
(Ω → ℝ) → NNReal → autoParam (MeasureTheory.Measure Ω) ProbabilityTheory.HasSubgaussianMGF._auto_1 → PropA random variable `X` has a sub-Gaussian moment-generating function with parameter `c` with respect to a measure `μ` if for all `t : ℝ`, `exp (t * X)` is `μ`-integrable and the moment-generating function of `X` is bounded by `exp (c * t ^ 2 / 2)` for all `t : ℝ`. This implies in particular that `X` has expectation 0. This is equivalent to `Kernel.HasSubgaussianMGF X c (Kernel.const Unit μ) (Measure.dirac ())`, as proved in `HasSubgaussianMGF_iff_kernel`. Properties about sub-Gaussian moment-generating functions should be proved first for `Kernel.HasSubgaussianMGF` when possible.
HSub.hSub : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HSub α β γ] → α → β → γ`a - b` computes the difference of `a` and `b`. The meaning of this notation is type-dependent. * For natural numbers, this operator saturates at 0: `a - b = 0` when `a ≤ b`. Conventions for notations in identifiers: * The recommended spelling of `-` in identifiers is `sub` (when used as a binary operator).
MeasureTheory.integral : {α : Type u_6} →
{G : Type u_7} →
[inst : NormedAddCommGroup G] → [NormedSpace ℝ G] → {x : MeasurableSpace α} → MeasureTheory.Measure α → (α → G) → GThe Bochner integral
id : {α : Sort u} → α → αThe identity function. `id` takes an implicit argument `α : Sort u` (a type in any universe), and an argument `a : α`, and returns `a`. Although this may look like a useless function, one application of the identity function is to explicitly put a type on an expression. If `e` has type `T`, and `T'` is definitionally equal to `T`, then `@id T' e` typechecks, and Lean knows that this expression has type `T'` rather than `T`. This can make a difference for typeclass inference, since `T` and `T'` may have different typeclass instances on them. `show T' from e` is sugar for an `@id T' e` expression.
Ne : {α : Sort u} → α → α → Prop`a ≠ b`, or `Ne a b` is defined as `¬ (a = b)` or `a = b → False`, and asserts that `a` and `b` are not equal. Conventions for notations in identifiers: * The recommended spelling of `≠` in identifiers is `ne`.
LE.le : {α : Type u} → [self : LE α] → α → α → PropThe less-equal relation: `x ≤ y` Conventions for notations in identifiers: * The recommended spelling of `≤` in identifiers is `le`.
Set.ofPred : {α : Type u} → (α → Prop) → Set αTurn a predicate `p : α → Prop` into a set, also written as `{x | p x}`LT.lt : {α : Type u} → [self : LT α] → α → α → PropThe less-than relation: `x < y` Conventions for notations in identifiers: * The recommended spelling of `<` in identifiers is `lt`.
Learning.pullCount : {𝓐 : Type u_2} → {Ω : Type u_4} → [DecidableEq 𝓐] → (ℕ → Ω → 𝓐) → 𝓐 → ℕ → Ω → ℕNumber of times action `a` was chosen up to time `t` (excluding `t`).Go to its page
And : Prop → Prop → Prop`And a b`, or `a ∧ b`, is the conjunction of propositions. It can be constructed and destructed like a pair: if `ha : a` and `hb : b` then `⟨ha, hb⟩ : a ∧ b`, and if `h : a ∧ b` then `h.left : a` and `h.right : b`. Conventions for notations in identifiers: * The recommended spelling of `∧` in identifiers is `and`.
Learning.empMean : {𝓐 : Type u_2} → {Ω : Type u_4} → [DecidableEq 𝓐] → (ℕ → Ω → 𝓐) → (ℕ → Ω → ℝ) → 𝓐 → ℕ → Ω → ℝEmpirical mean reward obtained when pulling action `a` up to time `t` (exclusive).Go to its page
Bandits.UCB.ucbWidth : {K : ℕ} → {Ω : Type u_1} → (ℕ → Ω → Fin K) → ℝ → Fin K → ℕ → Ω → ℝThe exploration bonus of the UCB algorithm, which corresponds to the width of a confidence interval.Go to its page
HMul.hMul : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HMul α β γ] → α → β → γ`a * b` computes the product of `a` and `b`. The meaning of this notation is type-dependent. Conventions for notations in identifiers: * The recommended spelling of `*` in identifiers is `mul`.
HDiv.hDiv : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HDiv α β γ] → α → β → γ`a / b` computes the result of dividing `a` by `b`. The meaning of this notation is type-dependent. * For most types like `Nat`, `Int`, `Rat`, `Real`, `a / 0` is defined to be `0`. * For `Nat`, `a / b` rounds downwards. * For `Int`, `a / b` rounds downwards if `b` is positive or upwards if `b` is negative. It is implemented as `Int.ediv`, the unique function satisfying `a % b + b * (a / b) = a` and `0 ≤ a % b < natAbs b` for `b ≠ 0`. Other rounding conventions are available using the functions `Int.fdiv` (floor rounding) and `Int.tdiv` (truncation rounding). * For `Float`, `a / 0` follows the IEEE 754 semantics for division, usually resulting in `inf` or `nan`. Conventions for notations in identifiers: * The recommended spelling of `/` in identifiers is `div`.
HAdd.hAdd : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HAdd α β γ] → α → β → γ`a + b` computes the sum of `a` and `b`. The meaning of this notation is type-dependent. Conventions for notations in identifiers: * The recommended spelling of `+` in identifiers is `add`.
HPow.hPow : {α : Type u} → {β : Type v} → {γ : outParam (Type w)} → [self : HPow α β γ] → α → β → γ`a ^ b` computes `a` to the power of `b`. The meaning of this notation is type-dependent. Conventions for notations in identifiers: * The recommended spelling of `^` in identifiers is `pow`.
Code
lemma prob_lcbIndex_ge {alg : Algorithm Unit (Fin K) ℝ}
(h : IsAlgEnvSeq O A R alg (stationaryEnv ν) P)
(hν : ∀ a, HasSubgaussianMGF (fun x ↦ x - (ν a)[id]) σ2 (ν a))
(hσ2 : σ2 ≠ 0) (hc : 0 ≤ c) (a : Fin K) (n : ℕ) :
P {ω | 0 < pullCount A a n ω ∧
(ν a)[id] ≤ empMean A R a n ω - ucbWidth A (c * σ2) a n ω} ≤ 1 / (n + 1) ^ (c - 1)Proof
by
have h_le := prob_pullCount_pos_and_le h a n
(p := fun k x ↦ (ν a)[id] ≤ x / k - √(2 * c * σ2 * log (n + 1) / k))
(B := 1 / (n + 1) ^ c) ?_ ?_
rotate_left
· simp only [Nat.cast_nonneg, sqrt_div', id_eq]
fun_prop
· exact fun k hk ↦ prob_avg_sub_sqrt_log_ge hν hσ2 hc a n k hk
simp only [mul_assoc] at h_le
simp only [empMean, ucbWidth, mul_assoc]
calc _ ≤ (n : ℝ≥0∞) * (1 / (n + 1) ^ c) := h_le
_ ≤ (n + 1) * (1 : ℝ≥0∞) / (n + 1) ^ c := by
rw [mul_one_div, mul_one]
gcongr
exact le_self_add
_ = 1 / (n + 1) ^ (c - 1) := by
simp only [mul_one, one_div]
rw [ENNReal.rpow_sub _ _ (by simp) (by finiteness), ENNReal.rpow_one, div_eq_mul_inv,
ENNReal.div_eq_inv_mul, ENNReal.mul_inv (by simp) (by simp), inv_inv]New in v4.34.0-rc2-90-gdde3322 (2026-09-16), and its meaning has not changed since.
Self-contained, with its dependencies inlined and proofs replaced by sorry: download the raw file · open it in the Lean web editor.
Dependency graph
Audit surface: 12 project declarations, 111 external constants
✓ Proved: no sorry anywhere in its closure
This is the tool's own reading of one build's recorded axioms, and it is not robust against an author who wants it to pass. Checking meant to be relied on should go through Comparator, which replays the proof through the kernel from an export against an explicit list of permitted axioms.