LeanMachineLearning

Bandits.ArrayModel.initAlgFunction๐Ÿ”—

Definition

The initial action is the image of a uniform random variable by this function.

๐Ÿ”—def
Bandits.ArrayModel.initAlgFunction.{u_1, u_2} {๐“ : Type u_1}
  {R : Type u_2} {m๐“ : MeasurableSpace ๐“} {mR : MeasurableSpace R}
  [Nonempty ๐“] [StandardBorelSpace ๐“] (alg : Learning.Algorithm ๐“ R) :
  โ†‘unitInterval โ†’ ๐“
Bandits.ArrayModel.initAlgFunction.{u_1,
    u_2}
  {๐“ : Type u_1} {R : Type u_2}
  {m๐“ : MeasurableSpace ๐“}
  {mR : MeasurableSpace R} [Nonempty ๐“]
  [StandardBorelSpace ๐“]
  (alg : Learning.Algorithm ๐“ R) :
  โ†‘unitInterval โ†’ ๐“

Code

noncomputable def initAlgFunction (alg : Algorithm ๐“ R) : I โ†’ ๐“ := (Measure.exists_measurable_map_eq alg.p0).choose

Actions: Source ยท Open Issue

Meaning last changed in v4.34.0-rc2-1-g439785b (2026-08-23), the 5th 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, 38 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.