LeanMachineLearning

Bandits.ETC.measurable_nextArm๐Ÿ”—

Lemma

The next arm pulled by ETC is chosen in a measurable way.

๐Ÿ”—theorem
Bandits.ETC.measurable_nextArm {K : โ„•} (hK : 0 < K) (m n : โ„•) :
  Measurable (nextArm hK m n)
Bandits.ETC.measurable_nextArm {K : โ„•}
  (hK : 0 < K) (m n : โ„•) :
  Measurable (nextArm hK m n)

Code

lemma ETC.measurable_nextArm (hK : 0 < K) (m n : โ„•) : Measurable (nextArm hK m n)
Proof
by
  have : Nonempty (Fin K) := Fin.pos_iff_nonempty.mp hK
  unfold nextArm
  simp only [dite_eq_ite]
  refine Measurable.ite (by simp) (by fun_prop) ?_
  refine Measurable.ite (by simp) ?_ (by fun_prop)
  fun_prop

Actions: Source ยท Open Issue

Meaning last changed in v4.34.0-rc2-14-gf86702d (2026-08-25), the 2th recorded change.

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: 8 project declarations, 81 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.