Bandits.ArrayModel.measurable_truncRow
No docstring.
-
π : Type u_1DecidableEq π -
π‘ : Type u_2mπ‘ : MeasurableSpace π‘A measurable space is a space equipped with a Ο-algebra.
-
a : π -
m : β
Measurable (truncRow a m)f between measurable spaces is measurable if the preimage of every measurable set is measurable.DecidableEq : Sort u β Sort (max 1 u)Propositional equality is `Decidable` for all elements of a type. In other words, an instance of `DecidableEq Ξ±` is a means of deciding the proposition `a = b` is for all `a b : Ξ±`.
MeasurableSpace : Type u_6 β Type u_6A measurable space is a space equipped with a Ο-algebra.
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.
Measurable : {Ξ± : Type u_1} β {Ξ² : Type u_2} β [MeasurableSpace Ξ±] β [MeasurableSpace Ξ²] β (Ξ± β Ξ²) β PropA function `f` between measurable spaces is measurable if the preimage of every measurable set is measurable.
Bandits.ArrayModel.truncRow : {π : Type u_1} β
{π‘ : Type u_2} β [DecidableEq π] β π β β β Bandits.ArrayModel.probSpace π π‘ β Bandits.ArrayModel.probSpace π π‘Modification of `Ο` in which the rewards of action `a` are read only up to index `m - 1`: in row `a` of the reward array, the entry at index `i` is kept if `i < m` and replaced by the entry at index `m + 1 + i` otherwise. The result does not depend on the coordinate `(m, a)` of the array.Go to its page
Code
lemma measurable_truncRow [DecidableEq π] (a : π) (m : β) :
Measurable (truncRow a m : probSpace π π‘ β probSpace π π‘)Proof
by
refine Measurable.prodMk measurable_fst
(.of_eval fun i β¦ .of_eval fun b β¦ ?_)
by_cases hb : b = a <;> simp only [hb, βreduceIte] <;> fun_propMeaning last changed in v4.35.0-rc2-1-g61e506b (2026-09-22), 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: 2 project declarations, 28 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.